• 제목/요약/키워드: Shortest path problem

검색결과 242건 처리시간 0.027초

최단경로문제에서 k개의 치명호를 결정하는 유전알고리듬 (An Evolutionary Algorithm for Determining the k Most Vital Arcs in Shortest Path Problem)

  • 정호연
    • 한국국방경영분석학회지
    • /
    • 제26권2호
    • /
    • pp.120-130
    • /
    • 2000
  • The purpose of this study is to present a method for determining the k most vital arcs in shortest path problem using an evolutionary algorithm. The problem of finding the k most vital arcs in shortest path problem is to find a set of k arcs whose simultaneous removal from the network causes the greatest increase in the total length of shortest path. Generally, the problem determining the k most vital arcs in shortest path problem has known as NP-hard. Therefore, in order to deal with the problem of real world the heuristic algorithm is needed. In this study we propose to the method of finding the k most vital arcs in shortest path problem using an evolutionary algorithm which known as the most efficient algorithm among heuristics. The method presented in this study is developed using the library of the evolutionary algorithm framework and then the performance of algorithm is analyzed through the computer experiment.

  • PDF

Turn Penalty Algorithm for the Shortest Path Model with Fixed Charges

  • Choi, Seok-Cheol
    • 한국국방경영분석학회지
    • /
    • 제25권2호
    • /
    • pp.73-83
    • /
    • 1999
  • In this paper, we consider the shortest path network problem with fixed charges. A turn penalty algorithm for the shortest path problem with fixed charges or turn penalties is presented, which is using the next node comparison method. The algorithm described here is designed to determine the shortest route in the shortest path network problem including turn penalties. Additionally, the way to simplify the computation for the shortest path problem with turn penalties was pursued.

  • PDF

Development of evolutionary algorithm for determining the k most vital arcs in shortest path problem

  • Chung, Hoyeon;Shin, Dongju
    • 한국경영과학회:학술대회논문집
    • /
    • 한국경영과학회 2000년도 추계학술대회 및 정기총회
    • /
    • pp.113-116
    • /
    • 2000
  • The purpose of this study is to present a method for determining the k most vital arcs in shortest path problem using an evolutionary algorithm. The problem of finding the k most vital arcs in shortest path problem is to find a set of k arcs whose simultaneous removal from the network causes the greatest increase in the total length of shortest path. The problem determining the k most vital arcs in shortest path problem has known as NP-hard. Therefore, in order to deal with the problem of real world the heuristic algorithm is needed. In this study we propose to the method of finding the k-MVA in shortest path problem using an evolutionary algorithm which known as the most efficient algorithm among heuristics. For this, the expression method of individuals compatible with the characteristics of shortest path problem, the parameter values of constitution gene, size of the initial population, crossover rate and mutation rate etc. are specified and then the effective genetic algorithm will be proposed. The method presented in this study is developed using the library of the evolutionary algorithm framework (EAF) and then the performance of algorithm is analyzed through the computer experiment.

  • PDF

복수최단경로의 새로운 최적해법 (A New Algorithm for K Shortest Paths Problem)

  • 장병만
    • 한국경영과학회지
    • /
    • 제26권3호
    • /
    • pp.79-94
    • /
    • 2001
  • This paper presents a new algorithm for the K shortest paths Problem which develops initial K shortest paths, and repeat to expose hidden shortest paths with dual approach and to replace the longest path in the present K paths. The initial solution comprises K shortest paths among shortest paths to traverse each arc in a Double Shortest Arborescence which is made from bidirectional Dijkstra algorithm. When a crossing node that have two or more inward arcs is found at least three time by turns in this K shortest paths, there may be some hidden paths which are shorter than present k-th path. To expose a hidden shortest path, one inward arc of this crossing node is chose by means of minimum detouring distance calculated with dual variables, and then the hidden shortest path is exposed with joining a detouring subpath from source to this inward arc and a spur of a feasible path from this crossing node to sink. If this exposed path is shorter than the k-th path, the exposed path replaces the k-th path. This algorithm requires worst case time complexity of O(Kn$^2$), and O(n$^2$) in the case k$\leq$3.

  • PDF

최단경로문제의 사전처리 해법에 관한 연구 (An algorithm for the preprocessing shortest path problem)

  • 명영수
    • 경영과학
    • /
    • 제19권1호
    • /
    • pp.55-66
    • /
    • 2002
  • Given a directed network, a designated arc, and lowers and upper bounds for the distance of each arc, the preprocessing shortest path problem Is a decision problem that decides whether there is some choice of distance vector such that the distance of each arc honors the given lower and upper bound restriction, and such that the designated arc is on some shortest path from a source node to a destination notre with respect to the chosen distance vector. The preprocessing shortest path problem has many real world applications such as communication and transportation network management and the problem is known to be NP-complete. In this paper, we develop an algorithm that solves the problem using the structural properties of shortest paths.

