A dynamic team orienteering problem of partial dynamic arrival customers is studied
and a model of the problem is established to deal with the team orienteering problem
which is one of the most critical problems in the optimization design for logistic distribution system. The dynamic problem is converted into a series of static sub-problems by partitioning the planning horizon into a series of time segments. An ant colony optimization(ACO)based algorithm is proposed to solve the resulting problem. The prominent characteristic of the algorithm is to use the information obtained from the last time segment to enhance the search behavior. An exact offline algorithm based on branch and price is also presented to solve the problem. Experimental results and comparisons with the exact offline algorithm based on the branch and bound show that the proposed ACO-based algorithm can solve four test instances within 1 000 seconds
and that the solutions of two test instances obtained by the proposed ACO-based algorithm are better than those obtained by the exact offline algorithm.
关键词
Keywords
references
BUTT S E, CAVALIER T M. A heuristic for the multiple path maximum collection problem[J]. Computers and Operations Research, 1994, 21(1):101-111.
CHAO I M, GOLDEN B L, WASIL E A. The team orienteering problem[J]. European Journal of Operational Research, 1996, 88(3): 464-474.
BUTT S, RYAN D. An optimal solution procedure for the multiple path maximum collection problem using column generation[J]. Computer and Operations Research, 1999, 26(4):427-441.
BOUSSIER S, FEILLET D, GENDREAU M. An exact algorithm for team orienteering problems[J]. 4OR:A Quarterly Journal of Operations Research, 2007, 5(3): 211-230.
TANG Hao, MILLER-HOOKS E. A tabu search heuristic for the team orienteering problem[J]. Computers and Operations Research, 2005, 32(6):1379-1407.
ARCHETTI C, HERTZ A, SPERANZA M G. Metaheuristics for the team orienteering problem[J]. Journal of Heuristics, 2007, 13(1):49-76.
KE Liangjun, ARCHETTI C, FENG Zuren. Ants can solve the team orienteering problem[J]. Computers and Industrial Engineering, 2008, 54(3):648-665.
VANSTEENWEGEN P, SOURIAU W, OUDHEUSDEN D. The orienteering problem: a survey[J]. European Journal of Operational Research, 2011, 209(1):1-10.
CHEN Zhilong, XU Hang. Dynamic column generation for dynamic vehicle routing with time windows [J]. Transportation Science, 2006, 40(1):74-88.