A novel computative strategic planning projections algorithm (CSPPA) to generate oblique directional interference matrix for different applications in computer-aided design

Prasad, Vandana; Hymavathi, M.; Rao, C.S.P.; Bahubalendruni, MV A.Raju

doi:10.1016/j.compind.2022.103703

Cited by 12 publications

(5 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Specifcally, it describes the collision situation between the component and other components during the movement along the six orthogonal axes (±x, ±y, ±z) of the absolute coordinate system of the product to be disassembled. When the 3D model information of the product to be disassembled is available, the disassembly interference matrix can be automatically generated using automated analysis methods [28,29], which contributes to the full automation of the DLBP solving process. Additionally, compared to PPD, the disassembly interference matrix can refect possible disassembly directions of components, which help reduce the number of disassembly direction changes during the DLBP solving process and further improves disassembly efciency.…”

Section: Priority Relationship Under U-shaped Layoutmentioning

confidence: 99%

A New Pareto Discrete NSGAII Algorithm for Disassembly Line Balance Problem

Xu,

Han,

et al. 2023

International Journal of Intelligent Systems

View full text Add to dashboard Cite

With the increasing variety and quantity of end-of-life (EOL) products, the traditional disassembly process has become inefficient. In response to this phenomenon, this article proposes a random multiproduct U-shaped mixed-flow incomplete disassembly line balancing problem (MUPDLBP). MUPDLBP introduces a mixed disassembly method for multiple products and incomplete disassembly method into the traditional DLBP, while considering the characteristics of U-shaped disassembly lines and the uncertainty of the disassembly process. First, mixed-flow disassembly can improve the efficiency of disassembly lines, reducing factory construction and maintenance costs. Second, by utilizing the characteristics of incomplete disassembly to reduce the number of dismantled components and the flexibility and efficiency of U-shaped disassembly lines in allocating disassembly tasks, further improvement in disassembly efficiency can be achieved. In addition, this paper also addresses the characteristics of EOL products with heavy weight and high rigidity. While retaining the basic settings of MUPDLBP, the stability of the assembly during the disassembly process is considered, and a new problem called MUPDLBP_S, which takes into account the disassembly stability, is further proposed. The corresponding mathematical model is provided. To obtain high-quality disassembly plans, a new and improved algorithm called INSGAII is proposed. The INSGAII algorithm uses the initialization method based on Monte Carlo tree simulation (MCTI) and the Group Global Crowd Degree Comparison (GCDC) operator to replace the initialization method and crowding distance comparison operator in the NSGAII algorithm, effectively improving the coverage of the initial population individuals in the entire solution space and the evenness and spread of the Pareto front. Finally, INSGAII’s effectiveness has been affirmed by tackling both current disassembly line balancing problems and the proposed MUPDLBP and MUPDLBP_S. Importantly, INSGAII outshines six comparison algorithms with a top rank of 1 in the Friedman test, highlighting its superior performance.

show abstract

Section: Priority Relationship Under U-shaped Layoutmentioning

confidence: 99%

A New Pareto Discrete NSGAII Algorithm for Disassembly Line Balance Problem

Xu,

Han,

et al. 2023

International Journal of Intelligent Systems

View full text Add to dashboard Cite

show abstract

“…It has to be noted that the proposed model aims to assess the complexity of a product and does not include aspects that may affect the complexity of assembly operations, such as assembly attributes and their influence on assembly planning (Gulivindala et al, 2020;Raju Bahubalendruni et al, 2015) and geometric feasibility (Kumar et al, 2022;Prasad et al, 2022).…”

Section: Theoretical Background 31 Product Structural Complexity Modelmentioning

confidence: 99%

Effects of product complexity on human learning in assembly and disassembly operations

Verna

Genta

Galetto

2023

JMTM

View full text Add to dashboard Cite

PurposeThe purpose of this paper is to investigate and quantify the impact of product complexity, including architectural complexity, on operator learning, productivity and quality performance in both assembly and disassembly operations. This topic has not been extensively investigated in previous research.Design/methodology/approachAn extensive experimental campaign involving 84 operators was conducted to repeatedly assemble and disassemble six different products of varying complexity to construct productivity and quality learning curves. Data from the experiment were analysed using statistical methods.FindingsThe human learning factor of productivity increases superlinearly with the increasing architectural complexity of products, i.e. from centralised to distributed architectures, both in assembly and disassembly, regardless of the level of overall product complexity. On the other hand, the human learning factor of quality performance decreases superlinearly as the architectural complexity of products increases. The intrinsic characteristics of product architecture are the reasons for this difference in learning factor.Practical implicationsThe results of the study suggest that considering product complexity, particularly architectural complexity, in the design and planning of manufacturing processes can optimise operator learning, productivity and quality performance, and inform decisions about improving manufacturing operations.Originality/valueWhile previous research has focussed on the effects of complexity on process time and defect generation, this study is amongst the first to investigate and quantify the effects of product complexity, including architectural complexity, on operator learning using an extensive experimental campaign.

show abstract

“…When you go to some terrible institutions is different from the traditional puzzle-solving animation game, which only controls a single object to perform the animation game, such as traditional classic puzzle-solving animation games such as warehouse fan, push music, Mario and Tetris, and a simultaneously an animation game that controls two objects to complete the animation game level and combines physics to make collision behaviors with other objects. In the animation game, players use both hands to control two s at the same time and transport the apple back to the bag [26][27][28][29]. Completing the animation game level requires not only good control ability but also excellent hand-eye coordination [30][31][32].…”

Section: Animation Gamementioning

confidence: 99%

Automatic Generation of Real-Time Animation Game Learning Levels Based on Artificial Intelligence Assistant

Zhang

2022

Scientific Programming

View full text Add to dashboard Cite

With the development of computer animation games, now many animation games use the automatic generation of animation game levels method to generate animation game content. Using the automatic generation levels of the animation game method can quickly generate many different levels, saving labor costs in manual production. And with the combination of other fields, more accurate results can be obtained. In this paper, the goal is to automatically generate the level of the animation game. This research proposed animation game objects and victory conditions to derive the concept of the clearance path and uses artificial intelligence genetic algorithms to obtain the clearance path that best meets the needs of the developer to recombine new levels. In addition, since the generated levels are regenerated from the clearance path, there are still too many blank areas. In order to make full use of these blank areas, this research provides a level complete system. The system has formulated its placement rules for existing animation game objects. These rules fill in these blank areas and produce a more complete level. The contributions of this search proved that the genetic algorithm can converge quickly due to the correction effect in the mutation. In the complete system, it has successfully achieved a complete and playable level. In the system running time, this research adjusted the method of selecting elites and the use of permutations and combinations to mate, so that the system’s operation can be stabilized on an average value.

show abstract

A novel computative strategic planning projections algorithm (CSPPA) to generate oblique directional interference matrix for different applications in computer-aided design

Cited by 12 publications

References 28 publications

A New Pareto Discrete NSGAII Algorithm for Disassembly Line Balance Problem

A New Pareto Discrete NSGAII Algorithm for Disassembly Line Balance Problem

Effects of product complexity on human learning in assembly and disassembly operations

Automatic Generation of Real-Time Animation Game Learning Levels Based on Artificial Intelligence Assistant

Contact Info

Product

Resources

About