본문 바로가기
KERD
논문KCI 등재

수요대응형 모빌리티 최적 운영을 위한 동적정류장 배정 모형 개발

Development of a Model for Dynamic Station Assignmentto Optimize Demand Responsive Transit Operation

김진주|방수혁
한국ITS학회 (The Korean Society of Intelligent Transport Systems)|2022.02|한국ITS학회 논문지 (Journal of Korean Society of Intelligent Transport Systems)|제21권 제1호|pp. 17-34|DOI https://doi.org/10.12815/kits.2022.21.1.17

0

조회

0

다운로드

4

인용

0

참고문헌

키워드

다목적 최적화수요대응형 모빌리티동적정류장Demand Responsive TransitDynamic StationMulti-objective Genetic Algorithm

초록

본 논문은 수요대응형 모빌리티 이용객의 출발지와 목적지까지 최적 경로 산정을 위한 동적정류장 배정 모형을 개발하였다. 여기서 최적화를 위한 변수로는, 운영자 측면에서 버스통행시간과 이용자 측면에서 서비스 이용 시 추가로 소요되는 정류장까지 도보시간 및 대기시간, 우회시간을 사용하였다. 미국 캘리포니아주 애너하임과 주변 도시를 포함하는 네트워크를 대상으로 승객이 예약한 시종점에서 접근 가능한 동적정류장 리스트를 산정하고 K-means 클러스터링 기법을 이용하여 시종점 그룹들을 각기 차량에 배정하였다. 버스통행시간과 이용자 추가소요시간을 최소화하는 동적정류장 위치 및 버스노선 결정을 위한 모형을 개발하고 다목적최적화를 위해 NSGA-III 알고리즘을 적용하였다. 최종적으로, 모델의 효용성을 평가하기 위해이용자 추가소요시간 간의 변수를 조정하여 7개의 시나리오를 설정하였고 이를 통해 목적함수의 타당성을 분석하였다. 그 결과, 운영자 측면에서는 버스통행시간과 승객 대기시간만 고려한시나리오가, 이용자 측면에서는 버스통행시간, 도보시간, 우회시간을 적용한 시나리오가 가장우수하였다.

Abstract

This paper develops a model for dynamic station assignment to optimize the Demand Responsive Transit (DRT) operation. In the process of optimization, we use the bus travel time as a variable for DRT management. In addition, walking time, waiting time, and delay due to detour to take other passengers (detour time) are added as optimization variables and entered for each DRT passenger. Based on a network around Anaheim, California, reserved origins and destinations of passengers are assigned to each demand responsive bus, using K-means clustering. We create a model for selecting the dynamic station and bus route and use Non-dominated Sorting Genetic Algorithm-III to analyze seven scenarios composed combination of the variables. The result of the study concluded that if the DRT operation is optimized for the DRT management, then the bus travel time and waiting time should be considered in the optimization. Moreover, it was concluded that the bus travel time, walking time, and detour time are required for the passenger.

