• Title/Summary/Keyword: alternative path

Search Result 241, Processing Time 0.031 seconds

A Shortest Path Algorithm Considering Directional Delays at Signalized Intersection (신호교차로에서 방향별 지체를 고려한 최적경로탐색 연구)

  • Min, Keun-Hong;Jo, Mi-Jeong;Kho, Seung-Young
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.9 no.3
    • /
    • pp.12-19
    • /
    • 2010
  • In road network, especially in urban area, inefficiency of travel time is caused by signal control and turn maneuver at intersection and this inefficiency has substantial effects on travel time. When searching for the shortest path, this inefficiency which is caused by turn maneuver must be considered. Therefore, travel time, vehicle volume and delay for each link were calculated by using simulation package, PARAMICS V5.2 for adaptation of turn penalty at 16 intersections of Gangnam-gu. Turn penalty was calculated respectively for each intersection. Within the same intersection, turn penalty differs by each approaching road and turn direction so the delay was calculated for each approaching road and turn direction. Shortest path dealing with 16 intersections searched by Dijkstra algorithm using travel time as cost, considering random turn penalty, and algorithm considering calculated turn penalty was compared and analyzed. The result shows that by considering turn penalty searching the shortest path can decrease the travel time can be decreased. Also, searching the shortest path which considers turn penalty can represent reality appropriately and the shortest path considering turn penalty can be utilized as an alternative.

Feasibility Study on Double Path Capacitive Deionization Process for Advanced Wastewater Treatment (이단유로 축전식 탈염공정의 하수고도처리 적용가능성 평가)

  • Cha, Jaehwan;Shin, Kyung-Sook;Lee, Jung-Chul;Park, Seung-Kook;Park, Nam-Su;Song, Eui-Yeol
    • Journal of Korean Society of Environmental Engineers
    • /
    • v.36 no.4
    • /
    • pp.295-302
    • /
    • 2014
  • This study demonstrates a double-path CDI as an alternative of advanced wastewater treatment process. While the CDI typically consists of many pairs of electrodes connected in parallel, the new double-path CDI is designed to have series flow path by dividing the module into two stages. The CFD model showed that the double-path had uniform flow distribution with higher velocity and less dead zone compared with the single-path. However, the double-path was predicted to have higher pressure drop(0.7 bar) compared the single-path (0.4 bar). From the unit cell test, the highest TDS removal efficiencies of single- and double-path were up to 88% and 91%, respectively. The rate of increase in pressure drop with an increase of flow rate was higher in double-path than single-path. At 70 mL/min of flow rate, the pressure drop of double-path was 1.67 bar, which was two times higher than single-path. When the electrode spacing was increased from 100 to $200{\mu}m$, the pressure drop of double-path decreased from 1.67 to 0.87 bar, while there was little difference in TDS removal. When proto type double-path CDI was operated using sewage water, TDS, $NH_4{^+}$-N, $NO_3{^-}$-N and $PO_4{^{3-}}$-P removal efficiencies were up to 78%, 50%, 93% and 50%, respectively.

ALGORITHMIC PROOF OF MaxMult(T) = p(T)

  • Kim, In-Jae
    • Communications of the Korean Mathematical Society
    • /
    • v.27 no.4
    • /
    • pp.665-668
    • /
    • 2012
  • For a given graph G we consider a set S(G) of all symmetric matrices A = [$a_{ij}$] whose nonzero entries are placed according to the location of the edges of the graph, i.e., for $i{\neq}j$, $a_{ij}{\neq}0$ if and only if vertex $i$ is adjacent to vertex $j$. The minimum rank mr(G) of the graph G is defined to be the smallest rank of a matrix in S(G). In general the computation of mr(G) is complicated, and so is that of the maximum multiplicity MaxMult(G) of an eigenvalue of a matrix in S(G) which is equal to $n$ - mr(G) where n is the number of vertices in G. However, for trees T, there is a recursive formula to compute MaxMult(T). In this note we show that this recursive formula for MaxMult(T) also computes the path cover number $p$(T) of the tree T. This gives an alternative proof of the interesting result, MaxMult(T) = $p$(T).

