Integration of operational policies into the design phase of a material handling network
by Ardavan Asef-Vaziri, Gilbert Laporte
International Journal of Advanced Operations Management (IJAOM), Vol. 1, No. 1, 2009

Abstract: We compare the effectiveness and efficiency of alternative operational dispatching policies that are integrated into the design phase of a circular material handling network for automated material handling vehicles. Exact formulations describe the problem of optimal concurrent design of the unidirectional loop track layout along with the locations of the pickup and drop-off stations. The objective is to minimise the total loaded and empty vehicle trip distances, which is a surrogate for vehicle fleet size. Since first-encounter-first-served cannot be modelled on a loop and station locations which are not yet designed, we approach first-encounter-first-served optimal design through shortest-trip-distance-first. Managerial observations in support of shortest-trip-distance-first are reported. The findings of the optimisation models in the design phase are well supported by the outcomes of the simulation model in the operation phase. We conclude that one should apply shortest-trip-distance-first dispatching when designing the loop and stations and then follow first-encountered-first-served in operating the fleet of the vehicles.

Online publication date: Thu, 18-Jun-2009

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Advanced Operations Management (IJAOM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com