References
- ApplegateDLBixbyREChvátalVCookWJThe Traveling Salesman Problem: A Computational Study2007
- AscheuerNFischettiMGrötschelMA polyhedral study of the asymmetric travelling salesman problem with time windowsNetworks2000362697910.1002/1097-0037(200009)36:2<69::AID-NET1>3.0.CO;2-Q
- AscheuerNFischettiMGrötschelMSolving the asymmetric travelling salesman problem with time windows by branch-and-cutMathematical Programming A200190347550610.1007/PL00011432
- BarnhartCJohnsonELNemhauserGLSavelsberghMWPVancePHBranch-and-price: Column generation for solving huge integer programsOperations Research199846331632910.1287/opre.46.3.316
- BektasTThe multiple traveling salesman problem: An overview of formulations and solution proceduresOmega200634320921910.1016/j.omega.2004.10.004
- ClimerSZhangWCut-and-solve: An iterative search strategy for combinatorial optimization problemsArtificial Intelligence20061708–971473810.1016/j.artint.2006.02.005
- CordeauJFLaporteGMercierAA unified tabu search heuristic for vehicle routing problems with time windowsJournal of the Operational Research Society200152892893610.1057/palgrave.jors.2601163
- GoldbergDEGenetic Algorithms in Search, Optimization and Machine Learning1989
- Gomes CP, Selman B and Kautz H (1998). Boosting combinatorial search through randomization. In: Proceedings of the 15th National Conference on Artificial Intelligence (AAAI), AAAI Press; The MIT Press, Cambridge, MA, pp 431–437.
- GutinGPunnenAPThe Traveling Salesman Problem and Its Variations2002
- LinSKernighanBWAn effective heuristic algorithm for the traveling-salesman problemOperations Research197321249851610.1287/opre.21.2.498
- NagyGSalhiSLocation-routing: Issues, models and methodsEuropean Journal of Operational Research2007177264967210.1016/j.ejor.2006.04.004
- NemhauserGLWolseyLAInteger and Combinatorial Optimization1999
- PesantGGendreauMPotvinJ-YRousseauJMOn the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problemEuropean Journal of Operational Research1999117225326310.1016/S0377-2217(98)00248-3
- RosenkrantzDJStearnsRELewisPMAn analysis of several heuristics for the traveling salesman problemSIAM Journal on Computing19776356358110.1137/0206041
- SouffriauWVansteenwegenPVertommenJVanden BergheGVan OudheusdenDA personalized tourist trip design algorithm for mobile tourist guidesApplied Artificial Intelligence2008221096498510.1080/08839510802379626
- TothPVigoDThe Vehicle Routing Problem. Monographs on Discrete Mathematics and Applications2002
- VansteenwegenPSouffriauWSörensenKSolving the mobile mapping van problem: A hybrid metaheuristic for capacitated arc routing with soft time windowsComputers and Operational Research201037111870187610.1016/j.cor.2009.05.006
- VansteenwegenPSouffriauWSörensenKThe travelling salesperson problem with hotel selectionJournal of the Operational Research Society201263220721710.1057/jors.2011.18
- VansteenwegenPSouffriauWVan OudheusdenDThe orienteering problem: A surveyEuropean Journal of Operational Research2011209111010.1016/j.ejor.2010.03.045