{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T17:51:44Z","timestamp":1775065904967,"version":"3.50.1"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031147135","type":"print"},{"value":"9783031147142","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-14714-2_25","type":"book-chapter","created":{"date-parts":[[2022,8,13]],"date-time":"2022-08-13T21:03:13Z","timestamp":1660424593000},"page":"356-370","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Deep Reinforcement Learning with\u00a0Two-Stage Training Strategy for\u00a0Practical Electric Vehicle Routing Problem with\u00a0Time Windows"],"prefix":"10.1007","author":[{"given":"Jinbiao","family":"Chen","sequence":"first","affiliation":[]},{"given":"Huanhuan","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Zizhen","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Jiahai","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,14]]},"reference":[{"key":"25_CR1","unstructured":"Bello, I., Pham, H., Le, Q.V., Norouzi, M., Bengio, S.: Neural combinatorial optimization with reinforcement learning. In: International Conference on Learning Representations (2017)"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/j.cie.2015.12.007","volume":"99","author":"K Braekers","year":"2016","unstructured":"Braekers, K., Ramaekers, K., Van Nieuwenhuyse, I.: The vehicle routing problem: state of the art classification and review. Comput. Ind. Eng. 99, 300\u2013313 (2016)","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"25_CR3","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1287\/trsc.1030.0056","volume":"39","author":"O Br\u00e4ysy","year":"2005","unstructured":"Br\u00e4ysy, O., Gendreau, M.: Vehicle routing problem with time windows, Part I: route construction and local search algorithms. Transp. Sci. 39(1), 104\u2013118 (2005)","journal-title":"Transp. Sci."},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.endm.2014.11.029","volume":"47","author":"M Bruglieri","year":"2015","unstructured":"Bruglieri, M., Pezzella, F., Pisacane, O., Suraci, S.: A variable neighborhood search branching for the electric vehicle routing problem with time windows. Electron. Notes Discret. Math. 47, 221\u2013228 (2015)","journal-title":"Electron. Notes Discret. Math."},{"key":"25_CR5","unstructured":"Chen, X., Tian, Y.: Learning to perform local rewriting for combinatorial optimization. In: Advances in Neural Information Processing Systems (2019)"},{"issue":"6","key":"25_CR6","doi-asserted-by":"publisher","first-page":"1388","DOI":"10.1287\/opre.2016.1535","volume":"64","author":"G Desaulniers","year":"2016","unstructured":"Desaulniers, G., Errico, F., Irnich, S., Schneider, M.: Exact algorithms for electric vehicle-routing problems with time windows. Oper. Res. 64(6), 1388\u20131405 (2016)","journal-title":"Oper. Res."},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Duan, L., et al.: Efficiently solving the practical vehicle routing problem: a novel joint learning approach. In: ACM SIGKDD Conference on Knowledge Discovery & Data Mining, pp. 3054\u20133063 (2020)","DOI":"10.1145\/3394486.3403356"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 770\u2013778 (2016)","DOI":"10.1109\/CVPR.2016.90"},{"key":"25_CR9","unstructured":"Ioffe, S., Szegedy, C.: Batch normalization: accelerating deep network training by reducing internal covariate shift. In: International Conference on Machine Learning, vol. 37, pp. 448\u2013456 (2015)"},{"issue":"10","key":"25_CR10","doi-asserted-by":"publisher","first-page":"3806","DOI":"10.1109\/TITS.2019.2909109","volume":"20","author":"J James","year":"2019","unstructured":"James, J., Yu, W., Gu, J.: Online vehicle routing with neural combinatorial optimization and deep reinforcement learning. IEEE Trans. Intell. Transp. Syst. 20(10), 3806\u20133817 (2019)","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"25_CR11","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.trc.2016.01.013","volume":"65","author":"M Keskin","year":"2016","unstructured":"Keskin, M., \u00c7atay, B.: Partial recharge strategies for the electric vehicle routing problem with time windows. Transp. Res. Part C Emerg. Technol. 65, 111\u2013127 (2016)","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.cor.2018.06.019","volume":"100","author":"M Keskin","year":"2018","unstructured":"Keskin, M., \u00c7atay, B.: A matheuristic method for the electric vehicle routing problem with time windows and fast chargers. Comput. Oper. Res. 100, 172\u2013188 (2018)","journal-title":"Comput. Oper. Res."},{"key":"25_CR13","unstructured":"Kingma, D.P., Ba, J.: Adam: a method for stochastic optimization. In: International Conference on Learning Representations (2015)"},{"key":"25_CR14","unstructured":"Kool, W., Van Hoof, H., Welling, M.: Attention, learn to solve routing problems! In: International Conference on Learning Representations (2019)"},{"key":"25_CR15","unstructured":"Kwon, Y.D., Choo, J., Kim, B., Yoon, I., Gwon, Y., Min, S.: POMO: policy optimization with multiple optima for reinforcement learning. In: Advances in Neural Information Processing Systems (2020)"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Li, J., et al.: Deep reinforcement learning for solving the heterogeneous capacitated vehicle routing problem. IEEE Trans. Cybern. (2021)","DOI":"10.1109\/TCYB.2021.3111082"},{"issue":"3","key":"25_CR17","doi-asserted-by":"publisher","first-page":"2306","DOI":"10.1109\/TITS.2021.3056120","volume":"23","author":"J Li","year":"2022","unstructured":"Li, J., Xin, L., Cao, Z., Lim, A., Song, W., Zhang, J.: Heterogeneous attentions for solving pickup and delivery problem via deep reinforcement learning. IEEE Trans. Intell. Transp. Syst. 23(3), 2306\u20132315 (2022)","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Li, K., Zhang, T., Wang, R., Wang, Y., Han, Y., Wang, L.: Deep reinforcement learning for combinatorial optimization: covering salesman problems. IEEE Trans. Cybern. (2021)","DOI":"10.1109\/TCYB.2021.3103811"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"Lin, B., Ghaddar, B., Nathwani, J.: Deep reinforcement learning for the electric vehicle routing problem with time windows. IEEE Trans. Intell. Transp. Syst. (2021)","DOI":"10.1109\/TITS.2021.3105232"},{"key":"25_CR20","unstructured":"Lu, H., Zhang, X., Yang, S.: A learning-based iterative method for solving vehicle routing problems. In: International Conference on Learning Representations (2020)"},{"key":"25_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105400","volume":"134","author":"N Mazyavkina","year":"2021","unstructured":"Mazyavkina, N., Sviridov, S., Ivanov, S., Burnaev, E.: Reinforcement learning for combinatorial optimization: a survey. Comput. Oper. Res. 134, 105400 (2021)","journal-title":"Comput. Oper. Res."},{"key":"25_CR22","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1038\/s41586-021-03544-w","volume":"594","author":"A Mirhoseini","year":"2021","unstructured":"Mirhoseini, A., et al.: A graph placement methodology for fast chip design. Nature 594, 207\u2013212 (2021)","journal-title":"Nature"},{"key":"25_CR23","unstructured":"Nazari, M., Oroojlooy, A., Tak\u00e1\u010d, M., Snyder, L.V.: Reinforcement learning for solving the vehicle routing problem. In: Advances in Neural Information Processing Systems (2018)"},{"key":"25_CR24","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1007\/978-981-15-5577-0_51","volume-title":"Artificial Intelligence Algorithms and Applications","author":"B Peng","year":"2020","unstructured":"Peng, B., Wang, J., Zhang, Z.: A deep reinforcement learning algorithm using dynamic attention model for vehicle routing problems. In: Li, K., Li, W., Wang, H., Liu, Y. (eds.) ISICA 2019. CCIS, vol. 1205, pp. 636\u2013650. Springer, Singapore (2020). https:\/\/doi.org\/10.1007\/978-981-15-5577-0_51"},{"issue":"3","key":"25_CR25","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/s42524-021-0157-1","volume":"8","author":"H Qin","year":"2021","unstructured":"Qin, H., Su, X., Ren, T., Luo, Z.: A review on the electric vehicle routing problems: variants and algorithms. Front. Eng. Manag. 8(3), 370\u2013389 (2021). https:\/\/doi.org\/10.1007\/s42524-021-0157-1","journal-title":"Front. Eng. Manag."},{"issue":"4","key":"25_CR26","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1287\/trsc.2013.0490","volume":"48","author":"M Schneider","year":"2014","unstructured":"Schneider, M., Stenger, A., Goeke, D.: The electric vehicle-routing problem with time windows and recharging stations. Transp. Sci. 48(4), 500\u2013520 (2014)","journal-title":"Transp. Sci."},{"key":"25_CR27","unstructured":"Vaswani, A., et al.: Attention is all you need. In: Advances in Neural Information Processing Systems (2017)"},{"key":"25_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.107526","volume":"233","author":"Q Wang","year":"2021","unstructured":"Wang, Q., Tang, C.: Deep reinforcement learning for transportation network combinatorial optimization: a survey. Knowl.-Based Syst. 233, 107526 (2021)","journal-title":"Knowl.-Based Syst."},{"key":"25_CR29","doi-asserted-by":"crossref","unstructured":"Wu, G., Zhang, Z., Liu, H., Wang, J.: Solving time-dependent traveling salesman problem with time windows with deep reinforcement learning. In: IEEE International Conference on Systems, Man, and Cybernetics (2021)","DOI":"10.1109\/SMC52423.2021.9658956"},{"key":"25_CR30","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/978-981-15-5577-0_45","volume-title":"Artificial Intelligence Algorithms and Applications","author":"H Wu","year":"2020","unstructured":"Wu, H., Wang, J., Zhang, Z.: MODRL\/D-AM: multiobjective deep reinforcement learning algorithm using decomposition and attention model for multiobjective optimization. In: Li, K., Li, W., Wang, H., Liu, Y. (eds.) ISICA 2019. CCIS, vol. 1205, pp. 575\u2013589. Springer, Singapore (2020). https:\/\/doi.org\/10.1007\/978-981-15-5577-0_45"},{"key":"25_CR31","doi-asserted-by":"crossref","unstructured":"Wu, Y., Song, W., Cao, Z., Zhang, J., Lim, A.: Learning improvement heuristics for solving routing problems. IEEE Trans. Neural Netw. Learn. Syst. (2021)","DOI":"10.1109\/TNNLS.2021.3068828"},{"key":"25_CR32","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Wang, J., Zhang, Z., Zhou, Y.: MODRL\/D-EL: multiobjective deep reinforcement learning with evolutionary learning for multiobjective optimization. In: International Joint Conference on Neural Networks (2021)","DOI":"10.1109\/IJCNN52387.2021.9534083"},{"key":"25_CR33","unstructured":"Zhang, Z., Liu, H., Zhou, M., Wang, J.: Solving dynamic traveling salesman problems with deep reinforcement learning. IEEE Trans. Neural Netw. Learn. Syst. (2021)"},{"key":"25_CR34","doi-asserted-by":"crossref","unstructured":"Zhang, Z., Wu, Z., Zhang, H., Wang, J.: Meta-learning-based deep reinforcement learning for multiobjective optimization problems. IEEE Trans. Neural Netw. Learn. Syst. (2022)","DOI":"10.1109\/TNNLS.2022.3148435"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-14714-2_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T16:44:33Z","timestamp":1710261873000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-14714-2_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031147135","9783031147142"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-14714-2_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"14 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Problem Solving from Nature","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dortmund","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2022.cs.tu-dortmund.de\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"185","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":"85","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":"0","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":"46% - 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.75","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.11","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)"}}]}}