Finding all nondominated points of multi-objective integer programs

We develop exact algorithms for multi-objective integer programming (MIP) problems. The algorithms iteratively generate nondominated points and exclude the regions that are dominated by the previously-generated nondominated points. One algorithm generates new points by solving models with additional...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Journal of global optimization Ročník 57; číslo 2; s. 347 - 365
Hlavní autori: Lokman, Banu, Köksalan, Murat
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Boston Springer US 01.10.2013
Springer
Springer Nature B.V
Predmet:
Algorithms
Computer Science
Decision making
Experiments
Graph theory
Industrial engineering
Integer programming
Linear programming
Mathematical analysis
Mathematical models
Mathematics
Mathematics and Statistics
Methods
Objectives
Operations research
Operations Research/Decision Theory
Optimization
Real Functions
Searching
Shortest-path problems
Nondominated point
Combinatorial optimization
Multiple criteria
ISSN:0925-5001, 1573-2916
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:We develop exact algorithms for multi-objective integer programming (MIP) problems. The algorithms iteratively generate nondominated points and exclude the regions that are dominated by the previously-generated nondominated points. One algorithm generates new points by solving models with additional binary variables and constraints. The other algorithm employs a search procedure and solves a number of models to find the next point avoiding any additional binary variables. Both algorithms guarantee to find all nondominated points for any MIP problem. We test the performance of the algorithms on randomly-generated instances of the multi-objective knapsack, multi-objective shortest path and multi-objective spanning tree problems. The computational results show that the algorithms work well.
Bibliografia:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0925-5001
1573-2916
DOI:10.1007/s10898-012-9955-7