• Home
  • Search
  • Assembly sequence optimization using a flower pollination algorithm-based approach
  • Cite Icon56
  • https://doi.org/10.1007/s10845-016-1261-7Copy DOI Icon

Assembly sequence optimization using a flower pollination algorithm-based approach

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

One of the important decisions in assembly process planning is determination of assembly sequence. Choice of the optimum sequence is made difficult due to various reasons. There are various precedence constraints and optimization criteria. Moreover, a product may be possible to assemble in many alternative ways following different sequences, thus making assembly sequence optimization a multi-modal optimization problem with multiple optimum solutions. It is necessary to generate as many unique optimum solutions as possible in order to allow the process planner to take a decision. Moreover, with increase in part count, the number of feasible sequences rises staggeringly, thereby making assembly sequence optimization laborious and time consuming. Most conventional mathematical algorithms are known to perform poorly when used to obtain multiple optimum solutions. On the other hand, soft computing based evolutionary optimization algorithms are good candidates for multi-modal optimization. Another challenge is to develop an algorithm that can automatically maintain diversity in the optimum solutions found over the generations (i.e. optimum solutions having the same fitness but unique). Keeping the above in mind, in the present paper, an intelligent assembly sequence optimization methodology based on application of flower pollination algorithm (FPA) has been developed to automatically generate multiple unique optimal assembly sequences, subject to various precedence constraints, based on minimisation of number of orientation changes and tool changes. Since in the present paper, FPA has been applied for the first time to a discrete optimization problem like assembly sequence optimization, the main challenge before us in applying FPA was the continuous nature of the original FPA. Therefore, modifications have been made by us in the rules for local and global pollination of FPA to make it suited for solving the given discrete optimization problem. In order to evaluate the performance of FPA, the results have been compared with two other well-known soft computing techniques namely, Genetic Algorithm (GA) and Ant Colony Optimization (ACO) and also with a recently published soft computing based algorithm, Improved Harmony Search (IHS). It was found that the novelty of the proposed FPA lies in its capability to find multiple unique optimum solutions in one single simulation run and capability to automatically maintain diversity in the optimum solutions found over the generations. On the other hand, in case of GA, ACO and IHS, it is not possible to maintain the diversity in multiple optimum solutions as the complete population finally converges to a few unique optimum solutions. Therefore, it can be concluded that FPA performs better in solving the given multi-modal optimization problem of assembly sequence optimization.

Similar Papers
  • Research Article
  • Citations68

An Optimal Robotic Assembly Sequence Planning by Assembly Subsets Detection Method Using Teaching Learning-Based Optimization Algorithm

  • Jul 01, 2018
  • IEEE Transactions on Automation Science and Engineering
  • A Balamurali Gunji +3
  • Research Article
  • Citations52

An advanced immune based strategy to obtain an optimal feasible assembly sequence

  • Apr 04, 2016
  • Assembly Automation
  • M.V.A Raju Bahubalendruni +2
  • Research Article
  • Citations125

Application of flower pollination algorithm in load frequency control of multi-area interconnected power system with nonlinearity

  • May 31, 2016
  • Neural Computing and Applications
  • K Jagatheesan +6
  • Book Chapter
  • Citations4

Hybridized Cuckoo–Bat Algorithm for Optimal Assembly Sequence Planning

  • Dec 14, 2018
  • Balamurali Gunji +4
  • Research Article
  • Citations25

Generating optimized assembly sequence by virtual reality and bionic algorithm

  • Jan 01, 2007
  • Chinese Journal of Mechanical Engineering
  • Pingjun Xia
  • Research Article
  • Citations13

Assembly sequence optimization based on hybrid symbiotic organisms search and ant colony optimization

  • Aug 04, 2020
  • Soft Computing
  • Yong Wang +2
  • PDF
  • Research Article
  • Citations22

Rescheduling of Generators with Pumped Hydro Storage Units to Relieve Congestion Incorporating Flower Pollination Optimization

  • Apr 18, 2019
  • Energies
  • Padmini Sankaramurthy +4
  • Research Article
  • Citations44

A weighted assembly precedence graph for assembly sequence planning

  • Jul 19, 2015
  • The International Journal of Advanced Manufacturing Technology
  • Yong Wang +1
  • Research Article
  • Citations6

Robotic Optimal Assembly Sequence Using Improved Cuckoo Search Algorithm

  • Jan 01, 2018
  • Procedia Computer Science
  • Gunji Bala Murali +4
  • Conference Article
  • Citations22

Review of Flower Pollination Algorithm: Applications and Variants

  • Feb 01, 2020
  • Mehar-Un-Nisa Khursheed +7
  • Research Article
  • Citations19

Review of modified and hybrid flower pollination algorithms for solving optimization problems

  • Oct 14, 2017
  • Artificial Intelligence Review
  • Dhabitah Lazim +3
  • Conference Article
  • Citations3

A Fixture Assembly Sequence Planning Method Based on Ant Colony Algorithm

  • Jan 01, 2015
  • Yan Cao +2
  • Research Article
  • Citations1

An Improved Flower Pollination Algorithm for Global and Local Optimization

  • Dec 31, 2021
  • JOIV International Journal on Informatics Visualization
  • M Iqbal Kamboh +3
  • Research Article
  • Citations4

Modified BAT Algorithm for Optimum Assembly Sequence Planning

  • Jun 01, 2018
  • IOP Conference Series: Materials Science and Engineering
  • G Bala Murali +3
  • Research Article
  • Citations3

An Application of Flower Pollination Algorithm to Solve Combined Economic Emission Dispatch by Considering Valve-Point Loading Effect

  • Aug 31, 2015
  • International Review on Modelling and Simulations (IREMOS)
  • Hong Mee Song +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.