Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty

The Binary Integer Programming problem (BIP) is a mathematical optimization problem, with linear objective function and constraints, on which the domain of all variables is {0, 1}. In BIP, every variable is associated with a determined cost coefficient. The Minmax regret Binary Integer Programming p...

Full description

Saved in:
Bibliographic Details
Published in:R.A.I.R.O. Recherche opérationnelle Vol. 56; no. 6; pp. 4281 - 4301
Main Authors: Carvalho, Iago A., Noronha, Thiago F., Duhamel, Christophe
Format: Journal Article
Language:English
Published: 01.11.2022
ISSN:0399-0559, 2804-7303
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract The Binary Integer Programming problem (BIP) is a mathematical optimization problem, with linear objective function and constraints, on which the domain of all variables is {0, 1}. In BIP, every variable is associated with a determined cost coefficient. The Minmax regret Binary Integer Programming problem under interval uncertainty (M-BIP) is a generalization of BIP in which the cost coefficient associated to the variables is not known in advance, but are assumed to be bounded by an interval. The objective of M-BIP is to find a solution that possesses the minimum maximum regret among all possible solutions for the problem. In this paper, we show that the decision version of M-BIP is Σ p 2 -complete. Furthermore, we tackle M-BIP by both exact and heuristic algorithms. We extend three exact algorithms from the literature to M-BIP and propose two fix-and-optimize heuristic algorithms. Computational experiments, performed on the Minmax regret Weighted Set Covering problem under Interval Uncertainties (M-WSCP) as a test case, indicates that one of the exact algorithms outperforms the others. Furthermore, it shows that the proposed fix-and-optimize heuristics, that can be easily employed to solve any minmax regret optimization problem under interval uncertainty, are competitive with ad-hoc algorithms for the M-WSCP.
AbstractList The Binary Integer Programming problem (BIP) is a mathematical optimization problem, with linear objective function and constraints, on which the domain of all variables is {0, 1}. In BIP, every variable is associated with a determined cost coefficient. The Minmax regret Binary Integer Programming problem under interval uncertainty (M-BIP) is a generalization of BIP in which the cost coefficient associated to the variables is not known in advance, but are assumed to be bounded by an interval. The objective of M-BIP is to find a solution that possesses the minimum maximum regret among all possible solutions for the problem. In this paper, we show that the decision version of M-BIP is Σ p 2 -complete. Furthermore, we tackle M-BIP by both exact and heuristic algorithms. We extend three exact algorithms from the literature to M-BIP and propose two fix-and-optimize heuristic algorithms. Computational experiments, performed on the Minmax regret Weighted Set Covering problem under Interval Uncertainties (M-WSCP) as a test case, indicates that one of the exact algorithms outperforms the others. Furthermore, it shows that the proposed fix-and-optimize heuristics, that can be easily employed to solve any minmax regret optimization problem under interval uncertainty, are competitive with ad-hoc algorithms for the M-WSCP.
Author Noronha, Thiago F.
Duhamel, Christophe
Carvalho, Iago A.
Author_xml – sequence: 1
  givenname: Iago A.
  orcidid: 0000-0001-9404-1329
  surname: Carvalho
  fullname: Carvalho, Iago A.
– sequence: 2
  givenname: Thiago F.
  surname: Noronha
  fullname: Noronha, Thiago F.
– sequence: 3
  givenname: Christophe
  orcidid: 0000-0001-6522-7343
  surname: Duhamel
  fullname: Duhamel, Christophe
