Profit Maximization and Vehicle Fleet Planning for a Harbor Logistics Company

  • Natalia B. Shamray
  • Nina A. KochetovaEmail author
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 871)


We present a new optimization model to maximize the total operating profit of a harbor logistics company on a finite time horizon. Some local providers supply the company with a scrap-metal materials of different qualities. The materials are reprocessed into the high-quality product and exported to abroad by different types of ships. The company has to cover the purchase cost for the materials, the transportation cost to deliver the materials, the reprocessing and storage cost in a warehouse, shipping cost, and payment for international declarations. To find the best strategy for the company we present a mixed integer nonlinear model. We linearize the objective function and aggregate the set of providers in order to apply CPLEX software efficiently. We conduct computational experiments on real test instances and discuss how to use the model for planning fleet of vehicles, a capacity of the warehouse, and price strategy for the company.


Supply chain Heterogeneous fleet Vehicle Reprocessing 



The research in Sects. 1, 2 and 3 was supported by RFBR grant 18-07-00599. The research in Sects. 4 and 5 was supported by the program of fundamental scientific researches of the SB RAS I.5.1., project 0314-2016-0014.


  1. 1.
    Grazia Speranza, M.: Trends in transportation and logistics. Eur. J. Oper. Res. 264(3), 830–836 (2018)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Chen, S., Golden, B.: The split delivery vehicle routing problem: applications, algorithms, test problems, and computational results. Networks 49(4), 318–329 (2007)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Dror, M., Trudeau, P.: Saving by split delivery routing. Transp. Sci. 23(2), 141–145 (1989)CrossRefGoogle Scholar
  4. 4.
    Kochetov, Y.A., Khmelev, A.V.: A hybrid algorithm of local search for the heterogeneous fixed fleet vehicle routing problem. J. Appl. Ind. Math. 9(4), 503–518 (2015)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Khmelev, A., Kochetov, Y.: A hybrid local search for the split delivery vehicle routing problem. Int. J. Artif. Intell. 13(1), 147–164 (2015)zbMATHGoogle Scholar
  6. 6.
    Vidal, T., Crainic, T.G., Gendreau, M., Prins, C.: Heuristics for multi-attribute vehicle routing problems: a survey and synthesis. Eur. J. Oper. Res. 231(1), 1–21 (2013)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Irawan, C.A., Salhi, S., Scaparra, M.P.: An adaptive multiphase approach for large unconditional and conditional \(p\)-median problems. Eur. J. Oper. Res. 237(2), 590–605 (2014)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Alekseeva, E., Kochetov, Y., Plyasunov, A.: An exact method for the discrete \((r|p)\)-centroid problem. J. Glob. Optim. 63(3), 445–460 (2015)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Alekseeva, E., Kochetov, Y.: Matheuristics and exact methods for the discrete \((r|p)\)-centroid problem. In: Talbi, E.G. (ed.) Metaheuristics for Bi-level Optimization. SCI, vol. 482, pp. 189–219. Springer, Berlin (2013). Scholar
  10. 10.
    Davydov, I.A., Kochetov, Y.A., Carrizosa, E.: A local search heuristic for the \((r|p)\)-centroid problem in the plane. Comput. Oper. Res. 52, 334–340 (2014)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Lavlinskii, S.M., Panin, A.A., Plyasunov, A.V.: Comparison of models of planning public-private partnership. J. Appl. Ind. Math. 10(3), 356–369 (2016)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Iellamo, S., Alekseeva, E., Chen, L., Coupechoux, M., Kochetov, Y.: Competitive location in cognitive radio networks. 4OR 13(1), 81–110 (2015)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Davydov, I., Kochetov, Y., Plyasunov, A.: On the complexity of the \((r|p)\)-centroid problem in the plane. TOP 22(2), 614–623 (2014)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Panin, A.A., Plyasunov, A.V.: On complexity of the bilevel location and pricing problems. J. Appl. Ind. Math. 8(4), 574–581 (2014)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Diakova, Z., Kochetov, Y.: A double VNS heuristic for the facility location and pricing problem. Electron. Notes Discret. Math. 39, 29–34 (2012)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Institute for Automation and Control SciencesVladivostokRussia
  2. 2.Sobolev Institute of MathematicsNovosibirskRussia

Personalised recommendations