A novel traveling salesman problem solution by accelerated evolutionary computation with approximated cost matrix in an industrial application

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

We propose an industrial technological solution for the traveling salesman problem (TSP) by using the approximated cost matrix and an accelerated evolutionary computation (EC) algorithm. The cost matrix used by theoretical research on TSP mostly is the Euclidean distance between cities, which is not proper to the real condition in the industrial product's application. In this paper, we propose an approximation approach on cost matrix based on the geographic information data, so that it approaches to the actual cost matrix. Slow convergence is the main issue of EC. We propose an accelerating EC convergence approach by Lagrange interpolation method to approximate the EC search space landscape, and do a local search near the related best individuals' region. The experimental result shows that the EC convergence is accelerated, and this acceleration approach is also used in an actual TSP application in a vehicle navigation system, in which the product performance is improved by the accelerated EC approach with the approximated cost matrix.

Original languageEnglish
Title of host publicationProceedings of the 2011 International Conference of Soft Computing and Pattern Recognition, SoCPaR 2011
Pages39-44
Number of pages6
DOIs
Publication statusPublished - Dec 21 2011
Event2011 International Conference of Soft Computing and Pattern Recognition, SoCPaR 2011 - Dalian, China
Duration: Oct 14 2011Oct 16 2011

Publication series

NameProceedings of the 2011 International Conference of Soft Computing and Pattern Recognition, SoCPaR 2011

Other

Other2011 International Conference of Soft Computing and Pattern Recognition, SoCPaR 2011
CountryChina
CityDalian
Period10/14/1110/16/11

Fingerprint

Traveling salesman problem
Evolutionary algorithms
Industrial applications
Costs
Navigation systems
Interpolation

All Science Journal Classification (ASJC) codes

  • Computer Vision and Pattern Recognition
  • Software

Cite this

Pei, Y., & Takagi, H. (2011). A novel traveling salesman problem solution by accelerated evolutionary computation with approximated cost matrix in an industrial application. In Proceedings of the 2011 International Conference of Soft Computing and Pattern Recognition, SoCPaR 2011 (pp. 39-44). [6089092] (Proceedings of the 2011 International Conference of Soft Computing and Pattern Recognition, SoCPaR 2011). https://doi.org/10.1109/SoCPaR.2011.6089092

A novel traveling salesman problem solution by accelerated evolutionary computation with approximated cost matrix in an industrial application. / Pei, Yan; Takagi, Hideyuki.