BookMark eNotkE9LAzEUxIMoWGsvfoKchbX5v8lRilWh4EXPS3Y3WQPNZnnZSuunN8We5g3z4zHMHboe0-gQeqDkiRJJ15DWjDBGjb5CC6aJqGpO-DVaEG5MRaQ0t2iVc2gLrJUyRC7QtA3Hyo59laY5xPDrcHSz_XYHCHkOXcY-AY5hjPaIwQ3gZtyG0cIJh3F2gwM8QRrAxsIM57vdu5jxYexLdEbgx-6L7RzMtvjTPbrxdp_d6qJL9LV9-dy8VbuP1_fN867qqKC6UtQRyutW-F4Jr6W1xlKmTGc8k73yXgtvJdOq9q0hVjhNfS1Zx5ngoiB8iR7__3aQcgbnmwlCLMUbSprzXA2k5jIX_wMXjWHt
Cites_doi 10.1016/0304-3975(76)90061-X
10.1016/j.cor.2016.11.016
10.1016/j.disopt.2010.03.008
10.1080/00207543.2018.1444812
10.1109/TNNLS.2017.2682179
10.1093/biomet/52.3-4.591
10.1007/PL00011380
10.1090/S0002-9904-1962-10791-5
10.1007/s10107-010-0365-7
10.1016/S0166-218X(02)00384-0
10.1007/978-3-319-33121-8_6
10.1287/trsc.1060.0181
10.1016/j.endm.2018.01.016
10.1007/s10898-006-9074-4
10.1287/ijoc.2014.0632
10.1016/j.cor.2014.06.023
10.1007/s00291-005-0207-9
10.1007/s00291-021-00617-0
10.1016/j.ejor.2011.05.014
10.1016/j.ipl.2018.11.003
10.1007/s10288-012-0202-3
10.1007/s10479-011-0876-5
10.1016/j.ifacol.2016.07.653
10.1016/j.ifacol.2016.07.649
10.1007/s11590-014-0773-3
10.1016/j.ipl.2005.11.001
10.1007/BF01386316
10.1016/j.ejor.2008.09.012
10.1007/978-3-319-45587-7_1
10.1016/j.orl.2004.12.002
10.1051/ro/2022198
10.1007/BFb0120886
10.1287/opre.1030.0065
10.1007/BF01191202
10.1007/PL00011424
10.1016/j.ejor.2003.07.007
10.1007/978-1-4684-2001-2_9
10.1057/jors.1990.166
10.1007/11602613_79
10.1080/01621459.1937.10503522
10.1016/S0166-218X(03)00462-1
10.1016/j.cor.2016.12.010
10.1016/j.dam.2005.04.015
10.1016/j.cie.2018.11.014
10.1007/978-1-4757-2620-6
ContentType Journal Article
DBID AAYXX
CITATION
DOI 10.1051/ro/2022198
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList CrossRef
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 2804-7303
EndPage 4301
ExternalDocumentID 10_1051_ro_2022198
GroupedDBID --K
-E.
.FH
0E1
123
1B1
4.4
5VS
74X
74Y
7~V
8FE
8FG
AADXX
AAFWJ
AAOGA
AAOTM
AAYXX
ABGDZ
ABKKG
ABNSH
ABUBZ
ABZDU
ACACO
ACGFS
ACIMK
ACIWK
ACQPF
ACRPL
ACZPN
ADNMO
AEMTW
AFAYI
AFHSK
AFUTZ
AGQPQ
AJPFC
ALMA_UNASSIGNED_HOLDINGS
AMVHM
ARABE
ASPBG
AVWKF
AZPVJ
BPHCQ
C0O
CITATION
CS3
DC4
EBS
EJD
FAM
HG-
HST
HZ~
I-F
I.6
IHE
IL9
I~P
J36
J38
J3A
K60
K6V
K6~
L6V
L98
LO0
M-V
M41
NIF
O9-
OAV
P62
PQQKQ
PROAC
RCA
ROL
RPZ
RR0
S6-
WQ3
WXU
ID FETCH-LOGICAL-c1418-61e0137b4fd64f85aa9a1269c9f25d6ff84fa52867fb90a4e81f752c32434f253
ISSN 0399-0559
IngestDate Sat Nov 29 04:47:31 EST 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 6
Language English
License https://creativecommons.org/licenses/by/4.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c1418-61e0137b4fd64f85aa9a1269c9f25d6ff84fa52867fb90a4e81f752c32434f253
ORCID 0000-0001-9404-1329
0000-0001-6522-7343
OpenAccessLink https://www.rairo-ro.org/articles/ro/pdf/2022/06/ro220172.pdf
PageCount 21
ParticipantIDs crossref_primary_10_1051_ro_2022198
PublicationCentury 2000
PublicationDate 2022-11-00
PublicationDateYYYYMMDD 2022-11-01
PublicationDate_xml – month: 11
  year: 2022
  text: 2022-11-00
