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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Balinski, M.I.: Fixedcost transportation problems. Nav. Res. Logist. 8(1), 41–54 (1961)
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)
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)
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)
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)
Guisewite, G., Pardalos, P.: Minimum concave-cost network flow problems: applications, complexity, and algorithms. Ann. Oper. Res. 25(1), 75–99 (1990)
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)
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)
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)
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)
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
https://www.cpubenchmark.net/compare/Intel-Pentium-D-830-vs-Intel-i5-4590/1127vs2234
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Cosma, O., Pop, P.C., Sabo, C. (2020). A Novel Hybrid Genetic Algorithm for the Two-Stage Transportation Problem with Fixed Charges Associated to the Routes. In: Chatzigeorgiou, A., et al. SOFSEM 2020: Theory and Practice of Computer Science. SOFSEM 2020. Lecture Notes in Computer Science(), vol 12011. Springer, Cham. https://doi.org/10.1007/978-3-030-38919-2_34
Download citation
DOI: https://doi.org/10.1007/978-3-030-38919-2_34
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-38918-5
Online ISBN: 978-3-030-38919-2
eBook Packages: Computer ScienceComputer Science (R0)