• Title/Summary/Keyword: Path Management

Search Result 1,704, Processing Time 0.025 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.

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

The Effects of Small Manufacturers' Characteristics on Management Performance by Using Self-efficiency, Network and Collaboration Strategies (소공인의 경영자 특성이 자기효능감과 네트워크 및 협업 전략을 매개로 기업의 경영성과에 미치는 영향)

  • Hyouk-chan Kweon;Cheol-gyu Lee;Ho-sung Zhang;Woo-hyoung Kim
    • Korea Trade Review
    • /
    • v.47 no.6
    • /
    • pp.135-171
    • /
    • 2022
  • This study is to find out how psychological characteristics and management capabilities of small manufacturers influence business performance through parameters including self-efficiency, network, and collaboration strategies. The survey was implemented between December 26, 2017 and January 15, 2018. The final 439 valid questionnaires were collected and used for analysis. The results were followed. First, the relationship between psychological characteristics and self-efficiency, and the path coefficient for psychological characteristics and network were significant. Second, management capabilities was related to self-efficiency, and the path factor for managing capability and network relationships was significant. Lastly, the path coefficients for self-efficiency and collaboration strategies were not significant, and the path coefficients for network and collaboration strategies were significant.

The Time Management Model focused on the Risk Management (위험관리 중심의 공정관리모텔)

  • Chu, Hae-Keum;Shin, Hyeng-John;Kim, Seon-Gyoo
    • Korean Journal of Construction Engineering and Management
    • /
    • v.6 no.6 s.28
    • /
    • pp.81-89
    • /
    • 2005
  • Construction projects are characterized that exposed high risks so feel strongly necessity of actively risk management that manage the time of project. but recent generally time management tools are not satisfied sufficient supporting the risk identify and risk analysis. Therefore this study purposed development the time management model that in order to improve existing problem of time management model in construction project and developed model could perform practical risk management in construction field. The new time management model focused on the risk management will be able to conduct critical path management and risk critical path management simultaneously.

An efficient Step-parents Node selection Technique in MANET (MANET에서 에너지 효율적인 양부 노드의 선택 방법)

  • Lee, Jong-Seung;Lee, Kang-Whan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2011.10a
    • /
    • pp.855-857
    • /
    • 2011
  • In this paper, we proposed EEAR(Efficient Energy Alternative Routing). This is a method of selecting a backup node for path routing management. When some node disconnection on the path routing, using pre-selected backup node provides immediately recover the path recovery. When selecting a Step-Parents node on the path management, the node' s energy level and distance information are cared in context-awareness. This not only increased the system' s capacity cost effectively, but also reduce transmission power entire nodes consume energy. As a result, each node could efficiently management and improves the life time for mobile host and extends system coverage.

  • PDF

A PATH ENUMERATION APPROACH FOR CRITICAL ANALYSIS IN PROJECT NETWORKS WITH FUZZY ACTIVITY DURATIONS

  • Siamak Haji Yakchali
    • International conference on construction engineering and project management
    • /
    • 2011.02a
    • /
    • pp.575-581
    • /
    • 2011
  • A novel approach for analysis of criticality with respect to path and to activity in networks with fuzzy activity durations is proposed. After recalling the Yager ranking method, the relative degree of criticality of activities and paths are defined. An efficient algorithm based on path enumeration to compute the relative degree of criticality of activities and paths in networks with fuzzy durations is proposed. Examples of former researches are employed to validate the proposed approach. The proposed algorithm has been tested on real world project networks and experimental results have shown that the algorithm can calculate the relative degree of criticality of activities and paths in a reasonable time.

  • PDF

