An elitist nondominated sorting hybrid algorithm for multi-objective flexible job-shop scheduling problem with sequence-dependent setups.
Z. C. LiB. QianR. HuL. L. ChangJ. B. YangPublished in: Knowl. Based Syst. (2019)
Keyphrases
- multi objective
- hybrid algorithm
- particle swarm optimization
- evolutionary algorithm
- pareto optimal
- differential evolution
- nsga ii
- pareto optimal solutions
- simulated annealing
- genetic algorithm
- multiobjective optimization
- optimization algorithm
- multi objective optimization
- particle swarm optimization pso
- optimization method
- multiple objectives
- hybrid optimization algorithm
- particle swarm
- pso algorithm
- ant colony optimization
- artificial bee colony algorithm
- evolutionary computation
- standard test problems
- ant algorithm
- particle swarm optimization algorithm
- objective function
- hybrid method
- hybrid particle swarm optimization
- mutation operator
- tabu search
- optimal solution
- particle swarm algorithm
- global optimization
- initial population
- bi objective
- fitness function
- multi objective evolutionary algorithms
- premature convergence
- evolution strategy
- swarm intelligence
- metaheuristic
- imperialist competitive algorithm
- hybrid algorithms
- optimization problems
- global search
- particle swarm optimizer
- convergence speed
- nonlinear integer programming
- neural network
- computational complexity
- test problems