A simheuristic approach using the NSGA-II to solve a bi-objective stochastic flexible job shop problem.
Camilo Andrés Rodríguez-EspinosaEliana María González-NeiraGabriel Mauricio Zambrano-ReyPublished in: J. Simulation (2024)
Keyphrases
- bi objective
- nsga ii
- multi objective
- multi objective optimization
- constrained multi objective optimization problems
- test problems
- evolutionary algorithm
- efficient solutions
- optimization problems
- pareto optimal solutions
- multiobjective optimization
- optimization algorithm
- pareto optimal
- genetic algorithm
- multiobjective evolutionary algorithm
- multi objective evolutionary algorithms
- evolutionary multiobjective
- differential evolution
- knapsack problem
- network design
- multi objective optimization problems
- multiple objectives
- multi objective optimisation
- multi objective differential evolution
- multi objective problems
- objective function
- shortest path problem
- fitness function
- ant colony optimization
- particle swarm optimization
- uniform design
- pareto frontier
- pareto dominance
- evolutionary multiobjective optimization
- optimal solution
- job shop scheduling problem
- branch and bound algorithm
- tabu search
- strength pareto evolutionary algorithm
- simulated annealing
- upper bound