Advertisement

Exact Solutions to the Short Sea Shipping Distribution Problem

  • Ana MouraEmail author
  • Jorge Oliveira
Part of the CIM Series in Mathematical Sciences book series (CIMSMS, volume 4)

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.

Keywords

Problem Instance Vehicle Route Problem Demand Distribution Vessel Capacity Deadline Constraint 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Notes

Acknowledgements

This work was supported by Portuguese funds through the CIDMA – Center for Research and Development in Mathematics and Applications, and the Portuguese Foundation for Science and Technology (Fundação para a Ciência e a Tecnologia), within project PEst-OE/MAT/UI4106/2014.

References

  1. 1.
    Agarwal, R., Ergun, O.: Ship scheduling and network design for cargo routing in linear shipping. Transp. Sci. 42(2), 175–196 (2008)CrossRefGoogle Scholar
  2. 2.
    Ambrosino, D., Sciomachen, A., Tanfani, E.: Stowing a containership: the master bay plan problem. Transp. Res. Part A 38, 81–99 (2004)CrossRefGoogle Scholar
  3. 3.
    Ambrosino, D., Sciomachen, A., Tanfani, E.: A decomposition heuristics for the container ship stowage problem. J. Heuristics 12, 211–233 (2006)zbMATHCrossRefGoogle Scholar
  4. 4.
    Aslidis, A.H.: Combinatorial algorithms for stacking problems. PhD dissertation, MIT (2000)Google Scholar
  5. 5.
    Avriel, M., Penn, M.: Exact and approximate solutions of the container ship stowage problem. Comput. Ind. Eng. 25, 271–274 (1993)CrossRefGoogle Scholar
  6. 6.
    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)zbMATHCrossRefGoogle Scholar
  7. 7.
    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)zbMATHMathSciNetCrossRefGoogle Scholar
  8. 8.
    Bortfeldt, A., Wascher, G.: Constraints in container loading a state-of-the-art review. Eur. J. Oper. Res. 229, 1–20 (2013)MathSciNetCrossRefGoogle Scholar
  9. 9.
    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)Google Scholar
  10. 10.
    Christiansen, M., Nygreen, B.: A method for solving ship routing problems with inventory constraints. Ann. Oper. Res. 81, 357–378 (1998)zbMATHMathSciNetCrossRefGoogle Scholar
  11. 11.
    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)zbMATHMathSciNetCrossRefGoogle Scholar
  12. 12.
    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)CrossRefGoogle Scholar
  13. 13.
    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)CrossRefGoogle Scholar
  14. 14.
    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 2010Google Scholar
  15. 15.
    Moura, A., Oliveira, J.F.: An integrated approach to the vehicle routing and container loading problems. Oper. Res. Spectr. 31, 775–800 (2009)zbMATHMathSciNetCrossRefGoogle Scholar
  16. 16.
    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)zbMATHMathSciNetCrossRefGoogle Scholar
  17. 17.
    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)CrossRefGoogle Scholar
  18. 18.
    Wilson, I.D., Roach, P.A.: Principles of combinatorial optimization applied to container-ship stowage planning. J. Heuristics 5(4), 403–418(16) (1999)zbMATHCrossRefGoogle Scholar
  19. 19.
    Wilson, I.D., Roach, P.A.: Container stowage planning: a methodology for generating computerized solutions. J. Oper. Res. Soc. 51, 1248–1255 (2000)zbMATHCrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Department of Economics, Management and Industrial Engineering, CIDMA – Center for Research and Development in Mathematics and ApplicationsUniversity of Aveiro Campus Universitário de SantiagoAveiroPortugal
  2. 2.Department of Economics, Management and Industrial EngineeringUniversity of Aveiro, Portugal, Campus Universitário de SantiagoAveiroPortugal

Personalised recommendations