{"id":"https://openalex.org/W2006243706","doi":"https://doi.org/10.1145/2554850.2554882","title":"Investigation of hungarian mating schemes for genetic algorithms","display_name":"Investigation of hungarian mating schemes for genetic algorithms","publication_year":2014,"publication_date":"2014-03-24","ids":{"openalex":"https://openalex.org/W2006243706","doi":"https://doi.org/10.1145/2554850.2554882","mag":"2006243706"},"language":"en","primary_location":{"id":"doi:10.1145/2554850.2554882","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2554850.2554882","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","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/A5017400059","display_name":"Chanju Jung","orcid":"https://orcid.org/0000-0002-9189-9538"},"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":true,"raw_author_name":"Chanju Jung","raw_affiliation_strings":["Seoul National Univ., Seoul, Korea","Seoul National University, Seoul, Korea"],"affiliations":[{"raw_affiliation_string":"Seoul National Univ., Seoul, Korea","institution_ids":["https://openalex.org/I139264467"]},{"raw_affiliation_string":"Seoul National University, Seoul, Korea","institution_ids":["https://openalex.org/I139264467"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046031351","display_name":"Yong-Hyuk Kim","orcid":"https://orcid.org/0000-0002-0492-0889"},"institutions":[{"id":"https://openalex.org/I161024014","display_name":"Kwangwoon University","ror":"https://ror.org/02e9zc863","country_code":"KR","type":"education","lineage":["https://openalex.org/I161024014"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Yong-Hyuk Kim","raw_affiliation_strings":["Kwangwoon Univ., Seoul, Korea",", Kwangwoon University, Seoul, Korea"],"affiliations":[{"raw_affiliation_string":"Kwangwoon Univ., Seoul, Korea","institution_ids":["https://openalex.org/I161024014"]},{"raw_affiliation_string":", Kwangwoon University, Seoul, Korea","institution_ids":["https://openalex.org/I161024014"]}]},{"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/I4210131320","display_name":"LG (South Korea)","ror":"https://ror.org/03ddh2c27","country_code":"KR","type":"company","lineage":["https://openalex.org/I4210131320"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Yourim Yoon","raw_affiliation_strings":["LG Electronics, Seoul, Korea"],"affiliations":[{"raw_affiliation_string":"LG Electronics, Seoul, Korea","institution_ids":["https://openalex.org/I4210131320"]}]},{"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 Univ., Seoul, Korea","Seoul National University, Seoul, Korea"],"affiliations":[{"raw_affiliation_string":"Seoul National Univ., Seoul, Korea","institution_ids":["https://openalex.org/I139264467"]},{"raw_affiliation_string":"Seoul National University, Seoul, Korea","institution_ids":["https://openalex.org/I139264467"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5017400059"],"corresponding_institution_ids":["https://openalex.org/I139264467"],"apc_list":null,"apc_paid":null,"fwci":0.818,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.80052866,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"140","last_page":"147"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9983000159263611,"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"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9983000159263611,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9976999759674072,"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/T13664","display_name":"Genome Rearrangement Algorithms","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6963546872138977},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.6321340203285217},{"id":"https://openalex.org/keywords/mating","display_name":"Mating","score":0.6156803369522095},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5415804982185364},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5372115969657898},{"id":"https://openalex.org/keywords/hungarian-algorithm","display_name":"Hungarian algorithm","score":0.4523008465766907},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.443865031003952},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4328119456768036},{"id":"https://openalex.org/keywords/bisection-method","display_name":"Bisection method","score":0.4240639805793762},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30689066648483276},{"id":"https://openalex.org/keywords/assignment-problem","display_name":"Assignment problem","score":0.20066946744918823},{"id":"https://openalex.org/keywords/biology","display_name":"Biology","score":0.06727933883666992},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.062151312828063965}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6963546872138977},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.6321340203285217},{"id":"https://openalex.org/C514575182","wikidata":"https://www.wikidata.org/wiki/Q228395","display_name":"Mating","level":2,"score":0.6156803369522095},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5415804982185364},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5372115969657898},{"id":"https://openalex.org/C21785340","wikidata":"https://www.wikidata.org/wiki/Q281922","display_name":"Hungarian algorithm","level":3,"score":0.4523008465766907},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.443865031003952},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4328119456768036},{"id":"https://openalex.org/C157544257","wikidata":"https://www.wikidata.org/wiki/Q866300","display_name":"Bisection method","level":2,"score":0.4240639805793762},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30689066648483276},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.20066946744918823},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.06727933883666992},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.062151312828063965},{"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/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2554850.2554882","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2554850.2554882","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2706292587","display_name":null,"funder_award_id":"NRF-2008-0062609","funder_id":"https://openalex.org/F4320322120","funder_display_name":"National Research Foundation of Korea"}],"funders":[{"id":"https://openalex.org/F4320322120","display_name":"National Research Foundation of Korea","ror":"https://ror.org/013aysd81"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W23010679","https://openalex.org/W1504140168","https://openalex.org/W1516301787","https://openalex.org/W1539344456","https://openalex.org/W1553403542","https://openalex.org/W1575155528","https://openalex.org/W1612556207","https://openalex.org/W1639032689","https://openalex.org/W1970990877","https://openalex.org/W1978941741","https://openalex.org/W2013333763","https://openalex.org/W2024106841","https://openalex.org/W2030800128","https://openalex.org/W2042216983","https://openalex.org/W2062989416","https://openalex.org/W2067417069","https://openalex.org/W2069323107","https://openalex.org/W2069376987","https://openalex.org/W2072099061","https://openalex.org/W2095542706","https://openalex.org/W2096590200","https://openalex.org/W2098677716","https://openalex.org/W2127523265","https://openalex.org/W2163428398","https://openalex.org/W2167239601","https://openalex.org/W2167743927","https://openalex.org/W2222512263","https://openalex.org/W2616627863","https://openalex.org/W3023540311","https://openalex.org/W4251742697","https://openalex.org/W4400412639","https://openalex.org/W6630838125","https://openalex.org/W7008583937"],"related_works":["https://openalex.org/W1525389557","https://openalex.org/W2577097539","https://openalex.org/W2361554335","https://openalex.org/W2164188042","https://openalex.org/W2359992618","https://openalex.org/W2054495636","https://openalex.org/W4306878646","https://openalex.org/W3005108979","https://openalex.org/W2913191894","https://openalex.org/W2170589446"],"abstract_inverted_index":{"Mating":[0],"scheme":[1,96],"is":[2],"the":[3,16,29,37,44,54,61,66,73,76,84,101],"way":[4],"of":[5,18,39,75],"selecting":[6],"two":[7],"parents":[8],"to":[9,56],"make":[10],"offspring.":[11],"It":[12],"takes":[13],"effect":[14],"on":[15,83],"performance":[17,99],"genetic":[19],"algorithms.":[20],"In":[21],"this":[22],"paper,":[23],"we":[24,86],"investigate":[25],"mating":[26,92],"schemes":[27,33,55],"using":[28],"Hungarian":[30],"method.":[31],"The":[32,94],"include":[34],"i)":[35],"minimizing":[36],"sum":[38],"matching":[40,49],"distances,":[41],"ii)":[42],"maximizing":[43],"sum,":[45],"and":[46,65,70],"iii)":[47],"random":[48],"for":[50],"comparison.":[51],"We":[52],"apply":[53],"well-known":[57],"combinatorial":[58],"optimization":[59],"problems,":[60],"traveling":[62],"salesman":[63],"problem":[64],"graph":[67],"bisection":[68],"problem,":[69],"analyze":[71],"how":[72],"quality":[74],"best":[77],"individual":[78],"changes":[79],"over":[80],"generations.":[81],"Based":[82],"analysis,":[85],"finally":[87],"suggest":[88],"a":[89],"new":[90],"hybrid":[91],"scheme.":[93],"suggested":[95],"showed":[97],"better":[98],"than":[100],"non-hybrid":[102],"schemes.":[103]},"counts_by_year":[{"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"}