{"id":"https://openalex.org/W2027263944","doi":"https://doi.org/10.1142/s0218213008003844","title":"INTELLIGENT NEIGHBORHOOD EXPLORATION IN LOCAL SEARCH METHOD","display_name":"INTELLIGENT NEIGHBORHOOD EXPLORATION IN LOCAL SEARCH METHOD","publication_year":2008,"publication_date":"2008-02-01","ids":{"openalex":"https://openalex.org/W2027263944","doi":"https://doi.org/10.1142/s0218213008003844","mag":"2027263944"},"language":"en","primary_location":{"id":"doi:10.1142/s0218213008003844","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218213008003844","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/A5064045692","display_name":"Isabelle Devarenne","orcid":null},"institutions":[{"id":"https://openalex.org/I37553959","display_name":"Universit\u00e9 de technologie de belfort-montb\u00e9liard","ror":"https://ror.org/05bn3m307","country_code":"FR","type":"education","lineage":["https://openalex.org/I37553959"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"ISABELLE DEVARENNE","raw_affiliation_strings":["UTBM Technology University of Belfort-Montb\u00e9liard, SET Lab, 90010 BELFORT cedex, France"],"affiliations":[{"raw_affiliation_string":"UTBM Technology University of Belfort-Montb\u00e9liard, SET Lab, 90010 BELFORT cedex, France","institution_ids":["https://openalex.org/I37553959"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073123782","display_name":"Hakim Mabed","orcid":"https://orcid.org/0000-0001-8358-4029"},"institutions":[{"id":"https://openalex.org/I37553959","display_name":"Universit\u00e9 de technologie de belfort-montb\u00e9liard","ror":"https://ror.org/05bn3m307","country_code":"FR","type":"education","lineage":["https://openalex.org/I37553959"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"HAKIM MABED","raw_affiliation_strings":["UTBM Technology University of Belfort-Montb\u00e9liard, SET Lab, 90010 BELFORT cedex, France"],"affiliations":[{"raw_affiliation_string":"UTBM Technology University of Belfort-Montb\u00e9liard, SET Lab, 90010 BELFORT cedex, France","institution_ids":["https://openalex.org/I37553959"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059527798","display_name":"Alexandre Caminada","orcid":"https://orcid.org/0000-0002-4088-7406"},"institutions":[{"id":"https://openalex.org/I37553959","display_name":"Universit\u00e9 de technologie de belfort-montb\u00e9liard","ror":"https://ror.org/05bn3m307","country_code":"FR","type":"education","lineage":["https://openalex.org/I37553959"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"ALEXANDRE CAMINADA","raw_affiliation_strings":["UTBM Technology University of Belfort-Montb\u00e9liard, SET Lab, 90010 BELFORT cedex, France"],"affiliations":[{"raw_affiliation_string":"UTBM Technology University of Belfort-Montb\u00e9liard, SET Lab, 90010 BELFORT cedex, France","institution_ids":["https://openalex.org/I37553959"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5064045692"],"corresponding_institution_ids":["https://openalex.org/I37553959"],"apc_list":null,"apc_paid":null,"fwci":0.4241,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.69749313,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"17","issue":"01","first_page":"195","last_page":"204"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9922999739646912,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9757000207901001,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.795868992805481},{"id":"https://openalex.org/keywords/tabu-search","display_name":"Tabu search","score":0.794667661190033},{"id":"https://openalex.org/keywords/guided-local-search","display_name":"Guided Local Search","score":0.6457504034042358},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.5844082832336426},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.5767291784286499},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5248548984527588},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5167321562767029},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48023587465286255},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.45988544821739197},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3704128861427307},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.31911808252334595},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16639766097068787}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.795868992805481},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.794667661190033},{"id":"https://openalex.org/C90189156","wikidata":"https://www.wikidata.org/wiki/Q5615481","display_name":"Guided Local Search","level":3,"score":0.6457504034042358},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.5844082832336426},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.5767291784286499},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5248548984527588},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5167321562767029},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48023587465286255},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.45988544821739197},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3704128861427307},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31911808252334595},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16639766097068787},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0218213008003844","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218213008003844","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":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.7599999904632568}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1582334898","https://openalex.org/W2167036627","https://openalex.org/W4211231030","https://openalex.org/W4246598646","https://openalex.org/W4300163110"],"related_works":["https://openalex.org/W1987877777","https://openalex.org/W2370323645","https://openalex.org/W2168643831","https://openalex.org/W4243772339","https://openalex.org/W2329077287","https://openalex.org/W1533229056","https://openalex.org/W1979763505","https://openalex.org/W2519041592","https://openalex.org/W1555693598","https://openalex.org/W2726888863"],"abstract_inverted_index":{"Standard":[0],"tabu":[1,104],"search":[2,48],"methods":[3],"are":[4],"based":[5],"on":[6,120],"the":[7,20,25,29,33,68,83,86,115,150,160],"complete":[8],"exploration":[9,31,91],"of":[10,32,40,82,85,92],"current":[11,87],"solution":[12,59,78],"neighborhood.":[13],"However,":[14],"for":[15,67,154],"some":[16],"problems":[17,157],"due":[18],"to":[19,24,44,74,114,128,149],"neighborhood":[21,34,84,136],"size":[22],"or":[23],"fitness":[26],"evaluation":[27],"complexity,":[28],"total":[30],"is":[35,43,60,73,112,127],"impractical.":[36],"The":[37,71,125],"main":[38],"purpose":[39],"this":[41,108],"paper":[42],"propose":[45],"a":[46,57,80,131,144],"local":[47],"method":[49],"with":[50],"no":[51],"enumeration":[52],"procedure.":[53],"In":[54],"other":[55],"words,":[56],"single":[58],"examined":[61],"at":[62],"each":[63],"iteration":[64],"and":[65,96,103,118,140],"retained":[66],"future":[69],"iterations.":[70],"idea":[72],"randomly":[75],"select":[76],"one":[77],"among":[79],"sub-set":[81],"one.":[88],"An":[89],"adaptive":[90],"neighborhood,":[93],"using":[94],"extension":[95],"restriction":[97],"mechanisms":[98],"represented":[99],"by":[100],"loop":[101],"detection":[102],"list":[105],"structure,":[106],"determines":[107],"sub-set.":[109],"This":[110],"approach":[111],"applied":[113],"K-coloring":[116],"problem":[117],"evaluated":[119],"standard":[121],"benchmarks":[122],"like":[123],"DIMACS.":[124],"objective":[126],"show":[129],"how":[130],"generic":[132],"method,":[133],"without":[134],"full":[135],"exploration,":[137],"degradation":[138],"control":[139],"problem-oriented":[141],"operators,":[142],"provides":[143],"very":[145],"competitive":[146],"results":[147],"comparing":[148],"best":[151],"dedicated":[152],"algorithms":[153],"graph":[155],"coloring":[156],"published":[158],"in":[159],"literature.":[161]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}