A VARIABLE NEIGHBOURHOOD SEARCH ALGORITHM FOR THE INTEGRATED DIAL-A- RIDE PROBLEM

This paper investigates an integrated dial-a-ride problem combining on-demand vehicles and existing mass transit services to minimize both bus operation costs and customer inconvenience. A tailored variable neighbourhood search algorithm is developed to address the routing complexities involving both modes. A case study using real microtransit data compares the performance of the proposed service against the microtransit service, public transport and private car. Results indicate that the integrated service reduces vehicle kilometres travelled by 36% compared to microtransit service. It also significantly reduces customer travel time over public transport, while customers traveling by private car remains only 19% faster.