산업경영시스템학회지 (Journal of Korean Society of Industrial and Systems Engineering)

  • 제33권3호
  • /
  • Pages.114-122
  • /
  • 2010
  • /
  • 2005-0461(pISSN)
  • /
  • 2287-7975(eISSN)
한국산업경영시스템학회 (Society of Korea Industrial and System Engineering)
권호 표지

이종 확률적 외판원 문제를 위한 최소 평균거리 삽입 및 집단적 지역 탐색 알고리듬

A Minimum Expected Length Insertion Algorithm and Grouping Local Search for the Heterogeneous Probabilistic Traveling Salesman Problem

  • 김승모 (한국외국어대학교 산업경영공학과) ;
  • 최기석 (한국외국어대학교 산업경영공학과)
  • Kim, Seung-Mo (Department of Industrial and management Engineering, Hankuk University of Foreign Studies) ;
  • Choi, Ki-Seok (Department of Industrial and management Engineering, Hankuk University of Foreign Studies)
  • 투고 : 2010.07.19
  • 심사 : 2010.09.13
  • 발행 : 2010.09.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

The Probabilistic Traveling Salesman Problem (PTSP) is an important topic in the study of traveling salesman problem and stochastic routing problem. The goal of PTSP is to find a priori tour visiting all customers with a minimum expected length, which simply skips customers not requiring a visit in the tour. There are many existing researches for the homogeneous version of the problem, where all customers have an identical visiting probability. Otherwise, the researches for the heterogeneous version of the problem are insufficient and most of them have focused on search base algorithms. In this paper, we propose a simple construction algorithm to solve the heterogeneous PTSP. The Minimum Expected Length Insertion (MELI) algorithm is a construction algorithm and consists of processes to decide a sequence of visiting customers by inserting the one, with the minimum expected length between two customers already in the sequence. Compared with optimal solutions, the MELI algorithm generates better solutions when the average probability is low and the customers have different visiting probabilities. We also suggest a local search method which improves the initial solution generated by the MELI algorithm.

키워드

참고문헌

  1. Bertsimas, D. J.; "Probabilistic Combinatorial Optimization Problem," Ph.D. Dissertation, Massachusetts Institute of Technology, MA, 1988.
  2. Bertsimas, D. J. and Howell, L.; "Further Results on the Probabilistic Traveling Salesman Problem," European Journal of Operational Research, 65(1) : 68-95, 1993. https://doi.org/10.1016/0377-2217(93)90145-D
  3. Bianchi, L., Knowles, J., and Bowler, N.; "Local Search for the Probabilistic Traveling Salesman Problem : Correction to the 2-p-opt and I-shift Algorithms," European Journal of Operations Research, 162(1) : 206-219, 2005. https://doi.org/10.1016/j.ejor.2003.10.016
  4. Bianchi, L.; "Ant Colony Optimization and Local Search for the Probabilistic Traveling Salesman Problem : A Case Study in Stochastic Combinatorial Optimization," Ph.D. Dissertation, Universite Libre de Bruxelles, Brussels, Belgium, 2006.
  5. Bowler, N. E., Fink, T. M. A., and Ball, R. C.; ''Characterization of the Probabilistic Traveling Salesman Problem," Physical Review E, 68 : 036703, 2003 https://doi.org/10.1103/PhysRevE.68.036703
  6. Clarke, G. and Wright, J. W.; "Scheduling of Vehicles from a Central Depot to a Number of Delivery Point," Operations Research, 12 : 568-581, 1964. https://doi.org/10.1287/opre.12.4.568
  7. Held, M. and Karp, R. M.; ''The Traveling Salesman Problem and Minimal Spanning Trees," Operations Research, 18(6) : 1138-1162, 1970. https://doi.org/10.1287/opre.18.6.1138
  8. Jaillet, P.; "Probabilistic Traveling Salesman Problems," Ph. D. Dissertation, Massachusetts Institute of Technology, MA, USA, 1985.
  9. Jaillet, P.; "Stochastic Routing Problems," Advanced School on Stochastic in Combinatorial Optimization, Andreatta, G., Mason, F., Serafini, P. (Ed.), World Scientific Publisher, Singapore, 192-213, 1987.
  10. Jaillet, P.; "A Priori Solution of a Traveling Salesman Problem in which a Random Subset of the Customers are Visited," Operations Research, 36 : 929-936. 1988. https://doi.org/10.1287/opre.36.6.929
  11. Jaillet, P. and Odoni, A. R.; "The Probabilistic Vehicle Routing Problem," Vehicle Routing: Methods and Studies, Golden, B. L., Assad, A. A. (Ed.), North Holland, Amsterdam, 293-318, 1988.
  12. Laporte, G., Louveaux, F., and Mercure, H.; "A Priori Optimization of the Probabilistic Traveling Salesman Problem," Operations Research, 42 : 543-549. 1994.
  13. Liu, Y.-H., Jou, R.-C., and Wang, C.-C.; "Genetic Algorithms for the Probabilistic Traveling Salesman Problem," Proceedings of the Conference on E-Logistics, Taoyuan, Taiwan, 77-82. 2004.
  14. Liu, Y.-H.; "A Hybrid Scatter Search for the Probabilistic Traveling Salesman Problem," Computers and Operations Research, 34 : 2949-2963, 2007. https://doi.org/10.1016/j.cor.2005.11.008
  15. Marinakis, Y., Migdalas, A., and Pardalos, P. M.; "Expanding Neighborhood Search-GRASP for the Probabilistic Traveling Salesman Problem," Optimization Letters, 2(3) :351-361, 2008. https://doi.org/10.1007/s11590-007-0064-3