Horváth, Markó and Kis, Tamás (2025) On recent computational results for a dynamic pickup and delivery problem. MEMETIC COMPUTING, 17 (2). ISSN 1865-9284 10.1007/s12293-025-00462-6

Preview

Text Horvath_1_36162084_ny.pdf Download (193kB) | Preview

Abstract

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.

Item Type:	Article
Subjects:	Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Divisions:	Research Laboratory on Engineering & Management Intelligence > Research Group of Operations Research and Decision Systems
SWORD Depositor:	MTMT Injector
Depositing User:	MTMT Injector
Date Deposited:	12 Jun 2025 06:35
Last Modified:	12 Jun 2025 06:36
URI:	https://eprints.sztaki.hu/id/eprint/10915

Update Item