Storage Assignment Problem in logistics Warehouses: Optimization of Picking Locations by Cross-Entropy Method

摘要

This paper covers a combinatorial optimization method called cross-entropy method. We used this method to solve an optimization problem: implementations of products in order to minimize the total distance traveled by workers during the picking order. After developing a state of the art regarding issues that affect the design of logistics warehouses, we will develop an overview of methods used to solve and/or optimize this type of problem. Cross-entropy method applied to shortest path problem will be developed and we will show this method can be used easily to solve an optimization problem in logistics area.