• Title/Summary/Keyword: the optimal route

Search Result 476, Processing Time 0.03 seconds

Case Study on Deciding a Time for Repairing Asphalt Pavement of Incheon International Airport (인천국제공항 아스팔트 포장 보수시기 결정 사례 연구)

  • Lee, Jae-Ho;Kim, Jang-Rack;Mun, Hyung-Chul;Cho, Nam-Hyun
    • International Journal of Highway Engineering
    • /
    • v.15 no.6
    • /
    • pp.49-60
    • /
    • 2013
  • PURPOSES : The evaluation of the pavement condition of the asphalt concrete pavement of No. 2 runway of Inchon International Airport through PMS, a supporting system for making a decision of pavement, maintenance and repair, was made, and the proper time for repair according to the PCI reduction rate was suggested. METHODS : By comparing and analyzing the evaluation results of pavements built in 2009, 2010, 2011, PCI change in each facility (No. 2 runway, C parallel taxiway, connection taxiway) was calculated. By applying the calculated change to PCI deduction rate model, the pavement condition of the target sections was estimated, and then the necessary section and time for repair were chosen. RESULTS : After careful consideration of the time for pavement and maintenance, based on the result of PCI prediction, it was estimated that the southern takeoff and landing section of No. 2 runway was required to be repaired in 2012; connection taxiway in 2013; and C parallel taxiway in 2014; however, the section which is the main moving route of connection taxiway and C parallel taxiway was needed to be repaired in 2012. CONCLUSIONS : For maintenance and repair of airport pavements, the optimal alternative should be chosen by considering economics and operability, via examining the time for repair and the aspect of management all together on the basis of this study.

MDP Modeling for the Prediction of Agent Movement in Limited Space (폐쇄공간에서의 에이전트 행동 예측을 위한 MDP 모델)

  • Jin, Hyowon;Kim, Suhwan;Jung, Chijung;Lee, Moongul
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.40 no.3
    • /
    • pp.63-72
    • /
    • 2015
  • This paper presents the issue that is predicting the movement of an agent in an enclosed space by using the MDP (Markov Decision Process). Recent researches on the optimal path finding are confined to derive the shortest path with the use of deterministic algorithm such as $A^*$ or Dijkstra. On the other hand, this study focuses in predicting the path that the agent chooses to escape the limited space as time passes, with the stochastic method. The MDP reward structure from GIS (Geographic Information System) data contributed this model to a feasible model. This model has been approved to have the high predictability after applied to the route of previous armed red guerilla.

Development of 3D Car Navigation System Using Image-based Virtual Environment (실사기반 가상환경기술을 이용한 차량용 3차원 네비게이션 시스템 개발)

  • Kim Chang-Hyun;Lee Wan-Bok
    • Journal of Game and Entertainment
    • /
    • v.2 no.1
    • /
    • pp.35-44
    • /
    • 2006
  • Objective of this study is to develop a 3D car navigation system that shows the driving direction to a destination through real-time 3-D panoramic views of the route. For the purpose, a new searching process was established to find the optimal driving direction based on the driver's current location and the real-time traffic situation and the TIP (tour into the picture) method was extended to implement a wide virtual environment. A virtual environment was built up by applying the extended TIP method to the panoramic images taken at a constant distance from a real road, and then, displayed 3-D navigation as clear as the real images. The car navigation system developed in this study provides the optimal driving direction and real-time traffic situation using 2-D navigation module and 3D navigation module.

  • PDF

An Optimal Multicast Routing Protocol for Guaranting Host Mobility in IPv6-Based Mobile Networks (IPv6 기반 이동망에서 호스트 이동성 보장을 위한 최적화된 멀티캐스트 라우팅 프로토콜)

  • 양승제;강명규;박성한
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.41 no.5
    • /
    • pp.1-9
    • /
    • 2004
  • In this paper, we propose a multicast routing protocol for the seamless delivery of multicast data to mobile hosts through the optimal route in IPv6-Based mobile networks. The proposed multicast routing protocol reduces the tree reconstruction overhead by limiting the tunneling length according to the mobility of mobile hosts. In this way, our protocol satisfies the bound of the end-to-end delay and supports the seamless handoff. Analytical and simulation results show that the proposed protocol has better performance in terms of the tree reconstruction, tunneling service and multicast packet loss than the previous protocols does.

Channel Routing Model for Streamflow Forecasting (유출예측을 위한 하도추적 모형)

  • 지홍기;박기호
    • Water for future
    • /
    • v.27 no.1
    • /
    • pp.141-150
    • /
    • 1994
  • The purpose of this study is develope the algorithm of channel routing model which can be used for flood forecasting. In routing model, the hydrulic technique of the implicit scheme in the dynamic equation is chosen to route the unsteady varied flow. The channel routing model is connected with conceptual watershed model which is able to compute the flood hydrograph from each subbasin. The comparative study shows that the conceptual model can simulate the watershed runoff accurately. As a result of investigating the channel routing model, the optimal weighting factor $\theta$ which fixes two points between time line is selected. And also, the optimal error tolerance which satisfies computing time and converge of solution is chosen.

  • PDF

