Year: 2025
Type: article
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.
Source: Memetic Computing
Authors: Markó Horváth, Tamás Kis
Institution: HUN-REN Institute for Computer Science and Control
Language: English
Subfield: Industrial and Manufacturing Engineering
Field: Engineering
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $3,990
Awards: G2154740497, G3743470659, G7694217703
OpenAlex ID: W4410723618