Vector evaluated particle swarm optimization approach to solve assembly sequence planning problem
MULTI-CRITERIA Assembly sequence planning (ASP) is known as large scale, time consuming combinatorial problem. Production scheduling is a complex combined optimization problem and the optimization method of which is not perfect [1]. The product order of assembly is the main focus of ASP to deter...
Saved in:
| Main Authors: | , , , , , , , , |
|---|---|
| Format: | Article |
| Language: | en |
| Published: |
Malaysian Society for Computed Tomography & Imaging Technology (MyCT)
2022
|
| Subjects: | |
| Online Access: | http://eprints.uthm.edu.my/7492/1/J14374_b987dbf64de5e1e27c85acb5ea035ff7.pdf http://eprints.uthm.edu.my/7492/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1833418396464578560 |
|---|---|
| author | A. Mukred, Jameel A. A. Rahim, Ruzairi Mohamad, Elmy Johana Salh, Adeeb Ashyap, Adel Y. I. Abdullah, Qazwan AL-Fadhali, Najib Al-Ameri, S. Al-Ashwal, Rania |
| author_facet | A. Mukred, Jameel A. A. Rahim, Ruzairi Mohamad, Elmy Johana Salh, Adeeb Ashyap, Adel Y. I. Abdullah, Qazwan AL-Fadhali, Najib Al-Ameri, S. Al-Ashwal, Rania |
| author_sort | A. Mukred, Jameel A. |
| building | UTHM Library |
| collection | Institutional Repository |
| content_provider | Universiti Tun Hussein Onn Malaysia |
| content_source | UTHM Institutional Repository |
| continent | Asia |
| country | Malaysia |
| description | MULTI-CRITERIA Assembly sequence planning (ASP) is known as large scale, time consuming combinatorial
problem. Production scheduling is a complex combined optimization problem and the optimization method of which is
not perfect [1]. The product order of assembly is the main focus of ASP to determine, which is subject to precedence
constraint matrix (PM) that is to be strictly followed in the assembly line to shorten the assembly time and hence save
the assembly cost. Refs. [2, 3] proposed the concept of Assembly Precedence Relations (APRs), which is applied to
determine the precedence relations among the liaisons in the product. Cut-set analysis method by which the number of
queries can be reduced by 95% [4]. More efficient queries is proposed in ref. [5]. When number of parts increase the
problem became more complex. Heuristic methods developed to overcome this complicity. It is more efficient but it
may stick in local optima, no guarantee that global optima may be found. Some heuristic methods may use Neural
Network (NN), which need system training before start searching. Meta-heuristic method is able to escape the local
optima. Simulated Annealing (SA) is used where search is done in sequence basis and to solve optimization problems.
Ref. [6] used (SA) approach, which is based on searching via all the feasible sequences. This disadvantage is overcome
by an improved cut-set [7, 8]. Generation and evaluation of assembly plans, when the number of parts is large their
planer is slow [9]. Genetic Algorithm (GA), where the genes in chromosomes represents the components of the product
[10, 11]. An integrated approach such that liaison graph represents the physical connections between two components
[15]. An extension to previous work is proposed in [16]. Finding a method to determine global optima or near global
optima more reliably and quickly [17]. The definition of genes and evaluation criteria here are based on the connector
concept [18]. The complete or partial automation of assembly of products in smaller volumes and with more rapid
product changeover and model transition has enabled through the use of programmable and flexible automation. AI is
increasingly playing a key role in such flexible automation systems [19]. |
| format | Article |
| id | my.uthm.eprints-7492 |
| institution | Universiti Tun Hussein Onn Malaysia |
| language | en |
| publishDate | 2022 |
| publisher | Malaysian Society for Computed Tomography & Imaging Technology (MyCT) |
| record_format | eprints |
| spelling | my.uthm.eprints-74922022-08-15T03:00:43Z http://eprints.uthm.edu.my/7492/ Vector evaluated particle swarm optimization approach to solve assembly sequence planning problem A. Mukred, Jameel A. A. Rahim, Ruzairi Mohamad, Elmy Johana Salh, Adeeb Ashyap, Adel Y. I. Abdullah, Qazwan AL-Fadhali, Najib Al-Ameri, S. Al-Ashwal, Rania T Technology (General) MULTI-CRITERIA Assembly sequence planning (ASP) is known as large scale, time consuming combinatorial problem. Production scheduling is a complex combined optimization problem and the optimization method of which is not perfect [1]. The product order of assembly is the main focus of ASP to determine, which is subject to precedence constraint matrix (PM) that is to be strictly followed in the assembly line to shorten the assembly time and hence save the assembly cost. Refs. [2, 3] proposed the concept of Assembly Precedence Relations (APRs), which is applied to determine the precedence relations among the liaisons in the product. Cut-set analysis method by which the number of queries can be reduced by 95% [4]. More efficient queries is proposed in ref. [5]. When number of parts increase the problem became more complex. Heuristic methods developed to overcome this complicity. It is more efficient but it may stick in local optima, no guarantee that global optima may be found. Some heuristic methods may use Neural Network (NN), which need system training before start searching. Meta-heuristic method is able to escape the local optima. Simulated Annealing (SA) is used where search is done in sequence basis and to solve optimization problems. Ref. [6] used (SA) approach, which is based on searching via all the feasible sequences. This disadvantage is overcome by an improved cut-set [7, 8]. Generation and evaluation of assembly plans, when the number of parts is large their planer is slow [9]. Genetic Algorithm (GA), where the genes in chromosomes represents the components of the product [10, 11]. An integrated approach such that liaison graph represents the physical connections between two components [15]. An extension to previous work is proposed in [16]. Finding a method to determine global optima or near global optima more reliably and quickly [17]. The definition of genes and evaluation criteria here are based on the connector concept [18]. The complete or partial automation of assembly of products in smaller volumes and with more rapid product changeover and model transition has enabled through the use of programmable and flexible automation. AI is increasingly playing a key role in such flexible automation systems [19]. Malaysian Society for Computed Tomography & Imaging Technology (MyCT) 2022 Article PeerReviewed text en http://eprints.uthm.edu.my/7492/1/J14374_b987dbf64de5e1e27c85acb5ea035ff7.pdf A. Mukred, Jameel A. and A. Rahim, Ruzairi and Mohamad, Elmy Johana and Salh, Adeeb and Ashyap, Adel Y. I. and Abdullah, Qazwan and AL-Fadhali, Najib and Al-Ameri, S. and Al-Ashwal, Rania (2022) Vector evaluated particle swarm optimization approach to solve assembly sequence planning problem. Journal of Tomography System & Sensors Application, 5 (1). pp. 1-9. ISSN 2636-9133 |
| spellingShingle | T Technology (General) A. Mukred, Jameel A. A. Rahim, Ruzairi Mohamad, Elmy Johana Salh, Adeeb Ashyap, Adel Y. I. Abdullah, Qazwan AL-Fadhali, Najib Al-Ameri, S. Al-Ashwal, Rania Vector evaluated particle swarm optimization approach to solve assembly sequence planning problem |
| title | Vector evaluated particle swarm optimization approach to solve assembly sequence planning problem |
| title_full | Vector evaluated particle swarm optimization approach to solve assembly sequence planning problem |
| title_fullStr | Vector evaluated particle swarm optimization approach to solve assembly sequence planning problem |
| title_full_unstemmed | Vector evaluated particle swarm optimization approach to solve assembly sequence planning problem |
| title_short | Vector evaluated particle swarm optimization approach to solve assembly sequence planning problem |
| title_sort | vector evaluated particle swarm optimization approach to solve assembly sequence planning problem |
| topic | T Technology (General) |
| url | http://eprints.uthm.edu.my/7492/1/J14374_b987dbf64de5e1e27c85acb5ea035ff7.pdf http://eprints.uthm.edu.my/7492/ |
| url_provider | http://eprints.uthm.edu.my/ |