Reliability estimation about quality assurance method of radiotherapy planning (방사선치료계획 정도관리 방법에 따른 신뢰도 평가)

  • Kim, Jeong-Ho;Kim, Gha-Jung;Yoo, Se-Jong;Kim, Ki-Jin
    • Journal of the Korea Safety Management & Science
    • /
    • v.17 no.1
    • /
    • pp.119-124
    • /
    • 2015
  • According as radiation therapy technique develops, standardization of radiation therapy has been complicated by the plan QA(Quality Assurance). However, plan QA tools are two type, OADT (opposite accumulation dose tool) and 3DADT (3 dimensional accumulation dose tool). OADT is not applied to evaluation of beam path. Therefore tolerance error of beam path will establish measurement value at OADT. Plan is six beam path, five irradiation field at each beam path. And beam path error is 0 degree, 0.2 degree, 0.4 degree, 0.6 degree, 0.6 degree, 0.8 degree. Plan QA accomplishes at OADT, 3DADT. The more path error increases, the more plan QA error increases. Tolerance error of OADT path is 0.357 using tolerance error of conventional plan QA. Henceforth plan QA using OADT will include beam path error. In addition, It will increase reliability through precise and various plan technique.

Quickest Path Algorithm for Improving Quality of Services in Communication Networks (통신 품질 향상을 위한 최단 시간 경로 알고리즘)

  • 윤석환;김평중;김진수
    • Journal of Korean Society for Quality Management
    • /
    • v.26 no.1
    • /
    • pp.192-200
    • /
    • 1998
  • The quickest path problem is one of the important things for quality of services in communication networks. It is to find a path to send a given amount of data from the source to the sink with minimum transmission time, where the transmission time is dependent on both the capacities and the traversal times of the arcs in the network. This is found under the networks that the capacity and the lead time of each ring are predetermined. It is general to solve the quickest path problem using shortest path algorithms. The relevant algorithms proposed till now are based on the capacity of rings in distributed environments. When the configuration of networks is changed, there can be two a, pp.oaches to find the quickest paths. The one is to find new quickest paths, and the other is to update the current quickest paths. As one of the algorithms for the latter, the distributed quickest path update algorithm was proposed. This paper aims to propose the distributed algorithm a, pp.icable to find the quickest path, when the configuration of networks is changed, using the quickest path tree update altorithm, and to verify its possibility of a, pp.ication by analyzing the transmission amount of data from one node to another from the theoretical point of view.

  • PDF

Leveraging Reinforcement Learning for Generating Construction Workers' Moving Path: Opportunities and Challenges

  • Kim, Minguk;Kim, Tae Wan
    • International conference on construction engineering and project management
    • /
    • 2022.06a
    • /
    • pp.1085-1092
    • /
    • 2022
  • Travel distance is a parameter mainly used in the objective function of Construction Site Layout Planning (CSLP) automation models. To obtain travel distance, common approaches, such as linear distance, shortest-distance algorithm, visibility graph, and access road path, concentrate only on identifying the shortest path. However, humans do not necessarily follow one shortest path but can choose a safer and more comfortable path according to their situation within a reasonable range. Thus, paths generated by these approaches may be different from the actual paths of the workers, which may cause a decrease in the reliability of the optimized construction site layout. To solve this problem, this paper adopts reinforcement learning (RL) inspired by various concepts of cognitive science and behavioral psychology to generate a realistic path that mimics the decision-making and behavioral processes of wayfinding of workers on the construction site. To do so, in this paper, the collection of human wayfinding tendencies and the characteristics of the walking environment of construction sites are investigated and the importance of taking these into account in simulating the actual path of workers is emphasized. Furthermore, a simulation developed by mapping the identified tendencies to the reward design shows that the RL agent behaves like a real construction worker. Based on the research findings, some opportunities and challenges were proposed. This study contributes to simulating the potential path of workers based on deep RL, which can be utilized to calculate the travel distance of CSLP automation models, contributing to providing more reliable solutions.

  • PDF

Connection/Bearer-Path Routing Technology (인터넷 트래픽 관리를 위한 연결/베어러-패스 라우팅 기술)

  • 신현철;장희선
    • Convergence Security Journal
    • /
    • v.2 no.2
    • /
    • pp.89-97
    • /
    • 2002
  • We use the call routing to interpret the number or name for routing address in multimedia internet. The routing address is used for connection setup. The traffic engineering consists of traffic management, capacity management and network planning. In this paper, in the traffic management function, the basic functions for call routing and connection/bearer-path routing will be presented.

  • PDF