• 제목/요약/키워드: Route Selection Method

검색결과 87건 처리시간 0.032초

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

  • 이형석;배상호;강준묵
    • 한국측량학회지
    • /
    • 제19권2호
    • /
    • pp.137-146
    • /
    • 2001
  • 도로의 노선선정에 필요한 지형공간정보의 분석 및 처리에 따른 효율성을 증진시키기 위해서는 지형공간정보체계의 분석기능이 필요하다. 또한 합리적인 노선 선정을 위해서는 각 노선을 정량적으로 평가할 수 있는 기법으로 전문가의 지식과 경험을 필요로 하는 체계의 연계성이 이루어져야 한다. 본 연구에서는 지형공간정보체계의 위치정보 구축과 분석과정을 통한 노선선정모형을 제시하고 전문가 체계를 연계한 노선선정체계를 개발하였다. 개발한 체계는 세 단계 계층 기반의 객체지향기법을 적용한 도형 사용자 접속 환경의 윈도우용 체계로서 조건에 따른 노선선형을 제시할 수 있도록 사용과 유지관리를 손쉽게 하였다. 지형공간정보체계를 이용하여 노선선정에 필요한 다양한 정보를 데이터베이스에 구축하고 3차원 지형 분석을 실시하여 대상지역의 특성을 효과적으로 파악하였으며, 영향권 및 중첩 분석과 위치정보연산을 통해 통제지역을 추출하였다. 노선선정체계를 통해 입력된 시종점간에 3개의 비교노선을 선정할 수 있었다. 따라서 본 개발 체계를 실제 대상지역에 적용하여 구체적인 비교 평가를 시도함으로써 노선선정체계의 적용 가능성을 입증하고자 하였다.

  • PDF

Evaluation of GIS-supported Route Selection Method of Hillside Transportation in Nagasaki City, Japan

  • Watanabe, Kohei;Gotoh, Keinosuke;Tachiiri, Kaoru
    • 대한원격탐사학회:학술대회논문집
    • /
    • 대한원격탐사학회 2003년도 Proceedings of ACRS 2003 ISRS
    • /
    • pp.543-545
    • /
    • 2003
  • In this study, the authors evaluate the suitability of the candidate routes selected by the route selection method, which is developed by the authors, by combination of Geographic Information Systems (GIS) and Analytic Hierarchy Process. To evaluate the suitability of the candidate routes, from the viewpoint of the residents, we have considered element factors such as, population, household, aging situation, elevation, gradient, housing density and the Control Point. The results of this study are expected to assess the suitability of the candidate routes of the hillside transportation for the residents and examine the application limit of the route selection method.

  • PDF

Acoustic Signal based Optimal Route Selection Problem: Performance Comparison of Multi-Attribute Decision Making methods

  • Borkar, Prashant;Sarode, M.V.;Malik, L. G.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권2호
    • /
    • pp.647-669
    • /
    • 2016
  • Multiple attribute for decision making including user preference will increase the complexity of route selection process. Various approaches have been proposed to solve the optimal route selection problem. In this paper, multi attribute decision making (MADM) algorithms such as Simple Additive Weighting (SAW), Weighted Product Method (WPM), Analytic Hierarchy Process (AHP) method and Total Order Preference by Similarity to the Ideal Solution (TOPSIS) methods have been proposed for acoustic signature based optimal route selection to facilitate user with better quality of service. The traffic density state conditions (very low, low, below medium, medium, above medium, high and very high) on the road segment is the occurrence and mixture weightings of traffic noise signals (Tyre, Engine, Air Turbulence, Exhaust, and Honks etc) is considered as one of the attribute in decision making process. The short-term spectral envelope features of the cumulative acoustic signals are extracted using Mel-Frequency Cepstral Coefficients (MFCC) and Adaptive Neuro-Fuzzy Classifier (ANFC) is used to model seven traffic density states. Simple point method and AHP has been used for calculation of weights of decision parameters. Numerical results show that WPM, AHP and TOPSIS provide similar performance.

