798 search results - page 10 / 160 » Using Genetic Algorithms for Solving Hard Problems in GIS |
AMC
2005
13 years 8 months ago
2005
In this paper, solving a cell formation (CF) problem in dynamic condition is going to be discussed by using some traditional metaheuristic methods such as genetic algorithm (GA), ...
ASIAMS
2007
IEEE
14 years 2 months ago
2007
IEEE
The shortest capacitated path problem is a well known problem in the networking area, having a wide range of applications. In the shortest capacitated path problem, a traffic flow...
ESWA
2007
13 years 8 months ago
2007
The goal of assembly planning consists in generating feasible sequences to assemble a product and selecting an efficient assembly sequence from which related constraint factors su...
CP
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
GECCO
2006
Springer
14 years 3 days ago
2006
Springer
This paper proposes an adaptive dominance mechanism for diploidy genetic algorithms in dynamic environments. In this scheme, the genotype to phenotype mapping in each gene locus i...