• Title/Summary/Keyword: Route-Finding

Search Result 171, Processing Time 0.027 seconds

A Route Search of Urban Traffic Network using Fuzzy Non-Additive Control (퍼지 비가법 제어를 이용한 도시 교통망의 경로 탐색)

  • 이상훈;김성환
    • Journal of Korean Society of Transportation
    • /
    • v.21 no.1
    • /
    • pp.103-113
    • /
    • 2003
  • This paper shows alternative route search and preference route search for the traffic route search, and proposes the use of the fuzzy non-additive controller by the application of AHP(analytic hierarchy process). It is different from classical route search and notices thinking method of human. Appraisal element, weight of route is extracted from basic of the opinion gathering for the driving expert and example of route model was used for the finding of practice utility. Model evaluation was performed attribute membership function making of estimate element, estimate value setting, weight define by the AHP, non additive presentation of weight according to $\lambda$-fuzzy measure and Choquet fuzzy integral. Finally, alternative route search was possible to real time traffic route search for the well variable traffic environment, and preference route search showed reflection of traffic route search disposition for the driver individual. This paper has five important meaning. (1)The approach is similar to the driver's route selection decision process. (2)The approach is able to control of route appraisal criteria for the multiple attribute. (3)The approach makes subjective judgement objective by a non additive. (4)The approach shows dynamic route search for the alternative route search. (5)The approach is able to consider characteristics of individual drivers attributed for the preference route search.

THE DEVELOPMENT OF THE SILK ROAD: THE POSTAL RELAY ROUTE OF MONGOL AND GORYEO

  • KIM, TSCHUNG-SUN
    • Acta Via Serica
    • /
    • v.1 no.1
    • /
    • pp.105-117
    • /
    • 2016
  • The Silk Road named by Ferdinand von Richthofen was not designated as a specific route. A lot of East-West trade routes had already existed across the continent and the geographical scope and definition of the Silk Road is still expanding. In particular, the claim that the Eastern end of the Silk Road reaches Gyeongju is an example of this expansion. Burial treasures from tombs on the Korean Peninsula have already been identified as products from the Sassanian Dynasty of Persia, and various archaeological and epical evidences support this finding. However, the specific route where these exchanges were made, around the 6th-8th centuries, has yet to be identified. Maritime as well as inland routes can easily be hypothesized. The Silk Road was largely activated by the Yam postal system with the expansion of the Mongol Empire. It not only served as an effective pathway for the Yuan to rule over the Goryeo, but also connected the Eastern end of the Silk Road to Gyeongju. This can explain the situation since the 13th century. Therefore, this paper claims that the Yeokcham system had been operating on the Korean Peninsula since the Unified Silla Kingdom, the previous period of Goryeo, or perhaps even before then. The Yeokcham should thus be regarded as a prototype of the Mongolian Yam, and the Korean peninsula should be recognized as another route which contributed specifically to the development of the Silk Road, not just as a user or a beneficiary.

A Study on Developing Navigation for a Moving Destination Target

  • Jang, Eun-Gyeom;Lee, Won Joo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.9
    • /
    • pp.65-72
    • /
    • 2016
  • Vehicle and marine navigation which are currently being commercialized provide route guidance service by specifying a fixed position as a destination. In the route guidance service of existing navigation, if the destination has to be changed in the middle, a new destination must be designated again to obtain the navigation service. However, if the destination can't be designated, it is difficult to clearly use it. In this paper, in order to overcome the difficulties of directions in the existing navigation, a new navigation specifying moving targets as the destination has been developed to get the directions. A proposed system is that a group is made and a group manager is appointed as a destination and then a user can get the route guidance based on location of the group manager. In the service way, relationship between the group manager and user is one-to-many and relationship between the user and group manager is one-to-one. The proposed technology is able to provide services that the user can easily find the moving targets such as the positioning surrogate drivers, tracking routes and location among travelers and finding children.

A Node-Disjoint Multi-Path Routing Protocol in AODV-based Mobile Ad-hoc Networks (AODV 기반 모바일 Ad-hoc 네트워크의 노드 Disjoint 다중경로 라우팅 프로토콜)

  • Kim, Tae-Hun;Chung, Shang-Hwa;Kang, Su-Young;Yoo, Young-Hwan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.12B
    • /
    • pp.1371-1379
    • /
    • 2009
  • In this paper, we propose a new multi-path routing protocol to provide reliable and stable data transmission in MANET that is composed of high-mobility nodes. The new multi-path routing establishes the main route by the mechanism based on AODV, and then finds the backup route that node-disjoint from the main route by making add nodes in the main route not participate in it. The data transmission starts immediately after finding the main route. And the backup route search process is taking place while data is transmitted to reduce the transmission delay. When either of the main route or the backup route is broken, data is transmitted continuously through the other route and the broken route is recovered to node-disjoint route by the route maintenance process. The result of the simulation based on the Qualnet simulator shows that the backup route exists 62.5% of the time when the main route is broken. And proposed routing protocol improved the packet transmission rate by 2~3% and reduced the end-to-end delay by 10% compared with AODV and AODV-Local Repair.

