Advancing local search approximations for multiobjective combinatorial optimization problems.
Lakmali WeerasenaPublished in: J. Comb. Optim. (2022)
Keyphrases
- combinatorial optimization problems
- multi objective
- combinatorial optimization
- evolutionary algorithm
- job shop scheduling problem
- optimization problems
- metaheuristic
- genetic algorithm
- simulated annealing
- knapsack problem
- artificial bee colony
- multi objective optimization
- objective function
- optimization algorithm
- ant colony optimization
- discrete optimization
- tabu search
- multiobjective optimization
- particle swarm optimization
- traveling salesman problem
- multiple objectives
- memetic algorithm
- optimal solution
- shortest path problem
- job shop scheduling
- vehicle routing problem
- continuous optimization problems
- nsga ii
- branch and bound
- uniform design
- search algorithm
- search space
- bi objective
- aco algorithm
- selection operator
- evolutionary computation
- pareto optimal
- multiobjective genetic algorithm
- aco algorithms
- linear programming
- min cost
- estimation of distribution algorithms
- genetic programming
- fitness function
- swarm intelligence
- search strategies
- test problems
- search procedure
- minmax regret
- branch and bound algorithm