Variable Neighborhood Search as Genetic Algorithm Operator for DNA Fragment Assembling Problem.
Gabriela F. MinettiGabriel LuqueEnrique AlbaPublished in: HIS (2008)
Keyphrases
- variable neighborhood search
- metaheuristic
- genetic algorithm
- tabu search
- hybrid metaheuristic
- simulated annealing
- benchmark instances
- vehicle routing problem
- heuristic methods
- ant colony optimization
- path relinking
- hybrid method
- traveling salesman problem
- memetic algorithm
- job shop scheduling problem
- routing problem
- minimum spanning tree
- optimization problems
- hybrid algorithm
- combinatorial optimization
- scatter search
- optimization method
- fitness function
- search procedure
- search space
- combinatorial problems
- evolutionary computation
- optimal solution
- particle swarm optimization
- combinatorial optimization problems
- neural network
- crossover operator
- test problems
- multi objective optimization
- max sat
- differential evolution
- computational efficiency
- single machine scheduling problem
- genetic algorithm ga
- multi objective
- optimization algorithm
- genetic programming