Research on Multi-objective Shortest Path Based on Genetic Algorithm

The shortest path problem is a search for the shortest or minimum path between the source and destination under the relevant parameter constraints, and it is an effective method for solving network routing problems. Many good algorithms have been proposed by researchers for single-parameter shortest...

Celý popis

Podrobná bibliografia

Vydané v:	2022 2nd International Conference on Computer Science and Blockchain (CCSB) s. 127 - 130
Hlavní autori:	Zheng, Sihai, Zheng, Changrui, Li, Wei
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.10.2022
Predmet:	Adaptation value Biological system modeling Encoding Genetic algorithm MNET Path growth Quality of service Routing Routing protocols Search problems Shortest path Shortest path problem
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!