A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem

Chao Lei, Wei Hua Lin, Lixin Miao

Research output: Contribution to journalArticle

16 Scopus citations

Abstract

This paper considers the mobile facility routing and scheduling problem with stochastic demand (MFRSPSD). The MFRSPSD simultaneously determines the route and schedule of a fleet of mobile facilities which serve customers with uncertain demand to minimize the total cost generated during 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 MFs and the second stage handles how MFs serve customer demands. An algorithm based on the multicut version of the L-shaped method is proposed in which several lower bound inequalities are developed and incorporated into the master program. The computational results show that the algorithm yields a tighter lower bound and converges faster to the optimal solution. The result of a sensitivity analysis further indicates that in dealing with stochastic demand the two-stage stochastic programming approach has a distinctive advantage over the model considering only the average demand in terms of cost reduction.

Original languageEnglish (US)
Pages (from-to)699-710
Number of pages12
JournalEuropean Journal of Operational Research
Volume238
Issue number3
DOIs
StatePublished - Nov 1 2014

Keywords

  • Facilities planning and design
  • Fleet management
  • Mobile facility
  • Routing

ASJC Scopus subject areas

  • Computer Science(all)
  • Modeling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management

Fingerprint Dive into the research topics of 'A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem'. Together they form a unique fingerprint.

  • Cite this