LISS 2014 pp 1641-1646 | Cite as

A Hybrid Optimization Algorithm for Travelling Salesman Problem Based on Geographical Information System for Logistics Distribution

Conference paper


This paper represents a hybrid algorithm for travelling salesman problem. The main idea of the hybrid algorithm is to harness the strong global search ability of the genetic algorithm and the high local search capability of the simulated annealing algorithm. The real distance between customers has been used on the basis of GIS in order to make the result more suitable to be used in real-life. The algorithm has been tested on standard examples and it showed that the algorithm proposed in this paper has improved the results.


Travelling salesman problem Genetic-simulated annealing algorithm Geographical information system 



This research is supported by the National Natural Science Foundation of China (71172168, 71241025), the fundamental Research Founds for the Central Universities (FRFSD13–003D, FRFSD130304)


  1. Agarwal Y, Mathur K, Salkin H (1989) A set-partitioning based exact algorithm for the vehicle routing problem. Networks 19(7):731–739CrossRefGoogle Scholar
  2. Badeau P, Guertin F, Gendreau M, Potvin JY, Taillard E (1997) Parallel tabu search heuristic for the vehicle routing problem with time windows. Transp Res C-Emerg 5(2):109–122CrossRefGoogle Scholar
  3. Balinski M, Quandt R (1964) On an integer program for a delivery problem. Oper Res 12(2):300–304CrossRefGoogle Scholar
  4. Christofides N, Mingozzi A, Toth P (1981) Exact algorithms for the vehicle routing problem based on spanning tree and shortest path relaxations. Math Program 20(1):255–282CrossRefGoogle Scholar
  5. Clarke G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12(4):568–581CrossRefGoogle Scholar
  6. Dantzig G, Ramser R (1959) The truck dispatching problem. Manage Sci 6(1):80–911CrossRefGoogle Scholar
  7. Gendreau M, Hertz A, Laporte G (1998) A generalized insertion heuristic for the travelling salesman problem with time windows. Oper Res 46(3):330–335CrossRefGoogle Scholar
  8. Gendreau M, Laporte G, Vigo D (1999) Heuristic for the traveling salesman problem with pickup and delivery. Comput Oper Res 26(7):699–714CrossRefGoogle Scholar
  9. Laporte G, Mercure H, Nobert Y (1986) An exact algorithm for the asymmetrical capacitated vehicle routing problem. Networks 16(1):33–46CrossRefGoogle Scholar
  10. Potvin JY, Rousseau J (1993) A parallel route building algorithm for the vehicle routing and scheduling problem with time windows. Eur J Oper Res 66(3):331–340CrossRefGoogle Scholar
  11. Tarantilis CD, Ioannou G, Kiranoudis CT, Prasdacos GP (2005) Solving the open vehicle routing problem via single parameter meta-heuristic algorithm. J Oper Res Soc 56(5):588–596CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2015

Authors and Affiliations

  1. 1.Dongling School of Economics and ManagementUniversity of Science and TechnologyBeijingChina
  2. 2.Tobacco Company of Baotou CityInner MongoliaChina

Personalised recommendations