• Title/Summary/Keyword: Waiting vehicle

Search Result 100, Processing Time 0.02 seconds

A User Equilibrium Transit Assignment Model with Vehicle Capacity Constraint (차량용량을 고려한 대중교통 통행배정모형구축에 관한 연구)

  • 이성모;유경상;전경수
    • Journal of Korean Society of Transportation
    • /
    • v.14 no.3
    • /
    • pp.27-44
    • /
    • 1996
  • The purpose of the thesis is providing a new formulation for the transit assignment problem. The existing models dealing with the transit assignment problem don't consider the congestion effects due to the insufficient capacity of transit vehicles. Besides, these models don't provide solutions satisfying the Wardrop's user equilibrium conditions. The congestion effects are considered to be concentrated at the transit stops. For the transit lines, the waiting times at the transit stops are dependent on the passenger flows. The new model suggests the route section cost function analogous to the link performance function of the auto assignment to reflect the congestion effects in congested transit network. With the asymmetric cost function, the variational inequality programming is used to obtain the solutions satisfying Wardrop's condition. The diagonalization algorithm is introduced to solve this model. Finally, the results are compared with those of EMME/2.

  • PDF

Application of a Linear Programming in a Taxi Dispatching System (수송문제 선형계획기법을 응용한 모범택시의 배차시스템 개발)

  • 이종호
    • Journal of Korean Society of Transportation
    • /
    • v.13 no.1
    • /
    • pp.83-94
    • /
    • 1995
  • Many taxis called "Mobum" in Seoul are empty and waiting along the curb during the day time. However, it is almost impossible for elderly and handicapped people, and women carrying babies to use them .It is because they can not serve passengers who request services by phone. If taxis, expecially "Mobum" taxis which offer high quality services, can be dispatched based on requests by phone, not only elderly and handicapped people but also auto commuters will easily call and use them. This paper shows a taxi dispatching system. The system minimizes the total empty vehicle hours under given number of empty vehicles and passengers and their locations. As a result, the system maximizes number of services and revenue under given number of taxis. The system adopts a well -known linear programming model and the model can fast and easily be solved by PC level linear programming packages. Also, practical solutions of the system's constraints such as size and travel time forecast are discussed.ecast are discussed.

  • PDF

Study about the Evaluation of Structural Safety for New Conceptual Modular Smart Station (신개념 모듈형 스마트정거장의 구조적 안전성평가에 관한 연구)

  • Lee, Kang-Won;Yoon, Hee-Taek;Park, Young-Kon;Kim, Young-Min;Jo, Chang-Whan
    • Proceedings of the KSR Conference
    • /
    • 2009.05a
    • /
    • pp.251-259
    • /
    • 2009
  • Smart station is a modular one easily installed on the road and protecting from the environmental effects such as snow and rain etc. Smart station can provide some comfortable and easy ambience during waiting the Bimodal Tram. Conventional station can be invaded by overdriven vehicle to make some fatal accident. But smart station gives more protective and safe shelter to the passengers. This paper have investigated and analyzed the structural safety and usefulness about the new conceptual modular smart station.

  • PDF

Simulation and Analysis for Small Rapid Transit System (소형궤도열차시스템 모의시험 및 분석)

  • Jeong, Rag-Gyo;Kim, Yeon-Soo;Cho, Bong-Kwan;Choi, Hyo-Jeong
    • Proceedings of the KSR Conference
    • /
    • 2006.11b
    • /
    • pp.748-754
    • /
    • 2006
  • Small Rapid Transit System(SRTS) will be defined fully automated urban transit system providing a rapid and personalized door to door transport service. Conventional forms of public transit require passengers to collect in groups until a large vehicle is scheduled to travel on predetermined routes. In contrast, SRTS offers personal transport with no waiting, and takes passengers non-stop to their chosen destination. This is a transport system which is as convenient as, or in congested environments more convenient than, the car, but with minimal environmental impact. Accordingly the foundation study of choice system size for development of SRTS

  • PDF

Prevention of Traffic Accident using AHP Rules (AHP를 이용한 교통사고 예방)

  • Jin, Hyun-Soo
    • Proceedings of the KAIS Fall Conference
    • /
    • 2008.05a
    • /
    • pp.157-159
    • /
    • 2008
  • This paper has been studied traffic accident using intelligence prediction algorithm. and wish to prevent accident by guiding in 2 km ahead the accident that occur in fog section and a snow-covered road, sudden roadworks and sharp curve section, etc and removing fog and snow automatically using the ubiquitous and intelligence technique. If we can predict of traffic accident, we can prevent the many traffic accident. In this paper, we present neural network approach for prediction of traffic accident. Computer simulation results prove that reducing the average vehicle waiting time which proposed considering prevention of traffic algorithm for optimal traffic cycle is better than fixed signal method which dose not using prevention of traffic algorithm.

  • PDF

