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

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

A Heuristic Algorithm for Multi-path Orienteering Problem with Capacity Constraint

용량제약이 있는 다경로 오리엔티어링 문제의 해법에 관한 연구

  • 황학 (한국과학기술원 산업공학과) ;
  • 박금애 (삼성카드) ;
  • 오용희 (대진대학교 산업시스템공학과)
  • Published : 2007.09.30
Download PDF
⟨ Previous Next ⟩

Abstract

This study deals with a type of vehicle routing problem faced by manager of some department stores during peak sales periods. The problem is to find a set of traveling paths of vehicles that leave a department store and arrive at a destination specified for each vehicle after visiting customers without violating time and capacity constraints. The mathematical model is formulated with the objective of maximizing the sum of the rewards collected by each vehicle. Since the problem is known to be NP-hard, a heuristic algorithm is developed to find the solution. The performance of the algorithm is compared with the optimum solutions obtained from CPLEX for small size problems and a priority-based Genetic Algorithm for large size problems.

Keywords

References

  1. Butt, S. E. and Cavalier, T. M. (1994), A heuristic for the multiple tour maximum collection problem, Computers and Operations Research, 21, 101-111 https://doi.org/10.1016/0305-0548(94)90065-5
  2. Butt, S. E. and Ryan, D. M. (1999), An optimal solution procedure for the multiple tour maximum collection problem using column generation, Computers and Operations Research, 26, 427-441 https://doi.org/10.1016/S0305-0548(98)00071-9
  3. Chao, I., Golden, B. L., and Wasil, E. A. (1996), The team orienteering problem, European Journal of Operational Research, 88, 464-474 https://doi.org/10.1016/0377-2217(94)00289-4
  4. Chao, I., Golden, B. L., and Wasil, E. A. (1996), A fast and effective heuristic for the orienteering problem, European Journal of Operational Research, 88, 475-489 https://doi.org/10.1016/0377-2217(95)00035-6
  5. Deitch, R. and Ladany, S. P. (2000), The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm, European Journal of Operational Research, 127, 69-77 https://doi.org/10.1016/S0377-2217(99)00323-9
  6. Fischetti, M., Gonzalez, J. J. S., and Toth, P. (1998), Solving the orienteering problem through branch-and-cut, INFORMS Journal on Computing, 10, 133-148 https://doi.org/10.1287/ijoc.10.2.133
  7. Golden, B. L., Levy, L., and Vohra, R. (1987), The orienteering problem, Naval Research Logistics, 34, 307-318 https://doi.org/10.1002/1520-6750(198706)34:3<307::AID-NAV3220340302>3.0.CO;2-D
  8. Golden, B. L., Wang, Q., and Liu, L. (1988), A multifaceted heuristic for the orienteering problem, Naval Research Logistics, 35, 359-366 https://doi.org/10.1002/1520-6750(198806)35:3<359::AID-NAV3220350305>3.0.CO;2-H
  9. Hayes, M. and Norman, J. M. (1984), Dynamic programming in orienteering: Route choice and the siting of controls, Journal of the Operational Research Society, 35, 791-796 https://doi.org/10.1057/jors.1984.161
  10. Hwang, H., Park, G. A., and Gen, M. (2006), A priority based genetic algorithm for a variant of orienteering problem, International Journal of Logistics and SCM Systems, 1(1), 34-40
  11. Kataoka, S. and Morito, S. (1988), An algorithm for single constraint maximum collection problem, Journal of Operations Research Society of Japan, 31, 515-530 https://doi.org/10.15807/jorsj.31.515
  12. Keller, C. P. (1989), Algorithms to solve the orienteering problem: A comparison, European Journal of Operational Research, 41, 224-231 https://doi.org/10.1016/0377-2217(89)90388-3
  13. Keller, C. P. and Goodchild, M. (1988), The multi-objective vending problem: A generalization of the traveling salesman problem, Environment and Planning B: Planning and Design, 15, 447-460 https://doi.org/10.1068/b150447
  14. Laporte, G. and Martello, S. (1990), The selective traveling salesman problem, Discrete Applied Mathematics, 26, 193-207 https://doi.org/10.1016/0166-218X(90)90100-Q
  15. Leifer, A. C. and Rosenwein, M. B. (1994), Strong linear programming relaxations for the orienteering problem, European Journal of Operational Research, 73, 517-523 https://doi.org/10.1016/0377-2217(94)90247-X
  16. Liang, Y. C, Kulturel-Konak, S., and Smith, A. E. (2002) Meta heuristic for the orienteering problem, Proceedings of the 2002 Congress on Evolutionary Computation, 384-389
  17. Mocholi, J. A., Jaen, J., and Canos, J. H. (2005), A grid ant colony algorithm for the orienteering problem, The 2005 IEEE Congress on Evolutionary Computation, 1, 942-949 https://doi.org/10.1109/CEC.2005.1554784
  18. Ramesh, R., Yoon, Y., and Karwan, M. H. (1992), An optimal algorithm for the orienteering tour problem, ORSA Journal on Computing, 4, 155-165 https://doi.org/10.1287/ijoc.4.2.155
  19. Tang, H. and Miller-Hooks, E. (2005), A Tabu search heuristic for the team orienteering problem, Computers and Operations Research, 32(6), 1379- 1407 https://doi.org/10.1016/j.cor.2003.11.008
  20. Tasgetiren, M. F. and Smith, A. E. (2000), A genetic algorithm for the orienteering problem, Proceedings of the 2000 Congress on Evolutionary Computation, 2, 910-915
  21. Tsilligirides, T. (1984), Heuristic methods applied to orienteering, Journal of the Operational Research Society, 35, 797-809 https://doi.org/10.1057/jors.1984.162
  22. Wren, A. and Holiday, A. (1972), Computer scheduling of vehicles from one or more depots to a number of delivery points, Operational Research Quarterly, 23, 333-344 https://doi.org/10.1057/jors.1972.53