Sciweavers

22 search results - page 2 / 5
» A Comparison of Several Evolutionary Heuristics for the Freq...
Sort
View
GECCO
2009
Springer
116views Optimization» more  GECCO 2009»
13 years 9 months ago
String- and permutation-coded genetic algorithms for the static weapon-target assignment problem
In the Weapon-Target Assignment Problem, m enemy targets are inbound, each with a value Vj representing the damage it may do. The defense has n weapons, and the probability that w...
Bryant A. Julstrom
ICCSA
2003
Springer
13 years 10 months ago
A Comparison Study of Modern Heuristics for Solving the Partitioning Problem in Distributed Virtual Environment Systems
Fast Internet connections and the widespread use of high performance graphic cards are making Distributed Virtual Environment (DVE) systems very common nowadays. However, there are...
Pedro Morillo, Marcos Fernández, Juan M. Or...
EOR
2007
147views more  EOR 2007»
13 years 5 months ago
Routing and wavelength assignment in optical networks using bin packing based algorithms
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 nu...
Nina Skorin-Kapov
GECCO
2000
Springer
170views Optimization» more  GECCO 2000»
13 years 9 months ago
A Comparison of Genetic Algorithms for the Dynamic Job Shop Scheduling Problem
The majority of the research using evolutionary algorithms for the Job Shop Scheduling Problem (JSSP) has studied only the static JSSP. Few evolutionary algorithms have been appli...
Manuel Vázquez, L. Darrell Whitley
GECCO
2009
Springer
172views Optimization» more  GECCO 2009»
13 years 10 months ago
Comparison of similarity measures for the multi-objective vehicle routing problem with time windows
The Vehicle Routing Problem can be seen as a fusion of two well known combinatorial problems, the Travelling Salesman Problem and Bin Packing Problem. It has several variants, the...
Abel Garcia-Najera, John A. Bullinaria