A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks
From MaRDI portal
(Redirected from Publication:312488)
Recommendations
- A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model
- Evaluation performance of genetic algorithm and tabu search algorithm for solving the MAX-RWA problem in all-optical networks
- Solving routing and wavelength assignment problem with maximum edge-disjoint paths
- Model-hierarchical column generation and heuristic for the routing and wavelength assignment problem
- Performance evaluation of heuristic algorithms for routing and wavelength assignment in WDM optical networks
Cites work
- A More Portable Fortran Random Number Generator
- A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion
- A biased random-key genetic algorithm for road congestion minimization
- A biased random-key genetic algorithm for single-round divisible load scheduling
- A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families
- A genetic algorithm for the weight setting problem in OSPF routing
- A hybrid biased random key genetic algorithm approach for the unit commitment problem
- A hybrid genetic algorithm for the job shop scheduling problem
- A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing
- Bounds on Multiprocessing Timing Anomalies
- Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- Geometric algorithms and combinatorial optimization.
- ILP formulations for the routing and wavelength assignment problem: symmetric systems
- On column generation formulations for the RWA problem
- Probability distribution of solution time in GRASP: an experimental investigation
- Routing and wavelength assignment by partition colouring
- Routing and wavelength assignment in optical networks using bin packing based algorithms
- Survivable IP network design with OSPF routing
- TTT plots: a perl program to create time-to-target plots
- The complexity of path coloring and call scheduling
- Variable neighborhood descent with iterated local search for routing and wavelength assignment
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- \texttt{tttplots-compare}: a Perl program to compare time-to-target plots or general runtime distributions of randomized algorithms
Cited in
(9)- Biased random-key genetic algorithms with applications in telecommunications
- scientific article; zbMATH DE number 1833130 (Why is no real title available?)
- scientific article; zbMATH DE number 1841974 (Why is no real title available?)
- Model-hierarchical column generation and heuristic for the routing and wavelength assignment problem
- A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model
- Genetic algorithm and tabu search algorithm for solving the static manycast RWA problem in optical networks
- Performance evaluation of heuristic algorithms for routing and wavelength assignment in WDM optical networks
- Evaluation performance of genetic algorithm and tabu search algorithm for solving the MAX-RWA problem in all-optical networks
- \texttt{tttplots-compare}: a Perl program to compare time-to-target plots or general runtime distributions of randomized algorithms
This page was built for publication: A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q312488)
