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

07/08/2021
by   Shahin Gelareh, et al.
0

Some implementations of variable neighborhood search based algorithms were presented in Cécilia Daquin, Hamid Allaoui, Gilles Goncalves and Tienté Hsu, Variable neighborhood search based algorithms for crossdock truck assignment, RAIRO-Oper. Res., 55 (2021) 2291-2323. This work is based on model in 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/13/2021

Neighborhood-Aware Neural Architecture Search

Existing neural architecture search (NAS) methods often return an archit...
research
07/21/2021

Learning a Large Neighborhood Search Algorithm for Mixed Integer Programs

Large Neighborhood Search (LNS) is a combinatorial optimization heuristi...
research
09/15/2011

Neigborhood Selection in Variable Neighborhood Search

Variable neighborhood search (VNS) is a metaheuristic for solving optimi...
research
02/25/2020

Topologically sensitive metaheuristics

This paper proposes topologically sensitive metaheuristics, and describe...
research
06/09/2021

Planning for Novelty: Width-Based Algorithms for Common Problems in Control, Planning and Reinforcement Learning

Width-based algorithms search for solutions through a general definition...
research
06/13/2018

Solving the Steiner Tree Problem in graphs with Variable Neighborhood Descent

The Steiner Tree Problem (STP) in graphs is an important problem with va...

Please sign up or login with your details

Forgot password? Click here to reset