Browse > Article
http://dx.doi.org/10.12815/kits.2012.11.5.070

A Study for Solving Multi-Depot Dial-a-Ride Problem Considering Soft Time Window  

Kim, Taehyeong (한국건설기술연구원 첨단교통연구실)
Park, Bum-Jin (한국건설기술연구원 첨단교통연구실)
Kang, Weon-Eui (한국건설기술연구원 첨단교통연구실)
Publication Information
The Journal of The Korea Institute of Intelligent Transport Systems / v.11, no.5, 2012 , pp. 70-77 More about this Journal
Abstract
Dial-a-ride is the most widely available transit service for disabled persons or seniors in the United States and Europe. This paper studies a static dial-a-ride problem considering multiple depots, heterogeneous vehicles, and soft time windows. In this paper, we apply a heuristic based on clustering first-routing second(HCR) to a real-world large dial-a-ride problem from Maryland Transit Administration(MTA). MTA's real operation is compared with the results of developed heuristic for 24 cases. The objective function of the proposed model is to minimize the total cost composed of the service provider's cost and the customers' inconvenience cost. For the comparison, the objective function values of HCR do not include waiting cost, delay cost, and excess ride cost. The objective function values from HCR are better than those from MTA's operation for all cases. This result shows that our heuristic method can make the real operation better and more efficient.
Keywords
Dial-a-ride; integer programming; heuristic; optimization; multi-depot; soft time window;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 J. Baugh, G. Kakivaya, and J. R. Stone, "Intractability of the dial-a-ride problem and a multiobjective solution using simulated annealing", Engineering Optimization, vol.30, pp.91-123, 1998.   DOI   ScienceOn
2 J. Jaw, A. R. Odoni, H. N. Psaraftis, and Wilson, N.H.M.(1986), "A heuristic algorithm for the multivehicle advance request dial-a-ride problem with time windows", Transportation Research Part B, vol. 20, no. 3, pp.243-257, 1986.   DOI   ScienceOn
3 I. Ioachim, J. Desrosiers, Y. Dumas, and Solomon, M. M. "A request clustering algorithm for door-to-door handicapped transportation", Transportation Science, vol. 29, pp.63-78, 1995.   DOI
4 P. Toth, and D. Vigo, "Heuristic algorithms for the handicapped persons transportation problem", Transportation Science, vol. 31, pp.60-71, 1997.   DOI   ScienceOn
5 M. Diana, and M. M. Dessouky, "A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows", Transportation Research Part B, vol. 38, pp.539-557, 2004.   DOI   ScienceOn
6 Y. Luo and P. Schonfeld, "A rejected-reinsertion heuristic for the static Dial-A-Ride Problem", Transportation Research Part B, vol. 41, no. 7, pp.736-755, 2007.   DOI   ScienceOn
7 T. Kim and A. Haghani, "Model and algorithm considering time-varying travel times to solve static multi-depot dial-a-ride problem", Transportation Research Record: Journal of the Transportation Research Board, no. 2218, pp.68-77, 2011.
8 김원호, 이신해, 김시현, "교통약자 유형별 이동행태분석 및 맞춤형 대중교통정보 제공방안 연구", 서울도시연구, 제9권, 제2호, pp.105-119, 2008년 6월.
9 김응철, 김태호, "교통약자의 환승을 고려한 K경로탐색 알고리즘 개발", 서울도시연구, 제10권, 제2호, pp.147-159, 2009년 6월.
10 남두희, 한호연, 고정민, "교통약자 서비스를 위한 정보센터 통합방안", 한국ITS학회논문지, 제9권, 제1호, pp.69-75, 2010년 2월.