Research on Multi-objective Shortest Path Based on Genetic Algorithm

Zheng, Sihai; Changrui, Zheng; Li, Wei

doi:10.1109/ccsb58128.2022.00030

Cited by 2 publications

(2 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Genetic algorithms and EAs are often used to solve multiobjective routing optimization problems. Some examples are in [123][124][125][126]. These algorithms are based on the idea behind the evolution theory by Charles Darwin, such that the resolution procedure mimics the natural selection observed in nature.…”

Section: Approximate Methodsmentioning

confidence: 99%

“…A multiobjective routing model for the Internet using a multiobjective path formulation is presented in [164]; the model uses as path metrics number of arcs, total mean delay and residual bandwidth, and it is solved by an exact algorithm that obtains the set of efficient solutions for connections from one node to all the other nodes and a method for selecting a solution that uses a weighted Chebyshev distance to the ideal point. In [125], a multiobjective shortest path problem is also formulated, for application to a QoS routing model, that considers the metrics optimized maximal bandwidth and minimal delay. The MOPP is solved by a genetic algorithm.…”

Section: Models That Use Straightforwardly Algorithm(s) Dedicated To ...mentioning

confidence: 99%

See 1 more Smart Citation

Multiobjective Path Problems and Algorithms in Telecommunication Network Design—Overview and Trends

Craveirinha,

Clímaco,

Girão-Silva

et al. 2024

Algorithms

View full text Add to dashboard Cite

A major area of application of multiobjective path problems and resolution algorithms is telecommunication network routing design, taking into account the extremely rapid technological and service evolutions. The need for explicit consideration of heterogeneous Quality of Service metrics makes it advantageous for the development of routing models where various technical–economic aspects, often conflicting, should be tackled. Our work is focused on multiobjective path problem formulations and resolution methods and their applications to routing methods. We review basic concepts and present main formulations of multiobjective path problems, considering different types of objective functions. We outline the different types of resolution methods for these problems, including a classification and overview of relevant algorithms concerning different types of problems. Afterwards, we outline background concepts on routing models and present an overview of selected papers considered as representative of different types of applications of multiobjective path problem formulations and algorithms. A broad characterization of major types of path problems relevant in this context is shown regarding the overview of contributions in different technological and architectural network environments. Finally, we outline research trends in this area, in relation to recent technological evolutions in communication networks.

show abstract

Section: Approximate Methodsmentioning

confidence: 99%

Section: Models That Use Straightforwardly Algorithm(s) Dedicated To ...mentioning

confidence: 99%