Sciweavers

35 search results - page 2 / 7
» A GA-ACO-local search hybrid algorithm for solving quadratic...
Sort
View
PREMI
2007
Springer
13 years 12 months ago
Cunning Ant System for Quadratic Assignment Problem with Local Search and Parallelization
Abstract. The previously proposed cunning ant system (cAS), a variant of the ACO algorithm, worked well on the TSP and the results showed that the cAS could be one of the most prom...
Shigeyoshi Tsutsui
JPDC
1998
125views more  JPDC 1998»
13 years 5 months ago
Solving Large-Scale QAP Problems in Parallel with the Search Library ZRAM
Programlibraries are one tool to make the cooperation between specialists from various elds successful: the separation of application-speci c knowledge from applicationindependent...
Adrian Brüngger, Ambros Marzetta, Jens Clause...
EMO
2009
Springer
219views Optimization» more  EMO 2009»
14 years 11 days ago
An Elitist GRASP Metaheuristic for the Multi-objective Quadratic Assignment Problem
We propose an elitist Greedy Randomized Adaptive Search Procedure (GRASP) metaheuristic algorithm, called mGRASP/MH, for approximating the Pareto-optimal front in the multi-objecti...
Hui Li, Dario Landa Silva
EOR
2010
110views more  EOR 2010»
13 years 5 months ago
A hybrid metaheuristic approach to solving the UBQP problem
This paper presents a hybrid metaheuristic approach (HMA) for solving the Unconstrained Binary Quadratic Programming (UBQP) problem. By incorporating a tabu search procedure into ...
Zhipeng Lü, Fred Glover, Jin-Kao Hao
INFORMATICALT
2006
108views more  INFORMATICALT 2006»
13 years 5 months ago
Experiments with Hybrid Genetic Algorithm for the Grey Pattern Problem
Recently, genetic algorithms (GAs) and their hybrids have achieved great success in solving difficult combinatorial optimization problems. In this paper, the issues related to the ...
Alfonsas Misevicius