A Beam Search approach for the optimization version of the Car Sequencing Problem
- 122 Downloads
The Car Sequencing Problem (CSP) is a feasibility problem that has attracted the attention of the Constraint Programming community for a number of years now. In this paper, a new version (opt-CSP) that extends the original problem is defined, converting this into an optimization problem in which the goal is to satisfy the typical hard constraints. This paper presents a solution procedure for opt-CSP using Beam Search. Computational results are presented using public instances that verify the goodness of the procedure and demonstrate its excellent performance in obtaining feasible solutions for the majority of instances while satisfying the new constraints.
KeywordsCar sequencing problem Beam search Scheduling
Unable to display preview. Download preview PDF.
- Butaru, M., & Habbas, Z. (2005). Solving the Car Sequencing Problem as a non-binary CSP. In P. van Beek (Ed.), Lecture notes in computer science : Vol. 3709. Principles and practice of constraint programming: CP2005 (p. 840). 11th international conference, Sitges, Spain, October 1–5 2005. Berlin: Springer. CrossRefGoogle Scholar
- Dincbas, M., Simonis, H., & van Hentenryck, P. (1988). Solving the car sequencing problem in constraint logic programming. In Proceedings of the 8th European conference on artificial intelligence, ECAI-88, Munich (pp. 290–295). London: Pitman. Google Scholar
- Gent, I. (1998). Two results on car-sequencing problems. Technical report APES-02-1998. Google Scholar
- Gottlieb, J., Puchta, M., & Solnon, C. (2003). A study of greedy, local search and ant colony optimization approaches for car sequencing problems. In S. Cagnori et al. (Eds.), Lecture notes in computer science : Vol. 2611. Applications of evolutionary computing (pp. 246–257). Berlin: Springer. CrossRefGoogle Scholar
- López, P., & Roubellat, F. (2001). Ordonnancement de la production. Paris: Hermès Science. Google Scholar
- Lowerre, B. T. (1976). The HARPY speech recognition system. Ph.D. thesis, Carnegie Mellon University, Pittsburgh. Google Scholar
- Monden, Y. (1983). Toyota production system. Norcross: Institute of Industrial Engineers Press. Google Scholar
- Morton, T. E., & Pentico, D. W. (1993). Heuristic scheduling systems. New York: Wiley. Google Scholar
- Tsang, E. (1993). Foundations of constraint satisfaction. San Diego: Academic Press. Google Scholar
- Zufferey, N., Studer, M., & Silver, E. A. (2006). Tabu search for a car sequencing problem. In Proceedings of the 19 international Florida artificial intelligent research society conference, FALIRS 2006 (pp. 457–462). Google Scholar