Management Science and Financial Engineering

  • 제17권1호
  • /
  • Pages.79-94
  • /
  • 2011
  • /
  • 2287-2043(pISSN)
  • /
  • 2287-2361(eISSN)
한국경영과학회 (The Korean Operations Research and Management Science Society)
권호 표지

Priority Rule Based Heuristics for the Team Orienteering Problem

  • Ha, Kyoung-Woon (Department of Industrial Engineering, Hanyang University) ;
  • Yu, Jae-Min (Department of Industrial Engineering, Hanyang University) ;
  • Park, Jong-In (Reliability Technology Center Korea, Testing Laboratory) ;
  • Lee, Dong-Ho (Department of Industrial Engineering, Graduate School of Technology and Innovation Management, Hanyang University)
  • 투고 : 2010.12.17
  • 심사 : 2011.05.02
  • 발행 : 2011.05.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

Team orienteering, an extension of single-competitor orienteering, is the problem of determining multiple paths from a starting node to a finishing node for a given allowed time or distance limit fixed for each of the paths with the objective of maximizing the total collected score. Each path is through a subset of nodes, each of which has an associated score. The team orienteering problem has many applications such as home fuel delivery, college football players recruiting, service technicians scheduling, military operations, etc. Unlike existing optimal and heuristic algorithms often leading to heavy computation, this paper suggests two types of priority rule based heuristics-serial and parallel ones-that are especially suitable for practically large-sized problems. In the proposed heuristics, all nodes are listed in an order using a priority rule and then the paths are constructed according to this order. To show the performances of the heuristics, computational experiments were done on the small-to-medium sized benchmark instances and randomly generated large sized test instances, and the results show that some of the heuristics give reasonable quality solutions within very short computation time.

키워드

참고문헌

  1. Archetti, C., A. Hertz, and M. Speranza, "Metaheuristics for the team orienteering problem," Journal of Heuristics 13 (2007), 49-76. https://doi.org/10.1007/s10732-006-9004-0
  2. Bouly, H., D.‐C. Dang, and A. Moukrim, "A memetic algorithm for the team orienteering problem," Lecture Notes in Computer Science 4974 (2008), 649-658.
  3. Boussier, S., D. Feillet, and M. Gendreau, "An exact algorithm for team orienteering problems," 4OR 5 (2007), 211-230. https://doi.org/10.1007/s10288-006-0009-1
  4. Butt, S. and T. Cavalier, "A heuristic for the multiple tour maximum collection problem," Computers and Operations Research 21 (1994), 101-111. https://doi.org/10.1016/0305-0548(94)90065-5
  5. Chao, I., B. Golden, and E. Wasil, "A fast and effective heuristic for the orienteering problem," European Journal of Operational Research 88 (1996a), 475-489. https://doi.org/10.1016/0377-2217(95)00035-6
  6. Chao, I., B. Golden, and E. Wasil, "The team orienteering problem," European Journal of Operational Research 88 (1996b), 464-474. https://doi.org/10.1016/0377-2217(94)00289-4
  7. Fischetti, M., J. Salazar, and P. Toth, "Solving the orienteering problem through branch‐and‐cut," INFORMS Journal on Computing 10 (1998), 133-148. https://doi.org/10.1287/ijoc.10.2.133
  8. Gendreau, M., G. Laporte, and F. Semet, "A branch‐and‐cut algorithm for the undirected selective travelling salesman problem," Networks 32 (1998), 263-273. https://doi.org/10.1002/(SICI)1097-0037(199812)32:4<263::AID-NET3>3.0.CO;2-Q
  9. Golden, B., L. Levy, and R. Vohra, "The orienteering problem," Naval Research Logistics 34 (1987), 307-318. https://doi.org/10.1002/1520-6750(198706)34:3<307::AID-NAV3220340302>3.0.CO;2-D
  10. Hayes, M. and J. M. Norman, "Dynamic programming in orienteering: route choice and the siting of controls," Journal of the Operational Research Society 35 (1984), 791-796. https://doi.org/10.1057/jors.1984.161
  11. Ke, L., C. Archetti, and Z. Feng, "Ants can solve the team orienteering problem," Computers and Industrial Engineering 54 (2008), 648-665. https://doi.org/10.1016/j.cie.2007.10.001
  12. Laporte, G. and S. Martello, "The selective travelling salesman problem," Discrete Applied Mathematics 26 (1990), 193-207. https://doi.org/10.1016/0166-218X(90)90100-Q
  13. Ramesh, R. and K. M. Brown, "An efficient four‐phase heuristic for the generalized orienteering problem," Computers and Operations Research 18 (1991), 151-165. https://doi.org/10.1016/0305-0548(91)90086-7
  14. Ramesh, R., Y. Yoon, and M. Karwan, "An optimal algorithm for the orienteering tour problem," ORSA Journal of Computing 4 (1992), 155-165. https://doi.org/10.1287/ijoc.4.2.155
  15. Souffriau, W., P. Vansteenwegen, G. V. Berghe, and D. V. Oudheusden, "A path relinking approach for the team orienteering problem," Computers and Operations Research 37 (2010), 1853-1859. https://doi.org/10.1016/j.cor.2009.05.002
  16. Tang, H. and E. Miller‐Hooks, "A tabu search heuristic for the team orienteering problem," Computer and Operations Research 32 (2005) 1379-1407. https://doi.org/10.1016/j.cor.2003.11.008
  17. Tsiligirides, T., "Heuristic methods applied to orienteering," Journal of the Operational Research Society 35 (1984), 797-809. https://doi.org/10.1057/jors.1984.162
  18. Vansteenwegen, P., W. Souffriau, G. Vanden Berghe, and D. Van Oudheusden, "A guided local search metaheuristic for the team orienteering problem," European Journal of Operational Research 196 (2009), 118-127. https://doi.org/10.1016/j.ejor.2008.02.037