참고문헌 (41)

  1. Alonso-Mora, J., "On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment", Proceedings of the National Academy of Sciences, 114(3), pp.462~467 (2017)
  2. Arbex, R. O., "Efficient transit network design and frequencies setting multi-objective optimization by alternating objective genetic algorithm", Transportation Research Part B: Methodological, 81(2), pp.355~376 (2015)
  3. "Ban, J. and Jayakrishnan, R." (2021)[URL]
  4. Bodin, L. D., "The Multi-vehicle subscriber dial-a-ride problem" (1983), Naval Postgraduate School
  5. Bureau of Public Roads, "Traffic Assignment Manual", United States, Department of Commerce, Urban Planning Division, ~ (1964)
  6. Calvo, R. W., "An Effective and fast heuristic for the Dial-a-Ride problem", A Quarterly Journal of Operations Research, 5(1), pp.61~73 (2007)
  7. Celebi, M. E., "A comparative study of efficient initialization methods for the k-means clustering algorithm", Expert Systems with Applications, 40(1), pp.200~210 (2013)
  8. Chebbi, O., "Reducing the wasted transportation capacity of personal rapid transit systems: An integrated model and multi-objective optimization approach", Transportation Research Part E: Logistics and Transportation Review, 89, pp.236~258 (2016)
  9. Chen, T., "Optimal routing and charging of an electric vehicle fleet for high-efficiency dynamic transit systems", IEEE Transactions on Smart Grid, 9(4), pp.3563~3572 (2016)
  10. Chiang, T. C., "A Knowledge-based evolutionary algorithm for the multiobjective vehicle routing problem with time windows", Computers & Operations Research, 45, pp.25~37 (2014)
  11. Cordeau, J. F., "A Branch-and-cut algorithm for the dial-a-ride problem", Operations Research, 54(3), pp.573~586 (2006)
  12. Coslovich, L., "A Two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem", European Journal of Operational Research, 175(3), pp.1605~1615 (2006)
  13. Das, I., "Normal-boundary Intersection: A new method for generating the pareto surface in nonlinear multicriteria optimization problems", SIAM Journal on Optimization, 8(3), pp.631~657 (1998)
  14. Deb, K., "An Evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, Part I: Solving problems with box constraints", IEEE Transactions on Evolutionary Computation, 18(4), pp.577~601 (2013)
  15. Deb, K., "A Fast and elitist multiobjective genetic algorithm: NSGA-II", IEEE Transactions on Evolutionary Computation, 6(2), pp.182~197 (2002)
  16. Diana, M., "A New regret insertion heuristic for solving large-scale dial-a-ride problems with time windows", Transportation Research Part B: Methodological, 38(6), pp.539~557 (2004)
  17. Diana, M., "A Model for the fleet sizing of demand responsive transportation services with time windows", Transportation Research Part B: Methodological, 40(8), pp.651~666 (2006)
  18. Dondo, R., "A Cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows", European Journal of Operational Research, 176(3), pp.1478~1507 (2007)
  19. Dou, X., "Coordination of feeder bus schedule with train service at integrated transport hubs", Transportation Research Record, 2648(1), pp.103~110 (2017)
  20. Dumas, Y., "The Pickup and delivery problem with time windows", European Journal of Operational Research, 54(1), pp.7~22 (1991)
  21. Fan, W., "Optimal transit route network design problem with variable transit demand: Genetic algorithm approach", Journal of Transportation Engineering, 132(1), pp.40~51 (2006)
  22. Holland, J. H., "Adaptation in natural and artificial systems: An introductory analysis with applications to biology, control, and artificial intelligence" (1975), MIT Press
  23. Horn, M. E., "Fleet scheduling and dispatching for demand-responsive passenger services", Transportation Research Part C: Emerging Technologies, 10(1), pp.35~63 (2002)
  24. Konak, A., "Multi-objective optimization using genetic algorithms: A tutorial", Reliability Engineering & System Safety, 91(9), pp.992~1007 (2006)
  25. Kuah, G. K., "The Feeder-bus network-design problem", Journal of the Operational Research Society, 40(8), pp.751~767 (1989)
  26. Lee, Y. J., "Development of an algorithm for optimal demand responsive relocatable feeder transit networks serving multiple trainsand stations", Urban Rail Transit, 5(3), pp.186~201 (2019)
  27. Mahmoudi, M., "Finding optimal solutions for vehicle routing problem with pickup and delivery services with time windows: A dynamic programming approach based on state-space-time network representations", Transportation Research Part B: Methodological, 89, pp.19~42 (2016)
  28. Ministry of Land, Infrastructure and Transport, "Traffic impact analysis·improvement strategy guideline", ~ (2013)
  29. Pan, S., "Designing a flexible feeder transit system serving irregularly shaped and gated communities: Determining service area and feeder route planning", Journal of Urban Planning and Development, 141(3) (2015)
  30. Parvasi, S. P., "A Bi-level school bus routing problem with bus stops selection and possibility of demand outsourcing", Applied Soft Computing, 61, pp.222~238 (2017)
  31. Qiu, F., "A Dynamic station strategy to improve the performance of flex-route transit services", Transportation Research Part C: Emerging Technologies, 48, pp.229~240 (2014)
  32. Savelsbergh, M., "Drive: Dynamic routing of independent vehicles", Operations Research, 46(4), pp.474~490 (1998)
  33. Sheffi, Y., "Urban transportation networks: Equilibrium analysis with mathematical programming methods" (1985), Prentice Hall
  34. Srinivas, N., "Multi-objective function optimization using non-dominated sorting genetic algorithms", Evolutionary Computation Journal, 2(3), pp.221~248 (1994)
  35. Sun, B., "Personalised and coordinated demandresponsive feeder transit service design: A genetic algorithms approach", Future Internet, 10(7), pp.61~ (2018)
  36. Taplin, J. H., "Optimizing bus stop locations for walking access: Stops-first design of a feeder route to enhance a residential plan", Environment and Planning B: Urban Analytics and City Science, 47(7), pp.1237~1259 (2019)
  37. "Transportation Networks for Research" (2021)[URL]
  38. Wang, H., "Routing and scheduling for a last-mile transportation system", Transportation Science, 53(1), pp.131~147 (2017)
  39. Lin Wang, "Optimization of demand-responsive transit systems using zonal strategy", 도시과학국제저널, 22(3), pp.366~381 (2018), 도시과학연구원[DOI]
  40. Wardrop, J. G., "Road paper. Some theoretical aspects of road traffic research", Proceedings of the Institution of Civil Engineers, 1(3), pp.325~362 (1952)
  41. Yannibelli, V., "A Comparative analysis of NSGA-II and NSGA-III for autoscaling parameter sweep experiments in the cloud", Scientific Programming, 2020, pp.4653204~ (2020)

