• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2005년도 춘계학술대회 학술발표 논문집 제15권 제1호
• /
• pp.161-165
• /
• 2005

최적 교통 주기를 산출하기 위해서는 하위교차로에 대기차량이 얼마나 있는지를 점검해야 한다. 왜냐하면 대기차량이 상위교차로의 길이보다 크면 출발 지연 시간 및 승용차 대기시간이 발생하기 때문이다. 승용차 대기시간을 단축시키기 위해서 본 논문에서는 퍼지 신경망을 이용한 최적 연동 녹색시간 알고리즘을 제안한다. 컴퓨터 모의실험을 통해서, 서로 다른 교차로 조건을 고려하지 않은 고정 교통신호등 보다 평균 주행속도가 향상 된 것을 입증하였다.

• KIEAE Journal
• /
• 제14권4호
• /
• pp.27-33
• /
• 2014

This study analyzed the electric vehicle recharging station status with recharging time limitation due to long waiting time, and figured out the user status by user interviews. And then this study verified the validity of hypothesis in terms of environmental design perspective and suggested layout of recharging station model. 21 recharging stations in Korea and station operation cases of 7 countries were examined. Except for the USA, the reality of electric vehicle recharging station today is the 1st proving stage focusing on the infrastructure construction of electric vehicle recharging station. It focuses on performance of recharging facility, use efficiency and operation environment of electric vehicle. About the effective waiting time of the user to use it should be studied. The current conditions of recharging station are as follows: Lack of independent recharging space, lack of facility that reduces external effect of recharging space, and lack of lounge for users during the waiting time. These three are essential factors constructing a suggesting model after basic layout, which needs proper measurement on the long recharging time and long waiting time. The essential factors are applied to electric vehicle recharging station layout so that users might use 'digital refresh" i.e. lounge and information contents service during the waiting time which provides convenience of recharging and emotional space with users. Such upgrade recharging station environmental model might resolve the burden of long recharging time which may contribute to the popularization of electric vehicles.

• 대한산업공학회지
• /
• 제28권3호
• /
• pp.256-263
• /
• 2002

This paper addresses a planning problem in a pickup-delivery transportation' system under dynamic vehicle dispatching. We present a procedure to determine a fleet size in which stochastic characteristics of vehicle travels are considered. Statistical approach and queueing theory are applied to estimate vehicle travel time and vehicle waiting time, based on which an appropriate fleet size is determined. Simulation experiments are performed to verify the proposed procedure.

• 전자공학회논문지C
• /
• 제34C권8호
• /
• pp.88-100
• /
• 1997

This paper proposes a new concept for an optimal traffic signal cycle method which will reduce the average vehicle waiting time and improve average vehicle speed. Electro sensitive traffic system can extend the traffic cycle when there ar emany vehicles in the road or it can reduce the traffic consider vehicle length, so it can cause oveflow and reduce average vechicel waiting time at the intersection, we propose on optimal traffic cycle with fuzzy ruels and neural network. Computer simulation results prove that reducing the average vehicle waiting time which proposed considering passing vehicle's length for the optimal traffic cycle better than fixe dsignal method dosen't consider vehicle length.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제3권1호
• /
• pp.105-111
• /
• 2003

This paper is researching the storing of 40 different kinds of conditions. Such as, car speed, delay in starting time and the volume of cars in traffic. Through the use of a central nervous networking system or AI, using 10 different intersecting roads. We will improve the green traffic light. And allow more cars to easily flow through the intersections. Now days, with increasing many vehicles on restricted roads, the conventional traffic light creates prove startup-delay time and end-lag-time. The conventional traffic light loses the function of optimal cycle. And so, 30-45% of conventional traffic cycle is not matched to the present traffic cycle. In this paper proposes electro sensitive traffic light using fuzzy look up table method which will reduce the average vehicle waiting time and improve average vehicle speed. Computer simulation results prove that reducing the average vehicle waiting time which proposed considering passing vehicle length for optimal traffic cycle is better than fixed signal method which dosen't consider vehicle length.

• 한국지능시스템학회논문지
• /
• 제10권4호
• /
• pp.330-337
• /
• 2000

본 논문은 10개 교차로를 연동제어를 할 수 있는 새로운 교통체제 개념을 제안한다. 예를 들어서 오늘 야구경기가 8시경에 열린다고 하면 야구경기가 시작하기 전 1 시간 혹은 1시간 혹은 1시간 30분전에 교통량이 증가할 것이다. 이럴 때에는 아무리 우수한 전자 신호등 시스템도 최적녹색시간을 예측할 수 없다. 그러므로, 본 논문에서는 평균 승용차 대기시간을 최소화하고 평균 주행속도를 향상하기 위해서 퍼지규칙 및 신경망을 이용한다. 모의실험결과 제안된 연동 녹색시간이 연동 녹색 시간을 고려하지 않은 전자신호등보다 평균 승용차 대기시간을 줄일 수 있음을 입증했다.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2001년도 추계학술대회 논문집
• /
• pp.279-282
• /
• 2001

This paper is concerned with Vehicle Routing Problem to minimize the total delivery waiting time of customers. The delivery waiting time is the time taken to travel from the depot to the customer, which is important for the delivery of the perishing products or foods requiring freshness. We construct a mixed integer linear programming formulation of this problem, and CR(Clustering first Routing second) heuristic and SPH(set partitioning heuristic) are suggested. the results of computational experiments showed that these heuristics find successfully favorable solutions, in much shorter time than optimal.

• KEPCO Journal on Electric Power and Energy
• /
• 제6권1호
• /
• pp.59-64
• /
• 2020

Scheduling of electric vehicles and optimizing for charging waiting time have been critical. Meanwhile, it is challengeable to exploit the fluctuating data from electric vehicles in real-time. We introduce an optimal routing algorithm and a simulator with electric vehicles obeying the Poisson distribution of the observed information about time, space and energy-demand. Electric vehicle routing is updated in every cycle even it is already set. Also, we suggest an electric vehicle routing algorithm for minimizing total trip time, considering a threshold of the waiting time. Total trip time and charging waiting time are decreased 34.3% and 86.4% respectively, compared to the previous algorithm. It can be applied to the information service of charging stations and utilized as a reservation service.

• 대한산업공학회지
• /
• 제22권3호
• /
• pp.313-324
• /
• 1996

A new policy to determine the waiting position of an idle Automated Guided Vehicle(AGV) is proposed and its performance is compared with the existing waiting position policies. Unlike the existing policies, the queue length in the input buffer is considered in the new policy. As a result, the waiting position based on the new policy depends on the status of the system. The simulation result indicates that the proposed policy reduces the waiting time in both the input and the output buffers significantly, regardless of the number of AGVs in the system. Therefore, the manufacturing lead time can be minimized.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1998년도 The Third Asian Fuzzy Systems Symposium
• /
• pp.591-595
• /
• 1998

This paper proposes a new concept of optimal shortest path algorithm which reduce average vehicle wating time and improve average vehicle speed, Electro sensitive traffic system can extend the traffic cycle when three are many vehicles on the road or it can reduce the traffic cycle when there are small vehicles on the road. But electro sensitive traffic light system doesn't control that kind of function when the average vehicle speed is 10km -20km. Therefore, in this paper to reduce vehicle waiting time we developed design of traffic cycle software tool that can arrive destinination as soon as possible using optimal shortest pass algorithm. Computer simulation result proved 10%-32% reducing average vehicle wating time and average vehicle speed which can select shortest route using built in G.P.S. vehicle is better than not being able to select shortest route function.