{"id":"https://openalex.org/W1597653328","doi":"https://doi.org/10.1109/cec.2015.7257086","title":"A co-evolutionary decomposition-based algorithm for Bi-Level combinatorial optimization","display_name":"A co-evolutionary decomposition-based algorithm for Bi-Level combinatorial optimization","publication_year":2015,"publication_date":"2015-05-01","ids":{"openalex":"https://openalex.org/W1597653328","doi":"https://doi.org/10.1109/cec.2015.7257086","mag":"1597653328"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2015.7257086","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2015.7257086","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-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/A5040931960","display_name":"Abir Chaabani","orcid":"https://orcid.org/0000-0003-0283-6111"},"institutions":[{"id":"https://openalex.org/I108714496","display_name":"Tunis University","ror":"https://ror.org/02q1spa57","country_code":"TN","type":"education","lineage":["https://openalex.org/I108714496"]}],"countries":["TN"],"is_corresponding":true,"raw_author_name":"Abir Chaabani","raw_affiliation_strings":["SOIE lab, University of Tunis, Tunisia","[SOIE Lab, University of Tunis, Tunisia]"],"affiliations":[{"raw_affiliation_string":"SOIE lab, University of Tunis, Tunisia","institution_ids":["https://openalex.org/I108714496"]},{"raw_affiliation_string":"[SOIE Lab, University of Tunis, Tunisia]","institution_ids":["https://openalex.org/I108714496"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080575230","display_name":"Slim Bechikh","orcid":"https://orcid.org/0000-0003-1378-7415"},"institutions":[{"id":"https://openalex.org/I108714496","display_name":"Tunis University","ror":"https://ror.org/02q1spa57","country_code":"TN","type":"education","lineage":["https://openalex.org/I108714496"]}],"countries":["TN"],"is_corresponding":false,"raw_author_name":"Slim Bechikh","raw_affiliation_strings":["SOIE lab, University of Tunis, Tunisia","[SOIE Lab, University of Tunis, Tunisia]"],"affiliations":[{"raw_affiliation_string":"SOIE lab, University of Tunis, Tunisia","institution_ids":["https://openalex.org/I108714496"]},{"raw_affiliation_string":"[SOIE Lab, University of Tunis, Tunisia]","institution_ids":["https://openalex.org/I108714496"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028612749","display_name":"Lamjed Ben Sa\u00efd","orcid":"https://orcid.org/0000-0001-9225-884X"},"institutions":[{"id":"https://openalex.org/I108714496","display_name":"Tunis University","ror":"https://ror.org/02q1spa57","country_code":"TN","type":"education","lineage":["https://openalex.org/I108714496"]}],"countries":["TN"],"is_corresponding":false,"raw_author_name":"Lamjed Ben Said","raw_affiliation_strings":["SOIE lab, University of Tunis, Tunisia","[SOIE Lab, University of Tunis, Tunisia]"],"affiliations":[{"raw_affiliation_string":"SOIE lab, University of Tunis, Tunisia","institution_ids":["https://openalex.org/I108714496"]},{"raw_affiliation_string":"[SOIE Lab, University of Tunis, Tunisia]","institution_ids":["https://openalex.org/I108714496"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5040931960"],"corresponding_institution_ids":["https://openalex.org/I108714496"],"apc_list":null,"apc_paid":null,"fwci":5.6583,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.95148682,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"11","issue":null,"first_page":"1659","last_page":"1666"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998999834060669,"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.9998999834060669,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9973000288009644,"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/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.698233425617218},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.627042829990387},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6238363981246948},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6045210957527161},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5264716148376465},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.5238511562347412},{"id":"https://openalex.org/keywords/evolutionary-computation","display_name":"Evolutionary computation","score":0.5066469311714172},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.5006756782531738},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4687390923500061},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37413328886032104},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2847214639186859}],"concepts":[{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.698233425617218},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.627042829990387},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6238363981246948},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6045210957527161},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5264716148376465},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5238511562347412},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.5066469311714172},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.5006756782531738},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4687390923500061},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37413328886032104},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2847214639186859},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2015.7257086","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2015.7257086","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.41999998688697815,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W24416707","https://openalex.org/W55700729","https://openalex.org/W182686865","https://openalex.org/W1032665075","https://openalex.org/W1762936176","https://openalex.org/W1975320652","https://openalex.org/W1975828823","https://openalex.org/W1992590811","https://openalex.org/W1992769367","https://openalex.org/W2001759562","https://openalex.org/W2007103412","https://openalex.org/W2024008934","https://openalex.org/W2033330109","https://openalex.org/W2049862811","https://openalex.org/W2059650581","https://openalex.org/W2078101422","https://openalex.org/W2079868696","https://openalex.org/W2096166399","https://openalex.org/W2111563176","https://openalex.org/W2114133631","https://openalex.org/W2136189599","https://openalex.org/W2140145913","https://openalex.org/W2154062181","https://openalex.org/W2158840840","https://openalex.org/W2160476179","https://openalex.org/W2170631832","https://openalex.org/W3121170803","https://openalex.org/W6601052073","https://openalex.org/W6626938452","https://openalex.org/W6638128249","https://openalex.org/W6663052677","https://openalex.org/W6922503566"],"related_works":["https://openalex.org/W3191679877","https://openalex.org/W1576195779","https://openalex.org/W2129773030","https://openalex.org/W2123722903","https://openalex.org/W2557322971","https://openalex.org/W2904503394","https://openalex.org/W4294811723","https://openalex.org/W2887309774","https://openalex.org/W2566493394","https://openalex.org/W3083212116"],"abstract_inverted_index":{"Several":[0],"optimization":[1,10],"problems":[2],"encountered":[3],"in":[4,124],"practice":[5],"have":[6],"two":[7,153],"levels":[8],"of":[9,12,30,65,73,76,110,139,141,161,168],"instead":[11],"a":[13,45,92,137],"single":[14],"one.":[15],"These":[16],"BLOPs":[17],"(Bi-Level":[18],"Optimization":[19],"Problems)":[20],"are":[21,80],"very":[22],"computationally":[23],"expensive":[24],"to":[25,57,69,82,103,114,126,152],"solve":[26,70],"since":[27],"the":[28,41,58,63,83,121,129,142,162,166],"evaluation":[29],"each":[31],"upper":[32],"level":[33,123],"solution":[34,39],"requires":[35],"finding":[36],"an":[37],"optimal":[38],"for":[40],"lower":[42,122],"level.":[43],"Recently,":[44],"new":[46,93],"research":[47],"field,":[48],"called":[49,96],"EBO":[50],"(Evolutionary":[51,67],"Bi-Level":[52],"Optimization)":[53],"has":[54],"appeared":[55],"thanks":[56],"promising":[59,78],"results":[60,79,164],"obtained":[61,163],"by":[62,87],"use":[64],"EAs":[66],"Algorithms)":[68],"such":[71],"kind":[72],"problems.":[74],"Most":[75],"these":[77],"restricted":[81],"continuous":[84],"case.":[85],"Motivated":[86],"this":[88],"observation,":[89],"we":[90],"propose":[91],"bi-level":[94,143,156],"algorithm,":[95],"CODBA":[97,112,133,169],"(CO-Evolutionary":[98],"Decomposition":[99],"based":[100],"Bi-level":[101],"Algorithm),":[102],"tackle":[104],"combinatorial":[105],"BLOPs.":[106],"The":[107,158],"basic":[108],"idea":[109],"our":[111],"is":[113,134,150],"exploit":[115],"decomposition,":[116],"parallelism,":[117],"and":[118,149,172],"co-evolution":[119],"within":[120],"order":[125],"cope":[127],"with":[128],"high":[130],"computational":[131],"cost.":[132],"assessed":[135],"on":[136],"set":[138],"instances":[140],"MDVRP":[144],"(MultiDepot":[145],"Vehicle":[146],"Routing":[147],"Problem)":[148],"confronted":[151],"recently":[154],"proposed":[155],"algorithms.":[157],"statistical":[159],"analysis":[160],"shows":[165],"merits":[167],"from":[170],"effectiveness":[171],"efficiency":[173],"viewpoints.":[174]},"counts_by_year":[{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}