A Beam Search approach for the optimization version of the Car Sequencing Problem |
| |
| Authors: | Joaquín Bautista Jordi Pereira Belarmino Adenso-Díaz |
| |
| Affiliation: | (1) Nissan Chair-UPC, Escuela Técnica Superior de Ingeniería Industrial de Barcelona, Universidad Politécnica de Catalunya, Avda. Diagonal 647, Planta 7, 08028 Barcelona, Spain;(2) Departamento de Organización de Empresas, Escuela Técnica Superior de Ingeniería Industrial de Barcelona, Universidad Politécnica de Catalunya, Avda. Diagonal 647, Planta 7, 08028 Barcelona, Spain;(3) Escuela Politécnica Superior de Ingeniería de Gijón, Campus de Viesques, Universidad de Oviedo, 33204 Gijón, Spain |
| |
| Abstract: | 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. |
| |
| Keywords: | Car sequencing problem Beam search Scheduling |
| 本文献已被 SpringerLink 等数据库收录！ |
|
