{"id":"https://openalex.org/W1971950008","doi":"https://doi.org/10.1109/cec.2013.6557935","title":"A hybrid genetic algorithm for the minimum interconnection cut problem","display_name":"A hybrid genetic algorithm for the minimum interconnection cut problem","publication_year":2013,"publication_date":"2013-06-01","ids":{"openalex":"https://openalex.org/W1971950008","doi":"https://doi.org/10.1109/cec.2013.6557935","mag":"1971950008"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2013.6557935","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2013.6557935","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE Congress on Evolutionary Computation","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/A5031303591","display_name":"Maolin Tang","orcid":"https://orcid.org/0000-0002-2416-4101"},"institutions":[{"id":"https://openalex.org/I160993911","display_name":"Queensland University of Technology","ror":"https://ror.org/03pnv4752","country_code":"AU","type":"education","lineage":["https://openalex.org/I160993911"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Maolin Tang","raw_affiliation_strings":["School of Electrical Engineering and Computer Science, Queensland University of Technology, Brisbane, Australia","Sch. of Electr. Eng. & Comput. Sci., Queensland Univ. of Technol., Brisbane, QLD, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering and Computer Science, Queensland University of Technology, Brisbane, Australia","institution_ids":["https://openalex.org/I160993911"]},{"raw_affiliation_string":"Sch. of Electr. Eng. & Comput. Sci., Queensland Univ. of Technol., Brisbane, QLD, Australia","institution_ids":["https://openalex.org/I160993911"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019828283","display_name":"Shenchen Pan","orcid":null},"institutions":[{"id":"https://openalex.org/I160993911","display_name":"Queensland University of Technology","ror":"https://ror.org/03pnv4752","country_code":"AU","type":"education","lineage":["https://openalex.org/I160993911"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Shenchen Pan","raw_affiliation_strings":["School of Electrical Engineering and Computer Science, Queensland University of Technology, Brisbane, Australia","Sch. of Electr. Eng. & Comput. Sci., Queensland Univ. of Technol., Brisbane, QLD, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering and Computer Science, Queensland University of Technology, Brisbane, Australia","institution_ids":["https://openalex.org/I160993911"]},{"raw_affiliation_string":"Sch. of Electr. Eng. & Comput. Sci., Queensland Univ. of Technol., Brisbane, QLD, Australia","institution_ids":["https://openalex.org/I160993911"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I160993911"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.07908384,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"18","issue":null,"first_page":"3004","last_page":"3011"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9936000108718872,"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.9936000108718872,"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.9864000082015991,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9699000120162964,"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/interconnection","display_name":"Interconnection","score":0.7384209632873535},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6622864007949829},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5981249213218689},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5958216786384583},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.5356336236000061},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4747736155986786},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4554526209831238},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4499666094779968},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.44295650720596313},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29706114530563354}],"concepts":[{"id":"https://openalex.org/C123745756","wikidata":"https://www.wikidata.org/wiki/Q1665949","display_name":"Interconnection","level":2,"score":0.7384209632873535},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6622864007949829},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5981249213218689},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5958216786384583},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.5356336236000061},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4747736155986786},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4554526209831238},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4499666094779968},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.44295650720596313},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29706114530563354},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2013.6557935","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2013.6557935","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320315885","display_name":"Australian Government","ror":"https://ror.org/0314h5y94"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W609513197","https://openalex.org/W1497256448","https://openalex.org/W2011039300","https://openalex.org/W2038659256","https://openalex.org/W2052699881","https://openalex.org/W2081846387","https://openalex.org/W2111811973","https://openalex.org/W2121204510","https://openalex.org/W4214489689","https://openalex.org/W6633112120"],"related_works":["https://openalex.org/W2014709025","https://openalex.org/W2155019192","https://openalex.org/W3125341812","https://openalex.org/W1991674760","https://openalex.org/W1668171714","https://openalex.org/W2155297398","https://openalex.org/W4380607112","https://openalex.org/W2218294330","https://openalex.org/W1997278405","https://openalex.org/W2347989876"],"abstract_inverted_index":{"In":[0,54],"the":[1,49,59,82,101,104,107,123],"real":[2],"world":[3],"there":[4],"are":[5],"many":[6],"problems":[7,33],"in":[8,34,61,103],"network":[9],"of":[10,106],"networks":[11],"(NoNs)":[12],"that":[13,92,122],"can":[14],"be":[15],"abstracted":[16],"to":[17,41,98],"a":[18,67,76,87],"so-called":[19],"minimum":[20,31,50],"interconnection":[21,51],"cut":[22,32,52],"problem,":[23,73],"which":[24],"is":[25,39,86,125],"fundamentally":[26],"different":[27],"from":[28],"those":[29],"classical":[30],"graph":[35,62],"theory.":[36],"Thus,":[37],"it":[38,65],"desirable":[40],"propose":[42,75],"an":[43,94],"efficient":[44],"and":[45,69,74,114,127],"effective":[46,95,126],"algorithm":[47,79,90],"for":[48,81],"problem.":[53,83],"this":[55],"paper":[56],"we":[57],"formulate":[58],"problem":[60],"theory,":[63],"transform":[64],"into":[66],"multi-objective":[68],"multi-constraint":[70],"combinatorial":[71],"optimization":[72],"hybrid":[77],"genetic":[78,89],"(HGA)":[80],"The":[84,109],"HGA":[85,110,124],"penalty-based":[88],"(GA)":[91],"incorporates":[93],"heuristic":[96],"procedure":[97],"locally":[99],"optimize":[100],"individuals":[102],"population":[105],"GA.":[108],"has":[111],"been":[112],"implemented":[113],"evaluated":[115],"by":[116],"experiments.":[117],"Experimental":[118],"results":[119],"have":[120],"shown":[121],"efficient.":[128]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}