77 search results - page 2 / 16 » Hybrid Metaheuristics |
COMPSAC
2004
IEEE
13 years 9 months ago
2004
IEEE
While meta-heuristics are effective for solving large-scale combinatorial optimization problems, they result from time-consuming trial-and-error algorithm design tailored to speci...
EOR
2010
13 years 5 months ago
2010
This paper presents a hybrid metaheuristic approach (HMA) for solving the Unconstrained Binary Quadratic Programming (UBQP) problem. By incorporating a tabu search procedure into ...
COR
2006
13 years 5 months ago
2006
In this paper we tackle the task assignment problem (TSAP) in heterogeneous computer systems. The TSAP consists of assigning a given distributed computer program formed by a numbe...
IPPS
1999
IEEE
13 years 9 months ago
1999
IEEE
Abstract. This paper presents a Parallel Hybrid Evolutionary Metaheuristic for the Period Vehicle Routing Problem PVRP. The PRVP generalizes the classical Vehicle Routing Problem b...
EMO
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. Topology design of enterprise networks is a hard combinatorial optimization problem. It has numerous constraints, several objectives, and a very noisy solution space. Bes...