A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing

DOI10.1002/net.20070zbMath1072.90528OpenAlexW4251801412MaRDI QIDQ5318276

Luciana S. Buriol, Mikkel Thorup, Celso Carneiro Ribeiro, Mauricio G. C. Resende

Publication date: 22 September 2005

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20070

zbMATH Keywords

metaheuristicslocal searchgenetic algorithminternetoptimized crossoverOSPF routingIS-IS routing

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Real-time monitoring of undirected networks: Articulation points, bridges, and connected and biconnected components, A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks, Multiobjective design of survivable IP networks, A biased random-key genetic algorithm for the capacitated minimum spanning tree problem, Optimal configuration of power distribution networks with variable renewable energy resources, Mathematical programming approaches for dual multicast routing problem with multilayer risk cost, A biased random-key genetic algorithm for road congestion minimization, Biased random-key genetic algorithms with applications in telecommunications, A survey of repair methods used as constraint handling techniques in evolutionary algorithms, An Integer Programming Algorithm for Routing Optimization in IP Networks, Routing and Capacity Optimization for IP Networks, A random key based genetic algorithm for the resource constrained project scheduling problem, TTT plots: a perl program to create time-to-target plots, Intra-domain traffic engineering with shortest path routing protocols, A genetic algorithm for the resource constrained multi-project scheduling problem, A parallel multi-population biased random-key genetic algorithm for a container loading problem, Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE, An integer programming algorithm for routing optimization in IP networks, Intra-domain traffic engineering with shortest path routing protocols, Redundant multicast routing in multilayer networks with shared risk resource groups: complexity, models and algorithms, Approximability of unsplittable shortest path routing problems, Heuristics for the dynamic facility location problem with modular capacities, Applications of meta-heuristics to traffic engineering in IP networks, Efficient techniques and tools for intra-domain traffic engineering, A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion, Optimization of OSPF Routing in IP Networks

Cites Work

• Genetic Algorithms and Random Keys for Sequencing and Optimization
• Unnamed Item
• Unnamed Item