Using metaheuristic compromise programming for the solution of multiple-objective scheduling problems.
Caroline GagnéMarc GravelWilson L. PricePublished in: J. Oper. Res. Soc. (2005)
Keyphrases
- metaheuristic
- multiple objectives
- tabu search
- scheduling problem
- optimal solution
- solution space
- iterated local search
- simulated annealing
- multi objective
- greedy randomized adaptive search procedure
- optimization problems
- scatter search
- ant colony optimization
- variable neighborhood search
- bi objective
- combinatorial optimization
- set of benchmark instances
- genetic algorithm
- search space
- path relinking
- ant colony optimisation
- vehicle routing problem
- constructive heuristic
- combinatorial optimization problems
- multi start
- job shop scheduling problem
- nature inspired
- flowshop
- solution quality
- particle swarm optimization
- np hard
- processing times
- evolutionary algorithm
- multi objective optimization
- benchmark instances
- search procedure
- neural network
- branch and bound algorithm
- feasible solution
- guided local search
- ant colony optimization metaheuristic
- objective function
- special case
- hybrid metaheuristic
- suboptimal solutions
- branch and bound
- aco algorithm