An improved Clarke and Wright savings algorithm for the capacitated vehicle routing problem
暂无分享,去创建一个
[1] Yves Rochat,et al. Probabilistic diversification and intensification in local search for vehicle routing , 1995, J. Heuristics.
[2] Luca Maria Gambardella,et al. Ant Algorithms for Discrete Optimization , 1999, Artificial Life.
[3] Ibrahim H. Osman,et al. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem , 1993, Ann. Oper. Res..
[4] Pablo Moscato,et al. A Gentle Introduction to Memetic Algorithms , 2003, Handbook of Metaheuristics.
[5] Paolo Toth,et al. The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.
[6] Gilbert Laporte,et al. A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .
[7] Nicos Christofides,et al. An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts , 2008, Math. Program..
[8] James C. Bean,et al. Genetic Algorithms and Random Keys for Sequencing and Optimization , 1994, INFORMS J. Comput..
[9] Paolo Toth,et al. Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations , 1981, Math. Program..
[10] Billy E. Gillett,et al. A Heuristic Algorithm for the Vehicle-Dispatch Problem , 1974, Oper. Res..
[11] G. Clarke,et al. Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .
[12] Gilbert Laporte,et al. An Improved Petal Heuristic for the Vehicle Routeing Problem , 1996 .
[13] Gilbert Laporte,et al. Classical and modern heuristics for the vehicle routing problem , 2000 .
[14] Anthony Wren,et al. Computer Scheduling of Vehicles from One or More Depots to a Number of Delivery Points , 1972 .
[15] Gerhard Reinelt,et al. TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..
[16] David S. Johnson,et al. Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .
[17] T. J. Gaskell,et al. Bases for Vehicle Fleet Scheduling , 1967 .
[18] James W. Thatcher,et al. Complexity of computer computations : proceedings , 1972 .
[19] Georgios Dounias,et al. Honey Bees Mating Optimization Algorithm for the Vehicle Routing Problem , 2007, NICSO.
[20] H. Paessens,et al. The savings algorithm for the vehicle routing problem , 1988 .
[21] Albert Corominas,et al. Fine-tuning a parametric Clarke and Wright heuristic by means of EAGH (empirically adjusted greedy heuristics) , 2010, J. Oper. Res. Soc..
[22] Bruce L. Golden,et al. A library of local search heuristics for the vehicle routing problem , 2010, Math. Program. Comput..
[23] Giovanni Rinaldi,et al. Computational results with a branch and cut code for the capacitated vehicle routing problem , 1998 .
[24] F. Tillman. The Multiple Terminal Delivery Problem with Probabilistic Demands , 1969 .
[25] Olli Bräysy,et al. Active-guided evolution strategies for large-scale capacitated vehicle routing problems , 2007, Comput. Oper. Res..
[26] Daniele Vigo,et al. Tuning a parametric Clarke–Wright heuristic via a genetic algorithm , 2008, J. Oper. Res. Soc..
[27] Irene Loiseau,et al. An Ant Colony Algorithm for the Capacitated Vehicle Routing , 2004, Electron. Notes Discret. Math..
[28] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .
[29] T. T. Narendran,et al. CLOVES: A cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up , 2007, Eur. J. Oper. Res..
[30] Gen-ke Yang,et al. Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem , 2006 .
[31] Daniele Vigo,et al. A heuristic algorithm for the asymmetric capacitated vehicle routing problem , 1996 .
[32] Byung-In Kim,et al. Some extensions to the sweep algorithm , 2011 .
[33] Rekha Pillai,et al. A TSSP+1 decomposition strategy for the vehicle routing problem , 1994 .
[34] M. Goetschalckx,et al. The vehicle routing problem with backhauls , 1989 .
[35] Shen Lin. Computer solutions of the traveling salesman problem , 1965 .
[36] Adam N. Letchford,et al. A new branch-and-cut algorithm for the capacitated vehicle routing problem , 2004, Math. Program..
[37] James P. Kelly,et al. A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem , 1996, Transp. Sci..
[38] David M. Ryan,et al. An Integer Programming Approach to the Vehicle Scheduling Problem , 1976 .
[39] Barrie M. Baker,et al. A genetic algorithm for the vehicle routing problem , 2003, Comput. Oper. Res..
[40] George B. Dantzig,et al. The Truck Dispatching Problem , 1959 .
[41] Magdalene Marinaki,et al. A hybrid genetic - Particle Swarm Optimization Algorithm for the vehicle routing problem , 2010, Expert Syst. Appl..
[42] Marshall L. Fisher,et al. Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees , 1994, Oper. Res..
[43] P. C. Yellow,et al. A Computational Modification to the Savings Method of Vehicle Scheduling , 1970 .
[44] Nicos Christofides,et al. The vehicle routing problem , 1976, Revue française d'automatique, informatique, recherche opérationnelle. Recherche opérationnelle.
[45] Renato F. Werneck,et al. Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem , 2006, Math. Program..
[46] Christian Prins,et al. A simple and effective evolutionary algorithm for the vehicle routing problem , 2004, Comput. Oper. Res..
[47] Nicos Christofides,et al. An Algorithm for the Vehicle-dispatching Problem , 1969 .
[48] P. T. Vanathi,et al. A Hybrid Particle Swarm Optimization with Genetic Operator for Vehicle Routing Problem , 2010 .
[49] Voratas Kachitvichyanukul,et al. Particle swarm optimization and two solution representations for solving the capacitated vehicle routing problem , 2009, Comput. Ind. Eng..
[50] J. K. Lenstra,et al. Complexity of vehicle routing and scheduling problems , 1981, Networks.
[51] Byung-In Kim,et al. A probability matrix based particle swarm optimization for the capacitated vehicle routing problem , 2012, J. Intell. Manuf..
[52] Fred Glover,et al. Extensions of the Petal Method for Vehicle Routeing , 1993 .
[53] Marshall L. Fisher,et al. A generalized assignment heuristic for vehicle routing , 1981, Networks.
[54] Thomas Glyn Hinton. A thesis regarding the vehicle routing problem including a range of novel techniques for its solution , 2010 .
[55] Angel A. Juan,et al. The SR-GCWS hybrid algorithm for solving the capacitated vehicle routing problem , 2008 .
[56] Baozhen Yao,et al. Production , Manufacturing and Logistics An improved ant colony optimization for vehicle routing problem , 2008 .
[57] L. Bodin. ROUTING AND SCHEDULING OF VEHICLES AND CREWS–THE STATE OF THE ART , 1983 .
[58] Temel Öncan,et al. A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem , 2005, J. Oper. Res. Soc..
[59] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[60] Kalyanmoy Deb,et al. Messy Genetic Algorithms: Motivation, Analysis, and First Results , 1989, Complex Syst..
[61] Ping Chen,et al. Iterated variable neighborhood descent algorithm for the capacitated vehicle routing problem , 2010, Expert Syst. Appl..
[62] R. H. Mole,et al. A Sequential Route-building Algorithm Employing a Generalised Savings Criterion , 1976 .