A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks
From MaRDI portal
Publication:312488
DOI10.1007/S10898-015-0389-XzbMath1353.90163OpenAlexW2215099960MaRDI QIDQ312488
Thiago F. Noronha, Julliany S. Brandão, Celso Carneiro Ribeiro
Publication date: 15 September 2016
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-015-0389-x
Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items (2)
\texttt{tttplots-compare}: a Perl program to compare time-to-target plots or general runtime distributions of randomized algorithms ⋮ A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model
Uses Software
Cites Work
- Unnamed Item
- A hybrid biased random key genetic algorithm approach for the unit commitment problem
- A biased random-key genetic algorithm for road congestion minimization
- Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms
- Routing and wavelength assignment by partition colouring
- Routing and wavelength assignment in optical networks using bin packing based algorithms
- A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families
- On column generation formulations for the RWA problem
- Geometric algorithms and combinatorial optimization.
- A genetic algorithm for the weight setting problem in OSPF routing
- Variable neighborhood descent with iterated local search for routing and wavelength assignment
- Probability distribution of solution time in GRASP: an experimental investigation
- \texttt{tttplots-compare}: a Perl program to compare time-to-target plots or general runtime distributions of randomized algorithms
- TTT plots: a perl program to create time-to-target plots
- A hybrid genetic algorithm for the job shop scheduling problem
- A biased random-key genetic algorithm for single-round divisible load scheduling
- A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion
- Survivable IP network design with OSPF routing
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- A More Portable Fortran Random Number Generator
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing
- Bounds on Multiprocessing Timing Anomalies
- The complexity of path coloring and call scheduling
This page was built for publication: A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks
