Computer-Aided Assembly Sequence Planning for High-Mix Low-Volume Products in the Electronic Appliances Industry

Electronic appliance manufacturers are facing the challenge of frequent product orders. Based on each product order, the assembly process and workstations need to be planned. An essential part of the assembly planning is defining the assembly sequence, considering the mechanical product’s design, and handling of the product’s components. The assembly sequence determines the order of processes for each workstation, the overall layout, and thereby time and cost. Currently, the assembly sequence is decided by industrial engineers through a manual approach that is time-consuming, complex, and requires technical expertise. To reduce the industrial engineers’ manual effort, a Computer-Aided Assembly Sequence Planning (CAASP) system is proposed in this paper. It compromises the components for a comprehensive system that aims to be applied practically. The system uses Computer-Aided Design (CAD) files to derive Liaison and Interference Matrices that represent a mathematical relationship between parts. Subsequently, an adapted Ant Colony Optimization Algorithm generates an optimized assembly sequence based on these relationships. Through a web browser-based application, the user can upload files and interact with the system. The system is conceptualized and validated using the CAD file of an electric motor example product. The results are discussed, and future work is outlined

Multi-objective discrete particle swarm optimisation algorithm for integrated assembly sequence planning and assembly line balancing

In assembly optimisation, assembly sequence planning and assembly line balancing have been extensively studied because both activities are directly linked with assembly efficiency that influences the final assembly costs. Both activities are categorised as NP-hard and usually performed separately. Assembly sequence planning and assembly line balancing optimisation presents a good opportunity to be integrated, considering the benefits such as larger search space that leads to better solution quality, reduces error rate in planning and speeds up time-to-market for a product. In order to optimise an integrated assembly sequence planning and assembly line balancing, this work proposes a multi-objective discrete particle swarm optimisation algorithm that used discrete procedures to update its position and velocity in finding Pareto optimal solution. A computational experiment with 51 test problems at different difficulty levels was used to test the multi-objective discrete particle swarm optimisation performance compared with the existing algorithms. A statistical test of the algorithm performance indicates that the proposed multi-objective discrete particle swarm optimisation algorithm presents significant improvement in terms of the quality of the solution set towards the Pareto optimal set

Assembly and Disassembly Planning by using Fuzzy Logic & Genetic Algorithms

The authors propose the implementation of hybrid Fuzzy Logic-Genetic Algorithm (FL-GA) methodology to plan the automatic assembly and disassembly sequence of products. The GA-Fuzzy Logic approach is implemented onto two levels. The first level of hybridization consists of the development of a Fuzzy controller for the parameters of an assembly or disassembly planner based on GAs. This controller acts on mutation probability and crossover rate in order to adapt their values dynamically while the algorithm runs. The second level consists of the identification of theoptimal assembly or disassembly sequence by a Fuzzy function, in order to obtain a closer control of the technological knowledge of the assembly/disassembly process. Two case studies were analyzed in order to test the efficiency of the Fuzzy-GA methodologies

Gait identification and optimisation for amphi-underwater robot by using ant colony algorithm

Manoeuvrable robot commonly has become the focus of the latest heated issues especially in applications that involved disaster rescue, military missions and underwater or extra-terrestrial explorations. Currently, the manoeuvrable robot is controlled manually by the operator and it’s a wheeled type. It is used for rescue missions to transport people from disaster area to the safe zone. However, the robot is incapable of moving automatically, and it goes through terrain or landscape like swarm. Therefore, a suitable platform is required to transport or for other uses especially in dangerous mission. It is very difficult to estimate the movement of the robot to avoid obstacles and choose the alternative path. Hence, this research presents the point-to-point gait identification or path planning of the behavious of the robot to manuever autonomously on both on-land and underwater environment. For the optimization, the robot will travel from one specific point to another with the predefined position within optimized gait and fastest time by using Ant Colony Optimization (ACO) technique. The algorithm being compared, between Ant Colony Algorithm (ACO) and the Particle Swarm Optimisation (PSO) in terms of time and distance. The ACO been chosen because of the positive feedback for rapid discovery and able to use in dynamic applications for example adapts to changes like new distances. The performance of the algorithm showed that the execution time of ACO is more realistic. Hence, Matlab is used to determine the best cost extracted from the ACO with the pre-define of number of iteration and the number of ants. The laboratory-scaled prototype for amphibious vehicle was developed to test the design controlled with ACO technique where Global Positioning System (GPS) is used for the coordination of the robot and Magnetometer for the position of the robot. The robot prototype is able to move autonomously and optimized by the ant colony optimization with predefined position and terrain condition © BEIESP

