Optimization of physical flows in an automotive manufacturing plant: some experiments and issues

被引:25
作者
Muhl, E [1 ]
Charpentier, P [1 ]
Chaxel, F [1 ]
机构
[1] Univ Nancy, CNRS, UMR 7039, CRAN,Res Ctr Automat Control, F-54506 Vandoeuvre Les Nancy, France
关键词
car sequencing problem; simulation; simulated annealing; genetic algorithm; gradient descent;
D O I
10.1016/S0952-1976(03)00081-2
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this article, the flow of vehicles within an automotive final assembly plant is studied. Vehicles successively pass through three different shops (body, painting and assembly). Each of these shops has specific constraints and perturbations that locally modify the pre-defined sequence of vehicles. Up to now, vehicle flow inside each shop has been organized using a local sequencing algorithm (ARI, Algorithme de Re-sequencement Intermediaire). To improve the quality of the overall flow in the entire final assembly plant, this paper proposes coordinating these local algorithms. This is done by having each ARI construct its vehicle sequence using not only its own constraints, but also the constraints of other shops situated downstream. To achieve this coordination, ARI parameterization is optimized using meta-heuristics. (C) 2003 Published by Elsevier Ltd.
引用
收藏
页码:293 / 305
页数:13
相关论文
共 17 条
[1]  
ANDERSON D, 2003, BUILD ORDER MASS CUS
[2]  
BARACZKA K, 1998, ACTA NEUROL SCAND, V98, P1
[3]  
COMBY G, 1995, 3 WORKSH INT MAN SYS, P179
[4]  
DELAVAL M, 1995, 28 INT S AUT TECHN A, P169
[5]  
FLIPO C, 1997, IND ENG PROD MAN C L, V2, P396
[6]  
GALINIER P, 2000, 2 INT WORKSH INT AI, P57
[7]  
GOLDBERG D, 1989, GENTIC ALGORITHMS SE
[8]   Artificial intelligence and soft computing for planning and scheduling: how to efficiently solve more realistic problems ... - Preface [J].
Grabot, B .
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2001, 14 (03) :265-267
[9]  
GUERRECHALEY F, 1995, IEEE INRIA C EM TECH, V2, P385
[10]  
GUNAL A, 1998, HDB SIMULATION PRINC, pCH15