Skip to main content

Solving a Generalized Network Design Problem Using the Archimedes Optimization Algorithm

  • Conference paper
  • First Online:
Intelligent Computing & Optimization (ICO 2022)

Part of the book series: Lecture Notes in Networks and Systems ((LNNS,volume 569))

Included in the following conference series:

Abstract

Network design decisions in strategic communication networks have attracted widespread interest from the scientific community in the last decades. Since real-world cases are complex and computationally challenging systems that require effective optimization techniques, therefore recently, approximate resolution methods, specifically metaheuristics frameworks are in focus. In this research, we investigate a specific variant of Network Design Problems (NDPs), namely the Generalized Discrete Cost Multicommodity Network Design Problem (GDCMNDP), which seeks to find a network that optimizes the total costs while fulfilling several design restrictions. A promising newly developed solution approach based on the Archimedes Optimization Algorithm (AOA) that has not been tackled in the previous studies for solving NDPs is proposed. To assess its performance, the proposed approach is applied to benchmark network scenarios from the literature. The obtained solutions are compared with well-known state-of-the-art metaheuristic solutions. Results highlight the promising performance of the AOA for solving such NP-hard Network Design Problems.

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 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Feremans, C., Labbé, M., Laporte, G.: Generalized network design problems. Eur. J. Oper. Res. 148(1), 1–13 (2003)

    Article  MathSciNet  Google Scholar 

  2. Mejri, I., Layeb, S.B., Mansour, F.Z.: Enhanced exact approach for the network loading problem. In: 2019 6th International Conference on Control, Decision and Information Technologies (CoDIT), pp. 970–975. IEEE (2019)

    Google Scholar 

  3. Mejri, I., Layeb, S.B., Mansour, F.Z.: Solving the discrete cost multicommodity network design problem to optimality. In: 2018 International Conference on Innovation and Intelligence for Informatics, Computing, and Technologies (3ICT), pp. 1–5. IEEE (2018)

    Google Scholar 

  4. Mejri, I., Haouari, M., Layeb, S.B., Mansour, F.Z.: An exact approach for the multicommodity network optimization problem with a step cost function. RAIRO-Oper. Res. 53(4), 1279–1295 (2019)

    Article  MathSciNet  Google Scholar 

  5. Atamtürk, A., Günlük, O.: Multicommodity multifacility network design. In: Crainic, T.G., Gendreau, M., Gendron, B. (eds.) Network Design with Applications to Transportation and Logistics, pp. 141–166. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-64018-7_5

    Chapter  Google Scholar 

  6. Crainic, T.G.: Service network design in freight transportation. Eur. J. Oper. Res. 122(2), 272–288 (2000)

    Article  Google Scholar 

  7. Mejri, I., Layeb, S.B., Zeghal, F.: A survey on network design problems: main variants and resolution approaches. Eur. J. Ind. Eng. (2022, in press)

    Google Scholar 

  8. Salimifard, K., Bigharaz, S.: The multicommodity network flow problem: state of the art classification, applications, and solution methods. Oper. Res. Int. J. 22, 1–47 (2020). https://doi.org/10.1007/s12351-020-00564-8

    Article  Google Scholar 

  9. Layeb, S.B., Heni, R., Balma, A.: Compact MILP models for the discrete cost multicommodity network design problem. In: 2017 International Conference on Engineering & MIS (ICEMIS), pp. 1–7. IEEE (2017)

    Google Scholar 

  10. Mejri, I., Layeb, S.B., Zeghal Mansour, F.: Formulations and benders decomposition based procedures for the discrete cost multicommodity network design problem. Int. J. Comput. Digit. Syst. 8(6), 659–668 (2019)

    Article  Google Scholar 

  11. Ennaifer, N.B., Layeb, S.B., Zeghal, F.M.: On lower bounds computation for the discrete cost multicommodity network design problem. In: 2016 International Conference on Control, Decision and Information Technologies (CoDIT), pp. 511–516. IEEE (2016)

    Google Scholar 

  12. Mejri, I., Layeb, S.B., Haouari, M., Mansour, F.Z.: A simulation-optimization approach for the stochastic discrete cost multicommodity flow problem. Eng. Optim. 52(3), 507–526 (2019)

    Article  MathSciNet  Google Scholar 

  13. Khatrouch, S., Layeb, S.B., Siala, J.C.: Bio-inspired metaheuristics for the generalised discrete cost multicommodity network design problem. Int. J. Metaheuristics 7(2), 176–196 (2019)

    Article  Google Scholar 

  14. Mejri, I., Layeb, S.B., Drira, E.: Tailoring a red deer algorithm to solve a generalized network design problem. In: IN4PL, pp. 32–39 (2021)

    Google Scholar 

  15. Sadeghi-Moghaddam, S., Hajiaghaei-Keshteli, M., Mahmoodjanloo, M.: New approaches in metaheuristics to solve the fixed charge transportation problem in a fuzzy environment. Neural Comput. Appl. 31(1), 477–497 (2017). https://doi.org/10.1007/s00521-017-3027-3

    Article  Google Scholar 

  16. Hashim, F.A., Hussain, K., Houssein, E.H., Mabrouk, M.S., Al-Atabany, W.: Archimedes optimization algorithm: a new metaheuristic algorithm for solving optimization problems. Appl. Intell. 51(3), 1531–1551 (2020). https://doi.org/10.1007/s10489-020-01893-z

    Article  MATH  Google Scholar 

  17. Anand, S.: Archimedes optimization algorithm: Heart disease prediction: archimedes optimization algorithm: heart disease prediction. Multimedia Res. 4(3), 25–33 (2021)

    Google Scholar 

  18. Annrose, J., Rufus, N.H.A., Rex, C.E.S., Immanuel, D.G.: Soybean plant disease classification using archimedes optimization algorithm based hybrid deep learning model. Mapping Intimacies (2021)

    Google Scholar 

  19. Zhang, L., Wang, J., Niu, X., Liu, Z.: Ensemble wind speed forecasting with multi-objective Archimedes optimization algorithm and sub-model selection. Appl. Energy 301, 117449 (2021)

    Article  Google Scholar 

  20. Mrad, M., Haouari, M.: Optimal solution of the discrete cost multicommodity network design problem. Appl. Math. Comput. 204(2), 745–753 (2008)

    MathSciNet  MATH  Google Scholar 

  21. Layeb, S.B.: GDCMNDP Instances. https://www.researchgate.net/publication/322446665_GDCMNDP_Instances (2018)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Safa Bhar Layeb .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Mejri, I., Layeb, S.B., Koussani, J. (2023). Solving a Generalized Network Design Problem Using the Archimedes Optimization Algorithm. In: Vasant, P., Weber, GW., Marmolejo-Saucedo, J.A., Munapo, E., Thomas, J.J. (eds) Intelligent Computing & Optimization. ICO 2022. Lecture Notes in Networks and Systems, vol 569. Springer, Cham. https://doi.org/10.1007/978-3-031-19958-5_2

Download citation

Publish with us

Policies and ethics