Skip to main content

2015 | OriginalPaper | Buchkapitel

Exact Solutions to the Short Sea Shipping Distribution Problem

verfasst von : Ana Moura, Jorge Oliveira

Erschienen in: Operational Research

Verlag: Springer International Publishing

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

search-config
loading …

Abstract

Short sea shipping has several advantages over other means of transportation, recognized by EU members. The maritime transportation could be dealt like a combination of two well-known problems: the container stowage problem and routing planning problem. The integration of these two well-known problems results in a new problem CSSRP (Container stowage and ship routing problem) that is also an hard combinatorial optimization problem. The aim of this work is to solve the CSSRP using a mixed integer programming model. It is proved that regardless the complexity of this problem, optimal solutions could be achieved in a reduced computational time. For testing the mathematical model some problems based on real data were generated and a sensibility analysis was performed.

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!

Fußnoten
1
An overstow occurs when there are containers that must be moved because they block the access to other containers that have to be unloaded.
 
Literatur
1.
Zurück zum Zitat Agarwal, R., Ergun, O.: Ship scheduling and network design for cargo routing in linear shipping. Transp. Sci. 42(2), 175–196 (2008)CrossRef Agarwal, R., Ergun, O.: Ship scheduling and network design for cargo routing in linear shipping. Transp. Sci. 42(2), 175–196 (2008)CrossRef
2.
Zurück zum Zitat Ambrosino, D., Sciomachen, A., Tanfani, E.: Stowing a containership: the master bay plan problem. Transp. Res. Part A 38, 81–99 (2004)CrossRef Ambrosino, D., Sciomachen, A., Tanfani, E.: Stowing a containership: the master bay plan problem. Transp. Res. Part A 38, 81–99 (2004)CrossRef
3.
Zurück zum Zitat Ambrosino, D., Sciomachen, A., Tanfani, E.: A decomposition heuristics for the container ship stowage problem. J. Heuristics 12, 211–233 (2006)MATHCrossRef Ambrosino, D., Sciomachen, A., Tanfani, E.: A decomposition heuristics for the container ship stowage problem. J. Heuristics 12, 211–233 (2006)MATHCrossRef
4.
Zurück zum Zitat Aslidis, A.H.: Combinatorial algorithms for stacking problems. PhD dissertation, MIT (2000) Aslidis, A.H.: Combinatorial algorithms for stacking problems. PhD dissertation, MIT (2000)
5.
Zurück zum Zitat Avriel, M., Penn, M.: Exact and approximate solutions of the container ship stowage problem. Comput. Ind. Eng. 25, 271–274 (1993)CrossRef Avriel, M., Penn, M.: Exact and approximate solutions of the container ship stowage problem. Comput. Ind. Eng. 25, 271–274 (1993)CrossRef
6.
Zurück zum Zitat Avriel, M., Penn, M., Shpirer, N., Witteboon, S.: Stowage planning for container ships to reduce the number of shifts. Ann. Oper. Res. 76, 55–71 (1998)MATHCrossRef Avriel, M., Penn, M., Shpirer, N., Witteboon, S.: Stowage planning for container ships to reduce the number of shifts. Ann. Oper. Res. 76, 55–71 (1998)MATHCrossRef
7.
Zurück zum Zitat Avriel, M., Penn, M., Shpirer, N.: Container ship stowage problem: complexity and connection to the coloring of circle graphs. Discret. Appl. Math. 103, 271–279 (2000)MATHMathSciNetCrossRef Avriel, M., Penn, M., Shpirer, N.: Container ship stowage problem: complexity and connection to the coloring of circle graphs. Discret. Appl. Math. 103, 271–279 (2000)MATHMathSciNetCrossRef
8.
Zurück zum Zitat Bortfeldt, A., Wascher, G.: Constraints in container loading a state-of-the-art review. Eur. J. Oper. Res. 229, 1–20 (2013)MathSciNetCrossRef Bortfeldt, A., Wascher, G.: Constraints in container loading a state-of-the-art review. Eur. J. Oper. Res. 229, 1–20 (2013)MathSciNetCrossRef
9.
Zurück zum Zitat Botter, R.C., Brinati, M.A.: Stowage container planning: a model for getting an optimal solution. In: Computer Applications in the Automation of Shipyard Operation and Ship Design, VII, pp. 217–229. North-Holland, Amsterdam/New York (1992) Botter, R.C., Brinati, M.A.: Stowage container planning: a model for getting an optimal solution. In: Computer Applications in the Automation of Shipyard Operation and Ship Design, VII, pp. 217–229. North-Holland, Amsterdam/New York (1992)
10.
Zurück zum Zitat Christiansen, M., Nygreen, B.: A method for solving ship routing problems with inventory constraints. Ann. Oper. Res. 81, 357–378 (1998)MATHMathSciNetCrossRef Christiansen, M., Nygreen, B.: A method for solving ship routing problems with inventory constraints. Ann. Oper. Res. 81, 357–378 (1998)MATHMathSciNetCrossRef
11.
Zurück zum Zitat Delgado, A., Jensen, R.M., Janstrup, K., Rose, T.H., Andersen, K.H.: A Constraint Programming model for fast optimal stowage of container vessel bays. Eur. J. Oper. Res. 220, 251–261 (2012)MATHMathSciNetCrossRef Delgado, A., Jensen, R.M., Janstrup, K., Rose, T.H., Andersen, K.H.: A Constraint Programming model for fast optimal stowage of container vessel bays. Eur. J. Oper. Res. 220, 251–261 (2012)MATHMathSciNetCrossRef
12.
Zurück zum Zitat Dubrovsky, O., Levitin, O.G., Penn, M.: A genetic algorithm with a compact solution encoding for the container ship stowage problem. J. Heuristics 8, 585–599 (2002)CrossRef Dubrovsky, O., Levitin, O.G., Penn, M.: A genetic algorithm with a compact solution encoding for the container ship stowage problem. J. Heuristics 8, 585–599 (2002)CrossRef
13.
Zurück zum Zitat Gendreau, M., Iori, M., Laporte, G., Martello, S.: A tabu search algorithm for a routing and container loading problem. Transp. Sci. 9(3), 342–350 (2006)CrossRef Gendreau, M., Iori, M., Laporte, G., Martello, S.: A tabu search algorithm for a routing and container loading problem. Transp. Sci. 9(3), 342–350 (2006)CrossRef
14.
Zurück zum Zitat Martins, T., Moura, A., Campos, A.A., Lobo, V.: Genetic algorithms approach for containerships fleet management dependent on cargo and their deadlines. In: Proceedings of IAME 2010: Annual Conference of the International Association of Maritime Economists, Lisbon 7–9 July 2010 Martins, T., Moura, A., Campos, A.A., Lobo, V.: Genetic algorithms approach for containerships fleet management dependent on cargo and their deadlines. In: Proceedings of IAME 2010: Annual Conference of the International Association of Maritime Economists, Lisbon 7–9 July 2010
15.
Zurück zum Zitat Moura, A., Oliveira, J.F.: An integrated approach to the vehicle routing and container loading problems. Oper. Res. Spectr. 31, 775–800 (2009)MATHMathSciNetCrossRef Moura, A., Oliveira, J.F.: An integrated approach to the vehicle routing and container loading problems. Oper. Res. Spectr. 31, 775–800 (2009)MATHMathSciNetCrossRef
16.
Zurück zum Zitat Moura, A., Oliveira, J., Pimentel, C.: A mathematical model for the container stowage and ship routing problem. J. Math. Model. Algorithms Oper. Res. 12(3), 217–231 (2013)MATHMathSciNetCrossRef Moura, A., Oliveira, J., Pimentel, C.: A mathematical model for the container stowage and ship routing problem. J. Math. Model. Algorithms Oper. Res. 12(3), 217–231 (2013)MATHMathSciNetCrossRef
17.
Zurück zum Zitat Wei-Ying, Z., Yan, L., Zhuo-Shang, J.T.: Model and algorithm for container ship stowage planning based on Bin-packing problem. J. Marine Sci. Appl. 4(3), 30–36 (2005)CrossRef Wei-Ying, Z., Yan, L., Zhuo-Shang, J.T.: Model and algorithm for container ship stowage planning based on Bin-packing problem. J. Marine Sci. Appl. 4(3), 30–36 (2005)CrossRef
18.
Zurück zum Zitat Wilson, I.D., Roach, P.A.: Principles of combinatorial optimization applied to container-ship stowage planning. J. Heuristics 5(4), 403–418(16) (1999)MATHCrossRef Wilson, I.D., Roach, P.A.: Principles of combinatorial optimization applied to container-ship stowage planning. J. Heuristics 5(4), 403–418(16) (1999)MATHCrossRef
19.
Zurück zum Zitat Wilson, I.D., Roach, P.A.: Container stowage planning: a methodology for generating computerized solutions. J. Oper. Res. Soc. 51, 1248–1255 (2000)MATHCrossRef Wilson, I.D., Roach, P.A.: Container stowage planning: a methodology for generating computerized solutions. J. Oper. Res. Soc. 51, 1248–1255 (2000)MATHCrossRef
Metadaten
Titel
Exact Solutions to the Short Sea Shipping Distribution Problem
verfasst von
Ana Moura
Jorge Oliveira
Copyright-Jahr
2015
DOI
https://doi.org/10.1007/978-3-319-20328-7_16