Car sequencing with constraint-based ACO

Hybrid methods for solving combinatorial optimization problems have become increasingly popular recently. The present paper is concerned with hybrids of ant colony optimization and constraint programming which are typically useful for problems with hard constraints. However, the original algorithm suffered from large CPU time requirements. It was shown that this integration can be made efficient via a further hybridization with beam search resulting in CP-Beam-ACO. The original work suggested this in the context of job scheduling. We show here that this algorithm type is also effective on another problem class, namely car sequencing. We consider an optimization version, where we aim to optimize the utilization rates across the sequence. Car sequencing is a notoriously difficult problem, because it is difficult to obtain good bounds via relaxations. We show that stochastic sampling provides superior results to well known lower bounds for this problem when combined with CP-Beam-ACO. Copyright 2011 ACM.