Stochastic mobile facility routing and scheduling problem

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

doi:10.1109/ITSC.2013.6728493

Stochastic mobile facility routing and scheduling problem

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

2 Scopus citations

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 language	English (US)
Title of host publication	2013 16th International IEEE Conference on Intelligent Transportation Systems
Subtitle of host publication	Intelligent Transportation Systems for All Modes, ITSC 2013
Pages	1823-1828
Number of pages	6
DOIs	https://doi.org/10.1109/ITSC.2013.6728493
State	Published - 2013
Event	2013 16th International IEEE Conference on Intelligent Transportation Systems: Intelligent Transportation Systems for All Modes, ITSC 2013 - The Hague, Netherlands Duration: Oct 6 2013 → Oct 9 2013

Publication series

Name	IEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC

Other

Other	2013 16th International IEEE Conference on Intelligent Transportation Systems: Intelligent Transportation Systems for All Modes, ITSC 2013
Country/Territory	Netherlands
City	The Hague
Period	10/6/13 → 10/9/13

ASJC Scopus subject areas

Automotive Engineering
Mechanical Engineering
Computer Science Applications

Access to Document

10.1109/ITSC.2013.6728493

Cite this

Lei, C., Lin, W. H., Miao, L., & Qi, M. (2013). Stochastic mobile facility routing and scheduling problem. In 2013 16th International IEEE Conference on Intelligent Transportation Systems: Intelligent Transportation Systems for All Modes, ITSC 2013 (pp. 1823-1828). Article 6728493 (IEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC). https://doi.org/10.1109/ITSC.2013.6728493

Stochastic mobile facility routing and scheduling problem. / Lei, Chao; Lin, Wei Hua; Miao, Lixin et al.
2013 16th International IEEE Conference on Intelligent Transportation Systems: Intelligent Transportation Systems for All Modes, ITSC 2013. 2013. p. 1823-1828 6728493 (IEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Lei, C, Lin, WH, Miao, L & Qi, M 2013, Stochastic mobile facility routing and scheduling problem. in 2013 16th International IEEE Conference on Intelligent Transportation Systems: Intelligent Transportation Systems for All Modes, ITSC 2013., 6728493, IEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC, pp. 1823-1828, 2013 16th International IEEE Conference on Intelligent Transportation Systems: Intelligent Transportation Systems for All Modes, ITSC 2013, The Hague, Netherlands, 10/6/13. https://doi.org/10.1109/ITSC.2013.6728493

@inproceedings{9c10d5a8dea64c5796582e2c25699b67,

title = "Stochastic mobile facility routing and scheduling problem",

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.",

author = "Chao Lei and Lin, {Wei Hua} and Lixin Miao and Mingyao Qi",

year = "2013",

doi = "10.1109/ITSC.2013.6728493",

language = "English (US)",

isbn = "9781479929146",

series = "IEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC",

pages = "1823--1828",

booktitle = "2013 16th International IEEE Conference on Intelligent Transportation Systems",

note = "2013 16th International IEEE Conference on Intelligent Transportation Systems: Intelligent Transportation Systems for All Modes, ITSC 2013 ; Conference date: 06-10-2013 Through 09-10-2013",

}

TY - GEN

T1 - Stochastic mobile facility routing and scheduling problem

AU - Lei, Chao

AU - Lin, Wei Hua

AU - Miao, Lixin

AU - Qi, Mingyao

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84894328637&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84894328637&partnerID=8YFLogxK

U2 - 10.1109/ITSC.2013.6728493

DO - 10.1109/ITSC.2013.6728493

M3 - Conference contribution

AN - SCOPUS:84894328637

SN - 9781479929146

T3 - IEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC

SP - 1823

EP - 1828

BT - 2013 16th International IEEE Conference on Intelligent Transportation Systems

T2 - 2013 16th International IEEE Conference on Intelligent Transportation Systems: Intelligent Transportation Systems for All Modes, ITSC 2013

Y2 - 6 October 2013 through 9 October 2013

ER -

Stochastic mobile facility routing and scheduling problem

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this