An Effective Route Selection Scheme with Considering Traffic Density in VANET

  • An, Do-Sik;Cho, Gi-Hwan
    • Journal of information and communication convergence engineering
    • /
    • 제8권6호
    • /
    • pp.623-629
    • /
    • 2010
  • A geographical routing protocol is typically utilized for a route selection of VANET. Even if it is conceptually well adapted into VANET, message delivery tends to be unreliable with frequent network partitions, which mainly come from the inherent characteristics such as high mobility and irregular traffic density. In this paper, we deal with a method to enable reliable message delivery with reflecting the traffic density on routing decision. By concatenating the message delivery cost of each of inbetween junction section, $1^{st}$ and $2^{nd}$ shortest paths are initially determined. When it is not possible to deliver the message on a junction on the 1st path, we utilize two novel ideas, that is, letting the message stay on the junction to find out a new relay node, and putting a replicated copy to reach via a detour path. By using the NS-2 network simulator, our method has been examined in terms of message delivery rate and delay. It shows that our method is much efficient than the other method in the low density environment, while it brings similar results in the high density environment.

Intelligent recommendation method of intelligent tourism scenic spot route based on collaborative filtering

  • Liu Hui
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제18권5호
    • /
    • pp.1260-1272
    • /
    • 2024
  • This paper tackles the prevalent challenges faced by existing tourism route recommendation methods, including data sparsity, cold start, and low accuracy. To address these issues, a novel intelligent tourism route recommendation method based on collaborative filtering is introduced. The proposed method incorporates a series of key steps. Firstly, it calculates the interest level of users by analyzing the item attribute rating values. By leveraging this information, the method can effectively capture the preferences and interests of users. Additionally, a user attribute rating matrix is constructed by extracting implicit user behavior preferences, providing a comprehensive understanding of user preferences. Recognizing that user interests can evolve over time, a weight function is introduced to account for the possibility of interest shifting during product use. This weight function enhances the accuracy of recommendations by adapting to the changing preferences of users, improving the overall quality of the suggested tourism routes. The results demonstrate the significant advantages of the approach. Specifically, the proposed method successfully alleviates the problem of data sparsity, enhances neighbor selection, and generates tourism route recommendations that exhibit higher accuracy compared to existing methods.

최적 철도 노선 선정을 위한 VE/LCC 평가 모델 개발 (Development of VE/LCC Evaluation Model for Railway Route Selection)

  • 이동욱;이태식
    • 한국철도학회논문집
    • /
    • 제7권3호
    • /
    • pp.215-222
    • /
    • 2004
  • Optimal route selection of railway should take consideration of the function of the railway, topography, practicability of construction and management as well as the cost. This study performed the surveys for experts and surrounding industries and the review for the bid guidelines in order to develop the quality model with the AHP method and establish the weight for each factor. Six quality models were developed for such as the efficiency of railway operation, structure design and practicability, economic feasibility, correspondence with other plans, civil appeal and environmental sustainability, and correspondence with system. The detailed evaluation elements were also derived by each factors.

작업장 특성을 고려한 가공경로선정 문제의 유전알고리즘 접근 (-Machining Route Selection with the Shop Flow Information Using Genetic Algorithm-)

  • 이규용;문치웅;김재균
    • 산업경영시스템학회지
    • /
    • 제23권54호
    • /
    • pp.13-26
    • /
    • 2000
  • Machining route selection to produce parts should be based on shop flow information because of input data at scheduling tasks and is one of the main problem in process planning. This paper addresses the problem of machining route selection in multi-stage process with machine group included a similar function. The model proposed is formulated as 0-1 integer programing considering the relation of parts and machine table size, avaliable time of each machine for planning period, and delivery date. The objective of the model is to minimize the sum of processing, transportation, and setup time for all parts. Genetic algorithm approach is developed to solve this model. The efficiency of the approach is examined in comparison with the method of branch and bound technique for the same problem. Also, this paper is to solve large problem scale and provide it if the multiple machining routes are existed an optimal solution.

  • PDF

