|Title:||Variable neighborhood search for Multiple Level Warehouse Layout Problem||Journal:||Electronic Notes in Discrete Mathematics||Volume:||39||First page:||161||Last page:||168||Issue Date:||1-Dec-2012||ISSN:||1571-0653||DOI:||10.1016/j.endm.2012.10.022||Abstract:||
In this paper we present a variable neighborhood search algorithm (VNS) for solving Multiple Level Warehouse Layout Problem (MLWLP). The algorithm deals with a specific representation of the solution, enabling the effective application of the shaking and local search procedures. System of neighborhoods changes the assignment ordering for an increasing number of items, while local search procedure tries to locally improve the solution by swapping the assignment ordering for pairs of items. Numerical experiments are performed on instances known in the literature. Computational results show that the proposed VNS achieves all optimal solutions for smaller instances, while for larger instances it finds rather better solutions than previously known method.
|Keywords:||Discrete Optimization | Layout problem | Variable Neighborhood Search||Publisher:||Elsevier||Project:||Mathematical Modelas and Optimization Methods on Large-Scale Systems
Graph theory and mathematical programming with applications in chemistry and computer science
Show full item record
checked on Mar 20, 2023
checked on Mar 21, 2023
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.