관련 논문AI추천

수요응답형 대중교통체계를 위한 클러스터링 기반의 다중차량 경로탐색 방법론 연구김정윤, 김지후, 여화수한국ITS학회 · 한국ITS학회 논문지2020 · 제19권 제5호다수차고지와 예약시간 위반을 고려한교통약자 차량 서비스에 대한 연구강원의, 김태형, 박범진한국ITS학회 · 한국ITS학회 논문지2012 · 제11권 제5호이용자 만족도를 반영한 최적 버스 배차 간격 설정 모형의 개발김탁영, 류병용, 배상훈한국ITS학회 · 한국ITS학회 논문지2007 · 제6권 제3호실시간 재배치를 통한 카쉐어링 서비스 최적화에 관한 연구 : PSO 방법론 기반으로고성석, 이건영, 이형석, 홍요한한국산업경영시스템학회 · 한국산업경영시스템학회지2016 · 제39권 제2호대중교통 수단선택과 연계한 복합환승센터내 보행자 최적경로 산정배상훈, 윤상원한국ITS학회 · 한국ITS학회 논문지2007 · 제6권 제2호기종점 모빌리티 데이터 기반 클러스터링 기법을 활용한 지역 모빌리티의 공간적 특성 분석 연구안용준, 이동훈한국ITS학회 · 한국ITS학회 논문지2023 · 제22권 제1호

이 간행물의 다른 논문 (17건)

개인 통행성향을 고려한 공유 전동킥보드 이용의향 분석: 서울시를 중심으로추상호, 구자헌, 이윤희pp. 1-16유효녹색시간 조정을 활용한 중앙버스정류장 용량 부족 완화 방안 연구구교민, 장일준, 안세영, 이재덕pp. 35-50도시부 도로 호송주행(Convoy Driving) 서비스 개발 및 효과분석손승녀, 이지연, 박지혁, 조용성, 소재현pp. 51-63구간 통행시간정보 평가를 위한 기준장비 개발 및 평가 방법 연구임성한, 전현명, 안선영, 조용성pp. 64-75메타분석을 이용한 화물차 군집주행의 효과 분석김예진, 윤일수, 박중규, 정하림, 고우리pp. 76-90
원문 보기