AN EFFICIENT META-HEURISTIC ALGORITHM FOR ROUTING PRODUCT COLLECTING VEHICLES OF DEHYDRATION PLANTS. II. ALGORITHM PERFORMANCE AND CASE STUDIES

REFERENCES

• Barbarosoglu , G. and Ozgur , D. 1999 . A tabu search algorithm for the vehicle routing problem . Computers and Operations Research , 26 : 255 – 270 .
   Google Scholar
• Bramel , J. B. and Simchi-Levi , D. 1995 . A location based heuristic for general routing problems . Operations Research , 43 : 649 – 660 .
   Web of Science ®Google Scholar
• Clarke , G. and Wright , J. W. 1964 . Scheduling of vehicles from a central depot to a number of deliverypoints . Operations Research , 12 : 568 – 589 .
   Web of Science ®Google Scholar
• Christofides , N. , Mingozzi , A. and Toth , P. 1979 . The vehiclerouting problem Edited by: Christofides , N. , Mingozzi , A. , Toth , P. and Sandi , C. 315 – 338 . Chichester : Wiley . CombinatorialOptimization
   Google Scholar
• Foster , B. A. and Ryan , D. M. 1976 . An integer programming approach to the vehicle scheduling problem . Operational Research Quarterly , 27 : 367 – 384 .
   Google Scholar
• Gendreau , M. , Hertz , A. and Laporte , G. 1994 . A tabu search heuristic for the vehicle routing problem . Management Science , 40 : 1276 – 1290 .
   Web of Science ®Google Scholar
• Gillett , B. and Miller , L. 1974 . A heuristic algorithm for the vehicle dispatch problem . Operations Research , 22 : 340 – 349 .
   Web of Science ®Google Scholar
• Golden , B. L. , Wasil , E. A. , Kelly , J. P. and Chao , I-M. 1998 . Metaheuristicsin vehicle routing Edited by: Crainic , T. G. and Laporte , G. Boston : Fleet Management and Logistics,Kluwer .
   Google Scholar
• Hjorring , C. 1995 . The vehiclerouting problem and local search metaheuristics , Ph.D.dissertation Department of EngineeringScience, The University of Auckland .
   Google Scholar
• Kelly , J. P. and Xu , J. 1999 . A set-partitioning-based heuristic for the vehicle routing problem . INFORMS Journal on Computing , 1 ( 1 ) : 161 – 172 .
   Google Scholar
• Mole , R. H. 1983 . The curse of unintended rounding error: a case from the vehiclescheduling literature . Journal of the Operational Research Society , 34 : 607 – 613 .
   Web of Science ®Google Scholar
• Osman , I. H. 1993 . Metastrategy simulated annealing and tabu search algorithmsfor combinatorial optimisation problems . Annals of Operations Research , 41 : 421 – 451 .
   Google Scholar
• Paessens , H. 1988 . The savings algorithm for the vehicle routing problem . European Journal of Operational Research , 34 : 336 – 344 .
   Web of Science ®Google Scholar
• Pureza , V. M. and Franca , P. M. 1991 . Vehicle routing via tabu search metaheuristic , Technical Report CRT-747 Centre de Recherche sur les transports .
   Google Scholar
• Rego , C. 1996 . Local searchand neighborhood structures for vehicle routing problems: sequential and parallelalgorithms , Ph.D. Dissertation University of Versailles .
   Google Scholar
• Rego , C. and Roucairol , C. 1994 . An efficientimplementation of ejection chain procedures for the vehicle routing problem , Technical Report 44 PriSM Laboratory, University of Versailles .
   Google Scholar
• Renaud , J. , Boctor , F. F. and Laporte , G. 1996a . A fast composite heuristic for the symmetric traveling salesmanproblem . INFORMS Journal on Computing , 8 : 134 – 143 .
   Google Scholar
• Renaud , J. , Boctor , F. F. and Laporte , G. 1996b . An improved petal heuristic for the vehicle routing problem . Journal of the Operational Research Society , 47 : 329 – 336 .
   Web of Science ®Google Scholar
• Taillard , E. 1993 . Parallel iterative search methods for vehicle routing problems . Networks , 23 : 661 – 672 .
   Web of Science ®Google Scholar
• Tarantilis , C. D. and Kiranoudis , C. T. An efficient metaheuristic algorithm for routing product collectingvehicles of dehydration plants. I. Algorithm development, Drying Technology , 2000, submitted
   Google Scholar
• Toth , P. and Vigo , D. 1998 . The granulartabu search (and its application to the vehicle routing problem) , Working paper DEIS,University of Bologna (Forthcoming in INFORMS Journal on Computing) .
   Google Scholar
• Wark , P. and Holt , J. 1994 . A repeated matching heuristic for the vehicle routeing problem . Journal of Operational Research Society , 45 ( 10 ) : 1156 – 1167 .
   Web of Science ®Google Scholar
• Winston , W. L. 1994 . Operations Research . Applications and Algorithms ,
   Google Scholar
• Xu , J. and Kelly , J. P. 1996 . A new network flow-based tabu search heuristic for the vehiclerouting problem . Transportation Sciences , 30 : 379 – 393 .
   Web of Science ®Google Scholar