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

DOI10.1002/NET.20070MaRDI QIDQ5318276zbMATH OpenOpenAlexFDO

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

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

genetic algorithminternetIS-IS routinglocal searchmetaheuristicsoptimized crossoverOSPF routing

Mathematics Subject Classification ID

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

Recommendations

• A genetic algorithm for the weight setting problem in OSPF routing
• Priority-Based Genetic Algorithm for Shortest Path Routing Problem in OSPF
• A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion
• A customized genetic algorithm for bi-objective routing in a dynamic network

Cites work

• Genetic Algorithms and Random Keys for Sequencing and Optimization
• scientific article; zbMATH DE number 2050708 (Why is no real title available?)
• scientific article; zbMATH DE number 871917 (Why is no real title available?)

Cited in

(33)

• A genetic algorithm for the weight setting problem in OSPF routing
• Optimal configuration of power distribution networks with variable renewable energy resources
• A parallel multi-population biased random-key genetic algorithm for a container loading problem
• Biased random-key genetic algorithms with applications in telecommunications
• Heuristics for the dynamic facility location problem with modular capacities
• Multiobjective design of survivable IP networks
• Mathematical programming approaches for dual multicast routing problem with multilayer risk cost
• TTT plots: a perl program to create time-to-target plots
• A genetic algorithm for the resource constrained multi-project scheduling problem
• Edge-based traffic engineering for OSPF networks
• Real-time monitoring of undirected networks: articulation points, bridges, and connected and biconnected components
• Approximability of unsplittable shortest path routing problems
• 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
• A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks
• A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
• Optimization of OSPF routing in IP networks
• An Integer Programming Algorithm for Routing Optimization in IP Networks
• A survey of repair methods used as constraint handling techniques in evolutionary algorithms
• Priority-Based Genetic Algorithm for Shortest Path Routing Problem in OSPF
• Routing and capacity optimization for IP networks
• 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
• Computational Science – ICCS 2005
• Intra-domain traffic engineering with shortest path routing protocols
• Intra-domain traffic engineering with shortest path routing protocols
• A biased random-key genetic algorithm for road congestion minimization
• Two-stage algorithm for bi-objective black-box traffic engineering
• Biased random-key genetic algorithms: a review
• A link weight assignment algorithm for traffic-engineered networks
• A random key based genetic algorithm for the resource constrained project scheduling problem
• Redundant multicast routing in multilayer networks with shared risk resource groups: complexity, models and algorithms

This page was built for publication: A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5318276)