Abstract
To serve elderly and disabled people, developing Demand Responsive Transit Service (DRTS) with flexible routes and changeable schedules is an important work. The dial-a-ride systems are the one of practical applications of the DRTS. Although many literatures develop an algorithm to improve the computing time to obtain acceptable solution under the minimum operational cost, the influence of the time window and the traffic condition for DARP is seldom to discuss. The aim of this paper is to explore the influence of the time window and the traffic condition and apply branch-and-price approach to design vehicle routes and schedule. The proposed algorithm is tested by a sub-network of Kaohsiung City, Taiwan. In the numerical experiments, several scenarios with the different time window are conducted and evaluate experimental results by objective value, computational time, average pickup delay time and average delivery delay time.
