{"id":"https://openalex.org/W2295163330","doi":"https://doi.org/10.1080/10556788.2015.1121485","title":"Evolutionary algorithm with a directional local search for multiobjective optimization in combinatorial problems","display_name":"Evolutionary algorithm with a directional local search for multiobjective optimization in combinatorial problems","publication_year":2015,"publication_date":"2015-12-23","ids":{"openalex":"https://openalex.org/W2295163330","doi":"https://doi.org/10.1080/10556788.2015.1121485","mag":"2295163330"},"language":"en","primary_location":{"id":"doi:10.1080/10556788.2015.1121485","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2015.1121485","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":null,"license_id":null,"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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5055411368","display_name":"Krzysztof Michalak","orcid":"https://orcid.org/0000-0003-4994-9930"},"institutions":[{"id":"https://openalex.org/I305801656","display_name":"Wroclaw University of Economics and Business","ror":"https://ror.org/013sm1c65","country_code":"PL","type":"education","lineage":["https://openalex.org/I305801656"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Krzysztof Michalak","raw_affiliation_strings":["Department of Information Technologies,Institute of Business Informatics, Wroclaw University of Economics, Wroclaw, Poland"],"affiliations":[{"raw_affiliation_string":"Department of Information Technologies,Institute of Business Informatics, Wroclaw University of Economics, Wroclaw, Poland","institution_ids":["https://openalex.org/I305801656"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5055411368"],"corresponding_institution_ids":["https://openalex.org/I305801656"],"apc_list":null,"apc_paid":null,"fwci":1.4021,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.83570581,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":93,"max":97},"biblio":{"volume":"31","issue":"2","first_page":"392","last_page":"404"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":1.0,"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"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9994000196456909,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9943000078201294,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.729036808013916},{"id":"https://openalex.org/keywords/quadratic-assignment-problem","display_name":"Quadratic assignment problem","score":0.7078903913497925},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.6905434131622314},{"id":"https://openalex.org/keywords/guided-local-search","display_name":"Guided Local Search","score":0.6149564385414124},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6075124144554138},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6016225814819336},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.5958210229873657},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.569884181022644},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5610654354095459},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.45767638087272644},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.4536828100681305},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.42462214827537537},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36284109950065613},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3271907567977905}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.729036808013916},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.7078903913497925},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.6905434131622314},{"id":"https://openalex.org/C90189156","wikidata":"https://www.wikidata.org/wiki/Q5615481","display_name":"Guided Local Search","level":3,"score":0.6149564385414124},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6075124144554138},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6016225814819336},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.5958210229873657},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.569884181022644},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5610654354095459},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.45767638087272644},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.4536828100681305},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.42462214827537537},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36284109950065613},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3271907567977905},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","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.1080/10556788.2015.1121485","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2015.1121485","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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1332032995","display_name":null,"funder_award_id":"DEC- 2012/05/D/HS4/01129","funder_id":"https://openalex.org/F4320322511","funder_display_name":"Narodowe Centrum Nauki"}],"funders":[{"id":"https://openalex.org/F4320322511","display_name":"Narodowe Centrum Nauki","ror":"https://ror.org/03ha2q922"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W151236107","https://openalex.org/W168643453","https://openalex.org/W564928756","https://openalex.org/W817895664","https://openalex.org/W1502785848","https://openalex.org/W1503369191","https://openalex.org/W1563728692","https://openalex.org/W1571087346","https://openalex.org/W1595498733","https://openalex.org/W1918283942","https://openalex.org/W1990912193","https://openalex.org/W1998444286","https://openalex.org/W2004631337","https://openalex.org/W2008499862","https://openalex.org/W2019932779","https://openalex.org/W2024008934","https://openalex.org/W2030906477","https://openalex.org/W2036643871","https://openalex.org/W2044042941","https://openalex.org/W2048424596","https://openalex.org/W2086167402","https://openalex.org/W2096166399","https://openalex.org/W2098907614","https://openalex.org/W2100717205","https://openalex.org/W2106334424","https://openalex.org/W2109865546","https://openalex.org/W2116661285","https://openalex.org/W2122510010","https://openalex.org/W2123485079","https://openalex.org/W2126105956","https://openalex.org/W2143381319","https://openalex.org/W2150046657","https://openalex.org/W2161335581","https://openalex.org/W2586568713"],"related_works":["https://openalex.org/W2474680198","https://openalex.org/W206409801","https://openalex.org/W1965088406","https://openalex.org/W4200602616","https://openalex.org/W1576195779","https://openalex.org/W2049828308","https://openalex.org/W2019932779","https://openalex.org/W2156087782","https://openalex.org/W2968013531","https://openalex.org/W2055775959"],"abstract_inverted_index":{"Evolutionary":[0],"algorithms":[1],"(EAs)":[2],"are":[3],"often":[4],"employed":[5],"to":[6,37],"multiobjective":[7],"optimization,":[8],"because":[9],"they":[10],"process":[11],"an":[12,22,90,110],"entire":[13],"population":[14],"of":[15,24,28,48,84,89,120,183],"solutions":[16],"which":[17],"can":[18,72],"be":[19,73],"used":[20,74,108,156],"as":[21,75,93,95],"approximation":[23],"the":[25,29,46,63,100,102,126,132,150,158,165,169,177,184,190],"Pareto":[26,147],"front":[27],"tackled":[30],"problem.":[31],"It":[32],"is":[33,59],"a":[34,54,76,87],"common":[35],"practice":[36],"couple":[38],"local":[39,56,104,141,171],"search":[40,57,67,105,142,172],"with":[41,81,109,157,168,181],"evolutionary":[42],"algorithms,":[43],"especially":[44],"in":[45],"context":[47],"combinatorial":[49,123],"optimization.":[50],"In":[51,99],"this":[52],"paper":[53],"new":[55],"method":[58,71,106],"proposed":[60,70,103],"that":[61,164],"utilizes":[62],"knowledge":[64],"concerning":[65],"promising":[66],"directions.":[68],"The":[69,161],"general":[77],"framework":[78],"and":[79,112,117,131,149,192],"combined":[80],"many":[82],"methods":[83,187],"iterating":[85],"over":[86],"neighbourhood":[88],"initial":[91],"solution":[92],"well":[94],"various":[96],"decomposition":[97],"approaches.":[98],"experiments":[101],"was":[107],"EA":[111,166,179],"tested":[113],"on":[114,146,153,188],"2-,":[115],"3-":[116],"4-objective":[118],"versions":[119],"two":[121,139,185],"well-known":[122,140],"optimization":[124],"problems:":[125],"travelling":[127],"salesman":[128],"problem":[129,135],"(TSP)":[130],"quadratic":[133],"assignment":[134],"(QAP).":[136],"For":[137],"comparison":[138],"methods,":[143],"one":[144],"based":[145,152],"dominance":[148],"other":[151],"decomposition,":[154],"were":[155],"same":[159,178],"EA.":[160],"results":[162,175],"show":[163],"coupled":[167,180],"directional":[170],"yields":[173],"better":[174],"than":[176],"any":[182],"reference":[186],"both":[189],"TSP":[191],"QAP":[193],"problems.":[194]},"counts_by_year":[{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}