• Title/Summary/Keyword: Route Information

Search Result 1,822, Processing Time 0.03 seconds

Development of Near Optimal Simulation Technique for the Postal Routing Decision (우편물 운송 경로설정을 위한 준 최적화 시뮬레이션 기술 개발)

  • 김의창
    • Proceedings of the Korea Association of Information Systems Conference
    • /
    • 2000.11a
    • /
    • pp.45-63
    • /
    • 2000
  • Facing in very repidly changing environments via information technologies, we need to study and develop new information technologies in postal delivery service in Korea. We study to find the near optimal route for the better postal service between the collection centers. Optimal routing decision for the postal delivery is NP-Hard. The main purpose of this paper is to develop the near optimal simulation technique for the postal routing decision. We consider the distance between collection centers, and the quantity of post articles in the collection center to obtain the near optimal route. We use the heuristic algorithm to obtain the near optimal solution for the transportation route of postal articles. Also, we try to show the transportation route by using the map after deciding the near optimal route.

  • PDF

A Study for Technique of Detecting the Real-time Route Aberrance in the Passage Route Using Ship's Domain Theory

  • Gang, Sang-Guen
    • Journal of the Korean Society of Marine Environment & Safety
    • /
    • v.23 no.3
    • /
    • pp.273-278
    • /
    • 2017
  • This paper is to study a technique to detect the real-time route aberrance on the passage route using bumper area of the ship domain theory. In order to evaluate the risk of route aberrance, a quarter line was created between the center line and the outer line, and a passage route with the image line outside the outer line was designed. It calculated the real-time route aberrance with the vessel bumper area to measure the risk level on the passage route. The route aberrance using overlap bumper area was simulated through three kinds of scenario vessel at the designed passage route. In this paper, we proposed Ratio to Aberrance Risk as one of the evaluation parameter to detect the route aberrance risk at each sector in the passage route and to give the evaluation criteria of 5 levels for seafarer's navigation safety. The purpose of this work is to provide the information of the route aberrance to seafarer automatically, to make it possible to prevent the human errors of seafarer on the high risk aberrance route. As the real-time risk of route aberrance on the passage route is automatically evaluated, it was well thought that seafarer can have only a little workload in order to know the risk of route aberrance at early-time. Following the further development of this work, the techniques for detecting the real-time route aberrance will be able to use the unmanned vessel.

A Performance Analysis of Routing Protocols Avoiding Route breakages in Ad hoc Networks (애드 흑 네트워크에서 경로 손실 회피 라우팅 프로토콜의 성능평가)

  • Wu Mary;Jung Sang Joon;Jung Youngseok;Kim Chonggun
    • Journal of KIISE:Information Networking
    • /
    • v.33 no.1
    • /
    • pp.49-58
    • /
    • 2006
  • When the movement of a node breaks the route in ad-hoc network, on-demand routing protocol performs the local route recovery or a new route search for the route maintenance. And when it performs the new route search or the local search, the packet which is transmitted can be delayed. There are ARMP and RPAODV as the methods reducing the delay resulted from the route-breakage. They predict the route-breakage and construct an alterative local route before the occurrence of the route-breakage. When the link state is unstable, the success rate of the alternative local route that can avoid the route-breakage can give a direct effect on the route-breakage and the transmission delay, To estimate the performance of routing protocols avoiding route-breakage, we suggest the numerical formulas of AODV, the representative on-demand routing protocol, and ARMP, RPAODV. To verify the efficiency and accuracy of the proposed numerical formulas, we analysis and compare with the results of the computer simulation and that of the numerical formulas.

