Optimization of deployment of goods supply in a high storage warehouse by means of the greedy algorithm

• Authors: Sabo Aleksandra
• Languages of publication: EN

Abstracts

EN

A warehouse is one of the key areas in logistics. A large group of logistic problems is associated with the storage process. The optimization of logistic processes undoubtedly brings many benefits for businesses, both financial and organizational. This paper presents one of the most common problems which occurs in a specific type of warehouse – high storage warehouse. The problem is the location of the supply of goods in a high storage warehouse. Due to the large computational complexity of the problem, the paper proposes to use heuristic algorithms to solve the problem. The high storage warehouse is also a system that allows the comprehensive management of logistics operations in the warehouse by using information from a database and the corresponding data processing algorithms. The presented approach assumes the implementation of heuristic algorithms in the logistic warehouse management system and uses them in the high storage warehouse. This will allow the material management in the warehouse to become easier, faster and the decision-making to become more accurate.

Keywords

EN

traveling salesman problem; high storage warehouse; greedy algorithm

• Publisher: Wydawnictwo Uniwersytetu Ekonomicznego we Wrocławiu
• Journal: Mathematical Economics
• Year: 2012
• Issue: 8 (15)
• Pages: 111-121

Contributors

author

Sabo Aleksandra

References

• Shukla A., Deshpande P.M., Naughton J.F. (1998). Materialized view selection for multidimensional datasets. In: Proceedings of the 24rd International Conference on Very Large Data Bases.
• Antoszkiewicz J. (1990). Metody heurystyczne. Twórcze rozwiązywanie problemów. Wyd. II. PWE. Warszawa.
• Cormen T.H., Leiserson C.E., Rivest R.L., Stein C. (2004). Wprowadzenie do algorytmów. WNT. Warszawa.
• Gołembska E. (Ed.) (2001). Kompendium wiedzy o logistyce. PWN. Warszawa-Poznań 2001.
• Kaufmann A., Fustier M., Drevet A. (1975). Inwentyka. Metody poszukiwania twórczych rozwiązań. Wydawnictwo Naukowo-Techniczne. Warszawa.
• Michalewicz Z. (1999). Algorytmy genetyczne + struktury danych = programy ewolucyjne. WNT. Warszawa.
• Shukla A., Deshpande P., Naughton J.F. (1998). Materialized view selection for multidimensional datasets. In: Proceedings of 24rd International Conference on Very Large Data Bases. Morgan Kaufmann Publishers. New York.
• Sysło M., Narsingh D.N., Janusz S., Kowalik J.S. (1993). Algorytmy optymalizacji dyskretnejz programami w języku Pascal. Wydawnictwo Naukowe PWN. Warszawa.
• Trojanowski K. (2005). Metaheurystyki praktycznie. Wydawnictwo WIT. Warszawa.
• Vazirani U.V., Dasgupta S., Papadimitriou C.H. (2006). Algorithms. McGraw-Hill. New York.
• Wałkowski S. (2007). Brute-Forfe. Algorytm zachłanny czy programowanie dynamiczne? Poznań.
• Wróblewski P. (2009) Algorytmy, struktury danych i techniki programowania. Wyd. IV, Helion. Gliwice.
• Zaleska M. (2005). Ocena ekonomiczno-finansowa przedsiębiorstwa przez analityka bankowego. Oficyna Wydawnicza. Szkoła Główna Handlowa. Warszawa.