• Title/Summary/Keyword: Optimal Bus Scheduling

Search Result 14, Processing Time 0.018 seconds

Improvement of Optimal Bus Scheduling Model Reflecting Bus Passenger's Degree of Satisfaction (이용자 만족도를 반영한 최적 버스 배차 간격 설정 모형의 개발)

  • Bae, Sang-Hoon;Kim, Tag-Young;Ryu, Byung-Yong
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.6 no.3
    • /
    • pp.12-23
    • /
    • 2007
  • The purpose of this studγ if to understand problem of present bus scheduling system and to develop optimal bus scheduling model which improve bus passenger's degree of satisfaction(DOS) and bus company's operation efficiency at the same time. This study developed optimal bus scheduling model, which reflected bus passenger's degree of satisfaction(DOS), applied to existing model that summery of bus operation cost($C_o$), passenger queuing time cost($C_{pw}$) and passenger travel time cost($C_{pl}$). And optimal bus scheduling model which developed in this study is optimized that using LINGO program based on linear program. Also by using the general case in Busan, compare total cost of present bus scheduling system and existing scheduling model with total cost of optimal bus scheduling model which reflected bus passenger's degree of satisfaction(DOS).

  • PDF

System Dynamics Interpretation on Bus Scheduling Model (시스템 다이나믹스 관점에서의 버스 운영계획모형 해석)

  • Kim, Kyeong-Sik
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.8 no.1
    • /
    • pp.1-8
    • /
    • 2009
  • This paper aims mainly to reinterpretate Optimal Bus Scheduling Model by applying System Dynamics Perspective. Traditionally, the study regarding Optimal Bus Scheduling Model stems on the linear relationshp. However, this paper attempted to convert linear relationship based Optimal Bus Scheduling Model to causal loop perspective based Model. In result, the paper present Casual Loop Diagram for Optimal Bus Scheduling Model. Furthermore, the paper also ran a simulation based on Stock & Flow Diagram for Optimal Bus Scheduling Model. The outcome was not much different from the linear relationship based Model due to the similarity of the equation applied on two models.

  • PDF

Development of Real-Time Optimal Bus Scheduling Models (실시간 버스 운행계획수립 모형 개발)

  • Kim, Wongil;Son, Bongsoo;Chung, Jin-Hyuk;Lee, Jeomho
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.28 no.5D
    • /
    • pp.587-595
    • /
    • 2008
  • Many studies on bus scheduling optimization have been done from the 1960s to recent years for establishing rational bus schedule plan that can improve convenience of bus passengers and minimize unnecessary runs. After 2000, as part of the Intelligent Transport Systems (ITS), the importance of the schedule management and providing schedule information through bus schedule optimization has become a big issue, and much research is being done to develop optimization models that will increase bus passenger convenience and, on the side of bus management, minimize unnecessary bus operation. The purpose of this study is to calculate the optimal bus frequency and create a timetable for each bus stop by applying DTR or DTRC model that use data for each bus stop and route segment. Model verification process was implemented using data collected from bus management system (BMS) and integrated transit-fare card system for bus route of Seoul's No. 472 line. In order to evaluate the reliability and uncertainty of optimal solution, sensitivity analysis was implemented for the various parameters and assumptions used in the bus scheduling model.

A Development of Multi-Period Bus Scheduling Model (다시간대에 대한 버스 스케줄링 모형 개발)

  • 고종섭;고승영
    • Journal of Korean Society of Transportation
    • /
    • v.17 no.4
    • /
    • pp.47-58
    • /
    • 1999
  • The Purpose of this Paper is to develop a multi-period bus scheduling model, in which a decomposition technique is applied. In general a bus scheduling requires a vast amount of calculation. Thus, a bus scheduling is a very complicated problem even with a single depot and is almost unable to obtain the optimal solution theoretically with many depots. In this paper in order to simplify the problem, the whole operating hours of a day are partitioned into several time periods. In one period, the same headways are maintained. For one period, the bus scheduling is simple and the solution applying the FIFO(First-In, First-Out) Principle is the optimal. However, connection between Periods remains as another scheduling Problem with a reduced problem size. This paper suggests how to connect bus schedules of consecutive periods efficiently, minimizing the operating cost. Through case studies for multiple routes with a single depot, this decomposition technique is proved to be effective practically.

  • PDF

Bus and Registor Optimization in Datapath Synthesis (데이터패스 합성에서의 버스와 레지스터의 최적화 기법)

  • Sin, Gwan-Ho;Lee, Geun-Man
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.8
    • /
    • pp.2196-2203
    • /
    • 1999
  • This paper describes the bus scheduling problem and register optimization method in datapath synthesis. Scheduling is process of operation allocation to control steps in order to minimize the cost function under the given circumstances. For that purpose, we propose some formulations to minimize the cost function for bus assignment to get an optimal and minimal cost function in hardware allocations. Especially, bus and register minimization technique are fully considered which are the essential topics in hardware allocation. Register scheduling is done after the operation and bus scheduling. Experiments are done with the DFG model of fifth-order digital ware filter to show its effectiveness. Structural integer programming formulations are used to solve the scheduling problems in order to get the optimal scheduling results in the integer linear programming environment.

  • PDF

