Assembly sequence planning (ASP) known as a hard combinatorial optimization problem is an important part of assembly process planning. Determining the sequence of assembly arguably is quite challenging in ASP problem. A good assembly sequence can help to reduce the cost and time of the manufacturing process.This paper presents an implementation of binary Gravitational Search Algorithm (BGSA) for solving an assembly sequence planning (ASP) problem. Initially, each agent is represented by a feasible assembly sequence according to a precedence matrix. Next, binary Gravitational Search Algorithm (BGSA) is used for updating the current to new feasible assembly sequence to solving ASP problem. Using a case study of ASP, the results show that the proposed approach based on BGSA is more efficient for solving the ASP problem in compare to other approaches based on simulated annealing (SA), genetic algorithm (GA), and binary particle swarm optimization (BPSO).
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
Tel.: +1 703 830 6300
Fax: +1 703 830 2300 email@example.com
(Corporate matters and books only) IOS Press c/o Accucoms US, Inc.
For North America Sales and Customer Service
West Point Commons
Lansdale PA 19446
Tel.: +1 866 855 8967
Fax: +1 215 660 5042 firstname.lastname@example.org