Deriving Convergence of Vehicle Routing Problems using a Fictitious Play Approach

References

• Baldacci , R. , Hadjiconstantinou , E. A. and Mingozzi , A. 2004 . “ An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation ” . In Operations Research, to appear
   Google Scholar
• Brown , G. W. 1951 . “ Iterative solution of games by fictitious play ” . In in Activity Analysis of Production Allocation , New York : Wiley .
   Google Scholar
• Cordeau , J.-F. , Gendreau , M. , Hertz , A. , Laporte , G. and Sormany , J. S. 2004 . “ New Heuristics for the Vehicle Routing Problem ” . In Les Cahiers du GERAD, G2004–33 , Canada : HEC Montreal .
   Google Scholar
• Costa , G. and Mori , P. A. 1994 . “ Introduzione alia teoria dei giochi ” . In Il Mulino Editore , Italy : Bologna .
   Google Scholar
• Domschke , W. 1997 . “ Logistik: Rundreisen und Touren ” . In Oldenbourg Verlag , Germany : Munich .
   Google Scholar
• Drezner , Z. 2003 . A new genetic algorithm for the quadratic assignment problem . INFORMS Journal on Computing , 15 : 320 – 330 .
   Web of Science ®Google Scholar
• Ergun , O. , Orlin , J. B. and Steele-Feldman , A. 2003 . “ Creating very large scale neighbourhoods out of smaller ones by compounding moves: a study on the vehicle routing problem, Working paper ” . In Massachusetts Institute of Technology
   Google Scholar
• Garcia , A. , Reaume , D. and Smith , R. L. 2000 . Fictitious play for finding system optimal routings in dynamic traffic networks . Transportation Research , 8 ( 34 ) : 147 – 156 .
   Google Scholar
• Gibbons , R. 1992 . “ A Primer in Game Theory ” . In Harvester-Wheatsheaf, Englewood Cliffs New Jersey , USA
   Google Scholar
• Kindervater , G. A. P. and Savelsbergh , M. W. P.. 1997 . “ Vehicle routing: Handling edge exchanges ” . In in Local Search in Combinatorial Optimization , Edited by: Aarts , E. H. L. and Lenstra , J. K. 337 – 360 . Wiley, Chichester .
   Google Scholar
• Lambert , T. J. , Epelman , M. A. and Smith , R. L. 2005 . A fictitious play approach to large-scale optimization . Operations Research , 53 ( 3 ) : 477 – 489 .
   Web of Science ®Google Scholar
• Laporte , G. Metaheuristics for the vehicle routing problem: fifteen years of research . September 3–5 2004 . in Proceedings of 41st AIRO Conference , Italy : Leece . to appear
   Google Scholar
• Laporte , G. and Semet , F. 2002 . “ Classical heuristics for the capacitated VRP ” . In in The Vehicle Routing Problem , Edited by: Toth , P. and Vigo , D. 109 – 128 . Philadelphia : SIAM Monographs on Discrete Mathematics Applications .
   Google Scholar
• Li , F. , Golden , B. L. and Wasil , E. A. 2004 . Very large-scale vehicle routing: new test problems,algorithms results . Computers & Operations Research , 32 ( 5 ) : 1165 – 1179 .
   Google Scholar
• Li Caizi , M. 1995 . “ Teoria dei Giochi ” . In Etas Libri , Italy : Milan .
   Google Scholar
• Lin , S. 1965 . Computer solution of the traveling salesman problem . Bell System Technical Journal , 44 : 2245 – 2269 .
   Google Scholar
• Mester , D. and Braeysy , O. 2005 . “ Active guided evolution strategies for the large scale vehicle routing problems with time windows ” . In Computers & Operations Research, to appear
   Google Scholar
• Modares , A. , Somhom , S. and Enkawa , T. 1999 . A self organizing neural network approach for Multiple Travelling Salesman Vehicle Routing Problems . International Transactions in Operational Research , 6 ( 6 ) : 591 – 606 .
   Google Scholar
• Monderer , D. and Shapley , L. 1996 . Fictitious Play property for games with identical interests . Journal of Economic Theory , 68 : 258 – 265 .
   Web of Science ®Google Scholar
• Naddef , D. and Rinaldi , G. 2002 . “ Branch-and-cut algorithms for the capacitated VRP ” . In in The Vehicle Routing Problem , Edited by: Toth , P. and Vigo , D. 53 – 84 . Philadelphia , USA : SIAM Monographs on Discrete Mathematics Applications .
   Google Scholar
• Nocera , S. 2004 . “ Steuerung des Sektorbetriebs bei nachfrageabhängiger ÖPNV-Bedienung, Ph.D.Thesis ” . In Technische Universität Munchen , Germany : Munich .
   Google Scholar
• Nocera , S. 2005 . Solving vehicle routing problems using an engineering solution . Traffic Engineering & Control , 12 : 414 – 419 .
   Google Scholar
• Potvin , J.-Y. 1996 . Genetic algorithms for the traveling salesman problem . Annals of Operations Research , 63 : 339 – 370 .
   Web of Science ®Google Scholar
• Potvin , J.-Y. and Rousseau , J.-M. 1995 . An exchange heuristic for routing problems with time windows . Journal of the Operational Research Society , 46 : 1433 – 3446 .
   Web of Science ®Google Scholar
• Prins , C. 2004 . A simple effective evolutionary algorithm for the vehicle routing problem . Computers & Operations Research , 31 : 1985 – 2002 .
   Web of Science ®Google Scholar
• Rego , C. 1998 . A subpath ejection method for the vehicle routing problem . Management Science , 44 : 1447 – 1459 .
   Google Scholar
• Rego , C. and Roucairol , C. 1996 . “ A parallel tabu search algorithm using ejection chains for the vehicle routing problem ” . In in Meta- Heuristics: Theory Applications , 661 – 675 . Boston : Kluwer .
   Google Scholar
• Reimann , M. , Doerner , K. and Hartl , R. F. 2004 . D-ants: savings based ants divide conquer the vehicle routing problem . Computers & Operations Research , 31 ( 4 ) : 563 – 591 .
   Web of Science ®Google Scholar
• Renaud , J. , Boctor , F. F. and Laporte , G. 1996 . A fast composite heuristic for the symmetric traveling salesman problem . INFORMS Journal on Computing , 8 : 134 – 143 .
   Google Scholar
• Tarantilis , C.-D. and Kiranoudis , C. T. 2002 . Bone route: an adaptive memory based method for effective fleet management . Annals of Operations Research , 115 : 227 – 241 .
   Web of Science ®Google Scholar
• Trompson , P. M. and Psaraftis , H. N. 1993 . Cyclic transfer algorithms for multivehicle routing scheduling problems . Operations Research , 41 : 935 – 946 .
   Google Scholar
• Toth , P. and Vigo , D. 2003 . The granular tabu search its application to the vehicle routing problem . INFORMS Journal on Computing , 15 : 333 – 346 .
   Web of Science ®Google Scholar
• Xu , J. and Kelly , J. P. 1996 . A network flow-based tabu search heuristic for the vehicle routing problem . Transportation Science , 30 : 379 – 393 .
   Web of Science ®Google Scholar