Optimizing Storage Location Assignment For The Order-Picking Process: A Case Study Of Gemadept

Abstract

The research paper addresses the optimization of the pick-up distance for goods at the Gemadept warehouse. The major objective of this article is to discover a better storage policy than random storage by applying the mathematical framework of the Storage Location Assignment Problem Model to discover dedicated storage and construct the MLIP model for minimizing the distance and obtaining the best warehouse solution. This method was used to study the issue and identify workable solutions that, despite time constraints and the possibility that demand will change seasonally, can be used in actual business operations to boost productivity, and reduce operating expenses associated with warehouses.