운행 비용과 승객 대기 시간을 최소화하는 비주기적 지하철 일정

• Published in: 한국컴퓨터정보학회논문지, 23(8) pp. 133 - 142
• Main Authors: 홍연우, 정예림, 민윤홍
• Format: Journal Article
• Language: English
• Published: 한국컴퓨터정보학회 01.08.2018
• Subjects: 컴퓨터학
• ISSN: 1598-849X; 2383-9945
• DOI: 10.9708/jksci.2018.23.08.133

Subway metro scheduling is one of the most important problems impacting passenger convenience today. To operate efficiently, the Seoul metro uses regular, periodic schedules for all lanes, both north and southbound. However, many past studies suggest that non-periodic scheduling would better optimize costs. Since the Seoul metro is continuously facing a deficit, adopting a non-periodic schedule may be necessary. Two objectives are presented; the first, to minimize the average passengers’ waiting time, and the second, to minimize total costs, the sum of the passenger waiting time, and the operational costs. In this paper, we use passenger smart card data and a precise estimation of transfer times. To find the optimal time-table, a genetic algorithm is used to find the best solution for both objectives. Using Python 3.5 for the analysis, for the first objective, we are able to reduce the average waiting time, even when there are fewer trains. For the second objective, we are able to save about 4.5 thousand USD with six fewer trains KCI Citation Count: 0