An iterated local search algorithm for distributed assembly permutation flowshop problem
Nowadays, the distributed assembly permutation flowshop problem (DAPFSP) has important applications in practice. In this paper, we propose a group iterated local search (gILS) algorithm to solve the problem with total flowtime (TF) criterion. We use the heuristic method based on a ascending order, w...
Uložené v:
| Vydané v: | Chinese Control Conference s. 1548 - 1552 |
|---|---|
| Hlavní autori: | , , , , |
| Médium: | Konferenčný príspevok.. |
| Jazyk: | English |
| Vydavateľské údaje: |
Technical Committee on Control Theory, Chinese Association of Automation
01.07.2020
|
| Predmet: | |
| ISSN: | 1934-1768 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | Nowadays, the distributed assembly permutation flowshop problem (DAPFSP) has important applications in practice. In this paper, we propose a group iterated local search (gILS) algorithm to solve the problem with total flowtime (TF) criterion. We use the heuristic method based on a ascending order, which is originated from the NEH. In order to simplify and optimize the algorithm, we introduce two kinds of local search methods based on products and jobs respectively. In addition, considering the diversity of search area, we propose a probabilistic random selection based on the TF value and the number of iterations to determine the optimized solution. Acceptance criterion is a simple comparison to determine whether a new solution is acceptable or not. Finally, we calculate 180 instances with our proposed algorithm and compare the results with those from the recent effective algorithms. The results verify the superiority of the presented gILS algorithm. |
|---|---|
| AbstractList | Nowadays, the distributed assembly permutation flowshop problem (DAPFSP) has important applications in practice. In this paper, we propose a group iterated local search (gILS) algorithm to solve the problem with total flowtime (TF) criterion. We use the heuristic method based on a ascending order, which is originated from the NEH. In order to simplify and optimize the algorithm, we introduce two kinds of local search methods based on products and jobs respectively. In addition, considering the diversity of search area, we propose a probabilistic random selection based on the TF value and the number of iterations to determine the optimized solution. Acceptance criterion is a simple comparison to determine whether a new solution is acceptable or not. Finally, we calculate 180 instances with our proposed algorithm and compare the results with those from the recent effective algorithms. The results verify the superiority of the presented gILS algorithm. |
| Author | Hu, XiaoLu Huang, Jiang-ping Huang, Ying-Ying Pan, Quan-ke Tasgetiren, M Fatih |
| Author_xml | – sequence: 1 givenname: Ying-Ying surname: Huang fullname: Huang, Ying-Ying organization: Shanghai University,School of Mechanical and Electrical Engineering and Automation,Shanghai,200444 – sequence: 2 givenname: Quan-ke surname: Pan fullname: Pan, Quan-ke organization: Shanghai University,School of Mechanical and Electrical Engineering and Automation,Shanghai,200444 – sequence: 3 givenname: XiaoLu surname: Hu fullname: Hu, XiaoLu organization: China Rural Technology Development Center,Peking,100045 – sequence: 4 givenname: M Fatih surname: Tasgetiren fullname: Tasgetiren, M Fatih organization: Yasar University,International logistics management department,Izmir,Turkey – sequence: 5 givenname: Jiang-ping surname: Huang fullname: Huang, Jiang-ping organization: Shanghai University,School of Mechanical and Electrical Engineering and Automation,Shanghai,200444 |
| BookMark | eNotkMtKAzEYhaMo2NY-gSB5ganJZC75l2XwBgU3Cu5KJvljI5nJkKRI394Ruzqbcz74zpJcjWFEQu4525QCODx0XVcz1shNyUq2AS5lI8UFWUMrQUpeNwKYuCQLDqIqeNvIG7JM6XueMOBiQT63I3UZo8poqA9aeZpQRX2gyn-F6PJhoDZEalzK0fXHv5pKCYfen-iEcThmlV0YqfXhJx3CRKcYeo_DLbm2yidcn3NFPp4e37uXYvf2_Nptd4UrmcgFFxaMqbTiqHhtFCg0zEAz27S2amcby1tAWXNmG8FmVxSm6nWpNRjdGrEid_9ch4j7KbpBxdP-fIT4BWBzVpc |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.23919/CCC50068.2020.9188683 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Xplore POP ALL IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP All) 1998-Present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISBN | 9789881563903 9881563909 |
| EISSN | 1934-1768 |
| EndPage | 1552 |
| ExternalDocumentID | 9188683 |
| Genre | orig-research |
| GroupedDBID | 29B 6IE 6IF 6IK 6IL 6IN AAJGR AAWTH ABLEC ACGFS ADZIZ ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK CHZPO IEGSK IPLJI M43 OCL RIE RIL |
| ID | FETCH-LOGICAL-i203t-13f9dd4ca1ea15da9aed0d960207f47868f179e8510f630500e3d4bc2cc9dc7d3 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 1 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000629243501116&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Wed Aug 27 02:32:53 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i203t-13f9dd4ca1ea15da9aed0d960207f47868f179e8510f630500e3d4bc2cc9dc7d3 |
| PageCount | 5 |
| ParticipantIDs | ieee_primary_9188683 |
| PublicationCentury | 2000 |
| PublicationDate | 2020-July |
| PublicationDateYYYYMMDD | 2020-07-01 |
| PublicationDate_xml | – month: 07 year: 2020 text: 2020-July |
| PublicationDecade | 2020 |
| PublicationTitle | Chinese Control Conference |
| PublicationTitleAbbrev | ChiCC |
| PublicationYear | 2020 |
| Publisher | Technical Committee on Control Theory, Chinese Association of Automation |
| Publisher_xml | – name: Technical Committee on Control Theory, Chinese Association of Automation |
| SSID | ssj0060913 |
| Score | 2.1175842 |
| Snippet | Nowadays, the distributed assembly permutation flowshop problem (DAPFSP) has important applications in practice. In this paper, we propose a group iterated... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 1548 |
| SubjectTerms | Assembly line scheduling Distributed flowshop scheduling Heuristic algorithms Iterated local search Optimization Perturbation methods Production facilities Search problems Total flowtime |
| Title | An iterated local search algorithm for distributed assembly permutation flowshop problem |
| URI | https://ieeexplore.ieee.org/document/9188683 |
| WOSCitedRecordID | wos000629243501116&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 | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV27TsMwFL1qKwZYeLSItzwwktZxnDgeUQRiqjqA1K2KX7RSm1R9gPh7rpNQQGJhi6JEsez43nNtn3MAbh1VGPSwUnWIbwNukiTIWRIHWijFtPSac7wymxDDYToey1EL7nZcGGttdfjM9v1ltZdvSr31S2UDGaZpkkZtaAuR1Fytr6ibeH3LmgHMIhnKQZZlsec_YAnIaL9585eFSpVBHg__9-0j6H1T8chol2SOoWWLEzj4oSLYhfF9QWpxZGtIlZtI_f-SfP5aYvE_XRCEpsR4jVxvb4WPIWS2CzX_IEuMzNt6O564efm-npZL0rjM9ODl8eE5ewoaw4RgxmjkbeWdNIbrPLR5GBsvvG2owRqFUeG4wPY7nH8WQRZ1CU50Sm1kuNJMa2m0MNEpdIqysGdAEHiFVEnF81RxrKKUiFUaRUJRl3sJvHPo-j6aLGtNjEnTPRd_376EfT8M9THXK-hsVlt7DXv6bTNbr26qgfwE4fKgKA |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3JTsMwEB2VggRcWFrEjg8cSeskzuIjiqiKKFUPReqtijdaqW2qLiD-nnESCkhcuEVRolh2PPPG9nsP4NZQgUEPK1WD-NZhKgyd1AsDR0ZCeJJbzTmWm01E3W48GPBeBe42XBitdX74TDfsZb6XrzK5tktlTe7GcRj7W7AdMObRgq31FXdDq3BZcIA9n7u8mSRJYBkQWAR6tFG--8tEJc8hrYP_ff0Q6t9kPNLbpJkjqOjZMez_0BGsweB-Rgp5ZK1Inp1I8QeTdPKaYfk_mhIEp0RZlVxrcIWPIWjWUzH5IHOMzetiQ56YSfa-HGVzUvrM1OGl9dBP2k5pmeCMPepbY3nDlWIydXXqBspKbyuqsErxaGRYhO03OAM1wixqQpzqlGpfMSE9KbmSkfJPoDrLZvoUCEIvlwouWBoLhnWUiAIR-34kqEmtCN4Z1GwfDeeFKsaw7J7zv2_fwG67_9wZdh67TxewZ4ekOPR6CdXVYq2vYEe-rcbLxXU-qJ9jiKNv |
| 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%3Abook&rft.genre=proceeding&rft.title=Chinese+Control+Conference&rft.atitle=An+iterated+local+search+algorithm+for+distributed+assembly+permutation+flowshop+problem&rft.au=Huang%2C+Ying-Ying&rft.au=Pan%2C+Quan-ke&rft.au=Hu%2C+XiaoLu&rft.au=Tasgetiren%2C+M+Fatih&rft.date=2020-07-01&rft.pub=Technical+Committee+on+Control+Theory%2C+Chinese+Association+of+Automation&rft.eissn=1934-1768&rft.spage=1548&rft.epage=1552&rft_id=info:doi/10.23919%2FCCC50068.2020.9188683&rft.externalDocID=9188683 |