Advertisement

A Novel Hybrid Genetic Algorithm for the Two-Stage Transportation Problem with Fixed Charges Associated to the Routes

  • Ovidiu Cosma
  • Petrica C. PopEmail author
  • Cosmin Sabo
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 12011)

Abstract

This paper concerns the two-stage transportation problem with fixed charges associated to the routes and proposes an efficient hybrid metaheuristic for distribution optimization. Our proposed hybrid algorithm incorporates a linear programming optimization problem into a genetic algorithm. Computational experiments were performed on a recent set of benchmark instances available from literature. The achieved computational results prove that our proposed solution approach is highly competitive in comparison with the existing approaches from the literature.

References

  1. 1.
    Balinski, M.I.: Fixedcost transportation problems. Nav. Res. Logist. 8(1), 41–54 (1961)CrossRefGoogle Scholar
  2. 2.
    Buson, E., Roberti, R., Toth, P.: A reduced-cost iterated local search heuristic for the fixed-charge transportation problem. Oper. Res. 62(5), 1095–1106 (2014)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Calvete, H., Gale, C., Iranzo, J., Toth, P.: A matheuristic for the two-stage fixed-charge transportation problem. Comput. Oper. Res. 95, 113–122 (2018)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Cosma, O., Danciulescu, D., Pop, P.C.: On the two-stage transportation problem with fixed charge for opening the distribution centers. IEEE Access 7(1), 113684–113698 (2019)CrossRefGoogle Scholar
  5. 5.
    Cosma, O., Pop, P.C., Pop Sitar, C.: An efficient iterated local search heuristic algorithm for the two-stage fixed-charge transportation problem. Carpathian J. Math. 35(2), 153–164 (2019)MathSciNetGoogle Scholar
  6. 6.
    Guisewite, G., Pardalos, P.: Minimum concave-cost network flow problems: applications, complexity, and algorithms. Ann. Oper. Res. 25(1), 75–99 (1990)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Jawahar, N., Balaji, A.N.: A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge. Eur. J. Oper. Res. 194, 496–537 (2009)CrossRefGoogle Scholar
  8. 8.
    Pop, P.C., Sabo, C., Biesinger, B., Hu, B., Raidl, G.: Solving the two-stage fixed-charge transportation problem with a hybrid genetic algorithm. Carpathian J. Math. 33(3), 365–371 (2017)MathSciNetzbMATHGoogle Scholar
  9. 9.
    Pop, P.C., Matei, O., Pop Sitar, C., Zelina, I.: A hybrid based genetic algorithm for solving a capacitated fixed-charge transportation problem. Carpathian J. Math. 32(2), 225–232 (2016)MathSciNetzbMATHGoogle Scholar
  10. 10.
    Raj, K.A.A.D., Rajendran, C.: A genetic algorithm for solving the fixed-charge transportation model: two-stage problem. Comput. Oper. Res. 39(9), 2016–2032 (2012)CrossRefGoogle Scholar
  11. 11.
    Hundt, R.: Loop recognition in C++/Java/Go/Scala. In: Proceedings of Scala Days (2011). https://days2011.scala-lang.org/sites/days2011/files/ws3-1-Hundt.pdf
  12. 12.

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.Department of Mathematics and Computer ScienceTechnical University of Cluj-Napoca, North University Center at Baia MareBaia MareRomania

Personalised recommendations