Peek - Shape - Grab: A Methodology in Three Stages for Approximating the Non-dominated Points of Multiobjective Discrete/Combinatorial Optimization Problems with a Multiobjective Metaheuristic.
Xavier GandibleuxPublished in: EMO (2017)
Keyphrases
- multi objective
- metaheuristic
- combinatorial optimization problems
- particle swarm optimization
- genetic algorithm
- evolutionary algorithm
- optimization problems
- combinatorial optimization
- ant colony optimization
- simulated annealing
- tabu search
- optimization algorithm
- multi objective optimization
- objective function
- multiobjective optimization
- continuous optimization
- vehicle routing problem
- path relinking
- search space
- optimal solution
- nsga ii
- scatter search
- job shop scheduling
- search methods
- artificial bee colony
- iterated local search
- harmony search
- shortest path problem
- job shop scheduling problem
- knapsack problem
- multiple objectives
- traveling salesman problem
- benchmark problems
- swarm intelligence
- hybrid metaheuristic
- differential evolution
- particle swarm optimization pso
- benchmark instances
- branch and bound algorithm
- genetic programming
- exact algorithms
- min max
- convex hull
- solution quality
- variable neighborhood search
- evolutionary computation
- memetic algorithm