• 대한전기학회논문지:시스템및제어부문D
• /
• 제51권3호
• /
• pp.100-107
• /
• 2002

In this paper, we propose an expert system for electronic interlocking which enhances the safty, efficiency and expanability of the existing system by designing real-time interlocking control based on the interlocking table automatically generated using artificial intelligence approach. The expert system consists of two parts; an interlocking table generation part and a real-time interlocking control part. The former generates automatically the interlocking relationship of all possible routes by searching dynamically the station topology which is obtained from station database. On the other hand, the latter controls the status of station facilities in real-time by applying the generated interlocking relationship to the signal facilities such as signal devices, points, track circuits for a given route. The expert system is implemented in C language which is suitable to implement the interlocking table generation part using the dynamic memory allocation technique. Finally, the effectiveness of the expert system is proved by simulating for the typical station model.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.149.2-149
• /
• 2001

In this paper, we present an agent-based transportation routing method in a semi-conductor production line. The main characteristic of the proposed method is that each AGV agent individually searches candidates of its route with reference of the pheromone information based on the use of an analogy of Ant System. The proposed method is applied to several routing problems. The performances of the proposed method are compared with those of a Genetic Algorithm. The effectiveness of the proposed method is conrmed by many numerical examples. In order to demonstrate the effectiveness of the proposed method for an actual problem, the proposed method is applied to a dynamic motion planning. The proposed method ...

• Structural Engineering and Mechanics
• /
• 제65권4호
• /
• pp.359-368
• /
• 2018

Dynamic analysis of complex and large structures may be costly from a numerical point of view. For coupled vibroacoustic finite element models, the importance of reducing the size becomes obvious because the fluid degrees of freedom must be added to the structural ones. In this paper, a component mode synthesis method is proposed for large vibroacoustic interaction problems. This method couples fluid subdomains and dynamical substructuring of Craig and Bampton type. The acoustic formulation is written in terms of the velocity potential, which implies several advantages: coupled algebraic systems remain symmetric, and a potential formulation allows a direct extension of Craig and Bampton's method to acoustics. Those properties make the proposed method easy to implement in an existing finite element code because the local numerical treatment of substructures and fluid subdomains is undifferentiated. Test cases are then presented for axisymmetric geometries. Numerical results tend to prove the validity and the efficiency of the proposed method.

• 물과 미래
• /
• 제18권3호
• /
• pp.265-270
• /
• 1985

The prediction of a design-flood hydrograph at a particular site on a river may be based on the derivation of discharge or stage hydrograph at an upstream section, togeater with a method to route this hydrograph along the rest of river. On the other hand, flood routing methods provide a useful tool for the analysis of flooding in all but the smaller catchment, and these methods are largely stored into hydrological method and hydraulic method. Although the Muskingum Method as a hydrological method ignores dynamic effects on the flood wave, Muskingum-Cunge Method based on hydraulic method is possible to improve the method so that it gives a good approximation to the solution of the linear convective-diffusion equation. This is made on the basis of the finite diffeience equation for the Muskingum Method. In the study, the outflows predicted by Muskingum-Cunge Method are campared with the observed outflows of the Pyung Chang River.

• 대한교통학회지
• /
• 제13권1호
• /
• pp.95-110
• /
• 1995

n this research neural -based model was developed to forecast link travel times , And it is also compared wiht other time series forecasting models such as Box-Jenkins model, Kalman filter model. These models are validated to evaluate the accuracy of models with real time series data gathered by the license plate method. Neural network's convergency and generalization were investigated by modifying learning rate, momentum term and the number of hidden layer units. Through this experiment, the optimum configuration of the nerual network architecture was determined. Optimumlearining rate, momentum term and the number of hidden layer units hsow 0.3, 0.5, 13 respectively. It may be applied to DRGS(dynamic route guidance system) with a minor modification. The methods are suggested at the condlusion of this paper, And there is no doubt that this neural -based model can be applied to many other itme series forecating problem such as populationforecasting vehicel volume forecasting et .

• Journal of Communications and Networks
• /
• 제5권3호
• /
• pp.202-214
• /
• 2003

