Using goal programming on estimated Pareto fronts to solve multiobjective problems
Modern multiobjective algorithms can be computationally inefficient in producing good approximation sets for highly constrained many-objective problems. Such problems are common in real-world applications where decision-makers need to assess multiple conflicting objectives. Also, different instances...
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2018
|
| Online Access: | https://eprints.nottingham.ac.uk/48610/ |