Using genetic/simulated annealing algorithm to solve disassembly sequence planning

Disassembly sequence planning （DSP） plays a significant role in maintenance planning of the aircraft. It is used during the design stage for the analysis of maintainability of the aircraft. To solve product disassembly sequence planning problems efficiently, a product disassembly hybrid graph model, which describes the connection, non-connection and precedence relationships between the product parts, is established based on the characteristic of disassembly. Farther, the optimization model is provided to optimize disassembly sequence. And the solution methodology based on the genetic/simulated annealing algorithm with binaxy-tree algorithm is given. Finally, an example is analyzed in detail, and the result shows that the model is correct and efficient.

Disassembly Sequence Planning:A Survey

It is well-recognized that obsolete or discarded products can cause serious environmental pollution if they are poorly be handled.They contain reusable resource that can be recycled and used to generate desired economic benefits.Therefore,performing their efficient disassembly is highly important in green manufacturing and sustainable economic development.Their typical examples are electronic appliances and electromechanical/mechanical products.This paper presents a survey on the state of the art of disassembly sequence planning.It can help new researchers or decision makers to search for the right solution for optimal disassembly planning.It reviews the disassembly theory and methods that are applied for the processing,repair,and maintenance of obsolete/discarded products.This paper discusses the recent progress of disassembly sequencing planning in four major aspects:product disassembly modeling methods,mathematical programming methods,artificial intelligence methods,and uncertainty handling.This survey should stimulate readers to be engaged in the research,development and applications of disassembly and remanufacturing methodologies in the Industry 4.0 era.

Disassembly sequence planning using component-joint graph and ant colony optimization

Disassembly sequence planning is an important step of mechanical maintenance. This article presents an integrated study about the generation and optimizing algorithm of the disassembly sequence. Mechanical products are divided into two categories of components and connectors. The article uses component-joint graph to represent assembly constraints, including the incidence constraints are represented by incidence matrix and the interference constraints are represented by interference constraints. The inspiring factor and pheromone matrix are calculated according to assembly constraints. Then the ant generates its own disassembly sequences one by one and updates the inspiring factor and pheromone matrix. After all iterations, the best disassembly sequence planning of components and connectors are given. Finally, an application instance of the disassembly sequence of the jack is presented to illustrate the validity of this method.

A Discrete Bat Algorithm for Disassembly Sequence Planning

Based on the bat algorithm(BA), this paper proposes a discrete BA(DBA) approach to optimize the disassembly sequence planning(DSP) problem, for the purpose of obtaining an optimum disassembly sequence(ODS) of a product with a high degree of automation and guiding maintenance operation. The BA for solving continuous problems is introduced, and combining with mathematical formulations, the BA is reformed to be the DBA for DSP problems. The fitness function model(FFM) is built to evaluate the quality of disassembly sequences. The optimization performance of the DBA is tested and verified by an application case, and the DBA is compared with the genetic algorithm(GA), particle swarm optimization(PSO) algorithm and differential mutation BA(DMBA). Numerical experiments show that the proposed DBA has a better optimization capability and provides more accurate solutions than the other three algorithms.

Automated Disassembly Sequence Prediction for Industry 4.0 Using Enhanced Genetic Algorithm

The evolution of Industry 4.0 made it essential to adopt the Internet of Things(IoT)and Cloud Computing(CC)technologies to perform activities in the new age of manufacturing.These technologies enable collecting,storing,and retrieving essential information from the manufacturing stage.Data collected at sites are shared with others where execution automatedly occurs.The obtained information must be validated at manufacturing to avoid undesirable data losses during the de-manufacturing process.However,information sharing from the assembly level at the manufacturing stage to disassembly at the product end-of-life state is a major concern.The current research validates the information optimally to offer a minimum set of activities to complete the disassembly process.An optimal disassembly sequence plan(DSP)can possess valid information to organize the necessary actions in manufacturing.However,finding an optimal DSP is complex because of its combinatorial nature.The genetic algorithm(GA)is a widely preferred artificial intelligence(AI)algorithm to obtain a near-optimal solution for the DSP problem.The converging nature at local optima is a limitation in the traditional GA.This study improvised the GA workability by integrating with the proposed priori crossover operator.An optimality function is defined to reduce disassembly effort by considering directional changes as parameters.The enhanced GA method is tested on a real-time product to evaluate the performance.The obtained results reveal that diversity control depends on the operators employed in the disassembly attributes.The proposed method’s solution can be stored in the cloud and shared through IoT devices for effective resource allocation and disassembly for maximum recovery of the product.The effectiveness of the proposed enhanced GA method is determined by making a comparative assessment with traditional GA and other AI methods at different population sizes.