Optimizing bus line platform assignment across bus stations in Utrecht

Public Transport - Tập 14 - Trang 323-342 - 2021
Wouter ten Bosch1, J. A. (Han) Hoogeveen1, Marcel E. van Kooten Niekerk1,2
1Department of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands
2Qbuzz BV, Amersfoort, The Netherlands

Tóm tắt

Due to its increased popularity, public transport has grown considerably, which has resulted in more lines that are operated with higher frequencies. As a result, the current bus stations that are located in strategic places like city centers to serve as a hub are becoming too small. If there is no space to enlarge the station, then usually the best option is to create a second bus station close-by. This raises the problem of distributing the bus lines over the bus stations, such that good connections are offered to transfer passengers. We have considered this problem in the city of Utrecht, which is a middle-sized city in the center of the Netherlands. The central transit hub, which is located next to the central railway station, consists of several separate bus stations. The goal of the research is to minimize the total travel time for all passengers who want to transfer at the hub. Here we are not allowed to adjust the current timetable, and we have to take the capacity and vehicle limitations into account. To find out which journeys are made daily and by how many people we use data from a digital fare system. This results in passenger groups, and for each group we compute the relevant travel options given the current timetable. Thereto, the routes are split into an inbound itinerary, a transfer within the same bus station, and an outbound itinerary; the validity of a travel option depends on the assignment of the bus lines to the bus stations. We decompose the problem into first finding a distribution of the lines over the stations and then assigning them to a platform at the station of choice. In the first subproblem, we find the best set of transfers using Integer Linear Programming (ILP), resulting in a station assignment. In the second subproblem, for each station, we distribute the bus lines over the platforms. In this subproblem, there can be multiple lines assigned to a single platform, as long as there are never more vehicles at the platform simultaneously than physically fit. The goal is to maximize the comfort of the transfer passengers by assigning tight transfers to adjacent platforms; this problem is solved using ILP as well.

Tài liệu tham khảo

Adenso-Díaz B (2005) Rule-based system for platform assignment in bus stations. In: Multidisciplinary scheduling: theory and applications, Springer, pp 369–379 Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Proceedings of the 20th VLDB Conference, pp 487–499 Aktel A, Yagmahan B, Ãzcan T, Yenisey MM, Sansarcı E (2017) The comparison of the metaheuristic algorithms performances on airport gate assignment problem. Transp Res Procedia 22:469–478 Braaksma J, Shortreed J (1971) Improving airport gate usage with critical path. Transp Eng J ASCE 97(2):187–203 Cheng CH, Ho SC, Kwan CL (2012) The use of meta-heuristics for airport gate assignment. Expert Syst Appl 39(16):12430–12437 Cordeau J-F, Laporte G, Legato P, Moccia L (2005) Models and tabu search heuristics for the berth allocation problem. Transp Sci 39(4):526–538 Daduna JR, Voß S (1995) Practical experiences in schedule synchronization. In: Daduna JR, Branco I, Paixão JMP (eds) Computer-aided transit scheduling. Lecture Notes in Economics and Mathematical Systems, vol 430. Springer, Berlin, pp 39–55 Delling D, Pajor T, Werneck RF (2015) Round-based public transit routing. Transp Sci 49:591–604 Dorndorf U, Drexl A, Nikulin Y, Pesch E (2007) Flight gate scheduling: state-of-the-art and recent developments. Omega 35(3):326–334 Imai O, Nishimura E, Papadimitriou S (2001) The dynamic berth allocation problem for a container port. Transp Res Part B 35:401–417 Obata T (1979) Quadratic assignment problem: Evaluation of exact and heuristic algorithms. PhD thesis, Rensselaer Polytechnic Institiute, Troy, NY