Journal of the Korea Society for Simulation (한국시뮬레이션학회논문지)

The Korea Society for Simulation (한국시뮬레이션학회)
권호 표지
DOI QR코드

DOI QR Code

School Bus Routing Problem with Mixed-Load and Dynamic Arrivals

혼승 및 시간대별 학생들의 동적유입을 고려한 스쿨버스 경로 문제

  • 이영기 (연세대학교 정보산업공학과) ;
  • 정석재 (광운대학교 경영학부) ;
  • 윤호영 (연세대학교 정보산업공학과) ;
  • 김경섭 (연세대학교 정보산업공학과)
  • Received : 2012.12.07
  • Accepted : 2013.03.25
  • Published : 2013.03.31
Download PDF
⟨ Previous Next ⟩

Abstract

The School Bus Routing Problem(SBRP) seeks to plan an efficient schedule of a fleet of school buses that must pick up student from various bus stops and deliver them by satisfying various constraints; maximum capacity of the bus, maximum riding time of students, arrival time between a school's time window. By extending the existing SBRP, we consider a case study of SBRP with allowance of mixed-loading and dynamic arrivals reflecting the school bus operation of university in Korea. Our solution procedure is based on constructing the initial solution using sweep algorithm and then improving solution within the framework of the evolutionary approach known as efficient meta-heuristics. By comparing the various scenarios through the constraints relaxation for reflecting the real operational strategies, we assess the merit of our proposed procedure.

스쿨버스 경로문제는 학생들을 다수의 승차지점으로부터 학생들의 해당 학교까지 안전하고 효율적으로 수송할 수 있는 방법을 찾는 문제이다. 일반적인 스쿨버스 경로문제의 제약 조건으로는 차량의 용량, 학생의 최대 수송 시간, 학교의 도착 시간 제약 등이 있다. 본 연구에서는 기존의 혼승을 허용한 스쿨버스 경로 문제를 확장한 모델을 구축하고, 국내의 대학교 스쿨버스 운영 형태를 고려하여 학생들이 승차지점에 유동적으로 유입이 되는 상황을 고려한다. 본 연구에서 제시하는 모델에 대한 실험을 하기 위하여, 첫 단계로 Sweep Algorithm을 이용하여 초기 경로를 구성한다. 두 번째 단계에서는 전역탐색 능력이 있는 메타 휴리스틱 방법인 Genetic Algorithm을 이용하여 최선해을 도출 한다. 또한, 기존의 스쿨버스 경로문제에 적용되었던 현실 가능성 있는 제약들을 완화하여 다양한 시나리오를 구성하고 시나리오별 비교우위 평가를 한다.

Keywords

References

  1. Bodin, L.D. and Berman, L.(1979), Routing and Scheduling of School Buses by Computer, Transportation Science, Vol.13, pp.113-129. https://doi.org/10.1287/trsc.13.2.113
  2. Bowerman, Rm Hall., and Calamai, P.(1995), A multi-objective optimization approach to urban school bus routing : Formulation and solution method. Transportation Research Part A, Vol. 29, No.2 , pp. 107-123.
  3. Desrosiers, J., Ferland, J. A., Rousseau, J. M., Lapalme, G., and Chapleau, L. (1986), TRANSCOL : a Multi-period School Bus Routing and Scheduling System, TIME Studies in the Management Sciences, Vol.22, pp.47-71.
  4. Fugenschuh, A. (2009), Solving a school bus scheduling problem with integer programming, European Journal of Operational Research, Vol.193, No.3, pp.867-884. https://doi.org/10.1016/j.ejor.2007.10.055
  5. Gillett, B.E. and Miller, L.R. (1974), A Heuristic Algorithm for the Vehicle Dispatch Problem, Operations Research, Vol. 22, pp. 340-349. https://doi.org/10.1287/opre.22.2.340
  6. Lee, C.(2005). The Vehicle Routing Problem with Simultaneous Pickup and Delivery, Thesis of masters degree, Korea National Defense University.
  7. Li, L. and Fu, Z. (2002), The School Bus Routing Problem : a Case Study, Journal of the Operational Research Society, Vol. 53, pp. 552-558. https://doi.org/10.1057/palgrave.jors.2601341
  8. Park, J., Tae, H., and Kim, B. (2009), The Effects of Allowing Mixed Loads in the Commuter Bus Routing Problem, Proceedings of the 10th Asia Pacific Industrial Engineering and Management Systems Conference, Kitakyushu, Japan, pp.1353-1359.
  9. Park, J. and Kim, B. (2010), The School Bus Routing Problem : A Review, European Journal of Operational Research, Vol.202, No.2, 311-319. https://doi.org/10.1016/j.ejor.2009.05.017
  10. Ripplinger, D. (2005), Rural School Vehicle Routing Problem, Transportation Research Record : Journal of the Transportation Research Board, Vol. 1922, pp. 105-110. https://doi.org/10.3141/1922-14
  11. Schitterkar, P., Sevaux, M., and Sorensen, K. (2006), A mathematical formulation for a school bus routing problem, Proceedings of the IEEE 2006 International Conference on Service System and Service Management.
  12. Spada, M., Bierlaire, M., Liebling, and Th. M. (2005), Decision-aiding methodology for the school bus routing and scheduling problem, Transportation Science, Vol. 39, pp. 477-490. https://doi.org/10.1287/trsc.1040.0096
  13. Harold W. Kuhn (1955), The Hungarian Method for the assignment problem, Naval Research Logistics Quarterly, Vol. 2, pp. 83-97. https://doi.org/10.1002/nav.3800020109
  14. Holland, J (1975), Adaptation In Natural and Artificial Systems. University of Michigan Press, Ann Abor.