@article {IOPORT.00778498,
    author       = {Pandit, Ram and Muralidharan, B.},
    title        = {A capacitated general routing problem on mixed networks.},
    year         = {1995},
    journal      = {Computers \& Operations Research},
    volume       = {22},
    number       = {5},
    issn         = {0305-0548},
    pages        = {465-478},
    publisher    = {Elsevier Science Ltd. (Pergamon), Oxford},
    doi          = {10.1016/0305-0548(94)00035-7},
    abstract     = {Summary: This study addresses the problem of routing vehicles over the specified segments of a mixed network. The routing problem is modeled as a Capacitated General Routing Problem (CGRP). The solution to the problem is a set of routes for the vehicles which are consistent with the capacity and work-hours constraints. For the CGRP, we present a heuristic procedure to solve for large size problems. Both route-first-partition- next (RFPN) and partition-first-and-route-next (PFRN) approaches are discussed. Computational results of the developed procedure are also presented.},
    identifier   = {00778498},
}