{"id":"https://openalex.org/W1977398984","doi":"https://doi.org/10.1162/evco_a_00015","title":"An Efficient and Accurate Solution Methodology for Bilevel Multi-Objective Programming Problems Using a Hybrid Evolutionary-Local-Search Algorithm","display_name":"An Efficient and Accurate Solution Methodology for Bilevel Multi-Objective Programming Problems Using a Hybrid Evolutionary-Local-Search Algorithm","publication_year":2010,"publication_date":"2010-06-18","ids":{"openalex":"https://openalex.org/W1977398984","doi":"https://doi.org/10.1162/evco_a_00015","mag":"1977398984","pmid":"https://pubmed.ncbi.nlm.nih.gov/20560758"},"language":"en","primary_location":{"id":"doi:10.1162/evco_a_00015","is_oa":false,"landing_page_url":"https://doi.org/10.1162/evco_a_00015","pdf_url":null,"source":{"id":"https://openalex.org/S38677346","display_name":"Evolutionary Computation","issn_l":"1063-6560","issn":["1063-6560","1530-9304"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718"],"host_organization_lineage_names":["The MIT Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","pubmed"],"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/A5088394271","display_name":"Kalyanmoy Deb","orcid":"https://orcid.org/0000-0001-7402-9939"},"institutions":[{"id":"https://openalex.org/I94234084","display_name":"Indian Institute of Technology Kanpur","ror":"https://ror.org/05pjsgx75","country_code":"IN","type":"education","lineage":["https://openalex.org/I94234084"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Kalyanmoy Deb","raw_affiliation_strings":["Finland Distinguished Professor (FiDiPro), Department of Mechanical Engineering, Indian Institute of Technology Kanpur, PIN 208016, India, and Department of Business Technology, Aalto University School of Economics, PO Box 21220, 00076, Helsinki, Finland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Finland Distinguished Professor (FiDiPro), Department of Mechanical Engineering, Indian Institute of Technology Kanpur, PIN 208016, India, and Department of Business Technology, Aalto University School of Economics, PO Box 21220, 00076, Helsinki, Finland","institution_ids":["https://openalex.org/I94234084"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018720209","display_name":"Ankur Sinha","orcid":"https://orcid.org/0000-0002-0464-6736"},"institutions":[{"id":"https://openalex.org/I9927081","display_name":"Aalto University","ror":"https://ror.org/020hwjq30","country_code":"FI","type":"education","lineage":["https://openalex.org/I9927081"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Ankur Sinha","raw_affiliation_strings":["Department of Business Technology, Aalto University School of Economics, PO Box 21220, 00076, Helsinki, Finland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Business Technology, Aalto University School of Economics, PO Box 21220, 00076, Helsinki, Finland","institution_ids":["https://openalex.org/I9927081"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5088394271"],"corresponding_institution_ids":["https://openalex.org/I94234084"],"apc_list":null,"apc_paid":null,"fwci":9.6106,"has_fulltext":false,"cited_by_count":174,"citation_normalized_percentile":{"value":0.98464101,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":"18","issue":"3","first_page":"403","last_page":"449"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.9970999956130981,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9970999956130981,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T10969","display_name":"Water resources management and optimization","score":0.9854999780654907,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean 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/bilevel-optimization","display_name":"Bilevel optimization","score":0.9158332347869873},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7040566205978394},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5941612720489502},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5406171679496765},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5242412686347961},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.505151093006134},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.43127259612083435},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27523207664489746}],"concepts":[{"id":"https://openalex.org/C3309286","wikidata":"https://www.wikidata.org/wiki/Q4907693","display_name":"Bilevel optimization","level":3,"score":0.9158332347869873},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7040566205978394},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5941612720489502},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5406171679496765},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5242412686347961},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.505151093006134},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.43127259612083435},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27523207664489746},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","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":[{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D005075","descriptor_name":"Biological Evolution","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D005075","descriptor_name":"Biological Evolution","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D005075","descriptor_name":"Biological Evolution","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D012984","descriptor_name":"Software","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D012984","descriptor_name":"Software","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D012984","descriptor_name":"Software","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D015233","descriptor_name":"Models, Statistical","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D015233","descriptor_name":"Models, Statistical","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D015233","descriptor_name":"Models, Statistical","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false}],"locations_count":2,"locations":[{"id":"doi:10.1162/evco_a_00015","is_oa":false,"landing_page_url":"https://doi.org/10.1162/evco_a_00015","pdf_url":null,"source":{"id":"https://openalex.org/S38677346","display_name":"Evolutionary Computation","issn_l":"1063-6560","issn":["1063-6560","1530-9304"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718"],"host_organization_lineage_names":["The MIT Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary Computation","raw_type":"journal-article"},{"id":"pmid:20560758","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/20560758","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary computation","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":46,"referenced_works":["https://openalex.org/W91952509","https://openalex.org/W180478659","https://openalex.org/W225560312","https://openalex.org/W611405734","https://openalex.org/W1484068505","https://openalex.org/W1501399145","https://openalex.org/W1534713641","https://openalex.org/W1565327677","https://openalex.org/W1588628884","https://openalex.org/W1595498733","https://openalex.org/W1601556876","https://openalex.org/W1604175135","https://openalex.org/W1676470423","https://openalex.org/W1859388232","https://openalex.org/W1978480549","https://openalex.org/W1983370583","https://openalex.org/W1990676004","https://openalex.org/W2008499862","https://openalex.org/W2016969860","https://openalex.org/W2020430967","https://openalex.org/W2033330109","https://openalex.org/W2035452420","https://openalex.org/W2045328378","https://openalex.org/W2051925793","https://openalex.org/W2054118322","https://openalex.org/W2058637990","https://openalex.org/W2066642748","https://openalex.org/W2071707442","https://openalex.org/W2079868696","https://openalex.org/W2080279105","https://openalex.org/W2084575232","https://openalex.org/W2088692617","https://openalex.org/W2098876471","https://openalex.org/W2102365077","https://openalex.org/W2103259510","https://openalex.org/W2112451069","https://openalex.org/W2114064727","https://openalex.org/W2124659975","https://openalex.org/W2126105956","https://openalex.org/W2158584726","https://openalex.org/W2161055009","https://openalex.org/W2161768084","https://openalex.org/W2163194391","https://openalex.org/W2170631832","https://openalex.org/W2259507927","https://openalex.org/W4236995599"],"related_works":["https://openalex.org/W4318070895","https://openalex.org/W3157915181","https://openalex.org/W2896140431","https://openalex.org/W3015956618","https://openalex.org/W3156147173","https://openalex.org/W2920493340","https://openalex.org/W2071082401","https://openalex.org/W1994436307","https://openalex.org/W2795565301","https://openalex.org/W4285677055"],"abstract_inverted_index":{"Bilevel":[0],"optimization":[1,5,28,61,74,86],"problems":[2,31,163,202],"involve":[3],"two":[4],"tasks":[6,39],"(upper":[7],"and":[8,50,84,131,135,155,171,228,235,245],"lower":[9,26,72],"level),":[10],"in":[11,34,104,165,198],"which":[12],"every":[13],"feasible":[14],"upper":[15],"level":[16,27,60,73,106],"solution":[17,23,67,142,210],"must":[18],"correspond":[19],"to":[20,24,69,121,159,183,207,224,238,242],"an":[21,65],"optimal":[22,41],"a":[25,58,79,108,133,141,150,192,212],"problem.":[29,111],"These":[30],"commonly":[32,55],"appear":[33],"many":[35,94,221],"practical":[36,204],"problem":[37,62,247],"solving":[38,122,199,248],"including":[40],"control,":[42],"process":[43],"optimization,":[44],"game-playing":[45],"strategy":[46],"developments,":[47],"transportation":[48],"problems,":[49,92,126,130],"others.":[51],"However,":[52],"they":[53],"are":[54,174],"converted":[56],"into":[57],"single":[59],"by":[63,186,211],"using":[64],"approximate":[66],"procedure":[68],"replace":[70],"the":[71,98,187],"task.":[75],"Although":[76],"there":[77],"exist":[78],"number":[80,151],"of":[81,100,107,152,195,203],"theoretical,":[82],"numerical,":[83],"evolutionary":[85,196],"studies":[87,95],"involving":[88],"single-objective":[89],"bilevel":[90,109,124,226],"programming":[91,110,125,227],"not":[93],"look":[96],"at":[97],"context":[99],"multiple":[101],"conflicting":[102],"objectives":[103],"each":[105],"In":[112],"this":[113,166,230,243],"paper,":[114],"we":[115],"address":[116],"certain":[117],"intricate":[118],"issues":[119,222],"related":[120,223],"multi-objective":[123,225],"present":[127],"challenging":[128],"test":[129,162],"propose":[132],"viable":[134],"hybrid":[136,145],"evolutionary-cum-local-search":[137],"based":[138],"algorithm":[139],"as":[140],"methodology.":[143],"The":[144,168,189,217],"approach":[146],"performs":[147],"better":[148],"than":[149],"existing":[153],"methodologies":[154],"scales":[156],"well":[157],"up":[158,220],"40-variable":[160],"difficult":[161,201,246],"used":[164],"study.":[167],"population":[169],"sizing":[170],"termination":[172],"criteria":[173],"made":[175],"self-adaptive,":[176],"so":[177],"that":[178],"no":[179],"additional":[180],"parameters":[181],"need":[182],"be":[184],"supplied":[185],"user.":[188],"study":[190,218,231],"indicates":[191],"clear":[193],"niche":[194],"algorithms":[197],"such":[200],"importance":[205],"compared":[206],"their":[208],"usual":[209],"computationally":[213],"expensive":[214],"nested":[215],"procedure.":[216],"opens":[219],"hopefully":[229],"will":[232],"motivate":[233],"EMO":[234],"other":[236],"researchers":[237],"pay":[239],"more":[240],"attention":[241],"important":[244],"activity.":[249]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":12},{"year":2023,"cited_by_count":13},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":12},{"year":2020,"cited_by_count":14},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":10},{"year":2016,"cited_by_count":20},{"year":2015,"cited_by_count":16},{"year":2014,"cited_by_count":16},{"year":2013,"cited_by_count":15},{"year":2012,"cited_by_count":8}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}