@TECHREPORT\{IMM2004-03395,
    author       = "K. B. Bergvinsdottir and J. Larsen and R. M. J{\o}rgensen",
    title        = "Solving the Dial-a-Ride Problem using Genetic algorithms",
    year         = "2004",
    number       = "",
    series       = "IMM-Technical report-2004-20",
    institution  = "Informatics and Mathematical Modelling, Technical University of Denmark, {DTU}",
    address      = "Richard Petersens Plads, Building 321, {DK-}2800 Kgs. Lyngby",
    type         = "",
    url          = "http://www2.compute.dtu.dk/pubdb/pubs/3395-full.html",
    abstract     = "In the Dial-a-Ride problem (DARP) customers send transportation requests to an operator. A request consists of a specified pickup location and destination location along with a desired departure or arrival time and demand. The aim of {DARP} is to minimize transportation cost while satisfying customer service level constraints (Quality of Service).

In this paper we present a genetic algorithm for solving the {DARP}. The algorithm is based on the classical cluster-first route-second approach, where it alternates between assigning customers to vehicles using a genetic algorithm and solving independent routing problems for the vehicles using a routing heuristic. The algorithm is implemented in Java and tested on publicly available data sets."
}