{"id":"https://openalex.org/W2155433463","doi":"https://doi.org/10.1145/2330163.2330338","title":"On neighborhood tree search","display_name":"On neighborhood tree search","publication_year":2012,"publication_date":"2012-07-07","ids":{"openalex":"https://openalex.org/W2155433463","doi":"https://doi.org/10.1145/2330163.2330338","mag":"2155433463"},"language":"en","primary_location":{"id":"doi:10.1145/2330163.2330338","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2330163.2330338","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 14th annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1212.6510","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5110590946","display_name":"Houda Derbel","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Houda Derbel","raw_affiliation_strings":["FSEGS, Route de l'a\u00e9roport, Sfax, Tunisia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"FSEGS, Route de l'a\u00e9roport, Sfax, Tunisia","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052724735","display_name":"Bilel Derbel","orcid":"https://orcid.org/0000-0002-4156-8490"},"institutions":[{"id":"https://openalex.org/I2279609970","display_name":"Universit\u00e9 de Lille","ror":"https://ror.org/02kzqn938","country_code":"FR","type":"education","lineage":["https://openalex.org/I2279609970"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Bilel Derbel","raw_affiliation_strings":["Universit\u00e9 Lille 1, Villeneuve d'Ascq, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Lille 1, Villeneuve d'Ascq, France","institution_ids":["https://openalex.org/I2279609970"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.23444232,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1261","last_page":"1268"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9994999766349792,"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.9994999766349792,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9922000169754028,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9793000221252441,"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/backtracking","display_name":"Backtracking","score":0.7083339691162109},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6992090940475464},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5849564671516418},{"id":"https://openalex.org/keywords/iterative-deepening-depth-first-search","display_name":"Iterative deepening depth-first search","score":0.5814490914344788},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.5808987021446228},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5595429539680481},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.5141194462776184},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4788798689842224},{"id":"https://openalex.org/keywords/beam-stack-search","display_name":"Beam stack search","score":0.4417071044445038},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4378037750720978},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4201831817626953},{"id":"https://openalex.org/keywords/depth-first-search","display_name":"Depth-first search","score":0.4113249182701111},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.3795585036277771},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.3785925805568695},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37757450342178345},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2892017066478729},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2562183141708374},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1808495819568634}],"concepts":[{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.7083339691162109},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6992090940475464},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5849564671516418},{"id":"https://openalex.org/C14362708","wikidata":"https://www.wikidata.org/wiki/Q1675274","display_name":"Iterative deepening depth-first search","level":5,"score":0.5814490914344788},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.5808987021446228},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5595429539680481},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.5141194462776184},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4788798689842224},{"id":"https://openalex.org/C194036150","wikidata":"https://www.wikidata.org/wiki/Q4876196","display_name":"Beam stack search","level":5,"score":0.4417071044445038},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4378037750720978},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4201831817626953},{"id":"https://openalex.org/C62692426","wikidata":"https://www.wikidata.org/wiki/Q816319","display_name":"Depth-first search","level":3,"score":0.4113249182701111},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.3795585036277771},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.3785925805568695},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37757450342178345},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2892017066478729},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2562183141708374},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1808495819568634},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","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/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1145/2330163.2330338","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2330163.2330338","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 14th annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1212.6510","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1212.6510","pdf_url":"https://arxiv.org/pdf/1212.6510","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.635.6869","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.635.6869","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://hal.univ-lille3.fr/docs/00/72/85/31/PDF/nts.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.658.7295","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.658.7295","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://hal.inria.fr/hal-00728531/document/","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.752.3426","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.752.3426","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1212.6510.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:hal-00728531v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-00728531","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Genetic and Evolutionary Computation Conference (GECCO'12), Sep 2012, Philadelphie, United States","raw_type":"Conference papers"},{"id":"pmh:oai:lilloa.univ-lille.fr:20.500.12210/27591","is_oa":true,"landing_page_url":"http://hdl.handle.net/20.500.12210/27591","pdf_url":null,"source":{"id":"https://openalex.org/S4306402203","display_name":"LillOA (Universit\u00e9 de Lille (University Of Lille))","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210123514","host_organization_name":"Centre d'Etudes en Civilisations, Langues et Litt\u00e9ratures Etrang\u00e8res","host_organization_lineage":["https://openalex.org/I4210123514"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1212.6510","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1212.6510","pdf_url":"https://arxiv.org/pdf/1212.6510","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.6800000071525574,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1601624891","https://openalex.org/W1745341198","https://openalex.org/W1814515812","https://openalex.org/W1969590457","https://openalex.org/W1982402598","https://openalex.org/W1986254541","https://openalex.org/W1992447230","https://openalex.org/W2029941120","https://openalex.org/W2031733044","https://openalex.org/W2040546552","https://openalex.org/W2043496704","https://openalex.org/W2077104763","https://openalex.org/W2107195613","https://openalex.org/W2126927016","https://openalex.org/W2137833101","https://openalex.org/W2139919574","https://openalex.org/W2145603433","https://openalex.org/W2169209574","https://openalex.org/W2169616042","https://openalex.org/W2754980796","https://openalex.org/W6602063408","https://openalex.org/W6683242304"],"related_works":["https://openalex.org/W58921990","https://openalex.org/W2224555876","https://openalex.org/W2081821176","https://openalex.org/W1548704524","https://openalex.org/W2064794194","https://openalex.org/W2376570066","https://openalex.org/W2368028352","https://openalex.org/W4214503203","https://openalex.org/W2573689326","https://openalex.org/W2354057059"],"abstract_inverted_index":{"We":[0,19,45,82,114,144],"consider":[1],"the":[2,8,21,30,39,49,60,67,74,107,111,130,137,149,152,170],"neighborhood":[3,12,31,63,70,112,171],"tree":[4,32,40,172],"induced":[5],"by":[6,34,65,86,123],"alternating":[7],"use":[9],"of":[10,23,38,76,120,148,181],"different":[11,36,126,163,177],"structures":[13],"within":[14,92],"a":[15,25,42,54,93,116],"local":[16],"search":[17,26,50,80,108],"descent.":[18],"investigate":[20],"issue":[22],"designing":[24],"strategy":[27],"operating":[28],"at":[29],"level":[33],"exploring":[35,169],"paths":[37],"in":[41,179],"heuristic":[43],"way.":[44],"show":[46,145,160],"that":[47,146,161],"allowing":[48],"to":[51,53,73,105,175],"'backtrack'":[52],"previously":[55],"visited":[56],"solution":[57,182],"and":[58,78,97,102,136,165,184],"resuming":[59],"iterative":[61],"variable":[62],"descent":[64],"'pruning'":[66],"already":[68],"explored":[69],"branches":[71],"leads":[72],"design":[75,90],"effective":[77],"efficient":[79],"heuristics.":[81],"describe":[83],"this":[84,121],"idea":[85],"discussing":[87],"its":[88],"basic":[89],"components":[91],"generic":[94],"algorithmic":[95],"scheme":[96],"we":[98,159],"propose":[99],"some":[100],"simple":[101],"intuitive":[103],"strategies":[104,167],"guide":[106],"when":[109,168],"traversing":[110],"tree.":[113],"conduct":[115],"throughout":[117],"experimental":[118],"analysis":[119],"approach":[122,153],"considering":[124],"two":[125],"problem":[127],"domains,":[128],"namely,":[129],"Total":[131],"Weighted":[132],"Tardiness":[133],"Problem":[134,142],"(SMTWTP),":[135],"more":[138],"sophisticated":[139],"Location":[140],"Routing":[141],"(LRP).":[143],"independently":[147],"considered":[150],"domain,":[151],"is":[154],"highly":[155],"competitive.":[156],"In":[157],"particular,":[158],"using":[162],"branching":[164],"backtracking":[166],"allows":[173],"us":[174],"achieve":[176],"trade-offs":[178],"terms":[180],"quality":[183],"computing":[185],"cost.":[186]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}