References
- AltınelİKÖ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, Corberán 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, Université Joseph Fourier, Grenoble.
- ChristofidesNEilonSAn algorithm for the vehicle dispatching problemOpl Res Quart19692030931810.1057/jors.1969.75
- ChristofidesNMingozziATothPThe vehicle routing problemCombinatorial Optimization1979315338
- ClarkeGWrightJWScheduling of vehicles from a central depot to a number of delivery pointsOpns Res19641256858110.1287/opre.12.4.568
- DantzigGBRamserJHThe truck dispatching problemMngt Sci19596809110.1287/mnsc.6.1.80
- DoyuranTÇatayBTwo enhanced savings functions for the Clark–Wright algorithmManagement in Logistics Networks and Nodes: Concepts, Technology and Applications. Series on Operations and Technology Management 82008245258
- GaskellTJBases for vehicle fleet schedulingOpns Res196718281295
- LaporteGSemetFClassical heuristics for the vehicle routing problemThe Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications2001109128
- LaporteGGendreauMPotvinJSemetFClassical and modern heuristics for the vehicle routing problemInt Trans Opns Res2000728530010.1111/j.1475-3995.2000.tb00200.x
- MartelloSTothPKnapsack Problems: Algorithms and Computer Implementations1990
- PaessensHThe savings algorithm for the vehicle routing problemEur J Opl Res19883433634410.1016/0377-2217(88)90154-3
- TothPVigoDThe Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications2002
- WrenAHolidayAComputer scheduling of vehicles from one or more depots to a number of delivery pointsOpl Res Quart19722333334410.1057/jors.1972.53
- YellowPA computational modification to the savings method of vehicle schedulingOpl Res Quart19702128128310.1057/jors.1970.52