Dantzig-Wolfe decomposition approach to the vehicle assignment problem with demand uncertainty in a hybrid hub-and-spoke network

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 42
  • Download : 0
In this article, we investigate the vehicle assignment problem with demand uncertainty in a hybrid hub-and-spoke network with a single hub. The problem is deciding both the transportation routes and the number and types of vehicles to be deployed to minimize the sum of costs to transport all quantities in a hybrid hub-and-spoke network which allows direct transportation between spokes. Daily changes in quantities are reflected with a finite number of scenarios. Regularly scheduled vehicles and temporarily scheduled vehicles are considered to meet the demand variation. We propose a Dantzig-Wolfe decomposition approach which yields a strong LP relaxation bound by introducing a set of feasible direct route patterns. We develop an algorithm which incorporates a column generation procedure at the root node and repeats iteratively a variable fixing and column generation procedure at the non-root nodes until an integral solution is found. Finally, we present computational results using the well-known CAB data sets and real-life data from the Korea Post. The results show that our algorithm can find near optimal solutions very efficiently.
Publisher
SPRINGER
Issue Date
2018-05
Language
English
Article Type
Article
Keywords

LOCATION-PROBLEMS; DESIGN; SERVICE; TRANSPORTATION; FORMULATIONS; FACILITIES; SYSTEMS

Citation

ANNALS OF OPERATIONS RESEARCH, v.264, no.1-2, pp.57 - 87

ISSN
0254-5330
DOI
10.1007/s10479-017-2730-x
URI
http://hdl.handle.net/10203/241498
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0