2019
DOI: 10.1063/1.5090006
|View full text |Cite
|
Sign up to set email alerts
|

Multi-objective mixed integer programming: An objective space algorithm

Abstract: This paper introduces the first objective space algorithm which can exactly find all supported and non-supported non-dominated solutions to a mixed-integer multi-objective linear program with an arbitrary number of objective functions. This algorithm is presented in three phases. First it builds up a super-set which contains the Pareto front. This super-set is then modified to not contain any intersecting polytopes. Once this is achieved, the algorithm efficiently calculates which portions of the super-set are… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(4 citation statements)
references
References 9 publications
0
4
0
Order By: Relevance
“…In another study, Pettersson and Ozlen [2019] developed an algorithm for identifying all supported and non-supported NDPs with an arbitrary number of objectives. The algorithm first identifies a super-set (which contains the EF) using Benson's method, then modifies the set of polytopes so that no two polytopes have a nonempty intersection, and finally, refines the super-set to exclude portions that are not part of the EF.…”
Section: General Casementioning
confidence: 99%
“…In another study, Pettersson and Ozlen [2019] developed an algorithm for identifying all supported and non-supported NDPs with an arbitrary number of objectives. The algorithm first identifies a super-set (which contains the EF) using Benson's method, then modifies the set of polytopes so that no two polytopes have a nonempty intersection, and finally, refines the super-set to exclude portions that are not part of the EF.…”
Section: General Casementioning
confidence: 99%
“…Pettersson and Özlen (2019a) provide the first algorithm for MOMILPs with an arbitrary number of objectives. Using a multiobjective pure integer algorithm (improved version of the algorithm provided by Özlen et al (2014), see Section 3.5, with no‐good constraints (Soylu & Yıldız, 2016, above) and slices), they find integer solutions and subsequently polytopes of feasible integer parts via Benson's method that contain the integer solutions and cover the nondominated set.…”
Section: Algorithms For Multiobjective Mixed‐integer Optimization Pro...mentioning
confidence: 99%
“…The MOMILP model is conventionally used when there is a need to solve more than two objective functions which involves both the discrete and continuous variables in the equations (Pettersson and Ozlen, 2019). This paper aims at solving two objective functions relating to economic and carbon emissions which needs to be optimized in different directions, i.e.…”
Section: Mathematical Formulationmentioning
confidence: 99%