An efficient discrete PSO coupled with a fast local search heuristic for the DNA fragment assembly problem.
Abdelkamel Ben AliGabriel LuqueEnrique AlbaPublished in: Inf. Sci. (2020)
Keyphrases
- tabu search
- optimal solution
- simulated annealing
- search algorithm
- particle swarm optimization pso
- combinatorial optimization
- particle swarm optimization algorithm
- particle swarm optimization
- neighborhood search
- global search
- hybrid algorithm
- metaheuristic
- genetic algorithm
- pso algorithm
- search procedure
- domain independent planning
- search strategies
- particle swarm optimizer
- particle swarm optimisation
- job shop scheduling problem
- multi objective
- search procedures
- search heuristics
- stochastic local search
- iterated local search
- dna sequences
- global optimization
- hill climbing
- search space
- tree search
- candidate solutions
- feasible solution
- initial solution
- optimization problems
- multi start
- continuous optimization
- genetic algorithm ga
- objective function
- lower bound
- artificial neural networks
- variable neighborhood search
- binding sites
- heuristic methods