Stochastic Variable Neighborhood Search for a Rotation Assignment Problem

2021 ◽  
Author(s):  
Ziran Zheng
2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Le Zhang ◽  
Jinnan Wu

This paper investigates the permutation flowshop scheduling problem (PFSP) with the objectives of minimizing the makespan and the total flowtime and proposes a hybrid metaheuristic based on the particle swarm optimization (PSO). To enhance the exploration ability of the hybrid metaheuristic, a simulated annealing hybrid with a stochastic variable neighborhood search is incorporated. To improve the search diversification of the hybrid metaheuristic, a solution replacement strategy based on the pathrelinking is presented to replace the particles that have been trapped in local optimum. Computational results on benchmark instances show that the proposed PSO-based hybrid metaheuristic is competitive with other powerful metaheuristics in the literature.


Author(s):  
Shahin Gelareh

Some implementations of variable neighborhood search based algorithms were presented in 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 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 (see Miao et al. (2009)) 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.


Sign in / Sign up

Export Citation Format

Share Document