Back to Search
Start Over
Crossover Operators for the Car Sequencing Problem.
- Source :
- Evolutionary Computation in Combinatorial Optimization (9783540716143); 2007, p229-239, 11p
- Publication Year :
- 2007
-
Abstract
- The car sequencing problem involves scheduling cars along an assembly line while satisfying as many assembly line requirements as possible. The car sequencing problem is NP-hard and is applied in industry as shown by the 2005 ROADEF Challenge. In this paper, we introduce three new crossover operators for solving this problem efficiently using a genetic algorithm. A computational experiment compares these three operators on standard car sequencing benchmark problems. The best operator is then compared with state of the art approach for this problem. The results show that the proposed operator consistently produces competitive solutions for most instances. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISBNs :
- 9783540716143
- Database :
- Supplemental Index
- Journal :
- Evolutionary Computation in Combinatorial Optimization (9783540716143)
- Publication Type :
- Book
- Accession number :
- 32943227
- Full Text :
- https://doi.org/10.1007/978-3-540-71615-0_21