@CONFERENCE\{IMM1997-0139,
    author       = "A. Larsen and O. B. Madsen",
    title        = "Solving the multiple depot vehicle scheduling problem in a major scandinavian city",
    year         = "1997",
    pages        = "289-306",
    booktitle    = "Proceedings, {NOAS} '97",
    volume       = "",
    series       = "",
    editor       = "Claus C. Car{\o}e and David Pisinger",
    publisher    = "Department of Computer Science, University of Copenhagen",
    organization = "",
    address      = "Universitetsparken {1,} {DK-}2100 K{\o}benhavn {\O}",
    url          = "http://www2.compute.dtu.dk/pubdb/pubs/139-full.html",
    abstract     = "The Vehicle Scheduling Problem (VSP) deals with the assignment of vehicles to a set of transportation jobs. This problem arises within urban mass transit companies in order to construct a set of minimum cost daily schedules for the vehicles.

This paper deals with the {NP-}hard Multiple Depot Vehicle Scheduling Problem (MDVSP). The {MDVSP} is formulated as a time-space network model which is solved by Lagrangean relaxation. The Lagrangean multipliers are determined by sub-gradient optimization. The subproblems are solved by a general purpose algorithm for pure network flow problems. The model implemented is tested on two large scale real-life instances from an urban bus transit company situated in a major Scandinavian city.",
    isbn_issn    = "{ISSN} 0107-8283"
}