{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T10:10:06Z","timestamp":1750932606985,"version":"3.41.0"},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,5,26]],"date-time":"2025-05-26T00:00:00Z","timestamp":1748217600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,5,26]],"date-time":"2025-05-26T00:00:00Z","timestamp":1748217600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"HUN-REN Institute for Computer Science and Control"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2025,6]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>A few years ago, a dynamic pickup-and-delivery problem was introduced in the context of a competition Hao et al. ( ICAPS 2021 Competition). Since then, the problem has attracted the attention of many researchers. Recently, Zhou et al. (Memet Computing 16:1-8, 2014) proposed a solution approach to the problem, however, we found a flaw in their study that leads to a lot of misunderstanding. Our paper aims to clear up these misunderstandings. In this paper, we state and prove that contrary to their claim, Zhou et al. (Memet Computing 16:1-8, 2014) did not study and solve the original problem, but a relaxation of it. Accordingly, but without mentioning it, the authors modified the benchmark dataset and then applied state-of-the-art methods tailored to the original problem. Therefore, their published results are misleading as the authors did not clarify that the results are not for the original problem but for a relaxation.<\/jats:p>","DOI":"10.1007\/s12293-025-00462-6","type":"journal-article","created":{"date-parts":[[2025,5,26]],"date-time":"2025-05-26T02:53:56Z","timestamp":1748228036000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On recent computational results for a dynamic pickup and delivery problem"],"prefix":"10.1007","volume":"17","author":[{"given":"Mark\u00f3","family":"Horv\u00e1th","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tam\u00e1s","family":"Kis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,26]]},"reference":[{"key":"462_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2022.101182","volume":"75","author":"J Cai","year":"2022","unstructured":"Cai J, Zhu Q, Lin Q (2022) Variable neighborhood search for a new practical dynamic pickup and delivery problem. Swarm Evolut Computation 75:101182","journal-title":"Swarm Evolut Computation"},{"key":"462_CR2","doi-asserted-by":"crossref","unstructured":"Cai J, Zhu Q, Lin Q, Li J, Chen J, Ming Z (2022) An efficient multi-objective evolutionary algorithm for a practical dynamic pickup and delivery problem. In: international conference on intelligent computing, pp. 27\u201340. Springer","DOI":"10.1007\/978-3-031-13870-6_3"},{"key":"462_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2023.126631","volume":"554","author":"J Cai","year":"2023","unstructured":"Cai J, Zhu Q, Lin Q, Ma L, Li J, Ming Z (2023) A survey of dynamic pickup and delivery problems. Neurocomputing 554:126631","journal-title":"Neurocomputing"},{"key":"462_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2023.103131","volume":"175","author":"J Du","year":"2023","unstructured":"Du J, Zhang Z, Wang X, Lau HC (2023) A hierarchical optimization approach for dynamic pickup and delivery problem with LIFO constraints. Transp Res Part E: Logist Transp Rev 175:103131","journal-title":"Transp Res Part E: Logist Transp Rev"},{"key":"462_CR5","unstructured":"Hao J, Lu J, Li X, Tong X, Xiang X, Yuan M, Zhuo HH (2022) Introduction to The Dynamic Pickup and Delivery Problem Benchmark \u2013 ICAPS 2021 Competition"},{"key":"462_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12293-024-00407-5","volume":"16","author":"Y Zhou","year":"2024","unstructured":"Zhou Y, Kong L, Yan L, Liu Y, Wang H (2024) A memetic algorithm for a real-world dynamic pickup and delivery problem. Memet Computing 16:1\u201315","journal-title":"Memet Computing"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-025-00462-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12293-025-00462-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-025-00462-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T09:30:37Z","timestamp":1750930237000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12293-025-00462-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,26]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["462"],"URL":"https:\/\/doi.org\/10.1007\/s12293-025-00462-6","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"type":"print","value":"1865-9284"},{"type":"electronic","value":"1865-9292"}],"subject":[],"published":{"date-parts":[[2025,5,26]]},"assertion":[{"value":"26 April 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 April 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 May 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"27"}}