Sciweavers

440 search results - page 6 / 88
» Local Search Heuristics for the Multidimensional Assignment ...
Sort
View
GECCO
2004
Springer
119views Optimization» more  GECCO 2004»
14 years 1 months ago
Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem
Randomized search heuristics, among them randomized local search and evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to problems...
Frank Neumann, Ingo Wegener
JSAC
2006
88views more  JSAC 2006»
13 years 7 months ago
Heuristic algorithms for the routing and wavelength assignment of scheduled lightpath demands in optical networks
This paper addresses the problem of routing and wavelength assignment (RWA) of scheduled lightpath demands (SLDs) in wavelength routed optical networks with no wavelength converter...
Nina Skorin-Kapov
AE
1999
Springer
13 years 12 months ago
Characterizing Locality in Decoder-Based EAs for the Multidimensional Knapsack Problem
The performance of decoder-based evolutionary algorithms (EAs) strongly depends on the locality of the used decoder and operators. While many approaches to characterize locality ar...
Jens Gottlieb, Günther R. Raidl
EOR
2006
57views more  EOR 2006»
13 years 7 months ago
Routing and wavelength assignment by partition colouring
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, f...
Thiago F. Noronha, Celso C. Ribeiro
TEC
2002
163views more  TEC 2002»
13 years 7 months ago
Ants can solve constraint satisfaction problems
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
Christine Solnon