On recent computational results for a dynamic pickup and delivery problem

Horváth, Markó and Kis, Tamás (2025) On recent computational results for a dynamic pickup and delivery problem. MEMETIC COMPUTING, 17. No. 27.

Preview

Text 03_horvath2025recent_offprint.pdf - Published Version Available under License Creative Commons Attribution. 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.

Actions (login required)

Edit Item