Skip to main content

2018 | OriginalPaper | Buchkapitel

Dealing with Demand Uncertainty in Service Network and Load Plan Design

verfasst von : Ahmad Baubaid, Natashia Boland, Martin Savelsbergh

Erschienen in: Integration of Constraint Programming, Artificial Intelligence, and Operations Research

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Less-than-Truckload (LTL) transportation carriers plan for their next operating season by deciding: (1) a load plan, which specifies how shipments are routed through the terminal network from origins to destinations, and (2) how many trailers to operate between each pair of terminals in the network. Most carriers also require that the load plan is such that shipments at an intermediate terminal and having the same ultimate destination are loaded onto trailers headed to a unique next terminal regardless of their origins. In practice, daily variations in demand are handled by relaxing this requirement and possibly loading shipments to an alternative next terminal. We introduce the p-alt model, which integrates routing and capacity decisions, and which allows p choices for the next terminal for shipments with a particular ultimate destination. We further introduce and computationally test three solution methods for the stochastic p-alt model, which shows that much can be gained from using the p-alt model and explicitly considering demand uncertainty.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Crainic, T.G.: Service network design in freight transportation. Eur. J. Oper. Res. 122(2), 272–288 (2000)CrossRef Crainic, T.G.: Service network design in freight transportation. Eur. J. Oper. Res. 122(2), 272–288 (2000)CrossRef
2.
Zurück zum Zitat Wieberneit, N.: Service network design for freight transportation: a review. OR Spectr. 30(1), 77–112 (2008)MathSciNetCrossRef Wieberneit, N.: Service network design for freight transportation: a review. OR Spectr. 30(1), 77–112 (2008)MathSciNetCrossRef
3.
Zurück zum Zitat Powell, W.B.: A local improvement heuristic for the design of less-than-truckload motor carrier networks. Transp. Sci. 20(4), 246–257 (1986)CrossRef Powell, W.B.: A local improvement heuristic for the design of less-than-truckload motor carrier networks. Transp. Sci. 20(4), 246–257 (1986)CrossRef
4.
Zurück zum Zitat Powell, W.B., Koskosidis, I.A.: Shipment routing algorithms with tree constraints. Transp. Sci. 26(3), 230–245 (1992)CrossRef Powell, W.B., Koskosidis, I.A.: Shipment routing algorithms with tree constraints. Transp. Sci. 26(3), 230–245 (1992)CrossRef
5.
Zurück zum Zitat Jarrah, A.I., Johnson, E., Neubert, L.C.: Large-scale, less-than-truckload service network design. Oper. Res. 57(3), 609–625 (2009)CrossRef Jarrah, A.I., Johnson, E., Neubert, L.C.: Large-scale, less-than-truckload service network design. Oper. Res. 57(3), 609–625 (2009)CrossRef
8.
Zurück zum Zitat Hoff, A., Lium, A.G., Løkketangen, A., Crainic, T.G.: A metaheuristic for stochastic service network design. J. Heuristics 16(5), 653–679 (2010)CrossRef Hoff, A., Lium, A.G., Løkketangen, A., Crainic, T.G.: A metaheuristic for stochastic service network design. J. Heuristics 16(5), 653–679 (2010)CrossRef
9.
Zurück zum Zitat Lium, A.G., Crainic, T.G., Wallace, S.W.: A study of demand stochasticity in service network design. Transp. Sci. 43(2), 144–157 (2009)CrossRef Lium, A.G., Crainic, T.G., Wallace, S.W.: A study of demand stochasticity in service network design. Transp. Sci. 43(2), 144–157 (2009)CrossRef
10.
Zurück zum Zitat Crainic, T.G., Fu, X., Gendreau, M., Rei, W., Wallace, S.W.: Progressive hedging-based metaheuristics for stochastic network design. Networks 58(2), 114–124 (2011)MathSciNetMATH Crainic, T.G., Fu, X., Gendreau, M., Rei, W., Wallace, S.W.: Progressive hedging-based metaheuristics for stochastic network design. Networks 58(2), 114–124 (2011)MathSciNetMATH
11.
Zurück zum Zitat Kleywegt, A.J., Shapiro, A., Homem-de Mello, T.: The sample average approximation method for stochastic discrete optimization. SIAM J. Optim. 12(2), 479–502 (2002)MathSciNetCrossRef Kleywegt, A.J., Shapiro, A., Homem-de Mello, T.: The sample average approximation method for stochastic discrete optimization. SIAM J. Optim. 12(2), 479–502 (2002)MathSciNetCrossRef
12.
Zurück zum Zitat Kim, D., Pardalos, P.M.: A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure. Oper. Res. Lett. 24(4), 195–203 (1999)MathSciNetCrossRef Kim, D., Pardalos, P.M.: A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure. Oper. Res. Lett. 24(4), 195–203 (1999)MathSciNetCrossRef
13.
Zurück zum Zitat Bienstock, D., Chopra, S., Günlük, O., Tsai, C.Y.: Minimum cost capacity installation for multicommodity network flows. Math. Program. 81(2), 177–199 (1998)MathSciNetCrossRef Bienstock, D., Chopra, S., Günlük, O., Tsai, C.Y.: Minimum cost capacity installation for multicommodity network flows. Math. Program. 81(2), 177–199 (1998)MathSciNetCrossRef
Metadaten
Titel
Dealing with Demand Uncertainty in Service Network and Load Plan Design
verfasst von
Ahmad Baubaid
Natashia Boland
Martin Savelsbergh
Copyright-Jahr
2018
DOI
https://doi.org/10.1007/978-3-319-93031-2_5