AN EFFICIENT META-HEURISTIC ALGORITHM FOR ROUTING PRODUCT COLLECTING VEHICLES OF DEHYDRATION PLANTS. I. ALGORITHM DEVELOPMENT

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
• Bock , F. 1958 . An algorithm for solving “traveling- salesman” andrelated network optimization problems: abstract . Bulletin Fourteenth National Meeting of the Operations ResearchSociety of America , 897
   Google Scholar
• Christofides , N. and Eilon , S. 1969 . An algorithm for the vehicle dispatching problem . Operational Research Quarterly , 20 : 309 – 318 .
   Google Scholar
• Christofides , N. , Mingozzi , A. and Toth , P. 1979 . “ The vehicle routing problem ” . In Combinatorial Optimization Edited by: Christofides , N. , Mingozzi , A. , Toth , P. and Sandi , C. 315 – 338 . Chichester : Wiley .
   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
• Croes , G. 1958 . A method for solving traveling salesman problems . Operations Research , 6 : 791 – 812 .
   Web of Science ®Google Scholar
• Dueck , G. and Scheuer , T. 1990 . Threshold accepting. A general purpose optimization algorithmappearing superior to simulated annealing . Journal of Computational Physics , 90 ( 1 ) : 161 – 175 .
   Web of Science ®Google Scholar
• Dueck , G. 1993 . New optimization heuristics: The great deluge algorithm andrecord-to-record travel . Journal of Computational Physics , 104 : 86 – 92 .
   Web of Science ®Google Scholar
• Duncan , T. 1995 . Experiments in the use of neighborhood search techniques forvehicle routing . Technical Report AIAI-TR-176, Artificial Intelligence ApplicationsInstitute, University of Edinburgh ,
   Google Scholar
• Fahrion , R. and Wrede , M. 1990 . On a principle of chain-exchange for vehicle-routeing problems(1–VRP) . Journal of the Operational Research Society , 41 ( 9 ) : 821 – 827 .
   Web of Science ®Google Scholar
• Feo , T. A. , Bard , J. F. and Clafin , R. F. 1991 . An overviewof GRASP methodology sand applications Austin, Texas 78712 : Technical report, University of Texas at Austin .
   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
• Glover , F. 1989 . Tabu search-Part I . ORSA Journal on Computing , 1 : 190 – 206 .
   Google Scholar
• Golden , B. L. , Wasil , E. A. , Kelly , J. P. and Chao , I.-M. 1998 . “ Metaheuristics in vehicle routing ” . In Fleet Management and Logistics Edited by: Crainic , T. G. and Laporte , G. Boston : Kluwer .
   Google Scholar
• Hjorring , C. 1995 . The vehiclerouting problem and local search metaheuristics , Ph.D.dissertation Department of EngineeringScience . TheUniversity of Auckland
   Google Scholar
• Holland , J. H. 1975 . Adaptation in Natural and Artificial systems MIT Press .
   Google Scholar
• Johnson , D. S. and Papadimitriou , C. H. 1985 . “ Computational complexity ” . In The Traveling Salesman Problem: A Guided Tour of CombinatorialOptimization (chapter 3) Edited by: Lawler , E. L. , Lenstra , J. K. , Rinnooy Kan , A. K. G. and Shmoys , D. B. Chichester : Willey .
   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
• Kinderwater , G. A. P. and Savelsbergh , M. W. P. 1997 . “ Vehicle routing: handling edge constraints ” . In Local Search in Combinatorial Optimization Edited by: Aarts , E. H.L. and Lenstra , J. K. Chichester : Wiley .
   Google Scholar
• Kiranoudis , C. T. , Maroulis , Z. B. and Marinos-Kouris , D. 1993 . Modeling and optimization for design under production planningcriteria in multiproduct dehydration plants . Drying Technology , 11 : 1271 – 1292 .
   Web of Science ®Google Scholar
• Kiranoudis , C. T. , Maroulis , Z. B. and Marinos-Kouris , D. 1994 . Production planning for multiproduct dehydration plants . Applied Mathematical Modelling , 18 : 58 – 71 .
   Web of Science ®Google Scholar
• Kiranoudis , C. T. , Maroulis , Z. B. and Marinos-Kouris , D. 1995 . Design and production planning of multi-product dehydrationplants . Computers and Chemical Engineering , 19 : 581 – 606 .
   Web of Science ®Google Scholar
• Kiranoudis , C. T. , Maroulis , Z. B. and Marinos-Kouris , D. 1996 . Design and operation of convective industrial dryers . AIChEJ , 42 : 3030 – 3040 .
   Web of Science ®Google Scholar
• Kirkpatrick , S. , Gelatt , C. D. and Vecchi , M. P. 1983 . Optimization by simulated annealing . Science , 220 : 671 – 680 .
   PubMed Web of Science ®Google Scholar
• Lin , S. 1965 . Computer solutions of the traveling salesman problem . Bell Systems Technical Journal , 44 : 2245 – 2269 .
   Google Scholar
• Lin , S. and Kernighan , B. W. 1973 . An effective heuristic algorithm for the traveling-salesmanproblem . Operations Research , 21 : 498 – 516 .
   Web of Science ®Google Scholar
• Or , I. 1976 . Traveling salesman-type combinatorialoptimization problems and their relation to the logistics of regional bloodbanking , Ph.D. dissertation Evanston, IL : Northwestern University .
   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
• 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 efficient implementation of ejection chain procedures forthe vehicle routing problem . Technical Report 44, PriSM Laboratory, University of Versailles ,
   Google Scholar
• Rochat , Y. and Taillard , E. D. 1995 . Probabilistic diversification and intensification in local searchfor vehicle routing . Technical Report CRT-95-13, Centre de Recherche sur les transports ,
   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. 2000 . An efficient metaheuristic algorithm for routing product collectingvehicles of dehydration plants. II. Algorithm performance and Case Studies . Drying Technology , submitted
   Google Scholar
• Thompson , P. M. and Psaraftis , H. N. 1993 . Cyclic transfer algorithms for the multivehicle routing andscheduling problems . Operations Research , 41 : 935 – 946 .
   Web of Science ®Google Scholar
• Toth , P. and Vigo , D. 1998 . The granular tabu search (and its application to the vehiclerouting problem) . Working paper, DEIS, University of Bologna (Forthcoming in INFORMSJournal on Computing) ,
   Google Scholar
• Van Breedam , A. 1994 . An analysisof the behavior of heuristics for the vehicle routing problem for a selectionof problems with vehicle related, customer related, and time-related constraints , Ph.D. dissertation University of Antwerp .
   Google Scholar
• Vaessens , R. J. , Aarts , E. H. L. and Lenstra , J. K. 1998 . A local search template . Computers Operations Research , 25 ( 11 ) : 969 – 979 .
   Google Scholar
• Waters , C. D. J. 1987 . A solution procedure for the vehicle scheduling problem basedon iterative route improvement . Journal of Operational Research Society , 38 : 833 – 839 .
   Web of Science ®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