The central challenge in the design of ad-hoc networks is the development of dynamic routing protocol that efficiently finds route between mobile nodes. Several routing protocols such as DSR, AODV and DSDV have been proposed in the literature to facilitate communication in such dynamically changing network topology. In this paper, a Node Transition Probability (NTP) based routing algorithm, which determines stable routes using the received power from all other neighboring nodes is proposed. NTP based routing algorithm is designed and implemented using Global Mobile Simulator (GloMoSim), a scalable network simulator. The performance of this routing algorithm is studied for various mobility models and throughput, control overhead, average end-to-end delay, and percentage of packet dropped are compared with the existing routing protocols. This algorithm shows acceptable performance under all mobility conditions. The results show that this algorithm maximizes the bandwidth utilization during heavy traffic with lesser overhead.

• 대한교통학회:학술대회논문집
• /
• 대한교통학회 1998년도 Proceedings 제34회 추계 학술발표회
• /
• pp.41-41
• /
• 1998

ITS틀 내의 한 분야인 도로교통정보체계 (ATIS: Advanced Traveler Information system)는 실시간 교통정보를 운전자에게 직접 제공하는 것으로서, 이를 위해 매 순간마다 가로망에 배정되는 교통량 및 통행시간을 예측할 수 있는 범용의 동적 통행배정모형(dynamic route choice model)의 개발이 필히 수반되어야 한다. 본 연구에서는 ITS사업에서 필수적으로 수반되어야 할 최적 제어이론에 의한 동적 통행 배정모형을 ATIS의 핵심 소프트웨어로 응용하기 위해 기존 연구성과를 발판으로, 순간 동적 통행 배정모형(Ran, Boyce &LeBlanc, 1993)의 통행제약조건인 링크통행함수, 특히, 과부하 시 엘켈릭의 일반식의 파라메터를 조정, 적용하여, 서울시 강남지역의 실제 가로망의 사례연구를 통해 지체식의 각각의 파라메터에 따른 결과를 O/D에 따른 통행시간, 링크통행시간, 혼잡도를 중심으로 비교 평가하여, ATIS의 핵심 소프트웨어로서 순간 동적 통행배정을 통해 보다 현실여건을 잘 반영할 수 있는 링크 통행 성능 함수를 도출하였다.

• 한국국방경영분석학회지
• /
• 제18권2호
• /
• pp.66-95
• /
• 1992

Shortest paths are one of the simplest and most widely used concepts in deterministic networks. A decison of troops movement route can be analyzed in the network with a shortest path algorithm. But in reality, the value of arcs can not be determined in the network by crisp numbers due to imprecision or fuzziness in parameters. To account for this reason, a fuzzy network should be considered. A fuzzy shortest path can be modeled by general fuzzy mathematical programming and solved by fuzzy dynamic programming. It can be formulated by the fuzzy network with lingustic variables and solved by the Klein algorithm. This paper focuses on a revised fuzzy shortest path algorithm and an application is discussed.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -3
• /
• pp.1839-1842
• /
• 2002

Ad hoc networks are characterized by multi- hop wireless connectivity, frequently changing network topology and the need for efficient dynamic routing protocols. In this paper, we proposed a new technique to adjust the zone radius by concentrating the changes of network traffic in a particular direction, which we refer to as AZRP. We demonstrate that even though ZRP and AZRP share a similar hybrid routing behavior, the differences in the protocol mechanics can lead to significant performance differentials. We discuss the algorithm and report on the performance of AZRP scheme, and compare it to the ZRP routing protocol. Our results indicate clearly that AZRP outperforms ZRP by reducing significantly the number of route query messages. And thereby increases the efficiency of the network load.

• 산업공학
• /
• 제22권4호
• /
• pp.359-367
• /
• 2009

The vehicle travel time between the demand points in downtown area is greatly influenced by complex road condition and traffic situation that change real time to various external environments. Most of research in the vehicle routing problems compose vehicle routes only considering travel distance and average vehicle speed between the demand points, however did not consider dynamic external environments such as traffic situation by service time zones. A realistic vehicle routing problem which considers traffic situation of smooth, delaying, and stagnating by three service time zones such as going to work, afternoon, and going home was suggested in this study. A mathematical programming model was suggested and it gives an optimal solution when using ILOG CPLEX. A hybrid genetic algorithm was also suggested to chooses a vehicle route considering traffic situation to minimize the total travel time. By comparing the result considering the traffic situation, the suggested algorithm gives better solution than existing algorithms.