A two-stage approach for bi-objective integer linear programming

We present a new exact approach for solving bi-objective integer linear programs. The new approach employs two of the existing exact algorithms in the literature, including the balanced box and the ϵ-constraint methods, in two stages. A computationally study shows that the new approach has three des...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Operations research letters Ročník 46; číslo 1; s. 81 - 87
Hlavní autoři:	Dai, Rui, Charkhgard, Hadi
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 01.01.2018
Témata:	[formula omitted]-constraint method Balanced box method Bi-objective integer linear programming Two-stage approach Balanced box method Bi-objective integer linear programming ϵ-constraint method Two-stage approach
ISSN:	0167-6377, 1872-7468
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	We present a new exact approach for solving bi-objective integer linear programs. The new approach employs two of the existing exact algorithms in the literature, including the balanced box and the ϵ-constraint methods, in two stages. A computationally study shows that the new approach has three desirable characteristics. (1) It solves less single-objective integer linear programs. (2) Its solution time is significantly smaller. (3) It is competitive with the two-stage algorithm proposed by Leitner et al. (2016). •We develop a new exact method for bi-objective integer linear programming.•The new method is a two-stage approach.•The new method employs the balanced box method in the first stage.•The new method employs the epsilon constraint method in the second stage.•The new method is faster than both the balanced box and epsilon constraint methods.
ISSN:	0167-6377 1872-7468
DOI:	10.1016/j.orl.2017.11.011