The Influence of Traffic Information based on VMS(Variable Message Sign) on the Selection of Drivers' Route (VMS(Variable Message Sign)를 통한 교통정보 제공이 운전자의 운행경로 전환에 미치는 영향 분석)

  • Jung, Hun Young;Son, Su Ran;Lee, Jeong Ho
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.31 no.2D
    • /
    • pp.193-201
    • /
    • 2011
  • The provision of traffic information plays an important role in increasing social benefit not only by saving travel time for individuals but also by improving the efficiency of road operation. VMS(Variable Message Sign) helps on-wheel drivers easily understand the road situation, and also provides real-time traffic information to people on the streets. However, it has not been sufficiently studied on how traffic information based on VMS influences on the drivers' selection of route. This study investigated how drivers use VMS traffic information and how they are satisfied with it. Then, the model of drivers' route selection was specified with the types of traffic information and the expected travel time to examine the influence on the selection of drivers' route. The model was estimated and analyzed in three types according to the condition of detour roads, and the rate of route change and the degree of sensitivity was calculated from the estimation. The results of analysis are as follows. the $1^{st}$ type model showed the 10% of route change for the travel time saving of 5minutes, and the 81.6% of route change for the travel time saving of 20minutes. The $2^{nd}$ type led to the range of route change from 14.2% to 92.7% over the 5 through 20 minutes of travel time saving. The $3^{rd}$ model resulted in the 99.1% of route change. The sensitivity of route change showed the highest for the travel time saving of 11 minutes with the $1^{st}$ type model, 9 minutes with the $2^{nd}$ type model, and 5 minutes with the $3^{rd}$ type model respectively.

Efficient Route Determination Technique in LBS System

  • Kim, Sung-Soo;Kim, Kwang-Soo;Kim, Jae-Chul;Lee, Jong-Hun
    • Proceedings of the KSRS Conference
    • /
    • 2003.11a
    • /
    • pp.843-845
    • /
    • 2003
  • Shortest Path Problems are among the most studied network flow optimization problems, with interesting applications in various fields. One such field is the route determination service, where various kinds of shortest path problems need to be solved in location-based service. Our research aim is to propose a route technique in real-time locationbased service (LBS) environments according to user’s route preferences such as shortest, fastest, easiest and so on. Turn costs modeling and computation are important procedures in route planning. There are major two kinds of cost parameters in route planning. One is static cost parameter which can be pre-computed such as distance and number of traffic-lane. The other is dynamic cost parameter which can be computed in run-time such as number of turns and risk of congestion. In this paper, we propose a new cost modeling method for turn costs which are traditionally attached to edges in a graph. Our proposed route determination technique also has an advantage that can provide service interoperability by implementing XML web service for the OpenLS route determination service specification. In addition to, describing the details of our shortest path algorithms, we present a location-based service system by using proposed routing algorithms.

  • PDF

A New Route Guidance Method Considering Pedestrian Level of Service using Multi-Criteria Decision Making Technique

  • Joo, Yong-Jin;Kim, Soo-Ho
    • Spatial Information Research
    • /
    • v.19 no.1
    • /
    • pp.83-91
    • /
    • 2011
  • The route finding analysis is an essential geo-related decision support tool in a LBS(Location based Services) and previous researches related to route guidance have been mainly focused on route guidances for vehicles. However, due to the recent spread of personal computing devices such as PDA, PMP and smart phone, route guidance for pedestrians have been increasingly in demand. The pedestrian route guidance is different from vehicle route guidance because pedestrians are affected more surrounding environment than vehicles. Therefore, pedestrian path finding needs considerations of factors affecting walking. This paper aimed to extract factors affecting walking and charting the factors for application factors affecting walking to pedestrian path finding. In this paper, we found various factors about environment of road for pedestrian and extract the factors affecting walking. Factors affecting walking consist of 4 categories traffic, sidewalk, network, safety facility. We calculated weights about each factor using analytic hierarchy process (AHP). Based on weights we calculated scores about each factor's attribute. The weight is maximum score of factor. These scores of factor are used to optimal pedestrian path finding as path finding cost with distance, accessibility.

