Currently displaying 1 – 2 of 2

Showing per page

Order by Relevance | Title | Year of publication

Large neighborhood improvements for solving car sequencing problems

Bertrand EstellonFrédéric GardiKarim Nouioua — 2006

RAIRO - Operations Research - Recherche Opérationnelle

The 𝒩 P -hard problem of car sequencing has received a lot of attention these last years. Whereas a direct approach based on integer programming or constraint programming is generally fruitless when the number of vehicles to sequence exceeds the hundred, several heuristics have shown their efficiency. In this paper, very large-scale neighborhood improvement techniques based on integer programming and linear assignment are presented for solving car sequencing problems. The effectiveness of this approach...

Large neighborhood improvements for solving car sequencing problems

Bertrand EstellonFrédéric GardiKarim Nouioua — 2007

RAIRO - Operations Research

The -hard problem of car sequencing has received a lot of attention these last years. Whereas a direct approach based on integer programming or constraint programming is generally fruitless when the number of vehicles to sequence exceeds the hundred, several heuristics have shown their efficiency. In this paper, very large-scale neighborhood improvement techniques based on integer programming and linear assignment are presented for solving car sequencing problems. The effectiveness of this approach...

Page 1

Download Results (CSV)