A study on the application of genetic algorithms on the Dial-A-Ride problem
Part of : WSEAS transactions on business and economics ; Vol.5, No.4, 2008, pages 134-139
Issue:
Pages:
134-139
Author:
Abstract:
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 Competition Genetic Algorithm (FCGA) on the DARP. This study proposed two solution procedures, which were integrated approach and cluster approach. A series of case studies with different characteristics, such as demand density and demand size, were used to test the solution capability of the proposed algorithms. Based on the results of the case studies, the Diversity Control Adaptive Genetic Algorithm is identified as the best algorithm in solution quality. Overall, the solution of the integrated procedure is better than, those of the two-phase procedure.
Subject:
Subject (LC):
Keywords:
dial-and-ride problem, genetic algorithms, meta-heuristic
Notes:
Περιέχει πίνακες και βιβλιογραφία