Proceedings of the 2011 International Conference of Soft Computing and Pattern Recognition, SoCPaR 2011. 2011. p. 39-44 6089092 (Proceedings of the 2011 International Conference of Soft Computing and Pattern Recognition, SoCPaR 2011).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Pei, Y & Takagi, H 2011, A novel traveling salesman problem solution by accelerated evolutionary computation with approximated cost matrix in an industrial application. in Proceedings of the 2011 International Conference of Soft Computing and Pattern Recognition, SoCPaR 2011., 6089092, Proceedings of the 2011 International Conference of Soft Computing and Pattern Recognition, SoCPaR 2011, pp. 39-44, 2011 International Conference of Soft Computing and Pattern Recognition, SoCPaR 2011, Dalian, China, 10/14/11. https://doi.org/10.1109/SoCPaR.2011.6089092
Pei Y, Takagi H. A novel traveling salesman problem solution by accelerated evolutionary computation with approximated cost matrix in an industrial application. In Proceedings of the 2011 International Conference of Soft Computing and Pattern Recognition, SoCPaR 2011. 2011. p. 39-44. 6089092. (Proceedings of the 2011 International Conference of Soft Computing and Pattern Recognition, SoCPaR 2011). https://doi.org/10.1109/SoCPaR.2011.6089092
Pei, Yan ; Takagi, Hideyuki. / A novel traveling salesman problem solution by accelerated evolutionary computation with approximated cost matrix in an industrial application. Proceedings of the 2011 International Conference of Soft Computing and Pattern Recognition, SoCPaR 2011. 2011. pp. 39-44 (Proceedings of the 2011 International Conference of Soft Computing and Pattern Recognition, SoCPaR 2011).
@inproceedings{32e1dbdb61df4df7879762b96422b235,
title = "A novel traveling salesman problem solution by accelerated evolutionary computation with approximated cost matrix in an industrial application",
abstract = "We propose an industrial technological solution for the traveling salesman problem (TSP) by using the approximated cost matrix and an accelerated evolutionary computation (EC) algorithm. The cost matrix used by theoretical research on TSP mostly is the Euclidean distance between cities, which is not proper to the real condition in the industrial product's application. In this paper, we propose an approximation approach on cost matrix based on the geographic information data, so that it approaches to the actual cost matrix. Slow convergence is the main issue of EC. We propose an accelerating EC convergence approach by Lagrange interpolation method to approximate the EC search space landscape, and do a local search near the related best individuals' region. The experimental result shows that the EC convergence is accelerated, and this acceleration approach is also used in an actual TSP application in a vehicle navigation system, in which the product performance is improved by the accelerated EC approach with the approximated cost matrix.",
author = "Yan Pei and Hideyuki Takagi",
year = "2011",
month = "12",
day = "21",
doi = "10.1109/SoCPaR.2011.6089092",
language = "English",
isbn = "9781457711947",
series = "Proceedings of the 2011 International Conference of Soft Computing and Pattern Recognition, SoCPaR 2011",
pages = "39--44",
booktitle = "Proceedings of the 2011 International Conference of Soft Computing and Pattern Recognition, SoCPaR 2011",

}

TY - GEN

T1 - A novel traveling salesman problem solution by accelerated evolutionary computation with approximated cost matrix in an industrial application

AU - Pei, Yan

AU - Takagi, Hideyuki

PY - 2011/12/21

Y1 - 2011/12/21

N2 - We propose an industrial technological solution for the traveling salesman problem (TSP) by using the approximated cost matrix and an accelerated evolutionary computation (EC) algorithm. The cost matrix used by theoretical research on TSP mostly is the Euclidean distance between cities, which is not proper to the real condition in the industrial product's application. In this paper, we propose an approximation approach on cost matrix based on the geographic information data, so that it approaches to the actual cost matrix. Slow convergence is the main issue of EC. We propose an accelerating EC convergence approach by Lagrange interpolation method to approximate the EC search space landscape, and do a local search near the related best individuals' region. The experimental result shows that the EC convergence is accelerated, and this acceleration approach is also used in an actual TSP application in a vehicle navigation system, in which the product performance is improved by the accelerated EC approach with the approximated cost matrix.

AB - We propose an industrial technological solution for the traveling salesman problem (TSP) by using the approximated cost matrix and an accelerated evolutionary computation (EC) algorithm. The cost matrix used by theoretical research on TSP mostly is the Euclidean distance between cities, which is not proper to the real condition in the industrial product's application. In this paper, we propose an approximation approach on cost matrix based on the geographic information data, so that it approaches to the actual cost matrix. Slow convergence is the main issue of EC. We propose an accelerating EC convergence approach by Lagrange interpolation method to approximate the EC search space landscape, and do a local search near the related best individuals' region. The experimental result shows that the EC convergence is accelerated, and this acceleration approach is also used in an actual TSP application in a vehicle navigation system, in which the product performance is improved by the accelerated EC approach with the approximated cost matrix.

UR - http://www.scopus.com/inward/record.url?scp=83655202620&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=83655202620&partnerID=8YFLogxK

U2 - 10.1109/SoCPaR.2011.6089092

DO - 10.1109/SoCPaR.2011.6089092

M3 - Conference contribution

AN - SCOPUS:83655202620

SN - 9781457711947

T3 - Proceedings of the 2011 International Conference of Soft Computing and Pattern Recognition, SoCPaR 2011

SP - 39

EP - 44

BT - Proceedings of the 2011 International Conference of Soft Computing and Pattern Recognition, SoCPaR 2011

ER -