Study on Vehicle Routing Problem with Minimum Delivery Completion Time (특송소화물 배송완료시간 최소화를 위한 차량경로문제 연구)

  • Lee, Sang-Heon
    • Journal of Korean Society of Transportation
    • /
    • v.22 no.7 s.78
    • /
    • pp.107-117
    • /
    • 2004
  • The growing demand for customer-response, made-to-order manufacturing and satisfactory delivery are stimulating the importance of commercial fleet management problem. Moreover, the rapid transformation to the customer-oriented multi-frequency, relatively small fleet, such as home delivery and Perishable goods, requiring prompt delivery and advanced real-time operation of vehicle fleets. In this paper we consider the vehicle routing problem(VRP) to minimize delivery completion time which is equal to the time that last customer wait for the vehicle in fleet operation. The mathematical formulation is different from those for the classical VRP which is minimizing cost/distance/time by running vehicles in manager's point of view. The key aspect of this model is not considering the return time from the last customer to depot in every vehicle path. Thereby, the vehicle dispatcher can afford to dynamically respond to customer demand and vehicle availability. The customer's position concerned with minimizing waiting time that may be applied for the delivery of product required freshness or delivery time. Extensive experiments are carried out to compare the performance of minimizing delivery completion time by using the ILOG Solver which has the advantage of solving quickly an interim solution very near an optimal solution. The experimental results show that the suggested model can easily find near optimal solution in a reasonable computational time under the various combination of customers and vehicles.

A Study on Left-turn Queues Analysis using Queueing Theory under Permissive Left-turn Signal System (비보호좌회전 신호체계운영에 따른 좌회전 대기행렬분석에 관한 연구)

  • Kim, Kap Soo;Jung, Ja Young
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.31 no.5D
    • /
    • pp.663-669
    • /
    • 2011
  • In this study, the optimal length of left-turn lane in permissive left-turn signal system at the signalized intersection which has a left-turn bay is estimated. It is a simulation analysis using the queueing theory that estimate the length of left-turn lane. Traffic density conform to the standards of operating a permissive left-turn system of the Practical Manual Traffic Safety Facilities. And each of a left-turn arrival rate, a left-turn service rate, left-turn average queueing time, for green time average queueing vehicle, for red time average queueing vehicle and average queueing vehicle cycle is calculated. As a result of this study, we would learn how much the space should be secured at the signalized intersection which has a left-turn bay. The methodology using the queueing theory to work out the optimal length of waiting lane in the permissive left-turn signal system was presented.

Improved Slow Charge Scheme for non-communication Electric Vehiclesby Predicting Charge Demand

  • Chang, Tae Uk;Ryu, Young Su;Kwon, Ki Won;Paik, Jong Ho
    • Journal of Internet Computing and Services
    • /
    • v.21 no.5
    • /
    • pp.39-48
    • /
    • 2020
  • Recently, the study and development of environment-friendly energy technique have increased in worldwide due to environmental pollution and energy resources problems. In vehicle industry, the development of electric vehicle(EV) is now on progress, and also, many other governments support the study and development and make an effort for EV to become widely available. In addition, though they strive to construct the EV infra such as a charge station for EV, the techniques related to managing charge demand and peak power are not enough. The standard of EV communication has been already established as ISO/IEC 15118, however, most of implemented EVs and EV charge stations do not support any communication between each of them. In this paper, an improved slow charge scheme for non-communication EVs is proposed and designed by using predicting charge demand. The proposed scheme consists of distributed charge model and charge demand prediction. The distributed charge model is designed to manage to distribute charge power depending on available charge power and charge demand. The charge demand prediction is designed to be used in the distributed charge model. The proposed scheme is based on the collected data which were from EV slow charge station in business building during the past 1 year. The system-level simulation results show that the waiting time of EV and the charge fee of the proposed scheme are better than those of the conventional scheme.

Forecasting of Traffic Situation using Internet (인터넷을 이용한 교통상황예보)

  • Hong, You-Sik;Choi, Myeong-Bok
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.13 no.3
    • /
    • pp.300-309
    • /
    • 2003
  • The Japanese developed the first Car navigation system in 1981 with the advent of Honda, which was known as the car inertial navigation system. Now days, It is possible to search the shortest route to and from places and arrival time using the internet via cell phone to the driver based on GIS and GPS. However, even with a good navigation system, it losses the shortest route when there is an average speed of the vehicle being between S-15 kilometers. Therefore, in order to improve the vehicle waiting time and average vehicle speed, we are suggesting an optimal green time algorithm using fuzzy adaptive control, where there are different traffic intersection lengths, and lanes. In this paper, to be able to assist the driver and forecast the optimal traffic information with regards to the road conditions; dangerous roads, construction work and estimation of arrival time at their destination using internet.

A Range-based Relay Node Selecting Algorithm for Vehicular Ad-hoc Network (차량 애드혹 네트워크를 위한 영역 기반 릴레이 노드 선택 알고리즘)

  • Kim Tae-Hwan;Kim Hie-Cheol;Hong Won-Kee
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.9 s.351
    • /
    • pp.88-98
    • /
    • 2006
  • VANET has several different characteristics from MANET such as high mobility of nodes and frequent change of node density and network topology. Due to these characteristics, the network topology based protocol, often used in MANET, can not be applied to VANET. In this paper, we propose an emergency warning message broadcast protocol using range based relay node selecting algorithm which determines the minimal waiting time spent by a given node before rebroadcasting the received warning message. Because the time is randomly calculated based on the distance between sender node and receiver node, a node chosen as a relay node is assured to have a minimal waiting time, even though it is not located at the border of radio transmission range. The proposed emergency warning message broadcast protocol has low network traffic because it does not need to exchange control messages for message broadcasting. In addition, it can reduce End-to-End delay under circumstances of low node density and short transmission range in VANET.