A MIP Based Local Search Heuristic for a Stochastic Maritime Inventory Routing Problem

  • Agostinho AgraEmail author
  • Marielle Christiansen
  • Lars Magnus Hvattum
  • Filipe RodriguesEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9855)


We consider a single product maritime inventory routing problem in which the production and consumption rates are constant over the planning horizon. The problem involves a heterogeneous fleet of ships and multiple production and consumption ports with limited storage capacity. In spite of being one of the most common ways to transport goods, maritime transportation is characterized by high levels of uncertainty. The principal source of uncertainty is the weather conditions, since they have a great influence on sailing times. The travel time between any pair of ports is assumed to be random and to follow a log-logistic distribution. To deal with random sailing times we propose a two-stage stochastic programming problem with recourse. The routing, the order in which the ports are visited, as well as the quantities to load and unload are fixed before the uncertainty is revealed, while the time of the visit to ports and the inventory levels can be adjusted to the scenario. To solve the problem, a MIP based local search heuristic is developed. This new approach is compared with a decomposition algorithm in a computational study.


Maritime transportation Stochastic programming Uncertainty Matheuristic 



The work of the first author was funded by FCT (Fundação para a Ciência e a Tecnologia) and CIDMA (Centro de Investigação e Desenvolvimento em Matemática e Aplicações) within project UID/MAT/04106/2013. The work or the fourth author was funded by FCT under Grant PD/BD/114185/2016.


  1. 1.
    Agra, A., Andersson, H., Christiansen, M., Wolsey, L.: A maritime inventory routing problem: discrete time formulations and valid inequalities. Networks 64, 297–314 (2013)CrossRefzbMATHMathSciNetGoogle Scholar
  2. 2.
    Agra, A., Christiansen, M., Delgado, A., Hvattum, L.M.: A maritime inventory routing problem with stochastic sailing and port times. Comput. Oper. Res. 61, 18–30 (2015)CrossRefMathSciNetGoogle Scholar
  3. 3.
    Agra, A., Christiansen, M., Figueiredo, R., Hvattum, L.M., Poss, M., Requejo, C.: The robust vehicle routing problem with time windows. Comput. Oper. Res. 40, 856–866 (2013)CrossRefzbMATHMathSciNetGoogle Scholar
  4. 4.
    Andersson, H., Hoff, A., Christiansen, M., Hasle, G., Løkketangen, A.: Industrial aspects and literature survey: combined inventory management and routing. Comput. Oper. Res. 37, 1515–1536 (2010)CrossRefzbMATHMathSciNetGoogle Scholar
  5. 5.
    Birge, J.R., Louveaux, F.: Introduction to Stochastic Programming. Springer Series in Operations Research and Financial Engineering, 2nd edn. Springer, New York (2011)CrossRefzbMATHGoogle Scholar
  6. 6.
    Cheng, L., Duran, M.A.: Logistics for world-wide crude oil transportation using discrete event simulation and optimal control. Comput. Chem. Eng. 28, 897–911 (2004)CrossRefGoogle Scholar
  7. 7.
    Christiansen, M., Fagerholt, K.: Robust ship scheduling with multiple time windows. Naval Res. logistics 49, 611–625 (2002)CrossRefzbMATHMathSciNetGoogle Scholar
  8. 8.
    Christiansen, M., Fagerholt, K.: Maritime inventory routing problems. In: Floudas, C.A., Pardalos, P.M. (eds.) Encyclopedia of Optimization, pp. 1947–1955. Springer, New York (2009)CrossRefGoogle Scholar
  9. 9.
    Christiansen, M., Fagerholt, K.: Ship routing and scheduling in industrial and tramp shipping. In: Toth, P., Vigo, D. (eds.) Vehicle Routing: Problems, Methods, and Applications. MOS-SIAM Series on Optimization, pp. 381–408. SIAM, Philadelphia (2014)CrossRefGoogle Scholar
  10. 10.
    Christiansen, M., Fagerholt, K., Nygreen, B., Ronen, D.: Ship routing and scheduling in the new millennium. Eur. J. Oper. Res. 228, 467–483 (2013)CrossRefzbMATHMathSciNetGoogle Scholar
  11. 11.
    Christiansen, M., Nygreen, B.: Robust inventory ship routing by column generation. In: Desrosiers, G., Solomon, M.M. (eds.) Column Generation, pp. 197–224. Springer, New York (2005)CrossRefGoogle Scholar
  12. 12.
    Coelho, L.C., Cordeau, J.-F., Laporte, G.: Thirty years of inventory routing. transp. sci. 48, 1–19 (2014)CrossRefGoogle Scholar
  13. 13.
    Fischetti, M., Lodi, A.: Local branching. Math. Program. Ser. B 98, 23–47 (2003)CrossRefzbMATHMathSciNetGoogle Scholar
  14. 14.
    Halvorsen-Weare, E.E., Fagerholt, K.: Robust supply vessel planning. In: Pahl, J., Reiners, T., Voß, S. (eds.) INOC 2011. LNCS, vol. 6701, pp. 559–573. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  15. 15.
    Halvorsen-Weare, E.E., Fagerholt, K., Rönnqvist, M.: Vessel routing and scheduling under uncertainty in the liquefied natural gas business. Comput. Ind. Eng. 64, 290–301 (2013)CrossRefGoogle Scholar
  16. 16.
    Kauczynkski, W.: Study of the reliability of the ship transportation. In: Proceedings of the International Conference on Ship and Marine Research (1994). 15pGoogle Scholar
  17. 17.
    Kaut, M., Wallace, S.: Evaluation of scenario-generation methods for stochastic programming. Pac. J. Optim. 3, 257–271 (2007)zbMATHMathSciNetGoogle Scholar
  18. 18.
    Papageorgiou, D.J., Nemhauser, G.L., Sokol, J., Cheo, M.-S., Keha, A.B.: MIRPLib - a library of maritime inventory routing problem instances: survey, core model, and benchmark results. Eur. J. Oper. Res. 234, 350–366 (2014)CrossRefzbMATHMathSciNetGoogle Scholar
  19. 19.
    Rakke, J.G., Stålhane, M., Moe, C.R., Andersson, H., Christiansen, M., Fagerholt, K., Norstad, I.: A rolling horizon heuristic for creating a liquefied natural gas annual delivery program. Transp. Res. Part C 19, 896–911 (2011)CrossRefGoogle Scholar
  20. 20.
    Sherali, H.D., Al-Yakoob, S.M.: Determining an optimal fleet mix and schedules: Part I - single source and destination. In: Karlof, J.K. (ed.) Integer Programming Theory and Practice, pp. 137–166. CRC Press, Boca Raton (2006)Google Scholar
  21. 21.
    Sherali, H.D., Al-Yakoob, S.M.: Determining an optimal fleet mix and schedules: Part II - multiple sources and destinations, and the option of leasing transshipment depots. In: Karlof, J.K. (ed.) Integer Programming Theory and Practice, pp. 167–194. CRC Press, Boca Raton (2006)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Department of Mathematics, CIDMAUniversity of AveiroAveiroPortugal
  2. 2.Department of Industrial Economics and Technology ManagementNorwegian University of Science and TechnologyTrondheimNorway
  3. 3.Molde University CollegeMoldeNorway

Personalised recommendations