Journal
IIE TRANSACTIONS
Volume 45, Issue 8, Pages 896-911Publisher
TAYLOR & FRANCIS INC
DOI: 10.1080/0740817X.2012.705452
Keywords
Facility location; fleet management; stochastic programming; logic-based Benders' decomposition
Ask authors/readers for more resources
This article addresses a stochastic facility location and vehicle assignment problem in which customers are served by full return trips. The problem consists of simultaneously locating a set of facilities, determining the vehicle fleet size at each facility, and allocating customers to facilities and vehicles in the presence of random travel times. Such travel times can arise, for example, due to daily traffic patterns or weather-related disturbances. These various travel time conditions are considered as different scenarios with known probabilities. A stochastic programming with bounded penalties model is presented for the problem. In order to solve the problem, integer programming and two-level and three-level logic-based Benders' decomposition models are proposed. Computational experiments demonstrate that the Benders' models were able to substantially outperform the integer programming model in terms of both finding and verifying the optimal solution.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available