PublicationDecade 2020
PublicationTitle R.A.I.R.O. Recherche opérationnelle
PublicationYear 2022
References Averbakh (R8) 2004; 138
Edmonds (R32) 1962; 68
Pereira (R51) 2013; 207
Dastjerd (R27) 2019; 127
R21
Ben-Tal (R15) 2000; 88
R20
Friedman (R34) 1937; 32
R23
R22
Coco (R24) 2018; 64
Aissi (R1) 2005; 33
Lang (R48) 2011; 214
R28
Furini (R35) 2015; 27
Nemenyi (R47) 1962; 18
Montemanni (R46) 2007; 41
Assunção (R7) 2017; 81
Li (R49) 2017; 29
R2
R5
Fischetti (R33) 2010; 124
Anand (R4) 2017; 20
R6
Conde (R25) 2007; 37
Kasperski (R41) 2015; 9
Bertsimas (R16) 2004; 52
Gintner (R37) 2005; 27
Averbakh (R10) 2001; 90
Carvalho (R18) 2019; 143
R39
Lebedev (R45) 2006; 154
Dorneles (R30) 2014; 52
Garcia (R36) 2008; 9
Deineko (R29) 2010; 7
Kasperski (R42) 2006; 97
Guo (R38) 2018; 56
Benders (R14) 1962; 4
Beasley (R13) 1990; 41
Averbakh (R11) 2003; 127
Turhan (R54) 2017; 80
R40
R43
R44
Aissi (R3) 2009; 197
Cook (R26) 1992; 12
Shapiro (R52) 1965; 52
R50
Averbakh (R9) 2005; 160
Stockmeyer (R53) 1976; 3
R12
Dolgui (R31) 2012; 10
R17
Yu (R55) 2008; 4
R19
References_xml – volume: 3
  start-page: 1
  year: 1976
  ident: R53
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/0304-3975(76)90061-X
– volume: 80
  start-page: 38
  year: 2017
  ident: R54
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2016.11.016
– volume: 7
  start-page: 191
  year: 2010
  ident: R29
  publication-title: Discrete Optim.
  doi: 10.1016/j.disopt.2010.03.008
– volume: 56
  start-page: 5419
  year: 2018
  ident: R38
  publication-title: Int. J. Prod. Res.
  doi: 10.1080/00207543.2018.1444812
– volume: 29
  start-page: 1760
  year: 2017
  ident: R49
  publication-title: IEEE Trans. Neural Netw. Learn. Syst.
  doi: 10.1109/TNNLS.2017.2682179
– volume: 4
  start-page: 36
  year: 2008
  ident: R55
  publication-title: ACM Trans. Algorithms (TALG)
– volume: 52
  start-page: 591
  year: 1965
  ident: R52
  publication-title: Biometrika
  doi: 10.1093/biomet/52.3-4.591
– volume: 88
  start-page: 411
  year: 2000
  ident: R15
  publication-title: Math. Program.
  doi: 10.1007/PL00011380
– volume: 68
  start-page: 494
  year: 1962
  ident: R32
  publication-title: Bull. Am. Math. Soc.
  doi: 10.1090/S0002-9904-1962-10791-5
– volume: 124
  start-page: 175
  year: 2010
  ident: R33
  publication-title: Math. Program.
  doi: 10.1007/s10107-010-0365-7
– volume: 127
  start-page: 505
  year: 2003
  ident: R11
  publication-title: Discrete Appl. Math.
  doi: 10.1016/S0166-218X(02)00384-0
– ident: R43
  doi: 10.1007/978-3-319-33121-8_6