Development of Optimal Bus Scheduling Algorithm with Multi-constraints (다중제약을 고려한 최적 버스운행계획 알고리즘 개발)

  • Lee, Ho-Sang;Park, Jong-Heon;Jo, Seong-Hun;Yun, Byeong-Jo
    • Journal of Korean Society of Transportation
    • /
    • v.24 no.7 s.93
    • /
    • pp.129-138
    • /
    • 2006
  • After Seoul has introduced semi-public bus management system(public management-private operation), the Seoul Metro Government needs a scientific management tool for optimal scheduling for bus routes, to reduce unnecessary operations and provide demand responsive service. As a product of this effort, this paper proposes a heuristic model that could minimize total passenger waiting time under the constraints, such as number of vehicles, working conditions, max load point, minimax headway. etc. For verifying the validity of the proposed model, it is applied to an existing bus route. It results that headways in rush hours become decreased and the passenger waiting time could be decreased. In conclusion. it is thought that the Proposed model contributes to efficiency of bus operation.

Optimal Voltage and Reactive Power Scheduling for Saving Electric Charges using Dynamic Programming with a Heuristic Search Approach

  • Jeong, Ki-Seok;Chung, Jong-Duk
    • Journal of Electrical Engineering and Technology
    • /
    • v.11 no.2
    • /
    • pp.329-337
    • /
    • 2016
  • With the increasing deployment of distributed generators in the distribution system, a very large search space is required when dynamic programming (DP) is applied for the optimized dispatch schedules of voltage and reactive power controllers such as on-load tap changers, distributed generators, and shunt capacitors. This study proposes a new optimal voltage and reactive power scheduling method based on dynamic programming with a heuristic searching space reduction approach to reduce the computational burden. This algorithm is designed to determine optimum dispatch schedules based on power system day-ahead scheduling, with new control objectives that consider the reduction of active power losses and maintain the receiving power factor. In this work, to reduce the computational burden, an advanced voltage sensitivity index (AVSI) is adopted to reduce the number of load-flow calculations by estimating bus voltages. Moreover, the accumulated switching operation number up to the current stage is applied prior to the load-flow calculation module. The computational burden can be greatly reduced by using dynamic programming. Case studies were conducted using the IEEE 30-bus test systems and the simulation results indicate that the proposed method is more effective in terms of saving electric charges and improving the voltage profile than loss minimization.

A Tour Bus Scheduling Method by Greedy Heuristic and Column Generation Techniques (Greedy Heuristic기법과 열 제조에 의한 관광버스 배차방법)

  • Park Sun-Dal;Jang Byeong-Man
    • Journal of the military operations research society of Korea
    • /
    • v.13 no.1
    • /
    • pp.101-115
    • /
    • 1987
  • This paper presents an optimization based heuristic algorithm for a tour bus scheduling problem where buses consist of various kinds of sightseeing and commutation services. First, this algorithm transforms the prolem into a vehicle routing problem on whose nodes denote trips and arcs denote connections between trips. Second, a greedy heuritic routing technique is applied to find a good feasible bus-route set. Then the greedy feasible solution is improved by the simplex method using column generation technique. The algorithm provides a better near-optimal solution which gives much reductions in the total tour distance and the number of tour buses.

  • PDF

Optimal Headways of Urban Bus Services, Reflecting Actual Cycle Time and Demand (운행시간 및 수요 기반 버스 최적배차간격 산정에 관한 연구)

  • Kim, Sujeong;Shin, Yong Eun
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.38 no.1
    • /
    • pp.167-174
    • /
    • 2018
  • This study attempts to construct a model of optimal headway, focusing on a practical applicability to bus transit operation. Examining the existing bus operation and scheduling plans imposed by Busan City, we found that the plans failed to reasonably take into account such realities as varying traffic and operational conditions. The model is thus developed to derive the hourly optimal headway by routes satisfying the real-world conditions: varying hourly demand and cycle time, applying the model to routes 10 and 27 as examples. To do so, we collect big-dataset generated by smart card system and BIMS (Bus Inforamtion Management System). It is expected that the results of this study wil be a basis for further refined research in this field as well as for preparing practical timetables for bus operation.

Short-Term Generation Scheduling Considering Transmission Line Capacity Limits (선로용량한계를 고려한 단기 발전계획)

  • 김준현;송현선;유인근
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.35 no.12
    • /
    • pp.594-602
    • /
    • 1986
  • This paper proposes an effective algorithm for short-term generation scheduling for the purpose of economic and secure operation of thermal power systems. Especially, in the procedure of solution by Dynamic Programming, Linear Programming is introduced to promote the possibility of optimal solution and the security of power systems, and evaluation of security function is improved by the application of seven step approximation of normal distribution. Several necessary considerations, that is, time dependent start-up and constant down cost of generating units, demand and spinning reserve constraints, minimum up and sown time constraints, the number of possible start-up of a generating unit in a d and the number of generating units which can be started up at the same time at the same bus, are also incoporated to elevate the usability and flexibility of the algorithm. Finally, the effectiveness of the proposed algorithm has been demonstrated by applying to the 6-gen. 21-bus model power system.

  • PDF