A Comparative Study of Multiple-Objective Metaheuristics on the Bi-Objective Set Covering Problem and the Pareto Memetic Algorithm.
Andrzej JaszkiewiczPublished in: Ann. Oper. Res. (2004)
Keyphrases
- bi objective
- memetic algorithm
- set covering problem
- multiple objectives
- multi objective
- tabu search
- genetic algorithm
- multi objective optimization
- benchmark instances
- vehicle routing problem
- combinatorial optimization
- evolutionary algorithm
- metaheuristic
- simulated annealing
- particle swarm optimization
- pareto optimal
- evolutionary computation
- path relinking
- optimization algorithm
- optimization problems
- crossover operator
- variable neighborhood search
- job shop scheduling problem
- shortest path problem
- feasible solution
- nsga ii
- scheduling problem
- fitness function
- knapsack problem
- pareto local search
- heuristic methods
- search algorithm
- objective function
- branch and bound algorithm
- test problems
- combinatorial optimization problems
- branch and bound
- traveling salesman problem
- multi objective evolutionary algorithms
- differential evolution
- neural network
- ant colony optimization
- upper bound