Analysis of Optimized Aggregation Timing in Wireless Sensor Networks

  • Lee, Dong-Wook;Kim, Jai-Hoon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.3 no.2
    • /
    • pp.209-218
    • /
    • 2009
  • In a wireless sensor network(WSN) each sensor node deals with numerous sensing data elements. For the sake of energy efficiency and network lifetime, sensing data must be handled effectively. A technique used for this is data aggregation. Sending/receiving data involves numerous steps such as MAC layer control packet handshakes and route path setup, and these steps consume energy. Because these steps are involved in all data communication, the total cost increases are related to the counts of data sent/received. Therefore, many studies have proposed sending combined data, which is known as data aggregation. Very effective methods to aggregate sensing data have been suggested, but there is no means of deciding how long the sensor node should wait for aggregation. This is a very important issue, because the wait time affects the total communication cost and data reliability. There are two types of data aggregation; the data counting method and the time waiting method. However, each has weaknesses in terms of the delay. A hybrid method can be adopted to alleviate these problems. But, it cannot provide an optimal point of aggregation. In this paper, we suggest a stochastic-based data aggregation scheme, which provides the cost(in terms of communication and delay) optimal aggregation point. We present numerical analysis and results.

Development of An Optimal Routes Selection Model Considering Price Characteristics of Agricultural Products (농산물의 가격특성을 고려한 최적경로 선정모델 개발)

  • Suh, Kyo;Lee, Jeong-Jae;Huh, Yoo-Man;Kim, Han-Joong;Yi, Ho-Jae
    • Journal of The Korean Society of Agricultural Engineers
    • /
    • v.46 no.1
    • /
    • pp.121-131
    • /
    • 2004
  • Transportation and logistics of agricultural products have been one of the major interests of many researches. Most of researches have been limited to presuming these as a first dimensional process or considering only economic value of agricultural products at each stage of logistics. However, the particular characteristics of agricultural products, such as quality change during transportation or extensively scattered origins, require examining these problems as a whole system. Network model has been adopted to represent nodes, which stand for spatial location of demand and supply of agricultural products, and communication between these nodes. Based on network theory and advanced marketing potential function, an optimal routes selection model is developed. The model employed network simplex method for routes optimization. The application of the model focused on transportation network organization to reflect different market prices for different locations and resulted in optimum routes and profit improvement of the applied agricultural product.

Development of Optimal Number of Bus-stops Estimation Model Based on On-Off Patterns of Passengers (버스승객의 승하차 패턴을 고려한 최적 정류장 수 산정 모형 개발)

  • Gang, Ju-Ran;Go, Seung-Yeong
    • Journal of Korean Society of Transportation
    • /
    • v.24 no.1 s.87
    • /
    • pp.97-108
    • /
    • 2006
  • At present, Korean many cities depend on subjective judgements of experts to estimate the number of bus-stops and inter-stop space. To get reliable results by using more objective procedure, we search for old studies and models, but they don't concern alighting demands and a random demand distributions. Our study recognize and overcome these limitation. We devide the demand into boarding and alighting demands, and define the model that can estimate flexibly optimal number of bus-stop and inter-stop space on each segment by the demand distribution. Also we apply this new model to a simple example route having various demand distributions As a result, the number of bus-stop on each segment can be estimate flexibly in proportion to boarding or alighting demand by using this model.

A Carrier Preference and Location-based Routing Scheme(CPLR) at Multi-carrier Maritime Data Communications Networks (다중캐리어 해상데이터통신망에서 캐리어선호도와 위치기반 라우팅)

  • Son, Joo-Young
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.36 no.6
    • /
    • pp.823-829
    • /
    • 2012
  • Data communications networks at sea in the future can be modelled by overlapped MANET networks with Broadband Wireless Access carriers. A novel routing scheme (CPLR) is proposed in this paper, which finds out an optimal route by selecting an optimal carrier for each hop in routes based on carrier preferences of each application, and locations of ships as well. As distances between each ships and destination ships are considered in this scheme, routing can be done much faster. Performance is compared with that of the CPR (only Carrier Preference-based Routing Scheme), and it shows some improvements.

Vehicle Routing for Maximizing Interlibrary-Loan Requests under Time Constraints (상호대차 요청 도서 운송량 최대화를 위한 차량 이동 방법 연구)

  • Lim, Heejong;Lee, Sangbok;Park, Sungjae
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.51 no.2
    • /
    • pp.237-253
    • /
    • 2017
  • There are many systematic approaches to manage Interlibrary loan (ILL) efficiently. In this paper, we propose an operating method reducing user-waiting in ILL. Users are usually informed to wait around two to three days in a regional ILL service. The reason of the waiting is that there is inefficiency in running material-delivery vehicles. A mixed integer programming is employed to resolve this issue. It provides an optimal vehicle-route maximizing material-deliveries subject to time availability. We used an actual data of a regional ILL system to provide optimal vehicle routes under different time settings.