The Dial-a-Ride Problem (DARP) is a vehicle routing problem faced in arranging Dial-a-Ride services. The DARP has been proven a NP-Hard problem; therefore, most research has used heuristic solution methods to address this issue. The purpose of this study is to evaluate of the application of a Diversity Control Adaptive Genetic Algorithm (DCAGA) and Family… (More)
In this paper, a five-phase solution procedure based on the Tabu search is proposed to solve the dynamic vehicle routing problem with real time demand information. A series of case studies with different characteristics such as demand density, demand size are used to test the solution capability of the proposed algorithm.