A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem

2018 ◽  
Vol 264 (2) ◽  
pp. 653-664 ◽  
Author(s):  
Ivan Žulj ◽  
Sergej Kramer ◽  
Michael Schneider
Keyword(s):  
Tabu Search ◽  
Neighborhood Search ◽  
Large Neighborhood Search ◽  
Adaptive Large Neighborhood Search ◽  
Order Batching ◽  
Large Neighborhood

Planning a selective delivery schedule through Adaptive Large Neighborhood Search

2017 ◽  
Vol 112 ◽  
pp. 368-378 ◽  
Author(s):  
Pamela J. Palomo-Martínez ◽  
M. Angélica Salazar-Aguilar ◽  
Gilbert Laporte
Keyword(s):  
Neighborhood Search ◽  
Large Neighborhood Search ◽  
Adaptive Large Neighborhood Search ◽  
Large Neighborhood ◽  
Selective Delivery

scholarly journals Data for a meta-analysis of the adaptive layer in adaptive large neighborhood search

Data in Brief ◽  
2020 ◽  
Vol 33 ◽  
pp. 106568
Author(s):  
Renata Turkeš ◽  
Kenneth Sörensen ◽  
Lars Magnus Hvattum ◽  
Eva Barrena ◽  
Hayet Chentli ◽  
...  
Keyword(s):  
Meta Analysis ◽  
Neighborhood Search ◽  
Large Neighborhood Search ◽  
Adaptive Large Neighborhood Search ◽  
Large Neighborhood

scholarly journals An adaptive large neighborhood search heuristic for the planar storage location assignment problem: application to stowage planning for Roll-on Roll-off ships

2020 ◽  
Vol 26 (6) ◽  
pp. 885-912
Author(s):  
Jone R. Hansen ◽  
Kjetil Fagerholt ◽  
Magnus Stålhane ◽  
Jørgen G. Rakke
Keyword(s):  
Programming Model ◽  
Mixed Integer ◽  
Neighborhood Search ◽  
Large Neighborhood Search ◽  
Network Graph ◽  
Adaptive Large Neighborhood Search ◽  
Large Neighborhood ◽  
Storage Location ◽  
Stowage Planning ◽  
Stowage Plan

Abstract This paper considers a generalized version of the planar storage location problem arising in the stowage planning for Roll-on/Roll-off ships. A ship is set to sail along a predefined voyage where given cargoes are to be transported between different port pairs along the voyage. We aim at determining the optimal stowage plan for the vehicles stored on a deck of the ship so that the time spent moving vehicles to enable loading or unloading of other vehicles (shifting), is minimized. We propose a novel mixed integer programming model for the problem, considering both the stowage and shifting aspect of the problem. An adaptive large neighborhood search (ALNS) heuristic with several new destroy and repair operators is developed. We further show how the shifting cost can be effectively evaluated using Dijkstra’s algorithm by transforming the stowage plan into a network graph. The computational results show that the ALNS heuristic provides high quality solutions to realistic test instances.

Sign in / Sign up

Export Citation Format

Share Document