A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion

DOI10.1111/j.1475-3995.2010.00771.xzbMath1219.90035MaRDI QIDQ3087853

Mauricio G. C. Resende, Marcus Ritt, Luciana S. Buriol, Roger Reis

Publication date: 17 August 2011

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/j.1475-3995.2010.00771.x

zbMATH Keywords

metaheuristics; networks; local search; genetic algorithm; networking; routing; telecommunication networks; biased random-key genetic algorithm

Mathematics Subject Classification ID

68T05: Learning and adaptive systems in artificial intelligence

90B18: Communication networks in operations research

90C59: Approximation methods and heuristics in mathematical programming

68M12: Network protocols

Related Items

A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks, A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem, A biased random-key genetic algorithm for the capacitated minimum spanning tree problem, A biased random-key genetic algorithm for road congestion minimization, Biased random-key genetic algorithms with applications in telecommunications

Cites Work

• Unnamed Item
• Increasing internet capacity using local search
• A genetic algorithm for the weight setting problem in OSPF routing
• Multiobjective design of survivable IP networks
• Hierarchical multiobjective routing in Multiprotocol Label Switching networks with two service classes: a heuristic solution
• On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• Internet Routing and Related Topology Issues
• Optimization of Internet Protocol network design and routing
• An Incremental Algorithm for a Generalization of the Shortest-Path Problem
• A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing