{"id":"https://openalex.org/W4388067929","doi":"https://doi.org/10.1145/3617733.3617754","title":"A Multi-parent Hybrid Order and Cost-based Sequential Constructive Crossover of Genetic Algorithm for the Traveling Salesman Problem","display_name":"A Multi-parent Hybrid Order and Cost-based Sequential Constructive Crossover of Genetic Algorithm for the Traveling Salesman Problem","publication_year":2023,"publication_date":"2023-08-04","ids":{"openalex":"https://openalex.org/W4388067929","doi":"https://doi.org/10.1145/3617733.3617754"},"language":"en","primary_location":{"id":"doi:10.1145/3617733.3617754","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3617733.3617754","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3617733.3617754","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 11th International Conference on Computer and Communications Management","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3617733.3617754","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5052287391","display_name":"Zhida Liu","orcid":"https://orcid.org/0000-0001-8036-141X"},"institutions":[{"id":"https://openalex.org/I61057504","display_name":"Fujian Agriculture and Forestry University","ror":"https://ror.org/04kx2sy84","country_code":"CN","type":"education","lineage":["https://openalex.org/I61057504"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhida Liu","raw_affiliation_strings":["College of Computer and Information Science, Fujian Agriculture and Forestry University, China"],"raw_orcid":"https://orcid.org/0000-0001-8036-141X","affiliations":[{"raw_affiliation_string":"College of Computer and Information Science, Fujian Agriculture and Forestry University, China","institution_ids":["https://openalex.org/I61057504"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110714737","display_name":"Biao Di","orcid":null},"institutions":[{"id":"https://openalex.org/I61057504","display_name":"Fujian Agriculture and Forestry University","ror":"https://ror.org/04kx2sy84","country_code":"CN","type":"education","lineage":["https://openalex.org/I61057504"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Biao Di","raw_affiliation_strings":["College of Computer and Information Science, Fujian Agriculture and Forestry University, China"],"raw_orcid":"https://orcid.org/0009-0001-7194-3087","affiliations":[{"raw_affiliation_string":"College of Computer and Information Science, Fujian Agriculture and Forestry University, China","institution_ids":["https://openalex.org/I61057504"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069086838","display_name":"Juan K. Lin","orcid":"https://orcid.org/0000-0002-4279-6081"},"institutions":[{"id":"https://openalex.org/I61057504","display_name":"Fujian Agriculture and Forestry University","ror":"https://ror.org/04kx2sy84","country_code":"CN","type":"education","lineage":["https://openalex.org/I61057504"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Juan Lin","raw_affiliation_strings":["College of Computer and Information Science, Fujian Agriculture and Forestry University, China"],"raw_orcid":"https://orcid.org/0000-0002-4279-6081","affiliations":[{"raw_affiliation_string":"College of Computer and Information Science, Fujian Agriculture and Forestry University, China","institution_ids":["https://openalex.org/I61057504"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I61057504"],"apc_list":null,"apc_paid":null,"fwci":0.8691,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.75760978,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"129","last_page":"135"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9994999766349792,"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.9994999766349792,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9977999925613403,"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.9915000200271606,"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/crossover","display_name":"Crossover","score":0.9629685878753662},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.9019045829772949},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.686893105506897},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.681989312171936},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.6082582473754883},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5930325984954834},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.563330352306366},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5046519041061401},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.41060003638267517},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36855483055114746},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18561550974845886},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.05992862582206726}],"concepts":[{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.9629685878753662},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9019045829772949},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.686893105506897},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.681989312171936},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.6082582473754883},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5930325984954834},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.563330352306366},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5046519041061401},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.41060003638267517},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36855483055114746},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18561550974845886},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.05992862582206726},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3617733.3617754","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3617733.3617754","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3617733.3617754","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 11th International Conference on Computer and Communications Management","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3617733.3617754","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3617733.3617754","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3617733.3617754","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 11th International Conference on Computer and Communications Management","raw_type":"proceedings-article"},"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.4399999976158142,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4388067929.pdf","grobid_xml":"https://content.openalex.org/works/W4388067929.grobid-xml"},"referenced_works_count":14,"referenced_works":["https://openalex.org/W159714159","https://openalex.org/W1486993561","https://openalex.org/W1659842140","https://openalex.org/W1985022578","https://openalex.org/W2026911372","https://openalex.org/W2069416257","https://openalex.org/W2071521748","https://openalex.org/W2072979369","https://openalex.org/W2074580034","https://openalex.org/W2076065686","https://openalex.org/W2570672817","https://openalex.org/W2944788248","https://openalex.org/W2993471286","https://openalex.org/W6758839503"],"related_works":["https://openalex.org/W2153505252","https://openalex.org/W3104258108","https://openalex.org/W2114549389","https://openalex.org/W4389782626","https://openalex.org/W2359992618","https://openalex.org/W4376138746","https://openalex.org/W2171568915","https://openalex.org/W2361554335","https://openalex.org/W1595757466","https://openalex.org/W2362402143"],"abstract_inverted_index":{"We":[0],"investigate":[1],"Genetic":[2],"Algorithm":[3],"(GA)":[4],"where":[5],"multi-parent":[6,81,90],"crossovers":[7],"are":[8],"involved":[9],"to":[10,66],"replace":[11],"the":[12,35,53,56,68,76,80,85,97,100],"traditional":[13],"two-parent":[14],"crossover":[15,32,51],"operation":[16,63],"in":[17],"permutation-based":[18],"problems.":[19],"And":[20,84],"we":[21],"propose":[22],"a":[23,59],"new":[24],"multiple-parent":[25],"hybrid":[26,82],"order":[27],"and":[28,92],"cost-based":[29,50],"sequential":[30],"constructive":[31],"(MPHOSCX)":[33],"for":[34,94],"Traveling":[36],"Salesman":[37],"Problem":[38],"(TSP).":[39],"More":[40],"genetic":[41],"high-quality":[42],"information":[43],"is":[44,64],"passed":[45],"on":[46],"through":[47],"multiple":[48],"parents,":[49],"ensures":[52],"efficiency":[54],"of":[55,71,78,99],"operation.":[57],"Further,":[58],"nearest":[60],"neighbor":[61],"inverse":[62],"used":[65],"enhance":[67],"overall":[69],"capability":[70],"exploitation.":[72],"Experimental":[73],"results":[74,87],"confirm":[75],"merits":[77],"using":[79],"crossover.":[83],"comparison":[86],"with":[88],"other":[89],"GA":[91],"GAs":[93],"TSP":[95],"demonstrate":[96],"superiority":[98],"proposed":[101],"operators.":[102]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1}],"updated_date":"2026-07-31T08:31:51.225901","created_date":"2025-10-10T00:00:00"}