{"id":"https://openalex.org/W2147946877","doi":"https://doi.org/10.1145/1852611.1852613","title":"Constraint-based local search for solving non-simple paths problems on graphs","display_name":"Constraint-based local search for solving non-simple paths problems on graphs","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2147946877","doi":"https://doi.org/10.1145/1852611.1852613","mag":"2147946877"},"language":"en","primary_location":{"id":"doi:10.1145/1852611.1852613","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1852611.1852613","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2010 Symposium on Information and Communication Technology - SoICT '10","raw_type":"proceedings-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/A5101806272","display_name":"Quang-Dung Pham","orcid":null},"institutions":[{"id":"https://openalex.org/I95674353","display_name":"UCLouvain","ror":"https://ror.org/02495e989","country_code":"BE","type":"education","lineage":["https://openalex.org/I95674353"]}],"countries":["BE"],"is_corresponding":true,"raw_author_name":"Quang-Dung Pham","raw_affiliation_strings":["Universit\u00e9 catholique de Louvain, Louvain-la-Neuve, Belgium"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 catholique de Louvain, Louvain-la-Neuve, Belgium","institution_ids":["https://openalex.org/I95674353"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025397806","display_name":"Phan-Thuan Do","orcid":null},"institutions":[{"id":"https://openalex.org/I64519617","display_name":"Hanoi University","ror":"https://ror.org/01mxx0e62","country_code":"VN","type":"education","lineage":["https://openalex.org/I64519617"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Phan-Thuan Do","raw_affiliation_strings":["Hanoi University of Technology, Hanoi, Vietnam"],"affiliations":[{"raw_affiliation_string":"Hanoi University of Technology, Hanoi, Vietnam","institution_ids":["https://openalex.org/I64519617"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028020435","display_name":"Yves Deville","orcid":"https://orcid.org/0000-0002-6711-9992"},"institutions":[{"id":"https://openalex.org/I95674353","display_name":"UCLouvain","ror":"https://ror.org/02495e989","country_code":"BE","type":"education","lineage":["https://openalex.org/I95674353"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Yves Deville","raw_affiliation_strings":["Universit\u00e9 catholique de Louvain, Louvain-la-Neuve, Belgium"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 catholique de Louvain, Louvain-la-Neuve, Belgium","institution_ids":["https://openalex.org/I95674353"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076775389","display_name":"Tuong Vinh Ho","orcid":"https://orcid.org/0000-0002-8755-4756"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tuong-Vinh Ho","raw_affiliation_strings":["Institut de la Francophonie, Hanoi, Vietnam"],"affiliations":[{"raw_affiliation_string":"Institut de la Francophonie, Hanoi, Vietnam","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5101806272"],"corresponding_institution_ids":["https://openalex.org/I95674353"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.22590523,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"1"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9993000030517578,"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.9993000030517578,"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/T11106","display_name":"Data Management and Algorithms","score":0.9886000156402588,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9817000031471252,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6365896463394165},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5991780161857605},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.579443633556366},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5263479948043823},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5099984407424927},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.44669175148010254},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.42697572708129883},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40976572036743164},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3633909523487091},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2946038842201233}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6365896463394165},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5991780161857605},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.579443633556366},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5263479948043823},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5099984407424927},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.44669175148010254},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.42697572708129883},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40976572036743164},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3633909523487091},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2946038842201233},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1852611.1852613","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1852611.1852613","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2010 Symposium on Information and Communication Technology - SoICT '10","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5199999809265137,"id":"https://metadata.un.org/sdg/13","display_name":"Climate action"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1527511816","https://openalex.org/W1539964999","https://openalex.org/W1591532012","https://openalex.org/W1636359169","https://openalex.org/W1994048062","https://openalex.org/W2010597367","https://openalex.org/W2011039300","https://openalex.org/W2099466544","https://openalex.org/W2106841911","https://openalex.org/W2111563176","https://openalex.org/W2130679277","https://openalex.org/W2159176259","https://openalex.org/W2166669220","https://openalex.org/W2436071425","https://openalex.org/W3211548125"],"related_works":["https://openalex.org/W2018691209","https://openalex.org/W4312143452","https://openalex.org/W4247364272","https://openalex.org/W3133151256","https://openalex.org/W2132920749","https://openalex.org/W2101108574","https://openalex.org/W2157331354","https://openalex.org/W2626773395","https://openalex.org/W3131953714","https://openalex.org/W1585007175"],"abstract_inverted_index":{"Routing":[0],"problems":[1,7,29],"have":[2,131],"been":[3],"considered":[4],"as":[5],"central":[6],"in":[8,119,128,146],"the":[9,54,73,110,120,150,153,175,177,212,216,232,238,246,253,257,274],"fields":[10],"of":[11,106,122,136,152,181,185,188,199,218,231,240,259,273],"transportation,":[12],"distribution":[13],"and":[14,24,78,85,168,209,214,251],"logistics.":[15],"LS(Graph)":[16,74],"is":[17,235,265],"a":[18,125,134,143,165,169,183,197,219],"generic":[19],"framework":[20,75,255],"allowing":[21],"to":[22,39,56,62,83,132,148,236,256,269,281],"model":[23,84,264],"solve":[25,86,270],"constrained":[26,87],"optimum":[27],"paths":[28,36,55,88,97],"on":[30,48,96,142],"graphs":[31],"by":[32,76],"local":[33],"search":[34],"where":[35,90,276],"are":[37,59,279],"known":[38,61],"be":[40,46,57,63,94,227,282],"elementary":[41],"(i.e.,":[42],"edges,":[43,91],"vertices":[44,92],"cannot":[45,195],"repeated":[47,95],"paths).":[49,100],"In":[50,68],"many":[51],"real-world":[52],"situations,":[53],"determined":[58],"not":[60],"neither":[64],"simple":[65],"nor":[66],"elementary.":[67],"this":[69,249,260],"paper,":[70],"we":[71,130],"extend":[72],"designing":[77],"implementing":[79],"abstractions":[80],"that":[81,194,204],"allow":[82],"problem":[89,108,116,179,250,275],"can":[93],"(call":[98],"non-simple":[99],"We":[101],"also":[102],"propose":[103],"an":[104,156],"instance":[105],"such":[107,203],"class:":[109],"routing":[111,182,233],"for":[112],"network":[113,145,167],"covering":[114],"(RNC)":[115],"which":[117,129],"arises":[118],"context":[121],"rescue":[123],"after":[124],"natural":[126],"disaster":[127],"route":[133],"fleet":[135,184],"identical":[137,189],"vehicles":[138,190,241],"with":[139,191],"limited":[140,192],"capacity":[141,193],"transportation":[144,166],"order":[147],"collect":[149],"informations":[151],"disaster.":[154],"Given":[155],"undirected":[157],"weighted":[158],"graph":[159],"G":[160],"=":[161],"(V,":[162],"E)":[163,225],"representing":[164,174],"vertex":[170],"v0":[171],"\u2208":[172],"V":[173],"depot,":[176],"RNC":[178],"consists":[180],"unlimited":[186],"number":[187,239],"perform":[196],"path":[198],"length":[200],">":[201],"L":[202],"each":[205],"vehicle":[206],"starts":[207],"from":[208],"teminates":[210],"at":[211],"depot":[213],"all":[215],"edges":[217],"given":[220],"set":[221],"S":[222],"(S":[223],"\u2286":[224],"must":[226],"visited.":[228],"The":[229,262],"objective":[230],"plan":[234],"minimize":[237],"used.":[242],"This":[243],"paper":[244],"discusses":[245],"challenge":[247],"around":[248],"applies":[252],"constructed":[254],"resolution":[258],"problem.":[261],"proposed":[263],"generic;":[266],"it":[267],"allows":[268],"some":[271],"variants":[272],"side":[277],"constraints":[278],"required":[280],"added.":[283]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}