{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T15:37:04Z","timestamp":1774021024199,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,8,4]],"date-time":"2023-08-04T00:00:00Z","timestamp":1691107200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Nature Science Foundation of Fujian Province of P. R. China","award":["2023J01078, 2020J01570"],"award-info":[{"award-number":["2023J01078, 2020J01570"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,8,4]]},"DOI":"10.1145\/3617733.3617754","type":"proceedings-article","created":{"date-parts":[[2023,10,31]],"date-time":"2023-10-31T15:24:12Z","timestamp":1698765852000},"page":"129-135","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["A Multi-parent Hybrid Order and Cost-based Sequential Constructive Crossover of Genetic Algorithm for the Traveling Salesman Problem"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8036-141X","authenticated-orcid":false,"given":"Zhida","family":"Liu","sequence":"first","affiliation":[{"name":"College of Computer and Information Science, Fujian Agriculture and Forestry University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-7194-3087","authenticated-orcid":false,"given":"Biao","family":"Di","sequence":"additional","affiliation":[{"name":"College of Computer and Information Science, Fujian Agriculture and Forestry University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4279-6081","authenticated-orcid":false,"given":"Juan","family":"Lin","sequence":"additional","affiliation":[{"name":"College of Computer and Information Science, Fujian Agriculture and Forestry University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,10,31]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Adaptation in natural and artificial systems","author":"Holland John H.","unstructured":"Holland John, H.: Adaptation in natural and artificial systems. Ann Arbor: University of Michigan Press (1975)"},{"key":"e_1_3_2_1_2_1","volume-title":"Dishabi","author":"Lotf J.J.","year":"2022","unstructured":"Lotf, J.J., Azgomi, M.A., Dishabi, M.R.E.: An improved influence maximization method for social networks based on genetic algorithm. Physica A: Statistical Mechanics and its Applications 586, 126480 (2022)"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Ahmed Z.H.: A hybrid genetic algorithm for the bottleneck traveling salesman problem. ACM Transactions on Embedded Computing Systems (TECS) 12(1) 1\u201310 (2013)","DOI":"10.1145\/2406336.2406345"},{"key":"e_1_3_2_1_4_1","first-page":"164","volume-title":"IJCAI.","author":"Davis L.","year":"1985","unstructured":"Davis, L., : Applying adaptive algorithms to epistatic domains. In: IJCAI. vol. 85, pp. 162\u2013164 (1985)"},{"key":"e_1_3_2_1_5_1","first-page":"159","volume-title":"Proceedings of an international conference on genetic algorithms and their applications.","volume":"154","author":"Goldberg D.E.","unstructured":"Goldberg, D.E., Lingle, R., : Alleles, loci, and the traveling salesman problem. In: Proceedings of an international conference on genetic algorithms and their applications. vol. 154, pp. 154\u2013159. Lawrence Erlbaum Hillsdale, NJ (1985)"},{"key":"e_1_3_2_1_6_1","volume-title":"Rinaldi","author":"J\u00fcnger M.","year":"1995","unstructured":"J\u00fcnger, M., Reinelt, G., Rinaldi, G.: The traveling salesman problem. Handbooks in operations research and management science 7, 225\u2013330 (1995)"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0191-2615(99)00057-0"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Watanabe M. Ida K. Gen M.: A genetic algorithm with modified crossover operator and search area adaptation for the job-shop scheduling problem. Computers \\& Industrial Engineering 48(4) 743\u2013752 (2005)","DOI":"10.1016\/j.cie.2004.12.008"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Roychowdhury S. Allen T.T. Allen N.B.: A genetic algorithm with an earliest due date encoding for scheduling automotive stamping operations. Computers \\& Industrial Engineering 105 201\u2013209 (2017)","DOI":"10.1016\/j.cie.2017.01.007"},{"key":"e_1_3_2_1_10_1","first-page":"87","volume-title":"International conference on parallel problem solving from nature.","author":"Eiben A.E.","unstructured":"Eiben, A.E., Raue, P.E., Ruttkay, Z.: Genetic algorithms with multi-parent recombination. In: International conference on parallel problem solving from nature. pp. 78\u201387. Springer (1994)."},{"key":"e_1_3_2_1_11_1","volume-title":": Multi-parent recombination. Evolutionary computation 1, 289\u2013307","author":"Eiben A.E.","year":"1997","unstructured":"Eiben, A.E.: Multi-parent recombination. Evolutionary computation 1, 289\u2013307 (1997)."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Arram A. Ayob M.: A novel multi-parent order crossover in genetic algorithm for combinatorial optimization problems. Computers & Industrial Engineering 133 .","DOI":"10.1016\/j.cie.2019.05.012"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2009.07.082"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2008.08.025"},{"key":"e_1_3_2_1_15_1","first-page":"87","volume-title":"International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems.","author":"Skliarova I.","unstructured":"Skliarova, I., Ferrari, A.B.: Fpga-based implementation of genetic algorithm for the traveling salesman problem and its industrial application. In: International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems. pp. 77\u201387. Springer (2002)"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2005.09.042"},{"key":"e_1_3_2_1_17_1","unstructured":"Ahmed Z.H.: Genetic algorithm for the traveling salesman problem using sequential constructive crossover operator. International Journal of Biometrics \\& Bioinformatics (IJBB) 3(6) 96 (2010)"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1504\/IJOR.2011.041347"},{"key":"e_1_3_2_1_19_1","volume-title":"Proc. 1st GNT Reg. Conf. Math. Stat. Appl. (2000)","author":"Bryant K.","unstructured":"Bryant, K., Benjamin, A.: Genetic algorithms and the traveling salesman problem by kylie bryant genetic algorithms and the traveling salesman problem by. In: Proc. 1st GNT Reg. Conf. Math. Stat. Appl. (2000)"},{"key":"e_1_3_2_1_20_1","volume-title":"Harrath","author":"Kaabi J.","year":"2019","unstructured":"Kaabi, J., Harrath, Y.: Permutation rules and genetic algorithm to solve the traveling salesman problem. Arab journal of basic and applied sciences 26(1), 283\u2013291 (2019)"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.3390\/info10120390"},{"issue":"2","key":"e_1_3_2_1_22_1","first-page":"1","article-title":"Amcpa: A population metaheuristic with adaptive crossover probability and multi-crossover mechanism for solving combinatorial optimization problems","volume":"12","author":"Osaba E.","year":"2014","unstructured":"Osaba, E., Diaz, F., Onieva, E., Carballedo, R., Perallos, A.: Amcpa: A population metaheuristic with adaptive crossover probability and multi-crossover mechanism for solving combinatorial optimization problems. International Journal of Artificial Intelligence 12(2), 1\u201323 (2014)","journal-title":"International Journal of Artificial Intelligence"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2004.12.008"}],"event":{"name":"ICCCM 2023: 2023 The 11th International Conference on Computer and Communications Management","location":"Nagoya Japan","acronym":"ICCCM 2023"},"container-title":["Proceedings of the 2023 11th International Conference on Computer and Communications Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3617733.3617754","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3617733.3617754","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:57Z","timestamp":1750178277000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3617733.3617754"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,4]]},"references-count":23,"alternative-id":["10.1145\/3617733.3617754","10.1145\/3617733"],"URL":"https:\/\/doi.org\/10.1145\/3617733.3617754","relation":{},"subject":[],"published":{"date-parts":[[2023,8,4]]},"assertion":[{"value":"2023-10-31","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}