Abstract
In this paper we address a particular capacitated two-stage fixed-charge transportation problem using an efficient hybrid genetic algorithm. The proposed approach is designed to fit the challenges of the investigated optimization problem and is obtained by incorporating an linear programming (LP) optimization problem within the framework of a genetic algorithm. We evaluated our proposed solution approach on two sets of instances often used in the literature. The experimental results that we achieved show the efficiency of our hybrid algorithm in yielding high-quality solutions within reasonable running-times, besides the superiority of our approach against other existing competing methods.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Cosma, O., Pop, P.C., Matei, O., Zelina, I.: A hybrid iterated local search for solving a particular two-stage fixed-charge transportation problem. In: de Cos Juez, F., et al. (eds.) HAIS 2018. LNCS, vol. 10870, pp. 684–693. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-92639-1_57
Holland, J.H.: Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence. MIT Press, Cambridge (1992)
Molla-Alizadeh-Zavardehi, S., Hajiaghaei-Kesteli, M., Tavakkoli-Moghaddam, R.: Solving a capacitated fixed-cost transportation problem by artificial immune and genetic algorithms with a Prüfer number representation. Expert Syst. Appl. 38, 10462–10474 (2011)
Pintea, C.-M., Sitar, C.P., Hajdu-Macelaru, M., Petrica, P.: A hybrid classical approach to a fixed-charged transportation problem. In: Corchado, E., Snášel, V., Abraham, A., Woźniak, M., Graña, M., Cho, S.-B. (eds.) HAIS 2012. LNCS (LNAI), vol. 7208, pp. 557–566. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-28942-2_50
Pintea, C.-M., Pop, P.C., Hajdu-Măcelaru, M.: Classical hybrid approaches on a transportation problem with gas emissions constraints. In: Snášel, V., Abraham, A., Corchado, E. (eds.) Soft Computing Models in Industrial and Environmental Applications. Advances in Intelligent and Soft Computing, vol. 188, pp. 449–458. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-32922-7_46
Pintea, C.M., Pop, P.C.: An improved hybrid algorithm for capacitated fixed-charge transportation problem. Log. J. IJPL 23(3), 369–378 (2015)
Pop, P.C., Pintea, C.-M., Pop Sitar, C., Hajdu-Macelaru, M.: An efficient reverse distribution system for solving sustainable supply chain network design problem. J. Appl. Log. 13(2), 105–113 (2015)
Pop, P.C., Matei, O., Pop Sitar, C., Zelina, I.: A hybrid based genetic algorithm for solving a capacitated fixed-charge transportation problem. Carpath. J. Math. 32(2), 225–232 (2016)
El-Sherbiny, M.M.: Solving a capacitated fixed-cost transportation problem by artificial immune and genetic algorithms with a Prüfer number representation. Expert Syst. Appl. 39, 11321–11322 (2011). Molla-Alizadeh-Zavardehi, S.: Expert Syst. Appl. (2012)
Egerváry Research Group on Combinatorial Optimization: Library for Efficient Modeling and Optimization in Networks. https://lemon.cs.elte.hu/trac/lemon
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Cosma, O., Pop, P.C., Sabo, C. (2019). An Efficient Hybrid Genetic Algorithm for Solving a Particular Two-Stage Fixed-Charge Transportation Problem. In: Pérez García, H., Sánchez González, L., Castejón Limas, M., Quintián Pardo, H., Corchado Rodríguez, E. (eds) Hybrid Artificial Intelligent Systems. HAIS 2019. Lecture Notes in Computer Science(), vol 11734. Springer, Cham. https://doi.org/10.1007/978-3-030-29859-3_14
Download citation
DOI: https://doi.org/10.1007/978-3-030-29859-3_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-29858-6
Online ISBN: 978-3-030-29859-3
eBook Packages: Computer ScienceComputer Science (R0)