A review of metaheuristic algorithms for solving TSP-based scheduling optimization problems.
Bladimir ToazaDomokos Esztergár-KissPublished in: Appl. Soft Comput. (2023)
Keyphrases
- optimization problems
- metaheuristic algorithms
- metaheuristic
- combinatorial optimization
- traveling salesman problem
- ant colony optimization
- variable neighborhood search
- benchmark problems
- combinatorial optimization problems
- evolutionary algorithm
- simulated annealing
- search space
- combinatorial problems
- tabu search
- scheduling problem
- scheduling algorithm
- path relinking
- cost function
- branch and bound algorithm
- objective function
- genetic algorithm
- particle swarm optimization
- knapsack problem
- vehicle routing problem
- optimization methods
- aco algorithm
- scatter search
- optimal solution
- branch and bound
- particle swarm optimization pso
- ant colony algorithm
- job shop scheduling problem
- minimum spanning tree
- resource allocation
- graph theory
- multi objective
- precedence constraints
- special case