Browse > Article

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

Hwang, Hark (Department of Industrial Engineering, KAIST)
Park, Keum Ae (Samsung Card)
Oh, Yong Hui (Department of Industrial System Engineering, Daejin University)
Publication Information
Journal of Korean Institute of Industrial Engineers / v.33, no.3, 2007 , pp. 303-311 More about this Journal
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
Heuristic; Multi-path Orienteering Problem; Time and Capacity Constraints;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Chao, I., Golden, B. L., and Wasil, E. A. (1996), The team orienteering problem, European Journal of Operational Research, 88, 464-474   DOI   ScienceOn
2 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   DOI   ScienceOn
3 Golden, B. L., Wang, Q., and Liu, L. (1988), A multifaceted heuristic for the orienteering problem, Naval Research Logistics, 35, 359-366   DOI
4 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   DOI
5 Leifer, A. C. and Rosenwein, M. B. (1994), Strong linear programming relaxations for the orienteering problem, European Journal of Operational Research, 73, 517-523   DOI   ScienceOn
6 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
7 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   DOI
8 Ramesh, R., Yoon, Y., and Karwan, M. H. (1992), An optimal algorithm for the orienteering tour problem, ORSA Journal on Computing, 4, 155-165   DOI
9 Keller, C. P. (1989), Algorithms to solve the orienteering problem: A comparison, European Journal of Operational Research, 41, 224-231   DOI   ScienceOn
10 Laporte, G. and Martello, S. (1990), The selective traveling salesman problem, Discrete Applied Mathematics, 26, 193-207   DOI   ScienceOn
11 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   DOI   ScienceOn
12 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   DOI
13 Golden, B. L., Levy, L., and Vohra, R. (1987), The orienteering problem, Naval Research Logistics, 34, 307-318   DOI
14 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
15 Tang, H. and Miller-Hooks, E. (2005), A Tabu search heuristic for the team orienteering problem, Computers and Operations Research, 32(6), 1379- 1407   DOI   ScienceOn
16 Butt, S. E. and Cavalier, T. M. (1994), A heuristic for the multiple tour maximum collection problem, Computers and Operations Research, 21, 101-111   DOI   ScienceOn
17 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   DOI   ScienceOn
18 Tsilligirides, T. (1984), Heuristic methods applied to orienteering, Journal of the Operational Research Society, 35, 797-809   DOI   ScienceOn
19 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   DOI   ScienceOn
20 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   DOI   ScienceOn
21 Kataoka, S. and Morito, S. (1988), An algorithm for single constraint maximum collection problem, Journal of Operations Research Society of Japan, 31, 515-530   DOI
22 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