{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:06:08Z","timestamp":1743095168322,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031087530"},{"type":"electronic","value":"9783031087547"}],"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-08754-7_11","type":"book-chapter","created":{"date-parts":[[2022,6,21]],"date-time":"2022-06-21T07:06:09Z","timestamp":1655795169000},"page":"80-87","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Particle Swarm Optimization Configures the\u00a0Route Minimization Algorithm"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7854-9058","authenticated-orcid":false,"given":"Tomasz","family":"Jastrzab","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9265-3997","authenticated-orcid":false,"given":"Michal","family":"Myller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0763-0745","authenticated-orcid":false,"given":"Lukasz","family":"Tulczyjew","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miroslaw","family":"Blocho","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojciech","family":"Ryczko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3669-5110","authenticated-orcid":false,"given":"Michal","family":"Kawulok","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4026-1569","authenticated-orcid":false,"given":"Jakub","family":"Nalepa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,15]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Blocho, M.: Heuristics, metaheuristics, and hyperheuristics for rich vehicle routing problems. In: Nalepa, J. (ed.) Smart Delivery Systems. Solving Complex Vehicle Routing Problems, pp. 101\u2013156. Intelligent Data Centric Systems, Elsevier (2020)","DOI":"10.1016\/B978-0-12-815715-2.00009-9"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-319-55453-2_9","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"M Blocho","year":"2017","unstructured":"Blocho, M., Nalepa, J.: LCS-based selective route exchange crossover for the pickup and delivery problem with time windows. In: Hu, B., L\u00f3pez-Ib\u00e1\u00f1ez, M. (eds.) EvoCOP 2017. LNCS, vol. 10197, pp. 124\u2013140. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-55453-2_9"},{"key":"11_CR3","unstructured":"Feng, L., et al.: Solving generalized vehicle routing problem with occasional drivers via evolutionary multitasking. In: IEEE Transactions on Cybernetics, pp. 1\u201314 (2019)"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Konstantakopoulos, G., Gayialis, S., Kechagias, E.: Vehicle routing problem and related algorithms for logistics distribution: a literature review and classification. Oper. Res. (2020)","DOI":"10.1007\/s12351-020-00600-7"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.tre.2015.12.001","volume":"86","author":"D Lai","year":"2016","unstructured":"Lai, D., Demirag, O., Leung, J.: A tabu search heuristic for the heterogeneous vehicle routing problem on a multigraph. Transp. Res. Part E 86, 32\u201352 (2016)","journal-title":"Transp. Res. Part E"},{"issue":"7","key":"11_CR6","doi-asserted-by":"publisher","first-page":"1461","DOI":"10.1080\/01605682.2020.1730250","volume":"72","author":"C Lee","year":"2021","unstructured":"Lee, C.: An exact algorithm for the electric-vehicle routing problem with nonlinear charging time. J. Oper. Res. Soc. 72(7), 1461\u20131485 (2021)","journal-title":"J. Oper. Res. Soc."},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Li, H., Li, Z., Cao, L., Wang, R., Ren, M.: Research on optimization of electric vehicle routing problem with time window. IEEE Access 8 (2020)","DOI":"10.1109\/ACCESS.2020.3014638"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1049\/iet-cim.2019.0035","volume":"1","author":"J Liu","year":"2019","unstructured":"Liu, J., Feng, S., Niu, Q., Li, L.: New construction heuristic algorithm for solving the vehicle routing problem with time windows. IET Collab. Intell. Manuf. 1, 90\u201396 (2019)","journal-title":"IET Collab. Intell. Manuf."},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Lorenzo, P.R., Nalepa, J., Kawulok, M., Ramos, L.S., Pastor, J.R.: Particle swarm optimization for hyper-parameter selection in deep neural networks. In: Proceedings of the GECCO, pp. 481\u2013488. ACM, New York (2017)","DOI":"10.1145\/3071178.3071208"},{"key":"11_CR10","first-page":"43","volume":"3","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Dubois-Lacoste, J., P\u00e9rez C\u00e1ceres, L., Birattari, M., St\u00fctzle, T.: The Irace package: iterated racing for automatic algorithm configuration. Oper. Res. Persp. 3, 43\u201358 (2016)","journal-title":"Oper. Res. Persp."},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Mohamed, E., Ndiaye, M.: Optimal routing and scheduling in e-commerce logistics using crowdsourcing strategies. In: Proceedings of the IEEE ICITM, pp. 248\u2013253 (2018)","DOI":"10.1109\/ICITM.2018.8333955"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Mor, A., Speranza, M.G.: Vehicle routing problems over time: a survey. 4OR 18(2), 129\u2013149 (2020)","DOI":"10.1007\/s10288-020-00433-2"},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"1547","DOI":"10.3233\/JIFS-169149","volume":"32","author":"J Nalepa","year":"2017","unstructured":"Nalepa, J., Blocho, M.: Adaptive guided ejection search for pickup and delivery with time windows. J. Intell. Fuzzy Syst. 32, 1547\u20131559 (2017)","journal-title":"J. Intell. Fuzzy Syst."},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/j.swevo.2018.04.001","volume":"44","author":"E Osaba","year":"2019","unstructured":"Osaba, E., Yang, X., Fister, I., Jr., Del Ser, J., Lopez-Garcia, P., Vazquez-Pardavila, A.: A discrete and improved bat algorithm for solving a medical goods distribution problem with pharmacological waste collection. Swarm Evol. Comput. 44, 273\u2013286 (2019)","journal-title":"Swarm Evol. Comput."},{"issue":"1","key":"11_CR15","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s11831-021-09574-x","volume":"29","author":"H Zhang","year":"2022","unstructured":"Zhang, H., Ge, H., Yang, J., Tong, Y.: Review of vehicle routing problems: models, classification and solving algorithms. Archiv. Comput. Methods Eng. 29(1), 195\u2013221 (2022)","journal-title":"Archiv. Comput. Methods Eng."},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Zunic, E., Donko, D., Supic, H., Delalic, S.: Cluster-based approach for successful solving real-world vehicle routing problems. In: Proceedings of the ACSIS, vol. 21, pp. 619\u2013626. Springer, Cham (2020)","DOI":"10.15439\/2020F184"},{"issue":"2","key":"11_CR17","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1080\/19427867.2020.1824311","volume":"14","author":"E \u017duni\u0107","year":"2022","unstructured":"\u017duni\u0107, E., Delali\u0107, S., Donko, D.: Adaptive multi-phase approach for solving the realistic vehicle routing problems in logistics with innovative comparison method for evaluation based on real GPS data. Transport. Lett. 14(2), 143\u2013156 (2022)","journal-title":"Transport. Lett."}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-08754-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,27]],"date-time":"2024-09-27T08:53:12Z","timestamp":1727427192000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-08754-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031087530","9783031087547"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-08754-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"15 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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":"21 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"474","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":"175","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":"78","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":"37% - 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":"2.8","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","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}