A variable neighborhood search and simulated annealing hybrid for the profile minimization problem.
Gintaras PalubeckisPublished in: Comput. Oper. Res. (2017)
Keyphrases
- variable neighborhood search
- simulated annealing
- tabu search
- metaheuristic
- neighborhood search
- search procedure
- combinatorial optimization
- path relinking
- benchmark instances
- genetic algorithm
- ant colony optimization
- evolutionary algorithm
- hill climbing
- hybrid algorithm
- benchmark problems
- minimum spanning tree
- memetic algorithm
- job shop scheduling problem
- optimization method
- genetic algorithm ga
- solution quality
- solution space
- scatter search
- hybrid method
- particle swarm optimization pso
- traveling salesman problem
- heuristic methods
- vehicle routing problem
- combinatorial optimization problems
- feasible solution
- single machine scheduling problem
- objective function
- combinatorial problems
- optimization problems
- routing problem
- spanning tree