An adaptive variable neighborhood search for solving the multi-objective node placement problem.
Ons AbdelkhalekHela MasriSaoussen KrichenPublished in: Electron. Notes Discret. Math. (2015)
Keyphrases
- multi objective
- variable neighborhood search
- metaheuristic
- multi objective optimization
- evolutionary algorithm
- genetic algorithm
- optimization algorithm
- tabu search
- objective function
- single machine scheduling problem
- multiple objectives
- search procedure
- traveling salesman problem
- combinatorial optimization
- heuristic methods
- particle swarm optimization
- hybrid method
- path relinking
- nsga ii
- directed graph
- branch and bound algorithm
- evolutionary computation
- routing problem
- vehicle routing problem
- minimum spanning tree
- benchmark instances
- linear programming
- simulated annealing