Energy Efficiency Enhancement of TICK -based Fuzzy Logic for Selecting Forwarding Nodes in WSNs

  • Ashraf, Muhammad;Cho, Tae Ho
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권9호
    • /
    • pp.4271-4294
    • /
    • 2018
  • Communication cost is the most important factor in Wireless Sensor Networks (WSNs), as exchanging control keying messages consumes a large amount of energy from the constituent sensor nodes. Time-based Dynamic Keying and En-Route Filtering (TICK) can reduce the communication costs by utilizing local time values of the en-route nodes to generate one-time dynamic keys that are used to encrypt reports in a manner that further avoids the regular keying or re-keying of messages. Although TICK is more energy efficient, it employs no re-encryption operation strategy that cannot determine whether a healthy report might be considered as malicious if the clock drift between the source node and the forwarding node is too large. Secure SOurce-BAsed Loose Synchronization (SOBAS) employs a selective encryption en-route in which fixed nodes are selected to re-encrypt the data. Therefore, the selection of encryption nodes is non-adaptive, and the dynamic network conditions (i.e., The residual energy of en-route nodes, hop count, and false positive rate) are also not focused in SOBAS. We propose an energy efficient selection of re-encryption nodes based on fuzzy logic. Simulation results indicate that the proposed method achieves better energy conservation at the en-route nodes along the path when compared to TICK and SOBAS.

DHT 기반 피어-투-피어 시스템을 위한 적응적 근접경로 선택기법 (An Adaptive Proximity Route Selection Method in DHT-Based Peer-to-Peer Systems)

  • 송지영;한세영;박성용
    • 정보처리학회논문지A
    • /
    • 제13A권1호
    • /
    • pp.11-18
    • /
    • 2006
  • 다양한 네트워크로 구성된 인터넷 환경에서 오버레이 홉 수를 최소화하는 Chord를 비롯한 기존의 분산 해싱 테이블 기반의 피어-투-피어 시스템에서는 목적 노드까지의 실질적인 질의 라우팅 시간을 줄일 수 없다. 따라서 제안하는 적응적 근접경로 선택기법에서 각 노드는 라우팅테이블의 엔트리 노드 중 지연시간을 최소로 하는 노드를 선택하여 질의 메시지를 전달하도록 한다. 이를 위하여 각 엔트리의 목적지까지의 지연시간을 큐 라우팅 알고리듬과 지수적 최근-가중치 평균을 이용해 예측하여 검색 테이블로 저장하고, 노드들 간 메시지 전달 시 이 정보를 교환하여 추가 부하 없이 검색 테이블에 반영한다. 시뮬레이션을 통해 제안하는 기법이 전채 검색 시간과 흡 간 지연시간에 있어서 근접성을 고려하지 않은 Chord나 CFS의 서버 선택 알고리즘에 비해 월등히 좋은 성능을 보임을 확인할 수 있다.

Real-Time Application의 효과적인 QoS 라우팅을 위한 적응적 Route 선택 강화 방법 (Reinforcement Method to Enhance Adaptive Route Search for Efficient Real-Time Application Specific QoS Routing)

  • Oh, Jae-Seuk;Bae, Sung-Il;Ahn, Jin-Ho;Sungh Kang
    • 대한전자공학회논문지TC
    • /
    • 제40권12호
    • /
    • pp.71-82
    • /
    • 2003
  • 본 논문은 real-time 어플리케이션들을 위한 보나 효과적이고 효율적으로 ant-like mobile agent들이 QoS metrics를 고려하여 네트워크상에서 목적지까지 가장 최적화된 route을 찾는 Ant 알고리듬을 바탕으로 한 QoS 라우팅 알고리듬에서의 route 선택 강화 계산방법을 제시한다. 시뮬레이션 결과 본 논문에서 제시하는 방법이 기존의 방법보다 delay jitter와 bandwidth를 우선으로 하는 real-time application에 대한 가장 최적화된 route을 보다 효과적이고 보다 네트워크 환경에 적응적으로 찾아내는 것을 확인하였다.