2018
DOI: 10.1016/j.ejor.2017.09.026
|View full text |Cite
|
Sign up to set email alerts
|

A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
11
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 22 publications
(11 citation statements)
references
References 12 publications
0
11
0
Order By: Relevance
“…The augmented epsilon-constraint (AUGMECON) method by Mavrotas [18], its improved version (AUGMECON2) by Mavrotas and Florios [19] proposes solution methods to find a set of exact solutions in multi-objective problems by adding slack variables into the objective functions that are taken as constraints and penalty term into the main objective function. Fattahi and Turkay [20] presents a novel one-direction search (ODS) method to find an exact non-dominated frontier of bi-objective MILPs. Moreover, multi-objective evolutionary algorithms (MOEAs) are widely used in getting solutions for large-scale real-life problems.…”
Section: Literature Reviewmentioning
confidence: 99%
See 1 more Smart Citation
“…The augmented epsilon-constraint (AUGMECON) method by Mavrotas [18], its improved version (AUGMECON2) by Mavrotas and Florios [19] proposes solution methods to find a set of exact solutions in multi-objective problems by adding slack variables into the objective functions that are taken as constraints and penalty term into the main objective function. Fattahi and Turkay [20] presents a novel one-direction search (ODS) method to find an exact non-dominated frontier of bi-objective MILPs. Moreover, multi-objective evolutionary algorithms (MOEAs) are widely used in getting solutions for large-scale real-life problems.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Constraints (16) specify that the customer can be assigned to transfer point only if there is an arc connecting the transfer point and customer. Constraints 17- (20) are the variables domain.…”
Section: B Model Formulationmentioning
confidence: 99%
“…There are a few papers for finding all ND points of MOILPs; for instance, Ehrgott (2006), Ozlen and Azizoglu (2009), Jorge (2009), Przybylski et al (2010), Lokman and Köksalan (2013), Mavrotas and Florios (2013), and Ozlen et al (2014) propose algorithms for solving MOILPs. A small number of studies exist in the literature with exact solution approach for finding the ND points of MOMILPs when the number of objective functions is greater than two (see Vincent et al (2013), Belotti et al (2013), Stidsen et al (2014), Boland et al (2015), Soylu and Yıldız (2016), and Fattahi and Turkay (2018) for solving bi-objective MILPs). We use the Generator of ND and Efficient Frontier (GoNDEF) method that ensures finding all or a large proportion of ND points for MOMILPs (Rasmi and Türkay, 2019).…”
Section: Finding Non-dominated Pointsmentioning
confidence: 99%
“…However, fortunately, since a few algorithms have been recently developed for finding a full representation of the nondominated frontier of bi-objective mixed integer linear programs (see for instance Boland et al (2015b), Fattahi and Turkay (2018), Soylu and Yıldız (2016), and Vincent et al (2013)), generating an exact algorithm for optimizing a linear function over the efficient set of bi-objective mixed integer linear programs should now be possible.…”
Section: Introductionmentioning
confidence: 99%