scholarly journals Optimum Assembly Sequence Planning System Using Discrete Artificial Bee Colony Algorithm

2018 ◽  
Vol 2018 ◽  
pp. 1-14 ◽  
Author(s):  
Özkan Özmen ◽  
Turgay Batbat ◽  
Tolgan Özen ◽  
Cem Sinanoğlu ◽  
Ayşegül Güven
Keyword(s):  
Computer Aided Design ◽  
Artificial Bee Colony ◽  
Three Dimensional ◽  
Assembly Sequence Planning ◽  
Planning System ◽  
Assembly Planning ◽  
Assembly Sequence ◽  
Bee Colony ◽  
Assembly Sequences ◽  
The Matrix

Assembly refers both to the process of combining parts to create a structure and to the product resulting therefrom. The complexity of this process increases with the number of pieces in the assembly. This paper presents the assembly planning system design (APSD) program, a computer program developed based on a matrix-based approach and the discrete artificial bee colony (DABC) algorithm, which determines the optimum assembly sequence among numerous feasible assembly sequences (FAS). Specifically, the assembly sequences of three-dimensional (3D) parts prepared in the computer-aided design (CAD) software AutoCAD are first coded using the matrix-based methodology and the resulting FAS are assessed and the optimum assembly sequence is selected according to the assembly time optimisation criterion using DABC. The results of comparison of the performance of the proposed method with other methods proposed in the literature verify its superiority in finding the sequence with the lowest overall time. Further, examination of the results of application of APSD to assemblies consisting of parts in different numbers and shapes shows that it can select the optimum sequence from among hundreds of FAS.

scholarly journals Assembly Sequence Planning Using Artificial Neural Networks for Mechanical Parts Based on Selected Criteria

2021 ◽  
Vol 11 (21) ◽  
pp. 10414
Author(s):  
Marcin Suszyński ◽  
Katarzyna Peta
Keyword(s):  
Neural Networks ◽  
Artificial Neural Networks ◽  
Clustering Algorithm ◽  
Assembly Sequence Planning ◽  
Planning System ◽  
Assembly Sequence ◽  
Mechanical Parts ◽  
Sequence Planning ◽  
Assembly Sequences ◽  
Artificial Neural

The proposed model of the neural network describes the task of planning the assembly sequence on the basis of predicting the optimal assembly time of mechanical parts. In the proposed neural approach, the k-means clustering algorithm is used. In order to find the most effective network, 10,000 network models were made using various training methods, including the steepest descent method, the conjugate gradients method, and Broyden–Fletcher–Goldfarb–Shanno algorithm. Changes to network parameters also included the following activation functions: linear, logistic, tanh, exponential, and sine. The simulation results suggest that the neural predictor would be used as a predictor for the assembly sequence planning system. This paper discusses a new modeling scheme known as artificial neural networks, taking into account selected criteria for the evaluation of assembly sequences based on data that can be automatically downloaded from CAx systems.

AUTOMATIC COLLISION DETECTION FOR ASSEMBLY SEQUENCE PLANNING USING A THREE-DIMENSIONAL SOLID MODEL

2011 ◽  
Vol 10 (02) ◽  
pp. 277-291 ◽  
Author(s):  
ALFADHLANI ◽  
T. M. A. ARI SAMADHI ◽  
ANAS MA'RUF ◽  
ISA SETIASYAH TOHA
Keyword(s):  
Free Path ◽  
Collision Detection ◽  
Three Dimensional ◽  
Assembly Sequence Planning ◽  
Detection Methods ◽  
Assembly Sequence ◽  
Sequence Planning ◽  
Assembly Sequences ◽  
Geometrical Data ◽  
Selection Of

Assembly sequence planning of a product involves several steps, including generation of precedence constraints, generation of assembly sequences, and selection of assembly sequences. Generation and selection of assembly sequences should be able to guarantee the feasibility of assembly. Assembly will be feasible if there is no collision between components when assembled. Detection of collision-free path of assembly can be done in an automated way. There are a number of collision detection methods that have been developed, but the method requires a complicated process of data geometry analysis. This paper proposes a method for detecting a collision-free path of the assembly component in a more simple way. Geometrical data required, taken from the three-dimensional (3D) solid drawing in the form of stacked drawing in computer-aided design (CAD) systems. Retrieval of geometrical data of components and detection of the collision-free path of an assembly were done in an automated way, directly from the CAD system.

scholarly journals A modified artificial bee colony algorithm to optimise integrated assembly sequence planning and assembly line balancing

