A Study on the application of genetic algorithms on the Dial-A-Ride Problem

機構典藏 > College of Business and Management > Graduate Institute & Department of Transportation Management > Journal Article > Item 987654321/80170

Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/80170

Title:	A Study on the application of genetic algorithms on the Dial-A-Ride Problem
Authors:	Chiu, Hsien-Ming;Huang, Han-Shuan
Contributors:	淡江大學運輸管理學系
Keywords:	Dial-and-Ride Problem;Genetic Algorithms;Meta-heuristic
Date:	2008-04
Issue Date:	2013-01-18 22:10:55 (UTC+8)
Publisher:	Stevens Point, Wisconsin: The WSEAS (The World Scientific and Engineering Academy and Society)
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.
Relation:	WSEAS Transactions on Business and Economics 5(4), pp.128-133
Appears in Collections:	[Graduate Institute & Department of Transportation Management] Journal Article

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	344	View/Open
wseas2008chiu[1].pdf	論文	385Kb	Adobe PDF	339	View/Open