• Title/Summary/Keyword: Route Search Method

Search Result 81, Processing Time 0.026 seconds

Development of Destination Optimal Path Search Method Using Multi-Criteria Decision Making Method and Modified A-STAR Algorithm (다기준의사결정기법과 수정 A-STAR 알고리즘을 이용한 목적지 최적경로 탐색 기법 개발)

  • Choi, Mi-Hyeong;Seo, Min-Ho;Woo, Je-Seung;Hong, Sun-Gi
    • Journal of the Korean Society of Industry Convergence
    • /
    • v.24 no.6_2
    • /
    • pp.891-897
    • /
    • 2021
  • In this paper, we propose a destination optimal route algorithm for providing route finding service for the transportation handicapped by using the multi-criteria decision-making technique and the modified A-STAR optimal route search algorithm. This is a method to set the route to the destination centering on safety by replacing the distance cost of the existing A-STAR optimal route search algorithm with the safety cost calculated through AHP/TOPSIS analysis. To this end, 10 factors such as road damage, curb, and road hole were first classified as poor road factors that hinder road driving, and then pairwise comparison of AHP was analyzed and then defined as the weight of TOPSIS. Afterwards, the degree of driving safety was quantified for a certain road section in Busan through TOPSIS analysis, and the development of an optimal route search algorithm for the transportation handicapped that replaces the distance cost with safety in the finally modified A-STAR optimal route algorithm was completed.

A Coarse Grid Method for the Real-Time Route Search in a Large Network (복잡한 대규모의 도로망에서 실시간 경로 탐색을 위한 단계별 세분화 방법)

  • Kim, Seong-In;Kim, Hyun-Gi
    • Journal of Korean Society of Transportation
    • /
    • v.22 no.5
    • /
    • pp.61-73
    • /
    • 2004
  • The efficiency of the real-time route guidance system(RGS) depends largely on the quality of route search algorithms. In this paper, we implement the coarse grid method(CGM) in mathematical programming for finding a good quality route of real-time RGS in large-scale networks. The proposed CGM examines coarser and wider networks as the search phase proceeds, in stead of searching the whole network at once. Naturally, we can significantly reduce computational efforts in terms of search time and memory requirement. We demonstrate the practical effectiveness of the proposed CGM with nationwide real road network simulation.

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.

DYNAMIC ROUTE PLANNING BY Q-LEARNING -Cellular Automation Based Simulator and Control

  • Sano, Masaki;Jung, Si
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.24.2-24
    • /
    • 2001
  • In this paper, the authors present a row dynamic route planning by Q-learning. The proposed algorithm is executed in a cellular automation based traffic simulator, which is also newly created. In Vehicle Information and Communication System(VICS), which is an active field of Intelligent Transport System(ITS), information of traffic congestion is sent to each vehicle at real time. However, a centralized navigation system is not realistic to guide millions of vehicles in a megalopolis. Autonomous distributed systems should be more flexible and scalable, and also have a chance to focus on each vehicles demand. In such systems, each vehicle can search an own optimal route. We employ Q-learning of the reinforcement learning method to search an optimal or sub-optimal route, in which route drivers can avoid traffic congestions. We find some applications of the reinforcement learning in the "static" environment, but there are ...

  • PDF

A Neighborhood Beam Search Algorithm for Routing Yard-Side Equipment in Port Container Terminals (컨테이너 터미널에서 야드장비의 경로결정을 위한 이웃에 대한 빔 탐색 방식)

  • 김기영;김갑환
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 1998.10a
    • /
    • pp.315-322
    • /
    • 1998
  • It is discussed how to route yard-side equipment during the loading operation in port container terminals. The number of containers to be picked up at each yard-bay, as well as the route of a yard-side equipment (for example, transfer crane or straddle carrier) in a yard, are determined. The objective of the problem is to minimize the total container handling time in the yard. An encoding method to represent nodes in the search space is introduced utilizing inherent properties of the optimal solution by which the search space is greatly reduced. A beam search algorithm is suggested. A numerical experiment is carried out to compared the performance of the beam search algorithm with those of other approaches.

  • PDF