2019 ◽  
Vol 13 (4) ◽  
pp. 5905-5921
Author(s):  
M. F. F. Ab. Rashid ◽  
N. M. Z. Nik Mohamed ◽  
A. N. Mohd Rose
Keyword(s):  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Assembly Line ◽  
Assembly Line Balancing ◽  
Assembly Sequence Planning ◽  
Line Balancing ◽  
Benchmark Problems ◽  
Assembly Sequence ◽  
Sequence Planning ◽  
Bee Colony

Assembly Sequence Planning (ASP) and Assembly Line Balancing (ALB) are traditionally optimised independently. However recently, integrated ASP and ALB optimisation has become more relevant to obtain better quality solution and to reduce time to market. Despite many optimisation algorithms that were proposed to optimise this problem, the existing researches on this problem were limited to Evolutionary Algorithm (EA), Ant Colony Optimisation (ACO), and Particle Swarm Optimisation (PSO). This paper proposed a modified Artificial Bee Colony algorithm (MABC) to optimise the integrated ASP and ALB problem. The proposed algorithm adopts beewolves predatory concept from Grey Wolf Optimiser to improve the exploitation ability in Artificial Bee Colony (ABC) algorithm. The proposed MABC was tested with a set of benchmark problems. The results indicated that the MABC outperformed the comparison algorithms in 91% of the benchmark problems. Furthermore, a statistical test reported that the MABC had significant performances in 80% of the cases.

Assembly Sequence Planning Based on Max-Min Ant Colony System

2013 ◽  
Vol 284-287 ◽  
pp. 2220-2227 ◽  
Author(s):  
Jia Peng Yu ◽  
Cheng En Wang
Keyword(s):  
Performance Appraisal ◽  
Assembly Sequence Planning ◽  
Ant Colony ◽  
Planning System ◽  
Assembly Planning ◽  
Group Method ◽  
Ant Colony System ◽  
Assembly Sequence ◽  
Ant System ◽  
Sequence Planning

An assembly sequence planning (ASP) method that combined the advantages of ant colony system (ACS) and Max-Min ant system (MMAS) is proposed. To identify the best sequence easily, five optimization criterions are automatically quantified, including reorientation, parallelism, continuity, stability and auxiliary stroke, and then integrated into the multi-objective heuristic and fitness functions of ant colony optimization (ACO). To improve the search capability for the global-best sequence, several measures are presented from aspects of determining number of ant, max-min pheromone limits, performance appraisal for initial components allocation and the group method for same components. The ASP algorithm based on Max-Min ant colony system (MMACS) is proposed. An assembly planning system AutoAssem is developed based on Siemens NX platform, and the actual effectiveness of each optimization measure is testified through case study of a valve.

Assembly Sequence Planning by Using Multiple Random Trees Based Motion Planning

2012 ◽  
Author(s):  
Carlos Morato ◽  
Krishnanand Kaipa ◽  
Satyandra K. Gupta
Keyword(s):  
Motion Planning ◽  
Assembly Sequence Planning ◽  
Random Trees ◽  
Planning System ◽  
Assembly Model ◽  
Assembly Sequence ◽  
Disassembly Sequence Planning ◽  
Sequence Planning ◽  
Disassembly Sequence ◽  
Assembly Sequences

In this paper, we introduce multiple random trees based motion planning to perform assembly sequence planning for complex assemblies. Initially, given an assembly model, our technique performs disassembly sequence planning. This approach dynamically reduces the size and complexity of the assembly based on a hierarchical exploration structure that keeps information about the completion of the disassembly. Next, the disassembly information is used to generate feasible assembly sequences, along with precedence constraints, to assemble each part into the current subassembly. The motion planning system chooses part order by detecting geometrical interferences and analyzing feasible part movements. Results from tests on a variety of complex assemblies validate the efficiency of our approach.

Structural Analysis of Product and Computer-Aided Assembly Planning in AssemBL Software Package

2018 ◽  
pp. 11-33
Author(s):  
A. N. Bozhko
Keyword(s):  
Computer Aided Design ◽  
State Of The Art ◽  
Graph Model ◽  
Design System ◽  
Assembly Planning ◽  
Complex Products ◽  
Assembly Sequences ◽  
Computer Aided ◽  
Cad Cam ◽  
Aided Design

