A note on 'Variable Neighborhood Search Based Algorithms for Crossdock Truck Assignment'
Shahin Gelareh

TL;DR
This paper critiques existing variable neighborhood search algorithms for crossdock truck assignment, highlighting flaws in previous models and demonstrating that recent amendments do not address these issues.
Contribution
It clarifies deficiencies in a prior model and shows that recent algorithmic amendments are insufficient to resolve these problems.
Findings
Previous models have fundamental flaws.
Recent amendments do not fix the identified issues.
The paper emphasizes the need for better modeling approaches.
Abstract
Some implementations of variable neighborhood search based algorithms were presented in \emph{C\'ecilia Daquin, Hamid Allaoui, Gilles Goncalves and Tient\'e Hsu, Variable neighborhood search based algorithms for crossdock truck assignment, RAIRO-Oper. Res., 55 (2021) 2291-2323}. This work is based on model in \emph{Zhaowei Miao, Andrew Lim, Hong Ma, Truck dock assignment problem with operational time constraint within crossdocks, European Journal of Operational Research 192 (1), 2009, 105-115 }m which has been proven to be incorrect. We reiterate and elaborate on the deficiencies in the latter and show that the authors in the former were already aware of the deficiencies in the latter and the proposed minor amendment does not overcome any of such deficiencies.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
