{"id":"https://openalex.org/W1515177345","doi":"https://doi.org/10.1023/a:1009621410177","title":"Solving Vehicle Routing Problems Using Constraint Programming and Metaheuristics","display_name":"Solving Vehicle Routing Problems Using Constraint Programming and Metaheuristics","publication_year":2000,"publication_date":"2000-09-01","ids":{"openalex":"https://openalex.org/W1515177345","doi":"https://doi.org/10.1023/a:1009621410177","mag":"1515177345"},"language":"en","primary_location":{"id":"doi:10.1023/a:1009621410177","is_oa":false,"landing_page_url":"https://doi.org/10.1023/a:1009621410177","pdf_url":null,"source":{"id":"https://openalex.org/S111418578","display_name":"Journal of Heuristics","issn_l":"1381-1231","issn":["1381-1231","1572-9397"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Heuristics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5084945730","display_name":"Bruno De Backer","orcid":"https://orcid.org/0000-0001-6151-6009"},"institutions":[{"id":"https://openalex.org/I2801857525","display_name":"Kellogg's (Canada)","ror":"https://ror.org/02y751y19","country_code":"CA","type":"company","lineage":["https://openalex.org/I2801857525","https://openalex.org/I4210105924"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Bruno De Backer","raw_affiliation_strings":["ILOG S.A., 9 Rue de Verdun, Gentilly, France","ILOG S.A., 9 Rue de Verdun, Gentilly, France. debacker@ilog.fr#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ILOG S.A., 9 Rue de Verdun, Gentilly, France","institution_ids":["https://openalex.org/I2801857525"]},{"raw_affiliation_string":"ILOG S.A., 9 Rue de Verdun, Gentilly, France. debacker@ilog.fr#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046746934","display_name":"Vincent Furnon","orcid":null},"institutions":[{"id":"https://openalex.org/I2801857525","display_name":"Kellogg's (Canada)","ror":"https://ror.org/02y751y19","country_code":"CA","type":"company","lineage":["https://openalex.org/I2801857525","https://openalex.org/I4210105924"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Vincent Furnon","raw_affiliation_strings":["ILOG S.A., 9 Rue de Verdun, Gentilly, France","ILOG S.A., 9 Rue de Verdun, Gentilly, France. [email\u00a0protected]#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ILOG S.A., 9 Rue de Verdun, Gentilly, France","institution_ids":["https://openalex.org/I2801857525"]},{"raw_affiliation_string":"ILOG S.A., 9 Rue de Verdun, Gentilly, France. [email\u00a0protected]#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080554885","display_name":"Paul Shaw","orcid":"https://orcid.org/0000-0002-6488-5288"},"institutions":[{"id":"https://openalex.org/I2801857525","display_name":"Kellogg's (Canada)","ror":"https://ror.org/02y751y19","country_code":"CA","type":"company","lineage":["https://openalex.org/I2801857525","https://openalex.org/I4210105924"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Paul Shaw","raw_affiliation_strings":["ILOG S.A., 9 Rue de Verdun, Gentilly, France","ILOG S.A., 9 Rue de Verdun, Gentilly, France. [email\u00a0protected]#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ILOG S.A., 9 Rue de Verdun, Gentilly, France","institution_ids":["https://openalex.org/I2801857525"]},{"raw_affiliation_string":"ILOG S.A., 9 Rue de Verdun, Gentilly, France. [email\u00a0protected]#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023298229","display_name":"Philip Kilby","orcid":"https://orcid.org/0000-0001-7349-1179"},"institutions":[{"id":"https://openalex.org/I1292875679","display_name":"Commonwealth Scientific and Industrial Research Organisation","ror":"https://ror.org/03qn8fb07","country_code":"AU","type":"government","lineage":["https://openalex.org/I1292875679","https://openalex.org/I2801453606","https://openalex.org/I4387156119"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Philip Kilby","raw_affiliation_strings":["CSIRO Mathematical and Information Sciences, GPO Box 664, Canberra, ACT, 2601, Australia","CSIRO Mathematical and Information Sciences, GPO Box 664, Canberra ACT 2601, Australia. phil.kilby@cmis.csiro.au#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CSIRO Mathematical and Information Sciences, GPO Box 664, Canberra, ACT, 2601, Australia","institution_ids":["https://openalex.org/I1292875679"]},{"raw_affiliation_string":"CSIRO Mathematical and Information Sciences, GPO Box 664, Canberra ACT 2601, Australia. phil.kilby@cmis.csiro.au#TAB#","institution_ids":["https://openalex.org/I1292875679"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070869501","display_name":"Patrick Prosser","orcid":"https://orcid.org/0000-0003-4460-6912"},"institutions":[{"id":"https://openalex.org/I181647926","display_name":"University of Strathclyde","ror":"https://ror.org/00n3w3b69","country_code":"GB","type":"education","lineage":["https://openalex.org/I181647926"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Patrick Prosser","raw_affiliation_strings":["Department of Computer Science, University of Strathclyde, Glasgow, Scotland","Department of Computer Science, University of Strathclyde, Glasgow, Scotland.  pat@cs.strath.ac.uk"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Strathclyde, Glasgow, Scotland","institution_ids":["https://openalex.org/I181647926"]},{"raw_affiliation_string":"Department of Computer Science, University of Strathclyde, Glasgow, Scotland.  pat@cs.strath.ac.uk","institution_ids":["https://openalex.org/I181647926"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":27.6252,"has_fulltext":false,"cited_by_count":178,"citation_normalized_percentile":{"value":0.99790868,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"6","issue":"4","first_page":"501","last_page":"523"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11942","display_name":"Transportation and Mobility Innovations","score":0.991100013256073,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9811000227928162,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/guided-local-search","display_name":"Guided Local Search","score":0.8281445503234863},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7282065153121948},{"id":"https://openalex.org/keywords/tabu-search","display_name":"Tabu search","score":0.6847656965255737},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.6574004888534546},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.6325492858886719},{"id":"https://openalex.org/keywords/maxima-and-minima","display_name":"Maxima and minima","score":0.6087857484817505},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5832290649414062},{"id":"https://openalex.org/keywords/hill-climbing","display_name":"Hill climbing","score":0.5705561637878418},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.535476803779602},{"id":"https://openalex.org/keywords/iterated-local-search","display_name":"Iterated local search","score":0.48614856600761414},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.4847078323364258},{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.483806312084198},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.4119677245616913},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.3815816044807434},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34616219997406006},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3123204708099365}],"concepts":[{"id":"https://openalex.org/C90189156","wikidata":"https://www.wikidata.org/wiki/Q5615481","display_name":"Guided Local Search","level":3,"score":0.8281445503234863},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7282065153121948},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.6847656965255737},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.6574004888534546},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.6325492858886719},{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.6087857484817505},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5832290649414062},{"id":"https://openalex.org/C135450995","wikidata":"https://www.wikidata.org/wiki/Q820272","display_name":"Hill climbing","level":2,"score":0.5705561637878418},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.535476803779602},{"id":"https://openalex.org/C124145224","wikidata":"https://www.wikidata.org/wiki/Q6094397","display_name":"Iterated local search","level":3,"score":0.48614856600761414},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.4847078323364258},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.483806312084198},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.4119677245616913},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.3815816044807434},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34616219997406006},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3123204708099365},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1023/a:1009621410177","is_oa":false,"landing_page_url":"https://doi.org/10.1023/a:1009621410177","pdf_url":null,"source":{"id":"https://openalex.org/S111418578","display_name":"Journal of Heuristics","issn_l":"1381-1231","issn":["1381-1231","1572-9397"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Heuristics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W36084907","https://openalex.org/W109225361","https://openalex.org/W178466556","https://openalex.org/W650429009","https://openalex.org/W1480778854","https://openalex.org/W1554727768","https://openalex.org/W1559215823","https://openalex.org/W1571106608","https://openalex.org/W1606316903","https://openalex.org/W1678058668","https://openalex.org/W2007401074","https://openalex.org/W2011039300","https://openalex.org/W2040678783","https://openalex.org/W2059615070","https://openalex.org/W2084977713","https://openalex.org/W2091568727","https://openalex.org/W2096305430","https://openalex.org/W2103480272","https://openalex.org/W2104670598","https://openalex.org/W2108536179","https://openalex.org/W2111581650","https://openalex.org/W2114712485","https://openalex.org/W2135644739","https://openalex.org/W2148673189","https://openalex.org/W2162508334","https://openalex.org/W2339500526","https://openalex.org/W2798832212","https://openalex.org/W4212899374","https://openalex.org/W4246598646","https://openalex.org/W6639492365","https://openalex.org/W6703727622"],"related_works":["https://openalex.org/W4237368524","https://openalex.org/W2123829500","https://openalex.org/W4252370918","https://openalex.org/W4247343174","https://openalex.org/W90886653","https://openalex.org/W1548986920","https://openalex.org/W2168643831","https://openalex.org/W1987877777","https://openalex.org/W1533229056","https://openalex.org/W2492630225"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":9}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2016-06-24T00:00:00"}