Computer-aided design of assembly processes (Computer aided assembly planning, CAAP) of complex products is an important and urgent problem of state-of-the-art information technologies. Intensive research on CAAP has been underway since the 1980s. Meanwhile, specialized design systems were created to provide synthesis of assembly plans and product decompositions into assembly units. Such systems as ASPE, RAPID, XAP / 1, FLAPS, Archimedes, PRELEIDES, HAP, etc. can be given, as an example. These experimental developments did not get widespread use in industry, since they are based on the models of products with limited adequacy and require an expert’s active involvement in preparing initial information. The design tools for the state-of-the-art full-featured CAD/CAM systems (Siemens NX, Dassault CATIA and PTC Creo Elements / Pro), which are designed to provide CAAP, mainly take into account the geometric constraints that the design imposes on design solutions. These systems often synthesize technologically incorrect assembly sequences in which known technological heuristics are violated, for example orderliness in accuracy, consistency with the system of dimension chains, etc.An AssemBL software application package has been developed for a structured analysis of products and a synthesis of assembly plans and decompositions. The AssemBL uses a hyper-graph model of a product that correctly describes coherent and sequential assembly operations and processes. In terms of the hyper-graph model, an assembly operation is described as shrinkage of edge, an assembly plan is a sequence of shrinkages that converts a hyper-graph into the point, and a decomposition of product into assembly units is a hyper-graph partition into sub-graphs.The AssemBL solves the problem of minimizing the number of direct checks for geometric solvability when assembling complex products. This task is posed as a plus-sum two-person game of bicoloured brushing of an ordered set. In the paradigm of this model, the brushing operation is to check a certain structured fragment for solvability by collision detection methods. A rational brushing strategy minimizes the number of such checks.The package is integrated into the Siemens NX 10.0 computer-aided design system. This solution allowed us to combine specialized AssemBL tools with a developed toolkit of one of the most powerful and popular integrated CAD/CAM /CAE systems.

Filippova Automated planning of graduality assembly

2021 ◽  
pp. 28-44
Author(s):  
D. Proskurenko ◽  
◽  
O. Tretyak ◽  
M. Demchenko ◽  
M. Filippova ◽  
...  
Keyword(s):  
Computational Effort ◽  
Planning System ◽  
Assembly Planning ◽  
Component Part ◽  
Practical Implementation ◽  
Early Stages ◽  
Assembly Sequences ◽  
Assembly Operations ◽  
Communication Schedule ◽  
Relation Graph

Modern industrial production requires the improvement of assembly processes, and thus increase the level of automated intelligent sequence planning. Therefore, researches in the field of automation of the sequence of assembly of products in industries are relevant at this time. In today's world there is a need to develop complex, accurate products. Problems are created in industries due to the reduction of the life cycle of products. There is a need to study the problem of assembly planning to achieve the goal of practical implementation and standardization of assembly plans. Creating graphs of the addition process is one of the problems. The assembly planning system can reduce human intervention in the process and reduce computational effort. The finished assembly contains many components that can be assembled using many sequences. A review of the methods from the literature showed that although these methods increase the automation level, they still cannot be applied to actual production because they do not take into account the experience and knowledge that can play a major role in planning and are of great value. Assembly planning, relationship charts, priority charts. Improving the assembly planning system to create a communication schedule and an assembly priority schedule was proposed. The advanced system will be used to generate possible assembly sequences with subassembly identification. A system has been developed to create alternative possible assembly sequences that can be used by component part / product designers in the early stages. A system capable of generating assembly sequences for simultaneous assembly of multiple parts has been proposed. Conclusions and work results can be applied used and improved for more productive product development by designers in the early stages and faster assembly of products in enterprises. The paper did not consider practical limitations (gravity) and irreversible assembly operations, such as permanent fastening, welding etc. Кey words: assembly, blocking graph, relation graph, sequence

A Dynamic Assembly Modeling Method for Satellite Final Assembly Sequence Planning

2010 ◽  
Vol 156-157 ◽  
pp. 332-338
Author(s):  
Yuan Zhang ◽  
Kai Fu Zhang ◽  
Jian Feng Yu ◽  
Lei Zhao
Keyword(s):  
Dynamic Model ◽  
Static Model ◽  
Modeling Method ◽  
Assembly Sequence Planning ◽  
Assembly Model ◽  
Assembly Sequence ◽  
Final Assembly ◽  
Model Tree ◽  
Assembly Sequences ◽  
Dynamic Assembly

To study the effect of assembly process information combining disassemble and assemble on satellite assembly sequence, this paper presents an object-oriented and assembly information integrated model, which is composed of static model and dynamic model. The feasibility determination based on Cut-set theory is presented and the construction algorithm of dynamic model is established by static model, the dynamic assembly model tree is obtained by analyzing in layers and verifying possible states using this algorithm, where the assembly model tree includes all the geometric feasible assembly sequences of satellite. Finally, this modeling method is verified by a satellite product.

Sign in / Sign up

Export Citation Format

Share Document