Storage location assignment problem in warehouse optimization by opensolver
收藏DataCite Commons2025-02-04 更新2025-04-16 收录
下载链接:
http://doi.nrct.go.th/?page=resolve_doi&resolve_doi=10.14457/TU.the.2024.107
下载链接
链接失效反馈官方服务:
资源简介:
Effective storage location assignment within warehouses is a critical determinant of operational efficiency, cost savings, and customer satisfaction. This independent study explores the intricate challenges posed by the Storage Location Assignment Problem (SLAP) and delves into the application of OpenSolver, a powerful optimization tool, to enhance distance optimization within warehouse operations.The central objective of this research is to design and evaluate innovative strategies for optimizing storage location assignments in a way that minimizes travel distances. The study will begin by conducting an extensive literature review to assess existing storage location assignment approaches and the role of optimization tools in the warehousing context. Subsequently, developing mathematical models and algorithms, leveraging OpenSolver's capabilities, to tackle SLAP.This investigation aims to address the complexity of warehouse operations by accounting for factors such as product placement, retrieval paths, order picking, and the interplay of these elements. The study will evaluate various storage location assignment algorithms in terms of key performance indicators, with a primary focus on minimizing travel distances and improving overall warehouse efficiency.In conclusion, this independent study offers a comprehensive exploration of the Storage Location Assignment Problem in warehouses, employing OpenSolver as a powerful tool for distance optimization. The findings from this research will contribute valuable insights to warehouse managers and logistics professionals, aiding them in enhancing operational efficiency and ultimately driving success in the competitive world of modern warehousing.
提供机构:
Thammasat University
创建时间:
2025-02-04



