A Set-Partitioning-Based Heuristic for the Vehicle Routing Problem

References

• Christofides N., Mingozzi A., Toth P., Christofides N., A. Mingozzi, Toth P., Sandi C. The vehicle routing problem. Combin. Optim. (1979) (Wiley, Chichester) 315–338Google Scholar
• Clarke G., Wright J. W. Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. (1964) 12:568–581Link, Google Scholar
• Cullen F., Jarvis J., Ratiff H. D. Set partitioning based heuristics for interactive routing. Networks (1981) 11:125–144Crossref, Google Scholar
• Fisher M. A. Optimal solution of vehicle routing problems using minimum K-trees. Oper. Res. (1994) 42:626–642Link, Google Scholar
• Gaskell T. Bases for vehicle fleet scheduling. Oper. Res. Quart. (1967) 18:281–295Crossref, Google Scholar
• Gendreau M., Hertz A., Laporte G. A tabu search heuristic for the vehicle routing problem. Management Sci. (1994) 40:1276–1290Link, Google Scholar
• Glover F. Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. (1986) 5:533–549Crossref, Google Scholar
• Glover F. Ejection chains reference structures and alternating path methods for travelling salesman problems. (1992) . Working paper, School of Business, University of Colorado at Boulder, Boulder, COGoogle Scholar
• Glover F. Tabu search fundamentals and uses. (1995) . Working paper Graduate School of Business, University of Colorado at BoulderGoogle Scholar
• Glover F., Barr R., Helgason R. V., Kennington J. Tabu search and adaptive memory programming—Advances applications and challenges. Interface in Computer Science and Operations Research (1996) (Kluwer Academic Publishers, MA) . To appear inGoogle Scholar
• Hadjiconstantinou E., Christofides N., Mingozzi A. A new exact algorithm for the vehicle routing problem based on q-path and k-shortest path relaxations. Ann. Oper. Res. (1995) 61:21–44Crossref, Google Scholar
• Lin S. Computer solutions of the traveling salesman problem. Bell System Comput. J. (1965) 44:2245–2269Crossref, Google Scholar
• Lin S., Kernighan B. W. An effective heuristic algorithm for the traveling salesman problem. Oper. Res. (1973) 21:498–516Link, Google Scholar
• Or I. Traveling salesman-type combinatorial optimization problems and their relation to the logistics of regional blood banking. (1976) (Northwestern University, Evansion, IL) . Ph.D. dissertationGoogle Scholar
• Osman I. H. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann. Oper. Res. (1993) 41:421–451Crossref, Google Scholar
• Paessen H. The savings algorithm for the vehicle routing problem. Eur. J. Oper. Res. (1988) 34:336–344Crossref, Google Scholar
• Rego C., Roucairol C., Osman I. H., Kelly J. P. A parallel tabu search algorithm using ejection chains for the vehicle routing problem. Meta-Heuristics: Theory & Applications (1996) (Kluwer Academic Publishers, MA) Crossref, Google Scholar
• Rochat Y., Taillard E. Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics (1995) 1:147–167Crossref, Google Scholar
• Stewart W. R., Kelly J. P., Laguna M. Solving vehicle routing problems using generalized assignments and tabu search. (1994) . Working paper, College of Business Administration, University of Colorado at Boulder, Boulder, COGoogle Scholar
• Taillard E. Parallel iterative search methods for vehicle routing problems. Networks (1993) 23:661–673Crossref, Google Scholar
• Taillard E. A heuristic column generation method for the heterogeneous fleet VRP. (1996) . Working Paper, Centre de Recherche sur les transports, Universite de Montreal, Publication CRT-96-03Google Scholar
• Xu J., Chiu S. Y., Glover F. Fine-tuning a tabu search algorithm with statistical tests. Internat. Trans. Oper. Res. (1998) 5:233–244Crossref, Google Scholar
• Xu J., Kelly J. P. A new network flow-based tabu search heuristic for the vehicle routing problem. Transportation Sci. (1996) 30:379–393Link, Google Scholar
• Yellow P. A computational modification to the savings method of vehicle scheduling. Oper. Res. Quart. (1970) 21:281–283Crossref, Google Scholar