References
- AltınelIKÖncanTA new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problemJ Opl Res Soc20055695496110.1057/palgrave.jors.2601916
- Augerat P, Belenguer JM, Benavent E, Corberan A, Naddef D and Rinaldi G (1995). Computational results with a branch and cut code for the capacitated vehicle routing problem. Technical report RR 949-M, University Joseph Fourier, Grenoble, France.
- ChandranBGoldenBWasilEA computational study of three demon algorithm variants for solving the travelling salesman problemComputational Modelling and Problem Solving in the Networked World: Interfaces in Computer Science and Operations Research2003155175
- ChristofidesNEilonSAn algorithm for the vehicle routing dispatching problemOpl Res Quart19692030931810.1057/jors.1969.75
- ChristofidesNMingozziATothPThe vehicle routing problemCombinatorial Optimization1979315338
- ClarkeGWrightJScheduling of vehicles from a central depot to a number of delivery pointsOpns Res19641256858110.1287/opre.12.4.568
- GaskellTJBases for vehicle fleet schedulingOpl Res Quart19671828129510.1057/jors.1967.44
- GoldenBPepperJVossenTUsing genetic algorithms for setting parameter values in heuristic searchIntelligent Engineering System through Artificial Neural Networks1998239245
- HollandHAdaptation in Natural and Artificial Systems1992
- MichalewiczZGenetic Algorithms + Data Structures = Evolution Programs1996
- PaessensHThe savings algorithm for the vehicle routing problemEur J Opl Res19883433634410.1016/0377-2217(88)90154-3
- PepperJGoldenBWasilESolving the travel salesman problem with annealing-based heuristics: A computational studyIEEE Trans Syst Man Cybernet A2002321727710.1109/3468.995530
- TothPVigoDThe Vehicle Routing Problem2001
- YellowPA computational modification to the savings method of vehicle schedulingOps Res Quart19702128128310.1057/jors.1970.52