Accelerated dynamic programming algorithms for a car resequencing problem in automotive paint shops
- Authors
- Hong, S.; Han, J.; Choi, J.Y.; Lee, K.
- Issue Date
- Dec-2018
- Publisher
- Elsevier Inc.
- Keywords
- Car resequencing problem; Automotive paint shops; Dynamic programming; Heuristic algorithm
- Citation
- Applied Mathematical Modelling, v.64, pp.285 - 297
- Journal Title
- Applied Mathematical Modelling
- Volume
- 64
- Start Page
- 285
- End Page
- 297
- URI
- http://scholarworks.bwise.kr/ssu/handle/2018.sw.ssu/30996
- DOI
- 10.1016/j.apm.2018.07.035
- ISSN
- 0307-904X
- Abstract
- In this paper, a car resequencing problem (CRP) for automotive paint shops is considered, whereby a set of cars conveyed from an upstream shop to one of the multiple conveyors is retrieved sequentially before the painting operation. The aim of the CRP is to find a car retrieval sequence that minimizes the sequence-dependent changeover cost, which is the cost that is incurred when two consecutive cars do not share the same color. For this problem, we propose accelerated dynamic programming (ADP) algorithms that utilize strong combinatorial lower bounds and effective upper bounds in a standard dynamic programming framework, thus outperforming existing exact algorithms. Testing of our algorithms over a wide range of instances confirmed that they are more efficient than the existing approaches and are also more applicable in practice. © 2018 Elsevier Inc.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Engineering > ETC > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/ssu/handle/2018.sw.ssu/30996)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.