scholarly journals A variable neighborhood search heuristic for periodic routing problems

2009 ◽  
Vol 195 (3) ◽  
pp. 791-802 ◽  
Author(s):  
Vera C. Hemmelmayr ◽  
Karl F. Doerner ◽  
Richard F. Hartl
2018 ◽  
Vol 66 ◽  
pp. 311-318 ◽  
Author(s):  
Yuzhuo Qiu ◽  
Liang Wang ◽  
Xiaoling Xu ◽  
Xuanjing Fang ◽  
Panos M. Pardalos

2018 ◽  
Vol 26 (3) ◽  
pp. 401-422 ◽  
Author(s):  
Lorena Reyes-Rubiano ◽  
Laura Calvet ◽  
Angel A. Juan ◽  
Javier Faulin ◽  
Lluc Bové

2012 ◽  
Vol 12 (1) ◽  
pp. 10 ◽  
Author(s):  
ARIF IMRAN ◽  
LIANE OKDINAWATI

The vehicle routing problem is investigated by using some adaptations of the variable neighborhood search (VNS).The initial solution was obtained by Dijkstra’s algorithm based on cost network constructed by the sweep algorithm andthe 2-opt. Our VNS algorithm use several neighborhoods which were adapted for this problem. In addition, a number oflocal search methods together with a diversification procedure were used. The algorithm was then tested on the data setsfrom the literature and it produced competitive results if compared to the solutions published.


Sign in / Sign up

Export Citation Format

Share Document