– ident: R5
– ident: R39
– volume: 41
  start-page: 366
  year: 2007
  ident: R46
  publication-title: Transp. Sci.
  doi: 10.1287/trsc.1060.0181
– volume: 64
  start-page: 145
  year: 2018
  ident: R24
  publication-title: Electron. Notes Discrete Math.
  doi: 10.1016/j.endm.2018.01.016
– volume: 37
  start-page: 467
  year: 2007
  ident: R25
  publication-title: J. Glob. Optim.
  doi: 10.1007/s10898-006-9074-4
– volume: 27
  start-page: 392
  year: 2015
  ident: R35
  publication-title: INFORMS J. Comput.
  doi: 10.1287/ijoc.2014.0632
– volume: 52
  start-page: 29
  year: 2014
  ident: R30
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2014.06.023
– volume: 27
  start-page: 507
  year: 2005
  ident: R37
  publication-title: OR Spectr.
  doi: 10.1007/s00291-005-0207-9
– ident: R17
  doi: 10.1007/s00291-021-00617-0
– ident: R22
– volume: 214
  start-page: 595
  year: 2011
  ident: R48
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2011.05.014
– volume: 143
  start-page: 24
  year: 2019
  ident: R18
  publication-title: Inf. Process. Lett.
  doi: 10.1016/j.ipl.2018.11.003
– volume: 10
  start-page: 181
  year: 2012
  ident: R31
  publication-title: 4OR
  doi: 10.1007/s10288-012-0202-3
– volume: 207
  start-page: 1
  year: 2013
  ident: R51
  publication-title: Ann. Oper. Res.
  doi: 10.1007/s10479-011-0876-5
– ident: R23
  doi: 10.1016/j.ifacol.2016.07.653
– ident: R19
  doi: 10.1016/j.ifacol.2016.07.649
– volume: 9
  start-page: 427
  year: 2015
  ident: R41
  publication-title: Optim. Lett.
  doi: 10.1007/s11590-014-0773-3
– volume: 97
  start-page: 177
  year: 2006
  ident: R42
  publication-title: Inf. Process. Lett.
  doi: 10.1016/j.ipl.2005.11.001
– ident: R21
– volume: 4
  start-page: 238
  year: 1962
  ident: R14
  publication-title: Numer. Math.
  doi: 10.1007/BF01386316
– ident: R28
– volume: 197
  start-page: 427
  year: 2009
  ident: R3
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2008.09.012
– volume: 20
  start-page: 623
  year: 2017
  ident: R4
  publication-title: J. Stat. Manag. Syst.
– ident: R6
  doi: 10.1007/978-3-319-45587-7_1
– volume: 33
  start-page: 634
  year: 2005
  ident: R1
  publication-title: Oper. Res. Lett.
  doi: 10.1016/j.orl.2004.12.002
– ident: R20
  doi: 10.1051/ro/2022198
– ident: R12
  doi: 10.1007/BFb0120886
– volume: 52
  start-page: 35
  year: 2004
  ident: R16
  publication-title: Oper. Res.
  doi: 10.1287/opre.1030.0065
– ident: R50
– volume: 12
  start-page: 27
  year: 1992
  ident: R26
  publication-title: Combinatorica
  doi: 10.1007/BF01191202
– volume: 9
  start-page: 2677
  year: 2008
  ident: R36
  publication-title: J. Mach. Learn. Res.
– volume: 90
  start-page: 263
  year: 2001
  ident: R10
  publication-title: Math. Program.
  doi: 10.1007/PL00011424
– volume: 160
  start-page: 227
  year: 2005
  ident: R9
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2003.07.007
– ident: R40
  doi: 10.1007/978-1-4684-2001-2_9
– volume: 18
  start-page: 263
  year: 1962
  ident: R47
  publication-title: Biometrics
– volume: 41
  start-page: 1069
  year: 1990
  ident: R13
  publication-title: J. Oper. Res. Soc.
  doi: 10.1057/jors.1990.166
– ident: R2
  doi: 10.1007/11602613_79
