Exact and Heuristic Procedures for the Material Handling Circular Flow Path Design Problem

, et

référence BibTeX

In this study we develop optimization, decomposition, and heuristic procedures to design a unidirectional loop flow pattern along with the pickup and delivery station locations for unit load automated material handling vehicles. The layout of the facility is fixed. The edges on the boundary of the manufacturing cells are candidates to form the unidirectional loop flow path. A set of nodes located at the midpoint of each edge are candidates for pickup and delivery stations of the cell formed by those edges. A binary integer programming model describes the problem of determining the flow path and locations of the pickup and delivery stations. The empty vehicle dispatching rule of shortest trip distance first is implemented. The objective function is to minimize the total loaded and empty vehicle trip distances. We then provide a decomposition procedure based on a loop enumeration strategy coupled with a streamlined integer linear programming model. It is shown that only a small proportion of all loops have to be enumerated to reach an optimum. Therefore a truncated version of this algorithm should yield a good heuristic. Finally we propose a neighbourhood search heuristic method and report on its performance.

, 25 pages

Axe de recherche

Application de recherche


Exact and heuristic procedures for the material handling circular flow path design problem
, et
European Journal of Operational Research, 176(2), 707–726, 2007 référence BibTeX