Performance of Simulated Annealing, Tabu Search, and Evolutionary Algorithms for Multi-objective Network Partitioning.
Consolación GilRaul BañosMaria Dolores Gil MontoyaJulio GómezPublished in: Algorithmic Oper. Res. (2006)
Keyphrases
- simulated annealing
- evolutionary algorithm
- multi objective
- tabu search
- metaheuristic
- multi objective optimization
- optimization problems
- optimization algorithm
- hybrid algorithm
- genetic algorithm
- benchmark problems
- evolutionary computation
- combinatorial optimization
- feasible solution
- search procedure
- differential evolution
- genetic algorithm ga
- solution quality
- genetic programming
- heuristic methods
- multi objective optimization problems
- path relinking
- optimization method
- nsga ii
- particle swarm optimization
- job shop scheduling problem
- test problems
- iterated local search
- memetic algorithm
- fitness function
- solution space
- max sat
- hill climbing
- scatter search
- simulated annealing and tabu search
- multidimensional knapsack problem
- neighborhood search
- vehicle routing problem
- search heuristics
- tabu search algorithm
- initial solution
- quadratic assignment problem
- benchmark instances
- ant colony optimization
- crossover operator
- multi start
- differential evolution algorithm
- multi objective evolutionary algorithms
- mutation operator
- particle swarm optimization pso
- tabu list
- flowshop