A new kind of warehouse layout problem, multiple-level warehouse layout problem (MLWLP), is investigated. Both horizontal and vertical travel costs need to be considered when making a layout. In the problem, unit travel costs are item-dependent and different items can be mixed in a cell. An IP model is proposed, which is shown to be NP-hard. An effective assignment method is presented and genetic algorithm heuristics developed. Extensive computational experiments are conducted to verify the effectiveness of the algorithms.
A class of genetic algorithms for multiple-level warehouse layout problems
Reprints and Corporate Permissions
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
To request a reprint or corporate permissions for this article, please click on the relevant link below:
Academic Permissions
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
Obtain permissions instantly via Rightslink by clicking on the button below:
If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.
Related research
People also read lists articles that other readers of this article have read.
Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.
Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.