Article ID: | iaor20003502 |
Country: | United States |
Volume: | 45 |
Issue: | 6 |
Start Page Number: | 857 |
End Page Number: | 873 |
Publication Date: | Nov 1997 |
Journal: | Operations Research |
Authors: | Brandeau Margaret L., Thonemann U.W. |
Keywords: | automated guided vehicles |
We introduce an analytical model for the design of a multiple-vehicle automated guided vehicle system (AGVS) with multiple-load capacity operating under a ‘go-when-filled’ dispatching rule. The AGVS delivers containers of material from a central depot to workcenters throughout the factory floor. The workcenters are partitioned into delivery zones. They are served by a common pool of automated guided vehicles (AGVs), each of which can carry multiple orders per delivery. The demand of the workcenters and the time until delivery are stochastic. We develop a nonlinear binary integer program to determine the optimal partition of workcenters into zones, the optimal number of AGVs to purchase, and the set of workcenters that warrant AGV delivery, subject to constraints on maximum allowable mean waiting time for material delivery. We develop an analytical expression for the mean waiting time until material delivery and present an efficient branch-and-bound algorithm that solves the AGVS design model optimally. Without the analytical solution method, one would have to simulate the system for all zoning options, all combinations of open and closed workcenters, and all possible numbers of AGVs, in order to determine the optimal AGVS design – an approach likely to be infeasible for most problems.