Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2015, Article ID 932502, 10 pages
Research Article

Small-World Optimization Algorithm and Its Application in a Sequencing Problem of Painted Body Storage in a Car Company

1State Key Laboratory of Digital Manufacturing Equipment & Technology, Huazhong University of Science & Technology, Wuhan 430074, China
2Nanjing University of Science and Technology, Nanjing, Jiangsu 210000, China

Received 6 June 2014; Accepted 13 October 2014

Academic Editor: Kang Li

Copyright © 2015 Tian Zhipeng et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


In the car company, the painted body storage (PBS) is set up between the paint shop and the assembly shop. It stores the vehicles in production and reorders the vehicles sequence. To improve production efficiency of assembly shop, a mathematical model is developed aiming at minimizing the consumption rate of options and the total overtime and idle time. As the PBS sequencing process contains upstream sequence inbound and downstream sequence outbound, this paper proposes an algorithm with two phases. In the first phase, the discrete small-world optimization algorithm (DSWOA) is applied to schedule the inbound sequence by employing the short-range nodes and the long-range nodes in order to realize the global searching. In the second phase, the heuristic algorithm is applied to schedule the outbound sequencing. The proposed model and algorithm are applied in an automobile enterprise. The results indicate that the two-phase algorithm is suitable for the PBS sequencing problem and the DSWOA has a better searching performance than GA in this problem. The sensitivity of model parameters is analyzed as well.