Stochastic mobile facility routing and scheduling problem

Chao Lei, Wei Hua Lin, Lixin Miao, Mingyao Qi

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

Abstract

We consider the mobile facility routing and scheduling problem with stochastic demand (MFRSPSD). MFRSPSD simultaneously determines the route and schedule of a fleet of mobile facilities which serve customers with uncertain demand in order to minimize the total cost generated over the planning horizon. The problem is formulated as a two-stage stochastic programming model, in which the first stage decision deals with the temporal and spatial movement of the MFs and the second stage handles how MFs serve customer demands. An algorithm based on the multicut version of L-shaped method is developed. The computational results show that the algorithm yields high quality upper and lower bounds within reasonable computation time for medium scale problems.

Original languageEnglish (US)
Title of host publication2013 16th International IEEE Conference on Intelligent Transportation Systems
Subtitle of host publicationIntelligent Transportation Systems for All Modes, ITSC 2013
Pages1823-1828
Number of pages6
DOIs
StatePublished - Dec 1 2013
Event2013 16th International IEEE Conference on Intelligent Transportation Systems: Intelligent Transportation Systems for All Modes, ITSC 2013 - The Hague, Netherlands
Duration: Oct 6 2013Oct 9 2013

Publication series

NameIEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC

Other

Other2013 16th International IEEE Conference on Intelligent Transportation Systems: Intelligent Transportation Systems for All Modes, ITSC 2013
CountryNetherlands
CityThe Hague
Period10/6/1310/9/13

ASJC Scopus subject areas

  • Automotive Engineering
  • Mechanical Engineering
  • Computer Science Applications

Fingerprint Dive into the research topics of 'Stochastic mobile facility routing and scheduling problem'. Together they form a unique fingerprint.

Cite this