Dynamic transport scheduling under multiple resource constraints

Share/Save/Bookmark

Ebben, M.J.R. and Heijden, M.C. van der and Harten, A. van (2005) Dynamic transport scheduling under multiple resource constraints. European Journal of Operational Research, 167 (2). pp. 320-335. ISSN 0377-2217

[img] PDF
Restricted to UT campus only
: Request a copy
415kB
Abstract:This paper presents a heuristic for the dynamic vehicle scheduling problem with multiple resource capacity constraints. In the envisaged application, an automated transport system using Automated Guided Vehicles, bottleneck resources are (1) vehicles, (2) docks for loading/unloading, (3) vehicle parking places, and (4) load storage space. This problem is hard, because interrelated activities (loading, transportation, unloading) at several geographical locations have to be scheduled under multiple resource constraints, where the bottleneck resource varies over time. Besides, the method should be suitable for real-time planning. We developed a dedicated serial scheduling method and analyzed its dynamic behavior using discrete event simulation. We found that our method is very well able to find good vehicle schedules satisfying all resource constraints. For comparison, we used a simple approach where we left out the resource constraints and extended the processing times by statistically estimated waiting times to account for finite capacities. We found that our newly designed method finds better schedules in terms of service levels.
Item Type:Article
Copyright:© 2005 Elsevier
Faculty:
Management and Governance (SMG)
Research Chair:
Research Group:
Link to this item:http://purl.utwente.nl/publications/77405
Official URL:http://dx.doi.org/10.1016/j.ejor.2004.03.020
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 207190