Skip to main content

An Efficient Soft Computing Approach for Solving the Two-Stage Transportation Problem with Fixed Costs

  • Conference paper
  • First Online:
14th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO 2019) (SOCO 2019)

Abstract

Transportation problems are nowadays strategic issues which aim at selecting the routes to be opened between different facilities in order to achieve an efficient distribution strategy. This paper presents a soft computing approach for solving the two-stage transportation problem with fixed costs associated to the routes. Our developed a heuristic algorithm embeds an optimization problem within the framework of a genetic algorithm. Computational experiments were performed on two sets of benchmark instances available in the literature and the obtained 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

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Calvete, H., Gale, C., Iranzo, J.: An improved evolutionary algorithm for the two-stage transportation problem with fixed charge at depots. OR Spectr. 38, 189–206 (2016)

    Article  MathSciNet  Google Scholar 

  2. 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)

    Article  MathSciNet  Google Scholar 

  3. 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: Proceedings of HAIS 2018, Lecture Notes in Computer Science, vol. 10870, pp. 684-693 (2018)

    Google Scholar 

  4. Cosma, O., Pop, P.C., Pop Sitar, C.: An efficient iterated local search heuristic algorithm for the two-stage fixed-charge transportation problem. Carpath. J. Math. (2019, in press)

    Google Scholar 

  5. Geoffrion, A.M., Graves, G.W.: Multicommodity distribution system design by Benders decomposition. Manag. Sci. 20, 822–844 (1974)

    Article  Google Scholar 

  6. Hirsch, W.M., Dantzig, G.B.: The fixed charge problem. Naval Res. Log. Q. 15, 413–424 (1968)

    Article  MathSciNet  Google Scholar 

  7. Holland, J.H.: Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence. MIT Press, Cambridge (1992)

    Book  Google Scholar 

  8. 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)

    Article  Google Scholar 

  9. Pintea, C.-M., Pop Sitar, C., Hajdu-Macelaru, M., Pop, P.C.: A hybrid classical approach to a fixed-charge transportation problem. In: Corchado, E., et al. (eds.) Proceedings of HAIS 2012, Part I. Lecture Notes in Computer Science, vol. 7208, pp. 557–566 . Springer, Cham (2012)

    Google Scholar 

  10. Pintea, C.M., Pop, P.C.: An improved hybrid algorithm for capacitated fixed-charge transportation problem. Log. J. IJPL 23(3), 369–378 (2015)

    MathSciNet  Google Scholar 

  11. 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)

    Article  Google Scholar 

  12. 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)

    MathSciNet  MATH  Google Scholar 

  13. Pop, P.C., Sabo, C., Biesinger, B., Hu, B., Raidl, G.: Solving the two-stage fixed-charge transportation problem with a hybrid genetic algorithm. Carpath. J. Math. 33(3), 365–371 (2017)

    MathSciNet  MATH  Google Scholar 

  14. 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)

    Article  Google Scholar 

  15. Raj, K.A.A.D., Rajendran, C.: A hybrid genetic algorithm for solving single-stage fixed-charge transportation problems. Technol. Oper. Manag. 2(1), 1–15 (2011)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Petrica Pop .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Cosma, O., Pop, P., Zelina, I. (2020). An Efficient Soft Computing Approach for Solving the Two-Stage Transportation Problem with Fixed Costs. In: Martínez Álvarez, F., Troncoso Lora, A., Sáez Muñoz, J., Quintián, H., Corchado, E. (eds) 14th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO 2019). SOCO 2019. Advances in Intelligent Systems and Computing, vol 950. Springer, Cham. https://doi.org/10.1007/978-3-030-20055-8_50

Download citation

Publish with us

Policies and ethics