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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Operations research letters Jg. 46; H. 1; S. 81 - 87
Hauptverfasser: Dai, Rui, Charkhgard, Hadi
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 01.01.2018
Schlagworte:
[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
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract 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.
AbstractList 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.
Author Charkhgard, Hadi
Dai, Rui
Author_xml – sequence: 1
  givenname: Rui
  surname: Dai
  fullname: Dai, Rui
– sequence: 2
  givenname: Hadi
  surname: Charkhgard
  fullname: Charkhgard, Hadi
  email: hcharkhgard@usf.edu
BookMark eNp9kLFOwzAURS1UJNrCB7DlBxLei1M7EQtVBQWpEgvMluM8B0dpXDlWEX9PqjIxdLrLPVe6Z8Fmgx-IsXuEDAHFQ5f50Gc5oMwQM0C8YnMsZZ7KQpQzNp86MhVcyhu2GMcOAGSJ5Zw9rZP47dMx6pYSfTgEr81XYn1Iapf6uiMT3ZESN0RqKSS9G0iHZKq1Qe_3bmhv2bXV_Uh3f7lkny_PH5vXdPe-fdusd6nheRXTwhY1iUKvUIqcg4QVApAETrLitTA5Wmxq4nJlREm1EQ1YqBpb2aaoQGq-ZHjeNcGPYyCrDsHtdfhRCOqkQHVqUqBOChSimhRMjPzHGBd1dH6IQbv-Ivl4Jmm6dHQU1GgcDYYaFyYlqvHuAv0LlOh4ag
CitedBy_id crossref_primary_10_1016_j_cor_2021_105298
crossref_primary_10_1007_s12351_024_00820_1
crossref_primary_10_1016_j_disopt_2025_100903
crossref_primary_10_1007_s00186_023_00843_y
crossref_primary_10_1111_ecog_05717
crossref_primary_10_3390_w10111545
crossref_primary_10_1007_s10479_019_03317_9
crossref_primary_10_1109_ACCESS_2023_3307396
crossref_primary_10_1007_s11590_024_02100_5
crossref_primary_10_1002_mcda_1780
crossref_primary_10_1111_itor_13180
Cites_doi 10.1016/j.cor.2016.02.006
10.1287/ijoc.2015.0657
10.1007/s10479-006-0058-z
10.1016/0377-2217(86)90093-7
10.1016/j.cor.2012.02.021
10.1016/j.orl.2006.03.019
ContentType Journal Article
Copyright 2017 Elsevier B.V.
Copyright_xml – notice: 2017 Elsevier B.V.
DBID AAYXX
CITATION
DOI 10.1016/j.orl.2017.11.011
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Sciences (General)
EISSN 1872-7468
EndPage 87
ExternalDocumentID 10_1016_j_orl_2017_11_011
S0167637717302250
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
123
1B1
1OL
1RT
1~.
1~5
29N
4.4
457
4G.
4R4
5VS
7-5
71M
8P~
9JN
9JO
AAAKF
AAAKG
AACTN
AAEDT
AAEDW
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AARIN
AAXUO
ABAOU
ABFNM
ABJNI
ABMAC
ABUCO
ABXDB
ABYKQ
ACAZW
ACDAQ
ACGFS
ACNCT
ACRLP
ADBBV
ADEZE
ADGUI
ADIYS
ADMUD
AEBSH
AEKER
AENEX
AFFNX
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AIEXJ
AIGVJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
APLSM
ARUGR
ASPBG
AVWKF
AXJTR
AZFZN
BKOJK
BLXMC
CS3
DU5
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-Q
GBLVA
HAMUX
HVGLF
HZ~
IHE
J1W
KOM
LY1
M41
MHUIS
MO0
MS~
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
Q38
R2-
RIG
ROL
RPZ
SDF
SDG
SDS
SES
SEW
SPC
SPCBC
SSB
SSD
SSW
SSZ
T5K
TN5
WH7
WUQ
XPP
XSW
~G-
9DU
AATTM
AAXKI
AAYWO
AAYXX
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
AEIPS
AEUPX
AFJKZ
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
CITATION
EFKBS
~HD
ID FETCH-LOGICAL-c329t-4f4be64a5176230705100e703e793b6c21f1dbe375c68ebc6d0f09df9fd4907a3
ISICitedReferencesCount 13
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000425203900015&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0167-6377
IngestDate Sat Nov 29 02:30:18 EST 2025
Tue Nov 18 21:53:12 EST 2025
Fri Feb 23 02:30:13 EST 2024
IsPeerReviewed true
IsScholarly true
Issue 1
Keywords Balanced box method
Bi-objective integer linear programming
ϵ-constraint method
Two-stage approach
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c329t-4f4be64a5176230705100e703e793b6c21f1dbe375c68ebc6d0f09df9fd4907a3
PageCount 7
ParticipantIDs crossref_primary_10_1016_j_orl_2017_11_011
crossref_citationtrail_10_1016_j_orl_2017_11_011
elsevier_sciencedirect_doi_10_1016_j_orl_2017_11_011
PublicationCentury 2000
PublicationDate January 2018
2018-01-00
PublicationDateYYYYMMDD 2018-01-01
PublicationDate_xml – month: 01
  year: 2018
  text: January 2018
PublicationDecade 2010
PublicationTitle Operations research letters
PublicationYear 2018
Publisher Elsevier B.V
Publisher_xml – name: Elsevier B.V
References Chankong, Haimes (b3) 1983
Leitner, Ljubi, Sinnl, Werner (b6) 2016; 72
Hamacher, Pedersen, Ruzika (b5) 2007; 35
Dächert, Gorski, Klamroth (b4) 2012; 39
Chalmet, Lemonidis, Elzinga (b2) 1986; 25
Boland, Charkhgard, Savelsbergh (b1) 2015; 27
Ralphs, Saltzman, Wiecek (b7) 2006; 147
Leitner (10.1016/j.orl.2017.11.011_b6) 2016; 72
Chankong (10.1016/j.orl.2017.11.011_b3) 1983
Hamacher (10.1016/j.orl.2017.11.011_b5) 2007; 35
Boland (10.1016/j.orl.2017.11.011_b1) 2015; 27
Ralphs (10.1016/j.orl.2017.11.011_b7) 2006; 147
Dächert (10.1016/j.orl.2017.11.011_b4) 2012; 39
Chalmet (10.1016/j.orl.2017.11.011_b2) 1986; 25
References_xml – volume: 39
  start-page: 2929
  year: 2012
  end-page: 2943
  ident: b4
  article-title: An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems
  publication-title: Comput. Oper. Res.
– volume: 27
  start-page: 735
  year: 2015
  end-page: 754
  ident: b1
  article-title: A criterion space search algorithm for biobjective integer programming: The balanced box method
  publication-title: INFORMS J. Comput.
– year: 1983
  ident: b3
  publication-title: Multiobjective Decision Making: Theory and Methodology
– volume: 72
  start-page: 128
  year: 2016
  end-page: 146
  ident: b6
  article-title: ILP heuristics and a new exact method for bi-objective 0/1 ILPs: Application to FTTx-network design
  publication-title: Comput. Oper. Res.
– volume: 35
  start-page: 336
  year: 2007
  end-page: 344
  ident: b5
  article-title: Finding representative systems for discrete bicriterion optimization problems
  publication-title: Oper. Res. Lett.
– volume: 147
  start-page: 43
  year: 2006
  end-page: 70
  ident: b7
  article-title: An improved algorithm for solving biobjective integer programs
  publication-title: Ann. Oper. Res.
– volume: 25
  start-page: 292
  year: 1986
  end-page: 300
  ident: b2
  article-title: An algorithm for bi-criterion integer programming problem
  publication-title: European J. Oper. Res.
– volume: 72
  start-page: 128
  year: 2016
  ident: 10.1016/j.orl.2017.11.011_b6
  article-title: ILP heuristics and a new exact method for bi-objective 0/1 ILPs: Application to FTTx-network design
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2016.02.006
– volume: 27
  start-page: 735
  issue: 4
  year: 2015
  ident: 10.1016/j.orl.2017.11.011_b1
  article-title: A criterion space search algorithm for biobjective integer programming: The balanced box method
  publication-title: INFORMS J. Comput.
  doi: 10.1287/ijoc.2015.0657
– volume: 147
  start-page: 43
  year: 2006
  ident: 10.1016/j.orl.2017.11.011_b7
  article-title: An improved algorithm for solving biobjective integer programs
  publication-title: Ann. Oper. Res.
  doi: 10.1007/s10479-006-0058-z
– volume: 25
  start-page: 292
  year: 1986
  ident: 10.1016/j.orl.2017.11.011_b2
  article-title: An algorithm for bi-criterion integer programming problem
  publication-title: European J. Oper. Res.
  doi: 10.1016/0377-2217(86)90093-7
– year: 1983
  ident: 10.1016/j.orl.2017.11.011_b3
– volume: 39
  start-page: 2929
  year: 2012
  ident: 10.1016/j.orl.2017.11.011_b4
  article-title: An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2012.02.021
– volume: 35
  start-page: 336
  year: 2007
  ident: 10.1016/j.orl.2017.11.011_b5
  article-title: Finding representative systems for discrete bicriterion optimization problems
  publication-title: Oper. Res. Lett.
  doi: 10.1016/j.orl.2006.03.019
SSID ssj0007818
Score 2.2360206
Snippet 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...
SourceID crossref
elsevier
SourceType Enrichment Source
Index Database
Publisher
StartPage 81
SubjectTerms [formula omitted]-constraint method
Balanced box method
Bi-objective integer linear programming
Two-stage approach
Title A two-stage approach for bi-objective integer linear programming
URI https://dx.doi.org/10.1016/j.orl.2017.11.011
Volume 46
WOSCitedRecordID wos000425203900015&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1872-7468
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0007818
  issn: 0167-6377
  databaseCode: AIEXJ
  dateStart: 19950201
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1NT9tAEF2lwKE9VHxV0FK0hx6g0SLbu_F6b0QViFIJEKVSbpa9H5A0dSITKD-_s961MVBQqcTFiqxs4sy8vB2PZ94g9MlAxMZFZIjJTE4YZ4oIpjmRQahUaGikjKmGTfCjo2QwECedzre6F-Z6zIsiubkR0xd1NZwDZ9vW2We4u_lQOAGvwelwBLfD8Z8c3-_Ofk8IBH3nulEMd0WZQzLJR47gnEyELrs2yrRq165M61e9kflw9XiqS18r51WBLrrjqgGoNY--qgc4vRq2KgXKnxfnmSuaB2obtlMLYXIvtfCw58WlIIFaY-qHr2hHmwmHOJ25ATk1r_rUYhs_jiTdjJY72-0DInc5hdHOpLTPh0K-Y6VWPS3f1cf-bi_IXk8IZAXsFLxC8xHvCWDp-f7XvcFhszHzpEr3Nj-gfshdlfvd-6K_hymt0ONsEb319wy473y9hDq6WEZvWkqSy2jJc_Ql3vJC4tsraLePGyjgGgoYoIDbUMAeCthBAbegsIp-7O-dfTkgfmIGkTQSM8IMy3XMsl4Ie5xlc2DcQAOpa6DhPJZRaEKVa8p7Mk50LmMVmEAoI4xiIuAZfYfmikmh1xBWVEvbXSsjqoHXRZJJRbkVtFOMMp2to6A2UCq9nLydajJO67rBUQo2Ta1N4TYzBZuuo8_NkqnTUnnqzay2euqDQRfkpQCRx5e9_79lH9Dr2z_ABpqblVf6I1qQ17PhZbnpgfQHTZyBwA
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+two-stage+approach+for+bi-objective+integer+linear+programming&rft.jtitle=Operations+research+letters&rft.au=Dai%2C+Rui&rft.au=Charkhgard%2C+Hadi&rft.date=2018-01-01&rft.pub=Elsevier+B.V&rft.issn=0167-6377&rft.eissn=1872-7468&rft.volume=46&rft.issue=1&rft.spage=81&rft.epage=87&rft_id=info:doi/10.1016%2Fj.orl.2017.11.011&rft.externalDocID=S0167637717302250
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0167-6377&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0167-6377&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0167-6377&client=summon