Finding representations for an unconstrained bi-objective combinatorial optimization problem.
Alexandre D. JesusLuís PaqueteJosé Rui FigueiraPublished in: Optim. Lett. (2018)
Keyphrases
- combinatorial optimization
- bi objective
- combinatorial optimization problems
- metaheuristic
- traveling salesman problem
- ant colony optimization
- multi objective
- optimization problems
- simulated annealing
- efficient solutions
- branch and bound
- combinatorial problems
- mathematical programming
- branch and bound algorithm
- shortest path problem
- multi objective optimization
- network design
- multiple objectives
- memetic algorithm
- knapsack problem
- single machine scheduling problem
- vehicle routing problem
- set covering problem
- hard combinatorial optimization problems
- routing problem
- nsga ii
- quadratic assignment problem
- max flow min cut