Skip to main content
Erschienen in: OR Spectrum 3/2006

01.07.2006 | Regular Article

Simultaneous fleet assignment and cargo routing using benders decomposition

verfasst von: D. Li, H.-C. Huang, A. D. Morton, E.-P. Chew

Erschienen in: OR Spectrum | Ausgabe 3/2006

Einloggen

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

search-config
loading …

Abstract

In this paper, we incorporate the cargo routing problem into fleet assignment to model the fleet assignment more accurately. An integrated model and a Benders decomposition-based approach are developed to simultaneously obtain the optimal assignment of fleet to legs and the routing of forecasted cargo demand over the network. Computational experiments show that this integrated approach converges very fast for all different test scenarios.

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

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!

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!

Literatur
Zurück zum Zitat Abara J (1989) Applying integer linear programming to the fleet assignment problem. Interfaces 19(4):20–28CrossRef Abara J (1989) Applying integer linear programming to the fleet assignment problem. Interfaces 19(4):20–28CrossRef
Zurück zum Zitat Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms and applications. Prentice-Hall, Englewood Cliffs, pp 649–694 Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms and applications. Prentice-Hall, Englewood Cliffs, pp 649–694
Zurück zum Zitat Barnhart C, Shenoi RG (1998) An approximate model and solution approach for the long-haul crew pairing problem. Transp Sci 32:221–231 Barnhart C, Shenoi RG (1998) An approximate model and solution approach for the long-haul crew pairing problem. Transp Sci 32:221–231
Zurück zum Zitat Barnhart C, Boland NL, Clarke LW, Johnson EL, Nemhauser GL, Shenoi RG (1998a) Flight string models for aircraft fleeting and routing. Transp Sci 32:208–220 Barnhart C, Boland NL, Clarke LW, Johnson EL, Nemhauser GL, Shenoi RG (1998a) Flight string models for aircraft fleeting and routing. Transp Sci 32:208–220
Zurück zum Zitat Barnhart C, Lu F, Shenoi R (1998b) Integrated airline schedule planning. In: Yu G (ed) Operations research in the airline industry. Kluwer, Boston Barnhart C, Lu F, Shenoi R (1998b) Integrated airline schedule planning. In: Yu G (ed) Operations research in the airline industry. Kluwer, Boston
Zurück zum Zitat Barnhart C, Kniker TS, Lohatepanont M (2002) Itinerary-based airline fleet assignment. Transp Sci 36:199–217CrossRef Barnhart C, Kniker TS, Lohatepanont M (2002) Itinerary-based airline fleet assignment. Transp Sci 36:199–217CrossRef
Zurück zum Zitat Benders JF (1962) Partitioning procedures for solving mixed-variables programming problem. Numer Math 4:238–252CrossRef Benders JF (1962) Partitioning procedures for solving mixed-variables programming problem. Numer Math 4:238–252CrossRef
Zurück zum Zitat Bertsimas D, Tsitsiklis JN (1997) Introduction to linear optimization. Athena Scientific, Belmont Bertsimas D, Tsitsiklis JN (1997) Introduction to linear optimization. Athena Scientific, Belmont
Zurück zum Zitat Cohn AM, Barnhart C (2003) Improving crew scheduling by incorporating key maintenance decisions. Oper Res 51:387–396 Cohn AM, Barnhart C (2003) Improving crew scheduling by incorporating key maintenance decisions. Oper Res 51:387–396
Zurück zum Zitat Cordeau JF, Stojkovic G, Soumis F, Desrosiers J (2001) Benders decomposition for simultaneous aircraft routing and crew scheduling. Transp Sci 35:375–388CrossRef Cordeau JF, Stojkovic G, Soumis F, Desrosiers J (2001) Benders decomposition for simultaneous aircraft routing and crew scheduling. Transp Sci 35:375–388CrossRef
Zurück zum Zitat Desaulniers G, Desrosiers J, Dumas Y, Solomon MM, Soumis F (1997) Daily aircraft routing and scheduling. Manage Sci 43:841–855 Desaulniers G, Desrosiers J, Dumas Y, Solomon MM, Soumis F (1997) Daily aircraft routing and scheduling. Manage Sci 43:841–855
Zurück zum Zitat Geoffrion AM, Graves GW (1974) Multicommodity distribution system design by Benders decomposition. Manage Sci 20:822–844 Geoffrion AM, Graves GW (1974) Multicommodity distribution system design by Benders decomposition. Manage Sci 20:822–844
Zurück zum Zitat Hane CA, Barnhart C, Johnson EL, Marsten RE, Nemhauser GL, Sigismondi G (1995) The fleet assignment problem—solving a large-scale integer-program. Math Program 70:211–232 Hane CA, Barnhart C, Johnson EL, Marsten RE, Nemhauser GL, Sigismondi G (1995) The fleet assignment problem—solving a large-scale integer-program. Math Program 70:211–232
Zurück zum Zitat Jones KL, Lustig IJ, Farvolden JM, Powell WB (1993) Multi-commodity network flows: the impact of formulation on de-composition. Math Program 62(1):95–117CrossRef Jones KL, Lustig IJ, Farvolden JM, Powell WB (1993) Multi-commodity network flows: the impact of formulation on de-composition. Math Program 62(1):95–117CrossRef
Zurück zum Zitat Klabjan D, Johnson EL, Nemhauser GL, Gelman E, Ramaswamy S (2002) Airline crew scheduling with time windows and plane-count constraints. Transp Sci 36:337–348CrossRef Klabjan D, Johnson EL, Nemhauser GL, Gelman E, Ramaswamy S (2002) Airline crew scheduling with time windows and plane-count constraints. Transp Sci 36:337–348CrossRef
Zurück zum Zitat Magnanti TL, Wong RT (1981) Accelerating Benders decomposition: algorithmic enhancement and model selection criteria. Oper Res 29:464–484 Magnanti TL, Wong RT (1981) Accelerating Benders decomposition: algorithmic enhancement and model selection criteria. Oper Res 29:464–484
Zurück zum Zitat Mercier A, Cordeau J, Soumis F (2003) A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem. GERARD technical report G-2003-48, 24 pp Mercier A, Cordeau J, Soumis F (2003) A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem. GERARD technical report G-2003-48, 24 pp
Zurück zum Zitat Rexing B, Barhart C, Kniker T, Jarrah A, Krishnamurthy N (2000) Airline fleet assignment with time windows. Transp Sci 34(1):1–20CrossRef Rexing B, Barhart C, Kniker T, Jarrah A, Krishnamurthy N (2000) Airline fleet assignment with time windows. Transp Sci 34(1):1–20CrossRef
Zurück zum Zitat Rushmeier RA, Kontogiorgis SA (1997) Advances in the optimization of airline fleet assignment. Transp Sci 31(2):159–169 Rushmeier RA, Kontogiorgis SA (1997) Advances in the optimization of airline fleet assignment. Transp Sci 31(2):159–169
Zurück zum Zitat Subramanian R, Scheff RP, Quillinan JD, Wiper DS, Marsten RE (1994) Coldstart—fleet assignment at delta-airlines. Interfaces 24(1):104–120 Subramanian R, Scheff RP, Quillinan JD, Wiper DS, Marsten RE (1994) Coldstart—fleet assignment at delta-airlines. Interfaces 24(1):104–120
Metadaten
Titel
Simultaneous fleet assignment and cargo routing using benders decomposition
verfasst von
D. Li
H.-C. Huang
A. D. Morton
E.-P. Chew
Publikationsdatum
01.07.2006
Verlag
Springer-Verlag
Erschienen in
OR Spectrum / Ausgabe 3/2006
Print ISSN: 0171-6468
Elektronische ISSN: 1436-6304
DOI
https://doi.org/10.1007/s00291-006-0041-8

Weitere Artikel der Ausgabe 3/2006

OR Spectrum 3/2006 Zur Ausgabe