The Study on urban Bus Scheduling and Real Time Rescheduling - A Case Study of hsinchu Transportation Company

• Main Authors: Liu, Fang-Chyi, 劉方旗
• Other Authors: Jin-Yuan Wang, Hui-Fen Chen
• Format: Others
• Language: zh-TW
• Published: 1998
• Online Access: http://ndltd.ncl.edu.tw/handle/35066001136386128161

碩士 === 國立交通大學 === 交通運輸研究所 === 86 === This thesis is study on urban bus scheduling problem and real time reschedulin-g problem. On urban bus scheduling problem, fixed fleet size and captive dema-nd are considered. Finding optimal single headway model and multiple headway model are discussed in this thesis. In stochastic bus system, passenger rene-ging, non-homogeneus arrvial process , weibull travel time and constant passen-ger upload/depart time are considered.The object function is define as profit of bus company. It equals ticket revenue minus operating cost and passengers t-otal waiting cost. Single headway model and multiple headway mathematics model are proposed. Finding optimal headway is a stochastic optimization problem. F-or single headway model, the algorithm of stochastic optimization base on boun-ding RA.。Same algorithm is also applied to multiple headway model in each tim- e interval..According to object function is not discontinuous and disconnected point is occurred on frequency changed. Two stage optimization is proposed. I-n the first stage, optimal frequency is found. In the second stage, optimal he-adway is found in optimal frequency.Empirical results show that modified bound-ing RA can find optimal headway in homogeneous arrival process. In non-homogen-eous arrival process and higher fare/ waiting cost ratio, algorithm is sensitiv-e with initial solution.Although schedule is setuped, traffic conjection and u- nexpected situation that cause journey can not be dispatched on given time are often happened. For these situation, real time bus dispatching and rescheduli-ng system are developed in this thesis. In system, real time bus location can be achieved by GPS signal and expected return time of bus is calculated by rea-l time travel speed of each road. When perturbation journey occurred, system w-ill active bus rescheduling module automatically and provides optimal dispatch-ing alternatives. Rescheduling module is deal with the situation that there is no reserved bus in bus station. It will dispatch bus belonged to other route t-o run perturbation journey. In module, rescheduling network model is constru-cted by system recovery time given by dispatcher. Based on the network, SPP(Se-t Partition Problem) is formulated. For the SPP, a column generation approach is proposed to generate available duties. Delay alternative is considered in ge-nerating available duties, thus delay nodes of each journey are appended to re-scheduling network. For the argumentation network, node-to-node cost matrix is calculated. Arc cost is define as sum of node cost/dual price, time distance and delay cost. After cost matrix is constructed, algorithm find the shortest path for given origin and destination. Each path is an available duty.Empiric-al result show that the column generation algorithm can generate optimal resch-eduling alternative efficiently. Comparing to manual dispatching, rescheduling module can improve 80% bus usage rate in un-peak period, 17% in peak period.