A variable neighborhood search based genetic algorithm for flexible job shop scheduling problem.
Guohui ZhangLingjie ZhangXiaohui SongYongcheng WangChi ZhouPublished in: Clust. Comput. (2019)
Keyphrases
- variable neighborhood search
- job shop scheduling problem
- benchmark instances
- genetic algorithm
- tabu search
- metaheuristic
- multi objective
- hybrid metaheuristic
- simulated annealing
- traveling salesman problem
- memetic algorithm
- heuristic methods
- scheduling problem
- path relinking
- vehicle routing problem
- benchmark problems
- routing problem
- scatter search
- optimization problems
- evolutionary algorithm
- hybrid method
- test problems
- combinatorial optimization
- feasible solution
- search procedure
- solution space
- neural network
- minimum spanning tree
- ant colony optimization
- graph model
- multi objective optimization
- hybrid algorithm
- differential evolution
- fitness function
- combinatorial optimization problems
- particle swarm optimization
- evolutionary computation
- upper bound
- optimization algorithm
- bi objective
- search space
- genetic programming
- search algorithm
- ad hoc networks