International Standard Serial Number:

ISSN 1001-4551

Sponsor:

Zhejiang University;

Zhejiang Machinery and Electrical Group

Edited by:

Editorial of Journal of Mechanical & Electrical Engineering

Chief Editor:

ZHAO Qun

Vice Chief Editor:

TANG ren-zhong,

LUO Xiang-yang

Tel:

86-571-87041360,87239525

Fax:

86-571-87239571

Add:

No.9 Gaoguannong,Daxue Road,Hangzhou,China

P.C:

310009

E-mail:

meem_contribute@163.com

Tabu particle swarm optimization for sequencing problems in mixed-model assembly lines
Published:2013-07-05 author:WENG Yao-wei, LU Jian-sha, DENG Wei Browse: 3621 Check PDF documents

Tabu particle swarm optimization for sequencing problems in mixed-model assembly lines

WENG Yao-wei, LU Jian-sha, DENG Wei
(College of Mechanical Engineering, Zhejiang University of Technology, Hangzhou 310014, China)

Abstract: In order to solve the sequencing problems in open-station mixed-model assembly lines,a mathematical model was established that considered two objectives:to minimize the utility time and keep average consumption rate of parts,and the tabu particle swarm optimization was proposed to solve the problem. Aiming at standard particle swarm optimization with an insufficient accuracy in late search and easy to fall into the local optimum,the tabu search algorithm was brought to establish the optimal particle research mechanism as well as improve the capacity to jump out from a local optimum point. A random weight updates was brought in to balance the global and local search ability. An example was given to test the algorithm. The results indicate that the algorithm can solve sequencing problems in mixed-model assembly lines successfully with an effective outcome.
Key words: particle swarm optimization(PSO);mixed-model assembly line; tabu search; sequencing
 

  • Chinese Core Periodicals
  • Chinese Sci-tech Core Periodicals
  • SA, INSPEC Indexed
  • CSA: T Indexed
  • UPD:Indexed


2010 Zhejiang Information Institute of Mechinery Industry

Technical Support:Hangzhou Bory science and technology

You are 1895221 visit this site