Journal of Korean Institute of Industrial Engineers (대한산업공학회지)

Korean Institute of Industrial Engineers (대한산업공학회)
권호 표지

An Iterative Insertion Algorithm and a Hybrid Meta Heuristic for the Traveling Salesman Problem with Time Windows

시간제약이 있는 외판원 문제를 위한 메타휴리스틱 기법

  • Kim, Byung-In (Department of Industrial and Management Engineering, Advanced Product & Production Technology Center, POSTECH)
  • 김병인 (포항공과대학교 산업경영공학과, 제품생산기술연구소)
  • Published : 2007.03.31
Download PDF
⟨ Previous Next ⟩

Abstract

This paper presents a heuristic algorithm for the traveling salesman problem with time windows (TSPTW). Aniterative insertion algorithm as a constructive search heuristic and a hybrid meta heuristic combining simulatedannealing and tabu search with the randomized selection of 2-interchange and a simple move operator as animproving search heuristic are proposed, Computational tests performed on 400 benchmark problem instancesshow that the proposed algorithm generates optimal or near-optimal solutions in most cases. New best knownheuristic values for many benchmark problem sets were obtained using the proposed approach.

Keywords

References

  1. Calvo, R. W. (2000), A new heuristic for the traveling salesman problem with time windows, Transportation Science, 34(1), 113-124 https://doi.org/10.1287/trsc.34.1.113.12284
  2. Carlton, W. B. and Barnes, J. W. (1996), Solving the traveling salesman problem with time windows using tabu search, IIE Transactions, 28, 617-629 https://doi.org/10.1080/15458830.1996.11770707
  3. Dumas, Y., Desrosiers, J., Gelinas, E. and Solomon, M. M. (1995), An optimal algorithm for the traveling salesman problem with time windows, Operations Research, 43(2), 367-371 https://doi.org/10.1287/opre.43.2.367
  4. Gendreau, M., Hertz, A. and Laporte, G. (1992), New insertion and postoptimization procedures for the traveling salesman problem, Operations Research, 40(6), 1086-1094 https://doi.org/10.1287/opre.40.1.S86
  5. Gendreau, M., Hertz, A. and Laporte, G. and Stan, M. (1998), A generalized insertion heuristic for the traveling salesman problem with time windows, Operations Research, 46(3), 330-335 https://doi.org/10.1287/opre.46.3.330
  6. Langevin, A., Desrochers, M., Desrosiers, J., Gelinas, S. and Soumis, F. (1993), A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows, Networks, 23, 631-640 https://doi.org/10.1002/net.3230230706
  7. Nanry, W. P. and Barnes, J. W. (2000). Solving the pickup and delivery problem with time windows using reactive tabu search, Transportation Research Part B, 34, 107-121 https://doi.org/10.1016/S0191-2615(99)00016-8
  8. Ohlmann, J. W. and Thomas, B. W. (2006), A compressed annealing approach to the traveling salesman problem with time windows, INFORMS Journal on Computing (to appear)
  9. Or, I. (1976), Traveling Salesman-type Combinatorial Problems and Their Relation to the Logistics of Blood Banking.Ph.D. Dissertation, Dept. of Industrial Engineering and Management Sciences, Northwestern University
  10. Potvin, J. Y. and Bengio, S. (1996), The vehicle routing problem with time windows. II. genetic search, INFORMS Journal on Computing, 8, 165-172 https://doi.org/10.1287/ijoc.8.2.165
  11. Savelsbergh, M. W. P. (1985), Local search in routing problems with time windows, Annals of Operations Research, 4, 285-305 https://doi.org/10.1007/BF02022044
  12. Solomon, M. M. (1987), Algorithms for the vehicle routing and scheduling problem with time window constraints, Operations Research, 35(2), 254-265 https://doi.org/10.1287/opre.35.2.254
  13. Taillard, E. D., Badeau, P., Gendreau, M., Guertin, F. and Potvin, J. Y. (1997), A tabu search heuristic for the vehicle routing problem with soft time windows, Transportation Science, 31(1),170-186