• Title/Summary/Keyword: Paths

Search Result 3,522, Processing Time 0.035 seconds

A Study on a new Algorithm for K Shortest Paths Problem (복수 최단 경로의 새로운 해법에 관한 연구)

  • Chang, Byung-Man
    • Korean Management Science Review
    • /
    • v.25 no.2
    • /
    • pp.81-88
    • /
    • 2008
  • This paper presents a new algorithm for the K shortest paths problem in a 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 until the $K^{th}-1$ path of the set is obtained. The computational results for networks with about 1,000,000 nodes and 2,700,000 arcs show that this algorithm can be applied to a problem of generating the detouring paths in the metropolitan traffic networks.

Tool-path Generation for a Robotic Skull Drilling System (로봇을 이용한 두개골 천공 시스템의 공구 경로 생성)

  • Chung, YunChan
    • Korean Journal of Computational Design and Engineering
    • /
    • v.18 no.4
    • /
    • pp.243-249
    • /
    • 2013
  • This paper presents a tool-path generation methods for an automated robotic system for skull drilling, which is performed to access to some neurosurgical interventions. The path controls of the robotic system are classified as move, probe, cut, and poke motions. The four motions are the basic motion elements of the tool-paths to make a hole on a skull. Probing, rough cutting and fine cutting paths are generated for skull drilling. For the rough cutting path circular paths are projected on the offset surfaces of the outer top and the inner bottom surfaces of the skull. The projected paths become the paths on the top and bottom layers of the rough cutting paths. The two projected paths are blended for the paths on the other layers. Syntax of the motion commands for a file format is also suggested for the tool-paths. Implementation and simulation results show that the possibility of the proposed methods.

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

  • Chang, Byung-Man
    • Korean Management Science Review
    • /
    • v.15 no.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

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

  • 장병만
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.26 no.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

Determination of the Shortest Transportation Path in Wartime (전시 최단수송경로 선정)

  • Yun Jong-Ok;Ha Seok-Tae
    • Journal of the military operations research society of Korea
    • /
    • v.17 no.2
    • /
    • pp.72-89
    • /
    • 1991
  • In transportation network problems, it is often desirable to select multiple number of the shortect paths. On problems of finding these paths, algorithms have been developed to choose single shortest path, k-shortest paths and k-shortest paths via p-specified nodes in a network. These problems consider the time as the main factor. In wartime, we must consider availability as well as time to determine the shortest transportation path, since we must take into account enemy's threat. Therefore, this paper addresses the problem of finding the shortest transportation path considering both time and availability. To accomplish the objective of this study, values of k-shortest paths are computed using the algorithm for finding the k-shortest paths. Then availabilties of those paths are computed through simulation considering factors such as rates of suffering attack, damage and repair rates of the paths. An optimal path is selected using any one of the four decision rules that combine the value and availability of a path.

  • PDF

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

  • Chang ByungMan
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2002.05a
    • /
    • pp.8-14
    • /
    • 2002
  • This article presents a new algorithm for the K Shortest Paths Problem which develops initial K shortest paths, and repeal to expose hidden shortest paths with dual approach and to replace the longest path in the present K paths. The initial solution which comprises K shortest paths among shortest paths to traverse each arc 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, one inward arc of this crossing node, which has minimum detouring distance, is chosen, and a new 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. This algorithm, requires worst case time complexity of $O(Kn^2),\;and\;O(n^2)$ in the case $K{\leq}3$.

  • PDF

A Study on the K Shortest Paths Algorithm in a Transportation Network (Using Ordered Heap Tree) (교통망 분석에서 K경로탐색 알고리즘에 관한 연구(Ordered Heap Tree 구축방식을 중심으로))

  • Im, Gang-Won;Yang, Seung-Muk;Shin, Seong-Il
    • Journal of Korean Society of Transportation
    • /
    • v.23 no.8 s.86
    • /
    • pp.113-128
    • /
    • 2005
  • We propose a modified version of 'a Lazy Version of Eppstein's k shortest paths Algorithm(LVEA)' which can find the k shortest paths in total time O(m+ n log n+ K log K) in the worst-case. The algorithm we propose, since the Link repeated paths are all eliminated when enumerating k shortest paths, is No link repeated paths algorithm that is suitable in a transportation network.

ON ROGERS-RAMANUJAN TYPE IDENTITIES FOR OVERPARTITIONS AND GENERALIZED LATTICE PATHS

  • Goyal, Megha
    • Bulletin of the Korean Mathematical Society
    • /
    • v.55 no.2
    • /
    • pp.449-467
    • /
    • 2018
  • In this paper we introduce and study the lattice paths for which the horizontal step is allowed at height $h{\geq}0$, $h{\in}{\mathbb{Z}}$. By doing so these paths generalize the heavily studied weighted lattice paths that consist of horizontal steps allowed at height zero only. Six q-series identities of Rogers-Ramanujan type are studied combinatorially using these generalized lattice paths. The results are further extended by using (n + t)-color overpartitions. Finally, we will establish that there are certain equinumerous families of (n + t)-color overpartitions and the generalized lattice paths.

ENUMERATION OF FUSS-CATALAN PATHS BY TYPE AND BLOCKS

  • An, Suhyung;Jung, JiYoon;Kim, Sangwook
    • Honam Mathematical Journal
    • /
    • v.43 no.4
    • /
    • pp.641-653
    • /
    • 2021
  • Armstrong enumerated the number of Fuss-Catalan paths with a given type and Rhoades provided the number of Dyck paths with a given type and a given number of blocks. In this paper we generalize those results to enumerate the number of Fuss-Catalan paths with a fixed type and a fixed number of blocks. We provide two proofs of this result. The first one uses the Chung-Feller theorem and a certain polynomial, while the second one is bijective. Also, we give a conjecture generalizing this result to the family of small Fuss-Schröder paths.

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

  • Chang, Byung-Man
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2006.11a
    • /
    • 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