3D PASSAGE NAVIGATION UNDER UNKNOWN ENVIRONMENTS BASED ON DISTANCE FIELD SPACE MODEL

  • Nagata, Yoshitaka;Murai, Yasuyuki;Tsuji, Hiroyuki;Tokumasu, Shinji
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2003.09a
    • /
    • pp.500-503
    • /
    • 2003
  • The navigation problem of robot is one of the main themes to deal with conficts or interferences between obstacles and the robot itself In this case, while the robot avoids obstacles on the space, the passage route should be determined efficiently. In order to solve problems above, we have come up with the distance field space medel (DFM) and then, under known environment, we have presented the distance field A algorithm for passage route path search. In this research, the method of performing the 3-dimensional passage route path search of robot under unknown environment is proposed. It is shown that the authors can build the distance search model the does not need space division by taking into account of sensor information to a distance field space model, and constructing this information as virtual obstacle information.

  • PDF

Improved Route Search Method Through the Operation Process of the Genetic Algorithm (유전 알고리즘의 연산처리를 통한 개선된 경로 탐색 기법)

  • Ji, Hong-il;Seo, Chang-jin
    • The Transactions of the Korean Institute of Electrical Engineers P
    • /
    • v.64 no.4
    • /
    • pp.315-320
    • /
    • 2015
  • Proposal algorithm in this paper introduced cells, units of router group, for distributed processing of previous genetic algorithm. This paper presented ways to reduce search delay time of overall network through cell-based genetic algorithm. As a result of performance analysis comparing with existing genetic algorithm through experiments, the proposal algorithm was verified superior in terms of costs and delay time. Furthermore, time for routing an alternative path was reduced in proposal algorithm, in case that a network was damaged in existing optimal path algorithm, Dijkstra algorithm, and the proposal algorithm was designed to route an alternative path faster than Dijkstra algorithm, as it has a 2nd shortest path in cells of the damaged network. The study showed that the proposal algorithm can support routing of alternative path, if Dijkstra algorithm is damaged in a network.

A Geometrical Center based Two-way Search Heuristic Algorithm for Vehicle Routing Problem with Pickups and Deliveries

  • Shin, Kwang-Cheol
    • Journal of Information Processing Systems
    • /
    • v.5 no.4
    • /
    • pp.237-242
    • /
    • 2009
  • The classical vehicle routing problem (VRP) can be extended by including customers who want to send goods to the depot. This type of VRP is called the vehicle routing problem with pickups and deliveries (VRPPD). This study proposes a novel way to solve VRPPD by introducing a two-phase heuristic routing algorithm which consists of a clustering phase and uses the geometrical center of a cluster and route establishment phase by applying a two-way search of each route after applying the TSP algorithm on each route. Experimental results show that the suggested algorithm can generate better initial solutions for more computer-intensive meta-heuristics than other existing methods such as the giant-tour-based partitioning method or the insertion-based method.

Determination of flight route using optimal control theory (최적 제어 이론을 사용한 비행 경로 선정)

  • 김을곤
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1992.10a
    • /
    • pp.407-411
    • /
    • 1992
  • A method for optimal route planning is presented with the assumption that the overall defended area is known in terms of threat potential function. This approach employes tangent plane to reduce the dimension of the state space for optimal programming problems with a state equality constraint. One-dimensional search algorithm is used to select the optimal route among the extermal fields which are obtained by integrating three differential equations from the initial values. In addition to being useful for the route planning through threat potential area, the trajectory planning will be suitable for general two-dimensional searching problems.

  • PDF

Strategies for the Automatic Decision of Railway Shunting Routes Based on the Heuristic Search Method (휴리스틱 탐색기법에 근거한 철도입환진로의 자동결정전략 설계)

  • Ko Yun-Seok
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.52 no.5
    • /
    • pp.283-289
    • /
    • 2003
  • This paper proposes an expert system which can determine automatically the shunting routes corresponding to the given shunting works by considering totally the train operating environments in the station. The expert system proposes the multiple shunting routes with priority of selection based on heuristic search strategy. Accordingly, system operator can select a shunting route with the safety and efficiency among the those shunting routes. The expert system consists of a main inference engine and a sub inference engine. The main inference engine determines the shunting routes with selection priority using the segment routes obtained from the sub inference engine. The heuristic rules are extracted from operating knowledges of the veteran route operator and station topology. It is implemented in C computer language for the purpose of the implementation of the inference engine using the dynamic memory allocation technique. And, the validity of the builted expert system is proved by a test case for the model station.