[图书][B] Optimization by GRASP
MGC Resende, CC Ribeiro - 2016 - Springer
Greedy randomized adaptive search procedures, or GRASP, were introduced by T. Feo and
M. Resende in 1989 as a probabilistic heuristic for solving hard set covering problems. Soon …
M. Resende in 1989 as a probabilistic heuristic for solving hard set covering problems. Soon …
A new approach to optical networks security: Attack-aware routing and wavelength assignment
N Skorin-Kapov, J Chen… - IEEE/ACM transactions on …, 2009 - ieeexplore.ieee.org
Security issues and attack management in transparent wavelength division multiplexing
(WDM) optical networks have become of prime importance to network operators due to the …
(WDM) optical networks have become of prime importance to network operators due to the …
Routing and wavelength assignment by partition colouring
TF Noronha, CC Ribeiro - European Journal of Operational Research, 2006 - Elsevier
The problem of routing and wavelength assignment in all-optical networks may be solved by
a combined approach involving the computation of alternative routes for the lightpaths …
a combined approach involving the computation of alternative routes for the lightpaths …
A biased random-key genetic algorithm for routing and wavelength assignment
The problem of routing and wavelength assignment in wavelength division multiplexing
optical networks consists in routing a set of lightpaths and assigning a wavelength to each of …
optical networks consists in routing a set of lightpaths and assigning a wavelength to each of …
Routing and wavelength assignment in optical networks using bin packing based algorithms
N Skorin-Kapov - European Journal of Operational Research, 2007 - Elsevier
This paper addresses the problem of routing and wavelength assignment (RWA) of static
lightpath requests in wavelength routed optical networks. The objective is to minimize the …
lightpath requests in wavelength routed optical networks. The objective is to minimize the …
Performance analysis of circuit switched multi-service multi-rate networks with alternative routing
We consider a circuit-switched multiservice network with non-hierarchical alternative routing
and trunk reservation. Based on the fundamental concept of overflow priority classification …
and trunk reservation. Based on the fundamental concept of overflow priority classification …
Heuristic algorithms for the routing and wavelength assignment of scheduled lightpath demands in optical networks
N Skorin-Kapov - IEEE Journal on selected areas in …, 2006 - ieeexplore.ieee.org
This paper addresses the problem of routing and wavelength assignment (RWA) of
scheduled lightpath demands (SLDs) in wavelength routed optical networks with no …
scheduled lightpath demands (SLDs) in wavelength routed optical networks with no …
Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms
Run time distributions or time-to-target plots are very useful tools to characterize the running
times of stochastic algorithms for combinatorial optimization. We further explore run time …
times of stochastic algorithms for combinatorial optimization. We further explore run time …
Metaheuristics and applications to optimization problems in telecommunications
SL Martins, CC Ribeiro - Handbook of optimization in telecommunications, 2006 - Springer
Recent years have witnessed huge advances in computer technology and communication
networks, entailing hard optimization problems in areas such as network design and routing …
networks, entailing hard optimization problems in areas such as network design and routing …
Metaheuristics for optimization problems in computer communications
Recent years have witnessed huge advances in computer technology and communication
networks, entailing hard optimization problems in areas such as network design and routing …
networks, entailing hard optimization problems in areas such as network design and routing …