@article {IOPORT.05564082,
    author       = {Hashimoto, Hideki and Ezaki, Youichi and Yagiura, Mutsunori and Nonobe, Koji and Ibaraki, Toshihide and L\o kketangen, Arne},
    title        = {A set covering approach for the pickup and delivery problem with general constraints on each route.},
    year         = {2009},
    journal      = {Pacific Journal of Optimization},
    volume       = {5},
    number       = {2},
    issn         = {1348-9151},
    pages        = {185-202},
    publisher    = {Yokohama Publishers, Yokohama},
    abstract     = {Summary: We generalize the pickup and delivery problem with time windows by allowing general constraints on each route, and propose a heuristic algorithm. Our algorithm first generates a set of feasible routes, and repeats modifying the set by using the information from a Lagrangian relaxation of the set covering problem that corresponds to the current set. It then solves the resulting set covering problem to construct a good feasible solution for the original problem. We conduct computational experiments for instances with various constraints, and confirm the flexibility of our algorithm.},
    identifier   = {05564082},
}