Please use this identifier to cite or link to this item:
https://research.matf.bg.ac.rs/handle/123456789/671
Title: | Variable neighborhood search for Multiple Level Warehouse Layout Problem | Authors: | Matić, Dragan Kratica, Jozef Filipović, Vladimir Dugošija, Djordje |
Affiliations: | Informatics and Computer Science | Keywords: | Discrete Optimization;Layout problem;Variable Neighborhood Search | Issue Date: | 1-Dec-2012 | Journal: | Electronic Notes in Discrete Mathematics | 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. © 2012 Elsevier B.V. |
URI: | https://research.matf.bg.ac.rs/handle/123456789/671 | DOI: | 10.1016/j.endm.2012.10.022 |
Appears in Collections: | Research outputs |
Show full item record
SCOPUSTM
Citations
4
checked on Dec 19, 2024
Page view(s)
19
checked on Dec 24, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.