Spatial Adaptive Large Neighborhood Search for Wood Supply Chain Optimization

2015 ◽  
Vol 6 (4) ◽  
pp. 27-43 ◽  
Author(s):  
Johannes Scholz

A Supply Chain describes a system flow from the raw product to the final product that is delivered to a customer. Hence, the participating organizations, people and transport processes are part of a Supply Chain. The Wood Supply Chain denotes a special Supply Chain that describes the flow of timber. This work focuses on the logistic operations from timber production to the first processing step in a saw or paper mill, and seeks to optimize the Wood Supply Chain with Adaptive Large Neighborhood Search. By introducing spatial amendments to Adaptive Large Neighborhood Search it is capable of solving the spatial-temporal problem of Wood Supply Chain optimization. A comparison of the obtained results and initial results give evidence that the optimization approach with spatial amendments results in an increase of the objective function of the given problem.

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

2020 ◽  
Vol 26 (6) ◽  
pp. 885-912
Author(s):  
Jone R. Hansen ◽  
Kjetil Fagerholt ◽  
Magnus Stålhane ◽  
Jørgen G. Rakke

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