The Effect of Task Interdependence and User Participation on Software Development Project Performance (업무상호의존성과 사용자참여가 소프트웨어 개발 프로젝트 성과에 미치는 영향)

  • Hong Myung-Hon;Kim Shinkon;Kim Jeonggon
    • Journal of Information Technology Applications and Management
    • /
    • v.12 no.1
    • /
    • pp.213-229
    • /
    • 2005
  • Cost overrun or schedule delay of the software development project happens frequently despite that software developers continue to make every effort for the effective management of the projects. Previous researches have ascertained that these problems are ascribed to the uncertainty of projects and the improper management of the projects. The purposes of this research are to investigate the impacts of user participation and task interdependence on the performance of the projects and also to find out the appropriate project management method to improve the project performance. Even though the model fitness of the path model is proved to be very high, the verification of the hypotheses showed a variety of results including the four verifications and the one refutation of the hypotheses as well as the suggestion of one alternative hypothesis. The contribution of this research is that the integration model is proposed and verified, comprising the relationship among the user participation, the task interdependence, and the performance of software development projects. A project manager can utilize the implication of this research for an effective management of software development project.

  • PDF

A Transit Assignment Model using Genetic Algorithm (유전자 알고리즘을 이용한 대중교통 통행배정모형 개발)

  • 이신해;최인준;이승재;임강원
    • Journal of Korean Society of Transportation
    • /
    • v.21 no.1
    • /
    • pp.65-75
    • /
    • 2003
  • In these days, public transportation has become important because of serious traffic congestion. But. there are few researches in public transportation compared with researches in auto. Accordingly, the purpose of paper is development of transit assignment model, which considers features of public transportation, time table, transfer capacity of vehicle, common line, etc. The transit assignment model developed in this paper is composed of two parts. One part is search for optimum path, the other part is network loading. A Genetic algorithm has been developed in order to search for alternative shortest path set. After the shortest paths have been obtained in the genetic algorithm, Logit-base stochastic loading model has been used to obtain the assigned volumes.

Variable Aggregation in the ILP Design of WDM Networks with Dedicated Protection

  • Tornatore, Massimo;Maier, Guido;Pattavina, Achille
    • Journal of Communications and Networks
    • /
    • v.9 no.4
    • /
    • pp.419-427
    • /
    • 2007
  • In wavelength-division-multiplexing(WDM) networks a link failure may cause the failure of several high-bit-rate optical channels, thereby leading to large data loss. Recently, various protection and restoration mechanisms have been proposed to efficiently deal with this problem in mesh networks. Among them, dedicated path protection(DPP) is a promising candidate because of its ultra-fast restoration time and robustness. In this work we investigate the issue of planning and optimization of WDM networks with DPP. Integer linear programming(ILP), in particular, is one of the most common exact method to solve the design optimization problem for protected WDM networks. Traditional ILP formalizations to solve this problem rely on the classical flow or route formulation approaches, but both these approaches suffer from a excessively high computational burden. In this paper, we present a variable-aggregation method that has the ability of significantly reducing the complexity of the traditional flow formulation. We compare also the computational burden of flow formulation with variable aggregation both with the classical flow and route formulations. The comparison is carried out by applying the three alternative methods to the optimization of two case-study networks.

A Study on the Attribute of an Art Museum Exhibit Space by a Spectator Behavior (관람자 행태에 의한 미술관 전시공간의 특성 연구 - 전시대상과 전시공간의 상관성을 중심으로 -)

  • Yoon Jae-Eun;Kim Joo-Hee
    • Korean Institute of Interior Design Journal
    • /
    • v.15 no.4 s.57
    • /
    • pp.81-88
    • /
    • 2006
  • The form and function of modern museum present more a variety of aspects in need of transition of the mature civil society and culture than the past. Considering that an art museum is the space where a multitude of unspecified visitors inspect simultaneously, exhibitions and adequate construction make visitors lead to successively visual contact. Consequently a goal of this study is to analyze that there is correlation between exhibit space and exhibitions and to suggest an alternative plan at exhibition through relationship among exhibitions, exhibit space and spectators' behavior. Two Art galleries (one is a large-sized gallery and the other is a small-sized one) located in Pyung-Chang dong were selected to analyze the correlation and suggest the better display for the exhibition. The finding of the study is following. The exhibit space which spectators recognize is assumed diverse forms by an unique characteristics of exhibits and space and an arrangement of exhibitions and the path of flow of spectator who walking ahead have an huge effect on a spectators' behavior. In other words, spectators' watching patterns are affected by display of exhibitions and the path of flow. That is to say, the spectators' behavior and the concentration to watch exhibitions is decided by the exhibit form in the museum, and the quality of watching experience is depended on the spectators' relevant knowledge prior to exhibitions.

