A Hybrid of Tabu Search and Simulated Annealing Algorithms for Preemptive Project Scheduling Problem.
Behrouz Afshar-NadjafiMehdi YazdaniMahyar MajlesiPublished in: IEA/AIE (1) (2017)
Keyphrases
- tabu search
- simulated annealing
- metaheuristic
- hybrid algorithm
- benchmark problems
- test problems
- simulated annealing and tabu search
- solution quality
- scheduling problem
- benchmark instances
- hill climbing
- heuristic methods
- combinatorial optimization
- memetic algorithm
- feasible solution
- tabu search algorithm
- vehicle routing problem
- genetic algorithm ga
- optimization problems
- evolutionary algorithm
- path relinking
- job shop scheduling problem
- genetic algorithm
- graph colouring
- search procedure
- combinatorial optimization problems
- search algorithm
- optimization method
- tabu list
- iterated local search
- search heuristics
- particle swarm optimization
- solution space
- scatter search
- variable neighborhood search
- multidimensional knapsack problem
- computational complexity
- neural network