کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
481275 | 1446162 | 2008 | 9 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: Local search and suffix tree for car-sequencing problem with colors Local search and suffix tree for car-sequencing problem with colors](/preview/png/481275.png)
This paper describes an approximation solution method for the car sequencing problem with colors. Firstly, we study the optimality of problems with a single ratio constraint. This study also introduces a data structure for efficient calculation of the penalties related to ratio constraints. We describe the constructive greedy algorithm and variable neighborhood search adjusted for the problem with colors. Tabu metaheuristic is used to improve the results obtained by VNS. We then represent the cars with their constraints as letters over an alphabet and apply the algorithm to spell the motifs in order to improve the number of batch colors without decreasing the costs associated to the set of ratio constraints. The algorithm achieves 19 out of the 64 best results for instance sets A and B. These instances are the reference instances for Challenge ROADEF.
Journal: European Journal of Operational Research - Volume 191, Issue 3, 16 December 2008, Pages 972–980