Mixed-model parallel two-sided assembly line balancing problem: A flexible agent-based ant colony optimization approach

This is the author accepted manuscript. The final version is available from the publisher via the DOI in this record.Assembly lines are frequently used as a production method to assemble complex products. Two-sided assembly lines are utilized to assemble large-sized products (e.g., cars, buses, trucks). Locating two lines in parallel helps improve line efficiency by enabling collaboration between the line workers. This paper proposes a mixed-model parallel two-sided assembly line system that can be utilized to produce large-sized items in an inter-mixed sequence. The mixed-model parallel two-sided line balancing problem is defined and the advantages of utilizing multi-line stations across the lines are discussed. A flexible agent-based ant colony optimization algorithm is developed to solve the problem and a numerical example is given to explain the method systematically. The proposed algorithm builds flexible balancing solutions suitable for any model sequence launched. The dynamically changing workloads of workstations (based on specific product models during the production process) are also explored. A comprehensive experimental study is conducted and the results are statistically analyzed using the well-known paired sample t-test. The test results indicate that the mixed-model parallel two-sided assembly line system reduces the workforce need in comparison with separately balanced mixed-model two-sided lines. It is also shown that the proposed algorithm outperforms the tabu search algorithm and six heuristics often used in the assembly line balancing domain

Disassembly sequence planning validated thru augmented reality for a speed reducer

The lifecycle of a product is getting shorter in today’s market realities. Latest developments in the industry are heading towards achieving products that are easy to recycle, by developing further technological advances in raw materials ought to include input from End of Life (EOL) products so a reduction of natural harm could be achieved, hence reducing the overall production environmental footprint. Therefore, the approach taken as a design for environment, a key request nowadays in order to develop products that would ease the reverse manufacturing process leading to a more efficient element recycling for later use as spare parts or remanufacturing. The methodology proposed compares three probable disassembly sequences following a comparison of literature-found procedures between genetic algorithms and as a “state space search” problem, followed by a hybrid approach developed by the authors. Time and evaluation of these procedures reached to the best performing sequence. A subsequent augmented reality disassembly simulation was performed with the top-scored operation sequence with which the user is better able to familiarize himself with the assembly than a traditional paper manual, therefore enlightening the feasibility of the top performing sequence in the real world

A bibliographic review of production line design and balancing under uncertainty

This bibliography reviews the solution methods developed for the design and balancing problems of production lines such as assembly and disassembly lines. The line design problem aims in determining the number of workstations along with the corresponding assignment of tasks to each workstation, while the line balancing problem seeks an assignment of tasks, to the existing workstations of the line, which ensures that the workloads are as equal as possible among the workstations. These two optimisation problems can be also integrated and treated as a multi-objective optimisation problem. This review considers both deterministic and stochastic formulations for disassembly lines and is limited to assembly line design and balancing under uncertainty. This bibliography covers more than 90 publications since 1976 for assembly and 1999 for disassembly

A grid-based ant colony algorithm for automatic 3D hose routing

Ant Colony Algorithms applied to difficult combinatorial optimization problems such as the traveling salesman problem (TSP) and the quadratic assignment problem. In this paper we propose a grid-based ant colony algorithm for automatic 3D hose routing. Algorithm uses the tessellated format of the obstacles and the generated hoses in order to detect collisions. The representation of obstacles and hoses in the tessellated format greatly helps the algorithm towards handling free-form objects and speed up the computations. The performance of the algorithm has been tested on a number of 3D models

Optimized assembly design for resource efficient production in a multiproduct manufacturing system

Resource efficiency is one of the greatest challenges for sustainable manufacturing. Material flow in manufacturing systems directly influences resource efficiency, financial cost and environmental impact. A framework for material flow assessment in manufacturing systems (MFAM) was applied to a complex multi-product manufacturing case study. This supported the identification of options to alter material flow through changes to the product assembly design, to improve overall resource efficiency through eliminating resource intensive changeovers. Alternative assembly designs were examined using a combination of intelligent computation techniques: k-means clustering, genetic algorithm and ant colony algorithm. This provided recommendations balancing improvement potential with extent of process modification impact