A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model
DOI10.1007/s10898-020-00877-0zbMath1448.90095OpenAlexW3004343718MaRDI QIDQ785640
Isabel Rosseti, Thiago F. Noronha, Bruno Q. Pinto, Celso Carneiro Ribeiro
Publication date: 7 August 2020
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-020-00877-0
metaheuristicsoptical networksrouting and wavelength assignmentbiased random-key genetic algorithmscheduled lightpath demandssliding scheduled lightpath demands
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)
Uses Software
Cites Work
- A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks
- Restart strategies for GRASP with path-relinking heuristics
- Routing and wavelength assignment by partition colouring
- Routing and wavelength assignment in optical networks using bin packing based algorithms
- Probability distribution of solution time in GRASP: an experimental investigation
- Automatic algorithm design for hybrid flowshop scheduling problems
- TTT plots: a perl program to create time-to-target plots
- A biased random-key genetic algorithm for single-round divisible load scheduling
- Optimization by GRASP
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- A biased random‐key genetic algorithm for scheduling heterogeneous multi‐round systems
- The complexity of path coloring and call scheduling
This page was built for publication: A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model
