References
- HendersonDSolving the shortest route cut and fill problem using simulated annealingEur J Opl Res2003145728410.1016/S0377-2217(02)00206-0
- LaporteGThe traveling salesman problem: an overview of exact and approximate algorithmsEur J Opl Res19925923124710.1016/0377-2217(92)90138-Y
- LaporteGGendreauMPotvinJ-YSemetFClassical and modern heuristics for the vehicle routing problemInt Trans Opl Res2000728530010.1111/j.1475-3995.2000.tb00200.x
- CharikarMKhullerSRaghavachariBAlgorithms for capacitated vehicle routingSIAM J Comput20013166568210.1137/S0097539701392056
- AnilySBramelJApproximation algorithms for the capacitated traveling salesman problem with pickups and deliveriesNaval Res Logist19994665467010.1002/(SICI)1520-6750(199909)46:6<654::AID-NAV4>3.0.CO;2-A
- RenaudJBoctorFFOuennicheJA heuristic for the pickup and delivery traveling salesman problemComput Opns Res20002790591610.1016/S0305-0548(99)00066-0
- MillerCETuckerAWZemlinRAInteger programming formulations and the traveling salesman problemJ Assoc Comput Mach1960732632910.1145/321043.321046
- HeldMKarpRMThe traveling salesman problem and minimum spanning treesOpns Res1970181138116210.1287/opre.18.6.1138
- HeldMKarpRMThe traveling salesman problem and minimum spanning trees: Part IIMath Programm1971162510.1007/BF01584070
- KirkpatrickSGelattCDJrVecchiMPOptimization by simulated annealingScience198322067168010.1126/science.220.4598.671
- FaigleUKernWSome convergence results for probabilistic tabu searchORSA J Comput19924323710.1287/ijoc.4.1.32
- GloverFFuture paths for integer programming and links to artificial intelligenceComput Opns Res19861353354910.1016/0305-0548(86)90048-1
- MoscatoPAn introduction to population approaches for optimization and heirachical objective functions: a discussion of the role of tabu searchAnn Opns Res1993418512110.1007/BF02022564
- FleisherMAJacobsenSHInformation theory and finite-time behavior of the simulated annealing algorithm: experimental resultsINFORMS J Comput199911354310.1287/ijoc.11.1.35