On Finding a Convenient Path in the Hierarchical Road Network

  • Sung, Ki-Seok;Park, Chan-Kyoo;Lee, Sang-Wook;Doh, Seung-Yong;Park, Soon-Dal
    • Management Science and Financial Engineering
    • /
    • v.12 no.2
    • /
    • pp.87-110
    • /
    • 2006
  • In a hierarchical road network, all roads can be classified according to their attributes such as speed limit, number of lanes, etc. By splitting the whole road network into the subnetworks of the highlevel and low-level roads, we can reduce the size of the network to be calculated at once, and find a path in the way that drivers usually adopt when searching out a travel route. To exploit the hierarchical property of road networks, we define a convenient path and propose an algorithm for finding convenient paths. We introduce a parameter indicating the driver's tolerance to the difference between the length of a convenient path and that of a shortest convenient path. From this parameter, we can determine how far we have to search for the entering and exiting gateway. We also propose some techniques for reducing the number of pairs of entries and exits to be searched in a road network. A result of the computational experiment on a real road network is given to show the efficiency of the proposed algorithm.

Finding the One-to-One Optimum Path Considering User's Route Perception Characteristics of Origin and Destination (Focused on the Origin-Based Formulation and Algorithm) (출발지와 도착지의 경로인지특성을 반영한 One-to-One 최적경로탐색 (출발지기반 수식 및 알고리즘을 중심으로))

  • Shin, Seong-Il;Sohn, Kee-Min;Cho, Chong-Suk;Cho, Tcheol-Woong;Kim, Won-Keun
    • Journal of Korean Society of Transportation
    • /
    • v.23 no.7 s.85
    • /
    • pp.99-110
    • /
    • 2005
  • Total travel cost of route which connects origin with destination (O-D) is consist of the total sum of link travel cost and route perception cost. If the link perception cost is different according to the origin and destination, optimal route search has limitation to reflect the actual condition by route enumeration problem. The purpose of this study is to propose optimal route searching formulation and algorithm which is enable to reflect different link perception cost by each route, not only avoid the enumeration problem between origin and destination. This method defines minimum unit of route as a link and finally compares routes using link unit costs. The proposed method considers the perception travel cost at both origin and destination in optimal route searching process, while conventional models refect the perception cost only at origin. However this two-way searching algorithm is still not able to guarantee optimum solution. To overcome this problem, this study proposed an orign based optimal route searching method which was developed based on destination based optimal perception route tree. This study investigates whether proposed numerical formulas and algorithms are able to reflect route perception behavior reflected the feature of origin and destination in a real traffic network by the example research including the diversity of route information for the surrounding area and the perception cost for the road hierarchy.

A Study on Backup Route Setup Scheme in Ad Hoc Networks (애드혹 네트워크에서의 보조 경로 설정 기법에 관한 연구)

  • Jung Se-Won;Lee Chae-Woo
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.8 s.350
    • /
    • pp.47-58
    • /
    • 2006
  • Due to the movement of nodes, ad-hoc networks suffer from the problems such as the decrease of data delivery ratio, the increase of end-to-end delay, and the increase of routing overhead. The backup routing schemes try to solve these problems by finding the backup routes during the route discovery phase and using them when a route fails. Generally the backup routing schemes outperform the single-path routing schemes in terms of data delivery ratio, end-to-end delay, and routing overhead when the nodes move rapidly. But when the nodes don't move rapidly, the backup routing schemes generate more routing traffics than the single-path routing schemes because they need to exchange packets to find the backup route. In addition, when the backup route fails earlier than the main route, it can not use the backup route because in many backup route algorithms, the backup route is found only at the initial route discovery phase. RBR(Reactive Backup Routing Algorithm) proposed in this paper is an algorithm that provides more stable data delivery than the previous backup routing schemes through the selective maintenance of backup route and the backup route rediscovery. To do that RBR prioritize the backup routes, and maintain and use them selectively Thus it can also decrease the routing overheads. Also, RBR can increase data delivery ratio and decrease delay because it reestablishes the backup route when the network topology changes. For the performance evaluation, OPNET simulator is used to compare RBR with the single-path routing scheme and some of the well known backup routing schemes.

A Study on Finding the K Shortest Paths for the Multimodal Public Transportation Network in the Seoul Metropolitan (수도권 복합 대중교통망의 복수 대안 경로 탐색 알고리즘 고찰)

  • Park, Jong-Hoon;Sohn, Moo-Sung;Oh, Suk-Mun;Min, Jae-Hong
    • Proceedings of the KSR Conference
    • /
    • 2011.10a
    • /
    • pp.607-613
    • /
    • 2011
  • This paper reviews search methods of multiple reasonable paths to implement multimodal public transportation network of Seoul. Such a large scale multimodal public transportation network as Seoul, the computation time of path finding algorithm is a key and the result of path should reflect route choice behavior of public transportation passengers. Search method of alternative path is divided by removing path method and deviation path method. It analyzes previous researches based on the complexity of algorithm for large-scale network. Applying path finding algorithm in public transportation network, transfer and loop constraints must be included to be able to reflect real behavior. It constructs the generalized cost function based on the smart card data to reflect travel behavior of public transportation. To validate the availability of algorithm, experiments conducted with Seoul metropolitan public multimodal transportation network consisted with 22,109 nodes and 215,859 links by using the deviation path method, suitable for large-scale network.

  • PDF

