77 search results - page 3 / 16 » Using Genetic Algorithms to Solve the Tactical Fixed Interva... |
GECCO
2005
Springer
13 years 11 months ago
2005
Springer
Using a dynamic systems model for the Simple Genetic Algorithm due to Vose[1], we analyze the fixed point behavior of the model without crossover applied to functions of unitation...
HEURISTICS
1998
13 years 5 months ago
1998
In this paper we present a genetic algorithm-based heuristic for solving the set partitioning problem (SPP). The SPP is an important combinatorial optimisation problem used by man...
CEC
2010
IEEE
12 years 9 months ago
2010
IEEE
— Efficient vehicle path planning in hostile environment to carry out rescue or tactical logistic missions remains very challenging. Most approaches reported so far relies on key...
COCOON
2006
Springer
13 years 9 months ago
2006
Springer
Many real-life scheduling, routing and location problems can be formulated as combinatorial optimization problems whose goal is to find a linear layout of an input graph in such a ...
CEC
2003
IEEE
13 years 11 months ago
2003
IEEE
Abstract- Simulated annealing (SA) is an effective general heuristic method for solving many combinatorial optimization problems. This paper deals with two problems in SA. One is ...