Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

An assembly sequence optimization oriented small world networks genetic algorithm and case study

An assembly sequence optimization oriented small world networks genetic algorithm and case study The assembly sequence in the product assembly process has effect on the final product quality. To solve the assembly sequence optimization problem, such as rotor blade assembly sequence optimization, this paper proposes a small world networks-based genetic algorithm (SWN_GA) to solve the assembly sequence optimization problem. The proposed approach SWN_GA consists of a combination between the standard Genetic Algorithm and the NW Small World Networks.Design/methodology/approachThe selection operation and the crossover operation are improved in this paper. The selection operation remains the elite individuals that have greater fitness than average fitness and reselects the individuals that have smaller fitness than average fitness. The crossover operation combines the NW Small World Networks to select the crossover individuals and calculate the crossover probability.FindingsIn this paper, SWN_GA is used to optimize the assembly sequence of steam turbine rotor blades, and the SWN_GA was compared with standard GA and PSO algorithm in a simulation experiment. The simulation results show that SWN_GA cannot only find a better assembly sequence which have lower rotor imbalance, but also has a faster convergence rate.Originality/valueFinally, an experiment about the assembly of a steam turbine rotor is conducted, and SWN_GA is applied to optimize the blades assembly sequence. The feasibility and effectiveness of SWN_GA are verified through the experimental result. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Assembly Automation Emerald Publishing

An assembly sequence optimization oriented small world networks genetic algorithm and case study

Zhao, Liping; Li, Bohao; Chen, Hongren; Yao, Yiyong
Assembly Automation , Volume 38 (4): 11 – Oct 26, 2018
Download PDF
11 pages

Loading next page...
 
/lp/emerald-publishing/an-assembly-sequence-optimization-oriented-small-world-networks-LhVcYKCFzT
Publisher
Emerald Publishing
Copyright
© Emerald Publishing Limited
ISSN
0144-5154
DOI
10.1108/aa-04-2017-049
Publisher site
See Article on Publisher Site

Abstract

The assembly sequence in the product assembly process has effect on the final product quality. To solve the assembly sequence optimization problem, such as rotor blade assembly sequence optimization, this paper proposes a small world networks-based genetic algorithm (SWN_GA) to solve the assembly sequence optimization problem. The proposed approach SWN_GA consists of a combination between the standard Genetic Algorithm and the NW Small World Networks.Design/methodology/approachThe selection operation and the crossover operation are improved in this paper. The selection operation remains the elite individuals that have greater fitness than average fitness and reselects the individuals that have smaller fitness than average fitness. The crossover operation combines the NW Small World Networks to select the crossover individuals and calculate the crossover probability.FindingsIn this paper, SWN_GA is used to optimize the assembly sequence of steam turbine rotor blades, and the SWN_GA was compared with standard GA and PSO algorithm in a simulation experiment. The simulation results show that SWN_GA cannot only find a better assembly sequence which have lower rotor imbalance, but also has a faster convergence rate.Originality/valueFinally, an experiment about the assembly of a steam turbine rotor is conducted, and SWN_GA is applied to optimize the blades assembly sequence. The feasibility and effectiveness of SWN_GA are verified through the experimental result.

Journal

Assembly Automation – Emerald Publishing

Published: Oct 26, 2018

Keywords: Assembly sequence optimization; Small world networks genetic algorithm (SWN_GA); Turbine blades assembly

References

  • Blades installment arrangement research based on the partial exhaustion iteration algorithm
    Ba, T.; Guo, G.X.
  • Improved genetic algorithm optimization of water distribution system design by incorporating domain knowledge
    Bi, W.; Dandy, G.C.; Maier, H.R.
  • Development genetic algorithm theory and its applications
    Bian, X.; Mi, L.
  • An improved genetic algorithm for searching for pollution sources
    Bu, Q.; Wang, Z.J.; Tong, X.
  • Using genetic algorithms to create solutions for conflict resolution
    Carneiro, D.; Novais, P.; Neves, J.
  • Planning the location and rating of distributed energy storage in LV networks using a genetic algorithm with simulated annealing
    Crossland, A.F.; Jones, D.; Wade, N.S.
  • Development and application of blades installation arrangement order optimizing system based on genetic algorithm
    Dai, Y.P.; Jiang, C.J.; Lu, S.M.
  • Energy-efficient scheduling for a flexible flow shop using an improved genetic-simulated annealing algorithm
    Dai, M.; Tang, D.; Giret, A.; Salido, M.A.; Li, W.D.
  • Summary of genetic algorithms research
    Ge, J.K.; Qiu, Y.H.; Wu, C.M.; Pu, G.L.
  • Reducing turbojet engine vibration by optimizing blade arrangement order on rotor
    Gao, Y.L.; Luo, Y.
  • Optimization of operating conditions for steam turbine using an artificial neural network inverse
    Hamzaoui, Y.E.; Rodríguez, J.A.; Hernandez, J.A.; Salazar, V.
  • An auto-tuning PID control system based on genetic algorithms to provide delay guarantees in passive optical networks
    Jiménez, T.; Merayo, N.; Andrés, A.Q.; Durán, R.J.; Aguado, J.C.; Miguel, I.; Fernández, P.; Lorenzo, R.M.; Abril, E.J.
  • Hybrid single objective genetic algorithm coupled with the simulated annealing optimization method for building optimization
    Junghans, L.; Darde, N.
  • Survey of genetic algorithms for solving multi depot vehicle routing problem
    Karakatiˇc, S.; Podgorelec, V.A.
  • A new hybrid island model genetic algorithm for job shop scheduling problem
    Kurdi, M.
  • Research of optimizing arrangement for turbine blade installation based on ant colony algorithm
    Li, D.D.; Chen, Y.; Yu, D.R.
  • 3D resistivity inversion using an improved genetic algorithm based on control method of mutation direction
    Liu, B.; Li, S.C.; Nie, L.C.; Wang, J.; Zhang, Q.S.
  • Research progress of genetic algorithm
    Ma, Y.J.; Yun, W.X.
  • Steam turbine rotor discs failure evaluation and repair process implement
    Mazur, Z.; Rossette, A.H.
  • An improved genetic algorithm with co-evolutionary strategy for global path planning of multiple mobile robots
    Qu, H.; Xing, K.; Alexander, T.
  • Structural design of modern steam turbine blades using ADINA
    Richter, C.H.
  • Shrink connection modelling of the steam turbine rotor
    Rusin, A.; Nowak, G.; Piecha, W.
  • An experimental and FEM modal analysis of cracked and normal steam turbine blade
    Shukla, A.; Harsha, S.P.
  • Parallel elite genetic algorithm and its application to global path planning for autonomous robot navigation
    Tsai, C.C.; Huang, H.C.; Chan, C.K.
  • Fault diagnosis of rolling bearings using a genetic algorithm optimized neural network
    Unal, M.; Onat, M.; Demetgul, M.; Kucuk, H.
  • Optimum arrangement of rotor blades based on genetic algorithms
    Yang, X.; Xing, J.H.
  • An improved genetic algorithm for optimal feature subset selection from multi-character feature set
    Yang, W.Z.; Li, D. l.; Zhu, L.
  • Solving job shop scheduling problem using a hybrid parallel micro genetic algorithm
    Yusof, R.; Khalid, M.; Hui, G.T.; Yusof, S.M.; Othman, M.F.; Jones, D.; Wade, N.S.
  • A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times
    Zhang, Q.; Manier, H.; Manier, M.A.