The stochastic emergency service vehicle re-routing problem

C. Lei, W. H. Lin, L. Miao

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper considers the emergency service vehicle re-routing problem (ESVRP) under uncertainty. We develop a stochastic programming model for ESVRP, aiming at adjusting the original routing and scheduling plan to reposition ESVs when some ESVs in the fleet become temporarily unavailable in response to service calls. The purpose of the model is to optimize the system-wide performance throughout the planning horizon while treating both the service needs and the return times of "busy service vehicles" as random variables. A comparative analysis of different strategies in dealing with the busy ESVs is performed to assess the performance of the proposed model. The results indicate that our modelling approach is effective in handling uncertainty.

Original languageEnglish (US)
Title of host publicationProceedings of the 18th International Conference of Hong Kong Society for Transportation Studies, HKSTS 2013 - Travel Behaviour and Society
PublisherHong Kong Society for Transportation Studies Limited
Pages625-632
Number of pages8
ISBN (Print)9789881581426
StatePublished - Jan 1 2013
Event18th International Conference of Hong Kong Society for Transportation Studies on Travel Behaviour and Society, HKSTS 2013 - Hong Kong, Hong Kong
Duration: Dec 14 2013Dec 16 2013

Publication series

NameProceedings of the 18th International Conference of Hong Kong Society for Transportation Studies, HKSTS 2013 - Travel Behaviour and Society

Other

Other18th International Conference of Hong Kong Society for Transportation Studies on Travel Behaviour and Society, HKSTS 2013
CountryHong Kong
CityHong Kong
Period12/14/1312/16/13

Keywords

  • Emergency mobile facility
  • Multi-period re-routing
  • Stochastic programming

ASJC Scopus subject areas

  • Transportation

Fingerprint Dive into the research topics of 'The stochastic emergency service vehicle re-routing problem'. Together they form a unique fingerprint.

Cite this