Challenges of convex quadratic bi-objective benchmark problems.
Tobias GlasmachersPublished in: GECCO (2019)
Keyphrases
- benchmark problems
- bi objective
- convex quadratic
- efficient solutions
- simulated annealing
- test problems
- multi objective
- optimization problems
- nsga ii
- inequality constraints
- job shop scheduling problem
- ant colony optimization
- network design
- multi objective optimization
- multiple objectives
- shortest path problem
- optimisation problems
- evolutionary algorithm
- vehicle routing problem
- knapsack problem
- constrained optimization
- network architecture
- genetic programming
- cost function