Priority-Based Genetic Algorithm for Shortest Path Routing Problem in OSPF

DOI10.1007/978-3-540-95978-6_7zbMath1170.68310OpenAlexW202911434MaRDI QIDQ5192376

Lin Lin, Mitsuo Gen

Publication date: 5 August 2009

Published in: Studies in Computational Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-95978-6_7

zbMATH Keywords

Open Shortest Path FirstPriority-based Encoding

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Network design and communication in computer systems (68M10) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (3)

Algorithms for the minmax regret path problem with interval data ⋮ Auto-tuning strategy for evolutionary algorithms: Balancing between exploration and exploitation ⋮ A comparison of genetic representations for multi-objective shortest path problems on multigraphs

This page was built for publication: Priority-Based Genetic Algorithm for Shortest Path Routing Problem in OSPF