Multi-objective variable neighborhood search: an application to combinatorial optimization problems.
Abraham DuarteJuan José PantrigoEduardo G. PardoNenad MladenovicPublished in: J. Glob. Optim. (2015)
Keyphrases
- combinatorial optimization problems
- variable neighborhood search
- multi objective
- metaheuristic
- particle swarm optimization
- traveling salesman problem
- evolutionary algorithm
- optimization problems
- genetic algorithm
- combinatorial optimization
- vehicle routing problem
- tabu search
- ant colony optimization
- simulated annealing
- objective function
- multi objective optimization
- optimization algorithm
- benchmark instances
- path relinking
- shortest path problem
- search space
- multiple objectives
- optimal solution
- job shop scheduling
- single machine scheduling problem
- combinatorial problems
- search methods
- knapsack problem
- evolutionary computation
- exact algorithms
- heuristic methods
- nsga ii
- differential evolution
- minimum spanning tree
- particle swarm optimization pso
- memetic algorithm
- routing problem
- bi objective
- search procedure
- benchmark problems
- hybrid method
- test problems
- max sat
- fitness function
- neural network