A discrete particle swarm optimization algorithm with self-adaptive diversity control for the permutation flowshop problem with blocking
[Display omitted] ► ► Several operators are proposed to construct the update mechanism of particles in the proposed discrete particle swarm optimization algorithm. ► A self-adaptive diversity control strategy is adopted to prevent the DPSO from premature convergence. ► A stochastic variable neighbor...
Gespeichert in:
| Veröffentlicht in: | Applied soft computing Jg. 12; H. 2; S. 652 - 662 |
|---|---|
| Hauptverfasser: | , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Elsevier B.V
01.02.2012
|
| Schlagworte: | |
| ISSN: | 1568-4946, 1872-9681 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | [Display omitted]
► ► Several operators are proposed to construct the update mechanism of particles in the proposed discrete particle swarm optimization algorithm. ► A self-adaptive diversity control strategy is adopted to prevent the DPSO from premature convergence. ► A stochastic variable neighborhood search is used as the local search to improve the search intensification. ► Computational results show that the proposed DPSO algorithm can obtain 111 new best known upper bounds for the 120 benchmark problems.
This paper proposes a discrete particle swarm optimization (DPSO) algorithm for the
m-machine permutation flowshop scheduling problem with blocking to minimize the makespan, which has a strong industrial background, e.g., many production processes of chemicals and pharmaceuticals in chemical industry can be reduced to this problem. To prevent the DPSO from premature convergence, a self-adaptive diversity control strategy is adopted to diversify the population when necessary by adding a random perturbation to the velocity of each particle according to a probability controlled by the diversity of the current population. In addition, a stochastic variable neighborhood search is used as the local search to improve the search intensification. Computational results using benchmark problems show that the proposed DPSO algorithm outperforms previous algorithms proposed in the literature and that it can obtain 111 new best known upper bounds for the 120 benchmark problems. |
|---|---|
| AbstractList | [Display omitted]
► ► Several operators are proposed to construct the update mechanism of particles in the proposed discrete particle swarm optimization algorithm. ► A self-adaptive diversity control strategy is adopted to prevent the DPSO from premature convergence. ► A stochastic variable neighborhood search is used as the local search to improve the search intensification. ► Computational results show that the proposed DPSO algorithm can obtain 111 new best known upper bounds for the 120 benchmark problems.
This paper proposes a discrete particle swarm optimization (DPSO) algorithm for the
m-machine permutation flowshop scheduling problem with blocking to minimize the makespan, which has a strong industrial background, e.g., many production processes of chemicals and pharmaceuticals in chemical industry can be reduced to this problem. To prevent the DPSO from premature convergence, a self-adaptive diversity control strategy is adopted to diversify the population when necessary by adding a random perturbation to the velocity of each particle according to a probability controlled by the diversity of the current population. In addition, a stochastic variable neighborhood search is used as the local search to improve the search intensification. Computational results using benchmark problems show that the proposed DPSO algorithm outperforms previous algorithms proposed in the literature and that it can obtain 111 new best known upper bounds for the 120 benchmark problems. |
| Author | Wang, Xianpeng Tang, Lixin |
| Author_xml | – sequence: 1 givenname: Xianpeng surname: Wang fullname: Wang, Xianpeng – sequence: 2 givenname: Lixin surname: Tang fullname: Tang, Lixin email: qhjytlx@mail.neu.edu.cn |
| BookMark | eNp9kLtOxDAQRS0EEs8foPIPJNjeJDgSDUK8JCQaqC1nPGa9OHFkm13BF_DZeLVUFDRzp5hzpLnHZH8KExJyzlnNGe8uVrVOAWrBOK9ZXzPB98gRl5ei6jvJ98vedrJq-qY7JMcprViBeiGPyPc1NS5BxIx01jE78EjTRseRhjm70X3p7MJEtX8L0eXlSDdl0oTeVtrocrLGYlhjTC5_UghTjsFTGyLNy6LEOH7kncL6sEnLMNM5hsHjr2nwAd7d9HZKDqz2Cc9-84S83t2-3DxUT8_3jzfXTxUsGMsV7zphTQsgjNVt00LTWCkXA7ABbImysIHzAdpGcmF6Y3rQbSuRY89BiMUJETsvxJBSRKvm6EYdPxVnatulWqltl2rbpWK9Kl0WSP6BwO2-ylE7_z96tUOxPLV2GFUChxOgcREhKxPcf_gPFsOXhw |
| CitedBy_id | crossref_primary_10_1016_j_swevo_2019_100572 crossref_primary_10_1016_j_eswa_2018_06_020 crossref_primary_10_4018_ijaec_2020070104 crossref_primary_10_1016_j_eswa_2019_06_069 crossref_primary_10_1080_00207543_2013_848042 crossref_primary_10_1016_j_asoc_2016_11_031 crossref_primary_10_1007_s10489_019_01457_w crossref_primary_10_1177_1687814018765535 crossref_primary_10_1109_ACCESS_2022_3155642 crossref_primary_10_1016_j_cor_2019_104812 crossref_primary_10_1007_s10489_021_02406_2 crossref_primary_10_1007_s12065_025_01035_9 crossref_primary_10_1016_j_asoc_2012_08_012 crossref_primary_10_1016_j_asoc_2019_05_007 crossref_primary_10_1016_j_asoc_2020_106343 crossref_primary_10_1016_j_asoc_2021_107834 crossref_primary_10_1016_j_jclepro_2019_07_053 crossref_primary_10_1007_s00521_022_08044_0 crossref_primary_10_1016_j_asoc_2014_10_015 crossref_primary_10_1016_j_ejor_2025_08_002 crossref_primary_10_1016_j_simpat_2017_09_001 crossref_primary_10_1016_j_biosystemseng_2021_12_018 crossref_primary_10_1080_0305215X_2017_1353090 crossref_primary_10_1016_j_swevo_2017_12_005 crossref_primary_10_1007_s00500_013_1199_z crossref_primary_10_1016_j_asoc_2014_07_002 crossref_primary_10_1016_j_asoc_2021_107444 crossref_primary_10_1109_TASE_2012_2219860 crossref_primary_10_1016_j_asoc_2014_12_011 crossref_primary_10_1109_TETC_2014_2369957 crossref_primary_10_1155_2014_902950 crossref_primary_10_1007_s00521_022_08173_6 crossref_primary_10_3390_en12173260 crossref_primary_10_1007_s10845_017_1358_7 crossref_primary_10_1016_j_neucom_2013_07_009 crossref_primary_10_1016_j_swevo_2024_101533 crossref_primary_10_1016_j_knosys_2018_11_021 crossref_primary_10_3390_drones7010059 crossref_primary_10_1007_s00500_016_2062_9 crossref_primary_10_1016_j_cie_2017_07_037 crossref_primary_10_1016_j_engappai_2018_11_005 crossref_primary_10_1155_2015_548363 crossref_primary_10_1007_s00521_020_05174_1 crossref_primary_10_3390_biomimetics9090538 crossref_primary_10_4028_www_scientific_net_AMM_764_765_1390 crossref_primary_10_1080_00207543_2021_1973137 crossref_primary_10_1016_j_asoc_2013_11_003 crossref_primary_10_1007_s40815_017_0331_0 crossref_primary_10_1007_s10479_017_2465_8 crossref_primary_10_1016_j_cor_2015_07_010 crossref_primary_10_1080_0305215X_2014_928817 crossref_primary_10_1016_j_engappai_2018_09_005 crossref_primary_10_1080_00207543_2016_1177671 |
| Cites_doi | 10.1016/j.asoc.2009.11.023 10.1016/j.asoc.2008.03.001 10.1016/j.asoc.2010.11.010 10.1016/S0377-2217(99)00224-6 10.1016/j.asoc.2010.10.010 10.1016/j.ipl.2008.05.010 10.1145/322203.322213 10.1287/opre.48.1.177.12451 10.1016/j.asoc.2010.09.002 10.1016/j.asoc.2007.10.006 10.1016/j.asoc.2009.12.020 10.1016/j.asoc.2011.01.037 10.1016/j.asoc.2009.07.011 10.1016/j.omega.2005.07.004 10.1016/j.asoc.2010.08.022 10.1016/S0925-5273(99)00104-8 10.1016/j.cor.2005.07.020 10.1016/j.ejor.2007.10.044 10.1016/j.asoc.2009.11.014 10.1016/j.asoc.2011.05.033 10.1016/j.asoc.2009.08.014 10.1016/j.asoc.2011.06.003 10.1016/j.ejor.2005.12.024 10.1016/S0925-5273(03)00065-3 10.1016/j.asoc.2011.01.034 10.1016/j.asoc.2011.05.022 10.1287/ijoc.1060.0216 10.1016/j.asoc.2008.01.002 10.1016/j.micpro.2010.11.001 10.1287/opre.44.3.510 10.1016/0305-0483(83)90088-9 10.1016/0377-2217(93)90182-M 10.1287/opre.37.6.925 10.1016/S0305-0548(97)00031-2 10.1016/j.ejor.2004.04.017 10.1007/s10479-005-2444-3 10.1057/palgrave.jors.2601220 10.1016/j.asoc.2007.01.009 10.1016/j.asoc.2009.11.020 |
| ContentType | Journal Article |
| Copyright | 2011 Elsevier B.V. |
| Copyright_xml | – notice: 2011 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.asoc.2011.09.021 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1872-9681 |
| EndPage | 662 |
| ExternalDocumentID | 10_1016_j_asoc_2011_09_021 S1568494611004224 |
| GroupedDBID | --K --M .DC .~1 0R~ 1B1 1~. 1~5 23M 4.4 457 4G. 53G 5GY 5VS 6J9 7-5 71M 8P~ AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABFNM ABFRF ABJNI ABMAC ABXDB ABYKQ ACDAQ ACGFO ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADJOM ADMUD ADTZH AEBSH AECPX AEFWE AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CS3 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HVGLF HZ~ IHE J1W JJJVA KOM M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ SDF SDG SES SEW SPC SPCBC SST SSV SSZ T5K UHS UNMZH ~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-c300t-1662fd5cc2dfa545c44f883bc0bcf3bcbc00b11bc54812d9dd9ca558e1e91c223 |
| ISICitedReferencesCount | 63 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000298631400008&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1568-4946 |
| IngestDate | Sat Nov 29 02:08:17 EST 2025 Tue Nov 18 21:44:17 EST 2025 Fri Feb 23 02:27:59 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Keywords | Blocking Discrete particle swarm optimization Makespan Permutation flowshop |
| Language | English |
| License | https://www.elsevier.com/tdm/userlicense/1.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c300t-1662fd5cc2dfa545c44f883bc0bcf3bcbc00b11bc54812d9dd9ca558e1e91c223 |
| PageCount | 11 |
| ParticipantIDs | crossref_primary_10_1016_j_asoc_2011_09_021 crossref_citationtrail_10_1016_j_asoc_2011_09_021 elsevier_sciencedirect_doi_10_1016_j_asoc_2011_09_021 |
| PublicationCentury | 2000 |
| PublicationDate | 2012-02-01 |
| PublicationDateYYYYMMDD | 2012-02-01 |
| PublicationDate_xml | – month: 02 year: 2012 text: 2012-02-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationTitle | Applied soft computing |
| PublicationYear | 2012 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Ruiz, Maroto (bib0005) 2005; 165 El-Abd, Hassan, Anis, Kamel, Elmasry (bib0050) 2010; 10 Kuo, Yang (bib0065) 2011; 11 Ponnambalam, Jawahar, Chandrasekaran (bib0175) 2009 Mandal, Basu, Chakraborty (bib0055) 2008; 8 Zhang, Sun, Zhu, Yang (bib0060) 2008; 108 Kang, He (bib0185) 2011; 35 Chuanga, Yang, Li (bib0070) 2011; 11 Mladenović, Hansen (bib0225) 1997; 24 Liu, Liu, Chung, Cartes (bib0085) 2011; 11 Papadimitriou, Kanellakis (bib0020) 1980; 27 Chen (bib0075) 2011; 11 Kuoa, Chaob, Chiuc (bib0080) 2011; 11 Abadi, Hall, Sriskandarajah (bib0150) 2000; 48 Tasgetiren, Liang, Sevkli, Gencyilmaz (bib0030) 2007; 177 Niknama, Mojarradb, Meymand (bib0095) 2011; 11 Nickabadi, Ebadzadeh, Safabakhsh (bib0200) 2011; 11 Ronconi (bib0135) 2005; 138 Montgomery (bib0235) 2000 Grabowski, Pempera (bib0010) 2000; 125 Ganguly, Sahoo, Das (bib0120) 2011; 11 Kennedy, Eberhart (bib0165) 1995 Eberhart, Kennedy (bib0170) 1997 Chen, Zhao (bib0190) 2009; 9 Jin, Joshua, Lu, Liang, Douglas (bib0195) 2008; 8 Zhu, Liu (bib0205) 2004 Zhu, Liu (bib0210) 2004 Taillard (bib0230) 1993; 64 Anghinolfi, Paolucci (bib0040) 2009; 193 Valdez, Melin, Castillo (bib0090) 2011; 11 Nawaz, Enscore, Ham (bib0145) 1983; 11 Tsai, Lin (bib0115) 2011 Ronconi, Armentano (bib0130) 2001; 52 Cordón, Damas, Santamaría, Martí (bib0215) 2008; 20 Arefi, Haghifam (bib0110) 2011 Liao, Tseng, Luarn (bib0035) 2007; 34 Dattaa, Figueira (bib0100) 2011 McCormick, Pinedo, Shenker, Wolf (bib0140) 1989; 37 Pan, Wang, Gao (bib0160) 2011 Hall, Sriskandarajah (bib0015) 1996; 44 Al-Obeidat, Belacel, Carretero, Mahanti (bib0105) 2011 Caraffa, Ianes, Bagchi, Sriskandarajah (bib0155) 2001; 70 Mohemmed, Sahoo, Geok (bib0045) 2008; 8 Ronconi (bib0125) 2000; 87 Rameshkumar, Suresh, Mohanasundaram (bib0180) 2005 Chen, Li, Zhang, Lu (bib0220) 2010; 10 Grabowski, Pempera (bib0025) 2007; 35 Kuo (10.1016/j.asoc.2011.09.021_bib0065) 2011; 11 Ronconi (10.1016/j.asoc.2011.09.021_bib0135) 2005; 138 Nawaz (10.1016/j.asoc.2011.09.021_bib0145) 1983; 11 Liu (10.1016/j.asoc.2011.09.021_bib0085) 2011; 11 Hall (10.1016/j.asoc.2011.09.021_bib0015) 1996; 44 Montgomery (10.1016/j.asoc.2011.09.021_bib0235) 2000 Liao (10.1016/j.asoc.2011.09.021_bib0035) 2007; 34 Eberhart (10.1016/j.asoc.2011.09.021_bib0170) 1997 Ruiz (10.1016/j.asoc.2011.09.021_bib0005) 2005; 165 Jin (10.1016/j.asoc.2011.09.021_bib0195) 2008; 8 Ronconi (10.1016/j.asoc.2011.09.021_bib0125) 2000; 87 Al-Obeidat (10.1016/j.asoc.2011.09.021_bib0105) 2011 Mladenović (10.1016/j.asoc.2011.09.021_bib0225) 1997; 24 Anghinolfi (10.1016/j.asoc.2011.09.021_bib0040) 2009; 193 Arefi (10.1016/j.asoc.2011.09.021_bib0110) 2011 Tsai (10.1016/j.asoc.2011.09.021_bib0115) 2011 Chen (10.1016/j.asoc.2011.09.021_bib0075) 2011; 11 Kuoa (10.1016/j.asoc.2011.09.021_bib0080) 2011; 11 El-Abd (10.1016/j.asoc.2011.09.021_bib0050) 2010; 10 Zhang (10.1016/j.asoc.2011.09.021_bib0060) 2008; 108 Rameshkumar (10.1016/j.asoc.2011.09.021_bib0180) 2005 Mandal (10.1016/j.asoc.2011.09.021_bib0055) 2008; 8 Ponnambalam (10.1016/j.asoc.2011.09.021_bib0175) 2009 Cordón (10.1016/j.asoc.2011.09.021_bib0215) 2008; 20 Pan (10.1016/j.asoc.2011.09.021_bib0160) 2011 Dattaa (10.1016/j.asoc.2011.09.021_bib0100) 2011 Ronconi (10.1016/j.asoc.2011.09.021_bib0130) 2001; 52 Abadi (10.1016/j.asoc.2011.09.021_bib0150) 2000; 48 Ganguly (10.1016/j.asoc.2011.09.021_bib0120) 2011; 11 Grabowski (10.1016/j.asoc.2011.09.021_bib0010) 2000; 125 Nickabadi (10.1016/j.asoc.2011.09.021_bib0200) 2011; 11 Mohemmed (10.1016/j.asoc.2011.09.021_bib0045) 2008; 8 Caraffa (10.1016/j.asoc.2011.09.021_bib0155) 2001; 70 Taillard (10.1016/j.asoc.2011.09.021_bib0230) 1993; 64 Papadimitriou (10.1016/j.asoc.2011.09.021_bib0020) 1980; 27 Chen (10.1016/j.asoc.2011.09.021_bib0220) 2010; 10 Chuanga (10.1016/j.asoc.2011.09.021_bib0070) 2011; 11 McCormick (10.1016/j.asoc.2011.09.021_bib0140) 1989; 37 Kennedy (10.1016/j.asoc.2011.09.021_bib0165) 1995 Zhu (10.1016/j.asoc.2011.09.021_bib0205) 2004 Tasgetiren (10.1016/j.asoc.2011.09.021_bib0030) 2007; 177 Kang (10.1016/j.asoc.2011.09.021_bib0185) 2011; 35 Grabowski (10.1016/j.asoc.2011.09.021_bib0025) 2007; 35 Valdez (10.1016/j.asoc.2011.09.021_bib0090) 2011; 11 Zhu (10.1016/j.asoc.2011.09.021_bib0210) 2004 Niknama (10.1016/j.asoc.2011.09.021_bib0095) 2011; 11 Chen (10.1016/j.asoc.2011.09.021_bib0190) 2009; 9 |
| References_xml | – start-page: 1942 year: 1995 end-page: 1948 ident: bib0165 article-title: Particle swarm optimization publication-title: Proceedings of the IEEE International Conference on Neural Network – volume: 138 start-page: 53 year: 2005 end-page: 65 ident: bib0135 article-title: A branch-and-bound algorithm to minimize the makespan in a flowshop problem with blocking publication-title: Ann. Oper. Res. – volume: 11 start-page: 605 year: 2011 end-page: 613 ident: bib0065 article-title: Simulation optimization using particle swarm optimization algorithm with application to assembly line design publication-title: Appl. Soft Comput. – volume: 11 start-page: 91 year: 1983 end-page: 95 ident: bib0145 article-title: A heuristic algorithm for the m-machine, n-job flow shop sequencing problem publication-title: Omega – Int. J. Manage. Sci. – volume: 11 start-page: 239 year: 2011 end-page: 248 ident: bib0070 article-title: Chaotic maps based on binary particle swarm optimization for feature selection publication-title: Appl. Soft Comput. – start-page: 4104 year: 1997 end-page: 4108 ident: bib0170 article-title: A discrete binary version of the particle swarm algorithm publication-title: Proceedings of the IEEE International Conference on Systems, Man and Cybernetics – volume: 11 start-page: 3658 year: 2011 end-page: 3670 ident: bib0200 article-title: A novel particle swarm optimization algorithm with adaptive inertia weight publication-title: Appl. Soft Comput. – volume: 8 start-page: 1643 year: 2008 end-page: 1653 ident: bib0045 article-title: Solving shortest path problem using particle swarm optimization publication-title: Appl. Soft Comput. – volume: 35 start-page: 302 year: 2007 end-page: 311 ident: bib0025 article-title: The permutation flow shop problem with blocking. A tabu search approach publication-title: Omega – Int. J. Manage. Sci. – volume: 193 start-page: 73 year: 2009 end-page: 85 ident: bib0040 article-title: A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times publication-title: Eur. J. Oper. Res. – volume: 10 start-page: 284 year: 2010 end-page: 295 ident: bib0050 article-title: Discrete cooperative particle swarm optimization for FPGA placement publication-title: Appl. Soft Comput. – year: 2011 ident: bib0115 article-title: Modification of the fish swarm algorithm with particle swarm optimization formulation and communication behavior publication-title: Appl. Soft Comput. – volume: 64 start-page: 278 year: 1993 end-page: 285 ident: bib0230 article-title: Benchmarks for basic scheduling problems publication-title: Eur. J. Oper. Res. – volume: 9 start-page: 39 year: 2009 end-page: 48 ident: bib0190 article-title: Particle swarm optimization with adaptive population size and its application publication-title: Appl. Soft Comput. – year: 2000 ident: bib0235 article-title: Design and Analysis of Experiments – year: 2011 ident: bib0100 article-title: A real-integer-discrete-coded particle swarm optimization for design problems publication-title: Appl. Soft Comput. – year: 2009 ident: bib0175 publication-title: Discrete particle swarm optimization algorithm for flowshop scheduling. in: Particle swarm optimization – volume: 10 start-page: 367 year: 2010 end-page: 373 ident: bib0220 article-title: A novel particle swarm optimizer hybridized with extremal optimization publication-title: Appl. Soft Comput. – volume: 37 start-page: 925 year: 1989 end-page: 935 ident: bib0140 article-title: Sequencing in an assembly line with blocking to minimize cycle time publication-title: Oper. Res. – volume: 24 start-page: 1097 year: 1997 end-page: 1100 ident: bib0225 article-title: Variable neighborhood search publication-title: Comput. Oper. Res. – year: 2011 ident: bib0160 article-title: A chaotic harmony search algorithm for the flow shop scheduling problem with limited buffers publication-title: Appl. Soft Comput. – volume: 108 start-page: 204 year: 2008 end-page: 209 ident: bib0060 article-title: An improved particle swarm optimization algorithm for flowshop scheduling problem publication-title: Inf. Process. Lett. – volume: 11 start-page: 2391 year: 2011 end-page: 2405 ident: bib0120 article-title: Mono- and multi-objective planning of electrical distribution networks using particle swarm optimization publication-title: Appl. Soft Comput. – year: 2011 ident: bib0105 article-title: An evolutionary framework using particle swarm optimization for classification method PROAFTN publication-title: Appl. Soft Comput. – volume: 44 start-page: 510 year: 1996 end-page: 525 ident: bib0015 article-title: A survey of machine scheduling problems with blocking and no-wait in process publication-title: Oper. Res. – volume: 27 start-page: 533 year: 1980 end-page: 549 ident: bib0020 article-title: Flowshop scheduling with limited temporary storage publication-title: J. Assoc. Comput. Mach. – start-page: 537 year: 2004 end-page: 547 ident: bib0205 article-title: Population diversity in permutation-based genetic algorithm publication-title: Proceedings of the 15th European Conference on Machine Learning (ECML 2004), Lecture Notes in Computer Science, vol. 3201 – volume: 11 start-page: 2805 year: 2011 end-page: 2817 ident: bib0095 article-title: Non-smooth economic dispatch computation by fuzzy and self adaptive particle swarm optimization publication-title: Appl. Soft Comput. – volume: 87 start-page: 39 year: 2000 end-page: 48 ident: bib0125 article-title: A note on constructive heuristics for the flowshop problem with blocking publication-title: Int. J. Prod. Econ. – volume: 52 start-page: 1289 year: 2001 end-page: 1297 ident: bib0130 article-title: Lower bounding schemes for flowshops with blocking in-process publication-title: J. Oper. Res. Soc. – volume: 177 start-page: 1930 year: 2007 end-page: 1947 ident: bib0030 article-title: A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem publication-title: Eur. J. Oper. Res. – volume: 11 start-page: 295 year: 2011 end-page: 304 ident: bib0075 article-title: Two-layer particle swarm optimization for unconstrained optimization problems publication-title: Appl. Soft Comput. – volume: 8 start-page: 1392 year: 2008 end-page: 1399 ident: bib0055 article-title: Particle swarm optimization technique based short-term hydrothermal scheduling publication-title: Appl. Soft Comput. – volume: 11 start-page: 2625 year: 2011 end-page: 2632 ident: bib0090 article-title: An improved evolutionary method with fuzzy logic for combining particle swarm optimization and genetic algorithms publication-title: Appl. Soft Comput. – volume: 48 start-page: 177 year: 2000 end-page: 180 ident: bib0150 article-title: Minimizing cycle time in a blocking flowshop publication-title: Oper. Res. – volume: 34 start-page: 1899 year: 2007 end-page: 1909 ident: bib0035 article-title: A discrete version of particle swarm optimization for flowshop scheduling problems publication-title: Comput. Oper. Res. – volume: 20 start-page: 55 year: 2008 end-page: 68 ident: bib0215 article-title: Scatter search for the point-matching problem in 3D image registration publication-title: INFORMS J. Comput. – volume: 11 start-page: 2556 year: 2011 end-page: 2564 ident: bib0085 article-title: Real-time particle swarm optimization based parameter identification applied to permanent magnet synchronous machine publication-title: Appl. Soft Comput. – volume: 165 start-page: 479 year: 2005 end-page: 494 ident: bib0005 article-title: A comprehensive review and evaluation of permutation flowshop heuristics publication-title: Eur. J. Oper. Res. – volume: 35 start-page: 10 year: 2011 end-page: 17 ident: bib0185 article-title: A novel discrete particle swarm optimization algorithm for meta-task assignment in heterogeneous computing systems publication-title: Microprocess. Microsyst. – year: 2011 ident: bib0110 article-title: A modified particle swarm optimization for correlated phenomena publication-title: Appl. Soft Comput. – volume: 125 start-page: 535 year: 2000 end-page: 550 ident: bib0010 article-title: Sequencing of jobs in some production system publication-title: Eur. J. Oper. Res. – volume: 11 start-page: 326 year: 2011 end-page: 336 ident: bib0080 article-title: Application of particle swarm optimization to association rule mining publication-title: Appl. Soft Comput. – volume: 70 start-page: 101 year: 2001 end-page: 115 ident: bib0155 article-title: Minimizing makespan in a blocking flowshop using genetical gorithms publication-title: Int. J. Prod. Econ. – start-page: 572 year: 2005 end-page: 581 ident: bib0180 article-title: Discrete particle swarm optimization (DPSO) algorithm for permutation flowshop scheduling to minimize makespan publication-title: Proceedings of the First International Conference on Natural Computation – volume: 8 start-page: 295 year: 2008 end-page: 304 ident: bib0195 article-title: The landscape adaptive particle swarm optimizer publication-title: Appl. Soft Comput. – start-page: 420 year: 2004 end-page: 421 ident: bib0210 article-title: Empirical study of population diversity in permutation-based genetic algorithm publication-title: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2004), Lecture Notes in Computer Science, vol. 3103 – volume: 11 start-page: 326 year: 2011 ident: 10.1016/j.asoc.2011.09.021_bib0080 article-title: Application of particle swarm optimization to association rule mining publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2009.11.023 – volume: 9 start-page: 39 year: 2009 ident: 10.1016/j.asoc.2011.09.021_bib0190 article-title: Particle swarm optimization with adaptive population size and its application publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2008.03.001 – year: 2000 ident: 10.1016/j.asoc.2011.09.021_bib0235 – volume: 11 start-page: 2805 year: 2011 ident: 10.1016/j.asoc.2011.09.021_bib0095 article-title: Non-smooth economic dispatch computation by fuzzy and self adaptive particle swarm optimization publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2010.11.010 – volume: 125 start-page: 535 year: 2000 ident: 10.1016/j.asoc.2011.09.021_bib0010 article-title: Sequencing of jobs in some production system publication-title: Eur. J. Oper. Res. doi: 10.1016/S0377-2217(99)00224-6 – volume: 11 start-page: 2625 year: 2011 ident: 10.1016/j.asoc.2011.09.021_bib0090 article-title: An improved evolutionary method with fuzzy logic for combining particle swarm optimization and genetic algorithms publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2010.10.010 – volume: 108 start-page: 204 year: 2008 ident: 10.1016/j.asoc.2011.09.021_bib0060 article-title: An improved particle swarm optimization algorithm for flowshop scheduling problem publication-title: Inf. Process. Lett. doi: 10.1016/j.ipl.2008.05.010 – start-page: 420 year: 2004 ident: 10.1016/j.asoc.2011.09.021_bib0210 article-title: Empirical study of population diversity in permutation-based genetic algorithm – volume: 27 start-page: 533 year: 1980 ident: 10.1016/j.asoc.2011.09.021_bib0020 article-title: Flowshop scheduling with limited temporary storage publication-title: J. Assoc. Comput. Mach. doi: 10.1145/322203.322213 – volume: 48 start-page: 177 year: 2000 ident: 10.1016/j.asoc.2011.09.021_bib0150 article-title: Minimizing cycle time in a blocking flowshop publication-title: Oper. Res. doi: 10.1287/opre.48.1.177.12451 – year: 2011 ident: 10.1016/j.asoc.2011.09.021_bib0110 article-title: A modified particle swarm optimization for correlated phenomena publication-title: Appl. Soft Comput. – volume: 11 start-page: 2391 year: 2011 ident: 10.1016/j.asoc.2011.09.021_bib0120 article-title: Mono- and multi-objective planning of electrical distribution networks using particle swarm optimization publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2010.09.002 – volume: 8 start-page: 1392 year: 2008 ident: 10.1016/j.asoc.2011.09.021_bib0055 article-title: Particle swarm optimization technique based short-term hydrothermal scheduling publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2007.10.006 – volume: 11 start-page: 605 year: 2011 ident: 10.1016/j.asoc.2011.09.021_bib0065 article-title: Simulation optimization using particle swarm optimization algorithm with application to assembly line design publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2009.12.020 – start-page: 4104 year: 1997 ident: 10.1016/j.asoc.2011.09.021_bib0170 article-title: A discrete binary version of the particle swarm algorithm – volume: 11 start-page: 3658 year: 2011 ident: 10.1016/j.asoc.2011.09.021_bib0200 article-title: A novel particle swarm optimization algorithm with adaptive inertia weight publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2011.01.037 – volume: 10 start-page: 284 year: 2010 ident: 10.1016/j.asoc.2011.09.021_bib0050 article-title: Discrete cooperative particle swarm optimization for FPGA placement publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2009.07.011 – volume: 35 start-page: 302 year: 2007 ident: 10.1016/j.asoc.2011.09.021_bib0025 article-title: The permutation flow shop problem with blocking. A tabu search approach publication-title: Omega – Int. J. Manage. Sci. doi: 10.1016/j.omega.2005.07.004 – volume: 11 start-page: 2556 year: 2011 ident: 10.1016/j.asoc.2011.09.021_bib0085 article-title: Real-time particle swarm optimization based parameter identification applied to permanent magnet synchronous machine publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2010.08.022 – volume: 70 start-page: 101 year: 2001 ident: 10.1016/j.asoc.2011.09.021_bib0155 article-title: Minimizing makespan in a blocking flowshop using genetical gorithms publication-title: Int. J. Prod. Econ. doi: 10.1016/S0925-5273(99)00104-8 – year: 2009 ident: 10.1016/j.asoc.2011.09.021_bib0175 – volume: 34 start-page: 1899 year: 2007 ident: 10.1016/j.asoc.2011.09.021_bib0035 article-title: A discrete version of particle swarm optimization for flowshop scheduling problems publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2005.07.020 – volume: 193 start-page: 73 year: 2009 ident: 10.1016/j.asoc.2011.09.021_bib0040 article-title: A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2007.10.044 – volume: 11 start-page: 239 year: 2011 ident: 10.1016/j.asoc.2011.09.021_bib0070 article-title: Chaotic maps based on binary particle swarm optimization for feature selection publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2009.11.014 – year: 2011 ident: 10.1016/j.asoc.2011.09.021_bib0160 article-title: A chaotic harmony search algorithm for the flow shop scheduling problem with limited buffers publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2011.05.033 – start-page: 572 year: 2005 ident: 10.1016/j.asoc.2011.09.021_bib0180 article-title: Discrete particle swarm optimization (DPSO) algorithm for permutation flowshop scheduling to minimize makespan – volume: 10 start-page: 367 year: 2010 ident: 10.1016/j.asoc.2011.09.021_bib0220 article-title: A novel particle swarm optimizer hybridized with extremal optimization publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2009.08.014 – year: 2011 ident: 10.1016/j.asoc.2011.09.021_bib0105 article-title: An evolutionary framework using particle swarm optimization for classification method PROAFTN publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2011.06.003 – volume: 177 start-page: 1930 issue: 3 year: 2007 ident: 10.1016/j.asoc.2011.09.021_bib0030 article-title: A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2005.12.024 – start-page: 1942 year: 1995 ident: 10.1016/j.asoc.2011.09.021_bib0165 article-title: Particle swarm optimization – volume: 87 start-page: 39 year: 2000 ident: 10.1016/j.asoc.2011.09.021_bib0125 article-title: A note on constructive heuristics for the flowshop problem with blocking publication-title: Int. J. Prod. Econ. doi: 10.1016/S0925-5273(03)00065-3 – year: 2011 ident: 10.1016/j.asoc.2011.09.021_bib0100 article-title: A real-integer-discrete-coded particle swarm optimization for design problems publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2011.01.034 – year: 2011 ident: 10.1016/j.asoc.2011.09.021_bib0115 article-title: Modification of the fish swarm algorithm with particle swarm optimization formulation and communication behavior publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2011.05.022 – volume: 20 start-page: 55 year: 2008 ident: 10.1016/j.asoc.2011.09.021_bib0215 article-title: Scatter search for the point-matching problem in 3D image registration publication-title: INFORMS J. Comput. doi: 10.1287/ijoc.1060.0216 – start-page: 537 year: 2004 ident: 10.1016/j.asoc.2011.09.021_bib0205 article-title: Population diversity in permutation-based genetic algorithm – volume: 8 start-page: 1643 year: 2008 ident: 10.1016/j.asoc.2011.09.021_bib0045 article-title: Solving shortest path problem using particle swarm optimization publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2008.01.002 – volume: 35 start-page: 10 year: 2011 ident: 10.1016/j.asoc.2011.09.021_bib0185 article-title: A novel discrete particle swarm optimization algorithm for meta-task assignment in heterogeneous computing systems publication-title: Microprocess. Microsyst. doi: 10.1016/j.micpro.2010.11.001 – volume: 44 start-page: 510 year: 1996 ident: 10.1016/j.asoc.2011.09.021_bib0015 article-title: A survey of machine scheduling problems with blocking and no-wait in process publication-title: Oper. Res. doi: 10.1287/opre.44.3.510 – volume: 11 start-page: 91 issue: 1 year: 1983 ident: 10.1016/j.asoc.2011.09.021_bib0145 article-title: A heuristic algorithm for the m-machine, n-job flow shop sequencing problem publication-title: Omega – Int. J. Manage. Sci. doi: 10.1016/0305-0483(83)90088-9 – volume: 64 start-page: 278 year: 1993 ident: 10.1016/j.asoc.2011.09.021_bib0230 article-title: Benchmarks for basic scheduling problems publication-title: Eur. J. Oper. Res. doi: 10.1016/0377-2217(93)90182-M – volume: 37 start-page: 925 year: 1989 ident: 10.1016/j.asoc.2011.09.021_bib0140 article-title: Sequencing in an assembly line with blocking to minimize cycle time publication-title: Oper. Res. doi: 10.1287/opre.37.6.925 – volume: 24 start-page: 1097 year: 1997 ident: 10.1016/j.asoc.2011.09.021_bib0225 article-title: Variable neighborhood search publication-title: Comput. Oper. Res. doi: 10.1016/S0305-0548(97)00031-2 – volume: 165 start-page: 479 year: 2005 ident: 10.1016/j.asoc.2011.09.021_bib0005 article-title: A comprehensive review and evaluation of permutation flowshop heuristics publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2004.04.017 – volume: 138 start-page: 53 issue: 1 year: 2005 ident: 10.1016/j.asoc.2011.09.021_bib0135 article-title: A branch-and-bound algorithm to minimize the makespan in a flowshop problem with blocking publication-title: Ann. Oper. Res. doi: 10.1007/s10479-005-2444-3 – volume: 52 start-page: 1289 year: 2001 ident: 10.1016/j.asoc.2011.09.021_bib0130 article-title: Lower bounding schemes for flowshops with blocking in-process publication-title: J. Oper. Res. Soc. doi: 10.1057/palgrave.jors.2601220 – volume: 8 start-page: 295 year: 2008 ident: 10.1016/j.asoc.2011.09.021_bib0195 article-title: The landscape adaptive particle swarm optimizer publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2007.01.009 – volume: 11 start-page: 295 year: 2011 ident: 10.1016/j.asoc.2011.09.021_bib0075 article-title: Two-layer particle swarm optimization for unconstrained optimization problems publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2009.11.020 |
| SSID | ssj0016928 |
| Score | 2.2653587 |
| Snippet | [Display omitted]
► ► Several operators are proposed to construct the update mechanism of particles in the proposed discrete particle swarm optimization... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 652 |
| SubjectTerms | Blocking Discrete particle swarm optimization Makespan Permutation flowshop |
| Title | A discrete particle swarm optimization algorithm with self-adaptive diversity control for the permutation flowshop problem with blocking |
| URI | https://dx.doi.org/10.1016/j.asoc.2011.09.021 |
| Volume | 12 |
| WOSCitedRecordID | wos000298631400008&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-9681 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0016928 issn: 1568-4946 databaseCode: AIEXJ dateStart: 20010601 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1bb9MwFLbKxgMv3BHjJj_wFmXKPfZjhYYATRMSBfUt8i2sW5pEbbr1J_C8X7zj2M6yDU2AxEtqubGb9vt6fOJ85xyE3gcZZ4nMqJ-HgvpJJLnPExL6JZGMxDomuM_2-eMwPzoi8zn9OplcuFiYsyqva7Ld0va_Qg19ALYOnf0LuIdJoQPaADocAXY4_hHwU_3QBXzBTnmtfdtbn7PV0mvAPCxt3KXHqp_NatEdL61KXVWlzyRreymRHNQaTsru1IgtWPKNUyhWzfn6uGk9W5XGzMRheTx1C6LLb2t93TUY_V7FvuncGf1mvjE4c6Bqq676Z7b_cLG1-cHt9oTWeVyTetyOmzFmNiN-Qu3mozJ9JI98mpkCLoNtjkYcjEaGNjN5b-2anRmLfms5MDsTJ_sMmG7TtdL9wIRk30iz_U1fk76kPoceODb30G6UpxQs5e7088H8y_BsKqN9xd7hO9hQLKMavPlJv3d3Ri7M7DF6aO898NSQ4gmaqPopeuTqemBr5p-hX1PsKIQdhXBPITymEB4ohDXw-BqF8EAhbCmEgUIYKIRHFMKOQthSyMzkKPQcff94MPvwybcVO3wRB0HnhwBEKVMhIlky8M1FkpSExFwEXJTwAo2AhyEXcJ8cRpJKSQVLU6JCRUMBnuoLtFM3tXqJcFzCgKCkgvI0YYoTaORZmqpExIQnbA-F7octhE1nr6uqVIXTLZ4UGoxCg1EEtAAw9pA3jGlNMpc7z04dXoV1R42bWQC97hj36h_HvUYPrv5Ab9BOt9qot-i-OOsW69U7y8JLMo-4pQ |
| 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+discrete+particle+swarm+optimization+algorithm+with+self-adaptive+diversity+control+for+the+permutation+flowshop+problem+with+blocking&rft.jtitle=Applied+soft+computing&rft.au=Wang%2C+Xianpeng&rft.au=Tang%2C+Lixin&rft.date=2012-02-01&rft.pub=Elsevier+B.V&rft.issn=1568-4946&rft.eissn=1872-9681&rft.volume=12&rft.issue=2&rft.spage=652&rft.epage=662&rft_id=info:doi/10.1016%2Fj.asoc.2011.09.021&rft.externalDocID=S1568494611004224 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1568-4946&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1568-4946&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1568-4946&client=summon |