The Study on Pharmacokinetics According to the Administration Route (흡수경로에 따른 약물동태학적 고찰)

  • Park, Min-Cheol;Kim, Hwan-Yeong;Jo, Eun-Hee
    • The Journal of Korean Medicine Ophthalmology and Otolaryngology and Dermatology
    • /
    • v.22 no.3
    • /
    • pp.95-107
    • /
    • 2009
  • Objective : The purpose of this study is to search for more effective administraion route of herbal medicine. Methods : Pharmacokinetic issues with the methods in experimental papers, which deal with finding the effectiveness of two or more administration routes of herbal medicine, searched from KERIS, KSI, KISTI and KTKP, have been analyzed by, first, categorizing the papers and comparing the validity of administration routes. Results and Conclusions : 1. Upon comparing in total of 24 papers on the basis of each administration route, per oral(PO)-herbal acupuncture(HA) was most superior in terms of number in that there were 13 cases and PO-per rectal(PR) was next superior in that there were 5 cases. PO-per dermal(PD)-inhalation therapy(IT), PO-IT and PO-PR-HA had 3, 2 and 1 cases respectively. 2. Out of the total 24 papers which compares different administration routes, 16 of them were pharmacokinetically appropriate, whereas, the remaining 8 were pharmacokinetically inappropriate. 3. Comparisons were made between PO-HA, PO-PR, PO-IT, PO-PD-IT and PO-PR-HA routes. However, none of them was not particularly effective regardless of the administered medicine or target organ. 4. No route was particularly effective against a particular drug target as a result of comparing damaged liver, asthma, endometriosis and anti-inflammation. 5. In the case of Injinhotang in medicine comparison, HA tended to be more associated with hepatotoxicity over PO. However, Cordyceps Militaris Mycelia, Gagamsohaphyangwon and Hongdeungtang showed no prominent effective administration route.

  • PDF

An Longitudinal Analysis of Changing Beliefs on the Use in IT Educatee by Elaboration Likelihood Model (정교화 가능성 모형에 의한 IT 피교육자 신용 믿음 변화의 종단분석)

  • Lee, Woong-Kyu
    • Asia pacific journal of information systems
    • /
    • v.18 no.3
    • /
    • pp.147-165
    • /
    • 2008
  • IT education can be summarized as persuading the educatee to accept IT. The persuasion is made by delivering the messages for how-to-use and where-to-use to the educatee, which leads formulation of a belief structure for using IT. Therefore, message based persuasion theory, as well as IT acceptance theories such as technology acceptance model(TAM), would play a very important role for explaining IT education. According to elaboration likelihood model(ELM) that has been considered as one of the most influential persuasion theories, people change attitude or perception by two routes, central route and peripheral route. In central route, people would think critically about issue-related arguments in an informational message. In peripheral route, subjects rely on cues regarding the target behavior with less cognitive efforts. Moreover, such persuasion process is not a one-shot program but continuous repetition with feedbacks, which leads to changing a belief structure for using IT. An educatee would get more knowledge and experiences of using IT as following an education program, and be more dependent on a central route than a peripheral route. Such change would reformulate a belief structure which is different from the intial one. The objectives of this study are the following two: First, an identification of the relationship between ELM and belief structures for using IT. Especially, we analyze the effects of message interpretation through both of central and peripheral routes on perceived usefulness which is an important explaining variable in TAM and perceived use control which have perceived ease of use and perceived controllability as sub-dimensions. Second, a longitudinal analysis of the above effects. In other words, change of the relationship between interpretation of message delivered by IT education and beliefs of IT using is analyzed longitudinally. For achievement of our objectives, we suggest a research model, which is constructed as three-layered. While first layer has a dependent variable, use intention, second one has perceived usefulness and perceived use control that has two sub-concepts, perceived ease of use and perceived controllability. Finally, third one is related with two routes in ELM, source credibility and argument quality which are operationalization of peripheral route and central route respectively. By these variables, we suggest five hypotheses. In addition to relationship among variables, we suggest two additional hypotheses, moderation effects of time in the relationships between perceived usefulness and two routes. That is, source credibility's influence on perceived usefulness is decreased as time flows, and argument quality's influence is increased. For validation of it, our research model is tested empirically. With measurements which have been validated in the other studies, we survey students in an Excel class two times for longitudinal analysis. Data Analysis is done by partial least square(PLS), which is known as an appropriate approach for multi-group comparison analysis with a small sized sample as like this study. In result. all hypotheses are statistically supported. One of theoretical contributions in this study is an analysis of IT education based on ELM and TAM which are considered as important theories in psychology and IS theories respectively. A longitudinal analysis by comparison between two surveys based on PLS is also considered as a methodological contribution. In practice, finding the importance of peripheral route in early stage of IT education should be notable.