Dynamic Reverse Route for On-Demand Routing Protocol in MANET

  • Zuhairi, Megat;Zafar, Haseeb;Harle, David
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.5
    • /
    • pp.1354-1372
    • /
    • 2012
  • Route establishment in Mobile Ad Hoc Network (MANET) is the key mechanism to a successful connection between a pair of source and destination nodes. An efficient routing protocol constructs routing path with minimal time, less routing overhead and capable of utilizing all possible link connectivity. In general, most on-demand MANET routing protocols operates over symmetrical and bidirectional routing path, which is infeasible due to the inherent heterogeneous properties of wireless devices. Simulation results show that the presence of unidirectional links on a network severely affect the performance of a routing protocol. In this paper, a robust protocol independent scheme is proposed, which enable immediate rediscovery of alternative route for a path blocked by a unidirectional link. The proposed scheme is efficient; route rediscovery is locally computed, which results in significant minimization of multiple route packets flooding. Nodes may exploit route information of immediate neighbors using the local reply broadcast technique, which then redirect the control packets around the unidirectional links, therefore maintaining the end-to-end bidirectional connection. The proposed scheme along with Ad Hoc On-demand Distance Vector (AODV) and AODV-Blacklist routing protocol is investigated over three types of mobility models. Simulation results show that the proposed scheme is extremely reliable under poor network conditions and the route connectivity can be improved by as much as 75%.

Route Lookup Algorithm in IXP1200 Network Processor (IXP1200 Network Processor에서의 Route Lookup Algorithm에 관한 연구)

  • 정영환;박우진;황광섭;배국동;안순신
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2002.04a
    • /
    • pp.472-474
    • /
    • 2002
  • 최근 동영상, 음성 등 멀티미디어 트래픽의 급속한 증가로 네트웍에서 요구되는 전송률은 점점 증가될 전망이다. 이에 따라 라우터도 요구되는 전송률에 대처해 나가기 위해 고속화 되어가고 있다. 이러한 고속 라우터 개발을 가능하게 하는 여러가지 Route Lookup 알고리즘들이 연구되어 왔다. 본 논문에서는 효율적인 Lookup 알고리즘의 원리와 여러 가지 Lookup 알고리즘들에 대해서 알아보고 IXP1200 Network Processor를 이용한 포워딩 엔진 개발에 있어서 사용된 Route Lookup알고리즘을 분석하여 그 효율성에 대해서 연구해 본다.

  • PDF

Servicing Photographs for Route Guidance in Navigation Systems

  • Sung Kyung Bok;Yoo Jae Jun
    • Proceedings of the KSRS Conference
    • /
    • 2004.10a
    • /
    • pp.72-76
    • /
    • 2004
  • For successful route guidance, navigation systems should provide to users more realistic and actual information such as photographs than those in either 2-dimensional and 3-dimensional models. In this paper, we propose a method for servicing photographs for route guidance in navigation systems. The method includes how to acquire photographs with the most successful view for the guidance, how to construct link information among them and navigational map data, and how to provide the images to users efficiently.

  • PDF

Linkage of GSIS and Expert System for Route Selection (노선선정을 위한 GSIS와 전문가체계의 연계)

  • 이형석;배상호;강준묵
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.19 no.2
    • /
    • pp.137-146
    • /
    • 2001
  • Route selection needs the analysis function of GSIS to analyze and manipulate a lot of spatial information efficiently. Therefore, it needs the linkage of system requiring the knowledge and the experience of experts as a method that can estimate each quantitative route for an efficient route selection. In this study, the route selection model through construction and analysis procedure of position information using GSIS were presented, and route selection system linked with expert system was developed. This system is easy to be used and managed for presenting route alignment according to conditions as a graphic user interface environmental window system by applying three tiers based object-oriented method. Using GSIS, the various information required for route selections in database was constructed, the characteristics of subject area by executing three-dimensional terrain analysis was grasped effectively, and the control point through buffering, overlay and location operation was extracted. Three alternative routes between a beginning point and an end point inputted by route selection system were selected. Therefore, the applications of the route selection system are presented by applying this system to the real study area.

  • PDF