{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:19:05Z","timestamp":1743023945365,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":23,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819958436"},{"type":"electronic","value":"9789819958443"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-981-99-5844-3_32","type":"book-chapter","created":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T22:02:16Z","timestamp":1693432936000},"page":"442-454","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Twin Learning Evolutionary Algorithm for Capacitated Vehicle Routing Problem"],"prefix":"10.1007","author":[{"given":"Hanshi","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liang","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhou","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Choujun","family":"Zhan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,31]]},"reference":[{"key":"32_CR1","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.trpro.2018.09.017","volume":"30","author":"M Marinelli","year":"2018","unstructured":"Marinelli, M., Colovic, A., Dell\u2019Orco, M.: A novel dynamic programming approach for two-echelon capacitated vehicle routing problem in city logistics with environmental considerations. Transp. Res. Procedia 30, 147\u2013156 (2018)","journal-title":"Transp. Res. Procedia"},{"unstructured":"T\u00fczemen, A., Yildiz, \u00c7.: A solution proposal to vehicle routing problem with integer linear programming: a distributor company sample. Int. J. Contemp. Econ. Adm. Sci. 9(1), 46\u201378 (2019)","key":"32_CR2"},{"doi-asserted-by":"crossref","unstructured":"Filipec, M., Skrlec, D., Krajcar, S.: An efficient implementation of genetic algorithms for constrained vehicle routing problem. In: SMC 1998 Conference Proceedings. 1998 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No. 98CH36218), vol. 3, pp. 2231\u20132236. IEEE (1998)","key":"32_CR3","DOI":"10.1109\/ICSMC.1998.724987"},{"key":"32_CR4","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.endm.2004.06.029","volume":"18","author":"S Mazzeo","year":"2004","unstructured":"Mazzeo, S., Loiseau, I.: An Ant Colony algorithm for the capacitated vehicle routing. Electron. Notes Discrete Math. 18, 181\u2013186 (2004)","journal-title":"Electron. Notes Discrete Math."},{"key":"32_CR5","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.neucom.2022.08.005","volume":"508","author":"K Lei","year":"2022","unstructured":"Lei, K., Guo, P., Wang, Y., Wu, X., Zhao, W.: Solve routing problems with a residual edge-graph attention neural network. Neurocomputing 508, 79\u201398 (2022)","journal-title":"Neurocomputing"},{"issue":"12","key":"32_CR6","doi-asserted-by":"publisher","first-page":"13572","DOI":"10.1109\/TCYB.2021.3111082","volume":"52","author":"J Li","year":"2021","unstructured":"Li, J., et al.: Deep reinforcement learning for solving the heterogeneous capacitated vehicle routing problem. IEEE Trans. Cybern. 52(12), 13572\u201313585 (2021)","journal-title":"IEEE Trans. Cybern."},{"key":"32_CR7","series-title":"Algorithms for Intelligent Systems","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-981-33-4191-3_5","volume-title":"Evolutionary Data Clustering: Algorithms and Applications","author":"DVT Son","year":"2021","unstructured":"Son, D.V.T., Tan, P.N.: Capacitated vehicle routing problem\u2014a new clustering approach based on hybridization of adaptive particle swarm optimization and grey wolf optimization. In: Aljarah, I., Faris, H., Mirjalili, S. (eds.) Evolutionary Data Clustering: Algorithms and Applications. AIS, pp. 111\u2013128. Springer, Singapore (2021). https:\/\/doi.org\/10.1007\/978-981-33-4191-3_5"},{"issue":"3","key":"32_CR8","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1109\/TEVC.2015.2458037","volume":"20","author":"A Gupta","year":"2015","unstructured":"Gupta, A., Ong, Y.S., Feng, L.: Multifactorial evolution: toward evolutionary multitasking. IEEE Trans. Evol. Comput. 20(3), 343\u2013357 (2015)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"32_CR9","first-page":"10418","volume":"34","author":"M Kim","year":"2021","unstructured":"Kim, M., Park, J., et al.: Learning collaborative policies to solve NP-hard routing problems. Adv. Neural. Inf. Process. Syst. 34, 10418\u201310430 (2021)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"32_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s42979-021-00779-2","volume":"2","author":"P da Costa","year":"2021","unstructured":"da Costa, P., Rhuggenaath, J., Zhang, Y., Akcay, A., Kaymak, U.: Learning 2-Opt heuristics for routing problems via deep reinforcement learning. SN Comput. Sci. 2, 1\u201316 (2021)","journal-title":"SN Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Osaba, E., Martinez, A.D., Lobo, J.L., La\u00f1a, I., Del Ser, J.: On the transferability of knowledge among vehicle routing problems by using cellular evolutionary multitasking. In: 2020 IEEE 23rd International Conference on Intelligent Transportation Systems (ITSC), pp. 1\u20138. IEEE (2020)","key":"32_CR11","DOI":"10.1109\/ITSC45102.2020.9294497"},{"issue":"6","key":"32_CR12","doi-asserted-by":"publisher","first-page":"3143","DOI":"10.1109\/TCYB.2019.2962865","volume":"51","author":"L Feng","year":"2020","unstructured":"Feng, L., et al.: Explicit evolutionary multitasking for combinatorial optimization: a case study on capacitated vehicle routing problem. IEEE Trans. Cybern. 51(6), 3143\u20133156 (2020)","journal-title":"IEEE Trans. Cybern."},{"doi-asserted-by":"crossref","unstructured":"Wu, J., Yang, H., Zeng, Y., Wu, Z., Liu, J., Feng, L.: A twin learning framework for traveling salesman problem based on autoencoder, graph filter, and transfer learning. IEEE Trans. Consum. Electron. (2023)","key":"32_CR13","DOI":"10.1109\/TCE.2023.3269071"},{"key":"32_CR14","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.endm.2017.03.030","volume":"58","author":"M Amous","year":"2017","unstructured":"Amous, M., Toumi, S., Jarboui, B., Eddaly, M.: A variable neighborhood search algorithm for the capacitated vehicle routing problem. Electron. Notes Discrete Math. 58, 231\u2013238 (2017)","journal-title":"Electron. Notes Discrete Math."},{"doi-asserted-by":"crossref","unstructured":"Zhang, Y., Wang, J., Zhang, Z.: Edge-based formulation with graph attention network for practical vehicle routing problem with time windows. In: 2022 International Joint Conference on Neural Networks (IJCNN), pp. 01\u201308. IEEE (2022)","key":"32_CR15","DOI":"10.1109\/IJCNN55064.2022.9892537"},{"issue":"17","key":"32_CR16","doi-asserted-by":"publisher","first-page":"11157","DOI":"10.1007\/s00521-020-05654-4","volume":"33","author":"K Hu","year":"2021","unstructured":"Hu, K., Liu, H., Zhan, C., Tang, Y., Hao, T.: Learning knowledge graph embedding with a bi-directional relation encoding network and a convolutional autoencoder decoding network. Neural Comput. Appl. 33(17), 11157\u201311173 (2021). https:\/\/doi.org\/10.1007\/s00521-020-05654-4","journal-title":"Neural Comput. Appl."},{"doi-asserted-by":"crossref","unstructured":"Zeng, Y., Wu, Z., Liu, J., Feng, L.: Point cloud simplification based on decomposed graph filtering. In: 2020 IEEE 18th International Conference on Industrial Informatics (INDIN), vol. 1, pp. 725\u2013728. IEEE (2020)","key":"32_CR17","DOI":"10.1109\/INDIN45582.2020.9442076"},{"doi-asserted-by":"publisher","unstructured":"Kramer, O., Kramer, O.: K-nearest neighbors. In: Dimensionality Reduction with Unsupervised Nearest Neighbors, vol. 51, pp. 13\u201323. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-642-38652-7_2","key":"32_CR18","DOI":"10.1007\/978-3-642-38652-7_2"},{"doi-asserted-by":"crossref","unstructured":"Carroll, J.D., Arabie, P.: Multidimensional scaling. In: Measurement, Judgment and Decision Making, pp. 179\u2013250 (1998)","key":"32_CR19","DOI":"10.1016\/B978-012099975-0.50005-1"},{"issue":"3","key":"32_CR20","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1057\/jors.1969.75","volume":"20","author":"N Christofides","year":"1969","unstructured":"Christofides, N., Eilon, S.: An algorithm for the vehicle-dispatching problem. J. Oper. Res. Soc. 20(3), 309\u2013318 (1969)","journal-title":"J. Oper. Res. Soc."},{"unstructured":"Augerat, P., Naddef, D., Belenguer, J., Benavent, E., Corberan, A., Rinaldi, G.: Computational results with a branch and cut code for the capacitated vehicle routing problem (1995)","key":"32_CR21"},{"doi-asserted-by":"crossref","unstructured":"Poggi, M., Uchoa, E., et al.: New exact algorithms for the capacitated vehicle routing problem (2014)","key":"32_CR22","DOI":"10.1137\/1.9781611973594.ch3"},{"issue":"8","key":"32_CR23","doi-asserted-by":"publisher","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","volume":"34","author":"D Pisinger","year":"2007","unstructured":"Pisinger, D., Ropke, S.: A general heuristic for vehicle routing problems. Comput. Oper. Res. 34(8), 2403\u20132435 (2007)","journal-title":"Comput. Oper. Res."}],"container-title":["Communications in Computer and Information Science","International Conference on Neural Computing for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-5844-3_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,27]],"date-time":"2024-10-27T06:10:42Z","timestamp":1730009442000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-5844-3_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9789819958436","9789819958443"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-5844-3_32","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"31 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NCAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Neural Computing for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hefei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ncaa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dl2link.com\/ncaa2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"211","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"83","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.21","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.67","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}