{"id":"https://openalex.org/W2030507895","doi":"https://doi.org/10.1109/icnc.2012.6234677","title":"Random-weight based genetic algorithm for multiobjective bilevel mixed linear integer programming","display_name":"Random-weight based genetic algorithm for multiobjective bilevel mixed linear integer programming","publication_year":2012,"publication_date":"2012-05-01","ids":{"openalex":"https://openalex.org/W2030507895","doi":"https://doi.org/10.1109/icnc.2012.6234677","mag":"2030507895"},"language":"en","primary_location":{"id":"doi:10.1109/icnc.2012.6234677","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2012.6234677","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 8th International Conference on Natural Computation","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/A5002631899","display_name":"Guocheng Zou","orcid":null},"institutions":[{"id":"https://openalex.org/I2802584641","display_name":"Leshan Normal University","ror":"https://ror.org/036cvz290","country_code":"CN","type":"education","lineage":["https://openalex.org/I2802584641"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Guocheng Zou","raw_affiliation_strings":["School of mathematics and information science, Leshan Normal University, Leshan, China","School of Mathematics and Information Science, Leshan Normal University, 614004, China"],"affiliations":[{"raw_affiliation_string":"School of mathematics and information science, Leshan Normal University, Leshan, China","institution_ids":["https://openalex.org/I2802584641"]},{"raw_affiliation_string":"School of Mathematics and Information Science, Leshan Normal University, 614004, China","institution_ids":["https://openalex.org/I2802584641"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108050298","display_name":"Liping Jia","orcid":"https://orcid.org/0000-0001-9693-813X"},"institutions":[{"id":"https://openalex.org/I2802584641","display_name":"Leshan Normal University","ror":"https://ror.org/036cvz290","country_code":"CN","type":"education","lineage":["https://openalex.org/I2802584641"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Liping Jia","raw_affiliation_strings":["School of mathematics and information science, Leshan Normal University, Leshan, China","School of Mathematics and Information Science, Leshan Normal University, 614004, China"],"affiliations":[{"raw_affiliation_string":"School of mathematics and information science, Leshan Normal University, Leshan, China","institution_ids":["https://openalex.org/I2802584641"]},{"raw_affiliation_string":"School of Mathematics and Information Science, Leshan Normal University, 614004, China","institution_ids":["https://openalex.org/I2802584641"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003746258","display_name":"Jin Zou","orcid":"https://orcid.org/0000-0001-9435-8043"},"institutions":[{"id":"https://openalex.org/I2802584641","display_name":"Leshan Normal University","ror":"https://ror.org/036cvz290","country_code":"CN","type":"education","lineage":["https://openalex.org/I2802584641"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jin Zou","raw_affiliation_strings":["School of mathematics and information science, Leshan Normal University, Leshan, China","School of Mathematics and Information Science, Leshan Normal University, 614004, China"],"affiliations":[{"raw_affiliation_string":"School of mathematics and information science, Leshan Normal University, Leshan, China","institution_ids":["https://openalex.org/I2802584641"]},{"raw_affiliation_string":"School of Mathematics and Information Science, Leshan Normal University, 614004, China","institution_ids":["https://openalex.org/I2802584641"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5002631899"],"corresponding_institution_ids":["https://openalex.org/I2802584641"],"apc_list":null,"apc_paid":null,"fwci":0.6848,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.75662982,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"693","last_page":"697"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9976000189781189,"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.9976000189781189,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9965000152587891,"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.9941999912261963,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bilevel-optimization","display_name":"Bilevel optimization","score":0.8007633686065674},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6988456845283508},{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.6523586511611938},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.6209736466407776},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5682393908500671},{"id":"https://openalex.org/keywords/karush\u2013kuhn\u2013tucker-conditions","display_name":"Karush\u2013Kuhn\u2013Tucker conditions","score":0.5665532350540161},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5472665429115295},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5112612247467041},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.44378286600112915},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.43942171335220337},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.41803669929504395},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.414675235748291},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.41428709030151367},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.391191303730011},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.3178262412548065},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11051464080810547}],"concepts":[{"id":"https://openalex.org/C3309286","wikidata":"https://www.wikidata.org/wiki/Q4907693","display_name":"Bilevel optimization","level":3,"score":0.8007633686065674},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6988456845283508},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.6523586511611938},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6209736466407776},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5682393908500671},{"id":"https://openalex.org/C50454189","wikidata":"https://www.wikidata.org/wiki/Q2075125","display_name":"Karush\u2013Kuhn\u2013Tucker conditions","level":2,"score":0.5665532350540161},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5472665429115295},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5112612247467041},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.44378286600112915},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.43942171335220337},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.41803669929504395},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.414675235748291},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41428709030151367},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.391191303730011},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3178262412548065},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11051464080810547},{"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/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icnc.2012.6234677","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2012.6234677","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 8th International Conference on Natural Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.75}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W81377078","https://openalex.org/W1578304747","https://openalex.org/W1964765773","https://openalex.org/W1985447622","https://openalex.org/W2000152357","https://openalex.org/W2001306951","https://openalex.org/W2011661879","https://openalex.org/W2013038594","https://openalex.org/W2013753508","https://openalex.org/W2022499397","https://openalex.org/W2045089402","https://openalex.org/W2062512894","https://openalex.org/W2071119155","https://openalex.org/W2079136127","https://openalex.org/W2080154522","https://openalex.org/W2080893543","https://openalex.org/W2111240209","https://openalex.org/W2138865117","https://openalex.org/W2166549228","https://openalex.org/W2481910659"],"related_works":["https://openalex.org/W4322709579","https://openalex.org/W2080478657","https://openalex.org/W2732076076","https://openalex.org/W4286893854","https://openalex.org/W2920493340","https://openalex.org/W2030722820","https://openalex.org/W2126813526","https://openalex.org/W4381948319","https://openalex.org/W2362635706","https://openalex.org/W2994922825"],"abstract_inverted_index":{"In":[0],"this":[1,35],"paper,":[2],"we":[3],"address":[4],"a":[5,20,30,65],"class":[6],"of":[7,37,67],"multiobjective":[8,21,90],"bilevel":[9,91],"mixed":[10,92],"linear":[11,22,32,93],"integer":[12,94],"programming":[13,95],"in":[14],"which":[15],"the":[16,26,39,48,59,70,105],"upper":[17,71],"level":[18,28,61],"is":[19,29,62,96,108],"optimization":[23],"problem,":[24,38],"and":[25,47,81,102],"lower":[27,60],"single-objective":[31],"programming.":[33],"For":[34],"kind":[36],"leader's":[40],"decision":[41,50],"are":[42,51],"represented":[43,52],"by":[44,53,110],"zero-one":[45],"variables,":[46],"follower's":[49],"continuous":[54],"variables.":[55],"Using":[56],"KKT":[57],"condition,":[58],"transformed":[63],"into":[64],"series":[66],"constraints":[68],"for":[69,89],"level.":[72],"Based":[73],"on":[74],"coding,":[75],"crossover,":[76],"mutation,":[77],"fitness":[78],"assignment":[79],"method":[80],"select":[82],"strategy,":[83],"an":[84,111],"improved":[85],"random-weight":[86],"genetic":[87],"algorithm":[88,107],"proposed.":[97],"By":[98],"designing":[99],"benchmark":[100],"problems":[101],"suitable":[103],"transformation,":[104],"proposed":[106],"compared":[109],"existed":[112],"branch-bound":[113],"algorithm.":[114]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}