A comparative study of Multi-Objective Ant Colony Optimization algorithms for the Time and Space Assembly Line Balancing Problem
[Display omitted] •Assembly line balancing (ALB) is a classical and complex industrial problem.•Time and space assembly line balancing (TSALBP) is a realistic model for ALB.•We consider a TSALBP variant based on multiobjective optimization of time and space.•Different MOACO proposals are designed to...
Gespeichert in:
| Veröffentlicht in: | Applied soft computing Jg. 13; H. 11; S. 4370 - 4382 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Elsevier B.V
01.11.2013
|
| 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]
•Assembly line balancing (ALB) is a classical and complex industrial problem.•Time and space assembly line balancing (TSALBP) is a realistic model for ALB.•We consider a TSALBP variant based on multiobjective optimization of time and space.•Different MOACO proposals are designed to solve the problem and to be compared.•Experimentation shows best proposals and way of using heuristic information for the problem.
Assembly lines for mass manufacturing incrementally build production items by performing tasks on them while flowing between workstations. The configuration of an assembly line consists of assigning tasks to different workstations in order to optimize its operation subject to certain constraints such as the precedence relationships between the tasks. The operation of an assembly line can be optimized by minimizing two conflicting objectives, namely the number of workstations and the physical area these require. This configuration problem is an instance of the TSALBP, which is commonly found in the automotive industry. It is a hard combinatorial optimization problem to which finding the optimum solution might be infeasible or even impossible, but finding a good solution is still of great value to managers configuring the line. We adapt eight different Multi-Objective Ant Colony Optimization (MOACO) algorithms and compare their performance on ten well-known problem instances to solve such a complex problem. Experiments under different modalities show that the commonly used heuristic functions deteriorate the performance of the algorithms in time-limited scenarios due to the added computational cost. Moreover, even neglecting such a cost, the algorithms achieve a better performance without such heuristic functions. The algorithms are ranked according to three multi-objective indicators and the differences between the top-4 are further reviewed using statistical significance tests. Additionally, these four best performing MOACO algorithms are favourably compared with the Infeasibility Driven Evolutionary Algorithm (IDEA) designed specifically for industrial optimization problems. |
|---|---|
| AbstractList | [Display omitted]
•Assembly line balancing (ALB) is a classical and complex industrial problem.•Time and space assembly line balancing (TSALBP) is a realistic model for ALB.•We consider a TSALBP variant based on multiobjective optimization of time and space.•Different MOACO proposals are designed to solve the problem and to be compared.•Experimentation shows best proposals and way of using heuristic information for the problem.
Assembly lines for mass manufacturing incrementally build production items by performing tasks on them while flowing between workstations. The configuration of an assembly line consists of assigning tasks to different workstations in order to optimize its operation subject to certain constraints such as the precedence relationships between the tasks. The operation of an assembly line can be optimized by minimizing two conflicting objectives, namely the number of workstations and the physical area these require. This configuration problem is an instance of the TSALBP, which is commonly found in the automotive industry. It is a hard combinatorial optimization problem to which finding the optimum solution might be infeasible or even impossible, but finding a good solution is still of great value to managers configuring the line. We adapt eight different Multi-Objective Ant Colony Optimization (MOACO) algorithms and compare their performance on ten well-known problem instances to solve such a complex problem. Experiments under different modalities show that the commonly used heuristic functions deteriorate the performance of the algorithms in time-limited scenarios due to the added computational cost. Moreover, even neglecting such a cost, the algorithms achieve a better performance without such heuristic functions. The algorithms are ranked according to three multi-objective indicators and the differences between the top-4 are further reviewed using statistical significance tests. Additionally, these four best performing MOACO algorithms are favourably compared with the Infeasibility Driven Evolutionary Algorithm (IDEA) designed specifically for industrial optimization problems. |
| Author | Damas, Sergio Chica, Manuel Rada-Vilela, Juan Cordón, Óscar |
| Author_xml | – sequence: 1 givenname: Juan surname: Rada-Vilela fullname: Rada-Vilela, Juan email: juan.rada-vilela@ecs.vuw.ac.nz organization: Victoria University of Wellington, 6140 Wellington, New Zealand – sequence: 2 givenname: Manuel surname: Chica fullname: Chica, Manuel email: manuel.chica@softcomputing.es organization: European Centre for Soft Computing, 33600 Mieres, Asturias, Spain – sequence: 3 givenname: Óscar surname: Cordón fullname: Cordón, Óscar email: ocordon@decsai.ugr.es organization: European Centre for Soft Computing, 33600 Mieres, Asturias, Spain – sequence: 4 givenname: Sergio surname: Damas fullname: Damas, Sergio email: sergio.damas@softcomputing.es organization: European Centre for Soft Computing, 33600 Mieres, Asturias, Spain |
| BookMark | eNp90E9LwzAcxvEgCur0DXjKG2hN0jRrwcsc_oPJBOc5pOmvM6NNRpIJ8-RLN9s8edgpgfAJPN9LdGqdBYRuKMkpoeJ2lavgdM4ILXIickL5Cbqg1ZhltajoabqXosp4zcU5ugxhRRKqWXWBfiZYu2GtvIrmC3CIm3aLXYdfN3002bxZgd4_TGzEU9c7u8XzdTSD-U7AWaz6pfMmfg4Bd87j-Al4YQbAyrb4fa10kiHA0PRbPDMW8L3qldXGLvGbd00PwxU661Qf4PrvHKGPx4fF9DmbzZ9eppNZpgvOY9a0UKpGV7RlHWtpW6cFpWiKumKaVKJUFAA4HRe1UEwrUWquxzXnDBpGtWqKEaoO_2rvQvDQSW3ifkP0yvSSErkrKVdyV1LuSkoiZCqZKPtH194Mym-Po7sDgjTqy4CXQRuwGlrjU1PZOnOM_wJR0JGS |
| CitedBy_id | crossref_primary_10_1007_s00500_016_2181_3 crossref_primary_10_1016_j_asoc_2017_08_036 crossref_primary_10_3390_agriculture12091302 crossref_primary_10_1016_j_engappai_2019_103239 crossref_primary_10_1016_j_aei_2024_102418 crossref_primary_10_1016_j_compositesa_2014_09_004 crossref_primary_10_1016_j_ins_2017_07_026 crossref_primary_10_1016_j_omega_2015_04_003 crossref_primary_10_1007_s10696_018_9309_y crossref_primary_10_1007_s10845_015_1126_5 crossref_primary_10_1016_j_plrev_2024_09_014 crossref_primary_10_1007_s13042_020_01103_9 crossref_primary_10_1016_j_cie_2020_106862 crossref_primary_10_1007_s00500_014_1451_1 crossref_primary_10_1108_EC_03_2022_0185 crossref_primary_10_1016_j_eneco_2024_108096 crossref_primary_10_1108_EC_11_2018_0512 crossref_primary_10_3233_JIFS_189524 crossref_primary_10_3390_math11122680 crossref_primary_10_1016_j_heliyon_2024_e40134 crossref_primary_10_1016_j_cie_2019_01_055 crossref_primary_10_1016_j_ejor_2017_06_058 crossref_primary_10_1016_j_asoc_2016_10_039 crossref_primary_10_1007_s10845_017_1298_2 crossref_primary_10_1016_j_procir_2016_04_107 crossref_primary_10_1109_ACCESS_2019_2897580 crossref_primary_10_1007_s11831_024_10178_4 crossref_primary_10_1016_j_tcs_2015_05_037 crossref_primary_10_1016_j_jmsy_2025_02_004 crossref_primary_10_1080_00207543_2017_1394599 crossref_primary_10_1088_2631_8695_ad53a3 crossref_primary_10_3390_en13112850 crossref_primary_10_3390_a16020100 crossref_primary_10_1016_j_compag_2015_02_011 crossref_primary_10_1080_0305215X_2017_1378875 crossref_primary_10_1007_s40819_016_0156_9 crossref_primary_10_1007_s11269_018_2034_1 crossref_primary_10_1080_00207543_2025_2487923 crossref_primary_10_1016_j_asoc_2015_01_012 |
| Cites_doi | 10.1016/j.ins.2007.09.029 10.1109/TEVC.2003.810758 10.1016/j.ejor.2006.03.041 10.1016/0305-0548(93)E0024-N 10.1016/j.eswa.2010.07.023 10.1109/4235.797969 10.1007/s12293-010-0035-6 10.1016/j.ins.2010.05.033 10.1057/palgrave.jors.2601771 10.1007/s10732-008-9080-4 10.1287/mnsc.32.8.909 10.1007/s11721-008-0022-4 10.1016/j.eswa.2011.04.026 10.1109/4235.585892 10.1080/00207540500216748 10.1109/3477.484436 10.1016/j.ejor.2005.12.017 10.1023/B:ANOR.0000039513.99038.c6 |
| ContentType | Journal Article |
| Copyright | 2013 Elsevier B.V. |
| Copyright_xml | – notice: 2013 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.asoc.2013.06.014 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1872-9681 |
| EndPage | 4382 |
| ExternalDocumentID | 10_1016_j_asoc_2013_06_014 S1568494613002032 |
| 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-c344t-bde5abc81d2f2d1d900156b3982c0865a1eee417396a2ca65c4c79442eb21cab3 |
| ISICitedReferencesCount | 46 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000324033300012&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:20 EST 2025 Tue Nov 18 22:37:09 EST 2025 Fri Feb 23 02:28:00 EST 2024 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 11 |
| Keywords | Ant Colony Optimization Time and Space Assembly Line Balancing Problem Automotive industry Multi-Objective Optimization |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c344t-bde5abc81d2f2d1d900156b3982c0865a1eee417396a2ca65c4c79442eb21cab3 |
| OpenAccessLink | https://hdl.handle.net/10481/99462 |
| PageCount | 13 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_asoc_2013_06_014 crossref_primary_10_1016_j_asoc_2013_06_014 elsevier_sciencedirect_doi_10_1016_j_asoc_2013_06_014 |
| PublicationCentury | 2000 |
| PublicationDate | 2013-11-01 |
| PublicationDateYYYYMMDD | 2013-11-01 |
| PublicationDate_xml | – month: 11 year: 2013 text: 2013-11-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationTitle | Applied soft computing |
| PublicationYear | 2013 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Bautista, Pereira (bib0015) 2007 Mariano, Morales (bib0115) 1999 Dorigo, Maniezzo, Colorni (bib0065) 1996; 26 Yagmahan (bib0055) 2011; 38 Zitzler, Thiele (bib0075) 1999; 3 Auger, Bader, Brockhoff, Zitzler (bib0080) 2009 Scholl (bib0005) 1999 Doerner, Hartl, Reimann (bib0100) 2003; 11 Sánchez, Villar (bib0090) 2008; 178 Levine, Ducatelle (bib0145) 2003; 55 Doerner, Gutjahr, Hartl, Strauss, Stummer (bib0130) 2004; 131 Chica, Cordón, Damas, Bautista (bib0025) 2011; 38 Zitzler, Thiele, Laumanns, Fonseca, da Fonseca (bib0085) 2003; 7 McMullen, Tarasewich (bib0050) 2006; 44 Gambardella, Dorigo (bib0120) 1995 Dorigo, Stützle (bib0035) 2004 Dorigo, Gambardella (bib0110) 1997; 1 Singh, Isaacs, Ray, Smith (bib0060) 2008 Iredi, Merkle, Middendorf (bib0095) 2001 Poon, Carter (bib0135) 1995; 22 Baybars (bib0010) 1986; 32 García-Martínez, Cordón, Herrera (bib0040) 2007; 180 Cardoso, Jesús, Márquez (bib0125) 2003 García, Molina, Lozano, Herrera (bib0140) 2008; 15 Angus, Woodward (bib0045) 2009; 3 Barán, Schaerer (bib0105) 2003 Coello, Lamont, van Veldhuizen (bib0070) 2007 Chica, Cordón, Damas, Bautista (bib0030) 2011; 3 Chica, Cordón, Damas, Bautista (bib0020) 2010; 180 McMullen (10.1016/j.asoc.2013.06.014_bib0050) 2006; 44 Angus (10.1016/j.asoc.2013.06.014_bib0045) 2009; 3 Dorigo (10.1016/j.asoc.2013.06.014_bib0065) 1996; 26 Mariano (10.1016/j.asoc.2013.06.014_bib0115) 1999 Cardoso (10.1016/j.asoc.2013.06.014_bib0125) 2003 García (10.1016/j.asoc.2013.06.014_bib0140) 2008; 15 Auger (10.1016/j.asoc.2013.06.014_bib0080) 2009 Yagmahan (10.1016/j.asoc.2013.06.014_bib0055) 2011; 38 Poon (10.1016/j.asoc.2013.06.014_bib0135) 1995; 22 Chica (10.1016/j.asoc.2013.06.014_bib0030) 2011; 3 Singh (10.1016/j.asoc.2013.06.014_bib0060) 2008 Bautista (10.1016/j.asoc.2013.06.014_bib0015) 2007 Doerner (10.1016/j.asoc.2013.06.014_bib0130) 2004; 131 Scholl (10.1016/j.asoc.2013.06.014_bib0005) 1999 Coello (10.1016/j.asoc.2013.06.014_bib0070) 2007 Dorigo (10.1016/j.asoc.2013.06.014_bib0110) 1997; 1 García-Martínez (10.1016/j.asoc.2013.06.014_bib0040) 2007; 180 Zitzler (10.1016/j.asoc.2013.06.014_bib0085) 2003; 7 Chica (10.1016/j.asoc.2013.06.014_bib0025) 2011; 38 Sánchez (10.1016/j.asoc.2013.06.014_bib0090) 2008; 178 Doerner (10.1016/j.asoc.2013.06.014_bib0100) 2003; 11 Chica (10.1016/j.asoc.2013.06.014_bib0020) 2010; 180 Zitzler (10.1016/j.asoc.2013.06.014_bib0075) 1999; 3 Gambardella (10.1016/j.asoc.2013.06.014_bib0120) 1995 Dorigo (10.1016/j.asoc.2013.06.014_bib0035) 2004 Barán (10.1016/j.asoc.2013.06.014_bib0105) 2003 Iredi (10.1016/j.asoc.2013.06.014_bib0095) 2001 Baybars (10.1016/j.asoc.2013.06.014_bib0010) 1986; 32 Levine (10.1016/j.asoc.2013.06.014_bib0145) 2003; 55 |
| References_xml | – year: 1999 ident: bib0005 article-title: Balancing and Sequencing of Assembly Lines – volume: 3 start-page: 15 year: 2011 end-page: 24 ident: bib0030 article-title: A new diversity induction mechanism for a multi-objective ant colony algorithm to solve a real-world time and space assembly line balancing problem publication-title: Memetic Computing – volume: 178 start-page: 950 year: 2008 end-page: 970 ident: bib0090 article-title: Obtaining transparent models of chaotic systems with multi-objective simulated annealing algorithms publication-title: Information Sciences – year: 2004 ident: bib0035 article-title: Ant Colony Optimization – start-page: 2016 year: 2007 end-page: 2032 ident: bib0015 article-title: Ant algorithms for a time and space constrained assembly line balancing problem publication-title: European Journal of Operational Research – start-page: 97 year: 2003 end-page: 102 ident: bib0105 article-title: A multiobjective ant colony system for vehicle routing problem with time windows publication-title: 21st IASTED International Conference – volume: 15 start-page: 617 year: 2008 end-page: 644 ident: bib0140 article-title: A study on the use of non-parametric tests for analyzing the evolutionary algorithms’ behaviour: a case study on the CEC’2005 Special Session on Real Parameter Optimization publication-title: Journal of Heuristics – volume: 44 start-page: 27 year: 2006 end-page: 42 ident: bib0050 article-title: Multi-objective assembly line balancing via a modified ant colony optimization technique publication-title: International Journal of Production Research – volume: 3 start-page: 69 year: 2009 end-page: 85 ident: bib0045 article-title: Multiple objective ant colony optimisation publication-title: Swarm Intelligence – volume: 38 start-page: 12453 year: 2011 end-page: 12461 ident: bib0055 article-title: Mixed-model assembly line balancing using a multi-objective ant colony optimization approach publication-title: Expert Systems with Applications – volume: 3 start-page: 257 year: 1999 end-page: 271 ident: bib0075 article-title: Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach publication-title: IEEE Transactions on Evolutionary Computation – start-page: 252 year: 1995 end-page: 260 ident: bib0120 article-title: Ant-Q: a reinforcement learning approach to the traveling salesman problem publication-title: 12th International Conference on Machine Learning – year: 2007 ident: bib0070 article-title: Evolutionary Algorithms for Solving Multi-Objective Problems, 2nd edition, Genetic and Evolutionary Computation – volume: 1 start-page: 53 year: 1997 end-page: 66 ident: bib0110 article-title: Ant colony system: a cooperative learning approach to the traveling salesman problem publication-title: IEEE Transactions on Evolutionary Computation – volume: 55 start-page: 705 year: 2003 end-page: 716 ident: bib0145 article-title: Ant colony optimisation and local search for bin packing and cutting stock problems publication-title: Journal of the Operational Research Society – volume: 180 start-page: 3465 year: 2010 end-page: 3487 ident: bib0020 article-title: Multi-objective constructive heuristics for the 1/3 variant of the time and space assembly line balancing problem: ACO and Random Greedy Search publication-title: Information Sciences – year: 2003 ident: bib0125 article-title: MONACO – Multi-Objective Network Optimisation Based on an ACO publication-title: X Encuentros de Geometría Computacional – volume: 38 start-page: 709 year: 2011 end-page: 720 ident: bib0025 article-title: Including different kinds of preferences in a multi-objective ant algorithm for time and space assembly line balancing on different Nissan scenarios publication-title: Expert Systems with Applications – start-page: 359 year: 2001 end-page: 372 ident: bib0095 article-title: Bi-criterion optimization with multi colony ant algorithms publication-title: First International Conference on Evolutionary Multi-criterion Optimization, Lecture Notes in Computer Science 1993 – volume: 22 start-page: 135 year: 1995 end-page: 147 ident: bib0135 article-title: Genetic algorithm crossover operators for ordering applications publication-title: Computers & Operations Research – start-page: 894 year: 1999 end-page: 901 ident: bib0115 article-title: MOAQ an Ant-Q algorithm for multiple objective optimization problems publication-title: Genetic and Evolutionary Computation Conference, GECCO’99 – volume: 32 start-page: 909 year: 1986 end-page: 932 ident: bib0010 article-title: A survey of exact algorithms for the simple assembly line balancing problem publication-title: Management Science – start-page: 104 year: 2008 end-page: 115 ident: bib0060 article-title: Infeasibility driven evolutionary algorithm (IDEA) for engineering design optimization publication-title: AI 2008: Advances in Artificial Intelligence – volume: 180 start-page: 116 year: 2007 end-page: 148 ident: bib0040 article-title: A taxonomy and an empirical analysis of multiple objective ant colony optimization algorithms for the bi-criteria TSP publication-title: European Journal of Operational Research – volume: 11 start-page: 115 year: 2003 end-page: 141 ident: bib0100 article-title: Are COMPETants more competent for problem solving? — The case of a multiple objective transportation problem publication-title: Central European Journal of Operation Research – volume: 26 start-page: 29 year: 1996 end-page: 41 ident: bib0065 article-title: Ant system: optimization by a colony of cooperating agents publication-title: IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics – start-page: 87 year: 2009 end-page: 102 ident: bib0080 article-title: Theory of the hypervolume indicator: optimal publication-title: Proceedings of the 10th ACM SIGEVO Workshop on Foundations of Genetic Algorithms – volume: 7 start-page: 117 year: 2003 end-page: 132 ident: bib0085 article-title: Performance assessment of multiobjective optimizers: an analysis and review publication-title: IEEE Transactions on Evolutionary Computation – volume: 131 start-page: 79 year: 2004 end-page: 99 ident: bib0130 article-title: Pareto ant colony optimization: a metaheuristic approach to multiobjective portfolio selection publication-title: Annals of Operations Research – volume: 178 start-page: 950 year: 2008 ident: 10.1016/j.asoc.2013.06.014_bib0090 article-title: Obtaining transparent models of chaotic systems with multi-objective simulated annealing algorithms publication-title: Information Sciences doi: 10.1016/j.ins.2007.09.029 – start-page: 894 year: 1999 ident: 10.1016/j.asoc.2013.06.014_bib0115 article-title: MOAQ an Ant-Q algorithm for multiple objective optimization problems – year: 2007 ident: 10.1016/j.asoc.2013.06.014_bib0070 – volume: 7 start-page: 117 issue: 2 year: 2003 ident: 10.1016/j.asoc.2013.06.014_bib0085 article-title: Performance assessment of multiobjective optimizers: an analysis and review publication-title: IEEE Transactions on Evolutionary Computation doi: 10.1109/TEVC.2003.810758 – volume: 180 start-page: 116 issue: 1 year: 2007 ident: 10.1016/j.asoc.2013.06.014_bib0040 article-title: A taxonomy and an empirical analysis of multiple objective ant colony optimization algorithms for the bi-criteria TSP publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2006.03.041 – volume: 22 start-page: 135 issue: 1 year: 1995 ident: 10.1016/j.asoc.2013.06.014_bib0135 article-title: Genetic algorithm crossover operators for ordering applications publication-title: Computers & Operations Research doi: 10.1016/0305-0548(93)E0024-N – year: 2003 ident: 10.1016/j.asoc.2013.06.014_bib0125 article-title: MONACO – Multi-Objective Network Optimisation Based on an ACO – volume: 38 start-page: 709 year: 2011 ident: 10.1016/j.asoc.2013.06.014_bib0025 article-title: Including different kinds of preferences in a multi-objective ant algorithm for time and space assembly line balancing on different Nissan scenarios publication-title: Expert Systems with Applications doi: 10.1016/j.eswa.2010.07.023 – volume: 3 start-page: 257 issue: 4 year: 1999 ident: 10.1016/j.asoc.2013.06.014_bib0075 article-title: Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach publication-title: IEEE Transactions on Evolutionary Computation doi: 10.1109/4235.797969 – start-page: 359 year: 2001 ident: 10.1016/j.asoc.2013.06.014_bib0095 article-title: Bi-criterion optimization with multi colony ant algorithms – volume: 3 start-page: 15 year: 2011 ident: 10.1016/j.asoc.2013.06.014_bib0030 article-title: A new diversity induction mechanism for a multi-objective ant colony algorithm to solve a real-world time and space assembly line balancing problem publication-title: Memetic Computing doi: 10.1007/s12293-010-0035-6 – volume: 180 start-page: 3465 issue: 15 year: 2010 ident: 10.1016/j.asoc.2013.06.014_bib0020 article-title: Multi-objective constructive heuristics for the 1/3 variant of the time and space assembly line balancing problem: ACO and Random Greedy Search publication-title: Information Sciences doi: 10.1016/j.ins.2010.05.033 – volume: 55 start-page: 705 year: 2003 ident: 10.1016/j.asoc.2013.06.014_bib0145 article-title: Ant colony optimisation and local search for bin packing and cutting stock problems publication-title: Journal of the Operational Research Society doi: 10.1057/palgrave.jors.2601771 – volume: 15 start-page: 617 issue: 6 year: 2008 ident: 10.1016/j.asoc.2013.06.014_bib0140 article-title: A study on the use of non-parametric tests for analyzing the evolutionary algorithms’ behaviour: a case study on the CEC’2005 Special Session on Real Parameter Optimization publication-title: Journal of Heuristics doi: 10.1007/s10732-008-9080-4 – volume: 32 start-page: 909 issue: 8 year: 1986 ident: 10.1016/j.asoc.2013.06.014_bib0010 article-title: A survey of exact algorithms for the simple assembly line balancing problem publication-title: Management Science doi: 10.1287/mnsc.32.8.909 – volume: 3 start-page: 69 year: 2009 ident: 10.1016/j.asoc.2013.06.014_bib0045 article-title: Multiple objective ant colony optimisation publication-title: Swarm Intelligence doi: 10.1007/s11721-008-0022-4 – volume: 38 start-page: 12453 issue: 10 year: 2011 ident: 10.1016/j.asoc.2013.06.014_bib0055 article-title: Mixed-model assembly line balancing using a multi-objective ant colony optimization approach publication-title: Expert Systems with Applications doi: 10.1016/j.eswa.2011.04.026 – volume: 11 start-page: 115 issue: 2 year: 2003 ident: 10.1016/j.asoc.2013.06.014_bib0100 article-title: Are COMPETants more competent for problem solving? — The case of a multiple objective transportation problem publication-title: Central European Journal of Operation Research – start-page: 87 year: 2009 ident: 10.1016/j.asoc.2013.06.014_bib0080 article-title: Theory of the hypervolume indicator: optimal μ-distributions and the choice of the reference point – volume: 1 start-page: 53 issue: 1 year: 1997 ident: 10.1016/j.asoc.2013.06.014_bib0110 article-title: Ant colony system: a cooperative learning approach to the traveling salesman problem publication-title: IEEE Transactions on Evolutionary Computation doi: 10.1109/4235.585892 – volume: 44 start-page: 27 issue: 1 year: 2006 ident: 10.1016/j.asoc.2013.06.014_bib0050 article-title: Multi-objective assembly line balancing via a modified ant colony optimization technique publication-title: International Journal of Production Research doi: 10.1080/00207540500216748 – volume: 26 start-page: 29 issue: 1 year: 1996 ident: 10.1016/j.asoc.2013.06.014_bib0065 article-title: Ant system: optimization by a colony of cooperating agents publication-title: IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics doi: 10.1109/3477.484436 – start-page: 97 year: 2003 ident: 10.1016/j.asoc.2013.06.014_bib0105 article-title: A multiobjective ant colony system for vehicle routing problem with time windows – start-page: 104 year: 2008 ident: 10.1016/j.asoc.2013.06.014_bib0060 article-title: Infeasibility driven evolutionary algorithm (IDEA) for engineering design optimization – start-page: 252 year: 1995 ident: 10.1016/j.asoc.2013.06.014_bib0120 article-title: Ant-Q: a reinforcement learning approach to the traveling salesman problem – start-page: 2016 issue: 177 year: 2007 ident: 10.1016/j.asoc.2013.06.014_bib0015 article-title: Ant algorithms for a time and space constrained assembly line balancing problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2005.12.017 – year: 2004 ident: 10.1016/j.asoc.2013.06.014_bib0035 – year: 1999 ident: 10.1016/j.asoc.2013.06.014_bib0005 – volume: 131 start-page: 79 issue: 1 year: 2004 ident: 10.1016/j.asoc.2013.06.014_bib0130 article-title: Pareto ant colony optimization: a metaheuristic approach to multiobjective portfolio selection publication-title: Annals of Operations Research doi: 10.1023/B:ANOR.0000039513.99038.c6 |
| SSID | ssj0016928 |
| Score | 2.2960935 |
| Snippet | [Display omitted]
•Assembly line balancing (ALB) is a classical and complex industrial problem.•Time and space assembly line balancing (TSALBP) is a realistic... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 4370 |
| SubjectTerms | Ant Colony Optimization Automotive industry Multi-Objective Optimization Time and Space Assembly Line Balancing Problem |
| Title | A comparative study of Multi-Objective Ant Colony Optimization algorithms for the Time and Space Assembly Line Balancing Problem |
| URI | https://dx.doi.org/10.1016/j.asoc.2013.06.014 |
| Volume | 13 |
| WOSCitedRecordID | wos000324033300012&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 - Elsevier 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/eLvHCXMwtV1LbxMxELZCy4ELb0R5yQc4RYuytvfhYxqKgENbiYJyW9lepzTabKo8qvbW38evYsb2blahqgCJy2q1ihNv5vM87G9mCHmrweonFiPVHBa5SAYmUqVII8EzO-GlFrHxzSayw8N8PJbHvd7PJhfmosrqOr-8lOf_VdTwDISNqbN_Ie72S-EB3IPQ4Qpih-sfCX4YeOW-oveyKRrtMm2jIz31Gg6rBuCuAQT__SNQG7OQj9lX1el8cbb64Qs1OL8U00Q8xRMCbIsStTNdXWE8b_v7yI00uOFw7HvTdN3dxsddgrJ301qvGlPpzpZKFX0HtVR5wu56g1THEPG5RPXatiyQETLxR_zdPnfKEm8lXxrVMow_qJnPUAMdeOopZs2eRsxDcl-70fZbso3XzWkeCRl2LK1_lmcskqnv-tIqdN4FbtxRz4DAQcfU4yHojWbE72hM3ytYIUj_467Gq8923SrP_RWnhbPCc0FsR3-H7LIskWAkdoefD8Zf2jOtVLpOv-1rhBQuzzbc_qWb3aSO63PykNwPMQsdeqw9Ij1bPyYPmn4gNJiHJ-R6SDvQow56dD6hW9CjAD3qoUe70KMb6FGAHgXoUYQeBehRBz3aQI8i9GgLPRqg95R8-3hwMvoUhQ4fkeFCrCJd2kRpAzETm7AyLqXL7Ndc5sxArJ2o2For4ozLVDGj0sQIAwZEMKtZbJTmz8hOPa_tc0I1jBuUecZzUDAsLlWuJyJl0mjJSq71HombP7Qwofw9dmGpiobnOC1QCAUKoUCyZyz2SL8dc-6Lv9z66aSRUxHcV--WFgCrW8a9-MdxL8m9zdp5RXZWi7V9Te6ai9XZcvEmoO8XkinAbA |
| 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+comparative+study+of+Multi-Objective+Ant+Colony+Optimization+algorithms+for+the+Time+and+Space+Assembly+Line+Balancing+Problem&rft.jtitle=Applied+soft+computing&rft.au=Rada-Vilela%2C+Juan&rft.au=Chica%2C+Manuel&rft.au=Cord%C3%B3n%2C+%C3%93scar&rft.au=Damas%2C+Sergio&rft.date=2013-11-01&rft.pub=Elsevier+B.V&rft.issn=1568-4946&rft.eissn=1872-9681&rft.volume=13&rft.issue=11&rft.spage=4370&rft.epage=4382&rft_id=info:doi/10.1016%2Fj.asoc.2013.06.014&rft.externalDocID=S1568494613002032 |
| 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 |