A Lagrangian-based heuristic for large-scale set covering problems

A Lagrangian-based heuristic for large-scale set covering problems

0.00 Avg rating0 Votes
Article ID: iaor19992610
Country: Netherlands
Volume: 81
Issue: 2
Start Page Number: 215
End Page Number: 228
Publication Date: Apr 1998
Journal: Mathematical Programming
Authors: , ,
Keywords: transportation: rail
Abstract:

We present a new Lagrangian-based heuristic for solving large-scale set-covering problems arising from crew-scheduling at the Italian Railways (Ferrovie dello Stato). Our heuristic obtained impressive results when compared to state-of-the-art codes on a test-bed provided by the company, which includes instances with sizes ranging from 50,000 variables and 500 constraints to 1,000,000 variables and 5000 constraints.

Reviews

Required fields are marked *. Your email address will not be published.