AN OPTIMAL PARALLEL ALGORITHM FOR SOLVING ALL-PAIRS SHORTEST PATHS PROBLEM ON CIRCULAR-ARC GRAPHS

  • SAHA ANITA;PAL MADHUMANGAL;PAL TAPAN K.
    • Journal of applied mathematics & informatics
    • /
    • 제17권1_2_3호
    • /
    • pp.1-23
    • /
    • 2005
  • The shortest-paths problem is a fundamental problem in graph theory and finds diverse applications in various fields. This is why shortest path algorithms have been designed more thoroughly than any other algorithm in graph theory. A large number of optimization problems are mathematically equivalent to the problem of finding shortest paths in a graph. The shortest-path between a pair of vertices is defined as the path with shortest length between the pair of vertices. The shortest path from one vertex to another often gives the best way to route a message between the vertices. This paper presents an $O(n^2)$ time sequential algorithm and an $O(n^2/p+logn)$ time parallel algorithm on EREW PRAM model for solving all pairs shortest paths problem on circular-arc graphs, where p and n represent respectively the number of processors and the number of vertices of the circular-arc graph.

유방향의 복수 최단 우회 경로 새로운 해법 연구 (A Study on a New Algorithm for K Shortest Detour Path Problem in a Directed Network)

  • 장병만
    • 한국경영과학회:학술대회논문집
    • /
    • 한국경영과학회 2006년도 추계학술대회
    • /
    • pp.60-66
    • /
    • 2006
  • This paper presents a new algorithm for the K shortest path problem in a directed network. After a shortest path is produced with Dijkstra algorithm, detouring paths through inward arcs to every vertex of the shortest path are generated. A length of a detouring path is the sum of both the length of the inward arc and the difference between the shortest distance from the origin to the head vertex and that to the tail vertex. K-1 shorter paths are selected among the detouring paths and put into the set of K paths. Then detouring paths through inward arcs to every vertex of the second shortest path are generated. If there is a shorter path than the current Kth path in the set, this path is placed in the set and the Kth path is removed from the set, and the paths in the set is rearranged in the ascending order of lengths. This procedure of generating the detouring paths and rearranging the set is repeated for the K-1 st path of the set. This algorithm can be applied to a problem of generating the detouring paths in the navigation system for ITS and also for vehicle routing problems.

  • PDF

MODELS AND SOLUTION METHODS FOR SHORTEST PATHS IN A NETWORK WITH TIME-DEPENDENT FLOW SPEEDS

  • Sung, Ki-Seok;Bell, Michael G-H
    • Management Science and Financial Engineering
    • /
    • 제4권2호
    • /
    • pp.1-13
    • /
    • 1998
  • The Shortest Path Problem in Time-dependent Networks, where the travel time of each link depends on the time interval, is not realistic since the model and its solution violate the Non-passing Property (NPP:often referred to as FIFO) of real phenomena. Furthermore, solving the problem needs much more computational and memory complexity than the general shortest path problem. A new model for Time-dependent Networks where the flow speeds of each link depend on time interval, is suggested. The model is more realistic since its solution maintains the NPP. Solving the problem needs just a little more computational complexity, and the same memory complexity, as the general shortest path problem. A solution algorithm modified from Dijkstra's label setting algorithm is presented. We extend this model to the problem of Minimum Expected Time Path in Time-dependent Stochastic Networks where flow speeds of each link change statistically on each time interval. A solution method using the Kth-shortest Path algorithm is presented.

  • PDF

최단경로문제에서 k개의 치명호를 찾는 방법 (A Method for finding the k Most Vital Arcs in the Shortest Path Problem)

  • 안재근;정호연;박순달
    • 한국경영과학회지
    • /
    • 제23권4호
    • /
    • pp.11-20
    • /
    • 1998
  • This paper deals with a mathematical model and an algorithm for the problem of determining k most vital arcs in the shortest path problem. First, we propose a 0-1 integer programming model for finding k most vital arcs in shortest path problem given the ordered set of paths with cardinality q. Next, we also propose an algorithm for finding k most vital arcs ln the shortest path problem which uses the 0-1 Integer programming model and shortest path algorithm and maximum flow algorithms repeatedly Malik et al. proposed a non-polynomial algorithm to solve the problem, but their algorithm was contradicted by Bar-Noy et al. with a counter example to the algorithm in 1995. But using our algorithm. the exact solution can be found differently from the algorithm of Malik et al.

  • PDF

복수 최단 경로 문제의 새로운 해법 연구 (A Study on the New Algorithm for Shortest Paths Problem)

  • 장병만
    • 경영과학
    • /
    • 제15권2호
    • /
    • pp.229-237
    • /
    • 1998
  • This paper presents a new algorithm for the K Shortest Paths Problem which is developed with a Double Shortest Arborescence and an inward arc breaking method. A Double Shortest Arborescence is made from merging a forward shortest arborescence and a backward one with Dijkstra algorithm. and shows us information about each shorter path to traverse each arc. Then K shorter paths are selected in ascending order of the length of each short path to traverse each arc, and some paths of the K shorter paths need to be replaced with some hidden shorter paths in order to get the optimal paths. And if the cross nodes which have more than 2 inward arcs are found at least three times in K shorter path, the first inward arc of the shorter than the Kth shorter path, the exposed path replaces the Kth shorter path. This procedure is repeated until cross nodes are not found in K shorter paths, and then the K shortest paths problem is solved exactly. This algorithm are computed with complexity o($n^3$) and especially O($n^2$) in the case K=3.

  • PDF