×

A threshold accepting approach to the open vehicle routing problem. (English) Zbl 1114.90063

Summary: In this paper we consider the operational planning problem of physical distribution via a fleet of hired vehicles, for which the travelling cost is solely a function of the sequence of locations visited within all open delivery routes, while vehicle fixed cost is inexistent. The problem is a special class of vehicle routing and is encountered in the literature as the open vehicle routing problem (OVRP), since vehicles are not required to return to the depot. The goal is to distribute in an optimal way finished goods from a central facility to geographically dispersed customers, which pose daily demand for items produced in the facility and act as sales points for consumers. To solve the problem, we employ an annealing-based method that utilizes a backtracking policy of the threshold value when no acceptances of feasible solutions occur during the search process. Computational results on a set of benchmark problems show that the proposed method consistently outperforms previous algorithms for solving the OVRP. The approach can serve as the means for effective fleet planning in real-life problems.

MSC:

90B80 Discrete location and assignment
90B06 Transportation, logistics and supply chain management
90C35 Programming involving graphs or networks

Software:

BoneRoute; VRP
PDFBibTeX XMLCite
Full Text: DOI Numdam Numdam EuDML

References:

[1] L. Bodin , B. Golden , A. Assad and M. Ball , Routing and scheduling of vehicles and crews: the state of the art . Comput. Oper. Res. 10 ( 1983 ) 63 - 211 .
[2] J. Brandão , A tabu search algorithm for the Open Vehicle Routing Problem . Eur. J. Oper. Res. 157 ( 2004 ) 552 - 564 . Zbl 1068.90026 · Zbl 1068.90026 · doi:10.1016/S0377-2217(03)00238-8
[3] O. Bräysy , J. Berger , M. Barkaoui and W. Dullaert , A threshold accepting metaheuristic for the Vehicle Routing Problem with Time Windows . Central Eur. J. Oper. Res. 11 ( 2003 ) 369 - 387 . Zbl 1065.90012 · Zbl 1065.90012
[4] N. Christofides , A. Mingozzi and P. Toth , The vehicle routing problem , in Combinatorial Optimization, edited by N. Christofides, A. Mingozzi, P. Toth and C. Sandi. Wiley, Chichester ( 1979 ) 315 - 338 . Zbl 0413.90075 · Zbl 0413.90075
[5] G. Clarke and J.W. Wright , Scheduling of vehicles from a central depot to a number of delivery points . Oper. Res. 12 ( 1964 ) 568 - 589 .
[6] J.-F. Cordeau , M. Gendreau , A. Hertz , G. Laporte and J.S. Sormany , New Heuristics for the Vehicle Routing Problem , in Logistics Systems: Design and Optimization, edited by A. Langevin et D. Riopel. Kluwer (to appear). Zbl 1130.90416 · Zbl 1130.90416
[7] J.-F. Cordeau , M. Gendreau , G. Laporte , J.-Y. Potvin and F. Semet , A guide to vehicle routing heuristics . J. Oper. Res. Soc. 53 ( 2002 ) 512 - 522 . Zbl 1099.90506 · Zbl 1099.90506 · doi:10.1057/palgrave/jors/2601319
[8] G. Croes , A method for solving traveling salesman problems . Oper. Res. 6 ( 1958 ) 791 - 812 .
[9] G. Dueck and T. Scheuer , Threshold accepting: a general purpose algorithm appearing superior to simulated annealing . J. Comput. Phys. 90 ( 1990 ) 161 - 175 . Zbl 0707.65039 · Zbl 0707.65039 · doi:10.1016/0021-9991(90)90201-B
[10] M. Gendreau , A. Hertz and G. Laporte , A tabu search heuristic for the vehicle routing problem . Manage. Sci. 40 ( 1994 ) 1276 - 1290 . Zbl 0822.90053 · Zbl 0822.90053 · doi:10.1287/mnsc.40.10.1276
[11] M. Gendreau , A. Hertz and G. Laporte , New insertion and postoptimization procedures for the traveling salesman problem . Oper. Res. 40 ( 1992 ) 1086 - 1094 . Zbl 0767.90087 · Zbl 0767.90087 · doi:10.1287/opre.40.6.1086
[12] B.L. Golden , E.A. Wasil , J.P. Kelly and I.-M. Chao , The impact of metaheuristics on solving the vehicle routing problem: Algorithms, problem sets, and computational results , edited by T.G. Crainic and G. Laporte. Fleet Management and Logistics, Kluwer Academic Publishers, Boston ( 1998 ) 33 - 56 . Zbl 0997.90021 · Zbl 0997.90021
[13] B. Golden and A.A. Assad , Vehicle Routing: Methods and Studies . Elsevier Science Publishers, Amsterdam ( 1988 ). MR 1017687 | Zbl 0638.00043 · Zbl 0638.00043
[14] S. Kirkpatrick , C.D. Gelatt Jr. and M.P. Vecchi , Optimization by simulated annealing . Science 220 ( 1983 ) 671 - 680 . · Zbl 1225.90162 · doi:10.1126/science.220.4598.671
[15] D. Sariklis and S. Powell , A heuristic method for the open vehicle routing problem . J. Oper. Res. Soc. 51 ( 2000 ) 564 - 573 . Zbl 1055.90530 · Zbl 1055.90530 · doi:10.1057/palgrave.jors.2600924
[16] M. Syslo , N. Deo and J. Kowaklik , Discrete Optimization Algoritms with Pascal Programs . Prentice Hall, Inc. ( 1983 ). Zbl 0574.90057 · Zbl 0574.90057
[17] C.D. Tarantilis , C.T. Kiranoudis and V.S. Vassiliadis , A list based threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem . J. Oper. Res. Soc. 54 ( 2003 ) 65 - 71 . Zbl 1088.90536 · Zbl 1088.90536 · doi:10.1057/palgrave.jors.2601443
[18] C.D. Tarantilis and C.T. Kiranoudis , BoneRoute: An adaptive memory-based method for effective fleet management . Ann. Oper. Res. 115 ( 2002 ) 227 - 241 . Zbl 1013.90020 · Zbl 1013.90020 · doi:10.1023/A:1021157406318
[19] C.D.J. Waters , A solution procedure for the vehicle scheduling problem based on iterative route improvement . J. Oper. Res. Soc. 38 ( 1987 ) 833 - 839 . Zbl 0628.90037 · Zbl 0628.90037 · doi:10.2307/2582324
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.