97 search results - page 4 / 20 » Genetic algorithms for the sailor assignment problem |
ICC
2011
IEEE
12 years 6 months ago
2011
IEEE
—Ant colony optimization (ACO) is a probabilistic technique used for solving complex computational problems, such as finding optimal routes in networks. It has been proved to pe...
SLS
2009
Springer
13 years 11 months ago
2009
Springer
The Multidimensional Assignment Problem (MAP or s-AP in the case of s dimensions) is an extension of the well-known assignment problem. The most studied case of MAP is 3-AP, though...
INFORMATICALT
2000
13 years 6 months ago
2000
Many heuristics, such as simulated annealing, genetic algorithms, greedy randomized adaptive search procedures are stochastic. In this paper, we propose a deterministic heuristic a...
COR
2006
13 years 7 months ago
2006
A problem of assigning cooperating uninhabited aerial vehicles to perform multiple tasks on multiple targets is posed as a new combinatorial optimization problem. A genetic algori...
ICTAI
2006
IEEE
14 years 1 months ago
2006
IEEE
We propose a novel algorithm called GA-MDP for solving the frequency assigment problem. GA-MDP inherits the spirit of genetic algorithms with an adaptation of Markov Decision Proc...