Learning to project in a criterion space search algorithm: an application to multi-objective binary linear programming
In this paper, we investigate the possibility of improving the performance of multi-objective optimization solution approaches using machine learning techniques. Specifically, we focus on multi-objective binary linear programs and employ one of the most effective and recently developed criterion spa...
Gespeichert in:
| Veröffentlicht in: | Optimization letters Jg. 18; H. 9; S. 2051 - 2078 |
|---|---|
| Hauptverfasser: | , , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Berlin/Heidelberg
Springer Berlin Heidelberg
01.12.2024
|
| Schlagworte: | |
| ISSN: | 1862-4472, 1862-4480 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | In this paper, we investigate the possibility of improving the performance of multi-objective optimization solution approaches using machine learning techniques. Specifically, we focus on multi-objective binary linear programs and employ one of the most effective and recently developed criterion space search algorithms, the so-called KSA, during our study. This algorithm computes all nondominated points of a problem with
p
objectives by searching on a projected criterion space, i.e., a
(
p
-
1
)
-dimensional criterion apace. We present an effective and fast learning approach to identify on which projected space the KSA should work. We also present several generic features/variables that can be used in machine learning techniques for identifying the best projected space. Finally, we present an effective bi-objective optimization-based heuristic for selecting the subset of the features to overcome the issue of overfitting in learning. Through an extensive computational study over 2000 instances of tri-objective knapsack and assignment problems, we demonstrate that an improvement of up to 18% in time can be achieved by the proposed learning method compared to a random selection of the projected space. To show that the performance of our algorithm is not limited to instances of knapsack and assignment problems with three objective functions, we also report similar performance results when the proposed learning approach is used for solving random binary integer program instances with four objective functions. |
|---|---|
| AbstractList | In this paper, we investigate the possibility of improving the performance of multi-objective optimization solution approaches using machine learning techniques. Specifically, we focus on multi-objective binary linear programs and employ one of the most effective and recently developed criterion space search algorithms, the so-called KSA, during our study. This algorithm computes all nondominated points of a problem with
p
objectives by searching on a projected criterion space, i.e., a
(
p
-
1
)
-dimensional criterion apace. We present an effective and fast learning approach to identify on which projected space the KSA should work. We also present several generic features/variables that can be used in machine learning techniques for identifying the best projected space. Finally, we present an effective bi-objective optimization-based heuristic for selecting the subset of the features to overcome the issue of overfitting in learning. Through an extensive computational study over 2000 instances of tri-objective knapsack and assignment problems, we demonstrate that an improvement of up to 18% in time can be achieved by the proposed learning method compared to a random selection of the projected space. To show that the performance of our algorithm is not limited to instances of knapsack and assignment problems with three objective functions, we also report similar performance results when the proposed learning approach is used for solving random binary integer program instances with four objective functions. |
| Author | Dayarian, Iman Javadi, Sorna Charkhgard, Hadi Eshragh, Ali Sierra-Altamiranda, Alvaro |
| Author_xml | – sequence: 1 givenname: Alvaro surname: Sierra-Altamiranda fullname: Sierra-Altamiranda, Alvaro organization: Department of Industrial and Management Systems Engineering, University of South Florida – sequence: 2 givenname: Hadi orcidid: 0000-0001-5416-6960 surname: Charkhgard fullname: Charkhgard, Hadi email: hcharkhgard@usf.edu organization: Department of Industrial and Management Systems Engineering, University of South Florida – sequence: 3 givenname: Iman surname: Dayarian fullname: Dayarian, Iman organization: Culverhouse College of Business, The University of Alabama – sequence: 4 givenname: Ali surname: Eshragh fullname: Eshragh, Ali organization: Carey Business School, Johns Hopkins University – sequence: 5 givenname: Sorna surname: Javadi fullname: Javadi, Sorna organization: Department of Industrial and Management Systems Engineering, University of South Florida |
| BookMark | eNp9UMtOwzAQtFCRaAs_wMk_YLCdl80NVbykSFzgbDmOk7pK7MhOK_H3bCjiyGG1q92Z2dFs0MoHbxG6ZfSOUVrdJ8YKSQnlORRsSHGB1kyUnOS5oKu_ueJXaJPSgdKSMSnX6FRbHb3zPZ4DnmI4WDNj57HGJrrZRhc8TpM2FicAmj3WQx_gsh8fsAbYNA3O6HmBgcB4HGZHQrOouJPFjfM6fuHBeSAv8n3U4wjfrtFlp4dkb377Fn0-P33sXkn9_vK2e6yJ4TmfSdu1Gc26VhjJWzDMRFeKssmshJVphTWFzBrNjeGUyUow3lBWlZpZIzpmebZF_KxrYkgp2k5N0Y3gSTGqluTUOTkFyamf5FQBpOxMSgD2vY3qEI7Rg8__WN8xVHXP |
| Cites_doi | 10.1287/ijoc.2015.0657 10.1287/ijoc.2016.0723 10.1017/S1446181118000275 10.1111/itor.12692 10.1016/j.ejor.2016.02.037 10.1016/j.ejor.2018.10.034 10.1007/s10957-013-0364-y 10.1016/j.ejor.2016.03.035 10.1016/j.eswa.2007.01.029 10.1016/j.ejor.2013.08.001 10.1287/mnsc.1100.1248 10.1016/j.ejor.2008.10.023 10.1023/A:1010933404324 10.1613/jair.4726 10.1007/s12532-015-0093-3 10.1111/j.2517-6161.1996.tb02080.x 10.1007/s10462-011-9290-2 10.1016/j.cor.2016.03.001 10.1016/j.orl.2017.11.011 10.1016/j.ejor.2020.07.063 10.1016/j.ejor.2016.05.029 10.1007/s10288-019-00429-7 10.1007/s10898-012-9955-7 10.1016/j.ejor.2017.01.032 10.1007/s10288-017-0354-2 10.1287/ijoc.2018.0851 10.1613/jair.2490 10.1007/978-3-642-21581-0_33 10.1007/978-3-540-74970-7_50 10.1007/978-3-7908-2604-3_16 10.1145/1102351.1102444 10.1609/aaai.v24i1.7565 10.1007/978-3-642-29828-8_23 10.1007/978-3-642-46618-2_15 10.1007/978-3-642-02777-2_31 10.1145/1015330.1015341 10.24963/ijcai.2017/92 10.1609/aaai.v30i1.10080 10.1007/978-3-642-13520-0_23 10.1016/S0065-2458(08)60520-3 |
| ContentType | Journal Article |
| Copyright | The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2024. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law. |
| Copyright_xml | – notice: The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2024. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law. |
| DBID | AAYXX CITATION |
| DOI | 10.1007/s11590-024-02100-5 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Mathematics |
| EISSN | 1862-4480 |
| EndPage | 2078 |
| ExternalDocumentID | 10_1007_s11590_024_02100_5 |
| GroupedDBID | -5D -5G -BR -EM -Y2 -~C .VR 06D 0R~ 0VY 123 1N0 203 2J2 2JN 2JY 2KG 2KM 2LR 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5VS 67Z 6NX 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBXA ABDZT ABECU ABFTV ABHQN ABJNI ABJOX ABKCH ABMNI ABMQK ABNWP ABQBU ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACSNA ACZOJ ADHHG ADHIR ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFQL AEGAL AEGNC AEJHL AEJRE AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFGCZ AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARMRJ AXYYD AYJHY B-. BA0 BAPOH BDATZ BGNMA BSONS CAG COF CS3 CSCUP DDRTE DNIVK DPUIP DU5 EBLON EBS EIOEI EJD ESBYG FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 GQ8 GXS H13 HF~ HG5 HG6 HLICF HMJXF HQYDN HRMNR HZ~ IJ- IKXTQ IWAJR IXC IXD IXE IZIGR IZQ I~X I~Z J-C J0Z J9A JBSCW JCJTX JZLTJ KDC KOV LLZTM M4Y MA- N9A NPVJJ NQJWS NU0 O9- O93 O9J OAM P2P P9M PF0 PT4 QOS R89 R9I ROL RPX RSV S16 S1Z S27 S3B SAP SDH SHX SISQX SJYHP SMT SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 TSG TSK TSV TUC U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 Z7R Z7Y Z83 Z88 ZMTXR ~A9 AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC AEZWR AFDZB AFHIU AFOHR AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION |
| ID | FETCH-LOGICAL-c242t-dfd303fd8c92d11918f686b3e9d8ccd8ec593ba2cc20197812b0176a1ec8f1e23 |
| IEDL.DBID | RSV |
| ISICitedReferencesCount | 1 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001186446400001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1862-4472 |
| IngestDate | Sat Nov 29 02:44:14 EST 2025 Fri Feb 21 02:37:19 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 9 |
| Keywords | Binary linear program Learning to project Criterion space search algorithm Multiple objective programming Machine learning |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c242t-dfd303fd8c92d11918f686b3e9d8ccd8ec593ba2cc20197812b0176a1ec8f1e23 |
| ORCID | 0000-0001-5416-6960 |
| PageCount | 28 |
| ParticipantIDs | crossref_primary_10_1007_s11590_024_02100_5 springer_journals_10_1007_s11590_024_02100_5 |
| PublicationCentury | 2000 |
| PublicationDate | 20241200 2024-12-00 |
| PublicationDateYYYYMMDD | 2024-12-01 |
| PublicationDate_xml | – month: 12 year: 2024 text: 20241200 |
| PublicationDecade | 2020 |
| PublicationPlace | Berlin/Heidelberg |
| PublicationPlace_xml | – name: Berlin/Heidelberg |
| PublicationTitle | Optimization letters |
| PublicationTitleAbbrev | Optim Lett |
| PublicationYear | 2024 |
| Publisher | Springer Berlin Heidelberg |
| Publisher_xml | – name: Springer Berlin Heidelberg |
| References | Charkhgard, Eshragh (CR10) 2019; 61 Özlen, Burton, MacRae (CR29) 2013; 160 Xu, Hutter, Hoos, Leyton-Brown (CR46) 2008; 32 Prinzie, Van den Poel (CR32) 2008; 34 Özpeynirci, Köksalan (CR30) 2010; 56 Boland, Charkhgard, Savelsbergh (CR3) 2015; 27 Hutter, Hoos, Stützle (CR17) 2007; 7 CR37 CR36 Crammer, Singer (CR13) 2001; 2 CR35 CR34 Breiman (CR9) 2001; 45 Boland, Charkhgard, Savelsbergh (CR6) 2017; 260 CR8 CR49 CR48 Alvarez, Louveaux, Wehenkel (CR1) 2017; 29 Dai, Charkhgard (CR15) 2018; 46 Özlen, Azizoğlu (CR28) 2009; 199 CR47 CR45 CR44 CR40 Tibshirani (CR43) 1996; 58 Dächert, Klamroth, Lacour, Vanderpooten (CR14) 2017; 260 Boland, Charkhgard, Savelsbergh (CR5) 2017; 260 Lindauer, Hoos, Hutter, Schaub (CR23) 2015; 53 Boland, Charkhgard, Savelsbergh (CR7) 2019; 274 CR19 CR18 CR16 Charkhgard, Takalloo, Haider (CR12) 2020; 18 Boland, Charkhgard, Savelsbergh (CR4) 2016; 8 Charkhgard, Talebian, Savelsbergh (CR11) 2018; 16 Pedregosa, Varoquaux, Gramfort, Michel, Thirion, Grisel, Blondel, Prettenhofer, Weiss, Dubourg, Vanderplas, Passos, Cournapeau, Brucher, Perrot, Duchesnay (CR31) 2011; 12 Soylu, Yıldız (CR41) 2016; 72 Nikolić, Marić, Janičić (CR27) 2013; 40 Sierra-Altamiranda, Charkhgard (CR39) 2020; 27 Kirlik, Sayın (CR21) 2014; 232 CR26 CR25 Przybylski, Gandibleux (CR33) 2017; 260 CR22 Sierra-Altamiranda, Charkhgard (CR38) 2019; 31 CR20 Lokman, Köksalan (CR24) 2013; 57 Sra, Nowozin, Wright (CR42) 2012 Bengio, Lodi, Prouvost (CR2) 2021; 290 Y Bengio (2100_CR2) 2021; 290 N Boland (2100_CR6) 2017; 260 2100_CR44 2100_CR40 A Sierra-Altamiranda (2100_CR39) 2020; 27 S Sra (2100_CR42) 2012 2100_CR49 A Sierra-Altamiranda (2100_CR38) 2019; 31 2100_CR45 2100_CR48 F Hutter (2100_CR17) 2007; 7 2100_CR47 N Boland (2100_CR7) 2019; 274 A Prinzie (2100_CR32) 2008; 34 2100_CR8 B Soylu (2100_CR41) 2016; 72 B Lokman (2100_CR24) 2013; 57 M Nikolić (2100_CR27) 2013; 40 2100_CR35 2100_CR34 2100_CR37 2100_CR36 M Lindauer (2100_CR23) 2015; 53 K Dächert (2100_CR14) 2017; 260 F Pedregosa (2100_CR31) 2011; 12 M Özlen (2100_CR29) 2013; 160 2100_CR20 2100_CR22 K Crammer (2100_CR13) 2001; 2 L Xu (2100_CR46) 2008; 32 N Boland (2100_CR5) 2017; 260 2100_CR26 2100_CR25 M Özlen (2100_CR28) 2009; 199 AM Alvarez (2100_CR1) 2017; 29 N Boland (2100_CR4) 2016; 8 R Dai (2100_CR15) 2018; 46 H Charkhgard (2100_CR11) 2018; 16 A Przybylski (2100_CR33) 2017; 260 H Charkhgard (2100_CR12) 2020; 18 L Breiman (2100_CR9) 2001; 45 N Boland (2100_CR3) 2015; 27 2100_CR16 2100_CR19 2100_CR18 H Charkhgard (2100_CR10) 2019; 61 Ö Özpeynirci (2100_CR30) 2010; 56 R Tibshirani (2100_CR43) 1996; 58 G Kirlik (2100_CR21) 2014; 232 |
| References_xml | – volume: 27 start-page: 735 issue: 4 year: 2015 end-page: 754 ident: CR3 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 – ident: CR45 – ident: CR22 – ident: CR49 – ident: CR16 – volume: 29 start-page: 185 issue: 1 year: 2017 end-page: 195 ident: CR1 article-title: A machine learning-based approximation of strong branching publication-title: INFORMS J. Comput. doi: 10.1287/ijoc.2016.0723 – volume: 61 start-page: 64 issue: 1 year: 2019 end-page: 75 ident: CR10 article-title: A new approach to select the best subset of predictors in linear regression modeling: bi-objective mixed integer linear programming publication-title: ANZIAM J. doi: 10.1017/S1446181118000275 – volume: 27 start-page: 945 issue: 2 year: 2020 end-page: 957 ident: CR39 article-title: Ooesalgorithm.jl: a julia package for optimizing a linear function over the set of efficient solutions for biobjective mixed integer linear programming publication-title: Int. Trans. Oper. Res. doi: 10.1111/itor.12692 – ident: CR35 – volume: 260 start-page: 904 issue: 3 year: 2017 end-page: 919 ident: CR5 article-title: A new method for optimizing a linear function over the efficient set of a multiobjective integer program publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2016.02.037 – ident: CR8 – ident: CR25 – volume: 12 start-page: 2825 year: 2011 end-page: 2830 ident: CR31 article-title: Scikit-learn: machine learning in Python publication-title: J. Mach. Learn. Res. – volume: 274 start-page: 858 issue: 3 year: 2019 end-page: 875 ident: CR7 article-title: Preprocessing and cut generation techniques for multi-objective binary programming publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2018.10.034 – volume: 160 start-page: 470 issue: 2 year: 2013 end-page: 482 ident: CR29 article-title: Multi-objective integer programming: an improved recursive algorithm publication-title: J. Optim. Theory Appl. doi: 10.1007/s10957-013-0364-y – volume: 260 start-page: 873 issue: 3 year: 2017 end-page: 885 ident: CR6 article-title: The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2016.03.035 – volume: 34 start-page: 1721 issue: 3 year: 2008 end-page: 1732 ident: CR32 article-title: Random forests for multiclass classification: random multinomial logit publication-title: Expert Syst. Appl. doi: 10.1016/j.eswa.2007.01.029 – ident: CR19 – volume: 232 start-page: 479 issue: 3 year: 2014 end-page: 488 ident: CR21 article-title: A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2013.08.001 – volume: 56 start-page: 2302 issue: 12 year: 2010 end-page: 2315 ident: CR30 article-title: An exact algorithm for finding extreme supported nondominated points of multiobjective mixed integer programs publication-title: Manage. Sci. doi: 10.1287/mnsc.1100.1248 – volume: 199 start-page: 25 year: 2009 end-page: 35 ident: CR28 article-title: Multi-objective integer programming: a general approach for generating all non-dominated solutions publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2008.10.023 – ident: CR36 – ident: CR26 – volume: 45 start-page: 5 issue: 1 year: 2001 end-page: 32 ident: CR9 article-title: Random forests publication-title: Mach. Learn. doi: 10.1023/A:1010933404324 – ident: CR18 – ident: CR47 – ident: CR37 – volume: 53 start-page: 745 year: 2015 end-page: 778 ident: CR23 article-title: Autofolio: an automatically configured algorithm selector publication-title: J. Artif. Intell. Res. doi: 10.1613/jair.4726 – volume: 8 start-page: 217 issue: 2 year: 2016 end-page: 251 ident: CR4 article-title: The L-shape search method for triobjective integer programming publication-title: Math. Program. Comput. doi: 10.1007/s12532-015-0093-3 – volume: 58 start-page: 267 year: 1996 end-page: 288 ident: CR43 article-title: Regression shrinkage and selection via the lasso publication-title: J. Roy. Stat. Soc. B doi: 10.1111/j.2517-6161.1996.tb02080.x – volume: 2 start-page: 265 issue: Dec year: 2001 end-page: 292 ident: CR13 article-title: On the algorithmic implementation of multiclass kernel-based vector machines publication-title: J. Mach. Learn. Res. – ident: CR40 – volume: 40 start-page: 457 issue: 4 year: 2013 end-page: 465 ident: CR27 article-title: Simple algorithm portfolio for sat publication-title: Artif. Intell. Rev. doi: 10.1007/s10462-011-9290-2 – volume: 72 start-page: 204 year: 2016 end-page: 213 ident: CR41 article-title: An exact algorithm for biobjective mixed integer linear programming problems publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2016.03.001 – ident: CR44 – ident: CR48 – volume: 46 start-page: 81 issue: 1 year: 2018 end-page: 87 ident: CR15 article-title: A two-stage approach for bi-objective integer linear programming publication-title: Oper. Res. Lett. doi: 10.1016/j.orl.2017.11.011 – volume: 290 start-page: 405 issue: 2 year: 2021 end-page: 421 ident: CR2 article-title: Machine learning for combinatorial optimization: a methodological tour d’horizon publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2020.07.063 – volume: 260 start-page: 841 issue: 3 year: 2017 end-page: 855 ident: CR14 article-title: Efficient computation of the search region in multi-objective optimization publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2016.05.029 – volume: 18 start-page: 477 issue: 4 year: 2020 end-page: 505 ident: CR12 article-title: Bi-objective autonomous vehicle repositioning problem with travel time uncertainty publication-title: 4OR - A Q. J. Oper. Res. doi: 10.1007/s10288-019-00429-7 – volume: 57 start-page: 347 issue: 2 year: 2013 end-page: 365 ident: CR24 article-title: Finding all nondominated points of multi-objective integer programs publication-title: J. Global Optim. doi: 10.1007/s10898-012-9955-7 – volume: 260 start-page: 856 issue: 3 year: 2017 end-page: 872 ident: CR33 article-title: Multi-objective branch and bound publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2017.01.032 – volume: 16 start-page: 151 year: 2018 end-page: 171 ident: CR11 article-title: Nondominated nash points: application of biobjective mixed integer programming publication-title: 4OR - A Q. J. Oper. Res. doi: 10.1007/s10288-017-0354-2 – ident: CR34 – volume: 31 start-page: 823 issue: 4 year: 2019 end-page: 840 ident: CR38 article-title: A new exact algorithm to optimize a linear function over the set of efficient solutions for bi-objective mixed integer linear programming publication-title: INFORMS J. Comput. doi: 10.1287/ijoc.2018.0851 – year: 2012 ident: CR42 publication-title: Optimization for Machine Learning – volume: 32 start-page: 565 year: 2008 end-page: 606 ident: CR46 article-title: Satzilla: portfolio-based algorithm selection for sat publication-title: J. Artif. Intell. Res. doi: 10.1613/jair.2490 – volume: 7 start-page: 1152 year: 2007 end-page: 1157 ident: CR17 article-title: Automatic algorithm configuration based on local search publication-title: AAAI – ident: CR20 – volume: 29 start-page: 185 issue: 1 year: 2017 ident: 2100_CR1 publication-title: INFORMS J. Comput. doi: 10.1287/ijoc.2016.0723 – volume: 2 start-page: 265 issue: Dec year: 2001 ident: 2100_CR13 publication-title: J. Mach. Learn. Res. – ident: 2100_CR25 doi: 10.1007/978-3-642-21581-0_33 – ident: 2100_CR45 doi: 10.1007/978-3-540-74970-7_50 – volume: 32 start-page: 565 year: 2008 ident: 2100_CR46 publication-title: J. Artif. Intell. Res. doi: 10.1613/jair.2490 – volume: 16 start-page: 151 year: 2018 ident: 2100_CR11 publication-title: 4OR - A Q. J. Oper. Res. doi: 10.1007/s10288-017-0354-2 – volume: 34 start-page: 1721 issue: 3 year: 2008 ident: 2100_CR32 publication-title: Expert Syst. Appl. doi: 10.1016/j.eswa.2007.01.029 – ident: 2100_CR8 doi: 10.1007/978-3-7908-2604-3_16 – ident: 2100_CR35 doi: 10.1145/1102351.1102444 – volume: 45 start-page: 5 issue: 1 year: 2001 ident: 2100_CR9 publication-title: Mach. Learn. doi: 10.1023/A:1010933404324 – ident: 2100_CR47 doi: 10.1609/aaai.v24i1.7565 – volume: 290 start-page: 405 issue: 2 year: 2021 ident: 2100_CR2 publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2020.07.063 – volume: 199 start-page: 25 year: 2009 ident: 2100_CR28 publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2008.10.023 – ident: 2100_CR36 doi: 10.1007/978-3-642-29828-8_23 – volume: 260 start-page: 904 issue: 3 year: 2017 ident: 2100_CR5 publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2016.02.037 – volume: 18 start-page: 477 issue: 4 year: 2020 ident: 2100_CR12 publication-title: 4OR - A Q. J. Oper. Res. doi: 10.1007/s10288-019-00429-7 – volume: 260 start-page: 841 issue: 3 year: 2017 ident: 2100_CR14 publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2016.05.029 – volume: 58 start-page: 267 year: 1996 ident: 2100_CR43 publication-title: J. Roy. Stat. Soc. B doi: 10.1111/j.2517-6161.1996.tb02080.x – ident: 2100_CR37 doi: 10.1007/978-3-642-46618-2_15 – volume: 27 start-page: 735 issue: 4 year: 2015 ident: 2100_CR3 publication-title: INFORMS J. Comput. doi: 10.1287/ijoc.2015.0657 – volume: 7 start-page: 1152 year: 2007 ident: 2100_CR17 publication-title: AAAI – volume: 46 start-page: 81 issue: 1 year: 2018 ident: 2100_CR15 publication-title: Oper. Res. Lett. doi: 10.1016/j.orl.2017.11.011 – ident: 2100_CR16 – ident: 2100_CR26 doi: 10.1007/978-3-642-02777-2_31 – volume: 260 start-page: 856 issue: 3 year: 2017 ident: 2100_CR33 publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2017.01.032 – ident: 2100_CR44 doi: 10.1145/1015330.1015341 – ident: 2100_CR22 – volume-title: Optimization for Machine Learning year: 2012 ident: 2100_CR42 – volume: 160 start-page: 470 issue: 2 year: 2013 ident: 2100_CR29 publication-title: J. Optim. Theory Appl. doi: 10.1007/s10957-013-0364-y – ident: 2100_CR20 doi: 10.24963/ijcai.2017/92 – ident: 2100_CR49 – volume: 61 start-page: 64 issue: 1 year: 2019 ident: 2100_CR10 publication-title: ANZIAM J. doi: 10.1017/S1446181118000275 – volume: 232 start-page: 479 issue: 3 year: 2014 ident: 2100_CR21 publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2013.08.001 – volume: 8 start-page: 217 issue: 2 year: 2016 ident: 2100_CR4 publication-title: Math. Program. Comput. doi: 10.1007/s12532-015-0093-3 – volume: 31 start-page: 823 issue: 4 year: 2019 ident: 2100_CR38 publication-title: INFORMS J. Comput. doi: 10.1287/ijoc.2018.0851 – volume: 260 start-page: 873 issue: 3 year: 2017 ident: 2100_CR6 publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2016.03.035 – volume: 27 start-page: 945 issue: 2 year: 2020 ident: 2100_CR39 publication-title: Int. Trans. Oper. Res. doi: 10.1111/itor.12692 – ident: 2100_CR40 – volume: 12 start-page: 2825 year: 2011 ident: 2100_CR31 publication-title: J. Mach. Learn. Res. – volume: 56 start-page: 2302 issue: 12 year: 2010 ident: 2100_CR30 publication-title: Manage. Sci. doi: 10.1287/mnsc.1100.1248 – volume: 53 start-page: 745 year: 2015 ident: 2100_CR23 publication-title: J. Artif. Intell. Res. doi: 10.1613/jair.4726 – volume: 72 start-page: 204 year: 2016 ident: 2100_CR41 publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2016.03.001 – ident: 2100_CR19 doi: 10.1609/aaai.v30i1.10080 – ident: 2100_CR48 – ident: 2100_CR18 doi: 10.1007/978-3-642-13520-0_23 – volume: 274 start-page: 858 issue: 3 year: 2019 ident: 2100_CR7 publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2018.10.034 – volume: 57 start-page: 347 issue: 2 year: 2013 ident: 2100_CR24 publication-title: J. Global Optim. doi: 10.1007/s10898-012-9955-7 – volume: 40 start-page: 457 issue: 4 year: 2013 ident: 2100_CR27 publication-title: Artif. Intell. Rev. doi: 10.1007/s10462-011-9290-2 – ident: 2100_CR34 doi: 10.1016/S0065-2458(08)60520-3 |
| SSID | ssj0061199 |
| Score | 2.3422086 |
| Snippet | In this paper, we investigate the possibility of improving the performance of multi-objective optimization solution approaches using machine learning... |
| SourceID | crossref springer |
| SourceType | Index Database Publisher |
| StartPage | 2051 |
| SubjectTerms | Computational Intelligence Mathematics Mathematics and Statistics Numerical and Computational Physics Operations Research/Decision Theory Optimization Original Paper Simulation |
| Title | Learning to project in a criterion space search algorithm: an application to multi-objective binary linear programming |
| URI | https://link.springer.com/article/10.1007/s11590-024-02100-5 |
| Volume | 18 |
| WOSCitedRecordID | wos001186446400001&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: PRVAVX databaseName: SpringerLink customDbUrl: eissn: 1862-4480 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0061199 issn: 1862-4472 databaseCode: RSV dateStart: 20070101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LT8MwDI5gcIADb8R4KQduEKlN0y7hhhCICxPipd2qNE3GEGvRWvb7cdKUMQkhwbGtlVZO4s-p7c8InRimA22oJHEmAsKyUBIumCAhy8FZ1lSbvGk20ev3-WAg7nxRWNVmu7chSWepZ8VugLwBAUwh9pwSkHgRLQHccduw4f7hubW_Sdh0jQy5rQdiPepLZX4eYx6O5mOhDmKu1__3cRtozbuU-KJZA5toQRdbaPUb0SBc3X6xs1bbaOpJVYe4LrH_FYNHBZYYTIjlbi4LDIZGadzsAyzfhiU8eRmfYwlis5i3HcClJJIye21MJ85chS-27qucYJ__NYa37aCn66vHyxvi-y8QBcBdk9zkAHAm50rQ3BLBcZPwJIu0gFsq51rFIsokVQq8CMudRTPY34kMteIm1DTaRZ2iLPQewoniScQknNx1jyVayFhwY9m2KNfScNZFp-00pO8NzUY6I1S2uk1Bt6nTbRp30Vk7C6nfctUv4vt_Ez9AK9ROpMtZOUSdevKhj9CymtajanLs1tonly7P4g |
| linkProvider | Springer Nature |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3dS8MwEA86BfXBb3F-5sE3Daxp2iW-iTgmbkN0yt5KmiZz4lpZ6_5-L_1wDkTQx7YhLZfc_S69u98hdGaYbmhDJfFC0SAsdCThggnisAicZU21iYpmE81ejw8G4r4sCkurbPcqJJlb6lmxGyBvgwCmEHtOaRBvES0xQCzLmP_w-FzZX98pukY63NYDsSYtS2V-nmMejuZjoTnEtDb-93GbaL10KfFVsQe20IKOt9HaN6JBuOp-sbOmO2hakqoOcZbg8lcMHsVYYjAhlrs5iTEYGqVxoQdYvg0TePIyvsQShs1i3naCPCWRJOFrYTpxmFf4Yuu-ygku87_G8LZd9NS66V-3Sdl_gSgA7oxEJgKAMxFXgkaWCI4bn_uhqwXcUhHXyhNuKKlS4EVY7iwagn770tGKG0dTdw_V4iTW-wj7ivsuk3By103mayE9wY1l26JcS8NZHZ1XyxC8FzQbwYxQ2co2ANkGuWwDr44uqlUISpVLfxl-8Lfhp2il3e92gs5t7-4QrVK7qHn-yhGqZZMPfYyW1TQbpZOTfN99Al-50sY |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3dS8MwED90iuiD3-L8zINvGmzTtEt8E3Uo6hj4wd5KmiZz4tqx1f39Jv1wG4ggPrY90pLLffXufgdwoqlylCYC-xF3MI1cgRmnHLs0Ns6yIkrHxbCJRqvFOh3enuriz6vdq5Rk0dNgUZqS7HwQ6_NJ45uxwg429gXbmMXB_jwsUFtIb-P1p9dKFwduMUHSZbY3iDZI2Tbz8xqzpmk2L5qbm-ba_z90HVZLVxNdFmdjA-ZUsgkrUwCE5urxG7V1tAXjEmy1i7IUlb9oUC9BAhnVYjGd0wQZBSQVKuQDiY9uap689S-QMGSTXLhdIC9VxGn0XqhUFOWdv8i6tWKIyrqwvnnbNrw0b56vbnE5lwFLY9AzHOvYGD4dM8lJbAHimA5YEHmKm1syZkr63IsEkdJ4FxZTi0RG7gPhKsm0q4i3A7UkTdQuoECywKPCRPSqQQPFhc-ZtihchCmhGa3DacWScFDAb4QToGW7t6HZ2zDf29Cvw1nFkbAUxdEv5Ht_Iz-GpfZ1M3y4a93vwzKxPM3LWg6glg0_1SEsynHWGw2P8iP4BTAY26o |
| 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=Learning+to+project+in+a+criterion+space+search+algorithm%3A+an+application+to+multi-objective+binary+linear+programming&rft.jtitle=Optimization+letters&rft.au=Sierra-Altamiranda%2C+Alvaro&rft.au=Charkhgard%2C+Hadi&rft.au=Dayarian%2C+Iman&rft.au=Eshragh%2C+Ali&rft.date=2024-12-01&rft.pub=Springer+Berlin+Heidelberg&rft.issn=1862-4472&rft.eissn=1862-4480&rft.volume=18&rft.issue=9&rft.spage=2051&rft.epage=2078&rft_id=info:doi/10.1007%2Fs11590-024-02100-5&rft.externalDocID=10_1007_s11590_024_02100_5 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1862-4472&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1862-4472&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1862-4472&client=summon |