Name
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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/s10479-007-0278-x | Annals OR |
Keywords | Field | DocType |
Car sequencing problem,Beam search,Scheduling | Computational problem,Mathematical optimization,Constraint (mathematics),Computer science,Constraint programming,Beam search,Counting problem,Constraint satisfaction dual problem,Cutting stock problem,Optimization problem | Journal |
Volume | Issue | ISSN |
159 | 1 | 0254-5330 |
Citations | PageRank | References |
7 | 0.54 | 10 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Joaquín Bautista | 1 | 345 | 27.50 |
| Jordi Pereira | 2 | 252 | 19.64 |
| Belarmino Adenso-Díaz | 3 | 143 | 11.44 |