An effective iterated greedy algorithm for solving a multi-compartment AGV scheduling problem in a matrix manufacturing workshop
In this paper, we address a multi-compartment automatic guided vehicle scheduling (MC-AGVS) problem from a matrix manufacturing workshop that has attracted more and more attention of manufacturing firms in recent years. The problem aims to determine a solution to minimize the total cost including th...
Gespeichert in:
| Veröffentlicht in: | Applied soft computing Jg. 99; S. 106945 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Elsevier B.V
01.02.2021
|
| Schlagworte: | |
| ISSN: | 1568-4946, 1872-9681 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | In this paper, we address a multi-compartment automatic guided vehicle scheduling (MC-AGVS) problem from a matrix manufacturing workshop that has attracted more and more attention of manufacturing firms in recent years. The problem aims to determine a solution to minimize the total cost including the travel cost, the service cost, and the cost of vehicles involved. For this purpose, a mixed-integer linear programming model is first constructed. Then, a novel iterated greedy (IG) algorithm including accelerations for evaluating objective functions of neighboring solutions; an improved nearest-neighbor-based constructive heuristic; an improved sweep-based constructive heuristic; an improved destruction procedure; and a simulated annealing type of acceptance criterion is proposed. At last, a series of comparative experiments are implemented based on some real-world instances from an electronic equipment manufacturing enterprise. The computational results demonstrate that the proposed IG algorithm has generated substantially better solutions than the existing algorithms in solving the problem under consideration.
•A multi-compartment automatic guided vehicle scheduling problem is studied.•An effective iterated greedy algorithm is proposed.•Accelerations for evaluating solutions are presented.•The proposed algorithm is the best performing against all the existing methods. |
|---|---|
| AbstractList | In this paper, we address a multi-compartment automatic guided vehicle scheduling (MC-AGVS) problem from a matrix manufacturing workshop that has attracted more and more attention of manufacturing firms in recent years. The problem aims to determine a solution to minimize the total cost including the travel cost, the service cost, and the cost of vehicles involved. For this purpose, a mixed-integer linear programming model is first constructed. Then, a novel iterated greedy (IG) algorithm including accelerations for evaluating objective functions of neighboring solutions; an improved nearest-neighbor-based constructive heuristic; an improved sweep-based constructive heuristic; an improved destruction procedure; and a simulated annealing type of acceptance criterion is proposed. At last, a series of comparative experiments are implemented based on some real-world instances from an electronic equipment manufacturing enterprise. The computational results demonstrate that the proposed IG algorithm has generated substantially better solutions than the existing algorithms in solving the problem under consideration.
•A multi-compartment automatic guided vehicle scheduling problem is studied.•An effective iterated greedy algorithm is proposed.•Accelerations for evaluating solutions are presented.•The proposed algorithm is the best performing against all the existing methods. |
| ArticleNumber | 106945 |
| Author | Pan, Quan-Ke Zou, Wen-Qiang Tasgetiren, M. Fatih |
| Author_xml | – sequence: 1 givenname: Wen-Qiang surname: Zou fullname: Zou, Wen-Qiang organization: School of Mechatronic Engineering and Automation, Shanghai University, Shanghai 200072, PR China – sequence: 2 givenname: Quan-Ke surname: Pan fullname: Pan, Quan-Ke email: panquanke@shu.edu.cn organization: School of Mechatronic Engineering and Automation, Shanghai University, Shanghai 200072, PR China – sequence: 3 givenname: M. Fatih surname: Tasgetiren fullname: Tasgetiren, M. Fatih organization: International logistics management department, Yasar University, Izmir, Turkey |
| BookMark | eNp9kLFOwzAQhi1UJNrCCzD5BVJip04ciaWqoCBVYgFWy3HOrUtiR7ZT6Majk6hMDEz_6fR_J903QxPrLCB0S9IFSUl-d1jI4NSCpnRc5OWSXaAp4QVNypyTyTCznCfLcplfoVkIh3SASsqn6HtlMWgNKpojYBPBywg13nmA-oRls3PexH2LtfM4uOZo7A5L3PZNNIlybSd9bMFGvNq846D2UPfNWOm8qxposbFjW0ZvvoawvZYq9n5sfDr_Efauu0aXWjYBbn5zjt4eH17XT8n2ZfO8Xm0TlaVpTDgHkIwVOQNOgALTBSNFVdFyeKNWdVUoThTPUsKyItM6V5wrRllVQ0V0rrM54ue7yrsQPGihTJTROBu9NI0gqRhNioMYTYrRpDibHFD6B-28aaU__Q_dnyEYnjoa8CIoA1ZBbfxgW9TO_If_ANzMko0 |
| CitedBy_id | crossref_primary_10_1016_j_eswa_2024_124223 crossref_primary_10_1016_j_cie_2023_109621 crossref_primary_10_1080_00207543_2024_2436126 crossref_primary_10_1016_j_eswa_2021_115903 crossref_primary_10_1155_2022_3785039 crossref_primary_10_3390_pr12020391 crossref_primary_10_3390_math10193446 crossref_primary_10_32604_cmc_2024_050612 crossref_primary_10_3390_sym13081483 crossref_primary_10_1016_j_asoc_2025_113531 crossref_primary_10_1016_j_ins_2023_119949 crossref_primary_10_1007_s00170_024_14255_7 crossref_primary_10_1007_s13198_023_02040_w crossref_primary_10_1109_TITS_2023_3234010 crossref_primary_10_1007_s00034_025_03118_5 crossref_primary_10_1007_s40430_024_04896_w crossref_primary_10_1016_j_asoc_2024_111846 crossref_primary_10_1016_j_swevo_2025_102007 crossref_primary_10_3390_app13063708 crossref_primary_10_1016_j_jmsy_2023_03_007 crossref_primary_10_1016_j_swevo_2024_101651 crossref_primary_10_1016_j_asoc_2021_107695 crossref_primary_10_1016_j_swevo_2021_100861 crossref_primary_10_1109_ACCESS_2024_3432594 crossref_primary_10_1177_09544062231181838 crossref_primary_10_1109_TASE_2024_3419848 crossref_primary_10_1007_s12206_024_2206_2 crossref_primary_10_26599_TST_2023_9010087 crossref_primary_10_1016_j_compeleceng_2024_109824 crossref_primary_10_1016_j_cie_2024_110070 crossref_primary_10_1016_j_asoc_2025_113815 crossref_primary_10_1016_j_rcim_2022_102514 crossref_primary_10_1016_j_cie_2025_111330 crossref_primary_10_1016_j_cie_2025_111334 crossref_primary_10_3390_vehicles7030102 crossref_primary_10_1080_01490419_2021_1993386 crossref_primary_10_1016_j_jii_2022_100387 crossref_primary_10_1016_j_swevo_2025_101861 |
| Cites_doi | 10.1007/s12541-017-0095-3 10.1016/j.cie.2018.04.032 10.1016/j.jmsy.2013.07.002 10.1177/1687814018765560 10.1016/j.asoc.2015.08.020 10.1016/j.swevo.2020.100742 10.1016/j.eswa.2020.113675 10.1007/s10732-014-9279-5 10.1016/j.cie.2019.01.050 10.1023/B:FLEX.0000036032.41757.3d 10.1007/s10489-017-0997-x 10.1016/j.cie.2015.12.007 10.1016/j.cie.2015.10.017 10.1371/journal.pone.0169817 10.1016/j.asoc.2014.08.028 10.1016/j.eswa.2012.05.064 10.1007/s00500-015-1642-4 10.1016/j.cie.2015.01.003 10.1016/j.cie.2018.10.002 10.1080/00207543.2014.910628 10.1016/j.engappai.2020.104016 10.1016/j.cie.2018.03.014 10.1016/j.ijpe.2009.01.008 10.1016/j.cor.2016.12.023 10.1016/j.eswa.2019.01.062 10.1016/j.ifacol.2015.06.197 10.1016/j.ejor.2005.12.009 10.1016/j.jclepro.2016.10.057 10.1016/j.cor.2016.11.022 10.1016/j.asoc.2019.105492 10.1016/j.cor.2009.06.015 10.1016/j.omega.2018.03.004 10.1109/TCYB.2017.2780274 10.1007/s00170-011-3240-7 10.1080/00207540110091712 10.1287/opre.46.4.474 10.1016/j.cie.2016.12.045 10.1287/opre.41.6.1077 10.1016/j.ejor.2004.09.020 10.1007/s10846-013-0003-8 |
| ContentType | Journal Article |
| Copyright | 2020 Elsevier B.V. |
| Copyright_xml | – notice: 2020 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.asoc.2020.106945 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1872-9681 |
| ExternalDocumentID | 10_1016_j_asoc_2020_106945 S1568494620308838 |
| 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-88eea55765e81e2e5f7517bb29928dcdb7c81c83015373ff6c88c525bdeb1f6f3 |
| ISICitedReferencesCount | 59 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000608174700013&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 07:05:24 EST 2025 Tue Nov 18 22:18:59 EST 2025 Fri Feb 23 02:48:47 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Iterated greedy algorithm Multi-compartment Scheduling Automated guided vehicle Heuristics |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c300t-88eea55765e81e2e5f7517bb29928dcdb7c81c83015373ff6c88c525bdeb1f6f3 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_asoc_2020_106945 crossref_primary_10_1016_j_asoc_2020_106945 elsevier_sciencedirect_doi_10_1016_j_asoc_2020_106945 |
| PublicationCentury | 2000 |
| PublicationDate | February 2021 2021-02-00 |
| PublicationDateYYYYMMDD | 2021-02-01 |
| PublicationDate_xml | – month: 02 year: 2021 text: February 2021 |
| PublicationDecade | 2020 |
| PublicationTitle | Applied soft computing |
| PublicationYear | 2021 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Meng, Pan (b43) 2020; 60 Li, Tao, Jia, Han, Liu, Duan, Zheng, Sang (b47) 2019 Pan, Gao, Wang, Liang, Li (b39) 2019; 124 Fazlollahtabar, Saidi-Mehrabad (b11) 2015; 77 Han, Wang, Liu, Zhao (b21) 2017 Qiu, Hsu, Huang, Wang (b1) 2002; 40 Gen, Zhang, Lin, Yun (b29) 2017; 112 Braekers, Ramaekers, Van Nieuwenhuyse (b5) 2016; 99 Mousavi, Yap, Musa, Dawal (b4) 2017; 12 Zeng, Tang, Yan (b19) 2014; 24 Saidi-Mehrabad, Dehnavi-Arani, Evazabadian (b23) 2015; 86 Huang, Pan, Miao, Gao (b42) 2021; 97 Huang, Pan, Gao (b38) 2020 Silvestrin, Ritt (b33) 2017; 81 Zheng, Xiao, Seo (b27) 2014; 52 Montgomery (b45) 2012 Fazlollahtabar, Hassanli (b16) 2018; 48 Malopolski (b12) 2018; 126 Zhang, Zhang, Xu, Zuo (b17) 2015; 48 Li, Li, Gao, Zeng (b22) 2018 Mendoza, Castanier, Gueret, Medaglia, Velasco (b30) 2010; 37 Bae, Chung (b18) 2017; 18 Na, Jun, Kim (b41) 2011; 56 Wang, Li (b9) 2018; 13 Krishnamurthy, Batta, Karwan (b13) 1993; 41 Tavakkoli-Moghaddam, Safaei, Gholipour (b40) 2006; 176 Abdulkader, Gajpal, ElMekkawy (b32) 2015; 37 Lu, Wang (b26) 2019; 129 Bechtsis, Tsolakis, Vlachos, Iakovou (b3) 2017; 142 Fernandez-Viagas, Perez-Gonzalez, Framinan (b44) 2018; 118 Zou, Pan, Meng, Gao, Wang (b24) 2020 Pan, Gao, Li, Jose (b36) 2019 Ruiz, Stützle (b34) 2007; 177 Brandao (b8) 2018; 120 Desaulniers, Langevin, Riopel, Villeneuve (b15) 2003; 15 Pan, Ruiz, Alfaro-Fernández (b46) 2017; 80 Miyamoto, Inoue (b20) 2016; 91 Elmekkawy, Liu (b25) 2009; 118 Hamzeei, Farahani, Rashidi-Bejgan (b28) 2013; 32 Savelsbergh, Sol (b14) 1998; 46 Popovic, Vidovic, Radivojevic (b31) 2012; 39 Li, Zeng, Liao, Li, Gao (b10) 2018; 10 Pranzo, Pacciarelli (b37) 2016; 22 Braekers, Ramaekers, Van Nieuwenhuyse (b6) 2016; 99 Zhang, Pan, Gao, Meng, Li, Peng (b48) 2019 Wang, Tan (b49) 2019; 49 Nalepa, Blocho (b7) 2016; 20 Ruiz, Pan, Naderi (b35) 2019; 83 Vis (b2) 2006; 170 Qiu (10.1016/j.asoc.2020.106945_b1) 2002; 40 Pan (10.1016/j.asoc.2020.106945_b39) 2019; 124 Fazlollahtabar (10.1016/j.asoc.2020.106945_b16) 2018; 48 Hamzeei (10.1016/j.asoc.2020.106945_b28) 2013; 32 Li (10.1016/j.asoc.2020.106945_b22) 2018 Malopolski (10.1016/j.asoc.2020.106945_b12) 2018; 126 Mousavi (10.1016/j.asoc.2020.106945_b4) 2017; 12 Popovic (10.1016/j.asoc.2020.106945_b31) 2012; 39 Miyamoto (10.1016/j.asoc.2020.106945_b20) 2016; 91 Tavakkoli-Moghaddam (10.1016/j.asoc.2020.106945_b40) 2006; 176 Li (10.1016/j.asoc.2020.106945_b10) 2018; 10 Han (10.1016/j.asoc.2020.106945_b21) 2017 Savelsbergh (10.1016/j.asoc.2020.106945_b14) 1998; 46 Saidi-Mehrabad (10.1016/j.asoc.2020.106945_b23) 2015; 86 Krishnamurthy (10.1016/j.asoc.2020.106945_b13) 1993; 41 Ruiz (10.1016/j.asoc.2020.106945_b34) 2007; 177 Meng (10.1016/j.asoc.2020.106945_b43) 2020; 60 Zheng (10.1016/j.asoc.2020.106945_b27) 2014; 52 Pranzo (10.1016/j.asoc.2020.106945_b37) 2016; 22 Ruiz (10.1016/j.asoc.2020.106945_b35) 2019; 83 Pan (10.1016/j.asoc.2020.106945_b46) 2017; 80 Huang (10.1016/j.asoc.2020.106945_b42) 2021; 97 Vis (10.1016/j.asoc.2020.106945_b2) 2006; 170 Wang (10.1016/j.asoc.2020.106945_b49) 2019; 49 Fazlollahtabar (10.1016/j.asoc.2020.106945_b11) 2015; 77 Montgomery (10.1016/j.asoc.2020.106945_b45) 2012 Brandao (10.1016/j.asoc.2020.106945_b8) 2018; 120 Braekers (10.1016/j.asoc.2020.106945_b5) 2016; 99 Huang (10.1016/j.asoc.2020.106945_b38) 2020 Na (10.1016/j.asoc.2020.106945_b41) 2011; 56 Zhang (10.1016/j.asoc.2020.106945_b48) 2019 Pan (10.1016/j.asoc.2020.106945_b36) 2019 Li (10.1016/j.asoc.2020.106945_b47) 2019 Gen (10.1016/j.asoc.2020.106945_b29) 2017; 112 Zou (10.1016/j.asoc.2020.106945_b24) 2020 Zeng (10.1016/j.asoc.2020.106945_b19) 2014; 24 Elmekkawy (10.1016/j.asoc.2020.106945_b25) 2009; 118 Silvestrin (10.1016/j.asoc.2020.106945_b33) 2017; 81 Zhang (10.1016/j.asoc.2020.106945_b17) 2015; 48 Bae (10.1016/j.asoc.2020.106945_b18) 2017; 18 Braekers (10.1016/j.asoc.2020.106945_b6) 2016; 99 Bechtsis (10.1016/j.asoc.2020.106945_b3) 2017; 142 Wang (10.1016/j.asoc.2020.106945_b9) 2018; 13 Abdulkader (10.1016/j.asoc.2020.106945_b32) 2015; 37 Fernandez-Viagas (10.1016/j.asoc.2020.106945_b44) 2018; 118 Desaulniers (10.1016/j.asoc.2020.106945_b15) 2003; 15 Lu (10.1016/j.asoc.2020.106945_b26) 2019; 129 Nalepa (10.1016/j.asoc.2020.106945_b7) 2016; 20 Mendoza (10.1016/j.asoc.2020.106945_b30) 2010; 37 |
| References_xml | – volume: 37 start-page: 1886 year: 2010 end-page: 1898 ident: b30 article-title: A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands publication-title: Comput. Oper. Res. – volume: 118 start-page: 508 year: 2009 end-page: 520 ident: b25 article-title: A new memetic algorithm for optimizing the partitioning problem of tandem AGV systems publication-title: Int. J. Prod. Econ. – volume: 177 start-page: 2033 year: 2007 end-page: 2049 ident: b34 article-title: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem publication-title: European J. Oper. Res. – volume: 24 start-page: 1033 year: 2014 end-page: 1046 ident: b19 article-title: Scheduling of no buffer job shop cells with blocking constraints and automated guided vehicles publication-title: Appl. Soft Comput. – volume: 129 start-page: 404 year: 2019 end-page: 416 ident: b26 article-title: A study on multi-ASC scheduling method of automated container terminals based on graph theory publication-title: Comput. Ind. Eng. – volume: 170 start-page: 677 year: 2006 end-page: 709 ident: b2 article-title: Survey of research in the design and control of automated guided vehicle systems publication-title: European J. Oper. Res. – volume: 176 start-page: 445 year: 2006 end-page: 454 ident: b40 article-title: A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length publication-title: Appl. Math. Comput. – volume: 32 start-page: 648 year: 2013 end-page: 654 ident: b28 article-title: An exact and a simulated annealing algorithm for simultaneously determining flow path and the location of P/D stations in the bidirectional path publication-title: J. Manuf. Syst. – volume: 83 start-page: 213 year: 2019 end-page: 222 ident: b35 article-title: Iterated Greedy methods for the distributed permutation flowshop scheduling problem publication-title: Omega-Int. J. Manage. S – volume: 15 start-page: 309 year: 2003 end-page: 331 ident: b15 article-title: Dispatching and conflict-free routing of automated guided vehicles: an exact approach publication-title: Int. J. Flexible Manuf. Syst. – volume: 118 start-page: 464 year: 2018 end-page: 477 ident: b44 article-title: The distributed permutation flow shop to minimize the total flowtime publication-title: Comput. Ind. Eng. – volume: 91 start-page: 1 year: 2016 end-page: 9 ident: b20 article-title: Local and random searches for dispatch and conflict-free routing problem of capacitated AGV systems publication-title: Comput. Ind. Eng. – volume: 80 start-page: 50 year: 2017 end-page: 60 ident: b46 article-title: Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows publication-title: Comput. Oper. Res. – volume: 12 start-page: 1 year: 2017 end-page: 24 ident: b4 article-title: Multi-objective AGV scheduling in an FMS using a hybrid of genetic algorithm and particle swarm optimization publication-title: Plos One – volume: 99 start-page: 300 year: 2016 end-page: 313 ident: b6 article-title: The vehicle routing problem: State of the art classification and review publication-title: Comput. Ind. Eng. – volume: 81 start-page: 192 year: 2017 end-page: 202 ident: b33 article-title: An iterated tabu search for the multi-compartment vehicle routing problem publication-title: Comput. Oper. Res. – volume: 18 start-page: 795 year: 2017 end-page: 801 ident: b18 article-title: A Heuristic for a Heterogeneous Automated Guided Vehicle Routing problem publication-title: Int. J. Precis. Eng. Man. – volume: 126 start-page: 472 year: 2018 end-page: 481 ident: b12 article-title: A sustainable and conflict-free operation of AGVs in a square topology publication-title: Comput. Ind. Eng. – volume: 48 start-page: 482 year: 2018 end-page: 498 ident: b16 article-title: Hybrid cost and time path planning for multiple autonomous guided vehicles publication-title: Appl. Intell. – year: 2020 ident: b38 article-title: An effective iterated greedy method for the distributed permutation flowshop scheduling problem with sequence-dependent setup times publication-title: Swarm Evol. Comput. – year: 2019 ident: b48 article-title: A three-stage multi-objective approach based on decomposition for an energy-efficient hybrid flowshop scheduling problem publication-title: IEEE Trans. Syst. Man Cybern.-S – volume: 56 start-page: 1057 year: 2011 end-page: 1067 ident: b41 article-title: Some extensions to the sweep algorithm publication-title: Int. J. Adv. Manuf. Technol. – volume: 10 start-page: 1 year: 2018 end-page: 13 ident: b10 article-title: A new AGV scheduling algorithm based on harmony search for material transfer in a real-world manufacturing system publication-title: Adv. Mech. Eng. – volume: 37 start-page: 196 year: 2015 end-page: 203 ident: b32 article-title: Hybridized ant colony algorithm for the Multi-Compartment Vehicle Routing Problem publication-title: Appl. Soft Comput. – volume: 22 start-page: 587 year: 2016 end-page: 611 ident: b37 article-title: An iterated greedy metaheuristic for the blocking job shop scheduling problem publication-title: J. Heuristics – volume: 124 start-page: 309 year: 2019 end-page: 324 ident: b39 article-title: Effective heuristics and metaheuristics to minimize total flowtime for the distributed permutation flowshop problem publication-title: Expert Syst. Appl. – year: 2020 ident: b24 article-title: An effective discrete artificial bee colony algorithm for multi-AGVs dispatching problem in a matrix manufacturing workshop publication-title: Expert Syst. Appl. – volume: 46 start-page: 474 year: 1998 end-page: 490 ident: b14 article-title: Drive: dynamic routing of independent vehicles publication-title: Oper. Res. – year: 2018 ident: b22 article-title: Tasks assigning and sequencing of multiple AGVs based on an improved harmony search algorithm publication-title: J. Ambient Intell. Humaniz. Compt. – volume: 49 start-page: 542 year: 2019 end-page: 555 ident: b49 article-title: Improving metaheuristic algorithms with information feedback models publication-title: IEEE. Trans. Cybern. – volume: 39 start-page: 13390 year: 2012 end-page: 13398 ident: b31 article-title: Variable neighborhood search heuristic for the inventory routing problem in fuel delivery publication-title: Expert Syst. Appl. – year: 2017 ident: b21 article-title: Multi-AGV path planning with double-path constraints by using an improved genetic algorithm publication-title: Plos One – volume: 41 start-page: 1077 year: 1993 end-page: 1090 ident: b13 article-title: Developing conflict-free routes for automated guided vehicles publication-title: Oper. Res. – year: 2019 ident: b47 article-title: Efficient multi-objective algorithm for the lot-streaming hybrid flowshop with variable sub-lots publication-title: Swarm Evol. Comput. – year: 2019 ident: b36 article-title: Effective constructive heuristics and meta-heuristics for the distributed assembly permutation flowshop scheduling problem publication-title: Appl. Soft Comput. – volume: 60 year: 2020 ident: b43 article-title: A distributed heterogeneous permutation flowshop scheduling problem with lot-streaming and carryover sequence-dependent setup time publication-title: Swarm Evol. Comput. – volume: 112 start-page: 616 year: 2017 end-page: 633 ident: b29 article-title: Recent advances in hybrid evolutionary algorithms for multiobjective manufacturing scheduling publication-title: Comput. Ind. Eng. – volume: 20 start-page: 2309 year: 2016 end-page: 2327 ident: b7 article-title: Adaptive memetic algorithm for minimizing distance in the vehicle routing problem with time windows publication-title: Soft Comput. – volume: 86 start-page: 2 year: 2015 end-page: 13 ident: b23 article-title: An Ant Colony Algorithm (ACA) for solving the new integrated model of job shop scheduling and conflict-free routing of AGVs publication-title: Comput. Ind. Eng. – volume: 13 start-page: 466 year: 2018 end-page: 478 ident: b9 article-title: Hybrid fruit fly optimization algorithm for solving multi-compartment vehicle routing problem in intelligent logistics publication-title: Adv. Prod. Eng. Manage. – volume: 97 year: 2021 ident: b42 article-title: Effective constructive heuristics and discrete bee colony optimization for distributed flowshop with setup times publication-title: Eng. Appl. Artif. Intell. – year: 2012 ident: b45 article-title: Design and Analysis of Experiments – volume: 142 start-page: 3970 year: 2017 end-page: 3984 ident: b3 article-title: Sustainable supply chain management in the digitalisation era: The impact of Automated Guided Vehicles publication-title: J. Clean. Prod. – volume: 40 start-page: 745 year: 2002 end-page: 760 ident: b1 article-title: Scheduling and routing algorithms for AGVs: a survey publication-title: Int. J. Prod. Res. – volume: 48 start-page: 898 year: 2015 end-page: 903 ident: b17 article-title: A hybrid genetic algorithm used in vehicle dispatching for JIT distribution in NC workshop publication-title: IFAC Papers Online – volume: 77 start-page: 525 year: 2015 end-page: 545 ident: b11 article-title: Methodologies to Optimize Automated Guided Vehicle Scheduling and Routing Problems: A review study publication-title: J. Intell. Robot. Syst. – volume: 120 start-page: 146 year: 2018 end-page: 159 ident: b8 article-title: Iterated local search algorithm with ejection chains for the open vehicle routing problem with time windows publication-title: Comput. Ind. Eng. – volume: 52 start-page: 5748 year: 2014 end-page: 5763 ident: b27 article-title: A tabu search algorithm for simultaneous machine/AGV scheduling problem publication-title: Int. J. Prod. Res. – volume: 99 start-page: 300 year: 2016 end-page: 313 ident: b5 article-title: The vehicle routing problem: State of the art classification and review publication-title: Comput. Ind. Eng. – volume: 18 start-page: 795 issue: 6 year: 2017 ident: 10.1016/j.asoc.2020.106945_b18 article-title: A Heuristic for a Heterogeneous Automated Guided Vehicle Routing problem publication-title: Int. J. Precis. Eng. Man. doi: 10.1007/s12541-017-0095-3 – volume: 120 start-page: 146 year: 2018 ident: 10.1016/j.asoc.2020.106945_b8 article-title: Iterated local search algorithm with ejection chains for the open vehicle routing problem with time windows publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2018.04.032 – volume: 32 start-page: 648 issue: 4 year: 2013 ident: 10.1016/j.asoc.2020.106945_b28 article-title: An exact and a simulated annealing algorithm for simultaneously determining flow path and the location of P/D stations in the bidirectional path publication-title: J. Manuf. Syst. doi: 10.1016/j.jmsy.2013.07.002 – volume: 10 start-page: 1 issue: 3 year: 2018 ident: 10.1016/j.asoc.2020.106945_b10 article-title: A new AGV scheduling algorithm based on harmony search for material transfer in a real-world manufacturing system publication-title: Adv. Mech. Eng. doi: 10.1177/1687814018765560 – volume: 37 start-page: 196 year: 2015 ident: 10.1016/j.asoc.2020.106945_b32 article-title: Hybridized ant colony algorithm for the Multi-Compartment Vehicle Routing Problem publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2015.08.020 – year: 2020 ident: 10.1016/j.asoc.2020.106945_b38 article-title: An effective iterated greedy method for the distributed permutation flowshop scheduling problem with sequence-dependent setup times publication-title: Swarm Evol. Comput. doi: 10.1016/j.swevo.2020.100742 – year: 2020 ident: 10.1016/j.asoc.2020.106945_b24 article-title: An effective discrete artificial bee colony algorithm for multi-AGVs dispatching problem in a matrix manufacturing workshop publication-title: Expert Syst. Appl. doi: 10.1016/j.eswa.2020.113675 – volume: 22 start-page: 587 year: 2016 ident: 10.1016/j.asoc.2020.106945_b37 article-title: An iterated greedy metaheuristic for the blocking job shop scheduling problem publication-title: J. Heuristics doi: 10.1007/s10732-014-9279-5 – volume: 129 start-page: 404 year: 2019 ident: 10.1016/j.asoc.2020.106945_b26 article-title: A study on multi-ASC scheduling method of automated container terminals based on graph theory publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2019.01.050 – volume: 15 start-page: 309 issue: 4 year: 2003 ident: 10.1016/j.asoc.2020.106945_b15 article-title: Dispatching and conflict-free routing of automated guided vehicles: an exact approach publication-title: Int. J. Flexible Manuf. Syst. doi: 10.1023/B:FLEX.0000036032.41757.3d – volume: 48 start-page: 482 issue: 2 year: 2018 ident: 10.1016/j.asoc.2020.106945_b16 article-title: Hybrid cost and time path planning for multiple autonomous guided vehicles publication-title: Appl. Intell. doi: 10.1007/s10489-017-0997-x – volume: 99 start-page: 300 year: 2016 ident: 10.1016/j.asoc.2020.106945_b5 article-title: The vehicle routing problem: State of the art classification and review publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2015.12.007 – volume: 91 start-page: 1 year: 2016 ident: 10.1016/j.asoc.2020.106945_b20 article-title: Local and random searches for dispatch and conflict-free routing problem of capacitated AGV systems publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2015.10.017 – volume: 12 start-page: 1 issue: 3 year: 2017 ident: 10.1016/j.asoc.2020.106945_b4 article-title: Multi-objective AGV scheduling in an FMS using a hybrid of genetic algorithm and particle swarm optimization publication-title: Plos One doi: 10.1371/journal.pone.0169817 – volume: 24 start-page: 1033 year: 2014 ident: 10.1016/j.asoc.2020.106945_b19 article-title: Scheduling of no buffer job shop cells with blocking constraints and automated guided vehicles publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2014.08.028 – volume: 39 start-page: 13390 year: 2012 ident: 10.1016/j.asoc.2020.106945_b31 article-title: Variable neighborhood search heuristic for the inventory routing problem in fuel delivery publication-title: Expert Syst. Appl. doi: 10.1016/j.eswa.2012.05.064 – year: 2019 ident: 10.1016/j.asoc.2020.106945_b48 article-title: A three-stage multi-objective approach based on decomposition for an energy-efficient hybrid flowshop scheduling problem publication-title: IEEE Trans. Syst. Man Cybern.-S – volume: 20 start-page: 2309 issue: 6 year: 2016 ident: 10.1016/j.asoc.2020.106945_b7 article-title: Adaptive memetic algorithm for minimizing distance in the vehicle routing problem with time windows publication-title: Soft Comput. doi: 10.1007/s00500-015-1642-4 – volume: 86 start-page: 2 year: 2015 ident: 10.1016/j.asoc.2020.106945_b23 article-title: An Ant Colony Algorithm (ACA) for solving the new integrated model of job shop scheduling and conflict-free routing of AGVs publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2015.01.003 – volume: 126 start-page: 472 year: 2018 ident: 10.1016/j.asoc.2020.106945_b12 article-title: A sustainable and conflict-free operation of AGVs in a square topology publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2018.10.002 – volume: 52 start-page: 5748 issue: 19 year: 2014 ident: 10.1016/j.asoc.2020.106945_b27 article-title: A tabu search algorithm for simultaneous machine/AGV scheduling problem publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2014.910628 – volume: 97 year: 2021 ident: 10.1016/j.asoc.2020.106945_b42 article-title: Effective constructive heuristics and discrete bee colony optimization for distributed flowshop with setup times publication-title: Eng. Appl. Artif. Intell. doi: 10.1016/j.engappai.2020.104016 – volume: 118 start-page: 464 year: 2018 ident: 10.1016/j.asoc.2020.106945_b44 article-title: The distributed permutation flow shop to minimize the total flowtime publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2018.03.014 – year: 2017 ident: 10.1016/j.asoc.2020.106945_b21 article-title: Multi-AGV path planning with double-path constraints by using an improved genetic algorithm publication-title: Plos One – volume: 118 start-page: 508 issue: 2 year: 2009 ident: 10.1016/j.asoc.2020.106945_b25 article-title: A new memetic algorithm for optimizing the partitioning problem of tandem AGV systems publication-title: Int. J. Prod. Econ. doi: 10.1016/j.ijpe.2009.01.008 – volume: 13 start-page: 466 issue: 4 year: 2018 ident: 10.1016/j.asoc.2020.106945_b9 article-title: Hybrid fruit fly optimization algorithm for solving multi-compartment vehicle routing problem in intelligent logistics publication-title: Adv. Prod. Eng. Manage. – year: 2018 ident: 10.1016/j.asoc.2020.106945_b22 article-title: Tasks assigning and sequencing of multiple AGVs based on an improved harmony search algorithm publication-title: J. Ambient Intell. Humaniz. Compt. – volume: 81 start-page: 192 year: 2017 ident: 10.1016/j.asoc.2020.106945_b33 article-title: An iterated tabu search for the multi-compartment vehicle routing problem publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2016.12.023 – volume: 124 start-page: 309 year: 2019 ident: 10.1016/j.asoc.2020.106945_b39 article-title: Effective heuristics and metaheuristics to minimize total flowtime for the distributed permutation flowshop problem publication-title: Expert Syst. Appl. doi: 10.1016/j.eswa.2019.01.062 – volume: 48 start-page: 898 issue: 3 year: 2015 ident: 10.1016/j.asoc.2020.106945_b17 article-title: A hybrid genetic algorithm used in vehicle dispatching for JIT distribution in NC workshop publication-title: IFAC Papers Online doi: 10.1016/j.ifacol.2015.06.197 – volume: 177 start-page: 2033 year: 2007 ident: 10.1016/j.asoc.2020.106945_b34 article-title: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2005.12.009 – volume: 142 start-page: 3970 year: 2017 ident: 10.1016/j.asoc.2020.106945_b3 article-title: Sustainable supply chain management in the digitalisation era: The impact of Automated Guided Vehicles publication-title: J. Clean. Prod. doi: 10.1016/j.jclepro.2016.10.057 – volume: 80 start-page: 50 year: 2017 ident: 10.1016/j.asoc.2020.106945_b46 article-title: Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2016.11.022 – volume: 99 start-page: 300 year: 2016 ident: 10.1016/j.asoc.2020.106945_b6 article-title: The vehicle routing problem: State of the art classification and review publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2015.12.007 – volume: 60 year: 2020 ident: 10.1016/j.asoc.2020.106945_b43 article-title: A distributed heterogeneous permutation flowshop scheduling problem with lot-streaming and carryover sequence-dependent setup time publication-title: Swarm Evol. Comput. – year: 2019 ident: 10.1016/j.asoc.2020.106945_b36 article-title: Effective constructive heuristics and meta-heuristics for the distributed assembly permutation flowshop scheduling problem publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2019.105492 – volume: 37 start-page: 1886 year: 2010 ident: 10.1016/j.asoc.2020.106945_b30 article-title: A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2009.06.015 – volume: 83 start-page: 213 year: 2019 ident: 10.1016/j.asoc.2020.106945_b35 article-title: Iterated Greedy methods for the distributed permutation flowshop scheduling problem publication-title: Omega-Int. J. Manage. S doi: 10.1016/j.omega.2018.03.004 – year: 2012 ident: 10.1016/j.asoc.2020.106945_b45 – volume: 49 start-page: 542 issue: 2 year: 2019 ident: 10.1016/j.asoc.2020.106945_b49 article-title: Improving metaheuristic algorithms with information feedback models publication-title: IEEE. Trans. Cybern. doi: 10.1109/TCYB.2017.2780274 – volume: 56 start-page: 1057 issue: 9–12 year: 2011 ident: 10.1016/j.asoc.2020.106945_b41 article-title: Some extensions to the sweep algorithm publication-title: Int. J. Adv. Manuf. Technol. doi: 10.1007/s00170-011-3240-7 – volume: 40 start-page: 745 issue: 3 year: 2002 ident: 10.1016/j.asoc.2020.106945_b1 article-title: Scheduling and routing algorithms for AGVs: a survey publication-title: Int. J. Prod. Res. doi: 10.1080/00207540110091712 – volume: 46 start-page: 474 issue: 4 year: 1998 ident: 10.1016/j.asoc.2020.106945_b14 article-title: Drive: dynamic routing of independent vehicles publication-title: Oper. Res. doi: 10.1287/opre.46.4.474 – volume: 112 start-page: 616 year: 2017 ident: 10.1016/j.asoc.2020.106945_b29 article-title: Recent advances in hybrid evolutionary algorithms for multiobjective manufacturing scheduling publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2016.12.045 – volume: 41 start-page: 1077 issue: 6 year: 1993 ident: 10.1016/j.asoc.2020.106945_b13 article-title: Developing conflict-free routes for automated guided vehicles publication-title: Oper. Res. doi: 10.1287/opre.41.6.1077 – volume: 170 start-page: 677 issue: 3 year: 2006 ident: 10.1016/j.asoc.2020.106945_b2 article-title: Survey of research in the design and control of automated guided vehicle systems publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2004.09.020 – volume: 77 start-page: 525 issue: 3–4 year: 2015 ident: 10.1016/j.asoc.2020.106945_b11 article-title: Methodologies to Optimize Automated Guided Vehicle Scheduling and Routing Problems: A review study publication-title: J. Intell. Robot. Syst. doi: 10.1007/s10846-013-0003-8 – volume: 176 start-page: 445 issue: 2 year: 2006 ident: 10.1016/j.asoc.2020.106945_b40 article-title: A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length publication-title: Appl. Math. Comput. – year: 2019 ident: 10.1016/j.asoc.2020.106945_b47 article-title: Efficient multi-objective algorithm for the lot-streaming hybrid flowshop with variable sub-lots publication-title: Swarm Evol. Comput. |
| SSID | ssj0016928 |
| Score | 2.562815 |
| Snippet | In this paper, we address a multi-compartment automatic guided vehicle scheduling (MC-AGVS) problem from a matrix manufacturing workshop that has attracted... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 106945 |
| SubjectTerms | Automated guided vehicle Heuristics Iterated greedy algorithm Multi-compartment Scheduling |
| Title | An effective iterated greedy algorithm for solving a multi-compartment AGV scheduling problem in a matrix manufacturing workshop |
| URI | https://dx.doi.org/10.1016/j.asoc.2020.106945 |
| Volume | 99 |
| WOSCitedRecordID | wos000608174700013&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: ScienceDirect (Freedom Collection) 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/eLvHCXMwtV07b9swECbcpEOXvoumL3DoZjCwHhSpUSiSvoMEcANvAkWTtQOXNmwp8Jg1_7pHkZSdNA2aoYsgEBRN6z4fP56_4yH0PtYpS5I0J0AlxiSVkhPBBprQiilWAcWoWlXl6Td2dMRHo_y417sMuTDnM2YMX6_zxX81NbSBsW3q7B3M3Q0KDXAPRocrmB2u_2T4wniRhtUEuUOTgVTCthr8aV_Mfs6X03ryq5UXwkTaeIJwukLiBOlOd158PO3DzhdWIp-w3haeseER6G3P9V9b5WtjEyNcpqNVeK0m88U23Q0cdwXOvlWvN3VYKm2wet60Ej9lyAmgtGs_dkHZk0YY8rUD3lCsbErc0vnJ7_v9Q_jCk-2oRRwFofPG0WacpLkPP3pP7EoleVca2ZRceqOXdwGHs30BAIYtfmybQuerR2pfW-o6AWLQtp2VdozSjlG6Me6h3ZjRHBzkbvH5YPSl-0sqy9tCvd3EfQaWEwten8nNLGeLuQwfo4d-y4ELB5UnqKfMU_QolPPA3rs_QxeFwR1ycEAOdsjBHXIwIAd75GCB_0AOBuTgDXKwRw6eGtu7RQ6-ghwckPMc_Tg8GH74RHyBDiKTwaAmnCslKOxYqeKRihXVjEasqoDixHwsxxWTPJIc1hCasETrTHIuaUyrMTAEnenkBdoxc6NeIpynXEWSUl1lg3Rc6ZxxmQNZ5YIKJXSyh6LwQkvpT6-3RVRm5d9NuYf63TMLd3bLrb1psFPp2adjlSXA7pbnXt3pU16jB5ufwxu0Uy8b9Rbdl-f1dLV85zH3G6R7qx8 |
| 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=An+effective+iterated+greedy+algorithm+for+solving+a+multi-compartment+AGV+scheduling+problem+in+a+matrix+manufacturing+workshop&rft.jtitle=Applied+soft+computing&rft.au=Zou%2C+Wen-Qiang&rft.au=Pan%2C+Quan-Ke&rft.au=Tasgetiren%2C+M.+Fatih&rft.date=2021-02-01&rft.issn=1568-4946&rft.volume=99&rft.spage=106945&rft_id=info:doi/10.1016%2Fj.asoc.2020.106945&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_asoc_2020_106945 |
| 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 |