References
- AgarwalYMathurKSalkinHMA set-partitioning-based exact algorithm for the vehicle routing problemNetworks19891973174910.1002/net.3230190702
- Augerat P, Belenger JM, Benavent E, Corberán A, Naddef D, 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.
- AugeratPBelengerJMBenaventECorberánANaddefDSeparating capacity constraints in the CVRP using tabu searchEur J Opl Res199910654655710.1016/S0377-2217(97)00290-7
- BodinLBermanLRouting and scheduling of school buses by computerTransport Sci19791311312910.1287/trsc.13.2.113
- BodinLGoldenBAssadABallMRouting and scheduling of vehicles and crews. The state of the artComput Opns Res1983106321110.1016/0305-0548(83)90030-8
- ClarkeGWrightJScheduling of vehicles from a central depot to a number of delivering pointsOpns Res19641256858110.1287/opre.12.4.568
- FeoTAResendeMGCA probabilistic heuristic for a computationally difficult set covering problemOpns Res Lett19958677110.1016/0167-6377(89)90002-3
- FeoTAResendeMGCGreedy randomized adaptive search proceduresJ Glob Optim1989610913310.1007/BF01096763
- FischettiMTothPVigoDA branch-and-bound algorithm for the capacitated vehicle routing problem on direct graphsOpns Res19944284685910.1287/opre.42.5.846
- FrelingRWagelmansAPMPinto PaixãoJMModels and algorithms for single-depot vehicle schedulingTransport Sci20013516518010.1287/trsc.35.2.165.10135
- GaskellTJBases for the vehicle fleet schedulingOpl Res Quart19671828129510.1057/jors.1967.44
- GendreauMHertzALaporteGA tabu search heuristic for the vehicle routing problemMngt Sci1994401276129010.1287/mnsc.40.10.1276
- GillettBEMillerLRA heuristic algorithm for the vehicle-dispatch problemOpns Res19742234034910.1287/opre.22.2.340
- GoldenBLAssadAAVehicle Routing: Methods and Studies1991
- GoldenBMagnantiTNguyenHImplementing vehicle routing algorithmsNetworks1977711314810.1002/net.3230070203
- GutinGPunnenAPThe Traveling Salesman Problem and Its Variations2002
- LaporteGNobertYExact algorithms for the vehicle routing problemAnn Discr Math198731147184
- LaporteGGendreauMPotvinJYSemetFClassical and modern heuristics for the vehicle routing problemInt Trans Opl Res2000728530010.1111/j.1475-3995.2000.tb00200.x
- LawlerELLenstraJKRinnooy KanAHGShmoysDBThe Traveling Salesman Problem1985
- LinSKernighanBWAn effective heuristic algorithm for the traveling-salesman problemOpns Res19731149851610.1287/opre.21.2.498
- Raff SJ Punnen A (eds). (1999). The traveling salesman problem. Comput Opns Res 26: 293–441.
- SolomonMMAlgorithms for the vehicle routing and scheduling problem with time window constraintsOpns Res19873525426510.1287/opre.35.2.254
- SolomonMMLogisticsEncyclopaedia of Operations Research and Management Science1996354357
- TothPVigoDThe Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications2002
- Van BreedamAComparing descent heuristics and metaheuristics for the vehicle routing problemComput Opns Res20012828931510.1016/S0305-0548(99)00101-X
- Watson-GandyCDTA note on the centre of gravity in depot locationMngt Sci197218B-478B-48110.1287/mnsc.18.8.B478