Sciweavers

97 search results - page 5 / 20
» Genetic algorithms for the sailor assignment problem
Sort
View
GECCO
2000
Springer
145views Optimization» more  GECCO 2000»
15 years 8 months ago
A New Genetic Algorithm for Minimum Span Frequency Assignment using Permutation and Clique
We propose a new Genetic Algorithm (GA) for solving the minimum span frequency assignment problem (MSFAP). The MSFAP is minimizing the range of the frequencies assigned to each tr...
Shouichi Matsui, Ken-ichi Tokoro
GECCO
2005
Springer
132views Optimization» more  GECCO 2005»
15 years 10 months ago
Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem
Augmenting an evolutionary algorithm with knowledge of its target problem can yield a more effective algorithm, as this presentation illustrates. The Quadratic Knapsack Problem e...
Bryant A. Julstrom
168
Voted
GECCO
2006
Springer
287views Optimization» more  GECCO 2006»
15 years 8 months ago
A GA-ACO-local search hybrid algorithm for solving quadratic assignment problem
In recent decades, many meta-heuristics, including genetic algorithm (GA), ant colony optimization (ACO) and various local search (LS) procedures have been developed for solving a...
Yiliang Xu, Meng-Hiot Lim, Yew-Soon Ong, Jing Tang
GECCO
2004
Springer
284views Optimization» more  GECCO 2004»
15 years 10 months ago
Lagrange Multiplier Method for Multi-campaign Assignment Problem
It is crucial to maximize marketing efficiency and customer satisfaction in personalized marketing. In this paper, we raise the multiple recommendation problem which occurs when pe...
Yong-Hyuk Kim, Byung Ro Moon
JAMDS
2002
155views more  JAMDS 2002»
15 years 4 months ago
A new heuristic for the quadratic assignment problem
We propose a new heuristic for the solution of the quadratic assignment problem. The heuristic combines ideas from tabu search and genetic algorithms. Run times are very short comp...
Zvi Drezner