[KSCI] Korea Science Citation Index Service

http://dx.doi.org/10.9708/jksci.2015.20.9.105

Maximum Options-Equiped Class First-Production Algorithm for Car Sequencing Problem

Lee, Sang-Un (Dept. of Multimedia Engineering, Gangneung-Wonju National University)

Publication Information

Journal of the Korea Society of Computer and Information / v.20, no.9, 2015 , pp. 105-111 More about this Journal

Abstract

This paper suggests O(n) linear-time algorithm for car sequencing problem (CSP) that has been classified as NP-complete because of the polynomial-time algorithm to solve the solution has been unknown yet. This algorithm applies maximum options-equiped car type first production rule to decide the car sequencing of n meet the r:s constraint. This paper verifies thirteen experimental data with the six data are infeasible. For thirteen experimental data, the proposed algorithm can be get the solution for in all cases. And to conclude, This algorithm shows that the CSP is not NP-complete but the P-problem. Also, this algorithm proposes the solving method to the known infeasible cases. Therefore, the proposed algorithm will stand car industrial area in good stead when it comes to finding a car sequencing plan.

Keywords

Car sequencing; r:s; Car type; Constraints; Assignment;

Citations & Related Records

Reference

1	H. Simonis, "ECLiPSE ELearning Website, Chapter 16: More Global Constraints (Car Sequencing)," http://4c.ucc.ie/-hsimonis/ELearning/, Cork Constraint Computation Centre, Computer Science Department, University College Cork, Ireland, 2006.
2	B. Smith, "CSPLib: A Problem Library for Constraints Car Sequencing, prob001: Car Sequencing," http://ianm.host.cs.st-andrews.ac.uk/CSPLib/prob/prob001/, 2014.
3	I. P. Gent, "Two Results on Car-Sequencing Problems," Technical report APES-02-1998, (http://www.apes.cs.strath.ac.uk/apesreports.html), pp. 1-7, Apr. 1998.
4	T. Kis, "On the Complexity of the Car Sequencing Problem," Operations Research Letters, Vol. 32, No. 4, pp. 331-335, Jul. 2004. DOI ScienceOn
5	B. Estellon and F. Gardi, "Car Sequencing is NP-hard: a Short Proof," Journal of the Operational Research Society, Vol. 64, No. 10, pp. 1503-1504, Oct. 2013. DOI
6	C. Solnon, V. D. Cung, A. Nguyen, and C. Artigues," The Car Sequencing Problem: Overview of State-of-the-art Methods and Industrial Case-Study of the ROADEF'2005 Challenge Problem," European Journal of Operational Research, Vol. 191, No. 3, pp. 912-927, Dec. 2008. DOI ScienceOn
7	M. Fliedner and N. Boysen, "Solving the Car Sequencing Problem via Branch & Bound," European Journal of Operational Research, Vol. 191, No. 3, pp. 1023-1042, Dec. 2008. DOI ScienceOn
8	C. Gagne, M. Gravel, and W. L. Price," Solving Real Car Sequencing Problems with Ant Colony Optimization," European Journal of Operational Research, Vol. 174, No. 3, pp. 1427-1448, Nov. 2006. DOI ScienceOn
9	N. Zufferey, M. Studer, and E. A. Silver, "Tabu Search for a Car Sequencing Problem," Proceedings of the 19th International Florida Artificial Intelligence Research Society, pp. 457-462, 2006.
10	J. F, Cordeau, G. Laporte, and F. Pasin, "Iterated Tabu Search for the Car Sequencing Problem," European Journal of Operational Research, Vol. 191, No. 3, pp. 945-956, Dec. 2008. DOI ScienceOn
11	D. Thiruvady, A. Ernst, and M. Wallace, "A Lagrangian-ACO Metaheuristic for Car Sequencing," EURO Journal on Computational Optimization, Vol. 2, No. 4, pp. 279-296, Nov. 2014. DOI