کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1135446 | 956100 | 2008 | 16 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Heuristics for an industrial car sequencing problem considering paint and assembly shop objectives
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
سایر رشته های مهندسی
مهندسی صنعتی و تولید
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
The aim of this paper is to study the problem of sequencing a set of vehicles within an industrial environment considering the assembly shop objectives, but also the objectives of the paint shop. The first approach is to solve the problem with a mono-objective function. One heuristic (a progressive, construction-sequence algorithm) and three meta-heuristics (simulated annealing, variable neighbourhood search and an evolutionary algorithm) are described and compared. As the mono-objective approach has limited possibilities, a multi-objective heuristic is finally presented and tested. Because of the industrial context of this research, the computation time is a decisive factor to select the appropriate heuristic.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Industrial Engineering - Volume 55, Issue 2, September 2008, Pages 295–310
Journal: Computers & Industrial Engineering - Volume 55, Issue 2, September 2008, Pages 295–310
نویسندگان
Alexandre Joly, Yannick Frein,