Chain partitioning as a key element for building vehicle routing problem heuristics

References

• Alfa , A. S. , Heragu , S. S. and Chen , M. 1991 . A 3-opt based simulated annealing algorithm for vehicle routing problems . Computers and Industrial Engineering , 21 : 635 – 639 .
   Web of Science ®Google Scholar
• Casotto , A. , Romeo , F. and Sangiovanni-Vincentelli , A. 1987 . A parallel simulated annealing algorithm for the placement of macrocells . IEEE Transactions on Computer-Aided Design , 6 ( 5 ) : 838 – 847 . Vol. CAD-
   Google Scholar
• Christofides , N. , Mingozzi , A. and Toth , P. 1981 . Exact algorithms for the vehicle routing problem based on spanning tree and shortest path relaxations . Mathematical Programming , 20 : 255 – 282 .
   Web of Science ®Google Scholar
• Eilon , S. , Watson-Gandy , C. D. T. and Christofides , N. 1971 . Distribution Management: Mathematical Modelling and Practical Analysis , 240 London : Griffin .
   Google Scholar
• Gaskell , T.J. 1967 . Bases for vehicle fleet scheduling . Operational Research Quarterly , 18 : 281 – 295 .
   Google Scholar
• Gendreau , M. , Hertz , A. and Laporte , G. 1994 . Atabu search heuristic for the vehicle routing problem . Management Science , 40 ( 10 ) : 1276 – 1290 .
   Web of Science ®Google Scholar
• Glover , F. , Taillard , E. and De Werra , D. 1993 . A user's guide to tabu search . Annals of Operations Research , 41 : 3 – 28 .
   Google Scholar
• Golden , B. L. and Stewart , W. R. 1985 . “ Empirical analysis of heuristics ” . In in The Travelling Salesman Problem , Edited by: Lawler , E. L. , Lenstra , J. K. , Rinnooy Kan , A. H. G. Schmoys , D. B. 207 – 249 . J. Wiley .
   Google Scholar
• Janssens , G. K. and Van Breedam , A. 1995 . “ A simulated annealing postprocessor for the vehicle routing problem ” . In in Applications of Modern Heuristic Methods , Edited by: Rayward-Smith , V. J. 175 – 192 . Henley-on-Thames , U.K. : A. Waller Ltd. .
   Google Scholar
• Laporte , G. and Nobert , Y. 1987 . Exact algorithms for the vehicle routing problem . Annals of Discrete Mathematics , 31 : 147 – 184 .
   Google Scholar
• Lin , S. and Kernighan , B. W. 1973 . An effective heuristic algorithm for the vehicle routing problem . Operations Research , 21 : 498 – 516 .
   Web of Science ®Google Scholar
• Magnanti , T. L. 1981 . Combinatorial optimization and vehicle fleet planning: perspectives and prospects . Networks , 11 : 197 – 213 .
   Google Scholar
• Misra , J. and Tarjan , R. E. 1975 . Optimal chain partitions of trees . Information Processing Letters , 4 ( 1 ) : 24 – 26 .
   Google Scholar
• Osman , I. 1993 . Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem . Annals of Operations Research , 41 : 421 – 451 .
   Google Scholar
• Rochat , Y. and Taillard , E. D. 1995 . Probabilistic diversification and intensification in local search for vehicle routing . Journal of Heuristics , 1 : 147 – 167 .
   Google Scholar