aPaRT: A Fast Meta-Heuristic Algorithm using Path-Relinking and Tabu Search for Allocating Machines to Operations in FJSP Problem.
Hamid JazayeriySahar BakhtarMojtaba ValinatajPublished in: Inteligencia Artif. (2018)
Keyphrases
- tabu search
- path relinking
- meta heuristic algorithm
- metaheuristic
- simulated annealing
- harmony search
- flowshop
- scatter search
- job shop scheduling problem
- optimization problems
- feasible solution
- ant colony optimization
- hybrid algorithm
- memetic algorithm
- genetic algorithm
- combinatorial optimization problems
- vehicle routing problem
- combinatorial optimization
- search space
- multi start
- search procedure
- test problems
- nature inspired
- hybrid metaheuristic
- initial solution
- scheduling problem
- heuristic methods
- solution space
- optimal solution
- iterated local search
- neighborhood search
- variable neighborhood search
- benchmark problems
- hill climbing
- particle swarm optimization
- optimization method
- benchmark instances
- search algorithm
- evolutionary algorithm
- test instances
- job shop scheduling
- solution quality
- lower bound
- computational complexity
- branch and bound algorithm