Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Bücher
Zeitschriften
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
MTZ-Fachkongress

Antriebe und Energiesysteme von morgen


Austausch von Automobil- und Energiewirtschaft

Am 14./15. Mai geht es in Chemnitz um die Mobilitätswende durch Elektro- und Wasserstofffahrzeuge.
Erweiterte Suche
Anmelden
nach oben
Erschienen in:
Plant Disease Classification and Segmentation Using a Hybrid Computer-Aided Model Using GAN and Transfer Learning Kapitel lesen Erstes Kapitel lesen

2024 | OriginalPaper | Buchkapitel

Solving a Generalized Network Design Problem Using Hybrid Metaheuristics

verfasst von : Imen Mejri, Manel Grari, Safa Bhar Layeb

Erschienen in: Innovations in Smart Cities Applications Volume 7

Verlag: Springer Nature Switzerland

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Metaheuristics have emerged as a practical and highly effective alternative to traditional exact methods in mixed-integer optimization. Their ability to strike a favorable balance between solution quality and computational time has made them the preferred choice for tackling complex problems and large instances. In this paper, we focus on the Generalized Discrete Cost Multicommodity Network Design Problem (GDCMNDP), a challenging network design problem. We investigate the performance of hybrid metaheuristics, specifically the Genetic Algorithm and the Non-Linear Threshold Algorithm, known for their success in diverse applications. Our proposed collaborative framework, featuring a multistage structure, harnesses the strengths of these metaheuristics. The numerical results obtained demonstrate the effectiveness of our approach in solving various test problems, highlighting its favorable performance.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Jetzt informieren
Vorheriges Kapitel Enhancing Writer Identification with Local Gradient Histogram Analysis
Nächstes Kapitel Isolated Handwritten Arabic Character Recognition Using Convolutional Neural Networks: An Overview
Literatur
1.
Aboytes-Ojeda, M., Castillo-Villar, K.K., Roni, M.S.: A decomposition approach based on meta-heuristics and exact methods for solving a two-stage stochastic biofuel hub-and-spoke network problem. J. Clean. Prod. 247, 119176 (2020)CrossRef
2.
Dueck, G., Scheuer, T.: Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing. J. Comput. Phys. 90(1), 161–175 (1990)MathSciNetCrossRef
3.
Amine, K.: Multiobjective simulated annealing: principles and algorithm variants. Adv. Oper. Res. 2019, 1–13 (2019)MathSciNet
4.
Sörensen, K., Glover, F.: Metaheuristics encyclopedia of operations research and management. Science 62, 960–970 (2013)
5.
Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybernet. Part B (Cybernetics) 26(1), 29–41 (1996)
6.
Jennings, P.C., Lysgaard, S., Hummelshøj, J.S., Vegge, T., Bligaard, T.: Genetic algorithms for computational materials discovery accelerated by machine learning. NPJ Comput. Mater. 5(1), 46 (2019)
7.
Fogel, D.B.: Evolutionary Computation: Toward A New Philosophy Of Machine Intelligence. Wiley (2006)
8.
Beyer, H.G., Schwefel, H.P.: Evolution strategies–a comprehensive introduction. Nat. Comput. 1, 3–52 (2002)MathSciNetCrossRef
9.
Michalewicz, Z., Fogel, D.B., Michalewicz, Z., Fogel, D.B.: Time-varying environments and noise. In: How to Solve It: Modern Heuristics, pp. 307–334 (2004)
10.
11.
Rodriguez, F.J., Garcia-Martinez, C., Lozano, M.: Hybrid metaheuristics based on evolutionary algorithms and simulated annealing: taxonomy, comparison, and synergy test. IEEE Trans. Evol. Comput. 16(6), 787–800 (2012)CrossRef
12.
Xu, Y., Qu, R.: Solving multi-objective multicast routing problems by evolutionary multi-objective simulated annealing algorithms with variable neighbourhoods. J. Oper. Res. Soc. 62(2), 313–325 (2011)CrossRef
13.
M’Hallah, R.: Minimizing total earliness and tardiness on a single machine using a hybrid heuristic. Comput. Oper. Res. 34(10), 3126–3142 (2007)CrossRef
14.
Ting, T.O., Wong, K.P., Chung, C.Y.: A hybrid genetic algorithm/particle swarm approach for evaluation of power flow in electric network. In: Advances in Machine Learning and Cybernetics: 4th International Conference, ICMLC 2005, Guangzhou, 18–21 August 2005, Revised Selected Papers, pp. 908–917. Springer, Heidelberg (2006)
15.
Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison Wesley Longman, Boston (1989)
16.
Nahas, N., Nourelfath, M.: Non-linear threshold algorithm for the redundancy optimization of multi-state systems. Int. J. Math. Eng. Manag. Sci. 6(1), 416 (2021)
17.
Crainic, T.G., Frangioni, A., Gendron, B.: Bundle-based relaxation methods for multicommodity capacitated fixed charge network design. Discret. Appl. Math. 112(1–3), 73–99 (2001)MathSciNetCrossRef
18.
Ghamlouche, I., Crainic, T.G., Gendreau, M.: Cycle-based neighbourhoods for fixed-charge capacitated multicommodity network design. Oper. Res. 51(4), 655–667 (2003)MathSciNetCrossRef
19.
Paraskevopoulos, D.C., Bektaş, T., Crainic, T.G., Potts, C.N.: A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem. Eur. J. Oper. Res. 253(2), 265–279 (2016)MathSciNetCrossRef
20.
Yaghini, M., Rahbar, M., Karimi, M.: A hybrid simulated annealing and column generation approach for capacitated multicommodity network design. J. Oper. Res. Soc. 64(7), 1010–1020 (2013)CrossRef
21.
Crainic, T.G., Gendreau, M.: Cooperative parallel tabu search for capacitated network design. J. Heurist. 8(6), 601–627 (2002)CrossRef
22.
Minoux, M.: Networks synthesis and optimum network design problems: models, solution methods and applications. Networks 19(3), 313–360 (1989)MathSciNetCrossRef
23.
Mrad, M., Haouari, M.: Optimal solution of the discrete cost multicommodity network design problem. Appl. Math. Comput. 204(2), 745–753 (2008)MathSciNet
24.
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)MathSciNetCrossRef
25.
Khatrouch, S., Layeb, S.B., Siala, J.C.: Bio-inspired metaheuristics for the generalised discrete cost multicommodity network design problem. Int. J. Metaheurist. 7(2), 176–196 (2019)CrossRef
26.
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)
27.
Mejri, I., Layeb, S.B., Koussani, J.: Solving a Generalized Network Design Problem Using The Archimedes Optimization Algorithm. In: Intelligent Computing & Optimization: Proceedings of the 5th International Conference on Intelligent Computing and Optimization 2022 (ICO2022), pp. 14–23. Springer, Cham (2022). https://​doi.​org/​10.​1007/​978-3-031-19958-5_​2
28.
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)MathSciNetCrossRef
29.
Nahas, N., Nourelfath, M.: Nonlinear threshold accepting meta-heuristic for combinatorial optimisation problems. Int. J. Metaheurist. 3(4), 265–290 (2014)CrossRef
30.
Metadaten
Titel
Solving a Generalized Network Design Problem Using Hybrid Metaheuristics
verfasst von
Imen Mejri
Manel Grari
Safa Bhar Layeb
Copyright-Jahr
2024
Buch
Innovations in Smart Cities Applications Volume 7

Print ISBN: 978-3-031-54375-3

Electronic ISBN: 978-3-031-54376-0

Copyright-Jahr: 2024

DOI
https://doi.org/10.1007/978-3-031-54376-0_11

    Premium Partner

    Bildnachweise