{"id":"https://openalex.org/W4403336335","doi":"https://doi.org/10.1080/10556788.2024.2404094","title":"A meta-heuristic extension of the Lagrangian heuristic framework","display_name":"A meta-heuristic extension of the Lagrangian heuristic framework","publication_year":2024,"publication_date":"2024-09-02","ids":{"openalex":"https://openalex.org/W4403336335","doi":"https://doi.org/10.1080/10556788.2024.2404094"},"language":"en","primary_location":{"id":"doi:10.1080/10556788.2024.2404094","is_oa":true,"landing_page_url":"https://doi.org/10.1080/10556788.2024.2404094","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1080/10556788.2024.2404094","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5064286308","display_name":"Uledi Ngulo","orcid":null},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Uledi Ngulo","raw_affiliation_strings":["Department of Mathematics, Link\u00f6ping University, Link\u00f6ping, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Link\u00f6ping University, Link\u00f6ping, Sweden","institution_ids":["https://openalex.org/I102134673"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074200057","display_name":"Torbj\u00f6rn Larsson","orcid":"https://orcid.org/0000-0003-2094-7376"},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Torbj\u00f6rn Larsson","raw_affiliation_strings":["Department of Mathematics, Link\u00f6ping University, Link\u00f6ping, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Link\u00f6ping University, Link\u00f6ping, Sweden","institution_ids":["https://openalex.org/I102134673"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087671966","display_name":"Nils\u2010Hassan Quttineh","orcid":"https://orcid.org/0000-0002-9881-4170"},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Nils-Hassan Quttineh","raw_affiliation_strings":["Department of Mathematics, Link\u00f6ping University, Link\u00f6ping, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Link\u00f6ping University, Link\u00f6ping, Sweden","institution_ids":["https://openalex.org/I102134673"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5087671966"],"corresponding_institution_ids":["https://openalex.org/I102134673"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.17992825,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"39","issue":"5","first_page":"1008","last_page":"1039"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9983999729156494,"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"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9983999729156494,"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"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9972000122070312,"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.9944999814033508,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.8258204460144043},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.7443517446517944},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7094206809997559},{"id":"https://openalex.org/keywords/meta-heuristic","display_name":"Meta heuristic","score":0.5909292697906494},{"id":"https://openalex.org/keywords/lagrangian","display_name":"Lagrangian","score":0.5796546339988708},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5297264456748962},{"id":"https://openalex.org/keywords/lagrangian-relaxation","display_name":"Lagrangian relaxation","score":0.463911235332489},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.33986249566078186},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.22642365097999573},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.18416008353233337}],"concepts":[{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.8258204460144043},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.7443517446517944},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7094206809997559},{"id":"https://openalex.org/C2988037039","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Meta heuristic","level":2,"score":0.5909292697906494},{"id":"https://openalex.org/C53469067","wikidata":"https://www.wikidata.org/wiki/Q505735","display_name":"Lagrangian","level":2,"score":0.5796546339988708},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5297264456748962},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.463911235332489},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.33986249566078186},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.22642365097999573},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.18416008353233337},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/10556788.2024.2404094","is_oa":true,"landing_page_url":"https://doi.org/10.1080/10556788.2024.2404094","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"},{"id":"pmh:oai:DiVA.org:liu-208662","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-208662","pdf_url":null,"source":{"id":"https://openalex.org/S4306401559","display_name":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","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":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"doi:10.1080/10556788.2024.2404094","is_oa":true,"landing_page_url":"https://doi.org/10.1080/10556788.2024.2404094","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1966841850","https://openalex.org/W1977723771","https://openalex.org/W1988969546","https://openalex.org/W2001912652","https://openalex.org/W2039006033","https://openalex.org/W2049967755","https://openalex.org/W2050750413","https://openalex.org/W2056908125","https://openalex.org/W2058748455","https://openalex.org/W2064209160","https://openalex.org/W2083957197","https://openalex.org/W2086958842","https://openalex.org/W2091413362","https://openalex.org/W2091836882","https://openalex.org/W2099813847","https://openalex.org/W2400260427","https://openalex.org/W2530819940","https://openalex.org/W2550411532","https://openalex.org/W2790797650","https://openalex.org/W2923724034","https://openalex.org/W2945175246","https://openalex.org/W4236384091","https://openalex.org/W4242130683","https://openalex.org/W4256087918"],"related_works":["https://openalex.org/W4237964977","https://openalex.org/W2002102264","https://openalex.org/W2155100848","https://openalex.org/W2075228635","https://openalex.org/W3097196196","https://openalex.org/W3149469165","https://openalex.org/W4313484281","https://openalex.org/W2616198151","https://openalex.org/W2113857227","https://openalex.org/W4310120240"],"abstract_inverted_index":{"Lagrangian":[0,8,57,74,103,108,154],"heuristics":[1],"for":[2,46,73],"discrete":[3],"optimization":[4,48],"work":[5],"by":[6,132],"modifying":[7],"relaxed":[9,75],"solutions":[10,13,28,65],"into":[11],"feasible":[12],"to":[14,21,32,81,101,135],"an":[15],"original":[16],"problem.":[17],"They":[18],"are":[19],"designed":[20],"identify":[22],"feasible,":[23],"and":[24,29,70,105,123,139],"hopefully":[25],"also":[26],"near-optimal,":[27],"have":[30],"proven":[31],"be":[33],"highly":[34],"successful":[35],"in":[36,66,110,114],"many":[37],"applications.":[38],"Based":[39],"on":[40],"a":[41,52,83,91,98,102,107,111,125,152],"primal-dual":[42],"global":[43],"optimality":[44,61],"condition":[45,62],"non-convex":[47],"problems,":[49],"we":[50],"develop":[51],"meta-heuristic":[53,78,130,149],"extension":[54,79,131,150],"of":[55,68,86,117,128,151],"the":[56,115,118,136,148],"heuristic":[58,109,155],"framework.":[59],"The":[60,77],"characterizes":[63],"(near-)optimal":[64],"terms":[67],"near-optimality":[69],"near-complementarity":[71],"measures":[72],"solutions.":[76],"amounts":[80],"constructing":[82],"weighted":[84],"combination":[85],"these":[87],"measures,":[88],"thus":[89],"creating":[90],"parametric":[92],"auxiliary":[93],"objective":[94],"function,":[95,104],"which":[96],"is":[97],"close":[99],"relative":[100],"embedding":[106],"search":[112],"procedure":[113],"space":[116],"weight":[119],"parameters.":[120],"We":[121],"illustrate":[122],"make":[124],"first":[126],"assessment":[127],"this":[129],"applying":[133],"it":[134],"generalized":[137],"assignment":[138],"set":[140],"covering":[141],"problems.":[142],"Our":[143],"computational":[144],"experience":[145],"show":[146],"that":[147],"standard":[153],"can":[156],"significantly":[157],"improve":[158],"upon":[159],"solution":[160],"quality.":[161]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}