A threshold accepting approach to the Open Vehicle Routing problem
Christos D. Tarantilis; George Ioannou; Chris T. Kiranoudis; Gregory P. Prastacos
RAIRO - Operations Research (2010)
- Volume: 38, Issue: 4, page 345-360
- ISSN: 0399-0559
Access Full Article
topAbstract
topHow to cite
topReferences
top- 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.
- J. Brandão, A tabu search algorithm for the Open Vehicle Routing Problem. Eur. J. Oper. Res.157 (2004) 552–564.
- 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.
- 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.
- 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.
- 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).
- 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.
- G. Croes, A method for solving traveling salesman problems. Oper. Res.6 (1958) 791–812.
- G. Dueck and T. Scheuer, Threshold accepting: a general purpose algorithm appearing superior to simulated annealing. J. Comput. Phys.90 (1990) 161–175.
- M. Gendreau, A. Hertz and G. Laporte, A tabu search heuristic for the vehicle routing problem. Manage. Sci.40 (1994) 1276–1290.
- M. Gendreau, A. Hertz and G. Laporte, New insertion and postoptimization procedures for the traveling salesman problem. Oper. Res.40 (1992) 1086–1094.
- 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.
- B. Golden and A.A. Assad, Vehicle Routing: Methods and Studies. Elsevier Science Publishers, Amsterdam (1988).
- S. Kirkpatrick, C.D. Gelatt Jr. and M.P. Vecchi, Optimization by simulated annealing. Science220 (1983) 671–680.
- D. Sariklis and S. Powell, A heuristic method for the open vehicle routing problem. J. Oper. Res. Soc.51 (2000) 564–573.
- M. Syslo, N. Deo and J. Kowaklik, Discrete Optimization Algoritms with Pascal Programs. Prentice Hall, Inc. (1983).
- 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.
- C.D. Tarantilis and C.T. Kiranoudis, BoneRoute: An adaptive memory-based method for effective fleet management. Ann. Oper. Res.115 (2002) 227–241.
- 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.