A multi-agent Evolutionary algorithm for connector-based assembly sequence planning

7Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

Abstract

Some Evolutionary algorithms for connector-based ASP have been researched. But those algorithms have lots of blind searching because individuals have little intelligence in making use of geometry and assembly process information of product assembly body. To improve individuals' intelligence, A multi-agent evolutionary algorithm for connector-based ASP (MAEA-ASP) is presented which is integrated with the multi - agent systems. learning, competition and crossover-mutation are designed as the behaviors of agent which locate lattice-like structure environment. Experimental results show that MAEA-ASP can find an approximate solution faster compared with other evolutionary algorithms. © 2011 Published by Elsevier Ltd.

Cite

CITATION STYLE

APA

Zeng, C., Gu, T., Zhong, Y., & Cai, G. (2011). A multi-agent Evolutionary algorithm for connector-based assembly sequence planning. In Procedia Engineering (Vol. 15, pp. 3689–3693). https://doi.org/10.1016/j.proeng.2011.08.691

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free