{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:06:28Z","timestamp":1761620788333,"version":"3.41.2"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2000,10,1]],"date-time":"2000-10-01T00:00:00Z","timestamp":970358400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,10,1]],"date-time":"2000-10-01T00:00:00Z","timestamp":970358400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2000,10]]},"DOI":"10.1023\/a:1009808327381","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T18:53:29Z","timestamp":1040583209000},"page":"389-414","source":"Crossref","is-referenced-by-count":44,"title":["A Comparison of Traditional and Constraint-based Heuristic Methods on Vehicle Routing Problems with Side Constraints"],"prefix":"10.1007","volume":"5","author":[{"given":"Philip","family":"Kilby","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick","family":"Prosser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Shaw","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"269096_CR1","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1287\/ijoc.3.2.149","volume":"3","author":"D. Applegate","year":"1991","unstructured":"Applegate, D., & Cook, W. (1991). A computational study of the job-shop scheduling problem. ORSA Journal On Computing, 3: 149-156.","journal-title":"ORSA Journal On Computing"},{"issue":"3","key":"269096_CR2","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1080\/01966324.1986.10737197","volume":"6","author":"E. K. Baker","year":"1986","unstructured":"Baker, E. K.,& Schaffer, J.R. (1986). Solution improvement heuristics for the vehicle routing and scheduling problem with time window constraints. American Journal of Mathematical and Management Sciences, 6(3): 261-300.","journal-title":"American Journal of Mathematical and Management Sciences"},{"key":"269096_CR3","unstructured":"Caseau, Y., & Laburthe, F. (1995). The CLAIRE documentation. Technical Report LIENS Report 96-15, \u00c9cole Normale Sup\u00e9rieure."},{"key":"269096_CR4","series-title":"Technical report, LIENS Technical Report 95-25","volume-title":"Disjunctive scheduling with task intervals","author":"Y. Caseau","year":"1995","unstructured":"Y. Caseau & Laburthe, F. (1995). Disjunctive scheduling with task intervals. Technical report, LIENS Technical Report 95-25, \u00c9cole Normale Sup\u00e9rieure Paris, France."},{"key":"269096_CR5","doi-asserted-by":"crossref","unstructured":"Caseau, Y., & Laburthe, F. (1997). Solving small TSPs with constraints. In L. Naish, editor, Proceedings of the 14th International Conference on Logic Programming. The MIT Press.","DOI":"10.7551\/mitpress\/4299.003.0028"},{"key":"269096_CR6","doi-asserted-by":"crossref","unstructured":"Caseau, Y., & Laburthe, F. (1998). SALSA: A language for search algorithms. In Proceedings of CP '98, pages 310-324. Springer-Verlag.","DOI":"10.1007\/3-540-49481-2_23"},{"key":"269096_CR7","unstructured":"Cheeseman, P., Kanefsky, B., & Taylor, W. M. (1991). Where the really hard problems are. In Proceedings of the 12th IJCAI, pages 331-337. International Joint Conference on AI."},{"issue":"4","key":"269096_CR8","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G. Clarke","year":"1964","unstructured":"Clarke, G., & Wright, J. (1964). Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12(4): 568-581.","journal-title":"Operations Research"},{"issue":"2","key":"269096_CR9","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/opre.40.2.342","volume":"40","author":"M. Desrochers","year":"1992","unstructured":"Desrochers, M., Desrosiers, J., & Solomon, M. (1992). A new optimization algorithm for the vehicle routing problem with time windows. Operations Research, 40(2): 342-354.","journal-title":"Operations Research"},{"key":"269096_CR10","doi-asserted-by":"crossref","unstructured":"Glover, F. W., & Laguna, M. (1997). Tabu Search. Kluwer Academic.","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"269096_CR11","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","volume":"14","author":"R. M. Haralick","year":"1980","unstructured":"Haralick, R. M.,& Elliott, G. L. (1980). Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence, 14: 263-313.","journal-title":"Artificial Intelligence"},{"key":"269096_CR12","unstructured":"Harvey, W. D., & Ginsberg, M. L. (1995). Limited discrepancy search. In Proceedings of the 14th IJCAI."},{"key":"269096_CR13","unstructured":"ILOG S.A., 9, Rue de Verdun, Gentilly, France. ILOG Dispatcher Reference Manual, Version 2.0."},{"key":"269096_CR14","unstructured":"ILOG S.A., 9, Rue de Verdun, Gentilly, France. ILOG Solver Reference Manual, Version 4.3."},{"key":"269096_CR15","first-page":"337","volume-title":"Local Search in Combinatorial Optimization","author":"G. A. P. Kindervater","year":"1997","unstructured":"Kindervater, G. A. P., & Savelsbergh, M. W. P. (1997). Vehicle routing: Handling edge exchanges. In E. H. L. Aarts and J. K. Lenstra, editors, Local Search in Combinatorial Optimization, pages 337-360. Wiley, Chichester."},{"key":"269096_CR16","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 220: 671-680.","journal-title":"Science"},{"key":"269096_CR17","unstructured":"Kohl, N., Desrosiers, J., Madsen, O. B. G., Solomon, M. M., & Soumis, F. (1997). 2-path cuts for the vehicle routing problem with time windows. Technical Report G-97-19, Les Cahiers du GERAD."},{"key":"269096_CR18","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S. Lin","year":"1965","unstructured":"Lin, S. (1965). Computer solutions of the traveling salesman problem. Bell Systems Technology Journal, 44: 2245-2269.","journal-title":"Bell Systems Technology Journal"},{"key":"269096_CR19","volume-title":"Travelling Salesman-Type Combinatorial Problems and Their Relation to the Logistics of Blood-Banking","author":"I. Or","year":"1976","unstructured":"Or, I. (1976). Travelling Salesman-Type Combinatorial Problems and Their Relation to the Logistics of Blood-Banking. PhD thesis, Department of Industrial Engineering and Management Sciences, Northwest University, Evanston, IL."},{"key":"269096_CR20","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1287\/trsc.32.1.12","volume":"32","author":"G. Pesant","year":"1998","unstructured":"Pesant, G., Gendreau, M., Potvin, J.-Y., & Rousseau, J.-M. (1998). An exact constraint logic programming algorithm for the traveling salesman problem with time windows. Transportation Science, 32: 12-29.","journal-title":"Transportation Science"},{"key":"269096_CR21","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0377-2217(93)90221-8","volume":"66","author":"J.-Y. Potvin","year":"1993","unstructured":"Potvin, J.-Y., & Rousseau, J.-M. (1993). A parallel route building algorithm for the vehicle routing and scheduling problem with time windows. European Journal of Operational Research, 66: 331-340.","journal-title":"European Journal of Operational Research"},{"key":"269096_CR22","doi-asserted-by":"crossref","first-page":"1433","DOI":"10.1057\/jors.1995.204","volume":"46","author":"J.-Y. Potvin","year":"1995","unstructured":"Potvin, J.-Y., & Rousseau, J.-M. (1995). An exchange heuristic for routing problems with time windows. Journal of the Operations Research Society, 46: 1433-1446.","journal-title":"Journal of the Operations Research Society"},{"key":"269096_CR23","unstructured":"Puget, J.-F., & Leconte, M. (1995). Beyond the glass-box: Constraints as objects. In Proceedings of ILPS '95. MIT Press."},{"issue":"1","key":"269096_CR24","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02430370","volume":"1","author":"Y. Rochat","year":"1995","unstructured":"Rochat, Y., & Taillard, E. D. (1995). Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics, 1(1): 147-167.","journal-title":"Journal of Heuristics"},{"issue":"2","key":"269096_CR25","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1287\/trsc.29.2.156","volume":"29","author":"R. A. Russel","year":"1995","unstructured":"Russel, R. A. (1995). Hybrid heuristics for the vehicle routing problem with time windows. Transportation Science, 29(2): 156-166.","journal-title":"Transportation Science"},{"key":"269096_CR26","volume-title":"Computer aided routing","author":"M.W.P. Savelsbergh","year":"1988","unstructured":"Savelsbergh, M.W.P. (1988). Computer aided routing. Centrum voorWiskunde en Informatica, Amsterdam."},{"issue":"1","key":"269096_CR27","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1287\/trsc.29.1.17","volume":"29","author":"M.W.P. Savelsbergh","year":"1995","unstructured":"Savelsbergh, M.W.P., & Sol, M. (1995). The general pickup and delivery problem. Transportation Science, 29(1): 17-39","journal-title":"Transportation Science"},{"key":"269096_CR28","unstructured":"Shaw, P. (1998). Implementation of LNS for constrained VRPs. APES Report. http:\/\/www.cs.strath.ac.uk\/~apes."},{"key":"269096_CR29","doi-asserted-by":"crossref","unstructured":"Shaw, P. (1998). Using constraint programming and local search methods to solve vehicle routing problems. In M. Maher and J.-F. Puget, editors, Fourth International Conference on Principles and Practice of Constraint Programming (CP '98), pages 417-431. Springer-Verlag.","DOI":"10.1007\/3-540-49481-2_30"},{"key":"269096_CR30","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"M. M. Solomon","year":"1987","unstructured":"Solomon, M. M. (1987). Algorithms for the vehicle routing and scheduling problem with time window constraints. Operations Research, 35: 254-265.","journal-title":"Operations Research"},{"key":"269096_CR31","doi-asserted-by":"crossref","unstructured":"Taillard, E., Badeau, P., Gendreau, M., Guertin, F., & Potvin, J.-Y. (1997). A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Science, 31(2).","DOI":"10.1287\/trsc.31.2.170"},{"key":"269096_CR32","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1002\/net.3230230804","volume":"23","author":"E. D. Taillard","year":"1993","unstructured":"Taillard, E. D. (1993). Parallel iterative search methods for vehicle routing problems. Networks, 23: 661-676.","journal-title":"Networks"},{"issue":"3&4","key":"269096_CR33","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1080\/01966324.1993.10737361","volume":"13","author":"S. R. Thangiah","year":"1993","unstructured":"Thangiah, S. R., Osman, I. H., Vinayagamoorthy, R., & Sun, T. (1993). Algorithms for the vehicle routing problems with time deadlines. American Journal of Mathematical and Management Sciences, 13(3&4): 323-355.","journal-title":"American Journal of Mathematical and Management Sciences"},{"issue":"1","key":"269096_CR34","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1287\/trsc.31.1.60","volume":"31","author":"P. Toth","year":"1997","unstructured":"Toth, P., & Vigo, D. (1997). Heuristic algorithms for the handicapped persons transportation problem. Transportation Science, 31(1): 60-71.","journal-title":"Transportation Science"},{"key":"269096_CR35","volume-title":"Constraint Satisfaction in Logic Programming","author":"P. van Hentenyrck","year":"1989","unstructured":"van Hentenyrck, P. (1989). Constraint Satisfaction in Logic Programming. The MIT Press, Cambridge, MA."},{"issue":"2","key":"269096_CR36","first-page":"80","volume":"113","author":"C. Voudouris","year":"1998","unstructured":"Voudouris, C., & Tsang, E. P. K. (1998). Guided local search. European Journal of Operational Research, 113(2): 80-110.","journal-title":"European Journal of Operational Research"},{"key":"269096_CR37","unstructured":"Walsh, T. (1997). Depth-bounded discrepency search. In Proceeedings of the 15th IJCAI."}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009808327381.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009808327381\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009808327381.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:46:09Z","timestamp":1752378369000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009808327381"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,10]]},"references-count":37,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2000,10]]}},"alternative-id":["269096"],"URL":"https:\/\/doi.org\/10.1023\/a:1009808327381","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"type":"print","value":"1383-7133"},{"type":"electronic","value":"1572-9354"}],"subject":[],"published":{"date-parts":[[2000,10]]}}}