{"id":"https://openalex.org/W2500051539","doi":"https://doi.org/10.1145/2908961.2908976","title":"Solving Maximum Cut Problem with an Incremental Genetic Algorithm","display_name":"Solving Maximum Cut Problem with an Incremental Genetic Algorithm","publication_year":2016,"publication_date":"2016-07-20","ids":{"openalex":"https://openalex.org/W2500051539","doi":"https://doi.org/10.1145/2908961.2908976","mag":"2500051539"},"language":"en","primary_location":{"id":"doi:10.1145/2908961.2908976","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2908961.2908976","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 on Genetic and Evolutionary Computation Conference Companion","raw_type":"proceedings-article"},"type":"conference-paper","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/A5100411984","display_name":"Jinhyun Kim","orcid":"https://orcid.org/0009-0002-4825-3114"},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Jinhyun Kim","raw_affiliation_strings":["Seoul National University, Seoul, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Seoul National University, Seoul, South Korea","institution_ids":["https://openalex.org/I139264467"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006119424","display_name":"Yourim Yoon","orcid":"https://orcid.org/0000-0001-5875-0275"},"institutions":[{"id":"https://openalex.org/I12832649","display_name":"Gachon University","ror":"https://ror.org/03ryywt80","country_code":"KR","type":"education","lineage":["https://openalex.org/I12832649"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Yourim Yoon","raw_affiliation_strings":["Gachon University, Gyeonggi-do, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Gachon University, Gyeonggi-do, South Korea","institution_ids":["https://openalex.org/I12832649"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022911578","display_name":"Byung-Ro Moon","orcid":"https://orcid.org/0000-0002-4968-2159"},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Byung-Ro Moon","raw_affiliation_strings":["Seoul National University, Seoul, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Seoul National University, Seoul, South Korea","institution_ids":["https://openalex.org/I139264467"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"49","last_page":"50"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9970999956130981,"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.9970999956130981,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9968000054359436,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9944000244140625,"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/benchmark","display_name":"Benchmark (surveying)","score":0.6886547207832336},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.6487182378768921},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.644108772277832},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6210474967956543},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6122279167175293},{"id":"https://openalex.org/keywords/population-based-incremental-learning","display_name":"Population-based incremental learning","score":0.5875084400177002},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.5087464451789856},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4919879138469696},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.46249982714653015},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28834477066993713},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.20292821526527405},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.16168248653411865}],"concepts":[{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6886547207832336},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6487182378768921},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.644108772277832},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6210474967956543},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6122279167175293},{"id":"https://openalex.org/C184497298","wikidata":"https://www.wikidata.org/wiki/Q7229773","display_name":"Population-based incremental learning","level":3,"score":0.5875084400177002},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.5087464451789856},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4919879138469696},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46249982714653015},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28834477066993713},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.20292821526527405},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.16168248653411865},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2908961.2908976","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2908961.2908976","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 on Genetic and Evolutionary Computation Conference Companion","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321292","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":2,"referenced_works":["https://openalex.org/W209501560","https://openalex.org/W2047480303"],"related_works":["https://openalex.org/W2373079942","https://openalex.org/W2031035514","https://openalex.org/W2385808795","https://openalex.org/W2375052855","https://openalex.org/W2372098157","https://openalex.org/W2129228523","https://openalex.org/W2376671918","https://openalex.org/W2369480021","https://openalex.org/W2315556940","https://openalex.org/W2533970107"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"propose":[4,28],"an":[5,51,62],"incremental":[6,55],"genetic":[7,48],"algorithm":[8,22,49],"applied":[9,58],"to":[10,31,61],"solve":[11],"the":[12,18,21,34,54],"maximum":[13],"cut":[14],"problem.":[15],"We":[16,27],"test":[17],"implementation":[19],"of":[20,36,46,65],"on":[23],"benchmark":[24],"graph":[25],"instances.":[26],"several":[29],"methods":[30],"build":[32],"up":[33],"sequence":[35,64],"subproblems,":[37],"and":[38],"they":[39],"are":[40],"tested":[41],"through":[42],"experiments.":[43],"The":[44],"performance":[45],"a":[47],"makes":[50],"improvement":[52],"when":[53],"approach":[56],"is":[57],"with":[59],"respect":[60],"appropriate":[63],"subproblems.":[66]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}