Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems
•We present a system for the automatic design of Hybrid Stochastic Local Searches.•Algorithms are obtained by combining components following rules defined by a grammar.•The system is tested on three major objectives of the permutation flowshop problem.•The results show that the generated algorithms...
Gespeichert in:
| Veröffentlicht in: | European journal of operational research Jg. 276; H. 2; S. 409 - 421 |
|---|---|
| Hauptverfasser: | , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Elsevier B.V
16.07.2019
|
| Schlagworte: | |
| ISSN: | 0377-2217, 1872-6860 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | •We present a system for the automatic design of Hybrid Stochastic Local Searches.•Algorithms are obtained by combining components following rules defined by a grammar.•The system is tested on three major objectives of the permutation flowshop problem.•The results show that the generated algorithms outperform the state of the art.
Stochastic local search methods are at the core of many effective heuristics for tackling different permutation flowshop problems (PFSPs). Usually, such algorithms require a careful, manual algorithm engineering effort to reach high performance. An alternative to the manual algorithm engineering is the automated design of effective SLS algorithms through building flexible algorithm frameworks and using automatic algorithm configuration techniques to instantiate high-performing algorithms. In this paper, we automatically generate new high-performing algorithms for some of the most widely studied variants of the PFSP. More in detail, we (i) developed a new algorithm framework, EMILI, that implements algorithm-specific and problem-specific building blocks; (ii) define the rules of how to compose algorithms from the building blocks; and (iii) employ an automatic algorithm configuration tool to search for high performing algorithm configurations. With these ingredients, we automatically generate algorithms for the PFSP with the objectives makespan, total completion time and total tardiness, which outperform the best algorithms obtained by a manual algorithm engineering process. |
|---|---|
| AbstractList | •We present a system for the automatic design of Hybrid Stochastic Local Searches.•Algorithms are obtained by combining components following rules defined by a grammar.•The system is tested on three major objectives of the permutation flowshop problem.•The results show that the generated algorithms outperform the state of the art.
Stochastic local search methods are at the core of many effective heuristics for tackling different permutation flowshop problems (PFSPs). Usually, such algorithms require a careful, manual algorithm engineering effort to reach high performance. An alternative to the manual algorithm engineering is the automated design of effective SLS algorithms through building flexible algorithm frameworks and using automatic algorithm configuration techniques to instantiate high-performing algorithms. In this paper, we automatically generate new high-performing algorithms for some of the most widely studied variants of the PFSP. More in detail, we (i) developed a new algorithm framework, EMILI, that implements algorithm-specific and problem-specific building blocks; (ii) define the rules of how to compose algorithms from the building blocks; and (iii) employ an automatic algorithm configuration tool to search for high performing algorithm configurations. With these ingredients, we automatically generate algorithms for the PFSP with the objectives makespan, total completion time and total tardiness, which outperform the best algorithms obtained by a manual algorithm engineering process. |
| Author | Pagnozzi, Federico Stützle, Thomas |
| Author_xml | – sequence: 1 givenname: Federico orcidid: 0000-0003-4529-4711 surname: Pagnozzi fullname: Pagnozzi, Federico email: federico.pagnozzi@ulb.ac.be – sequence: 2 givenname: Thomas orcidid: 0000-0002-5820-0473 surname: Stützle fullname: Stützle, Thomas email: stuetzle@ulb.ac.be |
| BookMark | eNp9kM1qwzAQhEVJoUnaF-hJL2BXkn8kQy8h9A8CvbRnIUurWMa2jOS05O1rk556KAy7sMs3MLNBq8EPgNA9JSkltHxoU2h9SBmhVUroLHGF1lRwlpSiJCu0JhnnCWOU36BNjC0hhBa0WCO5O02-V5PT2EB0xwF7i5tzHZzBcfK6UXH5dV6rDkdQQTdYdUcf3NT0EVsf8AihP02zhR-w7fx3bPyIx-DrDvp4i66t6iLc_e4t-nx--ti_Jof3l7f97pDonFRTwioustxSUdisFhVwUPMQhitTlLRitRF5XtuciboqucotkILrihnFYD5V2Raxi68OPsYAVo7B9SqcJSVyqUi2cqlILhVJQmeJGRJ_IO0uQaagXPc_-nhBYQ715SDIqB0MGowLoCdpvPsP_wFOL4bo |
| CitedBy_id | crossref_primary_10_1016_j_cor_2025_107050 crossref_primary_10_1016_j_asoc_2020_106458 crossref_primary_10_1109_TASE_2021_3062994 crossref_primary_10_1109_MCI_2020_2976182 crossref_primary_10_1016_j_cie_2021_107843 crossref_primary_10_1016_j_aei_2022_101756 crossref_primary_10_1007_s11750_025_00699_x crossref_primary_10_1016_j_ejor_2021_10_015 crossref_primary_10_1016_j_ejor_2022_04_014 crossref_primary_10_1016_j_cor_2021_105615 crossref_primary_10_1016_j_ejor_2024_06_001 crossref_primary_10_1111_itor_12902 crossref_primary_10_7717_peerj_cs_634 crossref_primary_10_1016_j_eswa_2021_115493 crossref_primary_10_1080_00207543_2025_2502106 crossref_primary_10_1016_j_cor_2023_106432 crossref_primary_10_1016_j_ejor_2020_03_027 crossref_primary_10_1016_j_eswa_2023_121431 crossref_primary_10_1016_j_knosys_2021_107819 crossref_primary_10_1016_j_ejor_2022_03_054 crossref_primary_10_1109_TCYB_2024_3412997 |
| Cites_doi | 10.1016/j.cor.2016.12.021 10.1109/TEVC.2011.2160401 10.1016/j.cor.2008.04.001 10.1016/j.cie.2008.03.003 10.1016/0377-2217(95)00347-9 10.1016/j.cor.2013.12.012 10.1016/j.ejor.2005.12.024 10.1016/S0377-2217(00)00100-4 10.1016/j.cor.2006.08.016 10.1023/A:1009624916728 10.1016/j.ejor.2013.10.024 10.1016/j.orp.2014.12.001 10.1016/0377-2217(93)90182-M 10.1080/00207540310001657595 10.1016/S0377-2217(02)00908-6 10.1057/jors.1993.3 10.1063/1.1699114 10.1016/S0377-2217(00)00137-5 10.1287/ijoc.1070.0258 10.1007/s11590-016-1086-5 10.1016/j.omega.2009.04.002 10.1016/j.ejor.2008.08.023 10.1016/j.cie.2016.06.012 10.1016/j.eswa.2017.10.050 10.1016/j.ejor.2014.07.033 10.1016/j.cor.2016.12.020 10.1016/j.orp.2016.09.002 10.1016/j.ejor.2005.12.009 10.1109/TEVC.2011.2182651 10.1145/2076450.2076469 10.1002/nav.3800010110 10.1007/s10710-010-9109-y 10.1016/j.ejor.2016.09.055 10.1016/S0377-2217(96)00273-1 10.1016/j.ejor.2012.04.034 10.1016/0305-0483(83)90088-9 10.1016/j.omega.2007.02.002 10.1016/0377-2217(90)90090-X 10.1023/B:HEUR.0000026900.92269.ec 10.1016/j.cor.2014.05.020 |
| ContentType | Journal Article |
| Copyright | 2019 Elsevier B.V. |
| Copyright_xml | – notice: 2019 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.ejor.2019.01.018 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1872-6860 |
| EndPage | 421 |
| ExternalDocumentID | 10_1016_j_ejor_2019_01_018 S0377221719300207 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 4.4 457 4G. 5GY 5VS 6OB 7-5 71M 8P~ 9JN 9JO AAAKF AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AARIN AAXUO AAYFN ABAOU ABBOA ABFNM ABFRF ABJNI ABMAC ABUCO ABYKQ ACAZW ACDAQ ACGFO ACGFS ACIWK ACNCT ACRLP ACZNC ADBBV ADEZE ADGUI AEBSH AEFWE AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIGVJ AIKHN AITUG AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR AXJTR BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX IHE J1W KOM LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 RIG ROL RPZ RXW SCC SDF SDG SDP SDS SES SPC SPCBC SSB SSD SSV SSW SSZ T5K TAE TN5 U5U XPP ZMT ~02 ~G- 1OL 29G 41~ 9DU AAAKG AAQXK AATTM AAXKI AAYWO AAYXX ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADIYS ADJOM ADMUD ADNMO ADXHL AEIPS AEUPX AFFNX AFJKZ AFPUW AGQPQ AI. AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS FEDTE FGOYB HVGLF HZ~ R2- SEW VH1 WUQ ~HD |
| ID | FETCH-LOGICAL-c409t-297834f185f3b89e7ea9e78d7ad56192bd844bf428b967a4fe057c92da2e8b993 |
| ISICitedReferencesCount | 36 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000463296300002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0377-2217 |
| IngestDate | Sat Nov 29 07:22:08 EST 2025 Tue Nov 18 20:44:32 EST 2025 Fri Feb 23 02:17:45 EST 2024 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Keywords | Stochastic local search Scheduling Automatic algorithm design |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c409t-297834f185f3b89e7ea9e78d7ad56192bd844bf428b967a4fe057c92da2e8b993 |
| ORCID | 0000-0003-4529-4711 0000-0002-5820-0473 |
| OpenAccessLink | http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/286627 |
| PageCount | 13 |
| ParticipantIDs | crossref_primary_10_1016_j_ejor_2019_01_018 crossref_citationtrail_10_1016_j_ejor_2019_01_018 elsevier_sciencedirect_doi_10_1016_j_ejor_2019_01_018 |
| PublicationCentury | 2000 |
| PublicationDate | 2019-07-16 |
| PublicationDateYYYYMMDD | 2019-07-16 |
| PublicationDate_xml | – month: 07 year: 2019 text: 2019-07-16 day: 16 |
| PublicationDecade | 2010 |
| PublicationTitle | European journal of operational research |
| PublicationYear | 2019 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Tasgetiren, Liang, Sevkli, Gencyilmaz (bib0044) 2007; 177 Burke, Hyde, Kendall (bib0001) 2012; 16 Liao, Stützle, Montes de Oca, Dorigo (bib0021) 2014; 234 Lourenço, Martin, Stützle (bib0026) 2010 Nawaz, Enscore, Ham (bib0033) 1983; 11 Ruiz, Stützle (bib0041) 2007; 177 Dubois-Lacoste, Pagnozzi, Stützle (bib0004) 2017; 81 Vallada, Ruiz, Framiñán (bib0047) 2015; 240 Li, Chen, Xu, Gupta (bib0020) 2015; 2 Mascia, López-Ibáñez, Dubois-Lacoste, Stützle (bib0028) 2013 Metropolis, Rosenbluth, Rosenbluth, Teller, Teller (bib0031) 1953; 21 Pagnozzi, F., & Stützle, T. (2018). Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems: Supplementary material. KhudaBukhsh, Xu, Hoos, Leyton-Brown (bib0018) 2009 Kim (bib0019) 1993; 44 Marmion, Mascia, López-Ibáñez, Stützle (bib0027) 2013 Karabulut (bib0017) 2016; 98 Tseng, Lin (bib0045) 2009; 198 Pan, Ruiz (bib0036) 2012; 222 Taillard (bib0043) 1993; 64 Fernandez-Viagas, Framiñán (bib0005) 2014; 45 Minella, Ruiz, Ciavotta (bib0032) 2008; 20 Pan, Tasgetiren, Liang (bib0037) 2008; 55 . M. López-Ibáñez, K. Marie-Eléonore, and T. Stützle, Automatic design of hybrid metaheuristics from algorithmic components, Tech. Rep. TR/IRIDIA/2017-012, IRIDIA, Université Libre de Bruxelles, Belgium (Dec. 2017) Vallada, Ruiz (bib0046) 2010; 38 Cahon, Melab, Talbi (bib0002) 2004; 10 Dong, Huang, Chen (bib0003) 2009; 36 Framiñán, Leisten, Ruiz (bib0009) 2014 Mascia, López-Ibáñez, Dubois-Lacoste, Stützle (bib0029) 2014; 51 Taillard (bib0042) 1990; 47 Hansen, Mladenović (bib0010) 2001; 130 Mckay, Hoai, Whigham, Shan, O’. Neill (bib0030) 2010; 11 Rajendran, Ziegler (bib0040) 2004; 155 Rad, Ruiz, Boroojerdian (bib0038) 2009; 37 López-Ibáñez, Dubois-Lacoste, Pérez Cáceres, Stützle, Birattari (bib0023) 2016; 3 Fernandez-Viagas, Ruiz, Framiñán (bib0007) 2017; 257 Hong, Kahng, Moon (bib0012) 1997; 3 Hoos (bib0013) 2012; 55 Hasija, Rajendran (bib0011) 2004; 42 Pagnozzi, Stützle (bib0034) 2017; 11 Wang, Chu, Proth (bib0049) 1997; 96 Vallada, Ruiz, Minella (bib0048) 2008; 35 Hutter, Hoos, Leyton-Brown (bib0015) 2011 Johnson (bib0016) 1954; 1 Liu, Reeves (bib0022) 2001; 132 Hoos, Stützle (bib0014) 2005 Rajendran, Ziegler (bib0039) 1997; 103 Fernandez-Viagas, Valente, Framiñán (bib0008) 2018; 94 Fernandez-Viagas, Framiñán (bib0006) 2017; 81 López-Ibáñez, Stützle (bib0025) 2012; 16 Hong (10.1016/j.ejor.2019.01.018_bib0012) 1997; 3 Dubois-Lacoste (10.1016/j.ejor.2019.01.018_bib0004) 2017; 81 Minella (10.1016/j.ejor.2019.01.018_bib0032) 2008; 20 Marmion (10.1016/j.ejor.2019.01.018_bib0027) 2013 Li (10.1016/j.ejor.2019.01.018_bib0020) 2015; 2 Fernandez-Viagas (10.1016/j.ejor.2019.01.018_bib0005) 2014; 45 Fernandez-Viagas (10.1016/j.ejor.2019.01.018_bib0008) 2018; 94 Hutter (10.1016/j.ejor.2019.01.018_bib0015) 2011 Hoos (10.1016/j.ejor.2019.01.018_bib0013) 2012; 55 Metropolis (10.1016/j.ejor.2019.01.018_bib0031) 1953; 21 Taillard (10.1016/j.ejor.2019.01.018_bib0042) 1990; 47 Vallada (10.1016/j.ejor.2019.01.018_bib0046) 2010; 38 10.1016/j.ejor.2019.01.018_bib0024 Rajendran (10.1016/j.ejor.2019.01.018_bib0040) 2004; 155 Ruiz (10.1016/j.ejor.2019.01.018_bib0041) 2007; 177 Burke (10.1016/j.ejor.2019.01.018_bib0001) 2012; 16 Kim (10.1016/j.ejor.2019.01.018_bib0019) 1993; 44 Liao (10.1016/j.ejor.2019.01.018_bib0021) 2014; 234 Hasija (10.1016/j.ejor.2019.01.018_bib0011) 2004; 42 Hoos (10.1016/j.ejor.2019.01.018_bib0014) 2005 Rad (10.1016/j.ejor.2019.01.018_bib0038) 2009; 37 López-Ibáñez (10.1016/j.ejor.2019.01.018_bib0025) 2012; 16 Wang (10.1016/j.ejor.2019.01.018_bib0049) 1997; 96 10.1016/j.ejor.2019.01.018_bib0035 Fernandez-Viagas (10.1016/j.ejor.2019.01.018_bib0006) 2017; 81 Mascia (10.1016/j.ejor.2019.01.018_bib0029) 2014; 51 López-Ibáñez (10.1016/j.ejor.2019.01.018_bib0023) 2016; 3 Karabulut (10.1016/j.ejor.2019.01.018_sbref0017) 2016; 98 Lourenço (10.1016/j.ejor.2019.01.018_sbref0026) 2010 KhudaBukhsh (10.1016/j.ejor.2019.01.018_bib0018) 2009 Tasgetiren (10.1016/j.ejor.2019.01.018_bib0044) 2007; 177 Hansen (10.1016/j.ejor.2019.01.018_bib0010) 2001; 130 Dong (10.1016/j.ejor.2019.01.018_bib0003) 2009; 36 Mascia (10.1016/j.ejor.2019.01.018_bib0028) 2013 Vallada (10.1016/j.ejor.2019.01.018_bib0047) 2015; 240 Nawaz (10.1016/j.ejor.2019.01.018_bib0033) 1983; 11 Taillard (10.1016/j.ejor.2019.01.018_bib0043) 1993; 64 Cahon (10.1016/j.ejor.2019.01.018_bib0002) 2004; 10 Pagnozzi (10.1016/j.ejor.2019.01.018_bib0034) 2017; 11 Liu (10.1016/j.ejor.2019.01.018_bib0022) 2001; 132 Johnson (10.1016/j.ejor.2019.01.018_bib0016) 1954; 1 Pan (10.1016/j.ejor.2019.01.018_bib0036) 2012; 222 Framiñán (10.1016/j.ejor.2019.01.018_bib0009) 2014 Vallada (10.1016/j.ejor.2019.01.018_bib0048) 2008; 35 Mckay (10.1016/j.ejor.2019.01.018_bib0030) 2010; 11 Pan (10.1016/j.ejor.2019.01.018_bib0037) 2008; 55 Fernandez-Viagas (10.1016/j.ejor.2019.01.018_bib0007) 2017; 257 Rajendran (10.1016/j.ejor.2019.01.018_bib0039) 1997; 103 Tseng (10.1016/j.ejor.2019.01.018_bib0045) 2009; 198 |
| References_xml | – volume: 51 start-page: 190 year: 2014 end-page: 199 ident: bib0029 article-title: Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools publication-title: Computers & Operations Research – volume: 21 start-page: 1087 year: 1953 end-page: 1092 ident: bib0031 article-title: Equation of state calculations by fast computing machines publication-title: Journal of Chemical Physics – volume: 55 start-page: 795 year: 2008 end-page: 816 ident: bib0037 article-title: A discrete differential evolution algorithm for the permutation flowshop scheduling problem publication-title: Computers and Industrial Engineering – volume: 11 start-page: 1283 year: 2017 end-page: 1292 ident: bib0034 article-title: Speeding up local search for the insert neighborhood in the weighted tardiness permutation flowshop problem publication-title: Optimization Letters – volume: 11 start-page: 91 year: 1983 end-page: 95 ident: bib0033 article-title: A heuristic algorithm for the publication-title: Omega – volume: 44 start-page: 19 year: 1993 end-page: 28 ident: bib0019 article-title: Heuristics for flowshop scheduling problems minimizing mean tardiness publication-title: Journal of the Operational Research Society – volume: 37 start-page: 331 year: 2009 end-page: 345 ident: bib0038 article-title: New high performing heuristics for minimizing makespan in permutation flowshops publication-title: Omega – volume: 103 start-page: 129 year: 1997 end-page: 138 ident: bib0039 article-title: An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs publication-title: European Journal of Operational Research – volume: 177 start-page: 2033 year: 2007 end-page: 2049 ident: bib0041 article-title: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem publication-title: European Journal of Operational Research – year: 2014 ident: bib0009 article-title: Manufacturing scheduling systems: An integrated view on models publication-title: Methods and tools – volume: 55 start-page: 70 year: 2012 end-page: 80 ident: bib0013 article-title: Programming by optimization publication-title: Communications of the ACM – volume: 94 start-page: 58 year: 2018 end-page: 69 ident: bib0008 article-title: Iterated-greedy-based algorithms with beam search initialization for the permutation flowshop to minimise total tardiness publication-title: Expert Systems with Applications – volume: 240 start-page: 666 year: 2015 end-page: 677 ident: bib0047 article-title: New hard benchmark for flowshop scheduling problems minimising makespan publication-title: European Journal of Operational Research – start-page: 144 year: 2013 end-page: 158 ident: bib0027 article-title: Automatic design of hybrid stochastic local search algorithms publication-title: Hybrid metaheuristics, volume 7919 of lecture notes in computer science – volume: 16 start-page: 861 year: 2012 end-page: 875 ident: bib0025 article-title: The automatic design of multi-objective ant colony optimization algorithms publication-title: IEEE Transactions on Evolutionary Computation – volume: 130 start-page: 449 year: 2001 end-page: 467 ident: bib0010 article-title: Variable neighborhood search: Principles and applications publication-title: European Journal of Operational Research – year: 2005 ident: bib0014 publication-title: Stochastic local search—foundations and applications – volume: 132 start-page: 439 year: 2001 end-page: 452 ident: bib0022 article-title: Constructive and composite heuristic solutions to the P//ΣCi scheduling problem publication-title: European Journal of Operational Research – volume: 11 start-page: 365 year: 2010 end-page: 396 ident: bib0030 article-title: Grammar-based genetic programming: A survey publication-title: Genetic Programming and Evolvable Machines – volume: 3 start-page: 63 year: 1997 end-page: 81 ident: bib0012 article-title: Improved large-step Markov chain variants for the symmetric TSP publication-title: Journal of Heuristics – volume: 3 start-page: 43 year: 2016 end-page: 58 ident: bib0023 article-title: The irace package: Iterated racing for automatic algorithm configuration publication-title: Operations Research Perspectives – volume: 42 start-page: 2289 year: 2004 end-page: 2301 ident: bib0011 article-title: Scheduling in flowshops to minimize total tardiness of jobs publication-title: International Journal of Production Research – volume: 1 start-page: 61 year: 1954 end-page: 68 ident: bib0016 article-title: Optimal two- and three-stage production scheduling with setup times included publication-title: Naval Research Logistics Quarterly – volume: 20 start-page: 451 year: 2008 end-page: 471 ident: bib0032 article-title: A review and evaluation of multiobjective algorithms for the flowshop scheduling problem publication-title: INFORMS Journal on Computing – volume: 177 start-page: 1930 year: 2007 end-page: 1947 ident: bib0044 article-title: A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem publication-title: European Journal of Operational Research – volume: 234 start-page: 597 year: 2014 end-page: 609 ident: bib0021 article-title: A unified ant colony optimization algorithm for continuous optimization publication-title: European Journal of Operational Research – start-page: 321 year: 2013 end-page: 334 ident: bib0028 article-title: From grammars to parameters: Automatic iterated greedy design for the permutation flow-shop problem with weighted tardiness publication-title: Proceedings of the 7th international conference learning and intelligent optimization, LION 7, volume 7997 of lecture notes in computer science – volume: 155 start-page: 426 year: 2004 end-page: 438 ident: bib0040 article-title: Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs publication-title: European Journal of Operational Research – volume: 16 start-page: 406 year: 2012 end-page: 417 ident: bib0001 article-title: Grammatical evolution of local search heuristics publication-title: IEEE Transactions on Evolutionary Computation – volume: 257 start-page: 707 year: 2017 end-page: 721 ident: bib0007 article-title: A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation publication-title: European Journal of Operational Research – volume: 81 start-page: 167 year: 2017 end-page: 177 ident: bib0006 article-title: A beam-search-based constructive heuristic for the PFSP to minimise total flowtime publication-title: Computers & Operations Research – volume: 10 start-page: 357 year: 2004 end-page: 380 ident: bib0002 article-title: ParadisEO: A framework for the reusable design of parallel and distributed metaheuristics publication-title: Journal of Heuristics – volume: 47 start-page: 65 year: 1990 end-page: 74 ident: bib0042 article-title: Some efficient heuristic methods for the flow shop sequencing problem publication-title: European Journal of Operational Research – volume: 36 start-page: 1664 year: 2009 end-page: 1669 ident: bib0003 article-title: An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion publication-title: Computers & Operations Research – volume: 81 start-page: 160 year: 2017 end-page: 166 ident: bib0004 article-title: An iterated greedy algorithm with optimization of partial solutions for the permutation flowshop problem publication-title: Computers & Operations Research – reference: Pagnozzi, F., & Stützle, T. (2018). Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems: Supplementary material. – volume: 35 start-page: 1350 year: 2008 end-page: 1373 ident: bib0048 article-title: Minimising total tardiness in the m-machine flowshop problem: A review and evaluation of heuristics and metaheuristics publication-title: Computers & Operations Research – volume: 64 start-page: 278 year: 1993 end-page: 285 ident: bib0043 article-title: Benchmarks for basic scheduling problems publication-title: European Journal of Operational Research – volume: 98 start-page: 300 year: 2016 end-page: 307 ident: bib0017 article-title: A hybrid iterated greedy algorithm for total tardiness minimization in permutation flowshops publication-title: Computers and Industrial Engineering – volume: 38 start-page: 57 year: 2010 end-page: 67 ident: bib0046 article-title: Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem publication-title: Omega – volume: 198 start-page: 84 year: 2009 end-page: 92 ident: bib0045 article-title: A hybrid genetic local search algorithm for the permutation flowshop scheduling problem publication-title: European Journal of Operational Research – start-page: 507 year: 2011 end-page: 523 ident: bib0015 article-title: Sequential model-based optimization for general algorithm configuration publication-title: Proceedings of the 5th international conference of lecture notes in computer science learning and intelligent optimization, LION 5, volume 6683 – volume: 96 start-page: 636 year: 1997 end-page: 644 ident: bib0049 article-title: Heuristic approaches for n/m/F/ΣCi scheduling problems publication-title: European Journal of Operational Research – reference: . – volume: 2 start-page: 13 year: 2015 end-page: 23 ident: bib0020 article-title: Trajectory scheduling methods for minimizing total tardiness in a flowshop publication-title: Operations Research Perspectives – reference: M. López-Ibáñez, K. Marie-Eléonore, and T. Stützle, Automatic design of hybrid metaheuristics from algorithmic components, Tech. Rep. TR/IRIDIA/2017-012, IRIDIA, Université Libre de Bruxelles, Belgium (Dec. 2017), – start-page: 363 year: 2010 end-page: 397 ident: bib0026 article-title: Iterated local search: Framework and applications publication-title: Handbook of metaheuristics, volume 146 of international series in operations research & management science, chapter 9 – volume: 222 start-page: 31 year: 2012 end-page: 43 ident: bib0036 article-title: Local search methods for the flowshop scheduling problem with flowtime minimization publication-title: European Journal of Operational Research – volume: 45 start-page: 60 year: 2014 end-page: 67 ident: bib0005 article-title: On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem publication-title: Computers & Operations Research – start-page: 517 year: 2009 end-page: 524 ident: bib0018 article-title: SATenstein: Automatically building local search SAT solvers from components publication-title: Proceedings of the twenty-first international joint conference on artificial intelligence (IJCAI-09) – start-page: 517 year: 2009 ident: 10.1016/j.ejor.2019.01.018_bib0018 article-title: SATenstein: Automatically building local search SAT solvers from components – start-page: 321 year: 2013 ident: 10.1016/j.ejor.2019.01.018_bib0028 article-title: From grammars to parameters: Automatic iterated greedy design for the permutation flow-shop problem with weighted tardiness – volume: 81 start-page: 160 year: 2017 ident: 10.1016/j.ejor.2019.01.018_bib0004 article-title: An iterated greedy algorithm with optimization of partial solutions for the permutation flowshop problem publication-title: Computers & Operations Research doi: 10.1016/j.cor.2016.12.021 – volume: 16 start-page: 406 issue: 7 year: 2012 ident: 10.1016/j.ejor.2019.01.018_bib0001 article-title: Grammatical evolution of local search heuristics publication-title: IEEE Transactions on Evolutionary Computation doi: 10.1109/TEVC.2011.2160401 – volume: 36 start-page: 1664 issue: 5 year: 2009 ident: 10.1016/j.ejor.2019.01.018_bib0003 article-title: An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion publication-title: Computers & Operations Research doi: 10.1016/j.cor.2008.04.001 – volume: 55 start-page: 795 issue: 4 year: 2008 ident: 10.1016/j.ejor.2019.01.018_bib0037 article-title: A discrete differential evolution algorithm for the permutation flowshop scheduling problem publication-title: Computers and Industrial Engineering doi: 10.1016/j.cie.2008.03.003 – volume: 96 start-page: 636 issue: 3 year: 1997 ident: 10.1016/j.ejor.2019.01.018_bib0049 article-title: Heuristic approaches for n/m/F/ΣCi scheduling problems publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(95)00347-9 – volume: 45 start-page: 60 year: 2014 ident: 10.1016/j.ejor.2019.01.018_bib0005 article-title: On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem publication-title: Computers & Operations Research doi: 10.1016/j.cor.2013.12.012 – volume: 177 start-page: 1930 issue: 3 year: 2007 ident: 10.1016/j.ejor.2019.01.018_bib0044 article-title: A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2005.12.024 – volume: 130 start-page: 449 issue: 3 year: 2001 ident: 10.1016/j.ejor.2019.01.018_bib0010 article-title: Variable neighborhood search: Principles and applications publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(00)00100-4 – volume: 35 start-page: 1350 issue: 4 year: 2008 ident: 10.1016/j.ejor.2019.01.018_bib0048 article-title: Minimising total tardiness in the m-machine flowshop problem: A review and evaluation of heuristics and metaheuristics publication-title: Computers & Operations Research doi: 10.1016/j.cor.2006.08.016 – volume: 3 start-page: 63 issue: 1 year: 1997 ident: 10.1016/j.ejor.2019.01.018_bib0012 article-title: Improved large-step Markov chain variants for the symmetric TSP publication-title: Journal of Heuristics doi: 10.1023/A:1009624916728 – volume: 234 start-page: 597 issue: 3 year: 2014 ident: 10.1016/j.ejor.2019.01.018_bib0021 article-title: A unified ant colony optimization algorithm for continuous optimization publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2013.10.024 – volume: 2 start-page: 13 year: 2015 ident: 10.1016/j.ejor.2019.01.018_bib0020 article-title: Trajectory scheduling methods for minimizing total tardiness in a flowshop publication-title: Operations Research Perspectives doi: 10.1016/j.orp.2014.12.001 – volume: 64 start-page: 278 issue: 2 year: 1993 ident: 10.1016/j.ejor.2019.01.018_bib0043 article-title: Benchmarks for basic scheduling problems publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(93)90182-M – volume: 42 start-page: 2289 issue: 11 year: 2004 ident: 10.1016/j.ejor.2019.01.018_bib0011 article-title: Scheduling in flowshops to minimize total tardiness of jobs publication-title: International Journal of Production Research doi: 10.1080/00207540310001657595 – volume: 155 start-page: 426 issue: 2 year: 2004 ident: 10.1016/j.ejor.2019.01.018_bib0040 article-title: Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(02)00908-6 – volume: 44 start-page: 19 issue: 1 year: 1993 ident: 10.1016/j.ejor.2019.01.018_bib0019 article-title: Heuristics for flowshop scheduling problems minimizing mean tardiness publication-title: Journal of the Operational Research Society doi: 10.1057/jors.1993.3 – volume: 21 start-page: 1087 year: 1953 ident: 10.1016/j.ejor.2019.01.018_bib0031 article-title: Equation of state calculations by fast computing machines publication-title: Journal of Chemical Physics doi: 10.1063/1.1699114 – volume: 132 start-page: 439 issue: 2 year: 2001 ident: 10.1016/j.ejor.2019.01.018_bib0022 article-title: Constructive and composite heuristic solutions to the P//ΣCi scheduling problem publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(00)00137-5 – volume: 20 start-page: 451 issue: 3 year: 2008 ident: 10.1016/j.ejor.2019.01.018_bib0032 article-title: A review and evaluation of multiobjective algorithms for the flowshop scheduling problem publication-title: INFORMS Journal on Computing doi: 10.1287/ijoc.1070.0258 – volume: 11 start-page: 1283 year: 2017 ident: 10.1016/j.ejor.2019.01.018_bib0034 article-title: Speeding up local search for the insert neighborhood in the weighted tardiness permutation flowshop problem publication-title: Optimization Letters doi: 10.1007/s11590-016-1086-5 – volume: 38 start-page: 57 issue: 1–2 year: 2010 ident: 10.1016/j.ejor.2019.01.018_bib0046 article-title: Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem publication-title: Omega doi: 10.1016/j.omega.2009.04.002 – ident: 10.1016/j.ejor.2019.01.018_bib0035 – volume: 198 start-page: 84 issue: 1 year: 2009 ident: 10.1016/j.ejor.2019.01.018_bib0045 article-title: A hybrid genetic local search algorithm for the permutation flowshop scheduling problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2008.08.023 – volume: 98 start-page: 300 year: 2016 ident: 10.1016/j.ejor.2019.01.018_sbref0017 article-title: A hybrid iterated greedy algorithm for total tardiness minimization in permutation flowshops publication-title: Computers and Industrial Engineering doi: 10.1016/j.cie.2016.06.012 – volume: 94 start-page: 58 year: 2018 ident: 10.1016/j.ejor.2019.01.018_bib0008 article-title: Iterated-greedy-based algorithms with beam search initialization for the permutation flowshop to minimise total tardiness publication-title: Expert Systems with Applications doi: 10.1016/j.eswa.2017.10.050 – ident: 10.1016/j.ejor.2019.01.018_bib0024 – volume: 240 start-page: 666 issue: 3 year: 2015 ident: 10.1016/j.ejor.2019.01.018_bib0047 article-title: New hard benchmark for flowshop scheduling problems minimising makespan publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2014.07.033 – volume: 81 start-page: 167 year: 2017 ident: 10.1016/j.ejor.2019.01.018_bib0006 article-title: A beam-search-based constructive heuristic for the PFSP to minimise total flowtime publication-title: Computers & Operations Research doi: 10.1016/j.cor.2016.12.020 – year: 2014 ident: 10.1016/j.ejor.2019.01.018_bib0009 article-title: Manufacturing scheduling systems: An integrated view on models – volume: 3 start-page: 43 year: 2016 ident: 10.1016/j.ejor.2019.01.018_bib0023 article-title: The irace package: Iterated racing for automatic algorithm configuration publication-title: Operations Research Perspectives doi: 10.1016/j.orp.2016.09.002 – volume: 177 start-page: 2033 issue: 3 year: 2007 ident: 10.1016/j.ejor.2019.01.018_bib0041 article-title: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2005.12.009 – volume: 16 start-page: 861 issue: 6 year: 2012 ident: 10.1016/j.ejor.2019.01.018_bib0025 article-title: The automatic design of multi-objective ant colony optimization algorithms publication-title: IEEE Transactions on Evolutionary Computation doi: 10.1109/TEVC.2011.2182651 – volume: 55 start-page: 70 issue: 2 year: 2012 ident: 10.1016/j.ejor.2019.01.018_bib0013 article-title: Programming by optimization publication-title: Communications of the ACM doi: 10.1145/2076450.2076469 – start-page: 363 year: 2010 ident: 10.1016/j.ejor.2019.01.018_sbref0026 article-title: Iterated local search: Framework and applications – volume: 1 start-page: 61 year: 1954 ident: 10.1016/j.ejor.2019.01.018_bib0016 article-title: Optimal two- and three-stage production scheduling with setup times included publication-title: Naval Research Logistics Quarterly doi: 10.1002/nav.3800010110 – volume: 11 start-page: 365 issue: 3–4 year: 2010 ident: 10.1016/j.ejor.2019.01.018_bib0030 article-title: Grammar-based genetic programming: A survey publication-title: Genetic Programming and Evolvable Machines doi: 10.1007/s10710-010-9109-y – volume: 257 start-page: 707 issue: 3 year: 2017 ident: 10.1016/j.ejor.2019.01.018_bib0007 article-title: A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2016.09.055 – volume: 103 start-page: 129 issue: 1 year: 1997 ident: 10.1016/j.ejor.2019.01.018_bib0039 article-title: An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(96)00273-1 – volume: 222 start-page: 31 issue: 1 year: 2012 ident: 10.1016/j.ejor.2019.01.018_bib0036 article-title: Local search methods for the flowshop scheduling problem with flowtime minimization publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2012.04.034 – start-page: 144 year: 2013 ident: 10.1016/j.ejor.2019.01.018_bib0027 article-title: Automatic design of hybrid stochastic local search algorithms – volume: 11 start-page: 91 issue: 1 year: 1983 ident: 10.1016/j.ejor.2019.01.018_bib0033 article-title: A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem publication-title: Omega doi: 10.1016/0305-0483(83)90088-9 – start-page: 507 year: 2011 ident: 10.1016/j.ejor.2019.01.018_bib0015 article-title: Sequential model-based optimization for general algorithm configuration – volume: 37 start-page: 331 issue: 2 year: 2009 ident: 10.1016/j.ejor.2019.01.018_bib0038 article-title: New high performing heuristics for minimizing makespan in permutation flowshops publication-title: Omega doi: 10.1016/j.omega.2007.02.002 – year: 2005 ident: 10.1016/j.ejor.2019.01.018_bib0014 – volume: 47 start-page: 65 issue: 1 year: 1990 ident: 10.1016/j.ejor.2019.01.018_bib0042 article-title: Some efficient heuristic methods for the flow shop sequencing problem publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(90)90090-X – volume: 10 start-page: 357 issue: 3 year: 2004 ident: 10.1016/j.ejor.2019.01.018_bib0002 article-title: ParadisEO: A framework for the reusable design of parallel and distributed metaheuristics publication-title: Journal of Heuristics doi: 10.1023/B:HEUR.0000026900.92269.ec – volume: 51 start-page: 190 year: 2014 ident: 10.1016/j.ejor.2019.01.018_bib0029 article-title: Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools publication-title: Computers & Operations Research doi: 10.1016/j.cor.2014.05.020 |
| SSID | ssj0001515 |
| Score | 2.4999833 |
| Snippet | •We present a system for the automatic design of Hybrid Stochastic Local Searches.•Algorithms are obtained by combining components following rules defined by a... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 409 |
| SubjectTerms | Automatic algorithm design Scheduling Stochastic local search |
| Title | Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems |
| URI | https://dx.doi.org/10.1016/j.ejor.2019.01.018 |
| Volume | 276 |
| WOSCitedRecordID | wos000463296300002&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-6860 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001515 issn: 0377-2217 databaseCode: AIEXJ dateStart: 19950105 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1db9MwFLXKhhA88FFAG1_yA29RpsRxavuxTJsAoWkSQ-pb5DgOXVWSqk230X_Av-Y6ttPAYAIkpMqqrLpNfU_s45t7z0XoNedJEfM8ClOZFiEVKodbSskw5zkvhOSJtjqzH9jJCZ9MxOlg8M3nwlzMWVXxqyux-K-mhj4wtkmd_Qtzd18KHfAejA4tmB3aPzL8eN3UVoe1aKMzWjr41SRmBUD01FQaZeag3cMC5_OQ88_18ryZWnEGI2X8Ze2jEOf15WpaLwJXeWb1W1e-o7XQsfQORqck1HmcT01Y32bTBhAcGxULgGHn4mnMM_s3h83GBjj3IpecU6LNgwptzqT1lF3LlrEZWoyFhNhczQNtF1zOSDjitqaAX5GJLQnjoEd66yuNRG-rpja5-touYB0SswM9q43kayxaZVa3zv-orv3RXJS5JiCyhjqzW2iXsFTAArk7fnc0ed9t64b5tY-k3J9wGVg2WPDnX_o1y-kxl7OH6L47cuCxhcojNNDVEN3xGQ9D9MBX9sBuoR-iez2Zysco6yCFLaRwXWILKbyFFG4hha3F8RZSGCCFe5DCHlLYQ-oJ-nR8dHb4NnSFOUIFBmhCYvyFtASqVyY5F5ppCQ0vmCxScyDPC05pXsLJNhcjJmmp4VSgBCkk0dAlkqdop6orvYewkoorWqajPJK0oDGnmke6ICpNpSKJ2Eexn8hMOdV6UzxlnvnwxFlmJj8zk59FMbz4Pgq6MQur2XLjp1Nvn8yxTssmM4DTDeOe_eO45-ju9o55gXaa5Vq_RLfVRXO-Wr5yqPsOToer6w |
| 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=Automatic+design+of+hybrid+stochastic+local+search+algorithms+for+permutation+flowshop+problems&rft.jtitle=European+journal+of+operational+research&rft.au=Pagnozzi%2C+Federico&rft.au=St%C3%BCtzle%2C+Thomas&rft.date=2019-07-16&rft.pub=Elsevier+B.V&rft.issn=0377-2217&rft.eissn=1872-6860&rft.volume=276&rft.issue=2&rft.spage=409&rft.epage=421&rft_id=info:doi/10.1016%2Fj.ejor.2019.01.018&rft.externalDocID=S0377221719300207 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0377-2217&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0377-2217&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0377-2217&client=summon |