7 search results - page 1 / 2 » Using memetic algorithms with guided local search to solve a... |
ESWA
2007
13 years 4 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...
IJIT
2004
13 years 6 months ago
2004
In this paper, the problem of finding the optimal collision free path for a mobile robot, the path planning problem, is solved using an advanced evolutionary algorithm called memet...
EVOW
2006
Springer
13 years 8 months ago
2006
Springer
An original approach, termed Divide-and-Evolve is proposed to hybridize Evolutionary Algorithms (EAs) with Operational Research (OR) methods in the domain of Temporal Planning Prob...
CEC
2007
IEEE
13 years 8 months ago
2007
IEEE
Abstract-- Shotgun sequencing is the state-of-the-art to decode genome sequence. However this technique needs a lot of fragments. Combining those fragments correctly requires enorm...
AI
1999
Springer
13 years 4 months ago
1999
Springer
There are many different approaches to solving planning problems, one of which is the use of domain specific control knowledge to help guide a domain independent search algorithm. ...