Effect of emergency core cooling system flow reduction on channel temperature during recirculation phase of large break loss-of-coolant accident at Wolsong unit 1

  • Yu, Seon Oh;Cho, Yong Jin;Kim, Sung Joong
    • Nuclear Engineering and Technology
    • /
    • v.49 no.5
    • /
    • pp.979-988
    • /
    • 2017
  • The feasibility of cooling in a pressurized heavy water reactor after a large break loss-of-coolant accident has been analyzed using Multidimensional Analysis of Reactor Safety-KINS Standard code during the recirculation phase. Through evaluation of sensitivity of the fuel channel temperature to various effective recirculation flow areas, it is determined that proper cooling of the fuel channels in the broken loop is feasible if the effective flow area remains above approximately 70% of the nominal flow area. When the flow area is reduced by more than approximately 25% of the nominal value, however, incipience of boiling is expected, after which the thermal integrity of the fuel channel can be threatened. In addition, if a dramatic reduction of the recirculation flow occurs, excursions and frequent fluctuations of temperature in the fuel channels are likely to be unavoidable, and thus damage to the fuel channels would be anticipated. To resolve this, emergency coolant supply through the newly installed external injection path can be used as one alternative means of cooling, enabling fuel channel integrity to be maintained and permanently preventing severe accident conditions. Thus, the external injection flow required to guarantee fuel channel coolability has been estimated.

Efficient alternative route path-search techniques to the damaged path using genetic algorithm processing (유전알고리즘의 연산처리를 통한 손상된 경로의 효율적인 대체경로 탐색기법)

  • Ji, Hong-il;Moon, Seok-hwan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2016.10a
    • /
    • pp.729-731
    • /
    • 2016
  • The efficiency of genetic algorithm may be improved, as genetic generation increases. However, a number of algorithms are needed until desired results are obtained. In addition, if Hoc unit increases when linked to a network, there may be a need to compare with all the cases, which would result in many algorithms at a time, and if a single process deals with such algorithms, the efficiency will decrease. Therefore, efficiency of overall network will be decreased in the end. Proposal algorithm in this thesis introduced cells, units of router group, for distributed processing of previous genetic algorithm. This thesis presented ways to reduce search delay time of overall network through cell-based genetic algorithm.

  • PDF

Study on failure mechanism of multi-storeyed reinforced concrete framed structures

  • Ahmed, Irfan;Sheikh, Tariq Ahmad;Gajalakshmi, P.;Revathy, J.
    • Advances in Computational Design
    • /
    • v.6 no.1
    • /
    • pp.1-13
    • /
    • 2021
  • Failure of a Multi-storeyed reinforced concrete framed structure occurs when a primary vertical structural component is isolated or made fragile, due to artificial or natural hazards. Load carried by vertical component (column) is transferred to neighbouring columns in the structure, if the neighbouring column is incompetent of holding the extra load, this leads to the progressive failure of neighbouring members and finally to the failure of partial or whole structure. The collapsing system frequently seeks alternative load path in order to stay alive. One of the imperative features of collapse is that the final damage is not relative to the initial damage. In this paper, the effect on the column and beam adjacent to statically removed vertical element in terms of axial force, shear force and bending moment is investigated. Using Alternate load path method, numerical modelling of two dimensional one bay, two bay with variation in storey heights are analysed with FE model in order to obtain better understanding of failure mechanism of multi-storeyed reinforced concrete framed structure. The results indicate that the corner column is more susceptible to progressive collapse when compared to middle column, using this simplified methodology one can easily predict how the structure can be made to stay alive in case of sudden failure of any horizontal or vertical structural element before designing.