– volume: 32
  start-page: 675
  year: 1937
  ident: R34
  publication-title: J. Am. Stat. Assoc.
  doi: 10.1080/01621459.1937.10503522
– volume: 138
  start-page: 289
  year: 2004
  ident: R8
  publication-title: Discrete Appl. Math.
  doi: 10.1016/S0166-218X(03)00462-1
– volume: 81
  start-page: 51
  year: 2017
  ident: R7
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2016.12.010
– volume: 154
  start-page: 2167
  year: 2006
  ident: R45
  publication-title: Discrete Appl. Math.
  doi: 10.1016/j.dam.2005.04.015
– volume: 127
  start-page: 778
  year: 2019
  ident: R27
  publication-title: Comput. Ind. Eng.
  doi: 10.1016/j.cie.2018.11.014
– ident: R44
  doi: 10.1007/978-1-4757-2620-6
SSID ssib051866905
ssib051327486
ssj0003353
ssib050921426
Score 2.2497532
Snippet The Binary Integer Programming problem (BIP) is a mathematical optimization problem, with linear objective function and constraints, on which the domain of all...
SourceID crossref
SourceType Index Database
StartPage 4281
Title Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty
Volume 56
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 2804-7303
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssib051866905
  issn: 0399-0559
  databaseCode: M~E
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwELaWwgEOiKfKU5bgtkoaJ7ZjH1elKypBQdWCels5saNdqUlW6W614sCP4hcyjpOst72UA4dEieM8lPk0nrFnvkHoo1RU6VwWgQFjPKAsZ4GQTAeMGZImaZbRtiTLzy_p2Zm4uJDfR6M_fS7M9WVaVWK7lav_KmpoA2Hb1Nl_EPfwUGiAYxA67EHssL-T4KfLbaAqHdSgDMrlL2OLRKuF2fSUzDausFxWpdqOGwPe9nqcuZzcljnCNH3IVuny1Nt6M1dtudym7dLAx8Jp7mIJ1nvLwufhJDwNz8NvobVHAQ6wjeuVW413WLNhNQOYjm1lostFO117aiNCJuEwO22pFdxq1GyxtNemw7VPm4UqXXjBjhzBn78A15cM8xdd3pblQWAdL7hp22IR0QB0T-LraUdA3uHRV7rgQRFvAKeJe_ytwQH0DwjPpg9N7YcQV_56n4P7xtg4RCy2a_WMzJt63t17D92PUyatJv36-6TXYWB_WRK7wcRj4O2nVHjngnMZ7Vy0JHFMqf1f6Cl0GTlq6qPuXZ7R5Fk_syfocee24ImD21M0MtUz9Mgjs3yOVjeBh_eBhwF42AEPO-BhBzzcAQ97wMM98HALPNwDD3vAe4F-TE9mx5-Drp5HkBNKRMCJsQSXGS00p4VgSklFYi5BVcRM86IQtFAsFjwtMhkpagQpUhbnYPMnFLokL9FBVVfmEOE8Y4qLJNEy1TQiWkY5KwpOtUhFpiP-Cn3of9h85Whb5rdF-PpOvd6ghzvcvkUH62Zj3qEH-fV6edW8b6X_FwggjBs
linkProvider ISSN International Centre
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=Fix-and-optimize+metaheuristics+for+minmax+regret+binary+integer+programming+problems+under+interval+uncertainty&rft.jtitle=R.A.I.R.O.+Recherche+op%C3%A9rationnelle&rft.au=Carvalho%2C+Iago+A.&rft.au=Noronha%2C+Thiago+F.&rft.au=Duhamel%2C+Christophe&rft.date=2022-11-01&rft.issn=0399-0559&rft.eissn=2804-7303&rft.volume=56&rft.issue=6&rft.spage=4281&rft.epage=4301&rft_id=info:doi/10.1051%2Fro%2F2022198&rft.externalDBID=n%2Fa&rft.externalDocID=10_1051_ro_2022198
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0399-0559&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0399-0559&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0399-0559&client=summon