A simulated annealing metaheuristic for the bi-objective flexible job shop scheduling problem.
Dayan de C. BissoliWagner A. S. AltoéGeraldo R. MauriAndré Renato Sales AmaralPublished in: RICE (2018)
Keyphrases
- metaheuristic
- bi objective
- simulated annealing
- multi objective
- ant colony optimization
- evolutionary algorithm
- job shop scheduling problem
- genetic algorithm
- tabu search
- multi objective optimization
- optimization problems
- combinatorial optimization problems
- scatter search
- benchmark problems
- optimization algorithm
- combinatorial optimization
- solution space
- simulated annealing algorithm
- solution quality
- vehicle routing problem
- multiple objectives
- hybrid algorithm
- search methods
- genetic algorithm ga
- particle swarm optimization
- nsga ii
- differential evolution
- traveling salesman problem
- particle swarm optimization pso
- iterated local search
- hill climbing
- path relinking
- fitness function
- efficient solutions
- harmony search
- hybrid algorithms
- genetic programming
- search procedure
- network design
- benchmark instances
- objective function
- shortest path problem
- nature inspired
- set of benchmark instances
- optimal solution
- test problems
- artificial neural networks
- memetic algorithm
- neural network
- global optimization
- greedy randomized adaptive search procedure