EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
2521. On the accurate detection of the Pareto frontier for bi-objective mixed integer linear problems
Invited abstract in session WA-37: Multiobjective Combinatorial Optimization, stream Multiobjective Optimization.
Wednesday, 8:30-10:00Room: 33 (building: 306)
Authors (first author is the speaker)
| 1. | Lavinia Amorosi
|
| Statistical Sciences, Sapienza | |
| 2. | Marianna De Santis
|
| University of Florence |
Abstract
In this talk, we focus on bi-objective mixed integer linear programming problems (BOMILPs). Due to their structure, the detection of their Pareto frontier can be hard to compute from an accuracy perspective.
We propose a new criterion space algorithm able to deal with this difficulty, detecting the exact non dominated set of a BOMILP.
The algorithm alternates the resolution of single objective mixed integer linear problems and bi-objective linear problems.
During its execution a filtering procedure, based on a tree data-structure called BoT (bi-objective tree), stores in ordered manner all non-dominated points and segments found.
The performance of the algorithm is further improved by the use of suitably defined cuts.
Experimental results on a testbed of instances and a comparison with an existing algorithm will be presented.
Keywords
- Programming, Multi-Objective
- Programming, Mixed-Integer
Status: accepted
Back to the list of papers