Title :
Integrating Relative Coordinates with Simulated Annealing to Solve a Traveling Salesman Problem
Author :
Xiaojun Liu ; Bin Zhang ; Fangying Du
Author_Institution :
Sch. of Bus., Macau Univ. of Sci. & Technol., Taipa, China
Abstract :
Traveling salesman problem is one of most famous problems in Combinatorial Optimization. This paper presents a case study of ANJI-CEVA AUTOMOTIVE LOGISTICS CO., LTD. We formulated their problem as a traveling salesman problem and, with the use of relative coordinates of the locations as problem parameters, solved the traveling salesman problem by simulated annealing and our final solution is shown to be a circular path.
Keywords :
logistics; simulated annealing; travelling salesman problems; Anji-Ceva Automotive Logistics Co., Ltd; combinatorial optimization; relative coordinate integration; simulated annealing; travelling salesman problem; Cities and towns; Educational institutions; Logistics; Simulated annealing; Temperature; Traveling salesman problems; citys relative coordinates; simulated annealing method; traveling salesman problem;
Conference_Titel :
Computational Sciences and Optimization (CSO), 2014 Seventh International Joint Conference on
Conference_Location :
Beijing
Print_ISBN :
978-1-4799-5371-4
DOI :
10.1109/CSO.2014.39
