{"id":"https://openalex.org/W102034464","doi":"https://doi.org/10.1142/s0218213005001989","title":"A LOCAL SEARCH/CONSTRAINT PROPAGATION HYBRID FOR A NETWORK ROUTING PROBLEM","display_name":"A LOCAL SEARCH/CONSTRAINT PROPAGATION HYBRID FOR A NETWORK ROUTING PROBLEM","publication_year":2005,"publication_date":"2005-02-01","ids":{"openalex":"https://openalex.org/W102034464","doi":"https://doi.org/10.1142/s0218213005001989","mag":"102034464"},"language":"en","primary_location":{"id":"doi:10.1142/s0218213005001989","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218213005001989","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/A5034887319","display_name":"Jonathan M. Lever","orcid":null},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"JONATHAN LEVER","raw_affiliation_strings":["IC-Parc, Imperial College, London, SW7 2AZ, UK"],"affiliations":[{"raw_affiliation_string":"IC-Parc, Imperial College, London, SW7 2AZ, UK","institution_ids":["https://openalex.org/I47508984"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5034887319"],"corresponding_institution_ids":["https://openalex.org/I47508984"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.01346494,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"14","issue":"01n02","first_page":"43","last_page":"60"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9959999918937683,"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.9959999918937683,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9858999848365784,"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"}},{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9531000256538391,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/guided-local-search","display_name":"Guided Local Search","score":0.7027053833007812},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.6577675342559814},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6187397241592407},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.6099290251731873},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.5407377481460571},{"id":"https://openalex.org/keywords/best-first-search","display_name":"Best-first search","score":0.5206938982009888},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.519814133644104},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5103835463523865},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.5103792548179626},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.49076852202415466},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.47169116139411926},{"id":"https://openalex.org/keywords/hybrid-algorithm","display_name":"Hybrid algorithm (constraint satisfaction)","score":0.4707016944885254},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.4606627821922302},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.45247307419776917},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.43556714057922363},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.39883121848106384},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.37322843074798584},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3466188311576843},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.119078129529953},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.08005005121231079}],"concepts":[{"id":"https://openalex.org/C90189156","wikidata":"https://www.wikidata.org/wiki/Q5615481","display_name":"Guided Local Search","level":3,"score":0.7027053833007812},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.6577675342559814},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6187397241592407},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.6099290251731873},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.5407377481460571},{"id":"https://openalex.org/C46011968","wikidata":"https://www.wikidata.org/wiki/Q830527","display_name":"Best-first search","level":4,"score":0.5206938982009888},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.519814133644104},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5103835463523865},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.5103792548179626},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.49076852202415466},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.47169116139411926},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.4707016944885254},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.4606627821922302},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.45247307419776917},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.43556714057922363},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.39883121848106384},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.37322843074798584},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3466188311576843},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.119078129529953},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.08005005121231079},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"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/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1142/s0218213005001989","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218213005001989","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.503.1200","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.503.1200","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.aaai.org/Papers/FLAIRS/2004/Flairs04-051.pdf","raw_type":"text"},{"id":"mag:102034464","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/flairs/flairs2004.html#Lever04","pdf_url":null,"source":{"id":"https://openalex.org/S4306421048","display_name":"The Florida AI Research Society","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"The Florida AI Research Society","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.5799999833106995,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W1540699063","https://openalex.org/W2024060531","https://openalex.org/W2171830873"],"related_works":["https://openalex.org/W2166789418","https://openalex.org/W1847544347","https://openalex.org/W2363406048","https://openalex.org/W2769334513","https://openalex.org/W1577701259","https://openalex.org/W2094135965","https://openalex.org/W2079797353","https://openalex.org/W2369408640","https://openalex.org/W2372251444","https://openalex.org/W3046865900","https://openalex.org/W2006234018","https://openalex.org/W2783964280","https://openalex.org/W2092451650","https://openalex.org/W2317277793","https://openalex.org/W1970513322","https://openalex.org/W2788179861","https://openalex.org/W1513354512","https://openalex.org/W2950717941","https://openalex.org/W3174882441","https://openalex.org/W2912990785"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,16,30,35,61,66,100,157],"hybrid":[4],"algorithm":[5,147],"that":[6,24,104],"combines":[7],"local":[8,55,72,111,125],"search":[9,56,73,82,89,112,122,126],"and":[10],"constraint":[11,120,143],"programming":[12],"techniques":[13],"to":[14,42,59,91,118,129,153,160],"solve":[15],"network":[17,36],"routing":[18,26],"problem.":[19,162],"The":[20,50,145],"problem":[21,133],"considered":[22],"is":[23,52,57,127,137,148,151],"of":[25,32,46,79,95,102,107,110,142],"traffic":[27],"demands":[28],"from":[29],"set":[31,101],"requests":[33],"over":[34],"with":[37,71,156],"limited":[38],"capacity":[39],"so":[40],"as":[41],"minimise":[43],"the":[44,77,80,88,93,96,108,114,131,140],"cost":[45,63],"any":[47],"unrouted":[48],"demands.":[49],"hybridisation":[51],"twofold:":[53],"pure":[54],"used":[58,128],"find":[60],"good":[62],"bound":[64],"for":[65],"subsequent":[67],"branch-and-bound":[68,81],"optimisation":[69,136],"phase,":[70],"again":[74],"applied":[75],"at":[76,113],"nodes":[78],"tree.":[83],"Constraint":[84],"propagation":[85],"occurs":[86],"in":[87,139],"tree":[90],"reduce":[92],"domains":[94],"decision":[97],"variable,":[98],"using":[99],"constraints":[103],"are":[105],"independent":[106],"action":[109],"nodes.":[115],"In":[116],"contrast":[117],"previous":[119],"programming/local":[121],"hybridisations,":[123],"here":[124],"satisfy":[130],"hard":[132],"constraints,":[134],"while":[135],"handled":[138],"framework":[141],"programming.":[144],"resulting":[146],"incomplete,":[149],"but":[150],"shown":[152],"compare":[154],"favourably":[155],"complete":[158],"approach":[159],"this":[161]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}