{"id":"https://openalex.org/W2548531066","doi":"https://doi.org/10.1142/s021821301750004x","title":"A Constraint-Based Local Search for Offline and Online General Vehicle Routing","display_name":"A Constraint-Based Local Search for Offline and Online General Vehicle Routing","publication_year":2016,"publication_date":"2016-11-03","ids":{"openalex":"https://openalex.org/W2548531066","doi":"https://doi.org/10.1142/s021821301750004x","mag":"2548531066"},"language":"en","primary_location":{"id":"doi:10.1142/s021821301750004x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s021821301750004x","pdf_url":null,"source":{"id":"https://openalex.org/S178780388","display_name":"International Journal of Artificial Intelligence Tools","issn_l":"0218-2130","issn":["0218-2130","1793-6349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal on Artificial Intelligence Tools","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/A5072551000","display_name":"Quang Dung Pham","orcid":"https://orcid.org/0000-0003-2060-4509"},"institutions":[{"id":"https://openalex.org/I94518387","display_name":"Hanoi University of Science and Technology","ror":"https://ror.org/04nyv3z04","country_code":"VN","type":"education","lineage":["https://openalex.org/I94518387"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Quang Dung Pham","raw_affiliation_strings":["Hanoi University of Science and Technology, 1 Dai Co Viet, Hanoi, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hanoi University of Science and Technology, 1 Dai Co Viet, Hanoi, Vietnam","institution_ids":["https://openalex.org/I94518387"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015111229","display_name":"Kim Thu Le","orcid":"https://orcid.org/0000-0002-4438-999X"},"institutions":[{"id":"https://openalex.org/I94518387","display_name":"Hanoi University of Science and Technology","ror":"https://ror.org/04nyv3z04","country_code":"VN","type":"education","lineage":["https://openalex.org/I94518387"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Kim Thu Le","raw_affiliation_strings":["Hanoi University of Science and Technology, 1 Dai Co Viet, Hanoi, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hanoi University of Science and Technology, 1 Dai Co Viet, Hanoi, Vietnam","institution_ids":["https://openalex.org/I94518387"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102723954","display_name":"Nguy\u1ec5n Thanh Ho\u00e0ng","orcid":"https://orcid.org/0000-0003-4976-7651"},"institutions":[{"id":"https://openalex.org/I94518387","display_name":"Hanoi University of Science and Technology","ror":"https://ror.org/04nyv3z04","country_code":"VN","type":"education","lineage":["https://openalex.org/I94518387"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Hoang Thanh Nguyen","raw_affiliation_strings":["Hanoi University of Science and Technology, 1 Dai Co Viet, Hanoi, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hanoi University of Science and Technology, 1 Dai Co Viet, Hanoi, Vietnam","institution_ids":["https://openalex.org/I94518387"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Van Dinh Pham","orcid":null},"institutions":[{"id":"https://openalex.org/I94518387","display_name":"Hanoi University of Science and Technology","ror":"https://ror.org/04nyv3z04","country_code":"VN","type":"education","lineage":["https://openalex.org/I94518387"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Van Dinh Pham","raw_affiliation_strings":["Hanoi University of Science and Technology, 1 Dai Co Viet, Hanoi, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hanoi University of Science and Technology, 1 Dai Co Viet, Hanoi, Vietnam","institution_ids":["https://openalex.org/I94518387"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016267072","display_name":"Quoc Trung Bui","orcid":null},"institutions":[{"id":"https://openalex.org/I109689652","display_name":"FPT University","ror":"https://ror.org/03esj4g97","country_code":"VN","type":"education","lineage":["https://openalex.org/I109689652"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Quoc Trung Bui","raw_affiliation_strings":["FPT Technology Research Institute, FPT University, 8 Ton That Thuyet, Hanoi, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"FPT Technology Research Institute, FPT University, 8 Ton That Thuyet, Hanoi, Vietnam","institution_ids":["https://openalex.org/I109689652"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8203,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.79109928,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"26","issue":"02","first_page":"1750004","last_page":"1750004"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998000264167786,"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.9998000264167786,"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.9987000226974487,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9937000274658203,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/computer-science","display_name":"Computer science","score":0.8057507276535034},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.6749221682548523},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6282269954681396},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.5534690022468567},{"id":"https://openalex.org/keywords/taxis","display_name":"Taxis","score":0.48799625039100647},{"id":"https://openalex.org/keywords/iterated-local-search","display_name":"Iterated local search","score":0.4796491265296936},{"id":"https://openalex.org/keywords/policy-based-routing","display_name":"Policy-based routing","score":0.45963814854621887},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.4502449035644531},{"id":"https://openalex.org/keywords/flexibility","display_name":"Flexibility (engineering)","score":0.4377925395965576},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4269097149372101},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3353942036628723},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.33257728815078735},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3271350860595703},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3117726147174835},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.3038080632686615},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.19443663954734802},{"id":"https://openalex.org/keywords/transport-engineering","display_name":"Transport engineering","score":0.17751213908195496},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12996932864189148}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8057507276535034},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.6749221682548523},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6282269954681396},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.5534690022468567},{"id":"https://openalex.org/C183373512","wikidata":"https://www.wikidata.org/wiki/Q949618","display_name":"Taxis","level":2,"score":0.48799625039100647},{"id":"https://openalex.org/C124145224","wikidata":"https://www.wikidata.org/wiki/Q6094397","display_name":"Iterated local search","level":3,"score":0.4796491265296936},{"id":"https://openalex.org/C196423136","wikidata":"https://www.wikidata.org/wiki/Q7209671","display_name":"Policy-based routing","level":5,"score":0.45963814854621887},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.4502449035644531},{"id":"https://openalex.org/C2780598303","wikidata":"https://www.wikidata.org/wiki/Q65921492","display_name":"Flexibility (engineering)","level":2,"score":0.4377925395965576},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4269097149372101},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3353942036628723},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.33257728815078735},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3271350860595703},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3117726147174835},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.3038080632686615},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.19443663954734802},{"id":"https://openalex.org/C22212356","wikidata":"https://www.wikidata.org/wiki/Q775325","display_name":"Transport engineering","level":1,"score":0.17751213908195496},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12996932864189148},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s021821301750004x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s021821301750004x","pdf_url":null,"source":{"id":"https://openalex.org/S178780388","display_name":"International Journal of Artificial Intelligence Tools","issn_l":"0218-2130","issn":["0218-2130","1793-6349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal on Artificial Intelligence Tools","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.4399999976158142}],"awards":[{"id":"https://openalex.org/G276148520","display_name":"Nghi\u00ean c\u1ee9u v\u00e0 ph\u00e1t tri\u1ec3n c\u00e1c thu\u1eadt to\u00e1n t\u1ed1i \u01b0u d\u1ef1a tr\u00ean d\u1ef1 \u0111o\u00e1n \u0111\u1ec3 gi\u1ea3i quy\u1ebft c\u00e1c b\u00e0i to\u00e1n \u0111i\u1ec1u h\u00e0nh xe v\u1edbi tham s\u1ed1 kh\u00f4ng c\u1ed1 \u0111\u1ecbnh","funder_award_id":"FWO.102.2013.04","funder_id":"https://openalex.org/F4320309617","funder_display_name":"National Foundation for Science and Technology Development"}],"funders":[{"id":"https://openalex.org/F4320309617","display_name":"National Foundation for Science and Technology Development","ror":"https://ror.org/04rw64z44"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1966175066","https://openalex.org/W1972731897","https://openalex.org/W1978887754","https://openalex.org/W1985290529","https://openalex.org/W1994940434","https://openalex.org/W2096796578","https://openalex.org/W2097685766","https://openalex.org/W2099011086","https://openalex.org/W2108536179","https://openalex.org/W2111174053","https://openalex.org/W2144045033","https://openalex.org/W2158000627","https://openalex.org/W2161865945"],"related_works":["https://openalex.org/W2083844986","https://openalex.org/W2887485518","https://openalex.org/W2005660029","https://openalex.org/W1666350026","https://openalex.org/W1996453501","https://openalex.org/W2346455737","https://openalex.org/W3081534731","https://openalex.org/W3204855000","https://openalex.org/W2949474276","https://openalex.org/W106956141"],"abstract_inverted_index":{"Vehicle":[0],"routing":[1,47,49,53,86,109,128,147,153],"is":[2,22,121],"a":[3,30,74,112],"class":[4,106],"of":[5,13,19,32,38,44,104,107,118,137,175],"combinatorial":[6],"optimization":[7],"problems":[8,21,110,129,148],"arising":[9],"in":[10,93,111],"the":[11,45,94,102,119,122,135,138,155,161,168,176],"industry":[12],"transportation":[14],"and":[15,83,160,173],"logistics.":[16],"The":[17],"goal":[18],"these":[20],"to":[23,100],"compute":[24],"an":[25],"optimal":[26],"route":[27,140],"plan":[28],"for":[29,34,50,54,80,125],"set":[31],"vehicles":[33],"serving":[35],"transport":[36,57],"requests":[37,131],"customers.":[39],"There":[40],"are":[41],"many":[42],"variants":[43],"vehicle":[46,85,108,127,146,152],"problems:":[48],"delivering":[51],"goods,":[52],"demand":[55],"responsive":[56],"(taxi,":[58],"school":[59],"bus,":[60],"\u2026).":[61],"Each":[62],"problem":[63],"might":[64],"have":[65],"different":[66,105],"constraints,":[67],"objectives.":[68],"In":[69],"this":[70],"paper,":[71],"we":[72],"introduce":[73],"Constraint-Based":[75],"Local":[76],"Search":[77],"(CBLS)":[78],"framework":[79,120],"general":[81],"offline":[82],"online":[84,126,133,162],"problems.":[87],"We":[88],"extend":[89],"existing":[90],"neighborhood":[91],"structures":[92],"literature":[95],"by":[96],"proposing":[97],"new":[98],"neighborhoods":[99],"facilitate":[101],"resolution":[103],"unified":[113],"platform.":[114],"A":[115],"novel":[116],"feature":[117],"available":[123],"APIs":[124],"where":[130],"arrive":[132],"during":[134],"execution":[136],"computed":[139],"plan.":[141],"Experimental":[142],"results":[143],"on":[144],"three":[145],"(the":[149],"min-max":[150],"capacitated":[151],"problem,":[154,159],"multi-vehicle":[156],"covering":[157],"tour":[158],"people-andparcel":[163],"share-a-ride":[164],"taxis":[165],"problem)":[166],"show":[167],"modelling":[169],"flexibility,":[170],"genericity,":[171],"extensibility":[172],"efficiency":[174],"proposed":[177],"framework.":[178]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2017,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}