WorldWideScience

Sample records for candu shortest path

  1. Euclidean shortest paths

    CERN Document Server

    Li, Fajie

    2011-01-01

    This unique text/reference reviews algorithms for the exact or approximate solution of shortest-path problems, with a specific focus on a class of algorithms called rubberband algorithms. Discussing each concept and algorithm in depth, the book includes mathematical proofs for many of the given statements. Topics and features: provides theoretical and programming exercises at the end of each chapter; presents a thorough introduction to shortest paths in Euclidean geometry, and the class of algorithms called rubberband algorithms; discusses algorithms for calculating exact or approximate ESPs i

  2. Shortest Paths in Microseconds

    CERN Document Server

    Agarwal, Rachit; Godfrey, P Brighten; Zhao, Ben Y

    2013-01-01

    Computing shortest paths is a fundamental primitive for several social network applications including socially-sensitive ranking, location-aware search, social auctions and social network privacy. Since these applications compute paths in response to a user query, the goal is to minimize latency while maintaining feasible memory requirements. We present ASAP, a system that achieves this goal by exploiting the structure of social networks. ASAP preprocesses a given network to compute and store a partial shortest path tree (PSPT) for each node. The PSPTs have the property that for any two nodes, each edge along the shortest path is with high probability contained in the PSPT of at least one of the nodes. We show that the structure of social networks enable the PSPT of each node to be an extremely small fraction of the entire network; hence, PSPTs can be stored efficiently and each shortest path can be computed extremely quickly. For a real network with 5 million nodes and 69 million edges, ASAP computes a short...

  3. Shortest Paths and Vehicle Routing

    DEFF Research Database (Denmark)

    Petersen, Bjørn

    This thesis presents how to parallelize a shortest path labeling algorithm. It is shown how to handle Chvátal-Gomory rank-1 cuts in a column generation context. A Branch-and-Cut algorithm is given for the Elementary Shortest Paths Problem with Capacity Constraint. A reformulation of the Vehicle...

  4. Heuristic estimates in shortest path algorithms

    OpenAIRE

    Pijls, Wim

    2006-01-01

    textabstractShortest path problems occupy an important position in Operations Research as well as in Arti¯cial Intelligence. In this paper we study shortest path algorithms that exploit heuristic estimates. The well-known algorithms are put into one framework. Besides we present an interesting application of binary numbers in the shortest path theory.

  5. Physarum Can Compute Shortest Paths

    CERN Document Server

    Bonifaci, Vincenzo; Varma, Girish

    2011-01-01

    A mathematical model has been proposed by biologists to describe the feedback mechanism used by the Physarum Polycephalum slime mold to adapt its tubular channels while foraging two food sources $s_0$ and $s_1$. We give a proof of the fact that, under this model, the mass of the mold will eventually converge to the shortest $s_0$-$s_1$ path of the network that the mold lies on, independently of the structure of the network or of the initial mass distribution. This matches the experimental observations by the biologists and can be seen as an example of a "natural algorithm", that is, an algorithm developed by evolution over millions of years.

  6. Shortest Paths With Side Sensors

    CERN Document Server

    Salaris, Paolo; Bicchi, Antonio

    2011-01-01

    We present a complete characterization of shortest paths to a goal position for a vehicle with unicycle kinematics and a limited range sensor, constantly keeping a given landmark in sight. Previous work on this subject studied the optimal paths in case of a frontal, symmetrically limited Field--Of--View (FOV). In this paper we provide a generalization to the case of arbitrary FOVs, including the case that the direction of motion is not an axis of symmetry for the FOV, and even that it is not contained in the FOV. The provided solution is of particular relevance to applications using side-scanning, such as e.g. in underwater sonar-based surveying and navigation.

  7. Heuristic estimates in shortest path algorithms

    NARCIS (Netherlands)

    W.H.L.M. Pijls (Wim)

    2006-01-01

    textabstractShortest path problems occupy an important position in Operations Research as well as in Arti¯cial Intelligence. In this paper we study shortest path algorithms that exploit heuristic estimates. The well-known algorithms are put into one framework. Besides we present an interesting appli

  8. Cost allocation in shortest path games

    NARCIS (Netherlands)

    Voorneveld, M.; Grahn, S.

    2001-01-01

    A class of cooperative games arising from shortest path problems is dened These shortest path games are shown to be totally balanced and allow a population monotonic allocation scheme Possible methods for obtaining core elements are indicated rst by relating to the allocation rules in taxation and b

  9. Shortest Path Computation with No Information Leakage

    CERN Document Server

    Mouratidis, Kyriakos

    2012-01-01

    Shortest path computation is one of the most common queries in location-based services (LBSs). Although particularly useful, such queries raise serious privacy concerns. Exposing to a (potentially untrusted) LBS the client's position and her destination may reveal personal information, such as social habits, health condition, shopping preferences, lifestyle choices, etc. The only existing method for privacy-preserving shortest path computation follows the obfuscation paradigm; it prevents the LBS from inferring the source and destination of the query with a probability higher than a threshold. This implies, however, that the LBS still deduces some information (albeit not exact) about the client's location and her destination. In this paper we aim at strong privacy, where the adversary learns nothing about the shortest path query. We achieve this via established private information retrieval techniques, which we treat as black-box building blocks. Experiments on real, large-scale road networks assess the pract...

  10. Dynamic Shortest Path Monitoring in Spatial Networks

    Institute of Scientific and Technical Information of China (English)

    Shuo Shang; Lisi Chen; Zhe-Wei Wei; Dan-Huai Guo; Ji-Rong Wen

    2016-01-01

    With the increasing availability of real-time traffic information, dynamic spatial networks are pervasive nowa-days and path planning in dynamic spatial networks becomes an important issue. In this light, we propose and investigate a novel problem of dynamically monitoring shortest paths in spatial networks (DSPM query). When a traveler aims to a des-tination, his/her shortest path to the destination may change due to two reasons: 1) the travel costs of some edges have been updated and 2) the traveler deviates from the pre-planned path. Our target is to accelerate the shortest path computing in dynamic spatial networks, and we believe that this study may be useful in many mobile applications, such as route planning and recommendation, car navigation and tracking, and location-based services in general. This problem is challenging due to two reasons: 1) how to maintain and reuse the existing computation results to accelerate the following computations, and 2) how to prune the search space effectively. To overcome these challenges, filter-and-refinement paradigm is adopted. We maintain an expansion tree and define a pair of upper and lower bounds to prune the search space. A series of optimization techniques are developed to accelerate the shortest path computing. The performance of the developed methods is studied in extensive experiments based on real spatial data.

  11. Random shortest path metrics with applications

    NARCIS (Netherlands)

    Engels, Christian; Manthey, Bodo; Raghavendra Rao, B.V.; Brieden, A.; Görgülü, Z.-K.; Krug, T.; Kropat, E.; Meyer-Nieberg, S.; Mihelcic, G.; Pickl, S.W.

    2012-01-01

    We consider random metric instances for optimization problems obtained as follows: Every edge of a complete graph gets a weight drawn independently at random. And then the length of an edge is the length of a shortest path with respect to these weights that connects its two endpoints. We prove that

  12. A general framework for shortest path algorithms

    NARCIS (Netherlands)

    W.H.L.M. Pijls (Wim); A.W.J. Kolen

    1992-01-01

    textabstractIn this paper we present a general framework for shortest path algorithms, including amongst others Dijkstra's algorithm and the A* algorithm. By showing that all algorithms are special cases of one algorithm in which some of the nondeterministic choices are made deterministic, terminati

  13. Performance of shortest path algorithm based on parallel vertex traversal

    Directory of Open Access Journals (Sweden)

    Vesović Mihailo

    2016-01-01

    Full Text Available Shortest path algorithms for different applications, such as Internet routing, VLSI design and so on are used. Dijkstra and Bellman-Ford are commonly used shortest path algorithms which are typically implemented in networks with hundreds of nodes. However, scale of shortest path problems is increasing, and more efficient algorithms are needed. With the development of multicore processors, one natural way to speedup shortest path algorithms is through parallelization. In this paper, we propose a novel shortest path algorithm with parallel vertex transversal, and compare its speed with standard solutions in datacenter topologies.

  14. Evaluation of Shortest Paths in Road Network

    Directory of Open Access Journals (Sweden)

    Farrukh Shehzad

    2009-06-01

    Full Text Available Optimization is a key factor in almost all the topics of operations research / management science and economics.The road networks can be optimized within different constraints like time, distance, cost and traffic running onthe roads.This study is based on optimization of real road network by means of distances. Two main objectives arepursued in this research: 1 road distances among different routes are composed in detail; 2 two standardalgorithms (Dijkstra and Floyd-Warshall algoritms are applied to optimize/minimize these distances for bothsingle-source and all-pairs shortest path problems.

  15. SHORTEST PATH ARC LENGTH NETWORK USING TRIANGULAR INTUITIONISTIC FUZZY NUMBER

    Directory of Open Access Journals (Sweden)

    A.D.CHANDRASEKARAN

    2016-04-01

    Full Text Available In this paper, an intuitionistic fuzzy shortest path is presented to find the optimal path in a network which a fuzzy number, instead of a positive integer is assigned to each arc length. The algorithm is based on the idea that firstly from all the shortest paths from source to destination, an arc with shortest length is computed and then the Euclidean distance is computed for all the paths with the arc of minimum distance. Finally an illustrative numerical example is given to express the proposed work.

  16. Ranking shortest paths in Stochastic time-denpendent networks

    DEFF Research Database (Denmark)

    Nielsen, Lars Relund; Andersen, Kim Allan; Pretolani, Daniele

    , the best route choice is not necessarily a path, but rather a time-adaptive strategy that assigns successors to nodes as a function of time. In some particular cases, the shortest origin-destination path must nevertheless be chosen a priori, since time-adaptive choices are not allowed. Unfortunately......, finding the a priori shortest path is NP-hard, while the best time-adaptive strategy can be found in polynomial time. In this paper, we propose a solution method for the a priori shortest path problem, and we show that it can be easily adapted to the ranking of the first K shortest paths. Moreover, we...... present a computational comparison of time-adaptive and a priori route choices, pointing out the effect of travel time and cost distributions. The reported results show that, under realistic distributions, our solution methods are effective....

  17. K shortest paths in stochastic time-dependent networks

    DEFF Research Database (Denmark)

    Nielsen, Lars Relund; Pretolani, Daniele; Andersen, Kim Allan

    2004-01-01

    , the best route choice is not necessarily a path, but rather a time-adaptive strategy that assigns successors to nodes as a function of time. In some particular cases, the shortest origin-destination path must nevertheless be chosen a priori, since time-adaptive choices are not allowed. Unfortunately......, finding the a priori shortest path is NP-hard, while the best time-adaptive strategy can be found in polynomial time. In this paper, we propose a solution method for the a priori shortest path problem, and we show that it can be easily adapted to the ranking of the first K shortest paths. Moreover, we...... present a computational comparison of time-adaptive and a priori route choices, pointing out the effect of travel time and cost distributions. The reported results show that, under realistic distributions, our solution methods are effective....

  18. Effective caching of shortest paths for location-based services

    DEFF Research Database (Denmark)

    Jensen, Christian S.; Thomsen, Jeppe Rishede; Yiu, Man Lung

    2012-01-01

    Web search is ubiquitous in our daily lives. Caching has been extensively used to reduce the computation time of the search engine and reduce the network traffic beyond a proxy server. Another form of web search, known as online shortest path search, is popular due to advances in geo-positioning.......Web search is ubiquitous in our daily lives. Caching has been extensively used to reduce the computation time of the search engine and reduce the network traffic beyond a proxy server. Another form of web search, known as online shortest path search, is popular due to advances in geo......-positioning. However, existing caching techniques are ineffective for shortest path queries. This is due to several crucial differences between web search results and shortest path results, in relation to query matching, cache item overlapping, and query cost variation. Motivated by this, we identify several...... properties that are essential to the success of effective caching for shortest path search. Our cache exploits the optimal subpath property, which allows a cached shortest path to answer any query with source and target nodes on the path. We utilize statistics from query logs to estimate the benefit...

  19. Comparative Analysis of Algorithms for Single Source Shortest Path Problem

    Directory of Open Access Journals (Sweden)

    Mrs. Shweta Srivastava

    2012-08-01

    Full Text Available The single source shortest path problem is one of the most studied problem in algorithmic graph theory. Single Source Shortest Path is the problem in which we have to find shortest paths from a source vertex v to all other vertices in the graph. A number of algorithms have been proposed for this problem. Most of the algorithms for this problem have evolved around the Dijkstra’s algorithm. In this paper, we are going to do comparative analysis of some of the algorithms to solve this problem. The algorithms discussed in this paper are- Thorup’s algorithm, augmented shortest path, adjacent node algorithm, a heuristic genetic algorithm, an improved faster version of the Dijkstra’s algorithm and a graph partitioning based algorithm.

  20. A Primal-dual Neural Network for Shortest Path Problem

    Institute of Scientific and Technical Information of China (English)

    2002-01-01

    The shortest path (SP) problem is a classical combinatorial optimization problem which plays an important role in a packet-switched computer and communication network. A new primal-dual neural network to solve the shortest path problem (PDSPN) is presented in this paper. The proposed neural network combines many features such as no network coefficients set,easy implementation in a VLSI circuit, and is proved to be completely stable to the exact solutions. The simulation example shows its efficiency in finding the "optimum" path(s) for data transmission in computer and communication network.

  1. Multiple-Source Shortest Paths in Embedded Graphs

    CERN Document Server

    Cabello, Sergio; Erickson, Jeff

    2012-01-01

    Let G be a directed graph with n vertices and non-negative weights in its directed edges, embedded on a surface of genus g, and let F be an arbitrary face of G. We describe an algorithm to preprocess the graph in O(gn log n) time, so that the shortest-path distance from any vertex on the boundary of F to any other vertex in G can be retrieved in O(log n) time. Our result directly generalizes the O(n log n)-time algorithm of Klein [SODA 2005] for multiple-source shortest paths in planar graphs. Intuitively, our preprocessing algorithm maintains a shortest-path tree as its source point moves continuously around the boundary of F. As an application of our algorithm, we describe algorithms to compute a shortest non-contractible or non-separating cycle in embedded, undirected graphs in O(g^2 n log n) time.

  2. Solving the constrained shortest path problem using random search strategy

    Institute of Scientific and Technical Information of China (English)

    2010-01-01

    In this paper, we propose an improved walk search strategy to solve the constrained shortest path problem. The proposed search strategy is a local search algorithm which explores a network by walker navigating through the network. In order to analyze and evaluate the proposed search strategy, we present the results of three computational studies in which the proposed search algorithm is tested. Moreover, we compare the proposed algorithm with the ant colony algorithm and k shortest paths algorithm. The analysis and comparison results demonstrate that the proposed algorithm is an effective tool for solving the constrained shortest path problem. It can not only be used to solve the optimization problem on a larger network, but also is superior to the ant colony algorithm in terms of the solution time and optimal paths.

  3. Approximate shortest homotopic paths in weighted regions

    KAUST Repository

    Cheng, Siuwing

    2012-02-01

    A path P between two points s and t in a polygonal subdivision T with obstacles and weighted regions defines a class of paths that can be deformed to P without passing over any obstacle. We present the first algorithm that, given P and a relative error tolerance ε (0, 1), computes a path from this class with cost at most 1 + ε times the optimum. The running time is O(h 3/ε 2kn polylog (k,n,1/ε)), where k is the number of segments in P and h and n are the numbers of obstacles and vertices in T, respectively. The constant in the running time of our algorithm depends on some geometric parameters and the ratio of the maximum region weight to the minimum region weight. © 2012 World Scientific Publishing Company.

  4. Approximate Shortest Homotopic Paths in Weighted Regions

    KAUST Repository

    Cheng, Siu-Wing

    2010-01-01

    Let P be a path between two points s and t in a polygonal subdivision T with obstacles and weighted regions. Given a relative error tolerance ε ∈(0,1), we present the first algorithm to compute a path between s and t that can be deformed to P without passing over any obstacle and the path cost is within a factor 1 + ε of the optimum. The running time is O(h 3/ε2 kn polylog(k, n, 1/ε)), where k is the number of segments in P and h and n are the numbers of obstacles and vertices in T, respectively. The constant in the running time of our algorithm depends on some geometric parameters and the ratio of the maximum region weight to the minimum region weight. © 2010 Springer-Verlag.

  5. Channel Adaptive Shortest Path Routing for Ad Hoc Networks

    Institute of Scientific and Technical Information of China (English)

    TIAN Hui; XIE Fang; HU Jian-dong; ZHANG Ping

    2003-01-01

    Routing in Mobile Ad Hoc Network (MANET) is a challenge owing to the dynamic nature of network topology and the resource constraints. To maximize the channel resource utilization and minimize the network transfer delay along the path, the shortest path with the minimum hops approach is often adopted. However, the quality of wireless channels among the mobile nodes is time varying owing to fading, shadowing and path loss. Considering adaptive channel coding and modulation scheme, the channel state can be characterized by different link throughputs. If routing selection based on the link throughput is implemented, the minimum transfer delay from source to destination and the maximal throughput may be obtained. In this paper, a Channel Adaptive Shortest Path Routing (CASPR) is presented. Based on the adaptive channel coding and modulation, the CASPR transforms the link throughput into the channel quality factor Q and finds the shortest routing according to the Q measure. Simulation results show that the average path length in the proposed routing scheme may be slightly higher than that of the conventional shortest path with the minimum hops approach, but it can reduce the average transfer delay and increase the packet deliver rate.

  6. The shortest-path problem analysis and comparison of methods

    CERN Document Server

    Ortega-Arranz, Hector; Gonzalez-Escribano, Arturo

    2014-01-01

    Many applications in different domains need to calculate the shortest-path between two points in a graph. In this paper we describe this shortest path problem in detail, starting with the classic Dijkstra's algorithm and moving to more advanced solutions that are currently applied to road network routing, including the use of heuristics and precomputation techniques. Since several of these improvements involve subtle changes to the search space, it may be difficult to appreciate their benefits in terms of time or space requirements. To make methods more comprehensive and to facilitate their co

  7. Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing

    CERN Document Server

    Briest, Patrick

    2009-01-01

    We consider the Stackelberg shortest-path pricing problem, which is defined as follows. Given a graph G with fixed-cost and pricable edges and two distinct vertices s and t, we may assign prices to the pricable edges. Based on the predefined fixed costs and our prices, a customer purchases a cheapest s-t-path in G and we receive payment equal to the sum of prices of pricable edges belonging to the path. Our goal is to find prices maximizing the payment received from the customer. While Stackelberg shortest-path pricing was known to be APX-hard before, we provide the first explicit approximation threshold and prove hardness of approximation within 2-o(1).

  8. Distributional properties of stochastic shortest paths for smuggled nuclear material

    Energy Technology Data Exchange (ETDEWEB)

    Cuellar, Leticia [Los Alamos National Laboratory; Pan, Feng [Los Alamos National Laboratory; Roach, Fred [Los Alamos National Laboratory; Saeger, Kevin J [Los Alamos National Laboratory

    2011-01-05

    The shortest path problem on a network with fixed weights is a well studied problem with applications to many diverse areas such as transportation and telecommunications. We are particularly interested in the scenario where a nuclear material smuggler tries to succesfully reach herlhis target by identifying the most likely path to the target. The identification of the path relies on reliabilities (weights) associated with each link and node in a multi-modal transportation network. In order to account for the adversary's uncertainty and to perform sensitivity analysis we introduce random reliabilities. We perform some controlled experiments on the grid and present the distributional properties of the resulting stochastic shortest paths.

  9. On the Emergence of Shortest Paths by Reinforced Random Walks

    CERN Document Server

    Figueiredo, Daniel R

    2016-01-01

    The co-evolution between network structure and functional performance is a fundamental and challenging problem whose complexity emerges from the intrinsic interdependent nature of structure and function. Within this context, we investigate the interplay between the efficiency of network navigation (i.e., path lengths) and network structure (i.e., edge weights). We propose a simple and tractable model based on iterative biased random walks where edge weights increase over time as function of the traversed path length. Under mild assumptions, we prove that biased random walks will eventually only traverse shortest paths in their journey towards the destination. We further characterize the transient regime proving that the probability to traverse non-shortest paths decays according to a power-law. We also highlight various properties in this dynamic, such as the trade-off between exploration and convergence, and preservation of initial network plasticity. We believe the proposed model and results can be of inter...

  10. Calculating Graph Algorithms for Dominance and Shortest Path

    DEFF Research Database (Denmark)

    Sergey, Ilya; Midtgaard, Jan; Clarke, Dave

    2012-01-01

    We calculate two iterative, polynomial-time graph algorithms from the literature: a dominance algorithm and an algorithm for the single-source shortest path problem. Both algorithms are calculated directly from the definition of the properties by fixed-point fusion of (1) a least fixed point...

  11. The Union of Shortest Path Trees of Functional Brain Networks

    NARCIS (Netherlands)

    Meier, J.; Tewarie, P.; Van Mieghem, P.

    2015-01-01

    Communication between brain regions is still insufficiently understood. Applying concepts from network science has shown to be successful in gaining insight in the functioning of the brain. Recent work has implicated that especially shortest paths in the structural brain network seem to play a major

  12. Experiments with the auction algorithm for the shortest path problem

    DEFF Research Database (Denmark)

    Larsen, Jesper; Pedersen, Ib

    1999-01-01

    The auction approach for the shortest path problem (SPP) as introduced by Bertsekas is tested experimentally. Parallel algorithms using the auction approach are developed and tested. Both the sequential and parallel auction algorithms perform significantly worse than a state-of-the-art Dijkstra......-like reference algorithm. Experiments are run on a distributed-memory MIMD class Meiko parallel computer....

  13. Simple and accurate analytical calculation of shortest path lengths

    CERN Document Server

    Melnik, Sergey

    2016-01-01

    We present an analytical approach to calculating the distribution of shortest paths lengths (also called intervertex distances, or geodesic paths) between nodes in unweighted undirected networks. We obtain very accurate results for synthetic random networks with specified degree distribution (the so-called configuration model networks). Our method allows us to accurately predict the distribution of shortest path lengths on real-world networks using their degree distribution, or joint degree-degree distribution. Compared to some other methods, our approach is simpler and yields more accurate results. In order to obtain the analytical results, we use the analogy between an infection reaching a node in $n$ discrete time steps (i.e., as in the susceptible-infected epidemic model) and that node being at a distance $n$ from the source of the infection.

  14. An Improved Physarum polycephalum Algorithm for the Shortest Path Problem

    Directory of Open Access Journals (Sweden)

    Xiaoge Zhang

    2014-01-01

    Full Text Available Shortest path is among classical problems of computer science. The problems are solved by hundreds of algorithms, silicon computing architectures and novel substrate, unconventional, computing devices. Acellular slime mould P. polycephalum is originally famous as a computing biological substrate due to its alleged ability to approximate shortest path from its inoculation site to a source of nutrients. Several algorithms were designed based on properties of the slime mould. Many of the Physarum-inspired algorithms suffer from a low converge speed. To accelerate the search of a solution and reduce a number of iterations we combined an original model of Physarum-inspired path solver with a new a parameter, called energy. We undertook a series of computational experiments on approximating shortest paths in networks with different topologies, and number of nodes varying from 15 to 2000. We found that the improved Physarum algorithm matches well with existing Physarum-inspired approaches yet outperforms them in number of iterations executed and a total running time. We also compare our algorithm with other existing algorithms, including the ant colony optimization algorithm and Dijkstra algorithm.

  15. An improved Physarum polycephalum algorithm for the shortest path problem.

    Science.gov (United States)

    Zhang, Xiaoge; Wang, Qing; Adamatzky, Andrew; Chan, Felix T S; Mahadevan, Sankaran; Deng, Yong

    2014-01-01

    Shortest path is among classical problems of computer science. The problems are solved by hundreds of algorithms, silicon computing architectures and novel substrate, unconventional, computing devices. Acellular slime mould P. polycephalum is originally famous as a computing biological substrate due to its alleged ability to approximate shortest path from its inoculation site to a source of nutrients. Several algorithms were designed based on properties of the slime mould. Many of the Physarum-inspired algorithms suffer from a low converge speed. To accelerate the search of a solution and reduce a number of iterations we combined an original model of Physarum-inspired path solver with a new a parameter, called energy. We undertook a series of computational experiments on approximating shortest paths in networks with different topologies, and number of nodes varying from 15 to 2000. We found that the improved Physarum algorithm matches well with existing Physarum-inspired approaches yet outperforms them in number of iterations executed and a total running time. We also compare our algorithm with other existing algorithms, including the ant colony optimization algorithm and Dijkstra algorithm. PMID:24982960

  16. Structural parcellation of the thalamus using shortest-path tractography

    DEFF Research Database (Denmark)

    Kasenburg, Niklas; Darkner, Sune; Hahn, Ute;

    2016-01-01

    We demonstrate how structural parcellation can be implemented using shortest-path tractography, thereby addressing some of the shortcomings of the conventional approaches. In particular, our algorithm quantifies, via p-values, the confidence that a voxel in the parcellated region is connected...... to each cortical target region. Calculation of these statistical measures is derived from a rank-based test on the histogram of tract-based scores from all the shortest paths found between the source voxel and each voxel within the target region. Using data from the Human Connectome Project, we show...... that parcellation of the thalamus results in p-value maps that are spatially coherent across subjects. Comparing to the state-of-the-art parcellation of Behrens et al. [1], we observe some agreement, but the soft segmentation exhibits better stability for voxels connected to multiple target regions....

  17. Shortest path in complete bipartite digraph problem and it applications

    Energy Technology Data Exchange (ETDEWEB)

    He, Xin [State Univ. of New York, Buffalo, NY (United States); Chen, Zhi-Zhong [Tokyo Denki Univ., Saitama (Japan)

    1997-06-01

    We introduce the shortest path in complete bipartite digraph (SPCB) problem: Given a weighted complete bipartite digraph G = (X, Y, E) with X = (x{sub 0},{hor_ellipsis}, Xn) and Y = (y{sub 0},{hor_ellipsis},y{sub m}), find a shortest path from x{sub 0} to x{sub n} in G. For arbitrary weights, the problem needs at least {Omega}(nm) time to solve. We show if the weight matrices are concave, the problem can be solved in O(n + m log n) time. As applications, we discuss the traveling salesman problem for points on a convex polygon and the minimum latency tour problem for points on a straight line. The known algorithms for both problems require {Theta}(n{sup 2}) time. Using our SPCB algorithm, we show they can be solved in O(n log n) time. These results solve two open questions.

  18. Relational Approach for Shortest Path Discovery over Large Graphs

    CERN Document Server

    Gao, Jun; Zhou, Jiashuai; Yu, Jeffrey Xu; Jiang, Xiao; Wang, Tengjiao

    2012-01-01

    With the rapid growth of large graphs, we cannot assume that graphs can still be fully loaded into memory, thus the disk-based graph operation is inevitable. In this paper, we take the shortest path discovery as an example to investigate the technique issues when leveraging existing infrastructure of relational database (RDB) in the graph data management. Based on the observation that a variety of graph search queries can be implemented by iterative operations including selecting frontier nodes from visited nodes, making expansion from the selected frontier nodes, and merging the expanded nodes into the visited ones, we introduce a relational FEM framework with three corresponding operators to implement graph search tasks in the RDB context. We show new features such as window function and merge statement introduced by recent SQL standards can not only simplify the expression but also improve the performance of the FEM framework. In addition, we propose two optimization strategies specific to shortest path di...

  19. Multiple Object Tracking Using the Shortest Path Faster Association Algorithm

    Directory of Open Access Journals (Sweden)

    Zhenghao Xi

    2014-01-01

    Full Text Available To solve the persistently multiple object tracking in cluttered environments, this paper presents a novel tracking association approach based on the shortest path faster algorithm. First, the multiple object tracking is formulated as an integer programming problem of the flow network. Then we relax the integer programming to a standard linear programming problem. Therefore, the global optimum can be quickly obtained using the shortest path faster algorithm. The proposed method avoids the difficulties of integer programming, and it has a lower worst-case complexity than competing methods but better robustness and tracking accuracy in complex environments. Simulation results show that the proposed algorithm takes less time than other state-of-the-art methods and can operate in real time.

  20. Effect of congestion costs on shortest paths through complex networks

    OpenAIRE

    Ashton, Douglas J.; Jarrett, Timothy C.; Johnson, Neil F.

    2004-01-01

    We analyze analytically the effect of congestion costs within a physically relevant, yet exactly solvable network model featuring central hubs. These costs lead to a competition between centralized and decentralized transport pathways. In stark contrast to conventional no-cost networks, there now exists an optimal number of connections to the central hub in order to minimize the shortest path. Our results shed light on an open problem in biology, informatics and sociology, concerning the exte...

  1. A Random Riemannian Metric for Probabilistic Shortest-Path Tractography

    OpenAIRE

    Hauberg, Søren; Schober, Michael; Liptrot, Matthew George; Hennig, Philipp; Feragen, Aasa

    2015-01-01

    Shortest-path tractography (SPT) algorithms solve global optimization problems defined from local distance functions. As diffusion MRI data is inherently noisy, so are the voxelwise tensors from which local distances are derived. We extend Riemannian SPT by modeling the stochasticity of the diffusion tensor as a “random Riemannian metric”, where a geodesic is a distribution over tracts. We approximate this distribution with a Gaussian process and present a probabilistic numerics algorithm for...

  2. External Data Structures for Shortest Path Queries on Planar Digraphs

    DEFF Research Database (Denmark)

    Arge, Lars; Toma, Laura

    2005-01-01

    In this paper we present space-query trade-offs for external memory data structures that answer shortest path queries on planar directed graphs. For any S = Ω(N 1 + ε) and S = O(N2/B), our main result is a family of structures that use S space and answer queries in O(N2/ S B) I/Os, thus obtaining...

  3. Optimal parallel algorithm for shortest-paths problem on interval graphs

    Institute of Scientific and Technical Information of China (English)

    MISHRA P.K.

    2004-01-01

    This paper presents an efficient parallel algorithm for the shortest-path problem in interval graph for computing shortest-paths in a weighted interval graph that runs in O(n) time with n intervals in a graph. A linear processor CRCW algorithm for determining the shortest-paths in an interval graphs is given.

  4. Partial order approach to compute shortest paths in multimodal networks

    CERN Document Server

    Ensor, Andrew

    2011-01-01

    Many networked systems involve multiple modes of transport. Such systems are called multimodal, and examples include logistic networks, biomedical phenomena, manufacturing process and telecommunication networks. Existing techniques for determining optimal paths in multimodal networks have either required heuristics or else application-specific constraints to obtain tractable problems, removing the multimodal traits of the network during analysis. In this paper weighted coloured--edge graphs are introduced to model multimodal networks, where colours represent the modes of transportation. Optimal paths are selected using a partial order that compares the weights in each colour, resulting in a Pareto optimal set of shortest paths. This approach is shown to be tractable through experimental analyses for random and real multimodal networks without the need to apply heuristics or constraints.

  5. Training shortest-path tractography: Automatic learning of spatial priors

    DEFF Research Database (Denmark)

    Kasenburg, Niklas; Liptrot, Matthew George; Reislev, Nina Linde;

    2016-01-01

    Tractography is the standard tool for automatic delineation of white matter tracts from diffusion weighted images. However, the output of tractography often requires post-processing to remove false positives and ensure a robust delineation of the studied tract, and this demands expert prior...... knowledge. Here we demonstrate how such prior knowledge, or indeed any prior spatial information, can be automatically incorporated into a shortest-path tractography approach to produce more robust results. We describe how such a prior can be automatically generated (learned) from a population, and we...... demonstrate that our framework also retains support for conventional interactive constraints such as waypoint regions. We apply our approach to the open access, high quality Human Connectome Project data, as well as a dataset acquired on a typical clinical scanner. Our results show that the use of a learned...

  6. Optimal Design of Pipeline Based on the Shortest Path

    Science.gov (United States)

    Chu, Fei-xue; Chen, Shi-yi

    Design and operation of long-distance pipeline are complex engineering tasks. Even small improvement in the design of a pipeline system can lead to substantial savings in capital. In this paper, graph theory was used to analyze the problem of pipeline optimal design. The candidate pump station locations were taken as the vertexes and the total cost of the pipeline system between the two vertexes corresponded to the edge weight. An algorithm recursively calling the Dijkstra algorithm was designed and analyzed to obtain N shortest paths. The optimal process program and the quasi-optimal process programs were obtained at the same time, which could be used in decision-making. The algorithm was tested by a real example. The result showed that it could meet the need of real application.

  7. Shortest Paths Based Web Service Selection in Internet of Things

    Directory of Open Access Journals (Sweden)

    Xiangdong Yin

    2014-01-01

    Full Text Available The connecting of things to the Internet makes it possible for smart things to access all kinds of Web services. However, smart things are energy-limited, and suitable selection of Web services will consume less resources. In this paper, we study the problem of selecting some Web service from the candidate set. We formulate this selection of Web services for smart things as single-source many-target shortest path problem. We design algorithms based on the Dijkstra and breadth-first search algorithms, propose an efficient pruning algorithm for breadth-first search, and analyze their performance of number of iterations and I/O cost. Our empirical evaluation on real-life graphs shows that our pruning algorithm is more efficient than the breadth-first search algorithm.

  8. A Hybrid Shortest Path Algorithm for Navigation System

    Science.gov (United States)

    Cho, Hsun-Jung; Lan, Chien-Lun

    2007-12-01

    Combined with Geographic Information System (GIS) and Global Positioning System (GPS), the vehicle navigation system had become a quite popular product in daily life. A key component of the navigation system is the Shortest Path Algorithm. Navigation in real world must face a network consists of tens of thousands nodes and links, and even more. Under the limited computation capability of vehicle navigation equipment, it is difficult to satisfy the realtime response requirement that user expected. Hence, this study focused on shortest path algorithm that enhances the computation speed with less memory requirement. Several well-known algorithms such as Dijkstra, A* and hierarchical concepts were integrated to build hybrid algorithms that reduce searching space and improve searching speed. Numerical examples were conducted on Taiwan highway network that consists of more than four hundred thousands of links and nearly three hundred thousands of nodes. This real network was divided into two connected sub-networks (layers). The upper layer is constructed by freeways and expressways; the lower layer is constructed by local networks. Test origin-destination pairs were chosen randomly and divided into three distance categories; short, medium and long distances. The evaluation of outcome is judged by actual length and travel time. The numerical example reveals that the hybrid algorithm proposed by this research might be tens of thousands times faster than traditional Dijkstra algorithm; the memory requirement of the hybrid algorithm is also much smaller than the tradition algorithm. This outcome shows that this proposed algorithm would have an advantage over vehicle navigation system.

  9. Dynamic behavior of shortest path routing algorithms for communication networks

    Science.gov (United States)

    Bertsekas, D. P.

    1980-06-01

    Several proposed routing algorithms for store and forward communication networks, including one currently in operation in the ARPANET, route messages along shortest paths computed by using some set of link lengths. When these lengths depend on current traffic conditions as they must in an adaptive algorithm, dynamic behavior questions such as stability convergence, and speed of convergence are of interest. This paper is the first attempt to analyze systematically these issues. It is shown that minimum queuing delay path algorithms tend to exhibit violent oscillatory behavior in the absence of a damping mechanism. The oscillations can be damped by means of several types of schemes, two of which are analyzed in this paper. In the first scheme a constant bias is added to the queuing delay thereby providing a preference towards paths with a small number of links. In the second scheme the effects of several past routings are averaged as, for example, when the link lengths are computed and communicated asynchronously throughout the network.

  10. The shortest path algorithm performance comparison in graph and relational database on a transportation network

    OpenAIRE

    Miler, Mario; Medak, Damir; Odobašić, Dražen

    2014-01-01

    In the field of geoinformation and transportation science, the shortest path is calculated on graph data mostly found in road and transportation networks. This data is often stored in various database systems. Many applications dealing with transportation network require calculation of the shortest path. The objective of this research is to compare the performance of Dijkstra shortest path calculation in PostgreSQL (with pgRouting) and Neo4j graph database for the purpose of determining if th...

  11. Training shortest-path tractography: Automatic learning of spatial priors.

    Science.gov (United States)

    Kasenburg, Niklas; Liptrot, Matthew; Reislev, Nina Linde; Ørting, Silas N; Nielsen, Mads; Garde, Ellen; Feragen, Aasa

    2016-04-15

    Tractography is the standard tool for automatic delineation of white matter tracts from diffusion weighted images. However, the output of tractography often requires post-processing to remove false positives and ensure a robust delineation of the studied tract, and this demands expert prior knowledge. Here we demonstrate how such prior knowledge, or indeed any prior spatial information, can be automatically incorporated into a shortest-path tractography approach to produce more robust results. We describe how such a prior can be automatically generated (learned) from a population, and we demonstrate that our framework also retains support for conventional interactive constraints such as waypoint regions. We apply our approach to the open access, high quality Human Connectome Project data, as well as a dataset acquired on a typical clinical scanner. Our results show that the use of a learned prior substantially increases the overlap of tractography output with a reference atlas on both populations, and this is confirmed by visual inspection. Furthermore, we demonstrate how a prior learned on the high quality dataset significantly increases the overlap with the reference for the more typical yet lower quality data acquired on a clinical scanner. We hope that such automatic incorporation of prior knowledge and the obviation of expert interactive tract delineation on every subject, will improve the feasibility of large clinical tractography studies. PMID:26804779

  12. A note on the pratical performance of the auction algorithm for the shortest path

    DEFF Research Database (Denmark)

    Larsen, Jesper

    1998-01-01

    The performance of the auction algorithm for the shortest path problem has previously been investigated in four papers. Here the results of a series of new experiments with the code from the two most recent papers are reported. Experiments clearly show that the auction algorithm is inferior...... to the state-of-the-art shortest path algorithms....

  13. Output-threshold coupled neural network for solving the shortest path problems

    Institute of Scientific and Technical Information of China (English)

    ZHANG Junying; WANG Defeng; SHI Meihong; WANG Joseph Yue

    2004-01-01

    This paper presents a coupled neural network, called output-threshold coupled neural network (OTCNN), which can mimic the autowaves in the present pulsed coupled neural networks (PCNNs), by the construction of mutual coupling between neuron outputs and the threshold of a neuron. Based on its autowaves, this paper presents a method for finding the shortest path in shortest time with OTCNNs. The method presented here features much fewer neurons needed, simplicity of the structure of the neurons and the networks, and large scale of parallel computation. It is shown that OTCNN is very effective in finding the shortest paths from a single start node to multiple destination nodes for asymmetric weighted graph, with a number of iterations proportional only to the length of the shortest paths, but independent of the complexity of the graph and the total number of existing paths in the graph. Finally, examples for finding the shortest path are presented.

  14. The Time-Synchronous Dynamic Programming Approach to the Shortest Path Search in Spoken Dialog System

    Institute of Scientific and Technical Information of China (English)

    HEWei; YANGSuqiong; YUANBaozong; LINBiqin

    2004-01-01

    Shortest path search has important practical applications and is related to optimization problem.This paper discusses a new algorithm time-synchronous heuristic dynamic programming search, which combined the pruning and global optimization of DP (Dynamic programming) and the partial search of heuristic strategy and found the shortest path in time O(n/kd) (k, d ≥ 1). Furthermore, the algorithm can be applied to find the K shortest paths between a pair of given nodes or all paths less than a given length within the same steps. Finally this algorithm was applied to the shortest path search on the real map and user could use spoken dialog to query shortcut in realtime, 90% of the system responses are correct.

  15. The role of convexity for solving some shortest path problems in plane without triangulation

    Science.gov (United States)

    An, Phan Thanh; Hai, Nguyen Ngoc; Hoai, Tran Van

    2013-09-01

    Solving shortest path problems inside simple polygons is a very classical problem in motion planning. To date, it has usually relied on triangulation of the polygons. The question: "Can one devise a simple O(n) time algorithm for computing the shortest path between two points in a simple polygon (with n vertices), without resorting to a (complicated) linear-time triangulation algorithm?" raised by J. S. B. Mitchell in Handbook of Computational Geometry (J. Sack and J. Urrutia, eds., Elsevier Science B.V., 2000), is still open. The aim of this paper is to show that convexity contributes to the design of efficient algorithms for solving some versions of shortest path problems (namely, computing the convex hull of a finite set of points and convex rope on rays in 2D, computing approximate shortest path between two points inside a simple polygon) without triangulation on the entire polygons. New algorithms are implemented in C and numerical examples are presented.

  16. All-Pairs Shortest Paths in $O(n^2)$ time with high probability

    CERN Document Server

    Peres, Yuval; Sudakov, Benny; Zwick, Uri

    2011-01-01

    We present an all-pairs shortest path algorithm whose running time on a complete directed graph on $n$ vertices whose edge weights are chosen independently and uniformly at random from $[0,1]$ is $O(n^2)$, in expectation and with high probability. This resolves a long standing open problem. The algorithm is a variant of the dynamic all-pairs shortest paths algorithm of Demetrescu and Italiano. The analysis relies on a proof that the number of \\emph{locally shortest paths} in such randomly weighted graphs is $O(n^2)$, in expectation and with high probability. We also present a dynamic version of the algorithm that recomputes all shortest paths after a random edge update in $O(\\log^{2}n)$ expected time.

  17. A shortest path algorithm for satellite time-varying topological network

    Science.gov (United States)

    Zhang, Tao; Liu, Zhongkan; Zhuang, Jun

    2005-11-01

    Mobile satellite network is a special time-varying network. It is different from the classical fixed network and other time-dependent networks which have been studied. Therefore some classical network theories, such as the shortest path algorithm, can not be applied to it availably. However, no study about its shortest path problem has been done. In this paper, based on the proposed model of satellite time-varying topological network, the classical shortest path algorithm of fixed network, such as the Dijkstra algorithm, is proved to be restrictive when it is applied in satellite network. Here, a novel shortest path algorithm for satellite time-varying topological network is given and optimized. Correlative simulation indicates that this algorithm can be effectively applied to the satellite time-varying topological network.

  18. PHA*: Finding the Shortest Path with A* in An Unknown Physical Environment

    OpenAIRE

    Ben-Yair, A.; Felner, A.; S. Kraus; Netanyahu, N.; Stern, R.

    2011-01-01

    We address the problem of finding the shortest path between two points in an unknown real physical environment, where a traveling agent must move around in the environment to explore unknown territory. We introduce the Physical-A* algorithm (PHA*) for solving this problem. PHA* expands all the mandatory nodes that A* would expand and returns the shortest path between the two points. However, due to the physical nature of the problem, the complexity of the algorithm is measured by the travelin...

  19. Threshold-Based Shortest Path Query over Large Correlated Uncertain Graphs

    Institute of Scientific and Technical Information of China (English)

    成雨蓉; 袁野; 陈雷; 王国仁

    2015-01-01

    With the popularity of uncertain data, queries over uncertain graphs have become a hot topic in the database community. As one of the important queries, the shortest path query over an uncertain graph has attracted much attention of researchers due to its wide applications. Although there are some efficient solutions addressing this problem, all existing models ignore an important property existing in uncertain graphs: the correlation among the edges sharing the same vertex. In this paper, we apply Markov network to model the hidden correlation in uncertain graphs and compute the shortest path. Unfortunately, calculating the shortest path and corresponding probability over uncertain graphs modeled by Markov networks is a #P-hard problem. Thus, we propose a filtering-and-verification framework to accelerate the queries. In the filtering phase, we design a probabilistic shortest path index based on vertex cuts and blocks of a graph. We find a series of upper bounds and prune the vertices and edges whose upper bounds of the shortest path probability are lower than the threshold. By carefully picking up the blocks and vertex cuts, the index is optimized to have the maximum pruning capability, so that we can filter a large number of vertices which make no contribution to the final shortest path query results. In the verification phase, we develop an efficient sampling algorithm to determine the final query answers. Finally, we verify the efficiency and effectiveness of our solutions with extensive experiments.

  20. Using Moore Dijkstra Algorithm with Multi-Agent System to Find Shortest Path over Network

    Directory of Open Access Journals (Sweden)

    Basem Alrifai

    2015-06-01

    Full Text Available finding the shortest path over network is very difficult and it is the target for much research, after many researches get the result in many of algorithm and many a mount based on the performance for these algorithm .Shortest paths problems are familiar problems in computer science and mathematics. In these problems, edge weights may represent distances, costs, or any other real-valued quantity that can be added along a path, and that one may wish to minimize. Thus, edge weights are real numbers and the specific operations used are addition to compute the weight of a path and minimum to select the best path weight. In this paper we use the Dijkstra's algorithm with new technique to find the shortest path over network to reduce the time we need to find the best path, in this paper we use node for network with the same value which can be use it to find the shortest path but this depend on the number of transition for every node when the node have high number then the node have the high priority to choose it by using this method we descries the time to find the short path .to make this algorithm more distinguish apply multi-agent system ( Automata with multiplicities to find the short path.

  1. A O(E) Time Shortest Path Algorithm For Non Negative Weighted Undirected Graphs

    CERN Document Server

    Qureshi, Muhammad Aasim; Safdar, Sohail; Akbar, Rehan

    2009-01-01

    In most of the shortest path problems like vehicle routing problems and network routing problems, we only need an efficient path between two points source and destination, and it is not necessary to calculate the shortest path from source to all other nodes. This paper concentrates on this very idea and presents an algorithm for calculating shortest path for (i) nonnegative weighted undirected graphs (ii) unweighted undirected graphs. The algorithm completes its execution in O(E) for all graphs except few in which longer path (in terms of number of edges) from source to some node makes it best selection for that node. The main advantage of the algorithms is its simplicity and it does not need complex data structures for implementations.

  2. Curvature-Constrained Shortest Paths in a Convex Polygon

    OpenAIRE

    Agarwal, Pankaj K.; Biedl, Thérèse; Lazard, Sylvain; Robbins, Steve; Suri, Subhash; Whitesides, Sue

    2000-01-01

    Let B be a point robot moving in the plane, whose path is constrained to have curvature at most 1, and let poly be a convex polygon with n vertices. We study the collision-free, optimal path planning problem for B moving between two configurations inside poly (a configuration specifies both a location and a direction of travel). We present an runtime- time algorithm for determining whether a collision-free path exists for B between xstwo given configurations. If such a path exists, the algori...

  3. A circuitous shortest path algorithm labeled by previous-arc vector group in navigation GIS

    Science.gov (United States)

    Yang, Lin; Zhou, Shunping; Wan, Bo; Pan, Xiaofang

    2008-10-01

    Path planning, as the core module of navigation GIS, its efficiency and accuracy has a crucial impact on the navigation system. General shortest-path algorithm is based on the classic node label-setting algorithm, which does not consider the situation of including circuitous road sections. Therefore, sometimes it will neglect the closer circuitous path at hand but find the farther path or even failed to find any path in the real road network with complicated traffic restrictions. For the sake of finding more accurate path, this paper presents a circuitous shortest path algorithm labeled by previous-arc vector group. Firstly, we generate incremental network topological relationships according to two random positions travelers are interested in. Secondly, we construct a vector group including previous arc, and seek the way by labeling the previous-arc vector group. Finally, the shortest path in the sense of mathematics which may contain circuitous road sections can be acquired. An experimental work has been done with this algorithm using the map of Beijing, which showed that the algorithm not only well improved the accuracy of the shortest path result between the two random positions in the road network, but also kept the efficiency of the classic node labeled algorithm.

  4. Analysis of Brownian Particles for finding the shortest path in networks

    Directory of Open Access Journals (Sweden)

    huan yan qian

    2013-07-01

    Full Text Available In this paper, we propose a method to analyze the shortest path finding between two nodes in complex networks. In this method, we first find that single Brownian particle follows the shortest path between source node and destination node in the probability of where denotes the shortest path steps between two nodes. To be compared with single particle utilization, then we specially analyze the multiple particles. We compute the probability of particles’ taking the shortest path between and when particles starts simultaneously from the source and head to the destination as . It’s very clear that there must be particles taking the shortest path to arrive at the destination in the multiple particles environment. And with the number of increasing, the arriving probability first arise and then drop down rapidly until to zero. In the end, we make the experiments and confirm our theoretical analysis. Our results would provide valuable usage for some applications such as finding the optimal routing in wireless sensor networks.

  5. A shortest path algorithm for moving objects in spatial network databases

    Institute of Scientific and Technical Information of China (English)

    Xiaolan Yin; Zhiming Ding; Jing Li

    2008-01-01

    One of the most important kinds of queries in Spatial Network Databases (SNDB) to support location-based services (LBS) is the shortest path query. Given an object in a network, e.g. A location of a car on a road network, and a set of objects of interests, e.g. Hotels,gas station, and car, the shortest path query returns the shortest path from the query object to interested objects. The studies of shortest path query have two kinds of ways, online processing and preprocessing. The studies of preprocessing suppose that the interest objects are static. This paper proposes a shortest path algorithm with a set of index structures to support the situation of moving objects. This algorithm can transform a dynamic problem to a static problem. In this paper we focus on road networks. However, our algorithms do not use any domain specific information, and therefore can be applied to any network. This algorithm's complexity is O(klog2i), and traditional Dijkstra's complexity is O((I + k)2).

  6. An Evaluation of Potentials of Genetic Algorithm in Shortest Path Problem

    Science.gov (United States)

    Hassany Pazooky, S.; Rahmatollahi Namin, Sh; Soleymani, A.; Samadzadegan, F.

    2009-04-01

    One of the most typical issues considered in combinatorial systems in transportation networks, is the shortest path problem. In such networks, routing has a significant impact on the network's performance. Due to natural complexity in transportation networks and strong impact of routing in different fields of decision making, such as traffic management and vehicle routing problem (VRP), appropriate solutions to solve this problem are crucial to be determined. During last years, in order to solve the shortest path problem, different solutions are proposed. These techniques are divided into two categories of classic and evolutionary approaches. Two well-known classic algorithms are Dijkstra and A*. Dijkstra is known as a robust, but time consuming algorithm in finding the shortest path problem. A* is also another algorithm very similar to Dijkstra, less robust but with a higher performance. On the other hand, Genetic algorithms are introduced as most applicable evolutionary algorithms. Genetic Algorithm uses a parallel search method in several parts of the domain and is not trapped in local optimums. In this paper, the potentiality of Genetic algorithm for finding the shortest path is evaluated by making a comparison between this algorithm and classic algorithms (Dijkstra and A*). Evaluation of the potential of these techniques on a transportation network in an urban area shows that due to the problem of classic methods in their small search space, GA had a better performance in finding the shortest path.

  7. Prograph Based Analysis of Single Source Shortest Path Problem with Few Distinct Positive Lengths

    Directory of Open Access Journals (Sweden)

    B. Bhowmik

    2011-08-01

    Full Text Available In this paper we propose an experimental study model S3P2 of a fast fully dynamic programming algorithm design technique in finite directed graphs with few distinct nonnegative real edge weights. The Bellman-Ford’s approach for shortest path problems has come out in various implementations. In this paper the approach once again is re-investigated with adjacency matrix selection in associate least running time. The model tests proposed algorithm against arbitrarily but positive valued weighted digraphs introducing notion of Prograph that speeds up finding the shortest path over previous implementations. Our experiments have established abstract results with the intention that the proposed algorithm can consistently dominate other existing algorithms for Single Source Shortest Path Problems. A comparison study is also shown among Dijkstra’s algorithm, Bellman-Ford algorithm, and our algorithm.

  8. Scaling limits for shortest path lengths along the edges of stationary tessellations - Supplementary material

    CERN Document Server

    Voss, Florian; Schmidt, Volker

    2009-01-01

    We consider spatial stochastic models, which can be applied e.g. to telecommunication networks with two hierarchy levels. In particular, we consider two Cox processes concentrated on the edge set of a random tessellation, where the points can describe the locations of low-level and high-level network components, respectively, and the edge set the underlying infrastructure of the network, like road systems, railways, etc. Furthermore, each low-level component is marked with the shortest path along the edge set to the nearest high-level component. We investigate the typical shortest path length of the resulting marked point process, which is an important characteristic e.g. in performance analysis and planning of telecommunication networks. In particular, we show that its distribution converges to simple parametric limit distributions if a certain scaling factor converges to zero and infinity, respectively. This can be used to approximate the density of the typical shortest path length by analytical formulae.

  9. A self-organizing shortest path finding strategy on complex networks

    Institute of Scientific and Technical Information of China (English)

    Shen Yi; Pei Wen-Jiang; Wang Kai; Wang Shao-Ping

    2009-01-01

    The shortcomings of traditional methods to find the shortest path are revealed,and a strategy of finding the selforganizing shortest path based on thermal flux diffusion on complex networks is presented. In our method,the shortest paths between the source node and the other nodes are found to be self-organized by comparing node temperatures. The computation complexity of the method scales linearly with the number of edges on underlying networks. The effects of the method on several networks,including a regular network proposed by Ravasz and Barabási which is called the RB network,a real network,a random network proposed by Ravasz and Barabási which is called the ER network and a scale-free network,are also demonstrated. Analytic and simulation results show that the method has a higher accuracy and lower computational complexity than the conventional methods.

  10. Inverse minimum spanning tree problem and reverse shortest-path problem with discrete values

    Institute of Scientific and Technical Information of China (English)

    LIU Longcheng; HE Yong

    2006-01-01

    In this paper, we consider two network improvement problems with given discrete values: the inverse minimum spanning tree problem and the reverse shortest-path problem, where the decrements of the weight of the edges are given discrete values. First,for the three models of the inverse minimum spanning tree problem (the sum-type, the bottleneck-type and the constrained bottlenecktype), we present their respective strongly polynomial algorithms. Then, we show that the reverse shortest-path problem is strongly NP-complete.

  11. All-pairs Shortest Path Algorithm based on MPI+CUDA Distributed Parallel Programming Model

    OpenAIRE

    Qingshuang Wu; Chunya Tong; Qiang Wang; Xiangfu Cheng

    2013-01-01

    In view of the problem that computing shortest paths in a graph is a complex and time-consuming process, and the traditional algorithm that rely on the CPU as computing unit solely can't meet the demand of real-time processing, in this paper, we present an all-pairs shortest paths algorithm using MPI+CUDA hybrid programming model, which can take use of the overwhelming computing power of the GPU cluster to speed up the processing. This proposed algorithm can combine the advantages of MPI and ...

  12. Coarse-Grained Parallel Genetic Algorithm to solve the Shortest Path Routing problem using Genetic operators

    Directory of Open Access Journals (Sweden)

    V.PURUSHOTHAM REDDY

    2011-02-01

    Full Text Available In computer networks the routing is based on shortest path routing algorithms. Based on its advantages, an alternative method is used known as Genetic Algorithm based routing algorithm, which is highly scalable and insensitive to variations in network topology. Here we propose a coarse-grained parallel genetic algorithm to solve the shortest path routing problem with the primary goal of computation time reduction along with the use of migration scheme. This algorithm is developed and implemented on an MPI cluster. The effects of migration and its performance is studied in this paper.

  13. Computing Conditional Intermeeting Time in Conditional Shortest Path Routing

    Directory of Open Access Journals (Sweden)

    2011-05-01

    Full Text Available Delay tolerant networks are characterized by the sporadic connectivity between their nodes. The Sporadic connectivity leads to lack of stable end-to-end paths from source to destination. Since the future node connections are mostly unknown in these networks, opportunistic forwarding is used to deliver messages. In Intermeeting time, to making effective forwarding decisions using only the network characteristics (i.e. average intermeeting time between nodes but contact history extracted from previous node is a challenging problem. In this paper, we introduce a new method called conditional intermeeting time, which computes the average intermeeting time between two nodes relative to a meeting with a third node using only the local knowledge of the past contacts. Advantage of using conditional intermeeting time is time efficiency. Experimental results are discussed at the end. Finally conclusion and future work discussed at the end.

  14. Multi-Objective and Multi-Constrained Non-Additive Shortest Path Problems

    DEFF Research Database (Denmark)

    Reinhardt, Line Blander; Pisinger, David

    2011-01-01

    Shortest path problems appear as subproblems in numerous optimization problems. In most papers concerning multiple objective shortest path problems, additivity of the objective is a de-facto assumption, but in many real-life situations objectives and criteria, can be non-additive. The purpose...... of this paper is to give a general framework for dominance tests for problems involving a number of non-additive criteria. These dominance tests can help to eliminate paths in a dynamic programming framework when using multiple objectives. Results on real-life multi-objective problems containing non......-additive criteria are reported. We show that in many cases the framework can be used to efficiently reduce the number of generated paths....

  15. Multi-Objective and Multi-Constrained Non-Additive Shortest Path Problems

    DEFF Research Database (Denmark)

    Reinhardt, Line Blander; Pisinger, David

    Shortest path problems appear as subproblems in numerous optimization problems. In most papers concerning multiple objective shortest path problems, additivity of the objective is a de-facto assumption, but in many real-life situations objectives and criteria, can be non-additive. The purpose...... of this paper is to give a general framework for dominance tests for problems involving a number of non-additive criteria. These dominance tests can help eliminate paths in a dynamic programming framework when using multiple objectives. Results on real-life multi-objective problems containing non......-additive criteria are reported. We show that in many cases the framework can be used to efficiently reduce the number of generated paths....

  16. The Weight and Hopcount of the Shortest Path in the Complete Graph with Exponential Weights

    NARCIS (Netherlands)

    Hooghiemstra, G.; Van Mieghem, P.

    Both the hopcount HN (the number of links) and the weight WN (the sum of the weights on links) of the shortest path between two arbitrary nodes in the complete graph KN with i.i.d. exponential link weights is computed. We consider the joint distribution of the pair (HN,WN) and derive, after proper s

  17. Spatial interpolation of fine particulate matter concentrations using the shortest wind-field path distance.

    Directory of Open Access Journals (Sweden)

    Longxiang Li

    Full Text Available Effective assessments of air-pollution exposure depend on the ability to accurately predict pollutant concentrations at unmonitored locations, which can be achieved through spatial interpolation. However, most interpolation approaches currently in use are based on the Euclidean distance, which cannot account for the complex nonlinear features displayed by air-pollution distributions in the wind-field. In this study, an interpolation method based on the shortest path distance is developed to characterize the impact of complex urban wind-field on the distribution of the particulate matter concentration. In this method, the wind-field is incorporated by first interpolating the observed wind-field from a meteorological-station network, then using this continuous wind-field to construct a cost surface based on Gaussian dispersion model and calculating the shortest wind-field path distances between locations, and finally replacing the Euclidean distances typically used in Inverse Distance Weighting (IDW with the shortest wind-field path distances. This proposed methodology is used to generate daily and hourly estimation surfaces for the particulate matter concentration in the urban area of Beijing in May 2013. This study demonstrates that wind-fields can be incorporated into an interpolation framework using the shortest wind-field path distance, which leads to a remarkable improvement in both the prediction accuracy and the visual reproduction of the wind-flow effect, both of which are of great importance for the assessment of the effects of pollutants on human health.

  18. Spatial Interpolation of Fine Particulate Matter Concentrations Using the Shortest Wind-Field Path Distance

    Science.gov (United States)

    Li, Longxiang; Gong, Jianhua; Zhou, Jieping

    2014-01-01

    Effective assessments of air-pollution exposure depend on the ability to accurately predict pollutant concentrations at unmonitored locations, which can be achieved through spatial interpolation. However, most interpolation approaches currently in use are based on the Euclidean distance, which cannot account for the complex nonlinear features displayed by air-pollution distributions in the wind-field. In this study, an interpolation method based on the shortest path distance is developed to characterize the impact of complex urban wind-field on the distribution of the particulate matter concentration. In this method, the wind-field is incorporated by first interpolating the observed wind-field from a meteorological-station network, then using this continuous wind-field to construct a cost surface based on Gaussian dispersion model and calculating the shortest wind-field path distances between locations, and finally replacing the Euclidean distances typically used in Inverse Distance Weighting (IDW) with the shortest wind-field path distances. This proposed methodology is used to generate daily and hourly estimation surfaces for the particulate matter concentration in the urban area of Beijing in May 2013. This study demonstrates that wind-fields can be incorporated into an interpolation framework using the shortest wind-field path distance, which leads to a remarkable improvement in both the prediction accuracy and the visual reproduction of the wind-flow effect, both of which are of great importance for the assessment of the effects of pollutants on human health. PMID:24798197

  19. A Branch-and-Cut Algorithm for Elementary Shortest Path Problem with Resource Constraints

    DEFF Research Database (Denmark)

    Jepsen, Mads Kehlet; Petersen, Bjørn; Spoorendonk, Simon

    The elementary shortest path with resource constraints are commonly solved with dynamic programming algorithms. We present a branch-and-cut algorithm for the undirected version. Two types of resources are discussed: A capacity and a fixed charge resource. The former is the subproblem of the capac...... of the capacitated vehicle routing problem and the latter is for the split delivery version....

  20. A Practical Parallel Algorithm for All-Pair Shortest Path Based on Pipelining

    Institute of Scientific and Technical Information of China (English)

    Hua Wang; Ling Tian; Chun-Hua Jiang

    2008-01-01

    On the basis of Floyd algorithm with theextended path matrix, a parallel algorithm whichresolves all-pair shortest path (APSP) problem oncluster environment is analyzed and designed.Meanwhile, the parallel APSP pipelining algorithmmakes full use of overlapping technique betweencomputation and communication. Compared withbroadcast operation, the parallel algorithm reducescommunication cost. This algorithm has beenimplemented on MPI on PC-cluster. The theoreticalanalysis and experimental results show that the parallelalgorithm is an efficient and scalable algorithm.

  1. Using Link Analysis Technique with a Modified Shortest-Path Algorithm to Fight Money Laundering

    Institute of Scientific and Technical Information of China (English)

    CHEN Yunkai; MAI Quanwen; LU Zhengding

    2006-01-01

    Effective link analysis techniques are needed to help law enforcement and intelligence agencies fight money laundering.This paper presents a link analysis technique that uses a modified shortest-path algorithms to identify the strongest association paths between entities in a money laundering network.Based on two-tree Dijkstra and Priority-First-Search (PFS) algorithm, a modified algorithm is presented.To apply the algorithm, a network representation transformation is made first.

  2. A temporal ant colony optimization approach to the shortest path problem in dynamic scale-free networks

    Science.gov (United States)

    Yu, Feng; Li, Yanjun; Wu, Tie-Jun

    2010-02-01

    A large number of networks in the real world have a scale-free structure, and the parameters of the networks change stochastically with time. Searching for the shortest paths in a scale-free dynamic and stochastic network is not only necessary for the estimation of the statistical characteristics such as the average shortest path length of the network, but also challenges the traditional concepts related to the “shortest path” of a network and the design of path searching strategies. In this paper, the concept of shortest path is defined on the basis of a scale-free dynamic and stochastic network model, and a temporal ant colony optimization (TACO) algorithm is proposed for searching for the shortest paths in the network. The convergence and the setup for some important parameters of the TACO algorithm are discussed through theoretical analysis and computer simulations, validating the effectiveness of the proposed algorithm.

  3. AN AUTOMATED REFERENCE POINT-LIKE APPROACH FOR MULTICRITERIA SHORTEST PATH PROBLEMS

    Institute of Scientific and Technical Information of China (English)

    Jo(a)o C. N. CL(I)ACO; José M. F. CRAVEIRINHA; Marta M. B. PASCOAL

    2006-01-01

    In this paper we introduce a method of analysis for the automated ordering and selection of solutions of a multicriteria shortest path model. The method is based on a reference point approach, where the paths in a specific priority region are ranked by non-decreasing order of a Chebyshev metric.In order to list paths according with this objective function a labelling algorithm is proposed. The developed method is applied in a video-traffic routing context. Computational results are presented and analysed, for randomly generated networks of significant dimension.

  4. Shortest-path network analysis is a useful approach toward identifying genetic determinants of longevity.

    Directory of Open Access Journals (Sweden)

    J R Managbanag

    Full Text Available BACKGROUND: Identification of genes that modulate longevity is a major focus of aging-related research and an area of intense public interest. In addition to facilitating an improved understanding of the basic mechanisms of aging, such genes represent potential targets for therapeutic intervention in multiple age-associated diseases, including cancer, heart disease, diabetes, and neurodegenerative disorders. To date, however, targeted efforts at identifying longevity-associated genes have been limited by a lack of predictive power, and useful algorithms for candidate gene-identification have also been lacking. METHODOLOGY/PRINCIPAL FINDINGS: We have utilized a shortest-path network analysis to identify novel genes that modulate longevity in Saccharomyces cerevisiae. Based on a set of previously reported genes associated with increased life span, we applied a shortest-path network algorithm to a pre-existing protein-protein interaction dataset in order to construct a shortest-path longevity network. To validate this network, the replicative aging potential of 88 single-gene deletion strains corresponding to predicted components of the shortest-path longevity network was determined. Here we report that the single-gene deletion strains identified by our shortest-path longevity analysis are significantly enriched for mutations conferring either increased or decreased replicative life span, relative to a randomly selected set of 564 single-gene deletion strains or to the current data set available for the entire haploid deletion collection. Further, we report the identification of previously unknown longevity genes, several of which function in a conserved longevity pathway believed to mediate life span extension in response to dietary restriction. CONCLUSIONS/SIGNIFICANCE: This work demonstrates that shortest-path network analysis is a useful approach toward identifying genetic determinants of longevity and represents the first application of

  5. External Memory Algorithms for Diameter and All-Pair Shortest-Paths on Sparse Graphs

    DEFF Research Database (Denmark)

    Arge, Lars; Meyer, Ulrich; Toma, Laura

    2004-01-01

    We present several new external-memory algorithms for finding all-pairs shortest paths in a V -node, Eedge undirected graph. For all-pairs shortest paths and diameter in unweighted undirected graphs we present cache-oblivious algorithms with O(V · E B logM B E B) I/Os, where B is the block......-size and M is the size of internal memory. For weighted undirected graphs we present a cache-aware APSP algorithm that performs O(V · ( V E B +E B log E B )) I/Os. We also present efficient cacheaware algorithms that find paths between all pairs of vertices in an unweighted graph with lengths within a small...... additive constant of the shortest path length. All of our results improve earlier results known for these problems. For approximate APSP we provide the first nontrivial results. Our diameter result uses O(V + E) extra space, and all of our other algorithms use O(V 2) space....

  6. RTOS BASED SECURE SHORTEST PATH ROUTING ALGORITHM IN MOBILE AD- HOC NETWORKS

    Directory of Open Access Journals (Sweden)

    R. Ramesh

    2011-07-01

    Full Text Available Increase of number of the nodes in the wireless computing environment leads to different issues like power, data rate, QoS, simulators and security. Among these the security is the peak issue faced by most of the wireless networks. Especially networks without having a centralized system (MANETS is facing severe security issues. One of the major security issues is the wormhole attack while finding the shortest path. The aim of this paper is to propose an algorithm to find a secure shortest path against wormhole attack. Existing algorithms are mainly concentrated on detecting the malicious node but they are hardware specific like directional antennas and synchronized clocks. But the proposed algorithm is both software and hardware specific. RTOS is included to make the ad hoc network a real time application.

  7. RTOS Based Secure Shortest Path Routing Algorithm In Mobile Ad- Hoc Networks

    Directory of Open Access Journals (Sweden)

    R. Ramesh

    2011-08-01

    Full Text Available Increase of number of the nodes in the wireless computing environment leads to different issues like power, data rate, QoS, simulators and security. Among these the security is the peak issue faced by most of the wireless networks. Especially networks without having a centralized system (MANETS is facing severe security issues. One of the major security issues is the wormhole attack while finding the shortest path. The aim of this paper is to propose an algorithm to find a secure shortest path against wormhole attack. Existing algorithms are mainly concentrated on detecting the malicious node but they are hardware specific like directional antennas and synchronized clocks. But the proposed algorithm is both software and hardware specific. RTOS is included to make the ad hoc network a real time application.

  8. Modeling the average shortest-path length in growth of word-adjacency networks.

    Science.gov (United States)

    Kulig, Andrzej; Drożdż, Stanisław; Kwapień, Jarosław; Oświȩcimka, Paweł

    2015-03-01

    We investigate properties of evolving linguistic networks defined by the word-adjacency relation. Such networks belong to the category of networks with accelerated growth but their shortest-path length appears to reveal the network size dependence of different functional form than the ones known so far. We thus compare the networks created from literary texts with their artificial substitutes based on different variants of the Dorogovtsev-Mendes model and observe that none of them is able to properly simulate the novel asymptotics of the shortest-path length. Then, we identify the local chainlike linear growth induced by grammar and style as a missing element in this model and extend it by incorporating such effects. It is in this way that a satisfactory agreement with the empirical result is obtained. PMID:25871160

  9. Finding Community Structure in Networks Using a Shortest-Path-Based k-Means Algorithm

    Institute of Scientific and Technical Information of China (English)

    Jinglu GAO

    2013-01-01

    We consider the problem of detecting the community structure in a complex network,groups of nodes with a higher-than-average density of edges connecting them.In this paper we use the simulated annealing strategy to maximize the modularity,which has been indicated as a robust benefit function,associating with a shortest-path-based k-means iterative procedure for network partition.The proposed algorithm can not only find the communities,but also identify the nodes which occupy central positions under the metric of the shortest path within the communities to which they belong.The optimal number of communities can be automatically determined without any prior knowledge about the network structure.The applications to both artificial and real-world networks demonstrate the effectiveness of our algorithm.

  10. Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation

    CERN Document Server

    Wu, Lingkun; Deng, Dingxiong; Cong, Gao; Zhu, Andy Diwen; Zhou, Shuigeng

    2012-01-01

    Computing the shortest path between two given locations in a road network is an important problem that finds applications in various map services and commercial navigation products. The state-of-the-art solutions for the problem can be divided into two categories: spatial-coherence-based methods and vertex-importance-based approaches. The two categories of techniques, however, have not been compared systematically under the same experimental framework, as they were developed from two independent lines of research that do not refer to each other. This renders it difficult for a practitioner to decide which technique should be adopted for a specific application. Furthermore, the experimental evaluation of the existing techniques, as presented in previous work, falls short in several aspects. Some methods were tested only on small road networks with up to one hundred thousand vertices; some approaches were evaluated using distance queries (instead of shortest path queries), namely, queries that ask only for the ...

  11. Minimum-time trajectory planning based on the shortest path for the wheeled mobile robot

    Institute of Scientific and Technical Information of China (English)

    LIN Feng-yun; LV Tian-sheng

    2006-01-01

    The time-optimal trajectory planning is proposed under kinematic and dynamic constraints for a 2-DOF wheeled robot. In order to make full use of the motor' s capacity, we calculate the maximum torque and the minimum torque by considering the maximum heat-converted power generated by the DC motor. The shortest path is planned by using the geometric method under kinematic constraints. Under the bound torques, the velocity limits and the maximum acceleration (deceleration) are obtained by combining with the dynamics. We utilize the phase-plane analysis technique to generate the time optimal trajectory based on the shortest path. At last, the computer simulations for our laboratory mobile robot were performed. The simulation results prove the proposed method is simple and effective for practical use.

  12. ESHOPPS: A COMPUTATIONAL TOOL TO AID THE TEACHING OF SHORTEST PATH ALGORITHMS

    Directory of Open Access Journals (Sweden)

    S. J. de A. LIMA

    2015-07-01

    Full Text Available The development of a computational tool called EShoPPS – Environment for Shortest Path Problem Solving, which is used to assist students in understanding the working of Dijkstra, Greedy search and A*(star algorithms is presented in this paper. Such algorithms are commonly taught in graduate and undergraduate courses of Engineering and Informatics and are used for solving many optimization problems that can be characterized as Shortest Path Problem. The EShoPPS is an interactive tool that allows students to create a graph representing the problem and also helps in developing their knowledge of each specific algorithm. Experiments performed with 155 students of undergraduate and graduate courses such as Industrial Engineering, Computer Science and Information Systems have shown that by using the EShoPPS tool students were able to improve their interpretation of investigated algorithms.

  13. Modeling the average shortest-path length in growth of word-adjacency networks

    Science.gov (United States)

    Kulig, Andrzej; DroŻdŻ, Stanisław; Kwapień, Jarosław; OświÈ©cimka, Paweł

    2015-03-01

    We investigate properties of evolving linguistic networks defined by the word-adjacency relation. Such networks belong to the category of networks with accelerated growth but their shortest-path length appears to reveal the network size dependence of different functional form than the ones known so far. We thus compare the networks created from literary texts with their artificial substitutes based on different variants of the Dorogovtsev-Mendes model and observe that none of them is able to properly simulate the novel asymptotics of the shortest-path length. Then, we identify the local chainlike linear growth induced by grammar and style as a missing element in this model and extend it by incorporating such effects. It is in this way that a satisfactory agreement with the empirical result is obtained.

  14. A branch-and-cut algorithm for the elementary shortest path problem with resource constraints

    DEFF Research Database (Denmark)

    Jepsen, Mads Kehlet; Petersen, Bjørn; Spoorendonk, Simon

    The elementary shortest path with resource constraints have commonly been solved with dynamic programming algorithms. Assuming an undirected graph, we present a compact formulation of this problem and a branch-and-cut algorithm to solve it. Two types of resources are discussed: a capacity...... and a fixed charge resource. The former is the subproblem of the capacitated vehicle routing problem and the latter is from the split delivery version. Computational results are presented and compared to dynamic programming algorithms....

  15. Generating Node Coordinates for Shortest-Path Computations in Transportation Networks

    OpenAIRE

    Brandes, Ulrik; Schulz, Frank; Wagner, Dorothea; Willhalm, Thomas

    2004-01-01

    Speed-up techniques that exploit given node coordinates have proven useful for shortest-path computations in transportation networks and geographic information systems. To facilitate the use of such techniques when coordinates are missing from some, or even all, of the nodes in a network we generate artificial coordinates using methods from graph drawing. Experiments on a large set of German train timetables indicate that the speed-up achieved with coordinates from our drawings is close to th...

  16. An Optimal Distributed Algorithm for All-Pairs Shortest-Path

    OpenAIRE

    Kanchi, Saroja; Vineyard, David

    2004-01-01

    In this paper the network problem of determining all-pairs shortest-path is examined. A distributed algorithm which runs in O(n) time on a network of n nodes is presented. The number of messages of the algorithm is O(e+n log n) where e is the number of communication links of the network. We prove that this algorithm is time optimal.

  17. The Shortest Path Problems in Battery-Electric Vehicle Dispatching with Battery Renewal

    Directory of Open Access Journals (Sweden)

    Minfang Huang

    2016-06-01

    Full Text Available Electric vehicles play a key role for developing an eco-sustainable transport system. One critical component of an electric vehicle is its battery, which can be quickly charged or exchanged before it runs out. The problem of electric vehicle dispatching falls into the category of the shortest path problem with resource renewal. In this paper, we study the shortest path problems in (1 electric transit bus scheduling and (2 electric truck routing with time windows. In these applications, a fully-charged battery allows running a limited operational distance, and the battery before depletion needs to be quickly charged or exchanged with a fully-charged one at a battery management facility. The limited distance and battery renewal result in a shortest path problem with resource renewal. We develop a label-correcting algorithm with state space relaxation to find optimal solutions. In the computational experiments, real-world road geometry data are used to generate realistic travel distances, and other types of data are obtained from the real world or randomly generated. The computational results show that the label-correcting algorithm performs very well.

  18. All-pairs Shortest Path Algorithm based on MPI+CUDA Distributed Parallel Programming Model

    Directory of Open Access Journals (Sweden)

    Qingshuang Wu

    2013-12-01

    Full Text Available In view of the problem that computing shortest paths in a graph is a complex and time-consuming process, and the traditional algorithm that rely on the CPU as computing unit solely can't meet the demand of real-time processing, in this paper, we present an all-pairs shortest paths algorithm using MPI+CUDA hybrid programming model, which can take use of the overwhelming computing power of the GPU cluster to speed up the processing. This proposed algorithm can combine the advantages of MPI and CUDA programming model, and can realize two-level parallel computing. In the cluster-level, we take use of the MPI programming model to achieve a coarse-grained parallel computing between the computational nodes of the GPU cluster. In the node-level, we take use of the CUDA programming model to achieve a GPU-accelerated fine grit parallel computing in each computational node internal. The experimental results show that the MPI+CUDA-based parallel algorithm can take full advantage of the powerful computing capability of the GPU cluster, and can achieve about hundreds of time speedup; The whole algorithm has good computing performance, reliability and scalability, and it is able to meet the demand of real-time processing of massive spatial shortest path analysis

  19. A Practical Parallel Algorithm for All-Pair Shortest Path Based on Pipelining

    Institute of Scientific and Technical Information of China (English)

    Hua Wang; Ling Tian; Chun-Hua Jiang

    2008-01-01

    On the basis of Floyd algorithm with the extended path matrix, a parallel algorithm which resolves all-pair shortest path (APSP) problem on cluster environment is analyzed and designed. Meanwhile, the parallel APSP pipelining algorithm makes full use of overlapping technique between computation and communication. Compared with broadcast operation, the parallel algorithm reduces communication cost. This algorithm has been implemented on MPI on PC-cluster. The theoretical analysis and experimental results show that the parallel algorithm is an efficient and scalable algorithm.

  20. a Modified Genetic Algorithm for Finding Fuzzy Shortest Paths in Uncertain Networks

    Science.gov (United States)

    Heidari, A. A.; Delavar, M. R.

    2016-06-01

    In realistic network analysis, there are several uncertainties in the measurements and computation of the arcs and vertices. These uncertainties should also be considered in realizing the shortest path problem (SPP) due to the inherent fuzziness in the body of expert's knowledge. In this paper, we investigated the SPP under uncertainty to evaluate our modified genetic strategy. We improved the performance of genetic algorithm (GA) to investigate a class of shortest path problems on networks with vague arc weights. The solutions of the uncertain SPP with considering fuzzy path lengths are examined and compared in detail. As a robust metaheuristic, GA algorithm is modified and evaluated to tackle the fuzzy SPP (FSPP) with uncertain arcs. For this purpose, first, a dynamic operation is implemented to enrich the exploration/exploitation patterns of the conventional procedure and mitigate the premature convergence of GA technique. Then, the modified GA (MGA) strategy is used to resolve the FSPP. The attained results of the proposed strategy are compared to those of GA with regard to the cost, quality of paths and CPU times. Numerical instances are provided to demonstrate the success of the proposed MGA-FSPP strategy in comparison with GA. The simulations affirm that not only the proposed technique can outperform GA, but also the qualities of the paths are effectively improved. The results clarify that the competence of the proposed GA is preferred in view of quality quantities. The results also demonstrate that the proposed method can efficiently be utilized to handle FSPP in uncertain networks.

  1. Research on the Optimization and Simulation of the Shortest Path Based on Algorithm of Dijkstra

    Institute of Scientific and Technical Information of China (English)

    2010-01-01

    <正>Dijkstra algorithm is a theoretical basis to solve transportation network problems of the shortest path, which has a wide range of application in path optimization. Through analyzing traditional Dijkstra algorithm,on account of the insufficiency of this algorithm in path optimization,this paper uses adjacency list and circular linked list with combination to store date,and through the improved quick sorting algorithm for weight sorting, accomplish a quick search to the adjacent node,and so an improved Dijkstra algorithm is got.Then apply it to the optimal path search,and make simulation analysis for this algorithm through the example,also verify the effectiveness of the proposed algorithm.

  2. Planning image-guided endovascular interventions: guidewire simulation using shortest path algorithms

    Science.gov (United States)

    Schafer, Sebastian; Singh, Vikas; Hoffmann, Kenneth R.; Noël, Peter B.; Xu, Jinhui

    2007-03-01

    Endovascular interventional procedures are being used more frequently in cardiovascular surgery. Unfortunately, procedural failure, e.g., vessel dissection, may occur and is often related to improper guidewire and/or device selection. To support the surgeon's decision process and because of the importance of the guidewire in positioning devices, we propose a method to determine the guidewire path prior to insertion using a model of its elastic potential energy coupled with a representative graph construction. The 3D vessel centerline and sizes are determined for a specified vessel. Points in planes perpendicular to the vessel centerline are generated. For each pair of consecutive planes, a vector set is generated which joins all points in these planes. We construct a graph representing these vector sets as nodes. The nodes representing adjacent vector sets are joined by edges with weights calculated as a function of the angle between the corresponding vectors (nodes). The optimal path through this weighted directed graph is then determined using shortest path algorithms, such as topological sort based shortest path algorithm or Dijkstra's algorithm. Volumetric data of an internal carotid artery phantom (Ø 3.5mm) were acquired. Several independent guidewire (Ø 0.4mm) placements were performed, and the 3D paths were determined using rotational angiography. The average RMS distance between the actual and the average simulated guidewire path was 0.7mm; the computation time to determine the path was 3 seconds. The ability to predict the guidewire path inside vessels may facilitate calculation of vessel-branch access and force estimation on devices and the vessel wall.

  3. A New Hardware Architecture for Parallel Shortest Path Searching Processor Based-on FPGA Technology

    Directory of Open Access Journals (Sweden)

    Jassim M. Abdul-Jabbar

    2012-09-01

    Full Text Available In this paper, a new FPGA-based parallel processor for shortest path searching for OSPF networks is designed and implemented. The processor design is based on parallel searching algorithm that overcomes the long time execution of the conventional Dijkstra algorithm which is used originally in OSPF network protocol. Multiple shortest links can be found simultaneously and the execution iterations of the processing phase are limited to − instead of of Dijkstra algorithm. Depending on the FPGA chip resources, the processor is expanded to be able to process an OSPF area with 128 routers. High speed up factors of our proposal processor against the sequential Dijkstra execution times, within (76.77-103.45, are achieved.

  4. An improved real-time endovascular guidewire position simulation using shortest path algorithm.

    Science.gov (United States)

    Qiu, Jianpeng; Qu, Zhiyi; Qiu, Haiquan; Zhang, Xiaomin

    2016-09-01

    In this study, we propose a new graph-theoretical method to simulate guidewire paths inside the carotid artery. The minimum energy guidewire path can be obtained by applying the shortest path algorithm, such as Dijkstra's algorithm for graphs, based on the principle of the minimal total energy. Compared to previous results, experiments of three phantoms were validated, revealing that the first and second phantoms overlap completely between simulated and real guidewires. In addition, 95 % of the third phantom overlaps completely, and the remaining 5 % closely coincides. The results demonstrate that our method achieves 87 and 80 % improvements for the first and third phantoms under the same conditions, respectively. Furthermore, 91 % improvements were obtained for the second phantom under the condition with reduced graph construction complexity.

  5. The Structure of the Optimal Solution Set on the Shortest Paths for Networks%网络最短的最优解集结构

    Institute of Scientific and Technical Information of China (English)

    张振坤; 王斌

    2007-01-01

    The shortest path problem in a network G is to find shortest paths between some specified source vertices and terminal vertices when the lengths of edges are given.The structure of the optimal Solutions set on the shortest paths is studied in this Paper.First,the conditions of having unique shortest path between two distinguished vertices s and t in a network G are discussed;Second,the struetural properties of 2-transformation graph G on the shortest-paths for G are presented heavily.

  6. Runtime analysis of ant colony optimization on dynamic shortest path problems

    DEFF Research Database (Denmark)

    Lissovoi, Andrei; Witt, Carsten

    2015-01-01

    A simple ACO algorithm called lambda-MMAS for dynamic variants of the single-destination shortest paths problem is studied by rigorous runtime analyses. Building upon previous results for the special case of 1-MMAS, it is studied to what extent an enlarged colony using lambda ants per vertex helps...... in tracking an oscillating optimum. It is shown that easy cases of oscillations can be tracked by a constant number of ants. However, the paper also identifies more involved oscillations that with overwhelming probability cannot be tracked with any polynomial-size colony. Finally, parameters of...

  7. Runtime analysis of ant colony optimization on dynamic shortest path problems

    DEFF Research Database (Denmark)

    Lissovoi, Andrei; Witt, Carsten

    2013-01-01

    A simple ACO algorithm called λ-MMAS for dynamic variants of the single-destination shortest paths problem is studied by rigorous runtime analyses. Building upon previous results for the special case of 1-MMAS, it is studied to what extent an enlarged colony using $\\lambda$ ants per vertex helps in...... tracking an oscillating optimum. It is shown that easy cases of oscillations can be tracked by a constant number of ants. However, the paper also identifies more involved oscillations that with overwhelming probability cannot be tracked with any polynomial-size colony. Finally, parameters of dynamic...

  8. A Bio-Inspired Method for the Constrained Shortest Path Problem

    Directory of Open Access Journals (Sweden)

    Hongping Wang

    2014-01-01

    optimization, crew scheduling, network routing and so on. It is an open issue since it is a NP-hard problem. In this paper, we propose an innovative method which is based on the internal mechanism of the adaptive amoeba algorithm. The proposed method is divided into two parts. In the first part, we employ the original amoeba algorithm to solve the shortest path problem in directed networks. In the second part, we combine the Physarum algorithm with a bio-inspired rule to deal with the CSP. Finally, by comparing the results with other method using an examples in DCLC problem, we demonstrate the accuracy of the proposed method.

  9. An Investigation of Using Parallel Genetic Algorithm for Solving the Shortest Path Routing Problem

    Directory of Open Access Journals (Sweden)

    Salman Yussof

    2011-01-01

    Full Text Available Problem statement: Shortest path routing is the type of routing widely used in computer network nowadays. Even though shortest path routing algorithms are well established, other alternative methods may have their own advantages. One such alternative is to use a GA-based routing algorithm. According to previous researches, GA-based routing algorithm has been found to be more scalable and insensitive to variations in network topologies. However, it is also known that GA-based routing algorithm is not fast enough for real-time computation. Approach: To improve the computation time of GA-based routing algorithm, this study proposes a coarse-grained parallel GA routing algorithm for solving the shortest path routing problem. The proposed algorithm is evaluated using simulation where the proposed algorithm is executed on networks with various topologies and sizes. The parallel computation is performed using an MPI cluster. Three different experiments were conducted to identify the best value for the migration rate, the accuracy and execution time with respect to the number of computing nodes and speedup achieved as compared to the serial version of the same algorithm. Results: The result of the simulation shows that the best result is achieved for a migration rate around 0.1 and 0.2. The experiments also show that with larger number of computing nodes, accuracy decreases linearly, but computation time decreases exponentially, which justifies the use parallel implementation of GA to improve the speed of GA-based routing algorithm. Finally, the experiments also show that the proposed algorithm is able to achieve a speedup of up to 818.11% on the MPI cluster used to run the simulation. Conclusion/Recommendations: We have successfully shown that the performance of GA-based shortest path routing algorithm can be improved by using a coarse-grained parallel GA implementation. Even though in this study the proposed algorithm is executed

  10. A MODIFIED GENETIC ALGORITHM FOR FINDING FUZZY SHORTEST PATHS IN UNCERTAIN NETWORKS

    Directory of Open Access Journals (Sweden)

    A. A. Heidari

    2016-06-01

    Full Text Available In realistic network analysis, there are several uncertainties in the measurements and computation of the arcs and vertices. These uncertainties should also be considered in realizing the shortest path problem (SPP due to the inherent fuzziness in the body of expert's knowledge. In this paper, we investigated the SPP under uncertainty to evaluate our modified genetic strategy. We improved the performance of genetic algorithm (GA to investigate a class of shortest path problems on networks with vague arc weights. The solutions of the uncertain SPP with considering fuzzy path lengths are examined and compared in detail. As a robust metaheuristic, GA algorithm is modified and evaluated to tackle the fuzzy SPP (FSPP with uncertain arcs. For this purpose, first, a dynamic operation is implemented to enrich the exploration/exploitation patterns of the conventional procedure and mitigate the premature convergence of GA technique. Then, the modified GA (MGA strategy is used to resolve the FSPP. The attained results of the proposed strategy are compared to those of GA with regard to the cost, quality of paths and CPU times. Numerical instances are provided to demonstrate the success of the proposed MGA-FSPP strategy in comparison with GA. The simulations affirm that not only the proposed technique can outperform GA, but also the qualities of the paths are effectively improved. The results clarify that the competence of the proposed GA is preferred in view of quality quantities. The results also demonstrate that the proposed method can efficiently be utilized to handle FSPP in uncertain networks.

  11. A genetic algorithm for the pareto optimal solution set of multi-objective shortest path problem

    Institute of Scientific and Technical Information of China (English)

    HU Shi-cheng; XU Xiao-fei; ZHAN De-chen

    2005-01-01

    Unlike the shortest path problem that has only one optimal solution and can be solved in polynomial time, the multi-objective shortest path problem (MSPP) has a set of pareto optimal solutions and cannot be solved in polynomial time. The present algorithms focused mainly on how to obtain a precisely pareto optimal solution for MSPP resulting in a long time to obtain multiple pareto optimal solutions with them. In order to obtain a set of satisfied solutions for MSPP in reasonable time to meet the demand of a decision maker, a genetic algorithm MSPP-GA is presented to solve the MSPP with typically competing objectives, cost and time, in this paper. The encoding of the solution and the operators such as crossover, mutation and selection are developed.The algorithm introduced pareto domination tournament and sharing based selection operator, which can not only directly search the pareto optimal frontier but also maintain the diversity of populations in the process of evolutionary computation. Experimental results show that MSPP-GA can obtain most efficient solutions distributed all along the pareto frontier in less time than an exact algorithm. The algorithm proposed in this paper provides a new and effective method of how to obtain the set of pareto optimal solutions for other multiple objective optimization problems in a short time.

  12. PHA*: Finding the Shortest Path with A* in An Unknown Physical Environment

    CERN Document Server

    Ben-Yair, A; Kraus, S; Netanyahu, N; Stern, R; 10.1613/jair.1373

    2011-01-01

    We address the problem of finding the shortest path between two points in an unknown real physical environment, where a traveling agent must move around in the environment to explore unknown territory. We introduce the Physical-A* algorithm (PHA*) for solving this problem. PHA* expands all the mandatory nodes that A* would expand and returns the shortest path between the two points. However, due to the physical nature of the problem, the complexity of the algorithm is measured by the traveling effort of the moving agent and not by the number of generated nodes, as in standard A*. PHA* is presented as a two-level algorithm, such that its high level, A*, chooses the next node to be expanded and its low level directs the agent to that node in order to explore it. We present a number of variations for both the high-level and low-level procedures and evaluate their performance theoretically and experimentally. We show that the travel cost of our best variation is fairly close to the optimal travel cost, assuming t...

  13. Analysis of Average Shortest-Path Length of Scale-Free Network

    Directory of Open Access Journals (Sweden)

    Guoyong Mao

    2013-01-01

    Full Text Available Computing the average shortest-path length of a large scale-free network needs much memory space and computation time. Hence, parallel computing must be applied. In order to solve the load-balancing problem for coarse-grained parallelization, the relationship between the computing time of a single-source shortest-path length of node and the features of node is studied. We present a dynamic programming model using the average outdegree of neighboring nodes of different levels as the variable and the minimum time difference as the target. The coefficients are determined on time measurable networks. A native array and multimap representation of network are presented to reduce the memory consumption of the network such that large networks can still be loaded into the memory of each computing core. The simplified load-balancing model is applied on a network of tens of millions of nodes. Our experiment shows that this model can solve the load-imbalance problem of large scale-free network very well. Also, the characteristic of this model can meet the requirements of networks with ever-increasing complexity and scale.

  14. Performance of Thorup's Shortest Path Algorithm for Large-Scale Network Simulation

    Science.gov (United States)

    Sakumoto, Yusuke; Ohsaki, Hiroyuki; Imase, Makoto

    In this paper, we investigate the performance of Thorup's algorithm by comparing it to Dijkstra's algorithm for large-scale network simulations. One of the challenges toward the realization of large-scale network simulations is the efficient execution to find shortest paths in a graph with N vertices and M edges. The time complexity for solving a single-source shortest path (SSSP) problem with Dijkstra's algorithm with a binary heap (DIJKSTRA-BH) is O((M+N)log N). An sophisticated algorithm called Thorup's algorithm has been proposed. The original version of Thorup's algorithm (THORUP-FR) has the time complexity of O(M+N). A simplified version of Thorup's algorithm (THORUP-KL) has the time complexity of O(Mα(N)+N) where α(N) is the functional inverse of the Ackerman function. In this paper, we compare the performances (i.e., execution time and memory consumption) of THORUP-KL and DIJKSTRA-BH since it is known that THORUP-FR is at least ten times slower than Dijkstra's algorithm with a Fibonaccii heap. We find that (1) THORUP-KL is almost always faster than DIJKSTRA-BH for large-scale network simulations, and (2) the performances of THORUP-KL and DIJKSTRA-BH deviate from their time complexities due to the presence of the memory cache in the microprocessor.

  15. COAR: Combining Arc flag with Reach based method for shortest path computation

    Directory of Open Access Journals (Sweden)

    Thangalatha legaz.C

    2012-07-01

    Full Text Available In general shortest path computation from onenode to another in a directed graph is a verycommon task. This problem is fundamentally solvedby the Dijkstra algorithm. There are manytechniques available to speed up the originalDijkstra’s algorithm heuristically. Even then theoptimality of the solution can still be guaranteed.In this project, the various combinations of speeduptechniques are studied and analyzed. By analyzingthe advantages of the arc flag method and reachbased method, the combination of the arc flag andthe reach based method provides better speed upthan the previous combinations and therefore weimprove the speedup of shortest path queries usingthis combination. The main focus of the work is toimplement the combination of Arc flag and Reachbased method to improve the speedup of shortestpath queries. The experimental results werecompared and analyzed for determining betterperformance improvements in random graphs andplanar graphs. The road network for South Indiawith the distance values between districts inTamilnadu are also tested using arcflag method,reach based method and COAR.

  16. Efficient shortest-path-tree computation in network routing based on pulse-coupled neural networks.

    Science.gov (United States)

    Qu, Hong; Yi, Zhang; Yang, Simon X

    2013-06-01

    Shortest path tree (SPT) computation is a critical issue for routers using link-state routing protocols, such as the most commonly used open shortest path first and intermediate system to intermediate system. Each router needs to recompute a new SPT rooted from itself whenever a change happens in the link state. Most commercial routers do this computation by deleting the current SPT and building a new one using static algorithms such as the Dijkstra algorithm at the beginning. Such recomputation of an entire SPT is inefficient, which may consume a considerable amount of CPU time and result in a time delay in the network. Some dynamic updating methods using the information in the updated SPT have been proposed in recent years. However, there are still many limitations in those dynamic algorithms. In this paper, a new modified model of pulse-coupled neural networks (M-PCNNs) is proposed for the SPT computation. It is rigorously proved that the proposed model is capable of solving some optimization problems, such as the SPT. A static algorithm is proposed based on the M-PCNNs to compute the SPT efficiently for large-scale problems. In addition, a dynamic algorithm that makes use of the structure of the previously computed SPT is proposed, which significantly improves the efficiency of the algorithm. Simulation results demonstrate the effective and efficient performance of the proposed approach. PMID:23144039

  17. Adaptive Shortest-Path Routing under Unknown and Stochastically Varying Link States

    CERN Document Server

    Liu, Keqin

    2012-01-01

    We consider the adaptive shortest-path routing problem in wireless networks under unknown and stochastically varying link states. In this problem, we aim to optimize the quality of communication between a source and a destination through adaptive path selection. Due to the randomness and uncertainties in the network dynamics, the quality of each link varies over time according to a stochastic process with unknown distributions. After a path is selected for communication, the aggregated quality of all links on this path (e.g., total path delay) is observed. The quality of each individual link is not observable. We formulate this problem as a multi-armed bandit with dependent arms. We show that by exploiting arm dependencies, a regret polynomial with network size can be achieved while maintaining the optimal logarithmic order with time. This is in sharp contrast with the exponential regret order with network size offered by a direct application of the classic MAB policies that ignore arm dependencies. Furthermo...

  18. Java Based Visulaization and Animation for Teaching The Dijkstra Shortest Path Algorithm in Transportation Networks

    Directory of Open Access Journals (Sweden)

    Ivan Makohon

    2016-05-01

    Full Text Available Shortest path (SP algorithms, such as the popular Dijkstra algorithm has been considered as the “basic building blocks” for many advanced transportation network models. Dijkstra algorithm will find the shortest time (ST and the corresponding SP to travel from a source node to a destination node. Applications of SP algorithms include real-time GPS and the Frank-Wolfe network equilibrium. For transportation engineering students, the Dijkstra algorithm is not easily understood. This paper discusses the design and development of a software that will help the students to fully understand the key components involved in the Dijkstra SP algorithm. The software presents an intuitive interface for generating transportation network nodes/links, and how the SP can be updated in each iteration. The software provides multiple visual representations of colour mapping and tabular display. The software can be executed in each single step or in continuous run, making it easy for students to understand the Dijkstra algorithm. Voice narratives in different languages (English, Chinese and Spanish are available.A demo video of the Dijkstra Algorithm’s animation and result can be viewed online from any web browser using the website: http://www.lions.odu.edu/~imako001/dijkstra/demo/index.html.

  19. A Shortest Dependency Path Based Convolutional Neural Network for Protein-Protein Relation Extraction

    Directory of Open Access Journals (Sweden)

    Lei Hua

    2016-01-01

    Full Text Available The state-of-the-art methods for protein-protein interaction (PPI extraction are primarily based on kernel methods, and their performances strongly depend on the handcraft features. In this paper, we tackle PPI extraction by using convolutional neural networks (CNN and propose a shortest dependency path based CNN (sdpCNN model. The proposed method (1 only takes the sdp and word embedding as input and (2 could avoid bias from feature selection by using CNN. We performed experiments on standard Aimed and BioInfer datasets, and the experimental results demonstrated that our approach outperformed state-of-the-art kernel based methods. In particular, by tracking the sdpCNN model, we find that sdpCNN could extract key features automatically and it is verified that pretrained word embedding is crucial in PPI task.

  20. A Shortest Dependency Path Based Convolutional Neural Network for Protein-Protein Relation Extraction.

    Science.gov (United States)

    Hua, Lei; Quan, Chanqin

    2016-01-01

    The state-of-the-art methods for protein-protein interaction (PPI) extraction are primarily based on kernel methods, and their performances strongly depend on the handcraft features. In this paper, we tackle PPI extraction by using convolutional neural networks (CNN) and propose a shortest dependency path based CNN (sdpCNN) model. The proposed method (1) only takes the sdp and word embedding as input and (2) could avoid bias from feature selection by using CNN. We performed experiments on standard Aimed and BioInfer datasets, and the experimental results demonstrated that our approach outperformed state-of-the-art kernel based methods. In particular, by tracking the sdpCNN model, we find that sdpCNN could extract key features automatically and it is verified that pretrained word embedding is crucial in PPI task.

  1. A Shortest Dependency Path Based Convolutional Neural Network for Protein-Protein Relation Extraction

    Science.gov (United States)

    Quan, Chanqin

    2016-01-01

    The state-of-the-art methods for protein-protein interaction (PPI) extraction are primarily based on kernel methods, and their performances strongly depend on the handcraft features. In this paper, we tackle PPI extraction by using convolutional neural networks (CNN) and propose a shortest dependency path based CNN (sdpCNN) model. The proposed method (1) only takes the sdp and word embedding as input and (2) could avoid bias from feature selection by using CNN. We performed experiments on standard Aimed and BioInfer datasets, and the experimental results demonstrated that our approach outperformed state-of-the-art kernel based methods. In particular, by tracking the sdpCNN model, we find that sdpCNN could extract key features automatically and it is verified that pretrained word embedding is crucial in PPI task. PMID:27493967

  2. Enhanced Genetic Algorithm approach for Solving Dynamic Shortest Path Routing Problems using Immigrants and Memory Schemes

    CERN Document Server

    Nair, T R Gopalakrishnan; Yashoda, M B

    2011-01-01

    In Internet Routing, the static shortest path (SP) problem has been addressed using well known intelligent optimization techniques like artificial neural networks, genetic algorithms (GAs) and particle swarm optimization. Advancement in wireless communication lead more and more mobile wireless networks, such as mobile networks [mobile ad hoc networks (MANETs)] and wireless sensor networks. Dynamic nature of the network is the main characteristic of MANET. Therefore, the SP routing problem in MANET turns into dynamic optimization problem (DOP). Here the nodes ae made aware of the environmental condition, thereby making it intelligent, which goes as the input for GA. The implementation then uses GAs with immigrants and memory schemes to solve the dynamic SP routing problem (DSPRP) in MANETS. In our paper, once the network topology changes, the optimal solutions in the new environment can be searched using the new immigrants or the useful information stored in the memory. Results shows GA with new immigrants sho...

  3. Implantation of the global dynamic routing scheme in scale-free networks under the shortest path strategy

    Science.gov (United States)

    Ben Haddou, N.; Ez-zahraouy, H.; Rachadi, A.

    2016-07-01

    The shortest path is a basic routing model which is still used in many systems. However, due to the low exploitation of the delivery capacity of peripheral nodes, the performance achieved by this policy is very limited. Starting from the fact that changing all network routers by others more robust is not practical, we propose the improvement of the capacity of a scale-free network under the shortest path strategy by the implantation of global dynamic routers. We have studied two targeting approaches to designate specific nodes to route the packets following the global dynamic protocol; one is based on node degree and the other on its betweenness. We show that we already exceed twice the capacity under the shortest path protocol with only 4% of global dynamic routers when we target nodes with high betweenness and 10% when we target nodes with high degrees. Moreover, the average travelling time remains low while the network capacity increases.

  4. Identification of Lung-Cancer-Related Genes with the Shortest Path Approach in a Protein-Protein Interaction Network

    Directory of Open Access Journals (Sweden)

    Bi-Qing Li

    2013-01-01

    Full Text Available Lung cancer is one of the leading causes of cancer mortality worldwide. The main types of lung cancer are small cell lung cancer (SCLC and nonsmall cell lung cancer (NSCLC. In this work, a computational method was proposed for identifying lung-cancer-related genes with a shortest path approach in a protein-protein interaction (PPI network. Based on the PPI data from STRING, a weighted PPI network was constructed. 54 NSCLC- and 84 SCLC-related genes were retrieved from associated KEGG pathways. Then the shortest paths between each pair of these 54 NSCLC genes and 84 SCLC genes were obtained with Dijkstra’s algorithm. Finally, all the genes on the shortest paths were extracted, and 25 and 38 shortest genes with a permutation P value less than 0.05 for NSCLC and SCLC were selected for further analysis. Some of the shortest path genes have been reported to be related to lung cancer. Intriguingly, the candidate genes we identified from the PPI network contained more cancer genes than those identified from the gene expression profiles. Furthermore, these genes possessed more functional similarity with the known cancer genes than those identified from the gene expression profiles. This study proved the efficiency of the proposed method and showed promising results.

  5. K-Shortest-Path-Based Evacuation Routing with Police Resource Allocation in City Transportation Networks.

    Directory of Open Access Journals (Sweden)

    Yunyue He

    Full Text Available Emergency evacuation aims to transport people from dangerous places to safe shelters as quickly as possible. Police play an important role in the evacuation process, as they can handle traffic accidents immediately and help people move smoothly on roads. This paper investigates an evacuation routing problem that involves police resource allocation. We propose a novel k-th-shortest-path-based technique that uses explicit congestion control to optimize evacuation routing and police resource allocation. A nonlinear mixed-integer programming model is presented to formulate the problem. The model's objective is to minimize the overall evacuation clearance time. Two algorithms are given to solve the problem. The first one linearizes the original model and solves the linearized problem with CPLEX. The second one is a heuristic algorithm that uses a police resource utilization efficiency index to directly solve the original model. This police resource utilization efficiency index significantly aids in the evaluation of road links from an evacuation throughput perspective. The proposed algorithms are tested with a number of examples based on real data from cities of different sizes. The computational results show that the police resource utilization efficiency index is very helpful in finding near-optimal solutions. Additionally, comparing the performance of the heuristic algorithm and the linearization method by using randomly generated examples indicates that the efficiency of the heuristic algorithm is superior.

  6. Lecturers' and Students’ Perception on Learning Dijkstra’s Shortest Path Algorithm Through Mobile Devices

    Directory of Open Access Journals (Sweden)

    Mazyar Seraj

    2014-06-01

    Full Text Available In recent years, many studies have been carried out on how to engage and support students in e-learning environments. Portable devices such as Personal Digital Assistants (PDAs, Tablet PCs, mobile phones and other mobile equipment have been used as parts of electronic learning environments to facilitate learning and teaching for both lecturers and students. However, there is still a dearth of study investigating the effects of small screen interfaces on mobile-based learning environments. This study aims to address two objectives: (i investigate lecturer and student difficulties encountered in teaching-learning process in traditional face-to-face classroom settings, and (ii to explore lecturer and student perceptions about learning the subject through mobile devices. This paper presents the results of a qualitative study using structured interviews to investigate lecturer and student experiences and perceptions on teaching and learning Dijkstra’s shortest path algorithm via mobile devices. The interview insights were then used as inputs to define user requirements for a mobile learning prototype. The findings show that the lecturers and students raised many issues about interactivity and the flexibility of effective learning applications on small screen devices, especially for a technical subject.

  7. Protein-fold recognition using an improved single-source K diverse shortest paths algorithm.

    Science.gov (United States)

    Lhota, John; Xie, Lei

    2016-04-01

    Protein structure prediction, when construed as a fold recognition problem, is one of the most important applications of similarity search in bioinformatics. A new protein-fold recognition method is reported which combines a single-source K diverse shortest path (SSKDSP) algorithm with Enrichment of Network Topological Similarity (ENTS) algorithm to search a graphic feature space generated using sequence similarity and structural similarity metrics. A modified, more efficient SSKDSP algorithm is developed to improve the performance of graph searching. The new implementation of the SSKDSP algorithm empirically requires 82% less memory and 61% less time than the current implementation, allowing for the analysis of larger, denser graphs. Furthermore, the statistical significance of fold ranking generated from SSKDSP is assessed using ENTS. The reported ENTS-SSKDSP algorithm outperforms original ENTS that uses random walk with restart for the graph search as well as other state-of-the-art protein structure prediction algorithms HHSearch and Sparks-X, as evaluated by a benchmark of 600 query proteins. The reported methods may easily be extended to other similarity search problems in bioinformatics and chemoinformatics. The SSKDSP software is available at http://compsci.hunter.cuny.edu/~leixie/sskdsp.html. Proteins 2016; 84:467-472. © 2016 Wiley Periodicals, Inc. PMID:26800480

  8. The shortest path problem in the stochastic networks with unstable topology.

    Science.gov (United States)

    Shirdel, Gholam H; Abdolhosseinzadeh, Mohsen

    2016-01-01

    The stochastic shortest path length is defined as the arrival probability from a given source node to a given destination node in the stochastic networks. We consider the topological changes and their effects on the arrival probability in directed acyclic networks. There is a stable topology which shows the physical connections of nodes; however, the communication between nodes does not stable and that is defined as the unstable topology where arcs may be congested. A discrete time Markov chain with an absorbing state is established in the network according to the unstable topological changes. Then, the arrival probability to the destination node from the source node in the network is computed as the multi-step transition probability of the absorption in the final state of the established Markov chain. It is assumed to have some wait states, whenever there is a physical connection but it is not possible to communicate between nodes immediately. The proposed method is illustrated by different numerical examples, and the results can be used to anticipate the probable congestion along some critical arcs in the delay sensitive networks. PMID:27652102

  9. Strength Pareto Evolutionary Algorithm based Multi-Objective Optimization for Shortest Path Routing Problem in Computer Networks

    Directory of Open Access Journals (Sweden)

    Subbaraj Potti

    2011-01-01

    Full Text Available Problem statement: A new multi-objective approach, Strength Pareto Evolutionary Algorithm (SPEA, is presented in this paper to solve the shortest path routing problem. The routing problem is formulated as a multi-objective mathematical programming problem which attempts to minimize both cost and delay objectives simultaneously. Approach: SPEA handles the shortest path routing problem as a true multi-objective optimization problem with competing and noncommensurable objectives. Results: SPEA combines several features of previous multi-objective evolutionary algorithms in a unique manner. SPEA stores nondominated solutions externally in another continuously-updated population and uses a hierarchical clustering algorithm to provide the decision maker with a manageable pareto-optimal set. SPEA is applied to a 20 node network as well as to large size networks ranging from 50-200 nodes. Conclusion: The results demonstrate the capabilities of the proposed approach to generate true and well distributed pareto-optimal nondominated solutions.

  10. Impacts of Different Mobile User Interfaces on Students’ Satisfaction for Learning Dijkstra’s Shortest Path Algorithm

    Directory of Open Access Journals (Sweden)

    Mazyar Seraj

    2014-10-01

    Full Text Available This paper describes an experimental study of learning Dijkstra’s shortest path algorithm on mobile devices. The aim of the study is to investigate and compare the impacts of two different mobile screen user interfaces on students’ satisfaction for learning the technical subject. A mobile learning prototype was developed for learning Dijkstra’s shortest path algorithm on Apple iPhone 4 operated on iPhone operating system (iOS, and Acer Inconia Tab operated on an Android operating system. Thirty students, who are either currently studying or had previously studied Computer Networks, were recruited for the usability trial. At the end of each single session, students’ satisfaction interacting with the two mobile devices was measured using QUIS questionnaire. Although there is no significant difference in students’ satisfaction between the two different mobile screen interfaces, the subjective findings indicate that Acer Inconia Tab gained higher scores as compared to Apple iPhone 4.

  11. Shortest multiple disconnected path for the analysis of entanglements in two- and three-dimensional polymeric systems

    Science.gov (United States)

    Kröger, Martin

    2005-06-01

    We present an algorithm which returns a shortest path and related number of entanglements for a given configuration of a polymeric system in 2 or 3 dimensions. Rubinstein and Helfand, and later Everaers et al. introduced a concept to extract primitive paths for dense polymeric melts made of linear chains (a multiple disconnected multibead 'path'), where each primitive path is defined as a path connecting the (space-fixed) ends of a polymer under the constraint of non-interpenetration (excluded volume) between primitive paths of different chains, such that the multiple disconnected path fulfills a minimization criterion. The present algorithm uses geometrical operations and provides a—model independent—efficient approximate solution to this challenging problem. Primitive paths are treated as 'infinitely' thin (we further allow for finite thickness to model excluded volume), and tensionless lines rather than multibead chains, excluded volume is taken into account without a force law. The present implementation allows to construct a shortest multiple disconnected path (SP) for 2D systems (polymeric chain within spherical obstacles) and an optimal SP for 3D systems (collection of polymeric chains). The number of entanglements is then simply obtained from the SP as either the number of interior kinks, or from the average length of a line segment. Further, information about structure and potentially also the dynamics of entanglements is immediately available from the SP. We apply the method to study the 'concentration' dependence of the degree of entanglement in phantom chain systems. Program summaryTitle of program:Z Catalogue number:ADVG Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADVG Program obtainable from: CPC Program Library, Queen's University of Belfast, N. Ireland Computer for which the program is designed and others on which it has been tested: Silicon Graphics (Irix), Sun (Solaris), PC (Linux) Operating systems or monitors under which the

  12. ACL2 Meets the GPU: Formalizing a CUDA-based Parallelizable All-Pairs Shortest Path Algorithm in ACL2

    Directory of Open Access Journals (Sweden)

    David S. Hardin

    2013-04-01

    Full Text Available As Graphics Processing Units (GPUs have gained in capability and GPU development environments have matured, developers are increasingly turning to the GPU to off-load the main host CPU of numerically-intensive, parallelizable computations. Modern GPUs feature hundreds of cores, and offer programming niceties such as double-precision floating point, and even limited recursion. This shift from CPU to GPU, however, raises the question: how do we know that these new GPU-based algorithms are correct? In order to explore this new verification frontier, we formalized a parallelizable all-pairs shortest path (APSP algorithm for weighted graphs, originally coded in NVIDIA's CUDA language, in ACL2. The ACL2 specification is written using a single-threaded object (stobj and tail recursion, as the stobj/tail recursion combination yields the most straightforward translation from imperative programming languages, as well as efficient, scalable executable specifications within ACL2 itself. The ACL2 version of the APSP algorithm can process millions of vertices and edges with little to no garbage generation, and executes at one-sixth the speed of a host-based version of APSP coded in C – a very respectable result for a theorem prover. In addition to formalizing the APSP algorithm (which uses Dijkstra's shortest path algorithm at its core, we have also provided capability that the original APSP code lacked, namely shortest path recovery. Path recovery is accomplished using a secondary ACL2 stobj implementing a LIFO stack, which is proven correct. To conclude the experiment, we ported the ACL2 version of the APSP kernels back to C, resulting in a less than 5% slowdown, and also performed a partial back-port to CUDA, which, surprisingly, yielded a slight performance increase.

  13. A REFINEMENT OF DIJKSTRA’S ALGORITHM FOR EXTRACTION OF SHORTEST PATHS IN GENERALIZED REAL TIME-MULTIGRAPHS

    Directory of Open Access Journals (Sweden)

    Siddhartha Sankar Biswas

    2014-01-01

    Full Text Available The networks of the present day communication systems, be it a public road transportation system or a MANET or an Adhoc Network, frequently face a lot of uncertainties in particular regarding traffic jam, flood or water logging or PWD maintenance work (in case of public road network, attack or damage from internal or external agents, sudden failure of one or few nodes. Consequently, at a real instant of time, the existing links/arcs of a given network (graph are not always in their original/excellent condition physically or logically, rather in a weaker condition, or even sometimes disabled or blocked temporarily and waiting for maintenance/repair; and hence ultimately causing delay in communication or transportation. We do not take any special consideration if few of the links be in a better condition at the real time of communication, we consider only such cases where few links are in inferior condition (partially or fully damaged. The classical Dijkstra’s algorithm to find the shortest path in graphs is applicable only if we assume that all the links of the concerned graph are available at their original (ideal condition at that real time of communication, but at real time scenario it is not the case. Consequently, the mathematically calculated shortest path extracted by using Dijkstra’s algorithm may become costlier (even in-feasible in some cases in terms of time and/or in terms of other overhead costs; whereas some other path may be the most efficient or most optimal. Many real life situations of communication network or transportation network cannot be modeled into graphs, but can be well modeled into multigraphs because of the scope of dealing with multiple links (or arcs connecting a pair of nodes. The classical Dijkstra’s algorithm to find the shortest path in graphs is not applicable to multigraphs. In this study the authors make a refinement of the classical Dijkstra’s algorithm to make it applicable to directed multigraphs

  14. Spatially-global integration of closed, fragmented contours by finding the shortest-path in a log-polar representation.

    Science.gov (United States)

    Kwon, TaeKyu; Agrawal, Kunal; Li, Yunfeng; Pizlo, Zygmunt

    2016-09-01

    Finding the occluding contours of objects in real 2D retinal images of natural 3D scenes is done by determining, which contour fragments are relevant, and the order in which they should be connected. We developed a model that finds the closed contour represented in the image by solving a shortest path problem that uses a log-polar representation of the image; the kind of representation known to exist in area V1 of the primate cortex. The shortest path in a log-polar representation favors the smooth, convex and closed contours in the retinal image that have the smallest number of gaps. This approach is practical because finding a globally-optimal solution to a shortest path problem is computationally easy. Our model was tested in four psychophysical experiments. In the first two experiments, the subject was presented with a fragmented convex or concave polygon target among a large number of unrelated pieces of contour (distracters). The density of these pieces of contour was uniform all over the screen to minimize spatially-local cues. The orientation of each target contour fragment was randomly perturbed by varying the levels of jitter. Subjects drew a closed contour that represented the target's contour on a screen. The subjects' performance was nearly perfect when the jitter-level was low. Their performance deteriorated as jitter-levels were increased. The performance of our model was very similar to our subjects'. In two subsequent experiments, the subject was asked to discriminate a briefly-presented egg-shaped object while maintaining fixation at several different positions relative to the closed contour of the shape. The subject's discrimination performance was affected by the fixation position in much the same way as the model's.

  15. Performance Evaluation of Bionomic Algorithm (BA in Comparison with Genetic Algorithm (GA for Shortest Path Finding Problem

    Directory of Open Access Journals (Sweden)

    Saira Beg

    2011-11-01

    Full Text Available This paper presents performance evaluation of Bionomic Algorithm (BA for Shortest Path Finding (SPF problem as compared with the performance of Genetic Algorithm (GA for the same problem. SPF is a classical problem having many applications in networks, robotics and electronics etc. SPF problem has been solved using different algorithms such as Dijkstras Algorithm, Floyd including GA, Neural Network (NN, Tabu Search (TS, and Ant Colony Optimization (ACO etc. We have employed Bionomic Algorithm for solving the SPF problem and have given the performance comparison of BA vs. GA for the same problem. Simulation results are presented at the end which is carried out using MATLAB.

  16. Finding the biased-shortest path with minimal congestion in networks via linear-prediction of queue length

    Science.gov (United States)

    Shen, Yi; Ren, Gang; Liu, Yang

    2016-06-01

    In this paper, we propose a biased-shortest path method with minimal congestion. In the method, we use linear-prediction to estimate the queue length of nodes, and propose a dynamic accepting probability function for nodes to decide whether accept or reject the incoming packets. The dynamic accepting probability function is based on the idea of homogeneous network flow and is developed to enable nodes to coordinate their queue length to avoid congestion. A path strategy incorporated with the linear-prediction of the queue length and the dynamic accepting probability function of nodes is designed to allow packets to be automatically delivered on un-congested paths with short traveling time. Our method has the advantage of low computation cost because the optimal paths are dynamically self-organized by nodes in the delivering process of packets with local traffic information. We compare our method with the existing methods such as the efficient path method (EPS) and the optimal path method (OPS) on the BA scale-free networks and a real example. The numerical computations show that our method performs best for low network load and has minimum run time due to its low computational cost and local routing scheme.

  17. Efficient Interactive Methods for a Class of Multiattribute Shortest Path Problems

    OpenAIRE

    Mordechai I. Henig

    1994-01-01

    Given an acyclic network and a preference-order relation on paths, when and how can Bellman's principle of optimality be combined with interactive programming to efficiently locate an optimal path? We show that if preferences are defined via a collection of attributes, then, under common conditions, the principle of optimality is valid if and only if the preferences can be represented by a linear (value) function over the attributes. Consequently, an interactive programming method is suggeste...

  18. THE USE OF GIS TECHNOLOGY TO IDENTIFY THE SHORTEST TRAVEL PATHS. CASE STUDY: THE CITY OF CRAIOVA

    Directory of Open Access Journals (Sweden)

    DANIEL SIMULESCU

    2012-04-01

    Full Text Available In a city with a population of 298.928 inhabitants (January 2009, about 278.7 km of road (without the northern ring road and a road density of 3.1 km/km2, identifying the optimal routes for moving vehicles is a necessary operation under the temporary removal of use (28 months, from March 2011 of some street sectors in the downtown area, which is currently the subject of an infrastructure modernization work, in order to streamline the cars traffic.The optimal routes were identified using Network Analyst extension of ArcGIS Desktop 9.2 software, which calculated the shortest paths between a point of departure and an arrival one, using distance as impedance. In this case the points between which it was intended to identify the shortest routes were selected taking into account the fact that much of the Craiova’s population located in the north – western neighborhoods, faces traffic problems while they are moving toward the center of city. Therefore, this material is intended to be a support, resulted in some maps, in order to identity and choose the best travel route.

  19. A computational study identifies HIV progression-related genes using mRMR and shortest path tracing.

    Directory of Open Access Journals (Sweden)

    Chengcheng Ma

    Full Text Available Since statistical relationships between HIV load and CD4+ T cell loss have been demonstrated to be weak, searching for host factors contributing to the pathogenesis of HIV infection becomes a key point for both understanding the disease pathology and developing treatments. We applied Maximum Relevance Minimum Redundancy (mRMR algorithm to a set of microarray data generated from the CD4+ T cells of viremic non-progressors (VNPs and rapid progressors (RPs to identify host factors associated with the different responses to HIV infection. Using mRMR algorithm, 147 gene had been identified. Furthermore, we constructed a weighted molecular interaction network with the existing protein-protein interaction data from STRING database and identified 1331 genes on the shortest-paths among the genes identified with mRMR. Functional analysis shows that the functions relating to apoptosis play important roles during the pathogenesis of HIV infection. These results bring new insights of understanding HIV progression.

  20. AN UPDATE STRATEGY FOR SHORTEST PATH OF GRAPH NET%网络最短路径的一种更新策略

    Institute of Scientific and Technical Information of China (English)

    程远

    2013-01-01

    求解最短路径问题被广泛用于求解现实中的搜索相关问题.然而现实瞬息万变,一个连通网络的节点常常发生变动,而一旦发生改变,传统算法必须再次计算从源点到各节点的最短路径.然而虽然节点发生了变动,可是最短路径却未必全部发生了改变,这就造成了不必要的浪费.鉴于此提出一种基于Dijkstra算法的最短路更新策略,将Dijkstra算法做了改进,使其不必重新计算也能在连通图发生改变的时候更新最短路径.%Solving the shortest path has been widely applied to solve searching relative issues in reality. However, as the reality is ever-changing, the node which connects the graph net is frequently changing as well, and, once it' s changed, the traditional algorithm has to recalculate the shortest path from the source point to each node. But, though the node has changed, it does not mean that all of the shortest path will be changed too, which will result in unnecessary waste. In this regard, in the article we propose a Dijkatra algorithm-based shortest path update policy, make the improvement on Dijkatra algorithm, and enable it to update the shortest path without recalculation when the connected graph changes.

  1. Distributed Localization Algorithm for Wireless Sensor Network Based on Multidimensional Scaling and the Shortest Path Distance Correction

    Institute of Scientific and Technical Information of China (English)

    DING Yingqiang; DU Liufeng; YANG Ting; SUN Yugeng

    2009-01-01

    Sensor localization is crucial for the configuration and applications of wireless sensor network (WSN). A novel distributed localization algorithm, MDS-DC was proposed for wireless sensor network based on multidi-mensional scaling (MDS) and the shortest path distance correction. In MDS-DC, several local positioning regions with reasonable distribution were firstly constructed by an adaptive search algorithm, which ensures the mergence between the local relative maps of the adjacent local position regions and can reduce the number of common nodes in the network. Then, based on the relationships between the estimated distances and actual distances of anchors, the distance estimation vectors of sensors around anchors were corrected in each local positioning region. During the computations of the local relative coordinates, an iterative process, which is the combination of classical MDS algorithm and SMACOF algorithm, was applied. Finally, the global relative positions or absolute positions of sen-sors were obtained through merging the relative maps of all local positioning regions. Simulation results show that MDS-DC has better performances in positioning precision, energy efficiency and robustness to range error, which can meet the requirements of applications for sensor localization in WSN.

  2. New Bounds for Old Algorithms: On the Average-Case Behavior of Classic Single-Source Shortest-Paths Approaches

    Science.gov (United States)

    Meyer, Ulrich; Negoescu, Andrei; Weichert, Volker

    Despite disillusioning worst-case behavior, classic algorithms for single-source shortest-paths (SSSP) like Bellman-Ford are still being used in practice, especially due to their simple data structures. However, surprisingly little is known about the average-case complexity of these approaches. We provide new theoretical and experimental results for the performance of classic label-correcting SSSP algorithms on graph classes with non-negative random edge weights. In particular, we prove a tight lower bound of Ω(n 2) for the running times of Bellman-Ford on a class of sparse graphs with O(n) nodes and edges; the best previous bound was Ω(n 4/3 - ɛ ). The same improvements are shown for Pallottino's algorithm. We also lift a lower bound for the approximate bucket implementation of Dijkstra's algorithm from Ω(n logn / loglogn) to Ω(n 1.2 - ɛ ). Furthermore, we provide an experimental evaluation of our new graph classes in comparison with previously used test inputs.

  3. RNAspa: a shortest path approach for comparative prediction of the secondary structure of ncRNA molecules

    Directory of Open Access Journals (Sweden)

    Michaeli Shulamit

    2007-10-01

    Full Text Available Abstract Background In recent years, RNA molecules that are not translated into proteins (ncRNAs have drawn a great deal of attention, as they were shown to be involved in many cellular functions. One of the most important computational problems regarding ncRNA is to predict the secondary structure of a molecule from its sequence. In particular, we attempted to predict the secondary structure for a set of unaligned ncRNA molecules that are taken from the same family, and thus presumably have a similar structure. Results We developed the RNAspa program, which comparatively predicts the secondary structure for a set of ncRNA molecules in linear time in the number of molecules. We observed that in a list of several hundred suboptimal minimal free energy (MFE predictions, as provided by the RNAsubopt program of the Vienna package, it is likely that at least one suggested structure would be similar to the true, correct one. The suboptimal solutions of each molecule are represented as a layer of vertices in a graph. The shortest path in this graph is the basis for structural predictions for the molecule. We also show that RNA secondary structures can be compared very rapidly by a simple string Edit-Distance algorithm with a minimal loss of accuracy. We show that this approach allows us to more deeply explore the suboptimal structure space. Conclusion The algorithm was tested on three datasets which include several ncRNA families taken from the Rfam database. These datasets allowed for comparison of the algorithm with other methods. In these tests, RNAspa performed better than four other programs.

  4. 浅议求解最短路径问题的两种算法%Discussion on Two Algorithms Used to Solve the Shortest Path Problem

    Institute of Scientific and Technical Information of China (English)

    高岚

    2015-01-01

    This paper has compared two algorithm using to solve the shortest path problem: Dijkstra algorithm and Floyd algorithm in designing philosophy, solving process and application instance. Also give discussion on their features and applications.%本文通过对比求解最短路径问题的Dijkstra算法和Floyd算法的设计思想、求解过程和应用实例,讨论了两种算法的特点及适用领域。

  5. A Kind of Shortest Path Algorithm Based on Dijkstra%一种基于Dijkstra最短路径算法的改进算法

    Institute of Scientific and Technical Information of China (English)

    王智广; 王兴会; 李妍

    2012-01-01

    Shortest path algorithm has important practical value in engineering practice and Dijkstra algorithm is a classical algorithm for solving the shortest path. Dijkstra algorithm is the theoretical basis for many practical works to solve the shortest path problem, but many of the restrictions involved in the actual project,therefore,there must be the algorithm improvement and optimization. On the basis of analyzing the classical Dijkstra algorithm,the paper discusses an improved algorithm of Dijkstra algorithm. By using Map which is stored in the algorithm to the adjacency table,it can avoid the limitations of the adjacency matrix in the project: Moreover,in the calculation of the shortest path,using a combination of the priority queue with reverse N-tree. In order to down grade the priority queue to improve the Dijkstra algorithm. The paper puts forwards the methods and processes to improve the shape Dijkstra algorithm,and analyzes the complexity of the algorithm and do some detailed testing and results analysis.%Dijkstra算法是求解最短路径的经典算法,是在许多应用中解决最短路径问题的理论基础,但实际应用中涉及的许多限制条件要求人们必须对该算法进行改进和优化.在分析经典Dijkstra算法思想的基础上,给出Dijkstra算法的一种改进算法.在该算法中图的存储表示采用邻接表的方式,避免邻接矩阵在工程应用中的局限性.在最短路径的计算过程中,采用优先级队列与反向N叉树相结合的方式,以便通过实现可降级的优先队列来改进Dijkstra算法.给出了改进形Dijkstra算法的方法和流程,分析了其算法复杂度,并对改进后的算法进了详细的分析和测试.

  6. 基于点割集的并行最短路径算法%Parallel Shortest Path Algorithm Based on Vertex Cut-set

    Institute of Scientific and Technical Information of China (English)

    张清华; 李鸿; 沈文

    2012-01-01

    In this paper, research and analysis on the basis of the Dijkstra algorithm, the Dijkstra algorithm by introducing the vertex of cut sets and cut the vertex of idea to improve the Dijkstra algorithm, this method first vertex cut-set or cut vertex to the original problem is decomposed into multiple sub-graph, then the shortest path on each sub-graph parallel to the shortest path of the original problem, and finally obtained by the vertex cut-set or cut vertex, which reduces the time complexity of the algorithm and improves the efficiency of the algorithm.%在研究和分析了Dijkstra算法的基础上,在Dijkstra算法中通过引入点割集和割点的思想来改进Dijkstra算法,该方法首先利用点割集或割点把原问题分解成多个子图,然后对每个子图并行求最短路径,最后通过点割集或割点求出整个原问题的最短路径,从而降低算法的时间复杂度,提高算法的效率.

  7. 基于Java的Dijkstra最短路径算法实现%Implementation of Dijkstra Shortest Path Algorithm Based on Java

    Institute of Scientific and Technical Information of China (English)

    段汝东; 侯至群; 朱大明

    2016-01-01

    The shortest path is the optimal solution to get the distance from a node to all other nodes. Traditional Dijkstra algorithm is the most classical algorithm to find the shortest path and is the basis of optimizing algorithm. The paper introduces the corresponding concepts of the traditional Dijkstra algorithm and its working principle. Then the algorithm is realized by Java, the pseudo key codes and operational results are given at last.%最短路径是一个顶点到其他所有顶点的距离的最优解。传统Dijkstra算法是求最短路径最经典的算法,是后续最短路径算法改进的基础。本文介绍了传统Dijkstra算法的相关概念及其实现原理,使用Java编程语言实现算法,最后给出关键伪码和运行结果。

  8. 基于图论的物流配送最短路径比较研究%Research on Comparative of Logistics Shortest Path Based on Graph Theory

    Institute of Scientific and Technical Information of China (English)

    王华

    2012-01-01

    通过实例对比分析Dijkstra算法和Floyd算法特点及适用性,选用Dijkstra算法计算物流配送的最短路径,给出Dijkstra算法求解最短路径问题的实现方法及步骤并集成了一个小型系统,使用随机生成的数据进行最短路径求解,将生成的最短路径在随机生成的图上进行演示,并计算出两种算法执行时间,以期对物流配送中点对点的最短路径有所帮助.%Dijkstra and Floyd algorithms are analyzed in solving the shortest Path of logistics by example, Dijkstra algorithm is selected in logistics shortest path and give the shortest path problem of implementation are gave and a small system is integrated. Random data is used to solve the shortest path, result to help in finding the shortest path in logistics and distribution in Graph.

  9. Traffic Shortest Path Application Based on the Network Segmentation Technology%基于网络分割技术的交通最短路径应用

    Institute of Scientific and Technical Information of China (English)

    赵俊军; 刘士锋; 张直云

    2015-01-01

    On the basis of analyzing the complexity of various algorithms,this paper expounds the princi-ple of parallel algorithms and the design of related parameters to improve the efficiency of real -time algo-rithms of large -scale urban road network.Based on the deep analysis of the complexity of the algorithm for the shortest path problem,the network segmentation technology of the label algorithm is used to sim-plify the processing of the road network in Kunming.Parallel algorithm for the shortest path problem is discussed.Through simulation modeling,data confirmed that the parallel optimization algorithm based on the shortest path,even for coarse grid points,the situation subdivision,still be able to ensure a strong speedup and higher operating efficiency and has good portability.%为了提高城市大规模路网实时算法的效率,在分析各种算法复杂度基础上,阐述并行算法原理及相关参数设计。基于对最短路问题各种算法复杂度的深入分析,采用标号算法中的网络分割技术,将昆明市道路网络简化处理,分割为若干小的子网络。在此基础上对最短路径问题的并行算法进行了探讨。通过仿真实验模拟,数据证实了基于并行算法的最短路径优化算法,即使面向网格粗分、细分的情形,仍然能够保证强劲的加速比和较高的运行效率,且具有良好的可移植性。

  10. Improved Dijkstra Shortest Path Algorithm and its Application%改进的Dijkstra最短路径算法及其应用研究

    Institute of Scientific and Technical Information of China (English)

    王树西; 吴政学

    2012-01-01

    求最短路径是一个应用很广泛的问题.求最短路径的算法有很多,公认较好的算法是Dijkstra标号法.但实验结果表明,Dijkstra标号法有需要改进的地方:①其退出机制对不联通的有向图是无效的,会陷入死循环;②没有涉及最短路径上顶点的邻接点(特指前面的相邻点)问题;③没有涉及多个顶点同时获得p标号的问题.针对上述问题,对标号法进行了改进.算法实验表明,改进的标号法能够有效解决上述问题.在上述工作的基础上,开发了“北京市道路最优路线选择系统”,以提供起点和终点之间的最优路线,帮助用户选择出行路线,使市民能够避过交通最拥堵的路段,节约出行时间.%The problem of " the shortest path" has wide application. There are many algorithms to solve this problem and the best one is "Dijkstra's label algorithm". But experiment results show that this algorithm needs to be improved: Qthe algorithm's exit mechanism is ineffective to non-unicom figure and will fall into an infinite loop:(2)The algorithm is not concerned in the problem of previous adjacent vertices in shortest path: (3)The algorithm is not concerned in the problem that more vertices obtain the "p-label" at the same time. This paper improved the "Dijkstra's label algorithm". Experiment results indicate that the improved algorithm can solve above problems effectively. On the basis of the above work, we developed the "Beijing Road optimal route selection system", which help users to select the shorted route,so that people can avoid the most congested road traffic and save time.

  11. Finding the K shortest hyperpaths using reoptimization

    DEFF Research Database (Denmark)

    Nielsen, Lars Relund; Pretolani, Daniele; Andersen, Kim Allan

    2004-01-01

    The shortest hyperpath problem is an extension of the classical shortest path problem and has applications in many different areas. Recently, algorithms for finding the K shortest hyperpaths in a directed hypergraph have been developed by Andersen, Nielsen and Pretolani. In this paper we improve...... the worst-case computational complexity of an algorithm for finding the K shortest hyperpaths in an acyclic hypergraph. This result is obtained by applying new reoptimization techniques for shortest hyperpaths. The algorithm turns out to be quite effective in practice and has already been successfully...... applied in the context of stochastic time-dependent networks, for finding the K best strategies and for solving bicriterion problems....

  12. Finding the K shortest hyperpaths using reoptimization

    DEFF Research Database (Denmark)

    Nielsen, Lars Relund; Pretolani, Daniele; Andersen, Kim Allan

    2006-01-01

    The shortest hyperpath problem is an extension of the classical shortest path problem and has applications in many different areas. Recently, algorithms for finding the K shortest hyperpaths in a directed hypergraph have been developed by Andersen, Nielsen and Pretolani. In this paper we improve...... the worst-case computational complexity of an algorithm for finding the K shortest hyperpaths in an acyclic hypergraph. This result is obtained by applying new reoptimization techniques for shortest hyperpaths. The algorithm turns out to be quite effective in practice and has already been successfully...... applied in the context of stochastic time-dependent networks, for finding the K best strategies and for solving bicriterion problems...

  13. Identification of Influenza A/H7N9 Virus Infection-Related Human Genes Based on Shortest Paths in a Virus-Human Protein Interaction Network

    Directory of Open Access Journals (Sweden)

    Ning Zhang

    2014-01-01

    Full Text Available The recently emerging Influenza A/H7N9 virus is reported to be able to infect humans and cause mortality. However, viral and host factors associated with the infection are poorly understood. It is suggested by the “guilt by association” rule that interacting proteins share the same or similar functions and hence may be involved in the same pathway. In this study, we developed a computational method to identify Influenza A/H7N9 virus infection-related human genes based on this rule from the shortest paths in a virus-human protein interaction network. Finally, we screened out the most significant 20 human genes, which could be the potential infection related genes, providing guidelines for further experimental validation. Analysis of the 20 genes showed that they were enriched in protein binding, saccharide or polysaccharide metabolism related pathways and oxidative phosphorylation pathways. We also compared the results with those from human rhinovirus (HRV and respiratory syncytial virus (RSV by the same method. It was indicated that saccharide or polysaccharide metabolism related pathways might be especially associated with the H7N9 infection. These results could shed some light on the understanding of the virus infection mechanism, providing basis for future experimental biology studies and for the development of effective strategies for H7N9 clinical therapies.

  14. Shortest path routing algorithm for m(o)bius cubes%基于M(o)bius立方体的最短路径路由算法

    Institute of Scientific and Technical Information of China (English)

    张丽果; 杜慧敏; 韩俊刚

    2011-01-01

    M(o)bius立方体是超立方体的一种变形结构.M(o)bius立方体除了具有超立方体本身的可扩展性和路由简单等优点外,它与含有相同数目的点和边的超立方体相比具有更好的性能.文中提出一种新的用于M(o)bius立方体网络的最短路径路由算法,避免了递归调用.分析和实验证明,相对于Cull P提出的最短路径算法有更高的效率,并易于硬件实现,且时间复杂度为O(n).%The Mobius cube is a variant type of hypercubes. In addition to its good scalability and simplicity of routing, Mobius cubes have a better performance than hypercubes with the same number of links and processors. This paper presents a new shortest path routing algorithm for Mobius cubes without recursion. The experimental result and analysis show that the algorithm has the advantages of smaller delay, higher efficiency, and easy to implement by hardware,and the time complexity of the presented algorithm is O(n).

  15. Improved Dijkstra Algorithm Based on the Adjacent Point in Shortest Path%基于邻接点算法的Dijkstra优化研究

    Institute of Scientific and Technical Information of China (English)

    王华

    2013-01-01

    Abstract the urban road into network diagram and definition of data structures for road and site. Improve the Dijkstra by adjacent point algorithm, the method build the adjacency matrix and the initial judgment matrix and get the shortest path between two points in the network diagram. The efficiency of the algorithm is apparent when there are more points. Experiments show that adjacent point algorithm not only saves storage space, but also improves the efficiency of operations.%在将城市道路实体抽象为图论理论中的网络图,对道路和站点数据结构进行定义的基础上,利用邻接点算法对Dijkstra算法进行改进,通过构建邻接矩阵和初始判断矩阵,得出网络图中任意两点间的最短路径.当点数越多时改进算法的效率就显现出来,结果表明邻接点算法在一定程度上既节省了存储空间,又提高了运算效率.

  16. CANDU development

    International Nuclear Information System (INIS)

    Evolution of the 950 MW(e) CANDU reactor is summarized. The design was specifically aimed at the export market. Factors considered in the design were that 900-1000 MW is the maximum practical size for most countries; many countries have warmer condenser cooling water than Canada; the plant may be located on coastal sites; seismic requirements may be more stringent; and the requirements of international, as well as Canadian, standards must be satisfied. These considerations resulted in a 600-channel reactor capable of accepting condenser cooling water at 320C. To satisfy the requirement for a proven design, the 950 MW CANDU draws upon the basic features of the Bruce and Pickering plants which have demonstrated high capacity factors

  17. SHORTEST PATH RESOLUTION USING HADOOP

    OpenAIRE

    Aridhi, Sabeur; Benjamin, Vincent; Lacomme, Philippe; Ren, Libo

    2014-01-01

    The fast growth of scientific and business data has resulted in the evolution of the cloud computing. The MapReduce parallel programming model is a new framework favoring conception of algorithms for cloud computing. Such framework favors processing problems across huge datasets using a large number of computers. Hadoop is an implementation of MapReduce framework that becomes one of the most interesting approaches for cloud computing. Our contribution consists in investigating how the MapReduc...

  18. Analysis of shortest path for vector data model based on ArcGIS%基于ArcGIS对矢量数据模型的最短路径分析

    Institute of Scientific and Technical Information of China (English)

    高晟

    2011-01-01

    In this paper, using the module of network analysis in ArcGis, problems of how to find different the shortest path in different circumstances discussed are given respectively.%利用ArcGIS中网络分析模块对最短路径问题分情况进行了探讨,分别给出了在不同情况下如何找到不同最短路径。

  19. 基于可编程主动网络语言的最短路径优先网络模型%The Shortest Path First Network Model Based on Programming Language for Active Networks

    Institute of Scientific and Technical Information of China (English)

    江山; 张为群; 钟国祥

    2004-01-01

    提出了基于可编程主动网络语言(programming language for active networks,PLAN)网络现有架构,以开销(cost)代替跃点(hops)记数计算网络路径长度,实现最短路径优先(shortest path first,SPF)路由规则的主动网络模型.

  20. Shortest-path routing algorithm based on selected RSL in WlrelessHART%基于RSL筛选的WirelessHART最短路径路由算法

    Institute of Scientific and Technical Information of China (English)

    党魁; 沈继忠; 董利达

    2012-01-01

    无线HART网络协议中提出的Graph路由是同类无线网络中健壮性最好的路由方式之一.针对目前实现该路由方式的算法非常少且性能不佳的现状,提出一种基于BFS的Graph路由算法.该算法得到的路由具有跳间冗余的特点,能够最大限度地增加路由健壮性,并且路径最短;引入RSL作为链路质量衡量标准,剔除质量较差的链路,同时对每跳的邻居数设置上限,保证了路由的健壮性,同时避免了低质量的链路带来的通信资源浪费.此外,论证了协议所没有提及的广播路由存在的必要,并给出了实现算法.%The Graph routing proposed by WirelessHART is one of the routing protocols which with best robustness among all the wireless networks. Since there is little algorithm on Graph routing at present and the routing performance is poor, a shortest-path Graph routing algorithm based on BFS( Breadth-First Search) is presented. The routing algorithm has a character of neighbor redundancies, which can maximize to increase the routing robustness. With the introduction of RSL(Receive Signal Level) as a link quality measurement, removing the links with poor quality, setting an upper limit to the number of neighbors in each hop, both methods are aimed to increase the routing robustness and minimize the waste communication resources. In addition, the necessary of broadcast routing which WirelessHART has not mentioned is demonstrated and the reality algorithm is also proposed.

  1. CANDU nuclear power system

    International Nuclear Information System (INIS)

    This report provides a summary of the components that make up a CANDU reactor. Major emphasis is placed on the CANDU 600 MW(e) design. The reasons for CANDU's performance and the inherent safety of the system are also discussed

  2. CANDU operating experience

    International Nuclear Information System (INIS)

    The CANDU Pressurized Heavy Water (CANDU-PHW) type of nuclear electric generating station has been developed jointly by Atomic Energy of Canada Limited and Ontario Hydro. This paper highlights Ontario Hydro's operating experience using the CANDU-PHW system, with a focus on the operating performance and costs, reliability of system components and nuclear safety considerations both to the workers and the public

  3. Link layer topology discovery for multi-subnet networks based on shortest path%基于最短路径的多子网链路层拓扑发现算法

    Institute of Scientific and Technical Information of China (English)

    孟颖翔; 高东怀; 许浩; 许卫中

    2016-01-01

    针对当前基于地址转发表实现链路层拓扑发现的典型算法在复杂多子网环境下应用存在的问题,提出利用下行链路完整地址转发表构建并优化同一子网交换设备间的最短路径,实现链路层拓扑自动发现的算法。经理论和实际环境验证,证明该算法可以较好地发现复杂多子网链路层拓扑结构,具有较强的实践意义和推广价值。%The application of the typical link layer topology discovery algorithms based on address forwarding table is not ideal for multi-subnet networks. In view of the problem, this paper proposes a link layer topology discovery algorithm based on shortest path. Utilizing the complete downlink AFT, it constructs shortest paths which are between switch devices in the same subnet and then optimizes these paths to accomplish the algorithm. Verified by the theory and practice in actual network environment, the algorithm can discover the link layer topology for multi-subnet networks, it also has a strong practical significance and promotional value.

  4. To Solve Pipeline Layout Problem with the Improved Shortest Path Model%利用改进的最短路径模型解决输油管的布置问题

    Institute of Scientific and Technical Information of China (English)

    余淼

    2011-01-01

    2010年去过数学建模大赛c题“输油管的布置”数学建模的目的是设计最优化的路线,建立一条费用最省的输油管线路,但是不同于普遍的最短路径问题,该题需要考虑多种情况,例如,城区和郊区费用的不同,采用共用管线和非公用管线价格的不同等等。我们基于最短路径模型,对于题目实际情况进行研究和分析,基于光的传播原理,设计了一种改进的最短路径模型,对问题设计了合适的数学模型并做出了相应的解答和处理。%Mathematical Modeling Contest in 2010 been to C title"pipeline layout,"The purpose of mathematical modeling is to design the most optimal route to establish a pipeline of least cost route,but unlike the general shortest path problem,the problem needs consider a variety of situations,for example,the cost of different urban and suburban areas,the use of shared pipeline and the price of different non-public lines and so on.On the basis of the shortest path model for the actual subject of research and analysis,based on the principle of light transmission,an improved design of the shortest path model,the appropriate design of the problem and make the corresponding mathematical model answers and treatment.

  5. A method for generating the shortest disassembly path and its simulation in MATLAB%一种最短拆卸路径产生方法及其在MATLAB中的实现

    Institute of Scientific and Technical Information of China (English)

    王韶辉; 朱家诚; 赵永

    2012-01-01

    Through studying on a method of generating the disassembly path,a shortest disassembly : path is generated,which plays an important role in product repair or retirement phase,and is an important part of Design For Disassembly (DFD)for its reflection of concurrent design and green design ideas.Using Graph theory knowledge of graph theory,combined with the connection between each part of the product, the most likely disassemble access point can be found first to generate a directed grapkThen regarding the disassemble time as the weight of the graph,the target disassembly problem can be transformed to the prob-lem of researching the shortest path between two nodes of the graph.FindLly,simulation is done in the MAT-LAB environment by comparing several access points for disassembles to find the best one,thus the shortest disassembly time and path is generated.Through elaborating the method of generating disassembly path by using graph theory and artificial knowledge,it is found to be great significant in practice for saving time and cost in product repair or retirement phase.%通过研究一种拆卸路径的生成方法,产生最短拆卸路径,对于产品维修或者报废阶段节省时间与成本起着重要作用,属于可拆卸性设计(DFD)的重要组成部分,体现了并行设计与绿色设计的思想.应用图论的知识,结合产品的联接关系,找出最有可能的几个拆卸切入点,然后生成拆卸有向图,把拆卸时间作为有向图中的权重,把目标拆卸的问题转换为图论中的求两个节点间最短路径问题,最后在MATLAB环境进行仿真,通过对几个切入点的对比,找出最佳拆卸切入点,产生最短拆卸时间和拆卸路径.通过详细阐述一种人工与图论算法相结合的生成拆卸路径的方法,对产品维修或报废拆卸节省时间和成本有着很大的实际意义.

  6. Algorithm analysis and optimization of the shortest path problem based on Dijkstra%基于Dijkstra的最短路径问题的算法分析与优化

    Institute of Scientific and Technical Information of China (English)

    刘朝霞

    2014-01-01

    Dijkstra算法是最具有代表性的最短路径算法,为解决许多工程领域中出现的最短路径问题提供了理论依据。本文分析了Dijkstra算法以及该算法存在的不足,并提出了优化该算法的方法,通过与原算法作比较,结果表明这种改进的算法在运行时间和效率上得到了提高,其占用的存储空间得到了减少。%The Dijkstra algorithm is the most representative of the shortest path algorithm, provides the theoretical basis for solving the shortest path problem in many engineering fields. This paper analyzes the deficiency of the Dijkstra algorithm and this algorithm, and presents a method of optimization of the algorithm, compared with the original algorithm, the results show that algorithm has been improved at run time and efficiency, the storage space are reduced.

  7. Economics of CANDU-PHW

    International Nuclear Information System (INIS)

    The CANDU-Pressurized Heavy Water (CANDU-PHW) type of nuclear-electric generating station has been developed jointly by Atomic Energy of Canada Limited and Ontario Hydro. This paper discusses the cost of producing electricity from CANDU, presents actual cost experience of CANDU and coal in Ontario, presents projected CANDU and coal costs in Ontario and compares CANDU and Light Water Reactor cost estimates in Ontario

  8. Economics of CANDU

    International Nuclear Information System (INIS)

    The cost of producing electricity from CANDU reactors is discussed. The total unit energy cost of base-load electricity from CANDU reactors is compared with that of coal-fired plants in Ontario. In 1980 nuclear power was 8.41 m$/kW.h less costly for plants of similar size and vintage. Comparison of CANDU with pressurized water reactors indicated that the latter would be about 26 percent more costly in Ontario

  9. 考虑交叉口延误和转向限制的弧标号最短路径算法%An Arc Labeling Algorithm for Shortest Path Problem Considering Turn Penalties and Prohibitions at Intersections

    Institute of Scientific and Technical Information of China (English)

    高明霞; 贺国光

    2011-01-01

    It is quite special and difficult to find shortest path in traffic network with turn penalties and prohibitions at intersections, which is beyond the area of classical algorithms based on the premise that the SPP( shortest path problem) is without aftereffect when labeling at nodes with traditional method. After a simple analysis about such SPP and some existing methods,a label correcting algorithm is presented to seek the shortest path from source to all the other nodes. According to the algorithm, every arc of the network is assigned a distance label and a pre-arc label which are scanned and updated iteratively to approximate the optimal solution. For a given network, the optimal solution can be got after certain iterations and the time complexity of the algorithm is O(nm) for general road network. A numerical example is given to illustrate the application.%在考虑交叉口延误和转向限制的情况下,交通网络中的最短路问题较为特殊和复杂,传统的节点标号方式及相应的基于无后效性条件的算法不适用于这类问题.本文对该类问题的特点及已有典型方法进行了分析,提出了一个基于孤标号的标号修正算法.算法分别为每条弧设置一个距离标号和一个紧前弧标号,通过不断迭代、更新弧的标号来寻找最短路径.对给定网络经一定次数的迭代,可得到起点至其它所有节点的最短路径,在“一对多”形式的路径优化中效果较好,应用于一般道路网时计算时间复杂性为O(nm).最后给出了一个数值算例,说明算法的应用.

  10. Time-dependent Shortest Path Problem in Solution to Two-level Intelligent Optimization Algorithm%双层智能优化算法求解时变网络最短路径问题

    Institute of Scientific and Technical Information of China (English)

    陈亮; 卢厚清

    2016-01-01

    边成本为一般函数的时变网络最短路径问题(TDSP),已被证明不存在多项式时间算法.同时智能优化算法被广泛地用于求解该类问题,但多数没有考虑节点的可等待约束.提出了求解TDSP 问题的双层智能优化算法,内层遗传算法优化每条可行路径的各节点离开时间,外层蚁群算法优化构建的路径,最终搜索到从起始点到终点的最短时间路径.实验结果表明:双层智能优化算法能快速寻优,并且收敛速度和最优路径较同类算法更优秀.%It is proven there is no polynomial time algorithm for the time-dependent shortest path (TDSP)occurring when marginal cost is a general function.Also,intelligent optimization algorithms are extensively used in solving such problems,but most of them have not considered the waiting con-straint of the nodes.This paper brings out the two-layer intelligent optimization to solve out TDSP problem:at internal layer,optimize the leaving time of each node of each feasible path with genetical-gorithm;at external layer,optimize the built path with ant colony algorithm.In this way,the shor-test time path from a starting point to an end point is obtained.The experimental result shows,the two-level intelligent optimization algorithm is able to identify the optimization and the convergence speed with optimized path is better than other algorithms.

  11. 一种求解高校最短路径的改进的启发式蚁群算法%Improved Heuristic Ant Colony Algorithm to Solve the Shortest Path among Campus

    Institute of Scientific and Technical Information of China (English)

    方昕

    2012-01-01

    The heuristic information is the key in the geographic information system(GIS). Ant Colony Algorithm(ACO) easily leads to local optimal solution in solving shortest path problem. To overcome this shortcoming, improved ACO with heuristic information is proposed. The ACO introduces heuristic information to guide ants can fast converge to global optimal solution in the initialization of the ant colony. And, the ACO uses dual population search and improves state transition operator for the balance of global and local search capabilities to effectively improve the performance and increase the diversity. There use C++ programming of Visual Studio 2005. net. The results show that this algorithm can not only effectively solve the shortest path problem of GIS, but also has high convergence precision.%启发信息是地理信息系统(GIS)中的关键,针对蚁群算法易陷入局部最优的缺陷,提出一种带有启发信息的改进蚁群算法.该算法在初始化蚁群时引入启发信息指引蚂蚁快速收敛于全局最优解,为平衡全局与局部搜索能力,也改进状态转移概率算子,从而有效提高算法性能,增加种群多样性.实验以Visual Studi02005中C++编程实现仿真,结果表明此算法不但能有效求解GIS的最短路径,而且改进的算法能快速地收敛且精度高.

  12. CANDU 9 design

    International Nuclear Information System (INIS)

    AECL has made significant design improvements in the latest CANDU nuclear power plant (NPP) - the CANDU 9. The CANDU 9 operates with the energy efficient heavy water moderated reactor and natural uranium fuel and utilizes proven technology. The CANDU 9 NPP design is similar to the world leading CANDU 6 but is based upon the single unit adaptation of the 900 MWe class reactors currently operating in Canada as in integrated four-unit configurations. The evolution of the CANDU family of heavy water reactors (HAIR) is based on a continuous product improvement approach. Proven equipment and systems from operating stations are standardized and used in new products. As a result of the flexibility of the technology, evolution of the current design will ensure that any new requirements can be met, and there is no need to change the basic concept. This paper will provide an overview for some of the key features of the CANDU 9 NPP such as nuclear systems and equipment, advanced control and computer systems, safety design and protection features, and plant layout. The safety enhancements and operability improvements implemented in this design are described and some of the advantages that can be expected by the operating utility are highlighted. (author)

  13. Marketing CANDU internationally

    International Nuclear Information System (INIS)

    The market for CANDU reactor sales, both international and domestic, is reviewed. It is reasonable to expect that between five and ten reactors can be sold outside Canada before the end of the centry, and new domestic orders should be forthcoming as well. AECL International has been created to market CANDU, and is working together with the Canadian nuclear industry to promote the reactor and to assemble an attractive package that can be offered abroad. (L.L.)

  14. 改进Dijkstra算法的城市道路最短路径仿真研究%Improved Dijkstra algorithm for shortest path in urban traffic net

    Institute of Scientific and Technical Information of China (English)

    王华

    2013-01-01

    The paper proposed a bidirectional search improved Dijkstra algorithm based on the characteristic of the urban road network and Dijkstra algorithm.Result showed that the improved Dijkstra algorithm could reduce the searching range by 15% ~ 25%,the more the nodes are,the more obvious the reduction.The improved algorithm could improve the real-time in path searching.%本文在分析Dijkstra算法基础上,考虑城市路网的特点及该算法在路径优化中的不足,提出一种基于双向搜索的Dijkstra改进算法,它可以减少路网节点的搜索范围和计算复杂度.仿真结果表明,改进算法在最短路径搜索中可使候选节点数减少15%~25%,当节点越多这种减少越明显,可提高搜索路径的实时性.

  15. 改进的Dijkstra最短路径算法在GIS-T中的研究与实现%Research and implementation of the improved Dijkstra shortest path algorithm in GIS-T

    Institute of Scientific and Technical Information of China (English)

    戴文博; 殷招伟; 钱俊彦

    2015-01-01

    Dijkstra最短路径算法广泛应用于交通运输和网络优化等领域,但是在实际应用的过程中仍存在一些不足。文章针对道路拥挤、交叉路口等待和单行道限行等方面提出了一种改进的基于时间最短的最短路径算法。传统的最短路径算法中图的顶点是抽象的,不含权重的,改进的算法中图的顶点是有权值的,用来表示道路交叉口的等待时间。通过编程实现该算法,实验结果表明,道路拥挤、交叉口等待和单行道限行对交通路径选择有很大影响。因此,改进的算法求得的最短时间路径更加符合实际,具有一定的应用价值。%Dijkstra shortest path algorithm(DSPA) is widely used in fields of communication and transportation and network optimization, etc. But there are still some shortcomings in the process of practical application. We propose an improved SPA based on the minimum duration which is directing at the aspects such as congested roads, the intersection waiting and one-way street restrictions. The vertex of diagram in tradition SPA is abstract and does not contain the weight, while does and is used to represent the intersections waiting time in improved algorithm.We program to implement it and the results show that the above three aspects mentioned has a great influence on choice of the transportation route. Therefore, the shortest time path wh3ich is gained by the improved algorithm is more in line with the actual and the improved algorithm has a certain application value.

  16. Candu reactors with thorium fuel cycles

    International Nuclear Information System (INIS)

    Over the last decade and a half AECL has established a strong record of delivering CANDU 6 nuclear power plants on time and at budget. Inherently flexible features of the CANDU type reactors, such as on-power fuelling, high neutron economy, fuel channel based heat transport system, simple fuel bundle configuration, two independent shut down systems, a cool moderator and a defence-in-depth based safety philosophy provides an evolutionary path to further improvements in design. The immediate milestone on this path is the Advanced CANDU ReactorTM** (ACRTM**), in the form of the ACR-1000TM**. This effort is being followed by the Super Critical Water Reactor (SCWR) design that will allow water-cooled reactors to attain high efficiencies by increasing the coolant temperature above 5500C. Adaptability of the CANDU design to different fuel cycles is another technology advantage that offers an additional avenue for design evolution. Thorium is one of the potential fuels for future reactors due to relative abundance, neutronics advantage as a fertile material in thermal reactors and proliferation resistance. The Thorium fuel cycle is also of interest to China, India, and Turkey due to local abundance that can ensure sustainable energy independence over the long term. AECL has performed an assessment of both CANDU 6 and ACR-1000 designs to identify systems, components, safety features and operational processes that may need to be modified to replace the NU or SEU fuel cycles with one based on Thorium. The paper reviews some of these requirements and the associated practical design solutions. These modifications can either be incorporated into the design prior to construction or, for currently operational reactors, during a refurbishment outage. In parallel with reactor modifications, various Thorium fuel cycles, either based on mixed bundles (homogeneous) or mixed channels (heterogeneous) have been assessed for technical and economic viability. Potential applications of a

  17. Ontario Hydro CANDU operating experience

    International Nuclear Information System (INIS)

    The CANDU Pressurized Heavy Water (CANDU-PHW) type of nuclear-electric generating station has been developed jointly by Atomic Energy of Canada Limited and Ontario Hydro. This report highlights Ontario Hydro's operating experience using the CANDU-PHW system, with a focus on the operating performance and costs, reliability of system components and nuclear safety considerations for the workers and the public

  18. Ontario Hydro CANDU operating experience

    International Nuclear Information System (INIS)

    The CANDU Pressurized Heavy Water (CANDU-PHW) type of nuclear-electric generating station has been developed jointly by Atomic Energy of Canada Limited and Ontario Hydro. This report highlights Ontario Hydro's operating experience using the CANDU-PHW system, with a focus on worker and public safety, operating performance and costs, and reliability of system components

  19. 基于Floyd最短路径算法的教材中心选址问题%Materials Center Location Problem based on Floyd’s Shortest Path Algorithm

    Institute of Scientific and Technical Information of China (English)

    赵丽娜; 李慧

    2014-01-01

    针对日益多元化的教育装备,校区分散、规模庞大的高校必须考虑其购买、管理、维护成本,因此,装备中心的选址尤为重要。依据Floyd算法,深入探讨装备中心的选址问题,并给出量化的计算结果,为教育装备的管理工作提供依据。%In view of various educational equipment, the scattered and large-scaled campus that intend to build the equipment center, should consider the cost of purchase, management and maintenance, thus the location of educational equipment center is an important factor. Based on the method of the shortest path in graph theory, this paper studies the choice of the equipment center location, gives the calculating results of quantization, and present the basis for the educational equipment management.

  20. An integrated CANDU system

    International Nuclear Information System (INIS)

    Twenty years of experience have shown that the early choices of heavy water as moderator and natural uranium as fuel imposed a discipline on CANDU design that has led to outstanding performance. The integrated structure of the industry in Canada, incorporating development, design, supply, manufacturing, and operation functions, has reinforced this performance and has provided a basis on which to continue development in the future. These same fundamental characteristics of the CANDU program open up propsects for further improvements in economy and resource utilization through increased reactor size and the development of the thorium fuel cycle

  1. Fuel for advanced CANDU reactors

    International Nuclear Information System (INIS)

    The CANDU reactor system has proven itself to be a world leader in terms of station availability and low total unit energy cost. In 1985 for example, four of the top ten reactor units in the world were CANDU reactors operating in South Korea and Canada. This excellent operating record requires an equivalent performance record of the low-cost, natural uranium fuel. Future CANDU reactors will be an evolution of the present design. Engineering work is under way to refine the existing CANDU 600 and to incorporate state-of-the-art technology, reducing the capital cost and construction schedule. In addition, a smaller CANDU 300 plant has been designed using proven CANDU 600 technology and components but with an innovative new plant layout that makes it cost competitive with coal fired plants. For the long term, work on advanced fuel cycles and major system improvements is underway ensuring that CANDU plants will stay competitive well into the next century

  2. Multivalued and Multiple Reflected Raytracing with Extreme Value Based on the Multistage Modified Shortest-path Method%分区多步最短路径极值法多值多次反射波追踪

    Institute of Scientific and Technical Information of China (English)

    唐小平; 白超英; 刘宽厚

    2011-01-01

    The grid-based raytracing algorithms,such as the finite-difference eikonal equation solver and the shortest-path method,are all based on the Fermat (minimum travel time) principle, which is able to track the first reflected arrivals only. In heterogeneous media involving a relatively larger velocity contrast or complex reflected interface. The seismic wavefronts are self-intersected, as a result, the rays are multi-paths. In order to simulate such multivalued and multiple reflected arrivals, we put forward an algorithm to trace the multivalued and multiple reflected arrivals, it referred as the extreme value algorithm based on the multistage modified shortest-path method, which is capable of tracking the multivalued and multiple reflected arrivals in velocity model included complex reflected interfaces. The principles of the extreme value are that;we firstly conduct down-wind raytracing from both sources and receivers to the sampled reflected interfaces and record the traveltimes and raypaths at each sampled reflected point,and sum up traveltime value at each reflected point, and form a stacked' traveltime-distance' curve (or surface for 3D case);secondly we solve extremum values for this stacked'traveltime-distance'curveCor surface).in which the location of the extreme points are the reflected points; finally we link the raypaths and add traveltimes from the source to the reflected point,and then to the receiver. Thus the multivalued and multiple reflected arrivals are successfully traced. This algorithm has a simple principle, high accuracy, fast CPU time and easy adaptation for complex media-Compared with the fast marching method and error analysis.it is evident that the extreme value of the multistage shortest-path method is a feasible and efficient algorithm for tracking the multivalued and multiple reflected arrivals.%基于网格单元扩展的射线追踪算法,如:较为流行的有限差分解程函方程法和最短路径法均是建立在费马(最小

  3. CANDU, building the future

    Energy Technology Data Exchange (ETDEWEB)

    Stern, F. [Stern Laboratories (Canada)

    1997-07-01

    The CEO of Stern Laboratories delivered a speech on the problems and challenges facing the nuclear industry. The CANDU system is looked at as the practical choice for the future of our energy source. The people of the industry must be utilized and respected to deliver to the best of their ability.

  4. CANDU market prospects

    International Nuclear Information System (INIS)

    This 1994 survey of prospective markets for CANDU reactors discusses prospects in Turkey, Thailand, the Philippines, Korea, Indonesia, China and Egypt, and other opportunities, such as in fuel cycles and nuclear safety. It was concluded that foreign partners would be needed to help with financing

  5. 基于最短路径理论分析航路测控精度%Analysis of the TT&C Accuracy in Flight Route Based on the Shortest Path Theory

    Institute of Scientific and Technical Information of China (English)

    谢赟

    2011-01-01

    靶场测控网的精度是衡量和考核测控设备作用,制定测量方案,评估数据处理方法合理性和科学性的重要手段.如何在现有测控站点位置受海岸线地貌地物限制的条件下提高航路的测控精度是数据处理工作者必须解决的难题,论文引入动态规划中的最短路径理论,通过对试验航路上不同测量段落、不同精度设备的优化组合,设计了某航路的最优测控精度,对提高靶场的综合试验能力有重要意义.%The accuracy of a range TT&C network is a key index for evaluation of the role of TT&C facilities, design of mission TT&C systems and the rationality and objectiveness of data processing methods. It is a challenging task for a range to improve its TT&C accuracy as long as data processing is concerned considering the constraints of coastline and terrestrial features on TT&C sites. Incorporating the shortest path theory of dynamic planning, this paper designs the optimal TT&C accuracy of a test flight route through optimized combination of equipment with different accuracy along sections of the flight route. The result is of high significance for enhancing the integrated test capabilities of a range.

  6. Heuristic algorithm for multi-constrained shortest link-disjoint paths%多约束最短链路不相交路径的启发式算法

    Institute of Scientific and Technical Information of China (English)

    倪明放; 高石云; 马峰; 吴传信; 陈建文

    2013-01-01

    To solve the multi-constrained shortest link-disjoint paths (MCSDP(k)) problem, a heuristic integer program algorithm was proposed and the searching scheme was given. Based on a nice feature of the integer linear constrains set, the complicated constrains were penaltied in the objective function by La-grangian multipliers, then an integer linear program problem of which the constrains coefficients matrix is totally unimodular was reformulated. This integer linear problem can be solved efficiently by using simplex algorithm and the MCSDP(k) can be found in the iterative process of solving the linear programming problems. Experiments demonstrate that the algorithm proposed is fast and effective.%为求解多约束最短链路不相交路径(MCSDP(k))问题,提出了一种启发式的整数规划方法:FHABIP,并给出了算法搜索方案.根据问题的整数线性约束集合具有的结构特点,利用拉格朗日乘子把整数线性约束集合中的复杂约束引入到目标函数中,导出具有约束系数矩阵是全幺模矩阵特点的整数线性规划问题,从而使这类问题能用单纯形法容易求解.MCSDP(k)在求解线性规划问题的迭代过程中很容易地被求出.算法实验结果表明该算法快速有效.

  7. Improved artificial fish-swarm algorithm based on adaptive vision for solving the shortest path problem%自适应视野的人工鱼群算法求解最短路径问题

    Institute of Scientific and Technical Information of China (English)

    马宪民; 刘妮

    2014-01-01

    To solve basic artificial fish-swarm algorithm(AFSA)’s drawbacks of low convergence rate in the latter stage, a large amount of computation and easiness of trapping in local optimal solution, caused by the constant vision of the ar-tificial fish, an improved artificial fish-swarm algorithm based on adaptive vision(AVAFSA) was proposed. The improved algorithm only adjusted the vision of the preying behavior of artificial fish to make the vision gradually decrease with the increase of the number of iterations of the algorithm. When the value became less than half the initial value, it made the value be equal to half the initial value. The proposed improved artificial fish swarm algorithm was applied to the static shortest path problem based on road network to provide customers with the best path. Simulation results depict the im-proved algorithm has higher convergence rate, a smaller amount of calculation, and is more accurate and stable than the basic AFSA and ant colony optimization(ACO).%针对基本人工鱼群算法的参数视野固定不变导致算法后期收敛速度慢、运算量大、易陷入局部最优等问题,提出自适应视野的改进人工鱼群算法。改进后的算法只对人工鱼的觅食行为的视野进行调整,使其随着算法的迭代次数的增加而逐渐减小,但当视野小于初始值的一半时,停止减小,使其等于初始值的一半。将提出的改进型人工鱼群算法应用到求解基于道路网络的最短路径问题中,并通过实验证明了改进后的人工鱼群算法比基本人工鱼群算法及蚁群优化算法收敛速度快、计算量小,而且更加准确和稳定。

  8. Incentives for improvement of CANDU

    International Nuclear Information System (INIS)

    CANDU is a relatively young technology which has demonstrated many achievements as an electrical power generation system. These achievements include an unsurpassed safety record, high annual and lifetime capacity factors, low electricity cost and a broad range of other performance strengths which together indicate that the CANDU technology is fundamentally sound. Known capabilities not yet fully exploited, such as advanced fuel cycle options, indicate that CANDU technology will continue to pay strong dividends on research, development and design investment. This provides a strong incentive for the improvement of CANDU on a continuing basis

  9. CANDU at the crossroads

    Energy Technology Data Exchange (ETDEWEB)

    Anon.

    1990-11-01

    ''Ready for the challenge of the 90s'' was the theme of this year's gathering of the Canadian Nuclear Association held in Toronto, 3-6 June. What that challenge really entails is whether the CANDU system will survive as the last remaining alternative to the light water reactor in the world reactor market, or whether it will decline into oblivion along with the Advanced Gas Cooled reactor and so many other technically excellent systems which have fallen along the way. The fate of the CANDU system will not be determined by its technical merits, nor by its impeccable safety record. It will be determined by public perceptions and by the deliberations of an Environmental Assessment Panel established by the Government of Ontario. The debate at the Association meeting is reported. (author).

  10. Joint studies on large CANDU

    International Nuclear Information System (INIS)

    CANDU PHWRs have demonstrated generic benefits which will be continued in future designs. These include economic benefits due to low operating costs, business potential, strategic benefits due to fuel cycle flexibility and operational benefits. These benefits have been realized in Korea through the operation of Wolsong 1, resulting in further construction of PHWRs at the same site. The principal benefit, low electricity cost, is due to the high capacity factor and the low fuel cost for CANDU. The CANDU plant at Wolsong has proven to be a safe, reliable and economical electricity producer. The ability of PHWR to burn natural uranium ensures security of fuel supply. Following successful Technology Transfer via the Wolsong 2,3 and 4 project, future opportunity exists between Korea and Canada for continuing co-operation in research and development to improve the technology base, for product development partnerships, and business opportunities in marketing and building PHWR plants in third countries. High reliability, through excellent design, well-controlled operation, efficient maintenance and low operating costs is critical to the economic viability of nuclear plants. CANDU plants have an excellent performance record. The four operating CANDU 6 plants, operated by four utilities in three countries, are world performance leaders. The CANDU 9 design, with higher output capacity, will help to achieve better site utilization and lower electricity costs. Being an evolutionary design, CANDU 9 assures high performance by utilizing proven systems, and component designs adapted from operating CANDU plants (Bruce B, Darlington and CANDU 6). All system and operating parameters are within the operating proven range of current plants. KAERI and AECL have an agreement to perform joint studies on future PHWR development. The objective of the joint studies is to establish the requirements for the design of future advanced CANDU PHWR including the utility need for design improvements

  11. Non-destructive Testing of Concrete Based on Shortest Path Ray Tracing Algorithm%基于最短路径射线追踪算法的混凝土无损检测

    Institute of Scientific and Technical Information of China (English)

    褚燕利; 樊瑶

    2011-01-01

    混凝土结构的无损检测对于桥梁安全来说意义非凡.无损检测技术的基本目的是在不损伤构件的前提下,检测出物体中的缺陷,并确定其位置、大小和性质.在混凝土无损检测中常用的是超声层析成像代数重建技术(ART).由于ART算法一般采用直线射线追踪,投影矩阵一经确定不再改变,不仅计算精度低,而且在异常体周边单元出现速度远离真值的现象.本文引人了最短路径(SPT)射线追踪,在每次ART迭代之前,利用 SPT射线追踪重新计算投影矩阵,再进迭代计算.计算机仿真结果及混凝土试件实验结果表明:SPT射线追踪与ART相结合的算法具有更好的CT重建效果和消噪能力,并提高了计算的精度和图像重建质量.%Non-destructive testing of concrete structures for the bridge safety is significant. The basic purpose of NDT is under the premise that does not damage the components to detect defects in the object and determine its location, the size and nature. The ultrasonic tomography algebraic reconstruction technique (ART) commonly is used in Non-destructive testing of concrete. As a result of ART algorithm is generally used as a straight line ray tracing, if the projection matrix has been determined, it will not to change, thus it not only with low accuracy, but around the unit of abnormal body to which the rate away from the true value. The shortest path (SPT) ray tracing is introduced in each iteration before the ART,SPT is usd to recalculate projection matrix ray tracing, then carry out the iterative calculation. Computer simulation results and the concrete specimens experimental results show that SPT ray tracing combined with the ART algorithm has a better effect of CT reconstruction and denoising capacity, and improve the precision and quality of image reconstruction.

  12. Candu technology: the next generation now

    International Nuclear Information System (INIS)

    We describe the development philosophy, direction and concepts that are being utilized by AECL to refine the CANDU reactor to meet the needs of current and future competitive energy markets. The technology development path for CANDU reactors is based on the optimization of the pressure tube concept. Because of the inherent modularity and flexibility of this basis for the core design, it is possible to provide a seamless and continuous evolution of the reactor design and performance. There is no need for a drastic shift in concept, in technology or in fuel. By continual refinement of the flow and materials conditions in the channels, the basic reactor can be thermally and operationally efficient, highly competitive and economic, and highly flexible in application. Thus, the design can build on the successful construction and operating experience of the existing plants, and no step changes in development direction are needed. This approach minimizes investor, operator and development risk but still provides technological, safety and performance advances. In today's world energy markets, major drivers for the technology development are: (a) reduced capital cost; (b) improved operation; (c) enhanced safety; and (d) fuel cycle flexibility. The drivers provide specific numerical targets. Meeting these drivers ensures that the concept meets and exceeds the customer economic, performance, safety and resource use goals and requirements, including the suitable national and international standards. This logical development of the CANDU concept leads naturally to the 'Next Generation' of CANDU reactors. The major features under development include an optimized lattice for SEU (slightly enriched uranium) fuel, light water cooling coupled with heavy water moderation, advanced fuel channels and CANFLEX fuel, optimization of plant performance, enhanced thermal and BOP (balance of plant) efficiency, and the adoption of layout and construction technology adapted from successful on

  13. CANDU operating experience

    International Nuclear Information System (INIS)

    The CANDU-PHW program is based upon 38 years of heavy water reactor experience with 35 years of operating experience. Canada has had 72 reactor years of nuclear-electric operations experience with 10 nuclear units in 4 generating stations during a period of 18 years. All objectives have been met with outstanding performance: worker safety, public safety, environmental emissions, reliable electricity production, and low electricity cost. The achievement has been realized through total teamwork involving all scientific disciplines and all project functions (research, design, manufacturing, construction, and operation). (auth)

  14. Technology transfer in CANDU marketing

    International Nuclear Information System (INIS)

    The author discusses how the CANDU system lends itself to technology transfer, the scope of CANDU technology transfer, and the benefits and problems associated with technology transfer. The establishment of joint ventures between supplier and client nations offers benefits to both parties. Canada can offer varying technology transfer packages, each tailored to a client nation's needs and capabilities. Such a package could include all the hardware and software necessary to develop a self-sufficient nuclear infrastructure in the client nation

  15. The CANDU experience in Romania

    International Nuclear Information System (INIS)

    The CANDU program in Romania is now well established. The Cernavoda Nuclear Station presently under construction will consist of 5-CANDU 600 MWE Units and another similar size station is planned to be in operation in the next decade. Progress on the multi-unit station at Cernavoda was stalled for 18 months in 1982/83 as the Canadian Export Development Corporation had suspended their loan disbursements while the Romanian National debt was being rescheduled. Since resumption of the financing in August 1983 contracts worth almost 200M dollars have been placed with Canadian Companies for the supply of major equipment for the first two units. The Canadian design is that which was used in the latest 600 MWE CANDU station at Wolsong, Korea. The vast construction site is now well developed with the cooling water systems/channels and service buildings at an advanced stage of completion. The perimeter walls of the first two reactor buildings are already complete and slip-forming for the 3rd Unit is imminent. Many Romanian organizations are involved in the infrastructure which has been established to handle the design, manufacture, construction and operation of the CANDU stations. The Romanian manufacturing industry has made extensive preparations for the supply of CANDU equipment and components, and although a major portion of the first two units will come from Canada their intentions are to become largely self-supporting for the ensuing CANDU program. Quality assurance programs have been prepared already for many of the facilities

  16. CANDU safety under severe accidents

    International Nuclear Information System (INIS)

    The characteristics of the CANDU reactor relevant to severe accidents are set first by the inherent properties of the design, and second by the Canadian safety/licensing approach. Probabilistic safety assessment studies have been performed on operating CANDU plants, and on the 4 x 880 MW(e) Darlington station now under construction; furthermore a scoping risk assessment has been done for a CANDU 600 plant. They indicate that the summed severe core damage frequency is of the order of 5 x 10-6/year. CANDU nuclear plant designers and owner/operators share information and operational experience nationally and internationally through the CANDU Owners' Group (COG). The research program generally emphasizes the unique aspects of the CANDU concept, such as heat removal through the moderator, but it has also contributed significantly to areas generic to most power reactors such as hydrogen combustion, containment failure modes, fission product chemistry, and high temperature fuel behaviour. Abnormal plant operating procedures are aimed at first using event-specific emergency operating procedures, in cases where the event can be diagnosed. If this is not possible, generic procedures are followed to control Critical Safety Parameters and manage the accident. Similarly, the on-site contingency plans include a generic plan covering overall plant response strategy, and a specific plan covering each category of contingency

  17. Enhanced candu 6 reactor: status

    International Nuclear Information System (INIS)

    The CANDU 6 power reactor is visionary in its approach, renowned for its on-power refuelling capability and proven over years of safe, economical and reliable power production. Developed by Atomic Energy of Canada Limited (AECL), the CANDU 6 design offers excellent performance utilizing state-of-the-art technology. The first CANDU 6 plants went into service in the early 1980s as leading edge technology and the design has been continuously advanced to maintain superior performance with an outstanding safety record. The first set of CANDU 6 plants - Gentilly 2 and Point Lepreau in Canada, Embalse in Argentina and Wolsong- Unit 1 in Korea - have been in service for more than 22 years and are still producing electricity at peak performance; to the end of 2004, their average Lifetime Capacity Factor was 83.2%. The newer CANDU 6 units in Romania (Cernavoda 1), Korea (Wolsong-Units 2, 3 and 4) and Qinshan (Phase III- Units 1 and 2) have also been performing at outstanding levels. The average lifetime Capacity Factor of the 10 CANDU 6 operating units around the world has been 87% to the end of 2004. Building on these successes, AECL is committed to the further development of this highly successful design, now focussing on meeting customers' needs for reduced costs, further improvements to plant operation and performance, enhanced safety and incorporating up-to-date technology, as warranted. This has resulted in AECL embarking on improving the CANDU 6 design through an upgraded product termed the ''Enhanced CANDU 6'' (EC6), which incorporates several attractive but proven features that make the CANDU 6 reactor even more economical, safer and easier to operate. Some of the key features that are being incorporated into the EC6 include increasing the plant's power output, shortening the overall project schedule, decreasing the capital cost, dealing with obsolescence issues, optimizing maintenance outages and incorporating lessons learnt through feedback obtained from the

  18. Second International Conference on CANDU Fuel

    International Nuclear Information System (INIS)

    Thirty-four papers were presented at this conference in sessions dealing with international experience and programs relating to CANDU fuel; fuel manufacture; fuel behaviour; fuel handling, storage and disposal; and advanced CANDU fuel cycles. (L.L.)

  19. Quality Products - The CANDU Approach

    International Nuclear Information System (INIS)

    The prime focus of the CANDU concept (natural uranium fuelled-heavy water moderated reactor) from the beginning has economy, heavy water losses and radiation exposures also were strong incentives for ensuring good design and reliable equipment. It was necessary to depart from previously accepted commercial standards and to adopt those now accepted in industries providing quality products. Also, through feedback from operating experience and specific design and development programs to eliminate problems and improve performance, CANDU has evolved into today's successful product and one from which future products will readily evolve. Many lessons have been learned along the way. On the one hand, short cuts of failures to understand basic requirements have been costly. On the other hand, sound engineering and quality equipment have yielded impressive economic advantages through superior performance and the avoidance of failures and their consequential costs. The achievement of lifetime economical performance demands quality products, good operation and good maintenance. This paper describes some of the basic approaches leading to high CANDU station reliability and overall excellent performance, particularly where difficulties have had to be overcome. Specific improvements in CANDU design and in such CANDU equipment as heat transport pumps, steam generators, valves, the reactor, fuelling machines and station computers, are described. The need for close collaboration among designers, nuclear laboratories, constructors, operators and industry is discussed. This paper has reviewed some of the key components in the CANDU system as a means of indicating the overall effort that is required to provide good designs and highly reliable equipment. This has required a significant investment in people and funding which has handsomely paid off in the excellent performance of CANDU stations. The close collaboration between Atomic Energy of Canada Limited, Canadian industry and the

  20. ACR technology for CANDU enhancements

    International Nuclear Information System (INIS)

    The ACR-1000 design retains many essential features of the original CANDU plant design. As well as further-enhanced safety, the design also focuses on operability and maintainability, drawing on valuable customer input and OPEX. The engineering development of the ACR-1000 design has been accompanied by a research and confirmatory testing program. This program has extended the database of knowledge on the CANDU design. The ACR-1000 design has been reviewed by the Canadian regulator, the Canadian Nuclear Safety Commission (CNSC) which concluded that there are no fundamental barriers to licensing the ACR-1000 design in Canada after completing three phases of the pre-project design review. The generic PSAR for the ACR-1000 design was completed in September 2009. The PSAR contains the ACR-1000 design details, the safety and design methodology, and the safety analysis that demonstrate the ACR-1000 safety case and compliance with Canadian and international regulatory requirements and expectations. The ACR technology developed during the ACR-1000 Engineering Program and the supporting development testing has had a major impact beyond the ACR program itself: Improved CANDU components and systems; Enhanced engineering processes and engineering tools, which lead to better product quality, and better project efficiency; and Improved operational performance. This paper provides a summary of technology arising from the ACR program that has been incorporated into new CANDU designs such as the EC6, or can be applied for servicing operating CANDU reactors. (author)

  1. Build your own Candu reactor

    International Nuclear Information System (INIS)

    The author discusses the marketing of Candu reactors, particularly the export trade. Future sales will probably be of the nuclear side of a station only, thus striking a compromise between licensing and 'turnkey' sales. It is suggested that AECL might have made more money in the past had it not given the right to manufacture Candu fuel away to Canadian industry. Future sales to certain potential customers may be limited by the requirement of strict safeguards, which will almost certainly never be relaxed. (N.D.H.)

  2. Candu advanced fuel cycles: key to energy sustainability

    International Nuclear Information System (INIS)

    A primary rationale for Indonesia to proceed with a nuclear power program is to diversity its energy sources and achieve freedom from future resource constraints. While other considerations, such as economy of power supply, hedging against potential future increases in the price of fossil fuels, fostering the technological development of the Indonesia economy and minimizing greenhouse and other gaseous are important, the strategic resource issue is key. In considering candidate nuclear power technologies upon which to base such a program, a major consideration will be the potential for those technologies to be economically sustained in the face of large future increases in demand for nuclear fuels. the technology or technologies selected should be amenable to evaluation in a rapidly changing technical, economic, resource and environmental policy environment. the world's proven uranium resources which can be economically recovered represent a fairly modest energy resource if utilization is based on the currently commercialized fuel cycles, even with the use of recovered plutonium in mixed oxide fuels. In the long term, fuel cycles relying solely on the use of light water reactors will encounter increasing fuel supply constraints. Because of its outstanding neutron economy and the flexibility of on-power refueling, Candu reactors are the most fuel resource efficient commercial reactors and offer the potential for accommodating an almost unlimited variety of advanced and even more fuel efficient cycles. Most of these cycles utilize nuclear fuel which are too low grade to be used in light water reactors, including many products now considered to be waste, such as spent light water reactor fuel and reprocessing products such as recovered uranium. The fuel-cycle flexibility of the Candu reactor provides a ready path to sustainable energy development in both the short and the long terms. Most of the potential Candu fuel cycle developments can be accommodated in existing

  3. CANDU steam generator life management

    International Nuclear Information System (INIS)

    Steam generators are a critical component of a nuclear power reactor, and can contribute significantly to station unavailability, as has been amply demonstrated in Pressurized Water Reactors (PWRs). CANDU steam generators are not immune to steam generator degradation, and the variety of CANDU steam generator designs and tube materials has led to some unexpected challenges. However, aggressive remedial actions, and careful proactive maintenance activities, have led to a decrease in steam generator-related station unavailability of Canadian CANDUs. AECL and the CANDU utilities have defined programs that will enable existing or new steam generators to operate effectively for 40 years. Research and development work covers corrosion and mechanical degradation of tube bundles and internals, chemistry, thermalhydraulics, fouling, inspection and cleaning, as well as provision for specially tool development for specific problem solving. A major driving force is development of CANDU-specific fitness-for-service guidelines, including appropriate inspection and monitoring technology to measure steam generator condition. Longer-range work focuses on development of intelligent on-line monitoring for the feedwater system and steam generator. New designs have reduced risk of corrosion and fouling, are more easily inspected and cleaned, and are less susceptible to mechanical damage. The Canadian CANDU utilities have developed programs for remedial actions to combat degradation of performance (Gentilly-2, Point Lepreau, Bruce A/B, Pickering A/B), and have developed strategic plans to ensure that good future operation is ensured. The research and development program, as well as operating experience, has identified where improvements in operating practices and/or designs can be made in order to ensure steam generator design life at an acceptable capacity factory. (author)

  4. Investigation of techniques for the application of safeguards to the CANDU 600 MW(e) nuclear generating station

    International Nuclear Information System (INIS)

    A cooperative program with the Canadian Atomic Energy Control Board, Atomic Energy of Canada Limited and the IAEA was established in 1975: to determine the diversion possibilities at the CANDU type reactors using a diversion path analysis; to detect the diversion of nuclear materials using material accountancy and surveillance/containment. Specific techniques and instrumentation, some of which are unique to the CANDU reactor, were developed. 10 appendices bring together the relevant reports and memoranda of results for the Douglas Point Program

  5. Thorium utilization in Candu reactors

    International Nuclear Information System (INIS)

    In this study, means of thorium utilization in a CANDU reactor are considered. A once through thorium-DUPIC cycle is analyzed in detail. CANDU has the best neutron economy among the commercially available power reactors, which makes it suitable for many different fuel cycle options. A review of the available fuel cycles is also done in the scope of this study to select an economically viable cycle which does not impose profound changes in the neutronic properties of the core that require remodeling of core and related systems. To create a good model ot the CANDU core for the necessary calculations, the steady state properties of CANDU reactor are analyzed. It is assumed that approximation ot refueling as moving the bundles at a constant velocity is valid. This approximation leads to a corollary; The average cross sections of two adjacent bidirectionally refueled channels are independent of axial location. This is also veritied. A result of this corollary the CANDU core can be modeled only in radial direction in cylindirical geometry. The steady state CANDU core model is prepared using the actual power values and these values are sought in the results. The control systems which effect the neutron flux shape are introduced into the model later in the form of additional absorption cross section and lower diffusion coefficient. The results are in good agreement with the actual values. Several different thorium-DUPIC fuel bundle configurations are considered and the one with 12 Th02 elements in the third ring is found to have similar burnup dependent cross-sections and location infinite multiplication factors. Using the model created, the bundle is tested also in the tull core model and it is tound that this bundle configuration complies with the current refueling scheme. That is, no changes are necessary in the refuelind rate or the control systems. A higher conversion ratio of 0.82 is attained, while the excess reactivity of the core is found to decrease by 0.01 Ak

  6. The small (or large) modular CANDU

    Energy Technology Data Exchange (ETDEWEB)

    Meneley, D.; Harvel, G. [Univ. of Ontario Inst. of Tech., Oshawa, Ontario (Canada)

    2013-07-01

    This presentation outlines the design for small (or large) modular CANDU. The origins of this work go back many years to a comment by John Foster, then President of AECL CANDU. Foster noted that the CANDU reactor, with its many small fuel channels, was like a wood campfire. To make a bigger fire, just throw on some more logs (channels). If you want a smaller fire, just use fewer logs. The design process is greatly simplified.

  7. Systems analysis of the CANDU 3 Reactor

    International Nuclear Information System (INIS)

    This report presents the results of a systems failure analysis study of the CANDU 3 reactor design; the study was performed for the US Nuclear Regulatory Commission. As part of the study a review of the CANDU 3 design documentation was performed, a plant assessment methodology was developed, representative plant initiating events were identified for detailed analysis, and a plant assessment was performed. The results of the plant assessment included classification of the CANDU 3 event sequences that were analyzed, determination of CANDU 3 systems that are ''significant to safety,'' and identification of key operator actions for the analyzed events

  8. CANDU safety under severe accidents

    International Nuclear Information System (INIS)

    The characteristics of the CANDU reactor relevant to severe accidents are set first by the inherent properties of the design, and second by the Canadian safety/licensing approach. The pressure-tube concept allows the separate, low-pressure, heavy-water moderator to act as a backup heat sink even if there is no water in the fuel channels. Should this also fail, the calandria shell itself can contain the debris, with heat being transferred to the water-filled shield tank around the core. Should the severe core damage sequence progress further, the shield tank and the concrete reactor vault significantly delay the challenge to containment. Furthermore, should core melt lead to containment overpressure, the containment behaviour is such that leaks through the concrete containment wall reduce the possibility of catastrophic structural failure. The Canadian licensing philosophy requires that each accident, together with failure of each safety system in turn, be assessed (and specified dose limits met) as part of the design and licensing basis. In response, designers have provided CANDUs with two independent dedicated shutdown systems, and the likelihood of Anticipated Transients Without Scram is negligible. Probabilistic safety assessment studies have been performed on operating CANDU plants, and on the 4 x 880 MW(e) Darlington station now under construction; furthermore a scoping risk assessment has been done for a CANDU 600 plant. They indicate that the summed severe core damage frequency is of the order of 5 x 10-6/year. 95 refs, 3 tabs

  9. Shortest path improved algorithm based on GIS under large-scale disaster%重大灾害条件下基于GIS的最短路径改进算法

    Institute of Scientific and Technical Information of China (English)

    于德新; 杨薇; 杨兆升

    2011-01-01

    利用经典的Dijkstra算法,对重大灾害条件下Dijkstra算法进行了改进,构建了惩罚因子函数,结合GIS软件二次开发模块,通过Visual C++6.0实现了复杂网络的分析功能。分析了重大灾害条件下节点数量对于道路可靠性以及最优路径选取的影响,综合考虑距离、行程时间以及节点数量因素,证明了改进Dijkstra算法对于最优路径选择的优越性。分析结果表明:利用改进Dijkstra算法、经典Dijkstra算法计算出的路径节点数分别为31、59,行程时间基本相同。可见,改进算法能有效减少疏散路径中的节点数%The Dijkstra algorithm under large-scale disaster was improved by using classical Dijkstra algorithm,and the function of penalty factor was built.Complex network analysis function was realized by using Visual C++ 6.0 and the secondary development module of GIS.The impacts of node quantity on road reliability and the selection of optimal path under large-scale disaster were analyzed.Distance,travel time and node quantity were considered,the advantage of improved Dijkstra algorithm in the selection of optimal path was proved.Analysis result shows that the node quantities computed by improved Dijkstra algorithm and classical Dijkstra algorithm are 31,59 respectively,travel times are almost same.So the improved algorithm can reduce the node quantity in evacuation route effectively,and decrease the delay loss and risk of vehicle at the node.1 tab,2 figs,11 refs.

  10. On applying separator decompositions to path problems and network flow

    NARCIS (Netherlands)

    Jansen, M.J.

    2001-01-01

    Separator decompositions have proven to be useful for efficient parallel shortest- path computation. In this paper the applicability of separator decompositions to maximum ow computation is explored. It is shown that efficient parallel shortest- path computation can be incorporated in the shortest a

  11. CANDU reactors. Experience and innovation

    International Nuclear Information System (INIS)

    The title of this paper highlights two key considerations which must be properly balanced through good management in the evolution of any engineering product. Excessive reliance on experience will lead to product stagnation; excessive reliance on innovation will often lead to an unsatisfactory product, at least in the first generation of this product. To illustrate this balancing process, the paper reviews CANDU evolution and experience and the balance between proveness and innovation achieved through management of the evolution process from early prototypes to today's large-scale commercial units. A forecast of continuing evolutionary directions is included

  12. CANDU safety analysis system establishment

    Energy Technology Data Exchange (ETDEWEB)

    Min, Byung Joo; Rhee, B. W.; Park, J. H.; Kim, H. T.; Choi, H. B.; Shim, J. I.; Yoon, C.; Yang, M. K

    2002-03-01

    To develop CANDU safety analysis system, methodology, and assessment technology, GAIs from CNSC and GSIs drived by IAEA are summarized. Furthermore, the following safety items are investigated in the present study. - It is intended to secure credibility of the void reactivity in the stage of nuclear design and analysis. The measurement data concerned with the void reactivity were reviewed and used to assess the physics code such as POWDERPUFS-V/RFSP, and the lattice code such as WIMS-AECL and MCNP-4B. - Reviewing the Final Safety Analysis Report for Wolsong-2/3/4 Units, the safety analysis methodology, classification for accident scenarios, safety analysis codes, their interface, etc. were examined. - The development of 3D CFD transient analysis model has been performed to predict local subcooling of the moderator in the vicinity of Calandria tubes in a CANDU-6 reactor in the case of Large LOCA transient. - The trip coverage analysis methodology based on CATHENA code is developed. The simulation of real plant transient showed good agreement. The trip coverage map was generated successfully for two typical depressurization and pressurization event. - The multi-dimensional analysis methodology for hydrogen distribution and hydrogen burning phenomena in PHWR containment is developed using GOTHIC code. The multi-dimensional analysis predicts the local hydrogen behaviour compared to the lumped parameter model.

  13. CANDU plant life management - An integrated approach

    International Nuclear Information System (INIS)

    Commercial versions of CANDU reactors were put into service starting more than 25 years ago. The first unit of Ontario Hydro's Pickering A station was put into service in 1971, and Bruce A in 1977. Most CANDU reactors, however, are only now approaching their mid-life of 15 to 20 years of operation. In particular, the first series of CANDU 6 plants which entered service in the early 1980's were designed for a 30 year life and are now approaching mid life. The current CANDU 6 design is based on a 40 year life as a result of advancement in design and materials through research and development. In order to assure safe and economic operation of these reactors, a comprehensive CANDU Plant Life Management (PLIM) program is being developed from the knowledge gained during the operation of Ontario Hydro's Pickering, Bruce, and Darlington stations, worldwide information from CANDU 6 stations, CANDU research and development programs, and other national and international sources. This integration began its first phase in 1994, with the identification of most of the critical systems structures and components in these stations, and a preliminary assessment of degradation and mechanisms that could affect their fitness for service for their planned life. Most of these preliminary assessments are now complete, together with the production of the first iteration of Life Management Plans for several of the systems and components. The Generic CANDU 6 PLIM program is now reaching its maturity, with formal processes to systematically identify and evaluate the major CSSCs in the station, and a plan to ensure that the plant surveillance, operation, and maintenance programs monitor and control component degradation well within the original design specifications essential for the plant life attainment. A Technology Watch program is being established to ensure that degradation mechanisms which could impact on plant life are promptly investigated and mitigating programs established. The

  14. Cobalt-60 production in CANDU power reactors

    International Nuclear Information System (INIS)

    The technology for cobalt-60 production in CANDU reactors, designed and developed by MDS Nordion and AECL, has been safely,economically and successfully employed in CANDU reactors with over 195 reactor years of production. Today over forty percent of the world's disposable medical supplies are made safer through sterilization using cobalt-60 sources from MDS Nordion. Over the past 40 years, MDS Nordion with its CANDU reactor owner partners, has safely and reliably shipped more than 500 million curies of cobalt-60 sources to customers around the world

  15. Tawanda’s non- iterative optimal tree algorithm for shortest route problems

    Directory of Open Access Journals (Sweden)

    Trust Tawanda

    2013-03-01

    Full Text Available So many algorithms have been proposed to solve the shortest path in road networks, in this paper, an algorithm is developed to solve shortest route problems. The algorithm is being demonstrated through solving of various network problems. The principle of the algorithm consist in  transforming  the graph into a tree by means of arc and node replication, thereby expanding outwards from the source node  considering all possible paths up to the destination node. The objective is to develop a method that can be applied in directed and non-directed graphs.

  16. Two-phase algorithms for the parametric shortest path problem

    OpenAIRE

    Fischer, Eldar; Lachish, Oded; Yuster, Raphael

    2010-01-01

    A {\\em parametric weighted graph} is a graph whose edges are labeled with continuous real functions of a single common variable. For any instantiation of the variable, one obtains a standard edge-weighted graph. Parametric weighted graph problems are generalizations of weighted graph problems, and arise in various natural scenarios. Parametric weighted graph algorithms consist of two phases. A {\\em preprocessing phase} whose input is a parametric weighted graph, and whose output is a data str...

  17. A Random Riemannian Metric for Probabilistic Shortest-Path Tractography

    DEFF Research Database (Denmark)

    Hauberg, Søren; Schober, Michael; Liptrot, Matthew George;

    2015-01-01

    diffusion tensor as a “random Riemannian metric”, where a geodesic is a distribution over tracts. We approximate this distribution with a Gaussian process and present a probabilistic numerics algorithm for computing the geodesic distribution. We demonstrate SPT improvements on data from the Human Connectome...

  18. Watershed Cuts: Thinnings, Shortest Path Forests, and Topological Watersheds

    OpenAIRE

    Cousty, Jean; Bertrand, Gilles; Najman, Laurent; Couprie, Michel

    2010-01-01

    International audience We recently introduced the watershed cuts, a notion of watershed in edge-weighted graphs. In this paper, our main contribution is a thinning paradigm from which we derive three algorithmic watershed cut strategies: the first one is well suited to parallel implementations, the second one leads to a flexible linear-time sequential implementation whereas the third one links the watershed cuts and the popular flooding algorithms. We state that watershed cuts preserve a n...

  19. Future fuel cycle development for CANDU reactors

    International Nuclear Information System (INIS)

    The CANDU reactor has proven to be safe and economical and has demonstrated outstanding performance with natural uranium fuel. The use of on-power fuelling, coupled with excellent neutron economy, leads to a very flexible reactor system with can utilize a wide variety of fuels. The spectrum of fuel cycles ranges from natural uranium, through slightly enriched uranium, to plutonium and ultimately thorium fuels which offer many of the advantages of the fast breeder reactor system. CANDU can also burn the recycled uranium and/or the plutonium from fuel discharged from light water reactors. This synergistic relationship could obviate the need to re-enrich the reprocessed uranium and allow a simpler reprocessing scheme. Fule management strategies that will permit future fuel cycles to be used in existing CANDU reactors have been identified. Evolutionary design changes will lead to an even greater flexibility, which will guarantee the continued success of the CANDU system. (author)

  20. The third generation CANDU control room

    International Nuclear Information System (INIS)

    In CANDU stations, as in most complex industrial plants, the man/machine interface design has progressed through three generations. First Generation control rooms consisted entirely on fixed, discrete components (handswitches, indicator lights, strip chart, recorder, annunciator windows, etc.). Human factors input was based on intuitive common sense factors which varied considerably from one designer to another. Second Generation control rooms incorporated video display units and keyboards in the control panels. Computer information processing and display are utilized. There is systematic application of human factors through ergonomic and anthropometric standards and cookbooks. The human factors are applied mainly to the physical layout of the control panels and the physical manipulation performed by the operators. Third Generation control rooms exploit the dramatic performance/cost improvements in computer, electronic display and communication technologies of the 1980's. Further applications of human factors address the cognitive aspects of operator performance. At AECL, second generation control rooms were installed on CANDU stations designed in the mid 70s and early 80s. Third generation features will be incorporated in the CANDU 3 station design and future CANDU stations. There have been significant improvements in the man/machine interface in CANDU stations over the past three decades. The continuing rapid technological developments in computers and electronics coupled with an increasing understanding and application of human factors principles is leading to further enhancements. This paper outlines progress achieved in earlier stations and highlights the features of the CANDU 3rd generation control room. (author). 13 refs, 5 figs

  1. Drift effects in CANDU reactors

    International Nuclear Information System (INIS)

    The diffusion equation is an approximation to the transport equation which relies on the validity of Fick's law. Since this law is not explicitly integrated in the transport equation it can only be derived approximately using homogenization theories. However, such homogenization theories state that when the cell is not symmetric Fick's law breaks down due to the presence of an additional term to the neutron current, called the drift term. In fact, this term can be interpreted as a transport correction to Fick's law which tends to increase the neutron current in a direction opposite to that specified by the flux gradient. In this paper, we investigate how the presence of asymmetric liquid zone controllers will modify the flux distribution inside a CANDU core. 5 refs., 2 figs., 1 tab

  2. Mitigating aging in CANDU plants

    International Nuclear Information System (INIS)

    Aging degradation is a phenomenon we all experience throughout life, both on a personal basis and in business. Many industries have been successful in postponing the inevitable impact on their related systems and components through programs to maintain long-term reliability, maintainability and safety. However, this has not always been the case for nuclear power. While all power plants are experiencing the world trend of increasing operating costs with age, few (if any) have been able to fully define the parameters that solve the aging equation, particularly in relation to major components. Inspection and preventive maintenance have not been effective in predicting life-limiting degradation and failure. In CANDU nuclear plants, utilities are taking a comprehensive approach in dealing with the aging problem. Programs have been established to identify the current condition and degradation mechanisms of critical components, the failure of which would impact negatively on station competitiveness and safety. These include subcomponents under the general headings of reactor components, civil structures, piping (nuclear and conventional), steam generators, turbines and cables. In support of these efforts, R and D projects have been defined under the CANDU Owners Group to deal with generic issues on aging common to its members (e.g., investigation of degradation mechanisms, development of tools and techniques to mitigate the effects of aging, etc.). This paper describes recent developments of this cost-shared program with specific reference to concrete aging and crack repairs, flow-assisted corrosion in piping, elastomer service life, cable aging, degradation mechanisms in steam generators and lubricant breakdown. (author)

  3. Absorber materials in CANDU PHWRs

    International Nuclear Information System (INIS)

    In a CANDU reactor the fuel channels are arranged on a square lattice in a calandria filled with heavy water moderator. This arrangement allows five types of tubular neutron absorber devices to be located in the relatively benign environment of low pressure, low temperature heavy water between neighbouring rows or columns of fuel channels. This paper will describe the roles of the devices and outline the design requirements of the absorber component from a reactor physics viewpoint. Nuclear heating and activation problems associated with the different absorbers will be briefly discussed. The design and manufacture of the devices will be also discussed. The control rod absorbers and shut off materials are cadmium and stainless steel. In the tubular arrangement, the cadmium is sandwiched between stainless steel tubes. This type of device has functioned well, but there is now concern over the availability and expense of cadmium which is used in two types of CANDU control devices. There are also concerns about the toxicity of cadmium during the fabrication of the absorbers. These concerns are prompting AECL to study alternatives. To minimize design changes, pure boron-10 alloyed in stainless steel is a favoured option. Work is underway to confirm the suitability of the boron-loaded steel and identify other encapsulated absorber materials for practical application. Because the reactivity devices or their guide tubes span the calandria vessel, the long slender components must be sufficiently rigid to resist operational vibration and also be seismically stable. Some of these components are made of Zircaloy to minimize neutron absorption. Slow irradiation growth and creep can reduce the spring tension, and periodic adjustments to the springs are required. Experience with the control absorber devices has generally been good. In one instance liquid zone controllers had a problem of vibration induced fretting but a redesigned back-fit resolved the problem. (author). 3 refs, 8

  4. 基于MPI+OpenMP混合编程模型的城市路网最短路径并行算法%Parallel algorithm for urban road network shortest path based on MPI+OpenMP hybrid programming model

    Institute of Scientific and Technical Information of China (English)

    杨庆芳; 刘冬; 杨兆升

    2011-01-01

    An MPI+OpenMP hybrid programming model was proposed based on the Floyd algorithm as its core to solve the shortest path problem which needs huge computation and high real-timeness.The proposed model provides the intra-and inter-node hierarchical parallel processing,takes full advantage of shared memory model and message passing model,improves the system performance,and enhances the calculation speed.The model was validated by the road network in Changchun city,and the results showed that the proposed model is characterized by better speedup ratio and operation efficiency than the MPI model.With the increase of the node,the speedup ratio of the model improves more significantly,indicating the model has a better expansibility.%针对城市路网最短路径求解计算量庞大、实时性要求高的问题,提出了用Floyd算法为核心的MPI+OpenMP混合编程模型来解决这个问题。MPI+OpenMP混合编程提供结点内和结点间的两级并行处理,能充分利用共享存储模型和消息传递模型的优点,有效改善系统性能,提高系统计算速度。经由长春市路网验证可知,混合模型比MPI模型具有更好的加速比和运算效率,并且随着计算节点个数的增加,加速比提高幅度更大,表明MPI+OpenMP混合模型有着更好的可扩展性。

  5. Assessment of RELAP5/CANDU+ code for regulatory auditing analysis of CANDU reactors

    Energy Technology Data Exchange (ETDEWEB)

    Bang, Young Seok; Kim, Hho Jung; Yang, Chae Yong

    2001-12-15

    The objectives of this study are to undertake the verification and validation of RELAP5/CANDU+ code, which is developed in this project, by simulating the B8711 test of RD-14 facility, and to examine the properties of this code by doing the sensitivity analysis for experimental prediction modes about thermal-hydraulics phenomena in CANDU reactor systems added to this code. The B8711 test was an experiment of a 45% ROH break for simulating large LOCA. Also, in this study, the methods for making input cards related to CANDU options are described, so that some users can use the RELAP5/CANDU+ code with easy. RELAP/CANDU+ code can choose the options of Henry-Fauske mode, Ransom-Trapp model, and Moody model for prediction of the critical mass flow. It is examined that Henry-Fauske model and Ransom-Trapp model are considered properly, but Moody model is still required to be improved. Heat transfer correlations available in RELAP5/CANDU+ code for CANDU-type reactors are a horizontal stratified model, a fuel heat-up model and D2O/H2O CHF correlations, and these models take an important role to improve the predictability of the experimental procedures. It is concluded that RELAP5/CANDU+ code is useful for the auditing of the accident analysis of CANDU reactors, and the results of the sensitivity analysis for thermal-hydraulic models examined in this study are valuable for the actual auditing of real CANDU-type power plants.

  6. Feasibility study of CANDU-9 fuel handling system

    International Nuclear Information System (INIS)

    CANDU's combination of natural uranium, heavy water and on-power refuelling is unique in its design and remarkable for reliable power production. In order to offer more output, better site utilization, shorter construction time, improved station layout, safety enhancements and better control panel layout, CANDU-9 is now under development with design improvement added to all proven CANDU advantages or applicable technologies. One of its major improvement has been applied to fuel handling system. This system is very similar to that of CANDU-3, and some parts of the system are applied to those of the existing CANDU-6 or CANDU-9. Design concepts and design requirements of fuel handling system for CANDU-9 have been identified to compare with those of the existing CANDU and the design feasibilities have been evaluated. (author). 4 tabs., 13 figs., 9 refs

  7. CANDU 9 safety enhancements and licensability

    International Nuclear Information System (INIS)

    The CANDU 9 design has followed the evolutionary product development approach that has characterized the CANDU family of nuclear power plants. In addition to utilizing proven equipment and systems from operating stations, the CANDU 9 design has looked ahead to incorporate design and safety enhancements necessary to meet evolving utility and regulatory requirements both in Canada and overseas. To demonstrate licensability in Canada, and to assure overseas customers that the design had independent regulatory review in the country of origin, the pre-project Basic Engineering Program included an extensive two year formal review by the Canadian regulatory authority, the Atomic Energy Control Board (AECB). Documentation submitted for this licensing review included the licensing basis, safety requirements and safety analysis necessary to demonstrate compliance with regulations as well as to assess system design and performance. The licensing review was successfully completed in 1997 January. In addition, to facilitate licensability in Korea, CANDU 9 incorporates feedback from the application of Korean licensing requirements to the CANDU 6 reactors at Wolsong site. (author)

  8. CANDU safety and licensing framework and process

    International Nuclear Information System (INIS)

    Nuclear Safety is a shared responsibility of the Industry, public and the Government. The International Atomic Energy Agency's (IAEA) safety fundamentals, basic objectives and safety guides lay down the principles from which requirements, recommendations and methodologies for safety design of Nuclear Power Plants (NPP) are derived. Within the framework of the international regulations and those of the Canadian Nuclear Safety Commission (CNSC), this paper will discuss the overall safety objectives, the defence in depth philosophy guiding CANDU safety, as well as the licensing process defined to meet all applicable CNSC regulations. The application of such philosophy to the ACR design and safety approach will also be discussed along with aspects of its implementation. The role of deterministic analysis, and Probabilistic Safety Analysis (PSA) in the design and licensing process of the Advanced CANDU Reactor will be discussed. Postulated initiating events and their combinations, acceptance criteria, CANDU margins and limits, supporting methodologies and computer codes used in safety analysis will be reviewed. The paper will also note intrinsic safety characteristics of CANDU, some of the ACR passive safety features built-in by design, CANDU distinctive features with respect to severe core damage, mechanisms of heat rejection in those extreme conditions, emergency coolant injection system features and other post accident mitigating systems. Update on the ACR Canadian and US licensing progress will also be provided. (authors)

  9. An analytic study on LBLOCA for CANDU type reactor using MARS-KS/CANDU

    International Nuclear Information System (INIS)

    This study provides the simulation results using MARS-KS/CANDU code for the Large Break LOCA of CANDU type reactor. The purpose of the study is to evaluate the capability of MARS-KS/CANDU for simulating the actual plants (Wolsong 2/3/4). The steady state and the transient analysis results were provided. After the sensitivity study depend on break size, the case that 35% of the inlet header known as the accident that has the most limiting effect on the temperature of the fuel sheath was calculated. In order to evaluate the results, the results were compared with those of CATHENA simulation. (author)

  10. ACR-1000TM - advanced Candu reactor design

    International Nuclear Information System (INIS)

    Atomic Energy of Canada Limited (AECL) has developed the Advanced CANDU ReactorTM- 1000 (ACR-1000TM) as an evolutionary advancement of the current CANDU 6TM reactor. This evolutionary advancement is based on AECL's in-depth knowledge of CANDU structures, systems, components and materials, gained during 50 years of continuous construction, engineering and commissioning, as well as on the experience and feedback received from operators of CANDU plants. The ACR design retains the proven strengths and features of CANDU reactors, while incorporating innovations and state-of-the-art technology. These innovations improve economics, inherent safety characteristics, and performance, while retaining the proven benefits of the CANDU family of nuclear power plants. The Canadian nuclear reactor design evolution that has reached today's stage represented by the ACR-1000, has a long history dating back to the early 1950's. In this regard, Canada is in a unique situation, shared only by a very few other countries, where original nuclear power technology has been invented and further developed. The ACR design has been reviewed by domestic and international regulatory bodies, and has been given a positive regulatory opinion about its licensability. The Canadian regulator, the Canadian Nuclear Safety Commission (CNSC) completed the Phase 1 and Phase 2 pre-project design reviews in December 2008 and August 2009, respectively, and concluded that there are no fundamental barriers to licensing the ACR-1000 design in Canada. The final stage of the ACR-1000 design is currently underway and will be completed by fall of 2011, along with the final elements of the safety analyses and probabilistic safety analyses supporting the finalized design. The generic Preliminary Safety Analysis Report (PSAR) for the ACR-1000 was completed in September 2009. The PSAR demonstrates ACR-1000 safety case and compliance with Canadian and international regulatory requirements and expectations. (authors)

  11. Neutronic parameters calculations of a CANDU reactor

    International Nuclear Information System (INIS)

    Neutronic calculations that reproduce in a simplified way some aspects of a CANDU reactor design were performed. Starting from some prefixed reactor parameters, cylindrical and uniform iron adjuster rods were designed. An appropriate refueling scheme was established, defininig in a 2 zones model their dimensions and exit burnups. The calculations have been done using the codes WIMS-D4 (cell), SNOD (reactivity device simulations) and PUMA (reactor). Comparing with similar calculations done with codes and models usually employed for CANDU design, it is concluded that the models and methods used are appropriate. (Author)

  12. The CANTEACH project: preserving CANDU technical knowledge

    International Nuclear Information System (INIS)

    Almost sixty years have passed since the nuclear energy venture began in Canada. Fifty years have passed since the founding of AECL. Tens of thousands of dedicated people have forged a new and successful primary energy supply. CANDU technology is well into its second century. This specialty within the world's fission technology community is quite unique, first because it was established as a separate effort very early in the history of world fission energy, and second because it grew in an isolated environment, with tight security requirements, in its early years. Commercial security rules later sustained a considerable degree of isolation. The pioneers of CANDU development have finished their work. Most of the second generation also has moved on. As yet, we cannot point to a consistent and complete record of this remarkable achievement. We, as a nuclear enterprise, have not captured the design legacy in a form that is readily accessible to the current and future generation of professionals involved with CANDU reactors, be they students, designers, operations staff, regulators, consultants or clients. This is a serious failure. Young people entering our field of study must make do with one or two textbooks and a huge collection of diverse technical papers augmented by limited-scope education and training materials. Those employed in the various parts of the nuclear industry rely mostly on a smaller set of CANDU- related documents available within their own organization; documents that sometimes are rather limited in scope. University professors often have even more limited access to in-depth and up to date information. In fact, they often depend on literature published in other countries when preparing lectures, enhanced by guest lecturers from various parts of the industry. Because CANDU was developed mostly inside Canada, few of these text materials contain useful data describing processes important to the CANDU system. For many years it has been recognized that

  13. Path querying system on mobile devices

    Science.gov (United States)

    Lin, Xing; Wang, Yifei; Tian, Yuan; Wu, Lun

    2006-01-01

    Traditional approaches to path querying problems are not efficient and convenient under most circumstances. A more convenient and reliable approach to this problem has to be found. This paper is devoted to a path querying solution on mobile devices. By using an improved Dijkstra's shortest path algorithm and a natural language translating module, this system can help people find the shortest path between two places through their cell phones or other mobile devices. The chosen path is prompted in text of natural language, as well as a map picture. This system would be useful in solving best path querying problems and have potential to be a profitable business system.

  14. Exporting apocalypse: CANDU reactors and nuclear proliferation

    International Nuclear Information System (INIS)

    The author believes that the peaceful use of nuclear technology leads inevitably to the production of nuclear weapons, and that CANDU reactors are being bought by countries that are likely to build bombs. He states that exports of reactors and nuclear materials cannot be defended and must be stopped

  15. Spreading paths in partially observed social networks

    CERN Document Server

    Onnela, Jukka-Pekka

    2011-01-01

    Understanding how far information, behaviors, or pathogens spread in social networks is an important problem, having implications for both predicting the size of epidemics, as well as for planning effective interventions. There are, however, two main challenges for inferring spreading path lengths in real-world networks. One is the practical difficulty of observing a dynamic process on a network, and the other is the typical constraint of only partially observing a network. Using a static, structurally realistic social network as a platform for simulations, we juxtapose three distinct paths: (1) the stochastic path taken by a simulated spreading process from source to target; (2) the topologically shortest path in the fully observed network, and hence the single most likely stochastic path, between the two nodes; and (3) the topologically shortest path in a partially observed network. In a sampled network, how closely does the partially observed shortest path (3) emulate the unobserved spreading path (1)? Alt...

  16. Development situation about the Canadian CANDU Nuclear Power Generating Stations

    International Nuclear Information System (INIS)

    The CANDU reactor is the most versatile commercial power reactor in the world. The acronym 'CANDU', a registered trademark of Atomic Energy of Canada Limited, stands for 'CANada Deuterium Uranium'. CANDU uses heavy water as moderator and uranium (originally, natural uranium) as fuel. All current power reactors in Canada are of the CANDU type. Canada exports CANDU type reactor in abroad. CANDU type is used as the nuclear power plants to produce electrical. Today, there are 41 CANDU reactors in use around the world, and the design has continuously evolved to maintain into unique technology and performance. The CANDU-6 power reactor offers a combination of proven, superior and state-of-the-art technology. CANDU-6 was designed specifically for electricity production, unlike other major reactor types. One of its characteristics is a very high operating and fuel efficiency. Canada Nuclear Power Generating Stations were succeeded in a commercial reactor of which the successful application of heavy water reactor, natural uranium method and that on-power fuelling could be achieved. It was achieved through the joint development of a major project by strong support of the federal government, public utilities and private enterprises. The potential for customization to any country's needs, with competitive development and within any level of domestic industrial infrastructure, gives CANDU technology strategic importance in the 21st century

  17. Using Advanced Fuel Bundles in CANDU Reactors

    International Nuclear Information System (INIS)

    Improving the exit fuel burnup in CANDU reactors was a long-time challenge for both bundle designers and performance analysts. Therefore, the 43-element design together with several fuel compositions was studied, in the aim of assessing new reliable, economic and proliferation-resistant solutions. Recovered Uranium (RU) fuel is intended to be used in CANDU reactors, given the important amount of slightly enriched Uranium (~0.96% w/o U235) that might be provided by the spent LWR fuel recovery plants. Though this fuel has a far too small U235 enrichment to be used in LWR's, it can be still used to fuel CANDU reactors. Plutonium based mixtures are also considered, with both natural and depleted Uranium, either for peacefully using the military grade dispositioned Plutonium or for better using Plutonium from LWR reprocessing plants. The proposed Thorium-LEU mixtures are intended to reduce the Uranium consumption per produced MW. The positive void reactivity is a major concern of any CANDU safety assessment, therefore reducing it was also a task for the present analysis. Using the 43-element bundle with a certain amount of burnable poison (e.g. Dysprosium) dissolved in the 8 innermost elements may lead to significantly reducing the void reactivity. The expected outcomes of these design improvements are: higher exit burnup, smooth/uniform radial bundle power distribution and reduced void reactivity. Since the improved fuel bundles are intended to be loaded in existing CANDU reactors, we found interesting to estimate the local reactivity effects of a mechanical control absorber (MCA) on the surrounding fuel cells. Cell parameters and neutron flux distributions, as well as macroscopic cross-sections were estimated using the transport code DRAGON and a 172-group updated nuclear data library. (author)

  18. Thermochemical modelling of advanced CANDU reactor fuel

    Science.gov (United States)

    Corcoran, Emily Catherine

    2009-04-01

    With an aging fleet of nuclear generating facilities, the imperative to limit the use of non-renewal fossil fuels and the inevitable need for additional electricity to power Canada's economy, a renaissance in the use of nuclear technology in Canada is at hand. The experience and knowledge of over 40 years of CANDU research, development and operation in Ontario and elsewhere has been applied to a new generation of CANDU, the Advanced CANDU Reactor (ACR). Improved fuel design allows for an extended burnup, which is a significant improvement, enhancing the safety and the economies of the ACR. The use of a Burnable Neutron Absorber (BNA) material and Low Enriched Uranium (LEU) fuel has created a need to understand better these novel materials and fuel types. This thesis documents a work to advance the scientific and technological knowledge of the ACR fuel design with respect to thermodynamic phase stability and fuel oxidation modelling. For the BNA material, a new (BNA) model is created based on the fundamental first principles of Gibbs energy minimization applied to material phase stability. For LEU fuel, the methodology used for the BNA model is applied to the oxidation of irradiated fuel. The pertinent knowledge base for uranium, oxygen and the major fission products is reviewed, updated and integrated to create a model that is applicable to current and future CANDU fuel designs. As part of this thesis, X-Ray Diffraction (XRD) and Coulombic Titration (CT) experiments are compared to the BNA and LEU models, respectively. From the analysis of the CT results, a number of improvements are proposed to enhance the LEU model and provide confidence in its application to ACR fuel. A number of applications for the potential use of these models are proposed and discussed. Keywords: CANDU Fuel, Gibbs Energy Mimimization, Low Enriched Uranium (LEU) Fuel, Burnable Neutron Absorber (BNA) Material, Coulometric Titration, X-Ray Diffraction

  19. Advanced CANDU reactor development: a customer-driven program

    International Nuclear Information System (INIS)

    The Advanced CANDU Reactor (ACR) product development program is well under way. The development approach for the ACR is to ensure that all activities supporting readiness for the first ACR project are carded out in parallel, as parts of an integrated whole. In this way design engineering, licensing, development and testing, supply chain planning, construct ability and module strategy, and planning for commissioning and operations, all work in synergy with one another. Careful schedule management :ensures that program focus stays on critical path priorities.'This paper provides an overview of the program, with an emphasis on integration to ensure maximum project readiness, This program management approach is important now that AECL is participating as the reactor vendor in Dominion Energy's DOE-sponsored Combined Construction/Operating License (COL) program. Dominion Energy selected the ACR-700 as their reference reactor technology for purposes of demonstrating the COL process. AECL's development of the ACR is unique in that pre-licensing activities are being carded out parallel in the USA and Canada, via independent, but well-communicated programs. In the short term, these programs are major drivers of ACR development. The ACR design approach has been to optimize to achieve major design objectives: capital cost reduction, robust design with ample margins, proveness by using evolutionary change from existing :reference plants, design for ease :of operability. The ACR development program maintains these design objectives for each of the program elements: Design: .Carefully selected design innovations based on the SEU fuel/light water coolant:/heavy water moderator approach. Emphasis on lessons-learned review from operating experience and customer feedback Licensing: .Safety case based on strengths of existing CANDU plus benefits of optimised design Development and Test: Choice of materials, conditions to enable incremental testing building on existing CANDU and LWR

  20. Path Problems in Networks

    CERN Document Server

    Baras, John

    2010-01-01

    The algebraic path problem is a generalization of the shortest path problem in graphs. Various instances of this abstract problem have appeared in the literature, and similar solutions have been independently discovered and rediscovered. The repeated appearance of a problem is evidence of its relevance. This book aims to help current and future researchers add this powerful tool to their arsenal, so that they can easily identify and use it in their own work. Path problems in networks can be conceptually divided into two parts: A distillation of the extensive theory behind the algebraic path pr

  1. Technology spin-offs from a CANDU development program

    International Nuclear Information System (INIS)

    Both Enhanced CANDU 6 (EC6) and ACR-1000 design retain many essential features of the operating CANDU 6 plant design. As well as further-enhanced safety, the design also focuses on operability and maintainability, drawing on valuable customer input and OPEX. The engineering development of the ACR-1000 design has been accompanied by a research and confirmatory testing program. The ACR technology developed during the ACR-1000 Basic Engineering Program and the supporting development testing has extended the database of knowledge on the CANDU design. This paper provides a summary of technology arising from the ACR program that has been incorporated into new CANDU designs such as the Enhanced CANDU 6 (EC6), or can be applied for servicing operating CANDU reactors. (author)

  2. Fuel condition in Canadian CANDU 6 reactors

    Energy Technology Data Exchange (ETDEWEB)

    Hu, R.H.; Macici, N [Hydro-Quebec, Montreal, Quebec (Canada); Gibb, R. [New Brunswick Power, Lepreau, NB (Canada); Purdy, P.L.; Manzer, A.M. [Atomic Energy of Canada Limited, Mississauga, Ontario (Canada); Kohn, E. [Ontario Hydro, Toronto, Ontario (Canada)

    1997-07-01

    The cornerstone of the CANDU concept is its natural uranium fuel, and the success of its reactor operation hinges on the fuel condition in the reactor. Neutron economy, on power refuelling, and simple fuel design are among the unique characteristics of CANDU fuel. In Canadian CANDU 6 reactors (Gentilly 2 and Point Lepreau), the 37-element fuel has provided an enviable record of safe, economic and reliable plant operation for 29 reactor years to date. The fuelling cost is among the lowest in the world - a corollary of high neutron economy, simple fuel design, and judicial fuelling scheme. The reliability of fuel is high: only 21 of the 60000 bundles discharged from Gentilly 2 were confirmed defective and the five-year period from March 1992 to February 1997 saw no defect at all at Gentilly-2. Also, thanks to the inherent on-power refuelling capability and an effective defect detection and removal system, the primary coolant loops are kept extremely clean (very low activity level) - benefiting both maintenance and safety. Moreover, the inventories of fission products in the core and in the channel are maintained within the safety analysis envelope, due to on-power fuelling and sophisticated fuel management. In this paper, CANDU 6 fuel performance is reviewed against the feedback from post-irradiation examinations, and the findings from our ongoing R and D program. The results suggest that the fuel behavior m reactor are basically as originally anticipated, despite an evolutionary 3% increase in bundle uranium mass in the 1980's. For operating conditions within the CANDU 6 37-element experience, the average strains are typically 0.09%; and fission gas release, 2.7%. The UO{sub 2} fuel remains stoichiometric after irradiation. In-core measurements of pressure tube fitting are generally low. All these observations are consistent with the excellent fuel performance statistics coming out of the two Canadian CANDU 6 reactors. Additionally, this paper will briefly

  3. Fuel condition in Canadian CANDU 6 reactors

    International Nuclear Information System (INIS)

    The cornerstone of the CANDU concept is its natural uranium fuel, and the success of its reactor operation hinges on the fuel condition in the reactor. Neutron economy, on power refuelling, and simple fuel design are among the unique characteristics of CANDU fuel. In Canadian CANDU 6 reactors (Gentilly 2 and Point Lepreau), the 37-element fuel has provided an enviable record of safe, economic and reliable plant operation for 29 reactor years to date. The fuelling cost is among the lowest in the world - a corollary of high neutron economy, simple fuel design, and judicial fuelling scheme. The reliability of fuel is high: only 21 of the 60000 bundles discharged from Gentilly 2 were confirmed defective and the five-year period from March 1992 to February 1997 saw no defect at all at Gentilly-2. Also, thanks to the inherent on-power refuelling capability and an effective defect detection and removal system, the primary coolant loops are kept extremely clean (very low activity level) - benefiting both maintenance and safety. Moreover, the inventories of fission products in the core and in the channel are maintained within the safety analysis envelope, due to on-power fuelling and sophisticated fuel management. In this paper, CANDU 6 fuel performance is reviewed against the feedback from post-irradiation examinations, and the findings from our ongoing R and D program. The results suggest that the fuel behavior m reactor are basically as originally anticipated, despite an evolutionary 3% increase in bundle uranium mass in the 1980's. For operating conditions within the CANDU 6 37-element experience, the average strains are typically 0.09%; and fission gas release, 2.7%. The UO2 fuel remains stoichiometric after irradiation. In-core measurements of pressure tube fitting are generally low. All these observations are consistent with the excellent fuel performance statistics coming out of the two Canadian CANDU 6 reactors. Additionally, this paper will briefly discuss our

  4. Modelling and simulation of dynamic characteristics of CANDU-SCWR

    International Nuclear Information System (INIS)

    Owing to the thermal properties of supercritical water and features of heat transfer correlation under supercritical pressure, a detailed thermal-hydraulic model with movable boundary of is developed for CANDU-SCWR (Supercritical Water-Cooled Reactor). Steady-state results of the model agree well with the design data. The dynamic responses of CANDU-SCWR to different disturbances are simulated and characteristics are analyzed. A dynamic model for ACR is also developed using CATHENA. Differences between dynamic characteristics of CANDU-SCWR and those of ACR are highlighted and investigated. It is concluded that CANDU-SCWR has a larger time constant, but with a higher response amplitude. (author)

  5. Validation of WIMS-CANDU using Pin-Cell Lattices

    Energy Technology Data Exchange (ETDEWEB)

    Kim, Won Young; Min, Byung Joo; Park, Joo Hwan [Korea Atomic Energy Research Institute, Taejon (Korea, Republic of)

    2006-07-01

    The WIMS-CANDU is a lattice code which has a depletion capability for the analysis of reactor physics problems related to a design and safety. The WIMS-CANDU code has been developed from the WIMSD5B, a version of the WIMS code released from the OECD/NEA data bank in 1998. The lattice code POWDERPUFS-V (PPV) has been used for the physics design and analysis of a natural uranium fuel for the CANDU reactor. However since the application of PPV is limited to a fresh fuel due to its empirical correlations, the WIMS-AECL code has been developed by AECL to substitute the PPV. Also, the WIMS-CANDU code is being developed to perform the physics analysis of the present operating CANDU reactors as a replacement of PPV. As one of the developing work of WIMS-CANDU, the U{sup 238} absorption cross-section in the nuclear data library of WIMS-CANDU was updated and WIMS-CANDU was validated using the benchmark problems for pin-cell lattices such as TRX-1, TRX-2, Bapl-1, Bapl-2 and Bapl-3. The results by the WIMS-CANDU and the WIMS-AECL were compared with the experimental data.

  6. Reactor physics and economic aspects of the CANDU reactor system

    International Nuclear Information System (INIS)

    A history of the development of the CANDU system is given along with a fairly detailed description of the 600 MW(e) CANDU reactor. Reactor physics calculation methods are described, as well as comparisons between calculated reactor physics parameters and those measured in research and power reactors. An examination of the economics of CANDU in the Ontario Hydro system and a comparison between fossil fuelled and light water reactors is presented. Some physics, economics and resources aspects are given for both low enriched uranium and thorium-fuelled CANDU reactors. Finally the RβD program in Advanced Fuel Cycles is briefly described

  7. Heavy water cycle in the CANDU reactor

    International Nuclear Information System (INIS)

    Hydrogen atom has two isotopes: deuterium 1H2 and tritium 1H3. The deuterium oxide D2O is called heavy water due to its density of 1105.2 Kg/m3. Another important physical property of the heavy water is the low neutron capture section, suitable to moderate the neutrons into natural uranium fission reactor as CANDU. Due to the fact that into this reactor the fuel is cooled into the pressure tubes surrounded by a moderator, the usage of D2O as primary heat transport (PHT) agent is mandatory. Therefore a large amount of heavy water (approx. 500 tons) is used in a CANDU reactor. Being a costly resource - it represents 20% of the initial plant capital cost, D2O management is required to preserve it. (author)

  8. A review of CANDU plant lifetime management

    International Nuclear Information System (INIS)

    In recent years, plant lifetime management(PLIM) including life extension has become the focus of the nuclear industry worldwide due to a number of factors which have arisen over the past decade : new siting difficulties, imbalance of power supply and demand, and high construction costs. In order to solve the problems, the PLIM program is being developed for the purpose of life extension and improvement of plant availability and safety. This paper describes the current activities and prospects of AECL and CANDU utilities, the conceptional evaluation results for the degradation mechanisms, and PLIM regulatory aspects. In addition, this paper provides the applicability of CANDU PLIM to Wolsong Unit 1 which has been operated for 17 years

  9. CANDU 9 design for hydrogen in containment

    International Nuclear Information System (INIS)

    CANDU 9 is a single unit plant whose design is based on proven CANDU technology with some design improvements in plant performance and safety. One improvement is in the area of post-accident hydrogen control. The reactor building layout and hydrogen control system are designed to enhance atmospheric mixing and prevent unacceptably high local and global hydrogen concentrations. Preliminary safety analysis shows that a maximum of 300 kg of hydrogen is produced during the metal-water reaction phase of severe accident: a large LOCA with emergency core cooling unavailable. Even though the hydrogen production rate is conservatively overestimated, preliminary containment thermalhydraulic analysis predicts that the maximum hydrogen concentration in the accident vault peaks at 6.8% by volume without crediting hydrogen igniters and recombiners. After about one hour, the concentration throughout the reactor building is about 2.4%. (author)

  10. COG CANDU outage optimization project at Wolsong, Qinshan, Cernavoda, Point Lepreau, Darlington and Pickering

    Energy Technology Data Exchange (ETDEWEB)

    McWilliams, L. [CANDU Owners Group, Toronto, Ontario (Canada)

    2011-07-01

    This COG initiated project objective is to reduce the timeline CANDU power plants are shutdown for planned maintenance outages through knowledge sharing, benchmarking and completion of a Gap Analysis. The following CANDU Nuclear Power Stations/Facilities formed a partnership to achieve the objective: Korean Hydro and Nuclear Power Company (Wolsong), Qinshan, Societatea Nationala 'Nuclearelectrica' (Cernavoda), New Brunswick Power Nuclear (Point Lepreau), Candu Energy Inc. (formerly AECL) and Ontario Power Generation Inc. (Darlington and Pickering). Project participants selected ten focus areas to evaluate and optimize. Benchmarking studies were conducted at each utility. A Gap Analysis was performed between the stations and site specific recommendations have been made considering: Critical path improvement opportunities (Unit Shutdown, RBLRT and Unit Start up); Major work program improvement opportunities (Turbine/Generator, Electrical Maintenance, MOT, SST and the Valve Program); Recommended modifications to reduce outage durations; and, Process Improvements (standardized clearance process). A final report has been issued to each station identifying: Gap Analysis Comparison results; Best Practices for each area studied; Site specific improvement opportunities; Most Effective Process for Outage Preparation; Most Effective Outage Execution Practices; and, Contingency Plan Preparation. Results were discussed during the presentation.

  11. Independence and diversity in CANDU shutdown systems

    International Nuclear Information System (INIS)

    Atomic Energy Control Board regulations state that Canadian CANDU reactors shall have two fully effective, independent and diverse shutdown systems. The Darlington Nuclear Generating Station is the first power plant operated by Ontario Hydro to make use of software-based computer control in its shutdown systems. By virtue of the reliance placed on these systems to prevent exposure of the public to harmful radioactivity in the event of an accident, the shutdown system software has been categorized as safety critical software. An important issue that was considered in the design of the Darlington shutdown systems was how the software should be designed and incorporated into the systems to comply with the independence and diversity requirement. This paper describes how the independence and diversity requirement was complied with in previous CANDU shutdown system designs utilizing hardware components. The difference between systems utilizing hardware alone, and those utilizing both hardware and software are discussed. The results of a literature search into the issue of software diversity, the behaviour of multi-version software systems, and experience in other industries utilizing safety critical software are referred to. This paper advocates a systems approach to designing independent shutdown systems utilizing software. Opportunities exist at the system level for design decisions that can enhance software diversity and can reduce the likelihood of common mode faults in the systems. In the light of recent experience in implementing diverse safety critical software, potential improvements to the design process for CANDU shutdown systems are identified. (Author) 19 refs

  12. CANDU spent fuel dry storage interim technique

    International Nuclear Information System (INIS)

    CANDU heavy water reactor is developed by Atomic Energy of Canada (AECL) it has 40 years of design life. During operation, the reactor can discharge a lot of spent fuels by using natural uranium. The spent fuel interim storage should be considered because the spent fuel bay storage capacity is limited with 6 years inventory. Spent fuel wet interim storage technique was adopted by AECL before 1970s, but it is diseconomy and produced extra radiation waste. So based on CANDU smaller fuel bundle dimension, lighter weight, lower burn-up and no-critical risk, AECL developed spent fuel dry interim storage technique which was applied in many CANDU reactors. Spent fuel dry interim storage facility should be designed base on critical accident prevention, decay heat removal, radiation protection and fissionable material containment. According to this introduction, analysis spent fuel dry interim storage facility and equipment design feature, it can be concluded that spent fuel dry interim storage could be met with the design requirement. (author)

  13. Coolability of severely degraded CANDU cores. Revised

    Energy Technology Data Exchange (ETDEWEB)

    Meneley, D.A.; Blahnik, C.; Rogers, J.T.; Snell, V.G.; Nijhawan, S

    1996-01-01

    Analytical and experimental studies have shown that the separately cooled moderator in a CANDU reactor provides an effective heat sink in the event of a loss-of-coolant accident (LOCA) accompanied by total failure of the emergency core cooling system (ECCS). The moderator heat sink prevents fuel melting and maintains the integrity of the fuel channels, therefore terminating this severe accident short of severe core damage. Nevertheless, there is a probability, however low, that the moderator heat sink could fail in such an accident. The pioneering work of Rogers (1984) for such a severe accident using simplified models showed that the fuel channels would fail and a bed of dry, solid debris would be formed at the bottom of the calandria which would heat up and eventually melt. However, the molten pool of core material would be retained in the calandria vessel, cooled by the independently cooled shield-tank water, and would eventually resolidify. Thus, the calandria vessel would act inherently as a 'core-catcher' as long as the shield tank integrity is maintained. The present paper reviews subsequent work on the damage to a CANDU core under severe accident conditions and describes an empirically based mechanistic model of this process. It is shown that, for such severe accident sequences in a CANDU reactor, the end state following core disassembly consists of a porous bed of dry solid, coarse debris, irrespective of the initiating event and the core disassembly process. (author)

  14. Partial Path Column Generation for the ESPPRC

    DEFF Research Database (Denmark)

    Jepsen, Mads Kehlet; Petersen, Bjørn

    This talk introduces a decomposition of the Elementary Shortest Path Problem with Resource Constraints(ESPPRC), where the path is combined by smaller sub paths. We show computational result by comparing different approaches for the decomposition and compare the best of these with existing...

  15. Life Assurance Strategy for CANDU NPP

    International Nuclear Information System (INIS)

    Nuclear Plants have a nominal 'design life' that forms the basis of equipment specification, economic evaluations and licensing for some jurisdictions. Some component in the plant may require replacement, refurbishing and or rehabilitation during the plant 'design life'. Components which are extremely difficult or economically impossible to replace will place a limit on plant life. Rehabilitation programs completed to date on older CANDU plants to improve reliability of plant components, coupled with R and D programs, experimental data and advanced analytical methods form the basis for CANDU plant component life assurance. Life assurance is verified during plant operation by comprehensive in-service inspection programs and laboratory examinations. The paper provides an overview of the experiences to date on Refurbishment and Rehabilitation programs and some Canadian approaches on the main activities involved in scoping and managing nuclear plant life assurance. A number of proactive programs are underway to anticipate, detect and mitigate potential aging degradation at an early stage to ensure plant safety and reliability. Some of these programs include; systematic plant condition assessment, refurbishment and upgrading programs, environmental qualification programs and a program of examination of components from decommissioned reactors. These programs are part of an overall nuclear power plant maintenance strategy. Beyond life assurance, a longer term approach would be geared towards life extension as a viable option for the future. Recent CANDU designs have benefited from the early CANDU experience and are expected to require less rehabilitation. Examples of changes in CANDU 6 include fuel channel design and adopting a closed component cooling water system. New designs are based on 'design life' longer than that used for economic evaluations. The approach is to design for easy replace ability for components that can be economically replaced. Specific examples

  16. Pressure tube life management in CANDU-6 nuclear plant

    International Nuclear Information System (INIS)

    Operating parameters of pressure tube in CANDU-6 reactor, the relation between pressure tube life and plant life improvement of pressure tube by AECL in past years were summarized, and the factors affecting pressure tube life, idea and main measures of pressure tube life management in QINSHAN CANDU-6 power plant introduced

  17. The CANDU contribution to environmentally friendly energy production

    International Nuclear Information System (INIS)

    National prosperity is based on the availability of affordable, energy supply. However, this need is tempered by a complementary desire that the energy production and utilization will not have a major impact on the environment. The CANDU energy system, including a next generation of CANDU designs, is a major primary energy supply option that can be an important part of an energy mix to meet Canadian needs. CANDU nuclear power plants produce energy in the form of medium pressure steam. The advanced version of the CANDU design can be delivered in unit modules ranging from 400 to 1200 MWe. This Next Generation of CANDU designs features lower cost, coupled with robust safety margins. Normally this steam is used to drive a turbine and produce electricity. However, a fraction of this steam (large or small) may alternatively be used as process steam for industrial consumption. Options for such steam utilization include seawater desalination, oil sands extraction and heating. The electricity may be delivered to an electrical grid or alternatively used to produce quantities of hydrogen. Hydrogen is an ideal clean transportation fuel because its use only produces water. Thus, a combination of CANDU generated electricity and hydrogen distribution for vehicles is an available, cost-effective route to dramatically reduce emissions from the transportation sector. The CANDU energy system contributes to environmental protection and the prevention of climate change because of its very low emission. The CANDU energy system does not produce any NOx, SOx or greenhouse gas (notably CO2) emissions during operation. In addition, the CANDU system operates on a fully closed cycle with all wastes and emissions fully monitored, controlled and managed throughout the entire life cycle of the plant. The CANDU energy system is an environmentally friendly and flexible energy source. It can be an effective component of a total energy supply package, consistent with Canadian and global climate

  18. Multi-step approach to Code-coupling for progression induced severe accidents in CANDU NPPs (MACPISA-CANDU)

    Energy Technology Data Exchange (ETDEWEB)

    Pohl, D.J.; Luxat, J.C. [McMaster Univ., Dept. of Engineering Physics, Hamilton, Ontario (Canada); Giannotti, W.; D' Auria, F. [Univ. of Pisa, Dept. of Mechanical, Nuclear and Production Engineering, Pisa (Italy)

    2009-07-01

    This paper reviews the progression of severe accidents, describes computer codes currently employed for analysis of severe accidents and outlines a new methodology to modelling the progression of severe accidents in CANDU nuclear power plants (NPPs) called the Multi-step Approach to Code-coupling for Progression Induced Severe Accidents in CANDU NPPs (MACPISA-CANDU). The MACPISA-CANDU methodology was used to couple the U.S. NRC codes SCDAP/RELAP5 (RELAP/SCDAPSIM Mod 3.4) and MELCOR (1.8.5) in order to model a small break loss of coolant accident with loss of emergency coolant injection (SBLOCA-LOECI) under natural circulation in a CANDU 6 NPP. Using this model it was shown that the sheath temperature did not exceed the zirconium melting temperature of 2098 K and hence the progression of the severe accident was terminated as expected. (author)

  19. CANDU refurbishment - managing the life cycle

    International Nuclear Information System (INIS)

    All utilities that operate a nuclear power plant have an integrated plan for managing the condition of the plant systems, structures and components. With a sound plant life management program, after about 25 years of operation, replacement of certain reactor core components can give an additional 25 to 30 years of operation. This demonstrates the long-term economic strength of CANDU technology and justifies a long-term commitment to nuclear power. Indeed, replacement of pressure tubes and feeders with the most recent technology will also lead to increased capacity factors - due to reduced requirements for feeder inspections and repair, and eliminating the need for fuel channel spacer relocation which have caused additional and longer maintenance outages. Continuing the operation of CANDU units parallels the successful life extensions of reactors in other countries and provides the benefits of ongoing reliable operation, at an existing plant location, with the continued support of the host community. The key factors for successful, optimum management of the life cycle are: ongoing, effective plant life management programs; careful development of refurbishment scope, taking into account system condition assessments and a systematic safety review; and, a well-planned and well-executed retubing and refurbishment outage, where safety and risk management is paramount to ensure a successful project The paper will describe: the benefits of extended plant life; the outlook for refurbishment; the life management and refurbishment program; preparations for retubing of the reactor core; and, enhanced performance post-retubing. Given the potential magnitude of the program over the next 10 years, AECL will maintain a lead role providing overall support for retubing and plant Life Cycle Management programs and the CANDU Owners Group will provide a framework for collaboration among its Members. (author)

  20. Structural integrity evaluations of CANDU pressure tubes

    International Nuclear Information System (INIS)

    The core of a CANDU-6 pressurized heavy water reactor consists of some hundred horizontal pressure tubes that are manufactured from a Zr-2.5%Nb alloy and which contain the fuel bundles. These tubes are susceptible to a damaging phenomenon known as Delayed Hydride Cracking (DHC). The Zr-2.5%Nb alloy is susceptible to DHC phenomenon when there is diffusion of hydrogen atoms to a service-induced flaws, followed by the hydride platelets formation on the certain crystallographic planes in the matrix material. Finally, the development of hydride regions at the flaw-tip will happened. These hydride regions are able to fracture under stress-temperature conditions (DHC initiation) and the cracks can extend and grow by DHC mechanism. Some studies have been focused on the potential to initiate DHC at the blunt flaws in a CANDU reactor pressure tube and a methodology for structural integrity evaluation was developed. The methodology based on the Failure Assessment Diagrams (FAD's) consists in an integrated graphical plot, where the fracture failure and plastic collapse are simultaneously evaluated by means of two non-dimensional variables (Kr and Lr). These two variables represent the ratio of the applied value of either stress or stress intensity factor and the resistance parameter of corresponding magnitude (yield stress or fracture toughness, respectively). Once the plotting plane is determined by the variables Kr and Lr, the procedure defines a critical failure line that establishes the safe area. The paper will demonstrate the possibility to perform structural integrity evaluations by means of Failure Assessment Diagrams for flaws occurring in CANDU pressure tubes. (author)

  1. Proof testing of CANDU concrete containment structures

    International Nuclear Information System (INIS)

    Prior to commissioning of a CANDU reactor, a proof pressure test is required to demonstrate the structural integrity of the containment envelope. The test pressure specified by AECB Regulatory Document R-7 (1991) was selected without a rigorous consideration of uncertainties associated with estimates of accident pressure and conatinment resistance. This study was undertaken to develop a reliability-based philosophy for defining proof testing requirements that are consistent with the current limit states design code for concrete containments (CSA N287.3).It was shown that the upodated probability of failure after a successful test is always less than the original estimate

  2. Configuration management for CANDU feeder refurbishment

    International Nuclear Information System (INIS)

    The Canada Deuterium Uranium Reactor CANDU was originally designed to last twenty-five years. In 2005, Atomic Energy of Canada (AECL) made the decision to extend the life of the reactor by thirty years. One of the most critical elements of the life extension project was determining how to refurbish the Primary Heat Transport System. It was determined that the refurbishment required replacing the entire length of inlet and outlet feeders, from the end fittings to the header. The use of a robust Configuration Management program would have added significant value to the life extension project. (author)

  3. Development of the advanced CANDU technology

    Energy Technology Data Exchange (ETDEWEB)

    Suk, Soo Dong; Min, Byung Joo [Korea Atomic Energy Research Institute, Taejon (Korea, Republic of); Na, Y. H.; Lee, S. Y.; Choi, J. H.; Lee, B. C.; Kim, S. N.; Jo, C. H.; Paik, J. S.; On, M. R.; Park, H. S.; Kim, S. R. [Korea Electric Power Co., Taejon (Korea, Republic of)

    1997-07-01

    The purpose of this study is to develop the advanced design technology to improve safety, operability and economy and to develop and advanced safety evaluation system. More realistic and reasonable methodology and modeling was employed to improve safety margin in containment analysis. Various efforts have been made to verify the CATHENA code which is the major safety analysis code for CANDU PHWR system. Fully computerized prototype ECCS was developed. The feasibility study and conceptual design of the distributed digital control system have been performed as well. The core characteristics of advanced fuel cycle, fuel management and power upgrade have been studied to determine the advanced core. (author). 77 refs., 51 tabs., 108 figs.

  4. A generalized perturbation program for CANDU reactor

    Energy Technology Data Exchange (ETDEWEB)

    Kim, Do Heon; Kim, Jong Kyung [Hanyang University, Seoul (Korea, Republic of); Choi, Hang Bok; Roh, Gyu Hong [Korea Atomic Energy Research Institute, Taejon (Korea, Republic of); Yang, Won Sik [Chosun University, Kwangju (Korea, Republic of)

    1998-12-31

    A generalized perturbation program has been developed for the purpose of estimating zonal power variation of a CANDU reactor upon refueling operation. The forward and adjoint calculation modules of RFSP code were used to construct the generalized perturbation program. The numerical algorithm for the generalized adjoint flux calculation was verified by comparing the zone power estimates upon refueling with those of forward calculation. It was, however, noticed that the truncation error from the iteration process of the generalized adjoint flux is not negligible. 2 refs., 1 figs., 1 tab. (Author)

  5. Simulation-based reactor control design methodology for CANDU 9

    Energy Technology Data Exchange (ETDEWEB)

    Kattan, M.K.; MacBeth, M.J. [Atomic Energy of Canada Limited, Saskatoon, Saskatchewan (Canada); Chan, W.F.; Lam, K.Y. [Cassiopeia Technologies Inc., Toronto, Ontario (Canada)

    1996-07-01

    The next generation of CANDU nuclear power plant being designed by AECL is the 900 MWe CANDU 9 station. This design is based upon the Darlington CANDU nuclear power plant located in Ontario which is among the world leading nuclear power stations for highest capacity factor with the lowest operation, maintenance and administration costs in North America. Canadian-designed CANDU pressurized heavy water nuclear reactors have traditionally been world leaders in electrical power generation capacity performance. This paper introduces the CANDU 9 design initiative to use plant simulation during the design stage of the plant distributed control system (DCS), plant display system (PDS) and the control centre panels. This paper also introduces some details of the CANDU 9 DCS reactor regulating system (RRS) control application, a typical DCS partition configuration, and the interfacing of some of the software design processes that are being followed from conceptual design to final integrated design validation. A description is given of the reactor model developed specifically for use in the simulator. The CANDU 9 reactor model is a synthesis of 14 micro point-kinetic reactor models to facilitate 14 liquid zone controllers for bulk power error control, as well as zone flux tilt control. (author)

  6. Trends in the capital costs of CANDU generating stations

    International Nuclear Information System (INIS)

    This paper consolidates the actual cost experience gained by Atomic Energy of Canada Limited, Ontario Hydro, and other Canadian electric utlities in the planning, design and construction of CANDU-PHWR (CANada Deuterium Uranium-Pressurized Heavy Water Reactor) generating stations over the past 30 years. For each of the major CANDU-PHWR generating stations in operation and under construction in Canada, an analysis is made to trace the evolution of the capital cost estimates. Major technical, economic and other parameters that affect the cost trends of CANDU-PHWR generating stations are identified and their impacts assessed. An analysis of the real cost of CANDU generating stations is made by eliminating interest during construction and escalation, and the effects of planned deferment of in-service dates. An historical trend in the increase in the real cost of CANDU power plants is established. Based on the cost experience gained in the design and construction of CANDU-PHWR units in Canada, as well as on the assessment of parameters that influence the costs of such projects, the future costs of CANDU-PHWRs are presented

  7. The Candu suppliers: Growing beyond Canada

    International Nuclear Information System (INIS)

    Canada has demonstrated its ability to successfully manage Candu projects. It has been shown domestically by Ontario Hydro over a period of many years. It has been demonstrated abroad by private sector service companies, under Nuclear Construction Managers, on the 600 MW Wolsung project in South Korea, where NPM companies carried out virtually all project and construction management, the plant was in service only 60 months after the first concrete was poured for the reactor building. In the past, however, the project management team for Candu nuclear plants overseas, and for some at home, was often assembled ad hoc. Though this approach can be successful, it does not guarantee success in project and construction management. Because of the size, diversity and flexibility of the private owners of NPM, they have been able to keep their experienced nuclear power teams on staff even though the nuclear power industry has been going through slow times, assigning these people to large projects in other industries that call for the same high level of project, construction and commissioning management skills. Yet they are in a position to reassemble this team at very short notice, and have them ready to go to work on a major project within weeks of the green light

  8. Development of advanced CANDU PHWR -Development of the advanced CANDU technology-

    International Nuclear Information System (INIS)

    The target of this project is to assess the feasibility of improving PHWR and to establish the parameter of the improved concept and requirements for developing it. To set up the requirements for the Improved Pressurized Heavy Water Reactor: (1) Design requirements of PHWR main systems and Safety Design Regulatory Requirements for Safety Related System i.e. Reactor Shutdown System, Emergency Core Cooling System and Containment System were prepared. (2) Licensing Basis Documents were summarized and Safety Analysis Regulatory. Requirements were reviewed and analyzed. To estimate the feasibility of improving PHWR and to establish the main parameters of the concept of new PHWR in future: (1) technical level/developing trend of PHWR in Korea through Wolsong 2, 3 and 4 design experience and Technical Transfer Program was investigated to analyze the state of basic technology and PHWR improvement potential. (2) CANDU 6 design improvement tendency, CANDU 3 design concept and CANDU 9 development state in other country was analyzed. (3) design improvement items to apply to the reactors after Wolsong 2, 3 and 4 were selected and Plant Design Requirements and Conceptual Design Description were prepared and the viability of improved HWR was estimated by analyzing economics, performance and safety. (4) PHWR technology improving research and development plan was established and international joint study initiated for main design improvement items

  9. General overview of CANDU advanced fuel cycles program

    International Nuclear Information System (INIS)

    The R and D program for CANDU advanced fuel cycles may be roughly divided into two components which have a near-and long-term focus, respectively. The near-term focus is on the technology to implement improved once-through cycles and mixed oxide (plutonium-uranium oxides) recycle in CANDU and on technologies to separate zirconium isotopes. Included is work on those technologies which would allow a CANDU-LWR strategy to be developed in a growing nuclear power system. For the longer-term, activities are focused on those technologies and fuel cycles which would be appropriate in a period when nuclear fuel demand significantly exceeds mined uranium supplies. Fuel cycles and systems under study are thorium recycle, CANDU fast breeder systems and electro-nuclear fissile breeders. The paper will discuss the rationale underlying these activities, together with a brief description of activities currently under way in each of the fuel cycle technology areas

  10. Proceedings of the Canadian Nuclear Society CANDU maintenance conference

    International Nuclear Information System (INIS)

    The conference proceedings comprise 51 papers on the following aspects of maintenance of CANDU reactors: Major maintenance projects, maintenance planning and preparation, maintenance effectiveness, future maintenance issues, safety and radiation protection. The individual papers have been abstracted separately

  11. Korea signs for 2nd CANDU at Wolsong

    International Nuclear Information System (INIS)

    The sale of a second CANDU 6 reactor to Korea for the Wolsong site is discussed in relation to nuclear power in Korea, the Korean economy generally, Canadian trade with Korea, and cooperation between AECL and KAERI

  12. Key thrusts in next generation CANDU. Annex 10

    International Nuclear Information System (INIS)

    Current electricity markets and the competitiveness of other generation options such as CCGT have influenced the directions of future nuclear generation. The next generation CANDU has used its key characteristics as the basis to leap frog into a new design featuring improved economics, enhanced passive safety, enhanced operability and demonstrated fuel cycle flexibility. Many enabling technologies spinning of current CANDU design features are used in the next generation design. Some of these technologies have been developed in support of existing plants and near term designs while others will need to be developed and tested. This paper will discuss the key principles driving the next generation CANDU design and the fuel cycle flexibility of the CANDU system which provide synergism with the PWR fuel cycle. (author)

  13. Periodic inspection of CANDU nuclear power plant containment components

    International Nuclear Information System (INIS)

    This Standard is one in a series intended to provide uniform requirements for CANDU nuclear power plants. It provides requirements for the periodic inspection of containment components including the containment pressure suppression systems

  14. Thermal-hydraulic interfacing code modules for CANDU reactors

    Energy Technology Data Exchange (ETDEWEB)

    Liu, W.S.; Gold, M.; Sills, H. [Ontario Hydro Nuclear, Toronto (Canada)] [and others

    1997-07-01

    The approach for CANDU reactor safety analysis in Ontario Hydro Nuclear (OHN) and Atomic Energy of Canada Limited (AECL) is presented. Reflecting the unique characteristics of CANDU reactors, the procedure of coupling the thermal-hydraulics, reactor physics and fuel channel/element codes in the safety analysis is described. The experience generated in the Canadian nuclear industry may be useful to other types of reactors in the areas of reactor safety analysis.

  15. Proceedings of the international conference on CANDU fuel

    International Nuclear Information System (INIS)

    These proceedings contain full texts of all paper presented at the first International Conference on CANDU Fuel. The Conference was organized and hosted by the Chalk River Branch of the Canadian Nuclear Society and utilized Atomic Energy of Canada Limited's facilities at Chalk River Nuclear Laboratories. Previously, informal Fuel Information Meetings were used in Canada to allow the exchange of information and technology associated with CANDU. The Chalk River conference was the first open international forum devoted solely to CANDU and included representatives of overseas countries with current or potential CANDU programs, as well as Canadian participants. The keynote presentation was given by Dr. J.B. Slater, who noted the correlation between past successes in CANDU fuel cycle technology and the co-operation between researchers, fabricators and reactor owner/operators in all phases of the fuel cycle, and outlined the challenges facing the industry today. In the banquet address, Dr. R.E. Green described the newly restructured AECL Research Company and its mission which blends traditional R and D with commercial initiatives. Since this forum for fuel technology has proven to be valuable, a second International CANDU Fuel Conference is planned for the fall of 1989, again sponsored by the Canadian Nuclear Society

  16. Conceptual Study on Dismantling of CANDU Nuclear Reactor

    Energy Technology Data Exchange (ETDEWEB)

    Jeong, Woo-Tae; Lee, Sang-Guk [KHNP-CRI, Daejeon (Korea, Republic of)

    2014-10-15

    In this paper, we reviewed 3D design model of the CANDU type reactor and suggested feasible cutting scheme. The structure of CANDU nuclear reactor, the calandria assembly was reviewed using 3-D CAD model for future decommissioning. Through the schematic diagram of CANDU nuclear power plant, we identified the differences between PWR and CANDU reactor assembly. Method of dismantling the fuel channels from the calandria assembly was suggested. Custom made cutter is recommended to cut all the fuel channels. The calandria vessel is recommended to be cut by band saw or plasma torch. After removal of the fuel channels, it was assumed that radiation level near the calandria vessel is not very high. For cutting of the end shields, various methods such as band saw, plasma torch, CAMC could be used. The choice of a specific method is largely dependent on radiological environment. Finally, method of cutting the embedment rings is considered. As we assume that operators could cut the rings without much radiation exposure, various industrial cutting methods are suggested to be applied. From the above reviews, we could conclude that decommissioning of CANDU reactor is relatively easy compared to that of PWR reactor. Technologies developed from PWR reactor decommissioning could be applied to CANDU reactor dismantling.

  17. Leak detection capability in CANDU reactors

    Energy Technology Data Exchange (ETDEWEB)

    Azer, N.; Barber, D.H.; Boucher, P.J. [and others

    1997-04-01

    This paper addresses the moisture leak detection capability of Ontario Hydro CANDU reactors which has been demonstrated by performing tests on the reactor. The tests confirmed the response of the annulus gas system (AGS) to the presence of moisture injected to simulate a pressure tube leak and also confirmed the dew point response assumed in leak before break assessments. The tests were performed on Bruce A Unit 4 by injecting known and controlled rates of heavy water vapor. To avoid condensation during test conditions, the amount of moisture which could be injected was small (2-3.5 g/hr). The test response demonstrated that the AGS is capable of detecting and annunciating small leaks. Thus confidence is provided that it would alarm for a growing pressure tube leak where the leak rate is expected to increase to kg/hr rapidly. The measured dew point response was close to that predicted by analysis.

  18. Inspection of Candu Nuclear Reactor Fuel Channels

    International Nuclear Information System (INIS)

    The Channel Inspection and Gauging Apparatus of Reactors (CIGAR) is a fully atomated, remotely operated inspection system designed to perform multi-channel, multi-task inspection of CANDU reactor fuel channels. Ultrasonic techniques are used for flaw detection, (with a sensitivity capable of detecting a 0.075 mm deep notch with a signal to noise ratio of 10 dB) and pressure tube wall thickness and diameter measurements. Eddy currrent systems are used to detect the presence of spacers between the coaxial pressure tube and calandria tube, as well as to measure their relative spacing. A servo-accelerometer is used to estimate the sag of the fuel channels. This advanced inspection system was commissioned and declared in service in September 1985. The paper describes the inspection systems themselves and discussed the results achieved to-date. (author)

  19. CANDU energy for steam assisted gravity drainage

    International Nuclear Information System (INIS)

    Traditional open-pit mining has been used by industry for many years to remove oil sands from shallow deposits. To increase production capacity, the industry is looking for new technology to exploit bitumen from deep deposits. Among them, SAGD (Steam-Assisted Gravity Drainage) appears to be the most promising approach. It uses steam to remove bitumen from underground reservoirs. Recently, the SAGD recovery process has been put into commercial operation by major oil companies.Atomic Energy Canada Limited has assessed the use of the ACR-1000 as a source of heat and electricity for oil sand extraction and processing. The ACR-1000 design is an evolutionary development of the familiar CANDU technology, adding innovations to enhance economics, operations, and safety margins. The net electrical output from a standard ACR-1000 will be close to 1100 MWe, depending on local cooling water temperature

  20. Ballooning of CANDU pressure tubes. Model assessment

    International Nuclear Information System (INIS)

    The transient creep equations used to analyze the possible ballooning and failure of Zr-2.5% Nb pressure tubes during a loss-of-coolant accident (LOCA) were developed and verified using as-received Zr-2.5% Nb pressure tube material. But in a CANDU reactor, the pressure tubes absorb deuterium and are exposed to a continuous neutron fluence. Consequently, a literature survey was done to determine how irradiation damage and deuterium might affect the creep rate and ductility of Zr-2.5% Nb pressure tubes in the temperature range from 600 to 800 degrees C. It was found that irradiation damage, dissolved deuterium and deuteride blisters could possibly affect the creep rate and ductility of ZR-2.5% Nb pressure tubes in this temperature range, but deuteride platelets are expected to have little effect. Further tests are required to determine the effect of irradiation damage and deuterium on the creep rate and ductility of pressure tubes

  1. SLARette operations at CANDU 6 stations

    International Nuclear Information System (INIS)

    The Objective of the SLARette system as an ongoing maintenance device was to design a system which could be installed in reactor, commissioned and operational in less than 48 hours and removed in less than 24 hours, thus allowing a selected number of fuel channels to be SLARed during the normal yearly maintenance outage. This required a relatively simple design that does not require any changes to the Station Fuel Handling Systems and is portable, reliable and easily maintained. Over the last 10 years virtually every part of the SLARette system has been enhanced to further reduce man-hour and man-rem expenditure and it has now been used successfully on four CANDU 6 stations and many fuel channels. (author)

  2. Leak detection capability in CANDU reactors

    International Nuclear Information System (INIS)

    This paper addresses the moisture leak detection capability of Ontario Hydro CANDU reactors which has been demonstrated by performing tests on the reactor. The tests confirmed the response of the annulus gas system (AGS) to the presence of moisture injected to simulate a pressure tube leak and also confirmed the dew point response assumed in leak before break assessments. The tests were performed on Bruce A Unit 4 by injecting known and controlled rates of heavy water vapor. To avoid condensation during test conditions, the amount of moisture which could be injected was small (2-3.5 g/hr). The test response demonstrated that the AGS is capable of detecting and annunciating small leaks. Thus confidence is provided that it would alarm for a growing pressure tube leak where the leak rate is expected to increase to kg/hr rapidly. The measured dew point response was close to that predicted by analysis

  3. Cost and schedule reduction for next-generation Candu

    International Nuclear Information System (INIS)

    AECL has developed a suite of technologies for CanduR reactors that enable the next step in the evolution of the Candu family of heavy-water-moderated fuel-channel reactors. These technologies have been combined in the design for the Advanced Candu Reactor TM1 (ACRTM), AECL's next generation Candu power plant. The ACR design builds extensively on the existing Candu experience base, but includes innovations, in design and in delivery technology, that provide very substantial reductions in capital cost and in project schedules. In this paper, main features of next generation design and delivery are summarized, to provide the background basis for the cost and schedule reductions that have been achieved. In particular the paper outlines the impact of the innovative design steps for ACR: - Selection of slightly enriched fuel bundle design; - Use of light water coolant in place of traditional Candu heavy water coolant; - Compact core design with unique reactor physics benefits; - Optimized coolant and turbine system conditions. In addition to the direct cost benefits arising from efficiency improvement, and from the reduction in heavy water, the next generation Candu configuration results in numerous additional indirect cost benefits, including: - Reduction in number and complexity of reactivity mechanisms; - Reduction in number of heavy water auxiliary systems; - Simplification in heat transport and its support systems; - Simplified human-machine interface. The paper also describes the ACR approach to design for constructability. The application of module assembly and open-top construction techniques, based on Candu and other worldwide experience, has been proven to generate savings in both schedule durations and overall project cost, by reducing premium on-site activities, and by improving efficiency of system and subsystem assembly. AECL's up-to-date experience in the use of 3-D CADDS and related engineering tools has also been proven to reduce both engineering and

  4. Evolution of the CANDU ICS-90+ control room design

    International Nuclear Information System (INIS)

    The design of the CANDU Control Room and the associated design process has evolved considerably over several generations of plants, from the first commercial scale demonstration CANDU at Douglas Point through to the large scale CANDUs at Darlington, and beyond, for the next generation of CANDU plant, ICS-90+, represented by new designs like CANDU 3. In the early plants, the control room configuration was based on designers' projections of control interface requirements. With succeeding generations, of designs, there has been an evolution towards: increasing attention to formal requirements definition, incorporation into the Human Machine Interface (HMI) of a larger base of operational experience, more systematic consideration of Human Factors (HF) aspects of the design and the application of a more powerful computer based HMI. For the newest plant, the CANDU 3, a Human Factors Engineering Program Plan (HFEPP) defines the overall HF engineering process, the associated requirements and HF engineering standards to be followed in each stage, and for all HMI aspects of the control room and plant design. The CANDU 3 control room also incorporates several new design innovations that will facilitate operating crew performance improvements. These are based on past experience with operating CANDU plants, incorporated with the use of formal design and validation methods plus results from Canadian research program to support control centre design and operation. For example, there are design improvements to facilitate: operator tracking of plant state, problem solving, alarm filtering, annunciation system interrogation, special safety system testing features, etc. The present paper will expand and elaborate on each of the above topics. (author). 7 refs, 2 figs, 1 tab

  5. AN OPTIMUM VEHICULAR PATH ALGORITHM FOR TRAFFIC NETWORK BASED ON HIERARCHICAL SPATIAL REASONING

    Institute of Scientific and Technical Information of China (English)

    2000-01-01

    Human beings' intellection is the characteristic of a distinct hierarchy and can be taken to construct a heuristic in the shortest path algorithms.It is detailed in this paper how to utilize the hierarchical reasoning on the basis of greedy and directional strategy to establish a spatial heuristic,so as to improve running efficiency and suitability of shortest path algorithm for traffic network.The authors divide urban traffic network into three hierarchies and set forward a new node hierarchy division rule to avoid the unreliable solution of shortest path.It is argued that the shortest path,no matter distance shortest or time shortest,is usually not the favorite of drivers in practice.Some factors difficult to expect or quantify influence the drivers' choice greatly.It makes the drivers prefer choosing a less shortest,but more reliable or flexible path to travel on.The presented optimum path algorithm,in addition to the improvement of the running efficiency of shortest path algorithms up to several times,reduces the emergence of those factors,conforms to the intellection characteristic of human beings,and is more easily accepted by drivers.Moreover,it does not require the completeness of networks in the lowest hierarchy and the applicability and fault tolerance of the algorithm have improved.The experiment result shows the advantages of the presented algorithm.The authors argued that the algorithm has great potential application for navigation systems of large-scale traffic networks.

  6. Value added services to CANDU plants

    International Nuclear Information System (INIS)

    Over the last decade or so, nuclear power plants, just like other types of electricity generating plants, have been facing a number of challenges. Depending on the operating environment of the utility, these challenges are forcing plant owners to examine all facets of the operating costs. Privatization, deregulation and economics of alternative electricity generation methods are exerting enormous pressure on nuclear power plants to streamline costs and improve their operational performance. CANDU reactors are no exception to these forces and face similar pressures. In particular, operating plants that are contemplating plant life extensions are being required to clearly demonstrate the economics of continued operation over other forms of power generation available to the utility. Improvement of capacity factors has the effect of increasing the revenues from the plant and as these revenues increase, the fixed portion of the plant costs including OM and A costs become a smaller percentage of the total revenues. Similar results can be achieved by aiming to reduce the plant OM and A costs. In reality, most well-planned intervention schemes directed at reducing OM and A costs tend to also increase the plant availability. Following plant turnover after commissioning, AECL has been supporting the CANDU owners and utilities with an assortment of products and services dealing with plant operations and outage management issues. AECL has taken the lead in arranging specialized resources, products and services by teaming with other complementary organizations to provide a complete suite of services. Recent examples of such support to operating CANDU plants will be described in the paper. AECL is responding to this changing business environment in two important ways. First, AECL is changing from simply providing a service to its clients towards providing value, something much more important. To this end, AECL is looking to other organizations to form alliances, partnerships and

  7. Basic research and industrialization of CANDU advanced fuel

    International Nuclear Information System (INIS)

    Wolsong Unit 1 as the first heavy water reactor in Korea has been in service for 17 years since 1983. It would be about the time to prepare a plan for the solution of problems due to aging of the reactor. The aging of CANDU reactor could lead especially to the steam generator cruding and pressure tube sagging and creep and then decreases the operation margin to make some problems on reactor operations and safety. The counterplan could be made in two ways. One is to repair or modify reactor itself. The other is to develop new advanced fuel to increase of CANDU operation margin effectively, so as to compensate the reduced operation margin. Therefore, the first objectives in the present R and D is to develop the CANFLEX-NU (CANDU Flexible fuelling-Natural Uranium) fuel as a CANDU advanced fuel. The second objectives is to develop CANDU advanced fuel bundle to utilize advanced fuel cycles such as recovered uranium, slightly enriched uranium, etc. and so to raise adaptability for change in situation of uranium market. Also, it is to develop CANDU advanced fuel technology which improve uranium utilization to cope with a world-wide imbalance between uranium supply and demand, without significant modification of nuclear reactor design and refuelling strategies. As the implementations to achieve the above R and D goal, the work contents and scope of technology development of CANDU advanced fuel using natural uranium (CANFLEX-NU) are the fuel element/bundle designs, the nuclear design and fuel management analysis, the thermalhydraulic analysis, the safety analysis, fuel fabrication technologies, the out-pile thermalhydraulic test and in-pile irradiation tests performed. At the next, the work scopes and contents of feasibility study of CANDU advanced fuel using recycled uranium (CANFLEX-RU) are the fuel element/bundle designs, the reactor physics analysis, the thermalhydraulic analysis, the basic safety analysis of a CANDU-6 reactor with CANFLEX-RU fuel, the fabrication and

  8. Basic research and industrialization of CANDU advanced fuel

    Energy Technology Data Exchange (ETDEWEB)

    Chun, Suk Ho; Park, Joo Hwan; Jun, Ji Su [and others

    2000-04-01

    Wolsong Unit 1 as the first heavy water reactor in Korea has been in service for 17 years since 1983. It would be about the time to prepare a plan for the solution of problems due to aging of the reactor. The aging of CANDU reactor could lead especially to the steam generator cruding and pressure tube sagging and creep and then decreases the operation margin to make some problems on reactor operations and safety. The counterplan could be made in two ways. One is to repair or modify reactor itself. The other is to develop new advanced fuel to increase of CANDU operation margin effectively, so as to compensate the reduced operation margin. Therefore, the first objectives in the present R and D is to develop the CANFLEX-NU (CANDU Flexible fuelling-Natural Uranium) fuel as a CANDU advanced fuel. The second objectives is to develop CANDU advanced fuel bundle to utilize advanced fuel cycles such as recovered uranium, slightly enriched uranium, etc. and so to raise adaptability for change in situation of uranium market. Also, it is to develop CANDU advanced fuel technology which improve uranium utilization to cope with a world-wide imbalance between uranium supply and demand, without significant modification of nuclear reactor design and refuelling strategies. As the implementations to achieve the above R and D goal, the work contents and scope of technology development of CANDU advanced fuel using natural uranium (CANFLEX-NU) are the fuel element/bundle designs, the nuclear design and fuel management analysis, the thermalhydraulic analysis, the safety analysis, fuel fabrication technologies, the out-pile thermalhydraulic test and in-pile irradiation tests performed. At the next, the work scopes and contents of feasibility study of CANDU advanced fuel using recycled uranium (CANFLEX-RU) are the fuel element/bundle designs, the reactor physics analysis, the thermalhydraulic analysis, the basic safety analysis of a CANDU-6 reactor with CANFLEX-RU fuel, the fabrication and

  9. Operational improvements in the CANDU 9 control centre

    International Nuclear Information System (INIS)

    AECL has adopted an evolutionary approach to the design of the CANDU 9 control centre. Several factors have contributed to this decision including the desire to build on the successes of the current generation of CANDU stations, the changing roles and responsibilities of operations staff, an improved understanding of human error in operational situations, the opportunity for improved plant performance through the introduction of new technologies, and evolving customer and regulatory requirements. Underlying this approach is a refined engineering design process that cost-effectively integrates operational feedback and human factors engineering to define the operating staff information and information presentation requirements. Based on this approach, the CANDU 9 control centre will provide utility operating staff with a layout and information organization that is better matched to operational tasks, thereby leading to reduced operations, maintenance and administration (OM and A) costs. Significant design features that contribute to the improved operational capabilities of the CANDU 9 control centre include: a control centre layout with improved functionality; a new Plant Display System that is separated from the digital control computer system; and an enhanced computerized reactor shutdown system. The paper will present a summary of the design process, a detailed description of the CANDU 9 control centre layout and features, a description of the plant control and display systems design, including findings from a regulatory review, and other improvements to enhance operability. (author)

  10. Hydrogen analysis using MELCOR at CANDU plant

    Energy Technology Data Exchange (ETDEWEB)

    Song, Sung Chu; Park, Jae Hong; Kim, Han Chul [Korea Institute of Nuclear Safety, Daejeon (Korea, Republic of)

    2011-10-15

    As a part of a submitted Wolsong Severe Accident Management Plan(SAMP) at the end of 2009, KINS needs to the review of it. In this the focus is on the hydrogen behavior during the station blackout(SBO) because the hydrogen explosion during severe accident in CANDU plants such as Wolsong units has been safety issue. A SBO occurs with failure of the emergency power system when loss of class IV electric power happens because the loss of class IV power is the most dominant internal event causing core damage for Wolsong units. And following a SBO event, most of the engineered safety features(ESFs), including hydrogen igniters, are inoperable except the passive systems such as Dousing systems. Hydrogen is generated due to Zr-steam reaction in fuel channels and core debris oxidation in the suspended debris beds, jet breakup of molten debris in the water pool of the reactor vault and molten core-concrete interaction (MCCI). A combustible gas control system consisting of Passive Autocatalytic Recombiner(PAR) is currently installed at Wolsong unit 1. The results of MELCOR analysis are presented

  11. Industrial process heat from CANDU reactors

    International Nuclear Information System (INIS)

    It has been demonstrated on a large scale that CANDU reactors can produce industrial process steam as well as electricity, reliably and economically. The advantages of cogeneration have led to the concept of an Industrial Energy Park adjacent to the Bruce Nuclear Power Development in the province of Ontario. For steam demands between 300,000 and 500,00 lb/h (38-63 kg/s) and an annual load factor of 80%, the estimated cost of nuclear steam at the Bruce site boundary is $3.21/MBtu ($3.04GJ), which is at least 30% cheaper than oil-fired steam at the same site. The most promising near term application of nuclear heat is likely to be found within the energy-intensive chemical industry. Nuclear energy can substitute for imported oil and coal in the eastern provinces if the price remains competitive, but low cost coal and gas in the western provinces may induce energy-intensive industries to locate near those sources of energy. In the long term it may be feasible to use nuclear heat for the mining and extraction of oil from the Alberta tar sands. (auth)

  12. Ninth international conference on CANDU fuel, 'fuelling a clean future'

    International Nuclear Information System (INIS)

    The Canadian Nuclear Society's 9th International Conference on CANDU fuel took place in Belleville, Ontario on September 18-21, 2005. The theme for this year's conference was 'Fuelling a Clean Future' bringing together over 80 delegates ranging from: designers, engineers, manufacturers, researchers, modellers, safety specialists and managers to share the wealth of their knowledge and experience. This international event took place at an important turning point of the CANDU technology when new fuel design is being developed for commercial application, the Advanced CANDU Reactor is being considered for projects and nuclear power is enjoying a renaissance as the source energy for our future. Most of the conference was devoted to the presentation of technical papers in four parallel sessions. The topics of these sessions were: Design and Development; Fuel Safety; Fuel Modelling; Fuel Performance; Fuel Manufacturing; Fuel Management; Thermalhydraulics; and, Spent Fuel Management and Criticalty

  13. Evolution of the CANDU control centre retrofit and new stations

    International Nuclear Information System (INIS)

    Significant event data from operating nuclear plants in many countries consistently indicates human errors are the root cause for 40-60% of operating station significant events. Because so much information is already in digital form, opportunities exist to improve the CANDU control centre with retrofits that exploit this information. These opportunities are enhanced because of rapid technological development in computers and electronics, coupled with significant progress in the behavioural sciences that greatly increases our knowledge of the cognitive strengths and weaknesses of human beings. CANDU control rooms are undergoing retrofits and for future CANDU stations, a new concept of the control centre is emerging. The objective is to significantly reduce the incidence of human error, reduce operations and maintenance costs and improve both reliability and safety

  14. Distinctive safety aspects of the CANDU-PHW reactor design

    International Nuclear Information System (INIS)

    Two lectures are presented in this report. They were prepared in response to a request from IAEA to provide information on the 'Special characteristics of the safety analysis of heavy water reactors' to delegates from member states attending the Interregional Training Course on Safety Analysis Review, held at Karlsruhe, November 19 to December 20, 1979. The CANDU-PHW reactor is used as a model for discussion. The first lecture describes the distinctive features of the CANDU reactor and how they impact on reactor safety. In the second lecture the Canadian safety philosophy, the safety design objective, and other selected topics on reactor safety analysis are discussed. The material in this report was selected with a view to assisting those not familiar with the CANDU heavy water reactor design in evaluating the distinctive safety aspects of these reactors. (auth)

  15. Advancing CANDU experience to the world steam generator market

    International Nuclear Information System (INIS)

    Tube degradation in certain recirculating nuclear steam generators has provided a market for steam generator replacement. Prior to this need, B and W supplied over 200 steam generators for CANDU nuclear plants. With this experience, and implementing extensive research and development improvements in material selection, design enhancements, and new manufacturing and analytical methods, B and W has supplied or secured orders for the replacement of 26 steam generators. Along with plans for new replacement orders, B and W will continue to supply steam generators for future CANDU plants. This paper will review the progression of B and W's CANDU experience to meet the replacement steam generator market, and examine the continuous improvements required for today's increasingly demanding nuclear specifications. (author). 1 tab., 4 figs

  16. Reactor Physics Analysis Models for a CANDU Reactor

    Energy Technology Data Exchange (ETDEWEB)

    Choi, Hang Bok

    2007-10-15

    Canada deuterium uranium (CANDU) reactor physics analysis is typically performed in three steps. At first, macroscopic cross-sections of the reference lattice is produced by modeling the reference fuel channel. Secondly macroscopic cross-sections of reactivity devices in the reactor are generated. The macroscopic cross-sections of a reactivity device are calculated as incremental cross-sections by subtracting macroscopic cross-sections of a three-dimensional lattice without reactivity device from those of a three-dimensional lattice with a reactivity device. Using the macroscopic cross-sections of the reference lattice and incremental cross-sections of the reactivity devices, reactor physics calculations are performed. This report summarizes input data of typical CANDU reactor physics codes, which can be utilized for the future CANDU reactor physics analysis.

  17. Conference proceedings of the 4. international conference on CANDU fuel. V. 1,2

    International Nuclear Information System (INIS)

    These proceedings contain the full texts of all 65 papers presented at the 4th International Conference on CANDU fuel. As such, they represent an update on the state-of-the-art in such important CANDU fuel topics as International Development Programs and Operating Experience with CANDU fuel, Performance Assessments and Fuel Behavior Modeling, Fuel Properties, Licensing and Accident Analyses for CANDU fuel, Design, Testing and Manufacturing, and Advanced Fuel Designs. The large number of papers required the use of parallel sessions for the first time at a CANDU Fuel Conference

  18. Future generations of CANDU: advantages and development with passive safety

    International Nuclear Information System (INIS)

    Atomic Energy of Canada Limited (AECL) advances water reactor and CANDLT technology using an evolutionary development strategy. This strategy ensures that innovations are based firmly on current experience and keeps our development programs focused on one reactor concept, reducing risks, development costs, and product development cycle times. It also assures our customers that our products will never become obsolete or unsupported, and the continuous line of water reactor development is secure and supported into the future. Using the channel reactor advantage of modularity, the subdivided core has the advantage of passive safety by heat removal to the low- pressure moderator. With continuous improvements, the Advanced CANDU Reactor TM (ACR-1000TM) concept will likely remain highly competitive for a number of years and leads naturally to the next phase of CANDU development, namely the Generation IV CANDU -SCWR concept. This is conventional water technology, since supercritical boilers and turbines have been operating for some time in coal-fired power plants. Significant cost, safety, and performance advantages would result from the CANDU-SCWR concept, plus the flexibility of a range of plant sizes suitable for both small and large electric grids, and the ability for co-generation of electric power, process heat, and hydrogen. In CANDU-SCWR, novel developments are included in the primary circuit layout and channel design. The R and D in Canada is integrated with the Generation IV international Forum (GIF) plans, and has started on examining replaceable insulating liners that would ensure channel life, and on providing completely passive reactor decay heat removal directly to the moderator heat sink without forced cooling. In the interests of sustainability, hydrogen production by a CANDU- SCWR is also be included as part of the system requirements, where the methods for hydrogen production will depend on the outlet temperature of the reactor

  19. CANDU steam generator life management: laboratory data and plant experience

    International Nuclear Information System (INIS)

    As CANDU reactors enter middle age, and the potential value of the plants in a deregulated market is realized, life management and life extension issues become increasingly important. An accurate assessment of critical components, such as the CANDU 6 steam generators (SGs), is crucial for successful life extension, and in this context, material issues are a key factor. For example, service experience with Alloy 900 tubing indicates very low levels of degradation within CANDU SGs; the same is also noted worldwide. With little field data for extrapolation, life management and life extension decisions for the tube bundles rely heavily on laboratory data. Similarly, other components of the SGs, in particular the secondary side internals, have only limited inspection data upon which to base a condition assessment. However, in this case there are also relatively little laboratory data. Decisions on life management and life extension are further complicated--not only is inspection access often restricted, but repair or replacement options for internal components are, by definition, also limited. The application of CANDU SG life management and life extension requires a judicious blend of in-service data, laboratory research and development (R and D) and materials and engineering judgment. For instance, the available laboratory corrosion and fretting wear data for Alloy 800 SG tubing have been compared with plant experience (with all types of tubing), and with crevice chemistry simulations, in order to provide an appropriate inspection guide for a 50-year SG life. A similar approach has been taken with other SG components, where the emphasis has been on known degradation mechanisms worldwide. This paper provides an outline of the CANDU SG life management program, including the results to date, a summary of the supporting R and D program showing the integration with condition assessment and life management activities, and the approach taken to life extension for a typical

  20. Heavy water detritiation to support CANDU station maintenance activities

    International Nuclear Information System (INIS)

    Heavy water and tritium control are important aspects of CANDU operation and have a major impact on station maintenance activities. Station personnel are trained to understand the importance of heavy water management and the economics and environmental impact of tritiated heavy water losses. This paper discusses new GE technology that can now make a major improvement in CANDU maintenance activities through significant reductions in station tritium levels. Tritium is of particular concern in the CANDU industry given the nature of heavy water reactors to build up high levels of tritium over time. High tritium levels in the reactor vault significantly slow down maintenance activities in the reactor vault due to the requirement for personnel protective equipment, including breathing apparatus and cumbersome plastic air suits. The difficulties increase as reactors age and tritium levels increase. Building upon GE's extensive operational experience in tritium management in CANDU reactors and its own tritium handling facility, GE. has developed a new large-scale diffusion based isotope separation process as an alternative to conventional cryogenic distillation. Having a tritium inventory an order of magnitude lower than conventional cryogenic distillation, this process is very attractive for heavy water detritiation, and applicable to single and multi-unit CANDU stations. This new process can now provide a step change reduction in CANDU heavy water tritium levels resulting in reduced environmental emissions and lowering reactor vault tritium MPC(a) levels. Reactor vault tritium can be reduced sufficiently for maintenance activities to be done without plastic suits, leading to shorter outages, improved station capacity factors, and improved station economics. (author)

  1. Development of Regulatory Requirements and Inspection Guides for CANDU Reactors

    Energy Technology Data Exchange (ETDEWEB)

    Kim, M. W.; Kim, K.; Ryu, Y. H. [Korea Institute of Nuclear Safety, Daejeon (Korea, Republic of); Ro, H. Y.; Jin, T. E. [Korea Power Engineering Co., Yongin (Korea, Republic of)

    2009-05-15

    The first domestic CANDU power reactor, Wolsong unit 1, has been operated for about twenty years since commercial operation in 1983, and has been raised common aging issues of CANDU reactors in pressure tubes, calandria tubes, feeder pipes, etc. To solve these aging issues, utility is promoting the refurbishment activities for these major components. Therefore, confirmation and improvement for insufficient requirements considering the CNSC regulatory documents, regulatory principles between regulatory body and utilities related with refurbishment activities are required. These review contents are described herein, and representative review results are presented.

  2. Evolution of the CANDU control centre design process

    International Nuclear Information System (INIS)

    The design of the CANDU NPP control centre and the associated control centre design process has evolved considerably over several generations of plants, from Douglas Point through Darlington, and beyond, to new designs like CANDU 3. In the early plants, the control centre configuration had to be based on designers' projections of control interface requirements. With succeeding generations of designs, along with the introduction of advancing computer control technology, a larger based of operational experience has been factored into the control interface design, and increasing attention has been given to more formal requirements definition, and more systematic consideration of human factors aspects of the design

  3. CANDU fuel quality and how it is achieved

    International Nuclear Information System (INIS)

    In this three part presentation CANDU fuel quality is reviewed from the point of view of a designer/operator and a fabricator. In Part 'A' fuel performance and quality considerations are discussed from the point of view of a designer-operator. In Parts 'B' and 'C' fuel quality is reviewed from the point of view of a fabricator. The presentation was divided in this way to convey the 'team effort' attitude which exists in the Canadian program; the team effort which is an essential part of the CANDU story. (auth)

  4. Fuel management simulation for CANFLEX-RU in CANDU 6

    Energy Technology Data Exchange (ETDEWEB)

    Jeong, Chang Joon; Suk, Ho Chun [Korea Atomic Energy Research Institute, Taejon (Korea, Republic of)

    1997-12-31

    Fuel management simulations have been performed for CANFLEX-09% RU fuel in the CANDU 6 reactor. In this study, the bi-directional 4-bundle shift fuelling scheme was assumed. The lattice cell and time-average calculation were carried out. The refuelling simulation calculations were performed for 600 full power days. Time-averaged results show good axial power profile with the CANFLEX-RU fuel. During the simulation period, the maximum channel and bundle power were maintained below the licensing limit of CANDU 6 reactor. 7 refs., 4 figs. (Author)

  5. A comparison of the void reactivity effect between the CANDU standard and CANDU-6 SEU-43 cells

    International Nuclear Information System (INIS)

    In a CANDU type reactor the void coefficient of the reactivity is positive. The experimental data are available only for fresh fuel in cold conditions. On the other hand, taking into account the reactivity effects induced by changes of the coolant properties is often difficult. The safety analyses require an estimation of the calculation error. A comparison between models is an usual approach to obtain detailed information. In our paper a heterogeneous multi-stratified coolant model is used both for the CANDU standard fuel assembly cell and CANDU SEU-43 cell concept. The coolant is treated as a two phase (liquid and vapors) medium gravitationally separated. The results are inter-compared for different burnups in the partial or total void cases. (authors)

  6. Link prediction based on path entropy

    CERN Document Server

    Xu, Zhongqi; Yang, Jian

    2015-01-01

    Information theory has been taken as a prospective tool for quantifying the complexity of complex networks. In this paper, we first study the information entropy or uncertainty of a path using the information theory. Then we apply the path entropy to the link prediction problem in real-world networks. Specifically, we propose a new similarity index, namely Path Entropy (PE) index, which considers the information entropies of shortest paths between node pairs with penalization to long paths. Empirical experiments demonstrate that PE index outperforms the mainstream link predictors.

  7. Candu plant life management - safeguarding the investment

    International Nuclear Information System (INIS)

    With a large number of the CANDU NPPs getting to the mid-point of their design life, a number of programs have been initiated by the Utilities and AECL to proactively manage plant aging, hence ensuring a safe and reliable operation for the remaining design life. An integrated aging management program is being formulated in response to the regulatory authority the Atomic Energy Control Board (AECB). This integrated program will take into account safety, performance and economic requirements. Elements of this program cover a variety of areas; Phase 1 covers life assessment studies of the critical systems, structures and components (SSCs) including a methodology for defining the critical SSCs. Other programs within Phase 2 address the preparation of a unified set of industry guidelines covering maintenance and inspection requirements during early, middle and late years of plant operation. A 'technology watch' program has also been initiated. The objective of this program is to identify far in advance potential aging phenomena and failure modes that could affect plant performance along with the inspection and maintenance required to monitor and mitigate such aging effects. The importance of maintaining the plant within a well-established 'licensing basis' envelope is also discussed. Plant licensing is carried out for an initial set of conditions and equipment status which may vary during plant life. Canadian utilities are required by the licensing authority, the AECB, to assess the impact of aging on the licensing case for each plant in operation. So far, the main focus of these assessments has been the impact of aging on key parameters such as fuel thermal margin and containment leak rate. Ongoing activities covering characterization of aging, maintenance, monitoring, and appropriate refurbishments are examined. Emphasis of R and D performed to characterize degradation mechanisms, support inspection and fitness for service guidelines are also briefly outlined. (author)

  8. Shortest exposure time possible with LED curing lights

    NARCIS (Netherlands)

    Busemann, I.; Lipke, C.; Schattenberg, A.V.M.B.; Willershausen, B.; Ernst, C.P.

    2011-01-01

    PURPOSE: To investigate the shortest exposure time of different light emitting diode (LED)-curing devices for different resin composites in a clinically relevant laboratory model. METHODS: Nine LED curing devices (Bluephase, Bluephase 16i, Bluephase G2, Bluephase 20i/Ivoclar Vivadent, DEMI/sds Kerr,

  9. The Application of Floyd Algorithm for Returning Path Algorithm with Constraints of Time and Limit of Load

    Directory of Open Access Journals (Sweden)

    Luo Jian Feng

    2016-01-01

    Full Text Available Under ideal condition, there are lots of Shortest Path Algorithms such as Dijkstra, Floyd, Johnson algorithms. However, putting these algorithms into use is not as we expected. The reasons cause the problem may be in the Returning Problem mentioned in the following paper. Shortest Path Algorithms only focus on the shortest path between the points, without paying attention to figure out the direct solution from the Starting Point to the Passing Points and finally to the Starting Point. A Shortest Path Algorithm applied in actual practice will be introduced in here, then another case will be introduced and analyzed to explain the following Algorithm: Under the Constraints of time and limit of Loading capacity, figure out the Shortest Path Algorithm through the Starting Point to the Passing Points and back to the Starting Point. At last , the algorithm is of feasibility and practicability.

  10. Proceedings of the fourth international conference on CANDU maintenance

    Energy Technology Data Exchange (ETDEWEB)

    NONE

    1997-07-01

    These proceedings record the information presented at the 4th International Conference on CANDU Maintenance held November 16-18,1997 in Toronto, Canada. The papers for these proceedings were prepared on component maintenance, human performance, steam generator leak detection, fuel channel inspections, rotating equipment maintenance, surveillance programs, inspection techniques, valve maintenance, steam generator repairs and performance, reactor aging management and preventative maintenance.

  11. Proceedings of the fourth international conference on CANDU maintenance

    International Nuclear Information System (INIS)

    These proceedings record the information presented at the 4th International Conference on CANDU Maintenance held November 16-18,1997 in Toronto, Canada. The papers for these proceedings were prepared on component maintenance, human performance, steam generator leak detection, fuel channel inspections, rotating equipment maintenance, surveillance programs, inspection techniques, valve maintenance, steam generator repairs and performance, reactor aging management and preventative maintenance

  12. Development of CANDU ECCS performance evaluation methodology and guides

    Energy Technology Data Exchange (ETDEWEB)

    Bang, Kwang Hyun; Park, Kyung Soo; Chu, Won Ho [Korea Maritime Univ., Jinhae (Korea, Republic of)

    2003-03-15

    The objectives of the present work are to carry out technical evaluation and review of CANDU safety analysis methods in order to assist development of performance evaluation methods and review guides for CANDU ECCS. The applicability of PWR ECCS analysis models are examined and it suggests that unique data or models for CANDU are required for the following phenomena: break characteristics and flow, frictional pressure drop, post-CHF heat transfer correlations, core flow distribution during blowdown, containment pressure, and reflux rate. For safety analysis of CANDU, conservative analysis or best estimate analysis can be used. The main advantage of BE analysis is a more realistic prediction of margins to acceptance criteria. The expectation is that margins demonstrated with BE methods would be larger that when a conservative approach is applied. Some outstanding safety analysis issues can be resolved by demonstration that accident consequences are more benign than previously predicted. Success criteria for analysis and review of Large LOCA can be developed by top-down approach. The highest-level success criteria can be extracted from C-6 and from them, the lower level criteria can be developed step-by-step, in a logical fashion. The overall objectives for analysis and review are to verify radiological consequences and frequency are met.

  13. The Candu system - The way for nuclear autonomy

    International Nuclear Information System (INIS)

    The experience acquired by Canada during the development of Candu System is presented. Some basic foundations of technology transfer are defined and, the conditions of canadian nuclear industry to provide developing countries, technical assistence for acquisition of nuclear energy autonomy, are analysed. (M.C.K.)

  14. Plutonium Consumption Program, CANDU Reactor Project final report

    Energy Technology Data Exchange (ETDEWEB)

    1994-07-31

    DOE is investigating methods for long term dispositioning of weapons grade plutonium. One such method would be to utilize the plutonium in Mixed OXide (MOX) fuel assemblies in existing CANDU reactors. CANDU (Canadian Deuterium Uranium) reactors are designed, licensed, built, and supported by Atomic Energy of Canada Limited (AECL), and currently use natural uranium oxide as fuel. The MOX spent fuel assemblies removed from the reactor would be similar to the spent fuel currently produced using natural uranium fuel, thus rendering the plutonium as unattractive as that in the stockpiles of commercial spent fuel. This report presents the results of a study sponsored by the DOE for dispositioning the plutonium using CANDU technology. Ontario Hydro`s Bruce A was used as reference. The fuel design study defined the optimum parameters to disposition 50 tons of Pu in 25 years (or 100 tons). Two alternate fuel designs were studied. Safeguards, security, environment, safety, health, economics, etc. were considered. Options for complete destruction of the Pu were also studied briefly; CANDU has a superior ability for this. Alternative deployment options were explored and the potential impact on Pu dispositioning in the former Soviet Union was studied. An integrated system can be ready to begin Pu consumption in 4 years, with no changes required to the reactors other than for safe, secure storage of new fuel.

  15. A short history of the CANDU nuclear power system

    International Nuclear Information System (INIS)

    This paper provides a short historical summary of the evolution of the CANDU nuclear power system with emphasis on the roles played by Ontario Hydro and private sector companies in Ontario in collaboration with Atomic Energy of Canada Limited (AECL). (author). 1 fig., 61 refs

  16. A neutronic study of the cycle PWR-CANDU

    Energy Technology Data Exchange (ETDEWEB)

    Silva, Alberto da; Pereira, Claubia; Veloso, Maria Auxiliadora Fortini; Fortini, Angela; Pinheiro, Ricardo Brant [Universidade Federal de Minas Gerais (UFMG), Belo Horizonte, MG (Brazil). Dept. de Engenharia Nuclear]. E-mail: albertomoc@terra.com.br; claubia@nuclear.ufmg.br; dora@nuclear.ufmg.br; fortini@nuclear.ufmg.br; rbp@nuclear.ufmg.br

    2007-07-01

    The cycle PWR-CANDU was simulated using the WIMSD-5B and ORIGEN2.1 codes. It was simulated a fuel burnup of 33,000 MWd/t for UO{sub 2} with enrichment of 3.2% and a fuel extended burnup of 45,000 MWd/t for UO{sub 2} with enrichments of 3.5%, 4.0% and 5.0% in a PWR reactor. The PWR discharged fuel was submitted to the simulation of deposition for five years. After that, it was submitted to AYROX reprocessing and used to produce a fuel to CANDU reactor. Then, it was simulated the burnup in the CANDU. Parameters such as infinite medium multiplication factor, k{sub inf}, fuel temperature coefficient of reactivity, {alpha}{sub TF}, moderator temperature coefficient of reactivity, {alpha}{sub TM}, the ratio rapid flux/total flux and the isotopic composition in the begin and the end of life were evaluated. The results showed that the fuels analyzed could be used on PWR and CANDU reactors without the need of change on the design of these reactors. (author)

  17. Plutonium Consumption Program, CANDU Reactor Project final report

    International Nuclear Information System (INIS)

    DOE is investigating methods for long term dispositioning of weapons grade plutonium. One such method would be to utilize the plutonium in Mixed OXide (MOX) fuel assemblies in existing CANDU reactors. CANDU (Canadian Deuterium Uranium) reactors are designed, licensed, built, and supported by Atomic Energy of Canada Limited (AECL), and currently use natural uranium oxide as fuel. The MOX spent fuel assemblies removed from the reactor would be similar to the spent fuel currently produced using natural uranium fuel, thus rendering the plutonium as unattractive as that in the stockpiles of commercial spent fuel. This report presents the results of a study sponsored by the DOE for dispositioning the plutonium using CANDU technology. Ontario Hydro's Bruce A was used as reference. The fuel design study defined the optimum parameters to disposition 50 tons of Pu in 25 years (or 100 tons). Two alternate fuel designs were studied. Safeguards, security, environment, safety, health, economics, etc. were considered. Options for complete destruction of the Pu were also studied briefly; CANDU has a superior ability for this. Alternative deployment options were explored and the potential impact on Pu dispositioning in the former Soviet Union was studied. An integrated system can be ready to begin Pu consumption in 4 years, with no changes required to the reactors other than for safe, secure storage of new fuel

  18. Modelling nuclear fuel vibrations in horizontal CANDU reactors

    International Nuclear Information System (INIS)

    Flow-induced fuel vibrations in the pressure tubes of CANDU reactors are of vital interest to designers because fretting damage may result. Computer simulation is being used to study how bundles vibrate and to identify bundle design features which will reduce vibration and hence fretting. (author)

  19. Assessment of LOCA with loss of class IV power for CANDU-6 reactors using RELAP-CANDU/SCAN coupled code system

    International Nuclear Information System (INIS)

    Recently, there is an effort to improve the accuracy and reality in the transient simulation of nuclear power plants. In the prediction of the system transient, the system code simulates the system transient using the power transient curve predicted from the reactor core physics code. However, the pre-calculated power curve could not adequately predict the behavior of power distribution during transient since the coolant density change has influence on the power shape due to the change of the void reactivity. Therefore, the consolidation between the reactor core physics code and the system thermal-hydraulic code takes into consideration to predict more accurate and realistic for the transient simulation. In this regard, there are two codes are developed to assess the safety of CANDU reactor. RELAP-CANDU is a thermal-hydraulic system code for CANDU reactors developed on the basis of RELAP5/MOD3 in such a way to modify inside model for simulating the thermal-hydraulic characteristics of horizontal type reactors. SCAN (SNU CANDU-PHWR Neutronics) is a three dimensional neutronics nodal code to simulate the core physics characteristics for CANDU reactors. To couple SCAN code with RELAP-CANDU code, SCAN code was improved as a spatial kinetics calculation module in such a way to generate a SCAN DLL (dynamic linked library version of SCAN). The coupled code system, RELAP-CANDU/SCAN, enables real-time feedback calculations between thermal-hydraulic variables of RELAP-CANDU and reactor powers of SCAN. To verify the reliability of RELAP-CANDU/SCAN coupled code system, an assessment of 40% reactor inlet header (RIH) break loss of coolant accident (LOCA) with loss of Class IV power (LOP) for Wolsong Unit 2 conducted using RELAP/CANDU-SCAN coupled system. The LOCA with LOP is one of GAI (Generic Action Items) for CANDU reactors issued by CNSC (Canadian Nuclear Safety Commission) and IAEA (International Atomic Energy Agency)

  20. Improved Analysis of Kannan's Shortest Lattice Vector Algorithm

    CERN Document Server

    Hanrot, Guillaume

    2007-01-01

    The security of lattice-based cryptosystems such as NTRU, GGH and Ajtai-Dwork essentially relies upon the intractability of computing a shortest non-zero lattice vector and a closest lattice vector to a given target vector in high dimensions. The best algorithms for these tasks are due to Kannan, and, though remarkably simple, their complexity estimates have not been improved since more than twenty years. Kannan's algorithm for solving the shortest vector problem is in particular crucial in Schnorr's celebrated block reduction algorithm, on which are based the best known attacks against the lattice-based encryption schemes mentioned above. Understanding precisely Kannan's algorithm is of prime importance for providing meaningful key-sizes. In this paper we improve the complexity analyses of Kannan's algorithms and discuss the possibility of improving the underlying enumeration strategy.

  1. Collaborative Product Design for Tasks Sorting Based on Shortest Delivery

    Directory of Open Access Journals (Sweden)

    Xuedong Liang

    2016-01-01

    Full Text Available The “people’s innovation” can promote development in enterprises in urgent need of innovative product design. Collaborative product design can be a powerful tool for enterprises wishing to improve their market competitiveness and customer satisfaction. To reduce decision costs, improve efficiency, and solve other issues, promoting “people’s innovation” can play a vital role. With this focus, this paper examines products produced through “people’s innovation.” A collaborative design task scheduling problem is presented. The design tasks are sorted based on a minimum delivery cost principle, which is determined using weighted shortest processing time (WSPT rules and the shortest delivery time. The results show that distributed collaborative innovation can result in a reasonable arrangement for collaborative design tasks.

  2. Preliminary evaluation of licensing issues associated with U. S. -sited CANDU-PHW nuclear power plants

    Energy Technology Data Exchange (ETDEWEB)

    van Erp, J B

    1977-12-01

    The principal safety-related characteristics of current CANDU-PHW power plants are described, and a distinction between those characteristics which are intrinsic to the CANDU-PHW system and those that are not is presented. An outline is given of the main features of the Canadian safety and licensing approach. Differences between the U.S. and Canadian approach to safety and licensing are discussed. Some of the main results of the safety analyses, routinely performed for CANDU-PHW reactors, are presented. U.S.-NRC General Design Criteria are evaluated as regards their applicability to CANDU-PHW reactors; vice-versa the CANDU-PHW reactor is evaluated with respect to its conformance to the U.S.-NRC General Design Criteria. A number of design modifications are proposed to be incorporated into the CANDU-PHW reactor in order to facilitate its introduction into the U.S.

  3. A Hybrid 3D Path Planning Method for UAVs

    DEFF Research Database (Denmark)

    Ortiz-Arroyo, Daniel

    2015-01-01

    This paper presents a hybrid method for path planning in 3D spaces. We propose an improvement to a near-optimal 2D off-line algorithm and a flexible normalized on-line fuzzy controller to find shortest paths. Our method, targeted to low altitude domains, is simple and efficient. Our preliminary resu...

  4. Improved operability of the CANDU 9 control centre

    Energy Technology Data Exchange (ETDEWEB)

    Macbeth, M. J.; Webster, A. [Atomic Energy of Canada Limited, Saskatoon (Canada)

    1996-04-15

    The next generation CANDU nuclear power plant being designed by AECL is the 900 MWe class CANDU 9 station. It is based upon the Darlington CANDU station design which is among the world leaders in capacity factor with low Operation, Maintenance and Administration (OM and A) costs. This Control Centre design includes the proven functionality of existing CANDU control centres (including the Wolsong 2,3, and 4 control centre improvements, such as the Emergency Core Cooling panels), the characteristics identified by systematic design with human factors analysis of operations requirements and the advanced features needed to improve station operability which is made possible by the application of new technology. The CANDU 9 Control Centre provides plant staff with an improved operability capability due to the combination of proveness, systematic design with human factors engineering and enhanced operating features. Significant features which contribute to this improved operability include: {center_dot} Standard NSP, BOP and F/H panels with controls and indicators integrated by a standard display/presentation philosophy. {center_dot} Common plant parameter signal database for extensive monitoring, checking, display and annunciation. {center_dot} Powerful annunciation system allowing alarm filtering, prioritizing and interrogation to enhance staff recognition of events, plant state and required corrective procedural actions. {center_dot} The use of an overview display to present immediate and uncomplicated plant status information to facilitate operator awareness of unit status in a highly readable and recognizable format. {center_dot} Extensive cross checking of similar process parameters amongst themselves, with the counterpart safety system parameters and as well as with 'signature' values obtained from known steady state conditions. {center_dot} Powerful calculation capabilities, using the plant wide database, providing immediate recognizable and readable and

  5. Used CANDU fuel waste consumed and eliminated: environmentally responsible, economically sound, energetically enormous

    International Nuclear Information System (INIS)

    The 43,800 tonnes of currently stored CANDU nuclear fuel waste can all be consumed in fast-neutron reactors (FNRs) to reduce its long-term radioactive burden 100,000 times while extracting about 130 times more nuclear energy than the prodigious amounts that have already been gained from the fuel in CANDU reactors. The cost of processing CANDU fuel for use in FNRs plus the cost of recycling the FNR fuel is about 2.5 times less on a per kWh energy basis than the currently projected cost of disposal of 3.6 million used CANDU fuel bundles in a deep geological repository. (author)

  6. A study to develop the domestic functional requirements of the specific safety systems of CANDU

    Energy Technology Data Exchange (ETDEWEB)

    Kim, Man Woong; Lee, Jae Young; Bang, Kwang Hyun [Handong Global Univ., Pohang (Korea, Republic of)] (and others)

    2001-03-15

    The present research has been made to develop and review critically the functional requirements of the specific safety systems of CANDU such as SOS-1, SOS-2, ECCS and containment. Based on R documents for this, a systematic study was made to develop the domestic regulation statements. Also, the conventional laws are carefully reviewed to see the compatibility to CANDU. Also, the safety assessment method for CANDU was studied by reviewing C documents and recommendation of IAEA. Through the present works, the vague policy in the CANDU safety regulation is cleaning up in a systematic form and a new frame to measure the objective risk of nuclear power plants was developed.

  7. A study to develop the domestic functional requirements of the specific safety systems of CANDU

    Energy Technology Data Exchange (ETDEWEB)

    Kim, Man Woong [Korea Institute of Nuclear Safety, Taejon (Korea, Republic of); Lee, Jae Young; Park, Kun Chul [Handong Global Univ., Pohang (Korea, Republic of)] (and others)

    2003-03-15

    The present research has been made to develop and review critically the functional requirements of the specific safety systems of CANDU such as SDS-1, SDS2, ECCS, and containment. Based on R documents for this, a systematic study was made to develop the domestic regulation statements. Also, the conventional laws are carefully reviewed to see the compatibility to CANDU. Also, the safety assessment method for CANDU was studied by reviewing C documents and recommendation of IAEA. Through the present works, the vague policy in the CANDU safety regulation is cleaning up in a systematic form and a new frame to measure the objective risk of nuclear power plants was developed.

  8. Development of the advanced CANDU technology -Development of CANDU advanced fuel fabrication technology-

    Energy Technology Data Exchange (ETDEWEB)

    Choi, Chang Bum; Park, Choon Hoh; Park, Chul Joo; Kwon, Woo Joo [Korea Atomic Energy Research Institute, Taejon (Korea, Republic of)

    1995-07-01

    This project is carrying out jointly with AECL to develop CANFLEX fuel which can enhance reactor safety, fuel economy and can be used with various fuel cycles (natural U, slightly enriched U, other advanced fuel). The final goal of this research is to load the CANFLEX fuel in commercial CANDU reactor for demonstration irradiation. The annual portion of research activities performed during this year are followings ; The detail design of CANFLEX-NU fuel was determined. Based on this design, various fabrication drawings and process specifications were revised. The seventeen CANFLEX-NU fuel bundles for reactivity test in ZED-2 and out-pile test, two CANFLEX-SEU fuel bundles for demo-irradiation in NRU were fabricated. Advanced tack welding machine was designed and sequence control software of automatic assembly welder was developed. The basic researches related to fabrication processes, such as weld evaluation by ECT, effect of additives in UO{sub 2}, thermal stabilities of Zr based metallic glasses, were curried out. 51 figs, 22 tabs, 42 refs. (Author).

  9. Lecturers' and Students’ Perception on Learning Dijkstra’s Shortest Path Algorithm Through Mobile Devices

    OpenAIRE

    Mazyar Seraj; Chui Yin Wong

    2014-01-01

    In recent years, many studies have been carried out on how to engage and support students in e-learning environments. Portable devices such as Personal Digital Assistants (PDAs), Tablet PCs, mobile phones and other mobile equipment have been used as parts of electronic learning environments to facilitate learning and teaching for both lecturers and students. However, there is still a dearth of study investigating the effects of small screen interfaces on mobile-based learning environments. Th...

  10. Comment on "Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality"

    CERN Document Server

    Zhou, T; Wang, B H; Liu, Jian-Guo; Wang, Bing-Hong; Zhou, Tao

    2006-01-01

    In this comment, we investigate a common used algorithm proposed by Newman [M. E. J. Newman, Phys. Rev. E {\\bf 64}, 016132(2001)] to calculate the betweenness centrality for all vertices. The error of Newman's algorithm is pointed out and a corrected algorithm, also with O($MN$) time complexity, is given. In addition, the comparison of calculating results for these two algorithm aiming the protein interaction network of Yeast is shown.

  11. TRANSFERRING OF INFORMATION IN WIRELESS ADHOC SENSOR NETWORK USING SHORTEST PATH ALGORITHM

    OpenAIRE

    N. Pushpalatha; De, Anuradha

    2014-01-01

    Wireless sensor networks discover probable in military, environments, health and commercial applications. The process of transferring of information from a remote sensor node to other nodes in a network holds importance for such applications. Various constraints such as limited computation, storage and power makes the process of transferring of information routing interesting and has opened new arenas for researchers. The fundamental problem in sensor networks states the signif...

  12. Sum of All-Pairs Shortest Path Distances in a Planar Graph in Subquadratic Time

    DEFF Research Database (Denmark)

    Wulff-Nilsen, Christian

    2008-01-01

    We consider the problem of computing the Wiener index of a graph, defined as the sum of distances between all pairs of its vertices. It is an open problem whether the Wiener index of a planar graph can be found in subquadratic time. We solve this problem by presenting an algorithm with O(n^2*log...... log n/log n) running time and O(n) space requirement where n is the number of vertices of the graph....

  13. ENHANCED COMPOSITE APPROACH WITH MOBILE BEACON SHORTEST PATH TO SOLVE LOCALIZATION PROBLEM IN WIRELESS SENSOR NETWORK

    Directory of Open Access Journals (Sweden)

    Sunil Kumar,

    2010-12-01

    Full Text Available Wireless sensor network is tremendously being used in different environments to perform various monitoring task such as search, rescue, disaster relief, target tracking and a number of tasks in smart environment. In this paper a unique localization algorithm is proposed that gives the high accuracy in wireless sensor network. We propose amobile beacon algorithm and then merge it with DV- hop algorithm to introduce a unique approach which solves the localization problem in wireless sensor network.

  14. Probabilistic shortest path tractography in DTI using Gaussian Process ODE solvers

    OpenAIRE

    Schober, Michael; Kasenburg, Niklas; Feragen, Aasa; Hennig, Philipp; Hauberg, Søren

    2014-01-01

    Tractography in diffusion tensor imaging estimates connectivity in the brain through observations of local diffusivity. These observations are noisy and of low resolution and, as a consequence, connections cannot be found with high precision. We use probabilistic numerics to estimate connectivity between regions of interest and contribute a Gaussian Process tractography algorithm which allows for both quantification and visualization of its posterior uncertainty. We use the uncertainty both i...

  15. Large and Dense Swarms: Simulation of a Shortest Path Alarm Propagation

    Directory of Open Access Journals (Sweden)

    Claudia Snels

    2015-07-01

    Full Text Available This paper deals with the transmission of alarm messages in large and dense underwater swarms of Autonomous Underwater Vehicles (AUVs and describes the verification process of the derived algorithm results by means of two simulation tools realized by the authors. A collision-free communication protocol has been developed, tailored to a case where a single AUV needs to send a message to a specific subset of swarm members regarding a perceived danger. The protocol includes a handshaking procedure that creates a silence region before the transmission of the message obtained through specific acoustic tones out of the normal transmission frequencies or through optical signals. This region will include all members of the swarm involved in the alarm message and their neighbours, preventing collisions between them. The AUV sending messages to a target area computes a delay function on appropriate arcs and runs a Dijkstra-like algorithm obtaining a multicast tree. After an explanation of the whole building of this collision-free multicast tree, a simulation has been carried out assuming different scenarios relevant to swarm density, signal power of the modem and the geometrical configuration of the nodes.

  16. Parallel approaches to shortest-path problems for multilevel heterogeneous computing

    OpenAIRE

    Ortega Arranz, Héctor

    2015-01-01

    Existen diferentes algoritmos que solucionan problemas de computación del camino-más-corto. Estos problemas son clave dentro de la optimización combinatoria por sus múltiples aplicaciones en la vida real. Últimamente, el interés de la comunidad científica por ellos crece significativamente, no sólo por la amplia aplicabilidad de sus soluciones, sino también por el uso eficiente de la computación paralela. La aparición de nuevos modelos de programación junto con las modernas GPUs, ha enriqueci...

  17. Probabilistic shortest path tractography in DTI using Gaussian Process ODE solvers

    DEFF Research Database (Denmark)

    Schober, Michael; Kasenburg, Niklas; Feragen, Aasa;

    2014-01-01

    Tractography in diffusion tensor imaging estimates connectivity in the brain through observations of local diffusivity. These observations are noisy and of low resolution and, as a consequence, connections cannot be found with high precision. We use probabilistic numerics to estimate connectivity...

  18. Economic analysis of alternative options in CANDU fuel cycle

    International Nuclear Information System (INIS)

    In this study, fuel cycle options for CANDU reactor were studied. Three main options in a CANDU fuel cycle involve use of : (1) natural uranium (0.711 weight percent U-235) fuel, (2) slightly enriched uranium (1.2 weight percent U-235) fuel, and (3) recovered uranium (0.83 weight percent U-235) fuel from light water reactor spent fuel. ORIGEN-2 computer code was used to identify composition of the spent fuel for each option , including the standard LWR fuel (3.3 weight percent U-235). Uranium and plutonium credit calculations were performed by using ORIGEN-2 output. WIMSD-5 computer code was used to determine maximum discharge burnup values for each case. Cost estimations were carried out using specially-developed computer programs. Comparison of levelized costs for the fuel cycle options and sensitivity analysis for the cost components are also presented

  19. Research and development for CANDU fuel channels and fuel

    International Nuclear Information System (INIS)

    The CANDU nuclear reactor is distinctly different from BWR and PWR reactors in that it uses many small pressure tubes rather than one large pressure vessel to contain the fuel and coolant. To exploit the advantages of the natural uranium fuel, the pressure tubes, like other core components, are manufactured from zirconium alloys which have low neutron capture cross sections. Also, because natural uranium fuel only achieves a modest burnup, a simple and inexpensive fuel design has been developed. The present paper reviews the features and the research that have led to the very satisfactory performance of the pressure tubes and the fuel in CANDU reactors. Reference is made to current research and development that may lead to further economies in the design and operation of future power reactors. (author)

  20. CANDU type fuel behavior evaluation - a probabilistic approach

    International Nuclear Information System (INIS)

    In order to realistically assess the behavior of the fuel elements during in-reactor operation, probabilistic methods have recently been introduced in the analysis of fuel performance. The present paper summarizes the achievements in this field at the Institute for Nuclear Research (INR), pointing out some advantages of the utilized method in the evaluation of CANDU type fuel behavior in steady state conditions. The Response Surface Method (RSM) has been selected for the investigation of the effects of the variability in fuel element computer code inputs on the code outputs (fuel element performance parameters). A new developed version of the probabilistic code APMESRA based on RSM is briefly presented. The examples of application include the analysis of the results of an in-reactor fuel element experiment and the investigation of the calculated performance parameter distribution for a new CANDU type extended burnup fuel element design. (author)

  1. Development of nuclear fuel. Development of CANDU advanced fuel bundle

    International Nuclear Information System (INIS)

    In order to develop CANDU advanced fuel, the agreement of the joint research between KAERI and AECL was made on February 19, 1991. AECL conceptual design of CANFLEX bundle for Bruce reactors was analyzed and then the reference design and design drawing of the advanced fuel bundle with natural uranium fuel for CANDU-6 reactor were completed. The CANFLEX fuel cladding was preliminarily investigated. The fabricability of the advanced fuel bundle was investigated. The design and purchase of the machinery tools for the bundle fabrication for hydraulic scoping tests were performed. As a result of CANFLEX tube examination, the tubes were found to be meet the criteria proposed in the technical specification. The dummy bundles for hydraulic scoping tests have been fabricated by using the process and tools, where the process parameters and tools have been newly established. (Author)

  2. Proceedings of the third international conference on CANDU maintenance

    International Nuclear Information System (INIS)

    The third international conference on Candu maintenance included sessions on the following topics: predictive maintenance, reliability improvements, steam generator monitoring, tools and instrumentation, valve performance, fuel channel inspection and maintenance, steam generator maintenance, environmental qualification, predictive maintenance, instrumentation and control, steam generator cleaning, decontamination and radiation protection, inspection techniques, maintenance program strategies and valve packing experience, remote tooling/ robotics and fuel handling. The individual papers have been abstracted separately

  3. Scenarios for the transmutation of actinides in CANDU reactors

    Energy Technology Data Exchange (ETDEWEB)

    Hyland, Bronwyn, E-mail: hylandb@aecl.ca [Atomic Energy of Canada Limited, Chalk River Laboratories, Chalk River, Ontario, K0J 1J0 (Canada); Gihm, Brian, E-mail: gihmb@aecl.ca [Atomic Energy of Canada Limited, 2251 Speakman Drive, Mississauga, Ontario, L5K 1B2 (Canada)

    2011-12-15

    With world stockpiles of used nuclear fuel increasing, the need to address the long-term utilization of this resource is being studied. Many of the transuranic (TRU) actinides in nuclear spent fuel produce decay heat for long durations, resulting in significant nuclear waste management challenges. These actinides can be transmuted to shorter-lived isotopes to reduce the decay heat period or consumed as fuel in a CANDU(R) reactor. Many of the design features of the CANDU reactor make it uniquely adaptable to actinide transmutation. The small, simple fuel bundle simplifies the fabrication and handling of active fuels. Online refuelling allows precise management of core reactivity and separate insertion of the actinides and fuel bundles into the core. The high neutron economy of the CANDU reactor results in high TRU destruction to fissile-loading ratio. This paper provides a summary of actinide transmutation schemes that have been studied in CANDU reactors at AECL, including the works performed in the past. The schemes studied include homogeneous scenarios in which actinides are uniformly distributed in all fuel bundles in the reactor, as well as heterogeneous scenarios in which dedicated channels in the reactor are loaded with actinide targets and the rest of the reactor is loaded with fuel. The transmutation schemes that are presented reflect several different partitioning schemes. Separation of americium, often with curium, from the other actinides enables targeted destruction of americium, which is a main contributor to the decay heat 100-1000 years after discharge from the reactor. Another scheme is group-extracted transuranic elements, in which all of the transuranic elements, plutonium (Pu), neptunium (Np), americium (Am), and curium (Cm) are extracted together and then transmuted. This paper also addresses ways of utilizing the recycled uranium, another stream from the separation of spent nuclear fuel, in order to drive the transmutation of other actinides.

  4. Formal language constrained path problems

    Energy Technology Data Exchange (ETDEWEB)

    Barrett, C.; Jacob, R.; Marathe, M.

    1997-07-08

    In many path finding problems arising in practice, certain patterns of edge/vertex labels in the labeled graph being traversed are allowed/preferred, while others are disallowed. Motivated by such applications as intermodal transportation planning, the authors investigate the complexity of finding feasible paths in a labeled network, where the mode choice for each traveler is specified by a formal language. The main contributions of this paper include the following: (1) the authors show that the problem of finding a shortest path between a source and destination for a traveler whose mode choice is specified as a context free language is solvable efficiently in polynomial time, when the mode choice is specified as a regular language they provide algorithms with improved space and time bounds; (2) in contrast, they show that the problem of finding simple paths between a source and a given destination is NP-hard, even when restricted to very simple regular expressions and/or very simple graphs; (3) for the class of treewidth bounded graphs, they show that (i) the problem of finding a regular language constrained simple path between source and a destination is solvable in polynomial time and (ii) the extension to finding context free language constrained simple paths is NP-complete. Several extensions of these results are presented in the context of finding shortest paths with additional constraints. These results significantly extend the results in [MW95]. As a corollary of the results, they obtain a polynomial time algorithm for the BEST k-SIMILAR PATH problem studied in [SJB97]. The previous best algorithm was given by [SJB97] and takes exponential time in the worst case.

  5. Safety benefits from CANDU reactor replacement. A case study

    International Nuclear Information System (INIS)

    Both total core replacement and core retubing have been used in the CANDU industry. For future plant refurbishments, based on experience both in new construction and in recent refurbishments, the concept of total core replacement has been revisited. This builds on practices for replacement of other large plant equipment like boilers. The Bruce CANDU reactors, with their local shield tanks built around the Calandria and containment closely located around that Calandria Shield Tank Assembly (CSTA), are believed to be good candidates for core replacement. A structured process was used to design a replacement CSTA suitable for Bruce A use. The work started with a study of opportunities for safety enhancements in the core. This progressed into design studies and related design assist safety analysis on the reactor. A key element of the work involved consideration of how verified features from later CANDU designs, and from our new reactor design work, could be tailored to fit this replacement core. The replacement reactor core brings in structural improvements in both calandria and end shield, and safety improvements like the natural circulation enhancing moderator cooling layout and further optimized reactivity layouts to improve shutdown system performance. Bruce Power are currently studying the business implications of this and retube techniques as part of preparation for future refurbishments. The work explained in this paper is in the context of the safety related changes and the work to choose and quantify them. (author)

  6. Safety benefits from CANDU reactor replacement - a case study

    International Nuclear Information System (INIS)

    Both total core replacement and core retubing have been used in the CANDU industry. For future plant refurbishments, based on experience both in new construction and in recent refurbishments, the concept of total core replacement has been revisited. This builds on practices for replacement of other large plant equipment like boilers. The Bruce CANDU reactors, with their local shield tanks built around the Calandria and containment closely located around that Calandria Shield Tank Assembly (CSTA), are believed to be good candidates for core replacement. A structured process was used to design a replacement CSTA suitable for Bruce A use. The work started with a study of opportunities for safety enhancements in the core. This progressed into design studies and related design assist safety analysis on the reactor. A key element of the work involved consideration of how verified features from later CANDU designs, and from our new reactor design work, could be tailored to fit this replacement core. The replacement reactor core brings in structural improvements in both calandria and end shield, and safety improvements like the natural circulation enhancing moderator cooling layout and further optimized reactivity layouts to improve shutdown system performance. Bruce Power are currently studying the business implications of this and retube techniques as part of preparation for future refurbishments. The work explained in this paper is in the context of the safety related changes and the work to choose and quantify them. (author)

  7. Advancement of safeguards inspection technology for CANDU nuclear power plants

    Energy Technology Data Exchange (ETDEWEB)

    Lee, Jae Sung; Park, W. S.; Cha, H. R.; Ham, Y. S.; Lee, Y. G.; Kim, K. P.; Hong, Y. D

    1999-04-01

    The objectives of this project are to develop both inspection technology and safeguards instruments, related to CANDU safeguards inspection, through international cooperation, so that those outcomes are to be applied in field inspections of national safeguards. Furthermore, those could contribute to the improvement of verification correctness of IAEA inspections. Considering the level of national inspection technology, it looked not possible to perform national inspections without the joint use of containment and surveillance equipment conjunction with the IAEA. In this connection, basic studies for the successful implementation of national inspections was performed, optimal structure of safeguards inspection was attained, and advancement of safeguards inspection technology was forwarded. The successful implementation of this project contributed to both the improvement of inspection technology on CANDU reactors and the implementation of national inspection to be performed according to the legal framework. In addition, it would be an opportunity to improve the ability of negotiating in equal shares in relation to the IAEA on the occasion of discussing or negotiating the safeguards issues concerned. Now that the national safeguards technology for CANDU reactors was developed, the safeguards criteria, procedure and instruments as to the other item facilities and fabrication facilities should be developed for the perfection of national inspections. It would be desirable that the recommendations proposed and concreted in this study, so as to both cope with the strengthened international safeguards and detect the undeclared nuclear activities, could be applied to national safeguards scheme. (author)

  8. CANDU 6 fuel channel stress analysis using ANSYS fatigue module

    International Nuclear Information System (INIS)

    Design reliability can be confirmed by the stress analysis, and its results become the basis of the structural integrity for components. The report presents the development of CANDU 6 fuel channel stress analysis methodology and procedure per ASME Code using the ANSYS fatigue module. Stress analysis was performed in accordance with the procedure developed on the basis of ASME Code Section III NB-3200. FORTRAN programs and ANSYS macros used in data processing were developed to systematized the analysis. Stresses were separately analyzed for mechanical and thermal load respectively, and then combined in the post-processing stage for the various conditions. Maximum stress intensity range was then calculated at selected nodes by using the ANSYS fatigue module for the sum of mechanical and thermal stress values. As a results, structural integrity of CANDU 6 fuel channel was proved in this report and analysis reliability for CANDU reactor was shown to be enhanced by the establishment of analysis procedure bases upon ASME Code. (Author) 11 refs., 11 figs., 6 tabs

  9. Temperature effect of DUPIC fuel in CANDU reactor

    International Nuclear Information System (INIS)

    The fuel temperature coefficient (FTC) of DUPIC fuel was calculated by WIMS-AECL with ENDF/B-V cross-section library. Compared to natural uranium CANDU fuel, the FTC of DUPIC fuel is less negative when fresh and is positive after 10,000 MWD/T of irradiation. The effect of FTC on the DUPIC core performance was analyzed using the pace-time kinetics module in RFSP for the refueling transient which occurs daily during normal operation of CANDU reactors. In this study, the motion of zoen controller units (ZCU) was modeled externally to describe the reactivity control during the refueling transient. Refueling operation was modeled as a linear function of time by changing the fuel burnup incrementally and the average fuel temperature was calculated based on the bundle power during the transient. The analysis showed that the core-wide FTC is negative and local positive FTC of the DUPIC fuel can be accommodated in the CANDU reactor because the FTC is very small, the refueling operation occurs slowly, and the channel-front-peaked axial power profile weakens the contribution of the positive FTC. (author). 11 refs., 31 tabs., 10 figs

  10. An emergency water injection system (EWIS) for future CANDU reactors

    Energy Technology Data Exchange (ETDEWEB)

    Marques, Andre L.F. [Centro Tecnologico da Marinha em Sao Paulo (CTMSP), SP (Brazil). E-mail: momarques@uol.com.br; Todreas, Neil E.; Driscoll, Michael J. [Massachusetts Inst.of Tech., Cambridge, MA (United States). Nuclear Engineering Dept.

    2000-07-01

    This paper deals with the investigation of the feasibility and effectiveness of water injection into the annulus between the calandria tubes and the pressure tubes of CANDU reactors. The purpose is to provide an efficient decay heat removal process that avoids permanent deformation of pressure tubes severe accident conditions, such as loss of coolant accident (LOCA). The water injection may present the benefit of cost reduction and better actuation of other related safety systems. The experimental work was conducted at the Massachusetts Institute of Technology (MIT), in a setup that simulated, as close as possible, a CANDU bundle annular configuration, with heat fluxes on the order of 90 kW/m{sup 2}: the inner cylinder simulates the pressure tube and the outer tube represents the calandria tube. The experimental matrix had three dimensions: power level, annulus water level and boundary conditions. The results achieved overall heat transfer coefficients (U), which are comparable to those required (for nominal accident progression) to avoid pressure tube permanent deformation, considering current CANDU reactor data. Nonetheless, future work should be carried out to investigate the fluid dynamics such as blowdown behavior, in the peak bundle, and the system lay-out inside the containment to provide fast water injection. (author)

  11. Streamlined Reliability Centred Maintenance (RCM) application to CANDU 6 stations

    International Nuclear Information System (INIS)

    Over the past five years, Atomic Energy of Canada Ltd. (AECL) has been working with CANDU utilities on Plant Life Management (PLiM) programs that will see existing CANDU plants through their design life and beyond. As part of this initiative, AECL and New Brunswick Power have partnered to develop a Systematic Approach to Maintenance program applied to selected critical plant systems. This paper will describe how streamlined Reliability Centred Maintenance (RCM) techniques have been applied on systems at the Point Lepreau Generating Station to provide a sound documented basis for maintenance strategies. These strategies have emphasised a hierarchy of condition based maintenance, time based maintenance and, where appropriate, corrective maintenance. The major steps in the process are described. The clear benefits of focusing maintenance in areas where it is needed and effective from the context of impact on system function requirements are described. The basis of the maintenance program is fully documented at the individual task level. The results of the program are also used to define maintenance strategies for future CANDU power plants. (author)

  12. Advancement of safeguards inspection technology for CANDU nuclear power plants

    International Nuclear Information System (INIS)

    The objectives of this project are to develop both inspection technology and safeguards instruments, related to CANDU safeguards inspection, through international cooperation, so that those outcomes are to be applied in field inspections of national safeguards. Furthermore, those could contribute to the improvement of verification correctness of IAEA inspections. Considering the level of national inspection technology, it looked not possible to perform national inspections without the joint use of containment and surveillance equipment conjunction with the IAEA. In this connection, basic studies for the successful implementation of national inspections was performed, optimal structure of safeguards inspection was attained, and advancement of safeguards inspection technology was forwarded. The successful implementation of this project contributed to both the improvement of inspection technology on CANDU reactors and the implementation of national inspection to be performed according to the legal framework. In addition, it would be an opportunity to improve the ability of negotiating in equal shares in relation to the IAEA on the occasion of discussing or negotiating the safeguards issues concerned. Now that the national safeguards technology for CANDU reactors was developed, the safeguards criteria, procedure and instruments as to the other item facilities and fabrication facilities should be developed for the perfection of national inspections. It would be desirable that the recommendations proposed and concreted in this study, so as to both cope with the strengthened international safeguards and detect the undeclared nuclear activities, could be applied to national safeguards scheme. (author)

  13. A large deviation principle for join the shortest queue

    OpenAIRE

    Puhalskii, Anatolii A.; Vladimirov, Alexander A.

    2005-01-01

    We consider a join-the-shortest-queue model which is as follows. There are $K$ single FIFO servers and $M$ arrival processes. The customers from a given arrival process can be served only by servers from a certain subset of all servers. The actual destination is the server with the smallest weighted queue length. The arrival processes are assumed to obey a large deviation principle while the service is exponential. A large deviation principle is established for the queue-length process. The a...

  14. The evolution of the CANDU energy system - ready for Europe's energy future

    International Nuclear Information System (INIS)

    As air quality and climate change issues receive increasing attention, the opportunity for nuclear to play a larger role in the coming decades also increases. The good performance of the current fleet of nuclear plants is crucial evidence of nuclear's potential. The excellent record of Cernavoda-1 is an important part of this, and demonstrates the maturity of the Romanian program and of the CANDU design approach. However, the emerging energy market also presents a stringent economic challenge. Current NPP designs, while established as reliable electricity producers, are seen as limited by high capital costs. In some cases, the response to the economic challenge is to consider radical changes to new design concepts, with attendant development risks from lack of provenness. Because of the flexibility of the CANDU system, it is possible to significantly extend the mid-size CANDU design, creating a Next Generation product, without sacrificing the extensive design, delivery and operations information base for CANDU. This enables a design with superior safety characteristics while at the same time meeting the economic challenge of emerging markets. The Romanian nuclear program has progressed successfully forward, leading to the successful operation of Cernavoda-1, and the project to bring Cernavoda-2 to commercial operation. The Romanian nuclear industry has become a full-fledged member of the CANDU community, with all areas of nuclear technology well established and benefiting from international cooperation with other CANDU organizations. AECL is an active partner with Romanian nuclear organizations, both through cooperative development programs, commercial contracts, and also through the activities of the CANDU owners' Group (COG). The Cernavoda project is part of the CANDU 6 family of nuclear power plants developed by AECL. The modular fuel channel reactor concept can be modified extensively, through a series of incremental changes, to improve economics, safety

  15. Utilization of spent PWR fuel-advanced nuclear fuel cycle of PWR/CANDU synergism

    Institute of Scientific and Technical Information of China (English)

    HUO Xiao-Dong; XIE Zhong-Sheng

    2004-01-01

    High neutron economy, on line refueling and channel design result in the unsurpassed fuel cycle flexibility and variety for CANDU reactors. According to the Chinese national conditions that China has both PWR and CANDU reactors and the closed cycle policy of reprocessing the spent PWR fuel is adopted, one of the advanced nuclear fuel cycles of PWR/CANDU synergism using the reprocessed uranium of spent PWR fuel in CANDU reactor is proposed, which will save the uranium resource (~22.5%), increase the energy output (~41%), decrease the quantity of spent fuels to be disposed (~2/3) and lower the cost of nuclear power. Because of the inherent flexibility of nuclear fuel cycle in CANDU reactor, and the low radiation level of recycled uranium(RU), which is acceptable for CANDU reactor fuel fabrication, the transition from the natural uranium to the RU can be completed without major modification of the reactor core structure and operation mode. It can be implemented in Qinshan Phase Ⅲ CANDU reactors with little or no requirement of big investment in new design. It can be expected that the reuse of recycled uranium of spent PWR fuel in CANDU reactor is a feasible and desirable strategy in China.

  16. Impact of lattice geometry distortion due to ageing on selected physics parameters of a CANDU reactor

    International Nuclear Information System (INIS)

    In this paper, results related to a limited scope assessment of the geometry-distortion-induced effects on key reactor physics parameters of a CANDU reactor are discussed. These results were generated by simulations using refined analytical methods and detailed modeling of CANDU reactor core with aged lattice cell geometry. (authors)

  17. Design requirements, criteria and methods for seismic qualification of CANDU power plants

    International Nuclear Information System (INIS)

    This report describes the requirements and criteria for the seismic design and qualification of systems and equipment in CANDU nuclear power plants. Acceptable methods and techniques for seismic qualification of CANDU nuclear power plants to mitigate the effects or the consequences of earthquakes are also described. (auth)

  18. Path Selection and Route Preference in Human Navigation: A Progress Report

    OpenAIRE

    Golledge, Reginald G.

    1995-01-01

    Two critical characteristics of human wayfinding are destination choice and path selection. Traditionally, the path selection problem has been ignored or assumed to be the result of minimizing procedures such as selecting the shortest path, the quickest path or the least costly path. In this paper I draw on existing literature from cognitive mapping and cognitive distance, to define possible route selection criteria other than these traditional ones. Experiments with route selection on maps a...

  19. Comparison of Three Different Curves Used in Path Planning Problems Based on Particle Swarm Optimizer

    OpenAIRE

    Liang, J J; Song, H; B. Y. Qu; Liu, Z. F.

    2014-01-01

    In path planning problems, the most important task is to find a suitable collision-free path which satisfies some certain criteria (the shortest path length, security, feasibility, smoothness, and so on), so defining a suitable curve to describe path is essential. Three different commonly used curves are compared and discussed based on their performance on solving a set of path planning problems. Dynamic multiswarm particle swarm optimizer is employed to optimize the necessary parameters for ...

  20. Survey of considerations involved in introducing CANDU reactors into the United States

    Energy Technology Data Exchange (ETDEWEB)

    Till, C E; Bohn, E M; Chang, Y I; van Erp, J B

    1977-01-01

    The important issues that must be considered in a decision to utilize CANDU reactors in the U.S. are identified in this report. Economic considerations, including both power costs and fuel utilization, are discussed for the near and longer term. Safety and licensing considerations are reviewed for CANDU-PHW reactors in general. The important issues, now and in the future, associated with power generation costs are the capital costs of CANDUs and the factors that impact capital cost comparisons. Fuel utilization advantages for the CANDU depend upon assumptions regarding fuel recycle at present, but the primary issue in the longer term is the utilization of the thorium cycle in the CANDU. Certain safety features of the CANDU are identified as intrinsic to the concept and these features must be examined more fully regarding licensability in the U.S.

  1. Development of a best estimate auditing code for CANDU thermal hydraulic safety analysis

    Energy Technology Data Exchange (ETDEWEB)

    Chung, B.D.; Lee, W.J.; Lim, H.S. [Korea Atomic Energy Research Institute, Taejeon (Korea)

    2000-03-01

    The main purpose of this study is to develop a thermal hydraulic auditing code for the CANDU reactor, modifying the model of existing PWR auditing tool , i.e. RELAP5/MOD3. This scope of project is a third step of the whole project, and expand the RELAP5/MOD3/CANDU version for implementation of LOCA Analysis. There are three main area of model development, i.e. Moody critical flow model, flow regime model of horizontal CANDU bundle, and fuel element heatup model when the stratification occurs. Newly developed version, namely RELAP5/MOD3/CANDU+ is applicable to CANDU plant analysis with keeping the function of light water reactor analysis. The limited validations of model installation were performed. Assessment of CHF model using AECL separated effect test and calculation for Wolsong 2 plant were performed also for the applicability test of the developed version. 15 refs., 37 figs., 8 tabs. (Author)

  2. Development of best estimate auditing code for CANDU thermal hydraulic safety analysis

    Energy Technology Data Exchange (ETDEWEB)

    Chung, B. D.; Lee, W. J.; Lim, H. S. [Korea Atomic Energy Research Institute, Taejon (Korea, Republic of)

    2000-03-15

    The main purpose of this study is to develop a thermal hydraulic auditing code for the CANDU reactor, modifying the model if existing PWR auditing tool, i.e. RELAP5/MOD3. This scope of project is a third step of the whole project, and expand the RELAP5/MOD3/CANDU version for implementation of LOCA analysis. There are three main area of model development, i.e. moody critical flow model, flow regime model of horizontal CANDU bundle, and fuel element heatup model when the stratification occurs. Newly developed version, namely RELAP5/MOD3/CANDU+ is applicable to CANDU plant analysis with keeping the function of light water reactor analysis. The limited validations of model installation were performed. Assessment of CHF model using AECL separated effect test and calculation for Wolsong 2 plant were performed also for the applicability test of the developed version.

  3. Path Dependency

    OpenAIRE

    Mark Setterfield

    2015-01-01

    Path dependency is defined, and three different specific concepts of path dependency – cumulative causation, lock in, and hysteresis – are analyzed. The relationships between path dependency and equilibrium, and path dependency and fundamental uncertainty are also discussed. Finally, a typology of dynamical systems is developed to clarify these relationships.

  4. Public health risks associated with the CANDU nuclear fuel cycle

    International Nuclear Information System (INIS)

    This report analyzes in a preliminary way the risks to the public posed by the CANDU nuclear fuel cycle. Part 1 considers radiological risks, while part 2 (published as INFO-0141-2) evaluates non-radiological risks. The report concludes that, for radiological risks, maximum individual risks to members of the public are less than 10-5 per year for postulated accidents, are less than 1 percent of regulatory limits for normal operation and that collective doses are small, less than 3 person-sieverts. It is also concluded that radiological risks are much smaller than the non-radiological risks posed by activities of the nuclear fuel cycle

  5. CANDU 9-meeting evolving safety and licensing requirements

    International Nuclear Information System (INIS)

    To date the safety and licensing experience with CANDU has been good, with plants successfully licensed and operating safely both domestically and in other countries. Nevertheless it is now clearly recognized that the utilities need more formal evidence that the licensing risk is low, if they are to proceed with new nuclear power projects. The CANDU 9 is an evolutionary design generating over 900 MWe. It is based on already-operating CANDUs, with improvements in the areas of construct ability, economics, plant layout, operations and maintenance, and safety. Even so, both domestic and foreign potential users require evidence of safety and licensability in Canada as of 'today'. For CANDU 9, this involves two main activities : · incorporation by designers not just of new Canadian safety regulations, but also of world trends in areas such as severe accidents and human factors, and · a two-year formal intensive review by the Canadian regulatory agency, the AECB (Atomic Energy Control Board) which will end in January 1997, with a first report mid-1996. In the severe accident area, CANDU 9 has improved the ability of the water-filled shield tank to act as a 'core catcher' for accidents such as a combined failure of the reactor cooling system piping, plus loss of emergency core cooling, plus loss of the moderator as a backup heat sink. A reserve water tank supplies sufficient water to the shield tank to remove decay heat and prevent melt-through. The licensing review documents encompass all of the Safety Design Guides, Design Requirements and flowsheets of the major systems, a preliminary Safety Analysis Report, a preliminary Probabilistic Safety Assessment, a Human Factors Engineering Programme Plan, the procedures for producing safety-critical software, and others. The licensing review scope includes comparison of the design and safety assessment results with current Canadian licensing requirements. The review will be complete once there is a finding that there are 'no

  6. OpenFOAM Analysis of CANDU-6 Moderator Flow

    Energy Technology Data Exchange (ETDEWEB)

    Kim, Hyoung Tae [Korea Atomic Energy Research Institute, Daejeon (Korea, Republic of); Chang, Se-Myong [Kunsan National University, Gunsan (Korea, Republic of)

    2015-10-15

    In this study OpenFOAM (Open Field Operation and Manipulation), an open source CFD solver, is used to simulate the three-dimensional moderator flow in calandria tank of CANDU-6 reactor improving the computational efficiency by parallel computing which does not need any proprietary license. A prototype of CANDU-6 reactor is numerically analyzed about three-dimensional moderator flow in calandrian tank with OpenFOAM, an open source CFD code. The horizontal fuel channels in a CANDU-6 reactor (a pressurized heavy water reactor) are submerged in the heavy water (D{sub 2}O) pool which is contained by a cylindrical tank, calandria. Each fuel channel consists of concentric tubes: a Pressure Tube (PT) and a Calandria Tube (CT). And the CO{sub 2} gas is filled between these tubes. Consequently, a heat flux is rapidly transferred to the outer CT so that a film boiling may occur in CT. As a result, it is important to keep the subcooling in the moderator. It is one of the major concerns in the CANDU safety analyses to estimate the local subcooling margin of the moderator inside the calandria tank. Previous experimental studies showed that the film boiling would be unlikely to occur if the local moderator subcooling is sufficient. Therefore, an accurate prediction of the moderator temperature distribution in the calandria tank is needed to confirm the channel integrity. There have been numerous computational efforts to estimate the thermal hydraulics in the calandria tank using CFD codes. Hadaller et al. obtained a tube bank pressure drop model for tube bundle region of the calandria tank and implemented it into the MODTURC{sub C}LAS code. Yoon et al. used the CFX code to develop a CFD model with a porous media approach for the core region. However, it is known that porous media modeling provide only average values of flow velocities and temperatures and do not give any information about local flow variables near tube solid walls, which are necessary to implement accurate heat

  7. Measurements of elastic modulus in Zr alloys for CANDU applications

    International Nuclear Information System (INIS)

    Measurements of elastic modulus as a function of temperature from 20 to 400°C were carried out on specimens of Zr-2.5Nb, Zircaloy-4, Zircaloy-2 and Excel Zr alloy using an ultrasonic resonance technique. The specimens were machined from CANDU pressure tubes, a calandria tube and commercial sheet material. Effects of crystallographic texture, neutron irradiation and hydrogen on elastic modulus were investigated. The results show that elastic modulus of the Zr alloys (1) decreases with increasing temperature, (2) depends strongly on crystallographic texture, and (3) increases slightly with neutron irradiation. (author)

  8. Development of defueling device for CANDU fuel channel (modeling)

    Energy Technology Data Exchange (ETDEWEB)

    Lee, J. Y.; Yu, K. H.; Yang, J. S.; Lee, H. S.; Chang, K. J.; Kim, Y. J. [CNEC Technical Office, Taejon (Korea, Republic of); Lee, S. K. [Korea Electric Power Research Institute, Taejon (Korea, Republic of)

    2004-07-01

    Commercial CANDU reactors use D{sub 2}O for moderator and heat transfer material and also have Fueling Machines(F/M) and related system equipment in order to assist on-power refueling operation. A Defuelling Device(DFD) is developed for the proper defuelling of all fuels in all fuel channels during shutdown condition of plant. This device is considered more efficient in defuelling compared to the existing Fuel Grapple System for its use of existing D{sub 2}O flow in the fuel channel. In this study, computational fluid dynamic software is used for optimize and evaluation of the design for its applicability.

  9. CANDU Safety R&D Status, Challenges, and Prospects in Canada

    Directory of Open Access Journals (Sweden)

    W. Shen

    2015-01-01

    Full Text Available In Canada, safe operation of CANDU (CANada Deuterium Uranium; it is a registered trademark of Atomic Energy of Canada Limited reactors is supported by a full-scope program of nuclear safety research and development (R&D in key technical areas. Key nuclear R&D programs, facilities, and expertise are maintained in order to address the unique features of the CANDU as well as generic technology areas common to CANDU and LWR (light water reactor. This paper presents an overview of the CANDU safety R&D which includes background, drivers, current status, challenges, and future directions. This overview of the Canadian nuclear safety R&D programs includes those currently conducted by the COG (CANDU Owners Group, AECL (Atomic Energy of Canada Limited, Candu Energy Inc., and the CNSC (Canadian Nuclear Safety Commission and by universities via UNENE (University Network of Excellence in Nuclear Engineering sponsorship. In particular, the nuclear safety R&D program related to the emerging CANDU ageing issues is discussed. The paper concludes by identifying directions for the future nuclear safety R&D.

  10. Heavy water: a distinctive and essential component of CANDU

    International Nuclear Information System (INIS)

    The exceptional properties of heavy water as a neutron moderator provide one of the distinctive features of CANDU reactors. Although most of the chemical and physical properties of deuterium and protium (mass 1 hydrogen) are appreciably different, the low terrestrial abundance of deuterium makes the separation of heavy water a relatively costly process, and so of considerable importance to the CANDU system. World heavy-water supplies are currently provided by the Girdler-Sulphide process or processes based on ammonia-hydrogen exchange. Due to cost and hazard considerations, new processes will be required for the production of heavy water in and beyond the next decade. Through AECL's development and refinement of wetproofed catalysts for the exchange of hydrogen isotopes between water and hydrogen, a family of new processes is expected to be deployed. Two monothermal processes, CECE (Combined Electrolysis and Catalytic Exchange, using water-to-hydrogen conversion by electrolysis) and CIRCE (Combined Industrially Reformed hydrogen and Catalytic Exchange, based on steam reforming of hydrocarbons), are furthest advanced. Besides its use for heavy-water production, the CECE process is a highly effective technology for heavy-water upgrading and for tritium separation from heavy (or light) water. (author). 10 refs., 1 tab., 7 figs

  11. CANDU bundle junction. Misalignment probability and pressure-drop correlation

    International Nuclear Information System (INIS)

    The pressure drop over the bundle junction is an important component of the pressure drop in a CANDU (Canada Deuterium Uranium) fuel channel. This component can represent from ∼ 15% for aligned bundles to ∼ 26% for rotationally misaligned bundles, and is dependent on the degree of misalignment. The geometry of the junction increases the mixing between subchannels, and hence improves the thermal performance of the bundle immediately downstream. It is therefore important to model the junction's performance adequately. This paper summarizes a study sponsored by COG (CANDU Owners Group) and an NSERC (National Science and Engineering Research Council) Industrial Research Grant, undertaken, at CRL (Chalk River Laboratories) to identify and develop a bundle-junction model for potential implementation in the ASSERT (Advanced Solution of Subchannel Equations in Reactor Thermalhydraulics) subchannel code. The work reported in this paper consists of two components of this project: an examination of the statistics of bundle misalignment, demonstrating that there are no preferred positions for the bundles and therefore all misalignment angles are equally possible; and, an empirical model for the single-phase pressure drop across the junction as a function of the misalignment angle. The second section of this paper includes a brief literature review covering the experimental, analytical and numerical studies concerning the single-phase pressure drop across bundle junctions. 32 refs., 9 figs

  12. Aging of elastomers in CANDU pressure boundary service

    International Nuclear Information System (INIS)

    This report describes the properties and aging of elastomers, and examines the performance of major elastomeric components in CANDU pressure boundary service. The components examined are vacuum building roof seals, pressure relief duct seals, airlock door seals, fuelling machine hoses, and cable penetrations. For each of these components, the design requirements, technical specifications and component testing procedures are compared with applicable standards. Information on actual and recommended monitoring and maintenance methods is presented. Operational and environmental stressors are identified. Component failure modes, causes and frequencies are described, as well as the remedial action taken. Many different elastomers are used in CANDU plants, for many different applications. Standards and manufacturers' recommendations are not consistent and may vary from one component to another. Accordingly, the monitoring, maintenance and replacement practices tend to vary from one application to another, and may also be different at different stations. Recommendations are given in this report for improved monitoring and maintenance, in an attempt to provide more consistency in approach. A summary of some experiences with elastomers from non-Canadian sources is contained in the last section. 125 refs

  13. Desktop Severe Accident Graphic Simulator Module for CANDU6 : PSAIS

    Energy Technology Data Exchange (ETDEWEB)

    Park, S. Y.; Song, Y. M. [Korea Atomic Energy Research Institute, Daejeon (Korea, Republic of)

    2015-10-15

    The ISAAC ((Integrated Severe Accident Analysis Code for CANDU Plant) code is a system level computer code capable of performing integral analyses of potential severe accident progressions in nuclear power plants, whose main purpose is to support a Level 2 probabilistic safety assessment or severe accident management strategy developments. The code has the capability to predict a severe accident progression by modeling the CANDU6- specific systems and the expected physical phenomena based on the current understanding of the unique accident progressions. The code models the sequence of accident progressions from a core heatup, pressure tube/calandria tube rupture after an uncovery from inside and outside, a relocation of the damaged fuel to the bottom of the calandria, debris behavior in the calandria, corium quenching after a debris relocation from the calandria to the calandria vault and an erosion of the calandria vault concrete floor, a hydrogen burn, and a reactor building failure. Along with the thermal hydraulics, the fission product behavior is also considered in the primary system as well as in the reactor building.

  14. Quality control of CANDU6 fuel element in fabrication process

    International Nuclear Information System (INIS)

    To enhance the fine control over all aspects of the production process, improve product quality, fuel element fabrication process for CANDU6 quality process control activities carried out by professional technical and management technology combined mode, the quality of the fuel elements formed around CANDU6 weak links - - end plug , and brazing processes and procedures associated with this aspect of strict control, in improving staff quality consciousness, strengthening equipment maintenance, improved tooling, fixtures, optimization process test, strengthen supervision, fine inspection operations, timely delivery carry out aspects of the quality of information and concerns the production environment, etc., to find the problem from the improvement of product quality and factors affecting the source, and resolved to form the active control, comprehensive and systematic analysis of the problem of the quality management concepts, effectively reducing the end plug weld microstructure after the failure times and number of defects zirconium alloys brazed, improved product quality, and created economic benefits expressly provided, while staff quality consciousness and attention to detail, collaboration department, communication has been greatly improved and achieved very good management effectiveness. (authors)

  15. Future CANDU nuclear power plant design requirements document executive summary

    Energy Technology Data Exchange (ETDEWEB)

    Lee, Duk Su; Chang, Woo Hyun; Lee, Nam Young [Korea Atomic Energy Research Institute, Daeduk (Korea, Republic of); Usmani, S.A. [Atomic Energy of Canada Ltd., Toronto (Canada)

    1996-03-01

    The future CANDU Requirements Document (FCRED) describes a clear and complete statement of utility requirements for the next generation of CANDU nuclear power plants including those in Korea. The requirements are based on proven technology of PHWR experience and are intended to be consistent with those specified in the current international requirement documents. Furthermore, these integrated set of design requirements, incorporate utility input to the extent currently available and assure a simple, robust and more forgiving design that enhances the performance and safety. The FCRED addresses the entire plant, including the nuclear steam supply system and the balance of the plant, up to the interface with the utility grid at the distribution side of the circuit breakers which connect the switchyard to the transmission lines. Requirements for processing of low level radioactive waste at the plant site and spent fuel storage requirements are included in the FCRED. Off-site waste disposal is beyond the scope of the FCRED. 2 tabs., 1 fig. (Author) .new.

  16. Shielding calculations for spent CANDU fuel transport cask

    International Nuclear Information System (INIS)

    CANDU spent fuel discharged from the reactor core contains Pu, so, a special attention must be focussed into two directions: tracing for the fuel reactivity in order to prevent critical mass formation and personnel protection during the spent fuel manipulation. Shielding analyses, an essential component of the nuclear safety, take into account the difficulties occurred during the manipulation, transport and storage of spent fuel bundles, both for personnel protection and impact on the environment. The main objective here consists in estimations on radiation doses in order to reduce them under specified limit values. In order to perform the shielding calculations for the spent fuel transport cask three different codes were used: XSDOSE code and MORSE-SGC code, both incorporated in the SCALE4.4a system, and PELSHIE-3 code, respectively. As source of radiation one spent standard CANDU fuel bundle was used. All the geometrical and material data, related to the transport casks, were considered according to the shipping cask type B model, whose prototype has been realized and tested in the Institute for Nuclear Research Pitesti. The radial gamma dose rates estimated to the cask wall and in air, at different distances from the cask, are presented together with a comparison between the dose rates values obtained by all three recipes of shielding calculations. (authors)

  17. Generic validation of computer codes used in safety analyses of CANDU power plants

    International Nuclear Information System (INIS)

    Since the 1960s, the CANDU industry has been developing and using scientific computer codes, validated according to the quality-assurance practices of the day, for designing and analyzing CANDU power plants. To provide a systematic framework for the validation work done to date and planned for the future, the industry has decided to adopt the methodology of validation matrices, similar to that developed by the Nuclear Energy Agency of the Organization for Economic Co-operation and Development for Light Water Reactors (LWR). Specialists in six scientific disciplines are developing the matrices for CANDU plants, and their progress to date is presented. (author)

  18. Integrity Assessment of CANDU Spent Fuel During Interim Dry Storage in MACSTOR

    International Nuclear Information System (INIS)

    This paper presents an assessment of the integrity of CANDU spent fuel during dry storage in MACSTOR. Based on review of the safety requirements for sheath integrity during dry storage, a fuel temperature limit for spent CANDU fuel stored in MACSTOR is specified. The spent fuel conditions prior to, and during dry storage are assessed. The safety margin for spent CANDU fuel stored in MACSTOR is assessed against various failure mechanisms using the probabilistic estimation approach derived from US LWR fuel data set. (author)

  19. Identification of Optimal Path in Power System Network Using Bellman Ford Algorithm

    OpenAIRE

    S.hemalatha; P. Valsalal

    2012-01-01

    Power system network can undergo outages during which there may be a partial or total blackout in the system. In that condition, transmission of power through the optimal path is an important problem in the process of reconfiguration of power system components. For a given set of generation, load pair, there could be many possible paths to transmit the power. The optimal path needs to consider the shortest path (minimum losses), capacity of the transmission line, voltage stability, priority o...

  20. Project planning and scheduling techniques for the CANDU programme - an overview

    International Nuclear Information System (INIS)

    The energy crisis and higher costs have imposed the need for tighter control of completion time for the construction of CANDU nuclear power plants. System procedures and techniques to meet this challenge are described

  1. The Study of Nuclear Fuel Cycle Options Based On PWR and CANDU Reactors

    International Nuclear Information System (INIS)

    The study of nuclear fuel cycle options based on PWR and CANDU type reactors have been carried out. There are 5 cycle options based on PWR and CANDU reactors, i.e.: PWR-OT, PWR-OT, PWR-MOX, CANDU-OT, DUPIC, and PWR-CANDU-OT options. While parameters which assessed in this study are fuel requirement, generating waste and plutonium from each cycle options. From the study found that the amount of fuel in the DUPIC option needs relatively small compared the other options. From the view of total radioactive waste generated from the cycles, PWR-MOX generate the smallest amount of waste, but produce twice of high level waste than DUPIC option. For total plutonium generated from the cycle, PWR-MOX option generates smallest quantity, but for fissile plutonium, DUPIC options produce the smallest one. It means that the DUPIC option has some benefits in plutonium consumption aspects. (author)

  2. Fuel bundle geometry and composition influence on coolant void reactivity reduction in ACR and CANDU reactors

    International Nuclear Information System (INIS)

    It is very well known that the CANDU reactor has positive Coolant Void Reactivity (CVR), which is most important criticisms about CANDU. The most recent innovations based on using a thin absorbent Hafnium shell in the central bundle element were successfully been applied to the Advanced CANDU Reactor (ACR) project. The paper's objective is to analyze elementary lattice cell effects in applying such methods to reduce the CVR. Three basic fuel designs in their corresponding geometries were chosen to be compared: the ACR-1000TM, the RU-43 (developed in INR Pitesti) and the standard CANDU fuel. The bundle geometry influence on void effect was also evaluated. The WIMS calculations proved the Hafnium absorber suitability (in the latest 'shell design') to achieve the negative CVR target with great accuracy for the ACR-1000 fuel bundle design than for the other two projects. (authors)

  3. Development of a best estimate auditing code for CANDU thermal hydraulic safety analysis

    Energy Technology Data Exchange (ETDEWEB)

    Chung, B.D.; Lee, W.J.; Lim, H.S. [Korea Atomic Energy Research Institute, Taejon (Korea)

    1999-04-01

    The main purpose of this study is to develop a thermal hydraulic auditing code for the CANDU reactor, modifying the model of existing PWR auditing tool, i.e. RELAP5/MOD3. This scope of project is a second step of the whole project, and focus to the implementation of CANDU models based on the previous study. FORTRAN 90 language have been used for the development of RELAP5.MOD3/CANDU PC version. For the convenience of the previous Workstation users, the FOTRAN 77 version has been coded also and implanted into the original RELAP5 source file. The verification of model implementation has been performed through the simple verification calculations using the CANDU version. 6 refs., 15 figs., 7 tabs. (Author)

  4. Licensing evaluation of CANDU-PHW nuclear power plants relative to U.S. regulatory requirements

    International Nuclear Information System (INIS)

    Differences between the U.S. and Canadian approach to safety and licensing are discussed. U.S. regulatory requirements are evaluated as regards their applicability to CANDU-PHW reactors; vice-versa the CANDU-PHW reactor is evaluated with respect to current Regulatory Requirements and Guides. A number of design modifications are proposed to be incorporated into the CANDU-PHW reactor in order to facilitate its introduction into the U.S. These modifications are proposed solely for the purpose of maintaining consistency within the current U.S. regulatory system and not out of a need to improve the safety of current-design CANDU-PHW nuclear power plants. A number of issues are identified which still require resolution. Most of these issues are concerned with design areas not (yet) covered by the ASME code. (author)

  5. Development of a best estimate auditing code for CANDU thermal hydraulic safety analysis

    International Nuclear Information System (INIS)

    The main purpose of this study is to develop a thermal hydraulic auditing code for the CANDU reactor, modifying the model of existing PWR auditing tool, i.e. RELAPS/MOD3. This scope of project is a second step of the whole project, and focus to the implementation of CANDU models based on the previous study. FORTRAN 90 language have been used for the development of RELAPS/MOD3/CANDU PC version. For the convenience of the previous Workstation users, the FOTRAN 77 version has been coded also and implanted into the original RELAPS source file. The verification of model implementation has been performed through the simple verification calculations using the CANDU version

  6. Development of the CANDU high-burnup fuel design/analysis technology

    International Nuclear Information System (INIS)

    This report contains all the information related to the development of the CANDU advanced fuel, so-called CANFLEX-NU, which is composed of 43 elements with natural uranium fuel. Also, it contains the compatibility study of CANFLEX-RU which is considered as a CANDU high burnup fuel. This report describes the mechanical design, thermalhydraulic and safety evaluations of CANFLEX fuel bundle. (author). 38 refs., 24 tabs., 74 figs

  7. Proceedings of the fifth international conference on CANDU fuel. V.1,2

    Energy Technology Data Exchange (ETDEWEB)

    Lau, J.H. [ed.

    1997-07-01

    The First International Conference on CANDU Fuel was held in Chalk River in 1986. The CANDU Fuel community has gathered every three years since. The papers presented include topics on international experience, CANFLEX fuel bundles, Fuel design, Fuel modelling, Manufacturing and Quality assurance, Fuel performance and Safety, Fuel cycles and Spent Fuel management. Volume One was published in advance of the conference and Volume Two was printed after the conference.

  8. Proceedings of the fifth international conference on CANDU fuel. V.1,2

    International Nuclear Information System (INIS)

    The First International Conference on CANDU Fuel was held in Chalk River in 1986. The CANDU Fuel community has gathered every three years since. The papers presented include topics on international experience, CANFLEX fuel bundles, Fuel design, Fuel modelling, Manufacturing and Quality assurance, Fuel performance and Safety, Fuel cycles and Spent Fuel management. Volume One was published in advance of the conference and Volume Two was printed after the conference

  9. Preliminary evaluation of licensing issues associated with U.S.-sited CANDU-PHW nuclear power plants

    International Nuclear Information System (INIS)

    The principal safety-related characteristics of current CANDU-PHW power plants are described, and a distinction between those characteristics which are intrinsic to the CANDU-PHW system and those that are not is presented. An outline is given of the main features of the Canadian safety and licensing approach. Differences between the U.S. and Canadian approach to safety and licensing are discussed. Some of the main results of the safety analyses, routinely performed for CANDU-PHW reactors, are presented. U.S.-NRC General Design Criteria are evaluated as regards their applicability to CANDU-PHW reactors; vice-versa the CANDU-PHW reactor is evaluated with respect to its conformance to the U.S.-NRC General Design Criteria. A number of design modifications are proposed to be incorporated into the CANDU-PHW reactor in order to facilitate its introduction into the U.S

  10. Thermalhydraulic characteristics for fuel channels using burnable poison in the CANDU reactor

    International Nuclear Information System (INIS)

    The power coefficient is one of the most important physics parameters governing nuclear reactor safety and operational stability, and its sign and magnitude have a significant effect on the safety and control characteristics of the power reactor. Recently, for an equilibrium CANDU core, the power coefficient was reported to be slightly positive when newly developed Industry Standard Tool set reactor physics codes were used. Therefore, it is required to find a new way to effectively decrease the positive power coefficient of CANDU reactor without seriously compromising the economy. In order to make the power coefficient of the CANDU reactor negative at the operating power, Roh et al. have evaluated the various burnable poison (BP) materials and its loading scheme in terms of the fuel performance and reactor safety characteristics. It was shown that reactor safety characteristics can be greatly improved by the use of the BP in the CANDU reactor. However, the previous study has mainly focused on the safety characteristics by evaluating the power coefficient for the fuel channel using BP in the CANDU reactor. Together with the safety characteristics, the economic performance is also important in order to apply the newly designed fuel channel to the power plant. In this study, the economic performance has been evaluated by analyzing the thermal hydraulic characteristics for the fuel channel using BP in the CANDU reactor

  11. Development of CANDU Spent Fuel Disposal Concepts for the Improvement of Disposal Efficiency

    International Nuclear Information System (INIS)

    There are two types of spent fuels generated from nuclear power plants, CANDU type and PWR type. PWR spent fuels which include a lot of reusable material can be considered to be recycled. CANDU spent fuels are considered to directly disposed in deep geological formation, since they have little reusable material. In this study, based on the Korean Reference spent fuel disposal System(KRS) which is to dispose both PWR and CANDU spent fuels, the more effective CANDU spent fuel disposal systems have been developed. To do this, the disposal canister has been modified to hold the storage basket which can load 60 spent fuel bundles. From these modified disposal canisters, the disposal systems to meet the thermal requirement for which the temperature of the buffer materials should not be over have been proposed. These new disposals have made it possible to introduce the concept of long term storage and retrievability and that of the two-layered disposal canister emplacement in one disposal hole. These disposal concepts have been compared and analyzed with the KRS CANDU spent fuel disposal system in terms of disposal effectiveness. New CANDU spent fuel disposal concepts obtained in this study seem to improve thermal effectiveness, U-density, disposal area, excavation volume, and closure material volume up to 30 - 40 %.

  12. Subchannel analysis of CANDU 37-element fuel bundles

    International Nuclear Information System (INIS)

    The subchannel analysis codes COBRA-IV and ASSERT-4 have been used to predict the mass and enthalpy imbalance within a CANDU 37-element fuel channel under various system conditions. The objective of this study was to assess the various capabilities of the ASSERT code and highlight areas where further validation or development may be needed. The investigation indicated that the ASSERT code has all the basic models required to accurately predict the flow and enthalpy imbalance for complex rod bundles. The study also showed that the code modelling of void drift and diffusion requires refinement to some coefficients and that further validation is needed at high flow rate and high void fraction conditions, where ASSERT and COBRA are shown to predict significantly different trends. The results of a recent refinement of ASSERT modelling are also discussed

  13. A model for fission product distribution in CANDU fuel

    International Nuclear Information System (INIS)

    This paper describes a model to estimate the distribution of active fission products among the UO2 grains, grain-boundaries, and the free void spaces in CANDU fuel elements during normal operation. This distribution is required for the calculation of the potential release of activity from failed fuel sheaths during a loss-of-coolant accident. The activity residing in the free spaces (''free'' inventory) is available for release upon sheath rupture, whereas relatively high fuel temperatures and/or thermal shock are required to release the activity in the grain boundaries or grains. A preliminary comparison of the model with the data from in-reactor sweep-gas experiments performed in Canada yields generally good agreement, with overprediction rather than under prediction of radiologically important isotopes, such as I131. The model also appears to generally agree with the ''free'' inventory release calculated using ANS-5.4. (author)

  14. Integrated control centre concepts for CANDU power plants

    International Nuclear Information System (INIS)

    The size and complexity of nuclear power plants has increased significantly in the last 20 years. There is general agreement that plant safety and power production can be enhanced if more operational support systems that are significantly different from the ones based on the more conventional technologies used in plant control rooms. In particular, artificial intelligence and related technologies will play a major role in the development of innovative methods for information processing and presentation. These technologies must be integrated into the overall management and control philosophy of the plant and not be treated as vehicles to implement point solutions. The underlying philosophy behind our approach is discussed in this paper. Operator support systems will integrate into the overall control philosophy by complementing the operator. Four support systems are described; each is a prototype of a system being considered for the CANDU 3 control centre

  15. Ultrasonic measurement method of calandria tube sagging in CANDU reactor

    International Nuclear Information System (INIS)

    Calandria tube wrapping each pressure tube is one of the key structural components of CANDU reactor (calandria) which is consisted of many pressure tubes containing nuclear fuel assemblies. As the calandria tube (made of zirconium alloy) is sagging due to its thermal and irradiation creep during the plant operation, it possibly contacts with liquid injection nozzle crossing beneath the calandria tube, which subsequently results in difficulties on the safe operation. It is therefore necessary to check the gap for the confirmation of no contacts between the two tubes, calandria tube and liquid inject ion tube, with a proper measure during the life of plant. In this study, an ultrasonic measurement method was selected among several methods investigated. The ultrasonic device being developed for the measurement of the gap was introduced and its preliminary performance test results were presented here

  16. Wireless Sensor Network Path Optimization Based on Hybrid Algorithm

    OpenAIRE

    Zeyu Sun; Li, Zhenping

    2013-01-01

    One merit of genetic algorithm is fast overall searching, but this algorithm usually results in low efficiency because of large quantities of redundant codes. The advantages of ant colony algorithm are strong suitability and good robustness while its disadvantages are tendency to stagnation, slow speed of convergence. Put forward based on improved ant colony algorithm for wireless sensor network path optimization approach will first need to pass the data in the shortest path for transmission,...

  17. Optimized Robot Path Planning Using Parallel Genetic Algorithm Based on Visible Midpoint

    Directory of Open Access Journals (Sweden)

    Motahar Reza

    2016-07-01

    Full Text Available An analysis is made for optimized path planning for mobile robot by using parallel genetic algorithm. The parallel genetic algorithm (PGA is applied on the visible midpoint approach to find shortest path for mobile robot. The hybrid ofthese two algorithms provides a better optimized solution for smooth and shortest path for mobile robot. In this problem, the visible midpoint approach is used to make the effectiveness for avoiding local minima. It gives the optimum paths which are always consisting on free trajectories. But the proposedhybrid parallel genetic algorithm converges very fast to obtain the shortest route from source to destination due to the sharing of population. The total population is partitioned into a number subgroups to perform the parallel GA. The master thread is the center of information exchange and making selection with fitness evaluation.The cell to cell crossover makes the algorithm significantly good. The problem converges quickly with in a less number of iteration.

  18. Applications of ASTEC integral code on a generic CANDU 6

    Energy Technology Data Exchange (ETDEWEB)

    Radu, Gabriela, E-mail: gabriela.radu@nuclear.ro [Institute for Nuclear Research, Campului 1, 115400 Mioveni, Arges (Romania); Prisecaru, Ilie [Power Engineering Department, University “Politehnica” of Bucharest, 313 Splaiul Independentei, Bucharest (Romania)

    2015-05-15

    Highlights: • Short overview of the models included in the ASTEC MCCI module. • MEDICIS/CPA coupled calculations for a generic CANDU6 reactor. • Two cases taking into account different pool/concrete interface models. - Abstract: In case of a hypothetical severe accident in a nuclear power plant, the corium consisting of the molten reactor core and internal structures may flow onto the concrete floor of containment building. This would cause an interaction between the molten corium and the concrete (MCCI), in which the heat transfer from the hot melt to the concrete would cause the decomposition and the ablation of the concrete. The potential hazard of this interaction is the loss of integrity of the containment building and the release of fission products into the environment due to the possibility of a concrete foundation melt-through or containment over-pressurization by the gases produced from the decomposition of the concrete or by the inflammation of combustible gases. In the safety assessment of nuclear power plants, it is necessary to know the consequences of such a phenomenon. The paper presents an example of application of the ASTECv2 code to a generic CANDU6 reactor. This concerns the thermal-hydraulic behaviour of the containment during molten core–concrete interaction in the reactor vault. The calculations were carried out with the help of the MEDICIS MCCI module and the CPA containment module of ASTEC code coupled through a specific prediction–correction method, which consists in describing the heat exchanges with the vault walls and partially absorbent gases. Moreover, the heat conduction inside the vault walls is described. Two cases are presented in this paper taking into account two different heat transfer models at the pool/concrete interface and siliceous concrete. The corium pool configuration corresponds to a homogeneous configuration with a detailed description of the upper crust.

  19. Ultrasonic crack-tip diffraction in CANDU reactor pressure tubes

    International Nuclear Information System (INIS)

    Currently there is no reliable method of measuring defect depths in CANDU reactor pressure tubes. The demonstrated success of crack-tip diffraction (or time-of-flight-testing) in round-robins on thick components has promoted an interest in this technique. In CANDU reactors, pressure tubes are effectively accessible only from the inside. Development work has concentrated on outside surface defects using 45 degree shear waves in contrast to the longitudinal waves usually used for testing thick components with this technique. Due to the small wall thickness of the pressure tubes (4.2 mm) and the typical sizes of defects of interest (0.15 mm or greater), frequencies of the order of 20 MHz are being used. A further complication comes from the orientation of the defects, which may be at any angle in pressure tubes. Initial studies have been performed on a series of outside surface notches and slots, plus a real fatigue crack. This crack was on the inside surface, so the technique required measuring this defect's depth from the outside. Initial results are encouraging. Even without signal processing, crack-tip diffracted signals were detectable from all but very large (2.5 mm) and very small (less than 0.076 mm) notches. Errors in estimates of defect depths were typically less than 0.1 mm for all the notches, and the results were consistent. Measurements on the fatigue crack showed similar random errors, though there appeared to be a deterministic error of about 0.1 mm as well

  20. Bounds for the traveling salesman paths of two-dimensional modular lattices

    OpenAIRE

    Pausinger, Florian

    2016-01-01

    We present tight upper and lower bounds for the traveling salesman path through the points of two-dimensional modular lattices. We use these results to bound the traveling salesman path of two-dimensional Kronecker point sets. Our results rely on earlier work on shortest vectors in lattices as well as on the strong convergence of Jacobi-Perron type algorithms.

  1. An analysis to determine industry's preferred option for an initial generic reliability database for CANDU

    Energy Technology Data Exchange (ETDEWEB)

    Komljenovic, D. [Hydro Quebec, Montreal, Quebec (Canada)], E-mail: komljenovic.dragan@hydro.qc.ca; Chan, E. [Bruce Power, Tiverton, Ontario (Canada); Ganguli, S. [Ontario Power Generation, Ontario (Canada); Wu, J. [Atomic Energy of Canada Limited, Mississauga, Ontario (Canada); Parmar, R. [Nuclear Safety Solutions Ltd., Toronto, Ontario (Canada)

    2008-07-01

    The paper presents a multi-attribute analysis approach that was used to choose the industry's preferred option in developing a generic reliability database for CANDU. The Risk and Reliability Working Group (sponsored by CANDU Owners Group - Nuclear Safety Committee - COG NSC) was faced with the decision to assess in depth the following four options: a) Use External Data Base Only; b) Full CANDU generic database (All Utilities); c) CANDU Specific plus External Generic Databases; d) Ontario Power Generation (OPG)/ Bruce Power (BP) Experience Only. Nine decision criteria were utilized to rank the proposed options (alternatives). The Analytic Hierarchy Process (AHP) was used in carrying out the ranking process. (author)

  2. Thorium-Based Fuels Preliminary Lattice Cell Studies for Candu Reactors

    International Nuclear Information System (INIS)

    The choice of nuclear power as a major contributor to the future global energy needs must take into account acceptable risks of nuclear weapon proliferation, in addition to economic competitiveness, acceptable safety standards, and acceptable waste disposal options. Candu reactors offer a proven technology, safe and reliable reactor technology, with an interesting evolutionary potential for proliferation resistance, their versatility for various fuel cycles creating premises for a better utilization of global fuel resources. Candu reactors impressive degree of fuel cycle flexibility is a consequence of its channel design, excellent neutron economy, on-power refueling, and simple fuel bundle. These features facilitate the introduction and exploitation of various fuel cycles in Candu reactors in an evolutionary fashion. The main reasons for our interest in Thorium-based fuel cycles have been, globally, to extend the energy obtainable from natural Uranium and, locally, to provide a greater degree of energy self-reliance. Applying the once through Thorium (OTT) cycle in existing and advanced Candu reactors might be seen as an evaluative concept for the sustainable development both from the economic and waste management points of view. Two Candu fuel bundles project will be used for the proposed analysis, namely the Candu standard fuel bundle with 37 fuel elements and the CANFLEX fuel bundle with 43 fuel elements. Using the Canadian proposed scheme - loading mixed ThO2-SEU CANFLEX bundles in Candu 6 reactors - simulated at lattice cell level led to promising conclusions on operation at higher fuel burnups, reduction of the fissile content to the end of the cycle, minor actinide content reduction in the spent fuel, reduction of the spent fuel radiotoxicity, presence of radionuclides emitting strong gamma radiation for proliferation resistance benefit. The calculations were performed using the lattice codes WIMS and Dragon (together with the corresponding nuclear data

  3. Thermal fatigue screening criteria for identifying susceptible piping components in CANDU stations

    Energy Technology Data Exchange (ETDEWEB)

    Schefski, C.; Chen, Q.; Pentecost, S. [Atomic Energy of Canada Limited, Chalk River, Ontario (Canada)

    2011-07-01

    In December 1987, a fatigue failure in a non-isolable section of a safety injection line at the Farley-2 plant prompted the U.S. Nuclear Regulatory Commission (NRC) to issue Bulletin 88-08 requiring that U.S. utilities review all non-isolable branch lines to determine if they are susceptible to thermal fatigue. The thermal fatigue incident at Farley-2 was caused by stresses in the pipe wall resulting from large-scale temperature fluctuations. Shortly after the Farley-2 event, several other incidents with through-wall cracks due to thermal fatigue had occurred in plant subsystems and piping configurations similar to the Farley-2 safety injection line. Thermal fatigue cracks have also occurred in piping configurations with different geometries, such as drain, residual heat removal, and shutdown cooling suction lines in various pressurized water reactors (PWR) and boiling water reactors (BWR). Thermal fatigue, caused by local thermal stratification phenomena, has received significant attention in the PWR and BWR communities in the past two decades. Although CANDU stations have experienced relatively few thermal fatigue failures; the impact of this known fatigue mechanism for CANDU designs has not been rigorously assessed. Screening and evaluation methodology, which has been developed by Electric Power Research Institute (EPRI) to identify locations susceptible to thermal cycling in PWR systems, has recently been modified under a CANDU Owners Group (COG) project for application in CANDU piping systems. This paper describes a new software tool for evaluating locations susceptible to thermal fatigue in CANDU piping systems in an effort to avoid failures that lead to costly plant shutdowns. The software, combined with engineering judgement, will assist CANDU station staff to focus their inspections on key components, therefore reducing dose, time and cost during outages. Computational Fluid Dynamics (CFD) was used to form the basis for expanding the range of validity in

  4. Integrated evolution of the medium power CANDU{sup MD} reactors; Evolution integree des reacteurs CANDU{sup MD} de moyenne puissance

    Energy Technology Data Exchange (ETDEWEB)

    Nuzzo, F. [AECL Accelerators, Kanata, ON (Canada)

    2002-07-01

    The aim of this document is the main improvements of the CANDU reactors in the economic, safety and performance domains. The presentation proposes also other applications as the hydrogen production, the freshening of water sea and the bituminous sands exploitation. (A.L.B.)

  5. Radiological Characteristics of decommissioning waste from a CANDU reactor

    Energy Technology Data Exchange (ETDEWEB)

    Cho, Dong Keun; Choi, Heui Joo [Korea Atomic Energy Research Institute, Daejeon (Korea, Republic of); Ahmed, Rizwan; Heo, Gyun Young [Dept. of Nuclear Engineering, Kyung Hee University, Yongin (Korea, Republic of)

    2011-11-15

    The radiological characteristics for waste classification were assessed for neutron-activated decommissioning wastes from a CANDU reactor. The MCNP/ORIGEN2 code system was used for the source term analysis. The neutron flux and activation cross-section library for each structural component generated by MCNP simulation were used in the radionuclide buildup calculation in ORIGEN2. The specific activities of the relevant radionuclides in the activated metal waste were compared with the specified limits of the specific activities listed in the Korean standard and 10 CFR 61. The time-average full-core model of Wolsong Unit 1 was used as the neutron source for activation of in-core and ex-core structural components. The approximated levels of the neutron flux and cross-section, irradiated fuel composition, and a geometry simplification revealing good reliability in a previous study were used in the source term calculation as well. The results revealed the radioactivity, decay heat, hazard index, mass, and solid volume for the activated decommissioning waste to be 1.04 x 10{sup 16} Bq, 2.09 x 10{sup 3} W, 5.31 x 10{sup 14} m{sup 3}-water, 4.69 x 10{sup 5} kg, and 7.38 x 10{sup 1} m{sup 3}, respectively. According to both Korean and US standards, the activated waste of the pressure tubes, calandria tubes, reactivity devices, and reactivity device supporters was greater than Class C, which should be disposed of in a deep geological disposal repository, whereas the side structural components were classified as low- and intermediate-level waste, which can be disposed of in a land disposal repository. Finally, this study confirmed that, regardless of the cooling time of the waste, 15% of the decommissioning waste cannot be disposed of in a land disposal repository. It is expected that the source terms and waste classification evaluated through this study can be widely used to establish a decommissioning/disposal strategy and fuel cycle analysis for CANDU reactors.

  6. Application of microprocessor based technology in CANDU Stations

    International Nuclear Information System (INIS)

    In early 80s, absence of more efficient, cost effective, reliable control hardware was experienced by the nuclear industry. Usage of microprocessor based technology was not prevalent in the nuclear industry due to lack of experience and infancy of the new technology at that time. In 1985, microprocessor based technology, 'Chameleon micro DCI Controllers' manufactured by Fischer and Porter was the 1st application of such technology in any safety related applications in a CANDU Station. The application was for In-Core LOCA logic in Emergency Coolant Injection System (ECIS) modification in Pickering A Nuclear Station. This was followed by use of the same hardware for modification of 'Dump-Arrest' logic for shut-down system in Pickering A in 1986. Other applications were 'Heat Transport Pump Trip Logic' in Bruce A in 1989. The hardware performed very well and far exceeded its predicted availability during the last 22 years of operation. In early 90's Power House Emergency Venting system used 22 micro DCI controllers for Pickering A and B Stations. The use of microprocessor based technology helped meeting the timing requirements of initiating Powerhouse Emergency Venting within 3 seconds of a steam break accident in reactor auxiliary bay. Development of digital trip meter was undertaken in 1991 to solve human-factors related issue of interpretation of HT system saturation trip margin as the analog indicator lacked accuracy and resolution. This was a significant milestone in use of digital technology in safety related applications in any CANDU Station. The process offered an opportunity of trial use of software standards developed by OPG and AECL for category 1 safety critical software systems. This application generated significant learning experience for OPG (then Ontario Hydro) and the industry. OPG was ahead of other nuclear utilities in implementation of microprocessor based technology in early 80s and 90s. OPG initiatives generated lot of design, maintenance and

  7. Opportunities for CANDU for the Alberta oil sands

    International Nuclear Information System (INIS)

    The Alberta oil sands bitumen deposits comprise of one of the largest sources hydrocarbon in the world, and have emerged as the fastest growing, soon to be dominant, source of crude oil in Canada. The oil industry has made great strides in improving the effectiveness of gathering this resource. In particular, alternatives to open-pit mining have been developed which enable in-site recovery of underground deposits with a minimum of environmental disruption. The main challenge that remains is the large quantity of energy needed in the process of extracting the oil and upgrading it to commercial levels. For a typical in-situ extraction project, about 18% of the energy content of the oil produced is used up in the extraction process, while a further 5% is used in generating hydrogen to upgrade the bitumen to synthetic crude oil. Looking ahead, even as improvements in energy use efficiency, (and hydrocarbon use efficiency) counterbalance the increases in hydrocarbon demand from economic growth (particularly in the developing world), Canada and Alberta recognize that the oil sands resource will be needed, and both support the development of this resource in an environmentally responsible way. The large energy requirement for the oil sands extraction process represents a challenge with regard to both environmental impact and security of supply. The use of natural gas, the current energy supply, has impacts in terms of air quality (via NOX and other emissions) and also represents a large greenhouse gas emissions component. As the oil sands industry expands, the availability of natural gas also becomes a concern, as does price and price stability. With this background, the opportunity for nuclear reactors to provide an economical, reliable, virtually zero-emission source of energy for the oil sands becomes very important. Over the last few years, developments in oil sands extraction technology, and developments in CANDU technology through the Advanced CANDU Reactor, (ACR

  8. Methodology Improvement of Reactor Physics Codes for CANDU Channels Analysis

    Energy Technology Data Exchange (ETDEWEB)

    Kim, Myung Hyun; Choi, Geun Suk; Win, Naing; Aung, Tharndaing; Baek, Min Ho; Lim, Jae Yong [Kyunghee University, Seoul (Korea, Republic of)

    2010-04-15

    As the operational time increase, pressure tubes and calandria tubes in CANDU core encounter inevitably a geometrical deformation along the tube length. A pressure tube may be sagged downward within a calandria tube by creep from irradiation. This event can bring about a problem that is serious in integrity of pressure tube. A measurement of deflection state of in-service pressure tube is, therefore, very important for the safety of CANDU reactor. In this paper, evaluation of impacts on nuclear characteristic due to fuel channel deformation were aimed in order to improve nuclear design tools for concerning the local effects from abnormal deformations. It was known that sagged pressure tube can cause the eccentric configuration of fuel bundles in pressure tube by O.6cm maximum. In this case, adverse pin power distribution and reactivity balance can affect reactor safety under normal and accidental condition. Thermal and radiation-induced creep in pressure tube would expand a tube size. It was known that maximum expansion may be 5% in volume. In this case, more coolant make more moderation in the deformed channel resulting in the increase of reactivity. Sagging of pressure tube did not cause considerable change in K-inf values. However, expansion of the pressure tube made relatively large change in K-inf. Modeling of eccentric and enlarged configuration is not easy in preparation of input geometry at both HELlOS and MCNP. On the other hand, there is no way to consider this deformation in one-dimensional homogenization tool such as WIMS code. The way of handling this deformation was suggested as the correction method of expansion effect by adjusting the number density of coolant. The number density of heavy water coolant was set to be increased as the rate of expansion increase. This correction was done in the intact channel without changing geometry. It was found that this correction was very effective in the prediction of K-inf values. In this study, further

  9. CANDU 6 steam generator thermalhydraulic modeling and simulation

    International Nuclear Information System (INIS)

    The main objective of this paper is to describe the process of accurately modeling the dynamic behavior of CANada Deuterium Uranium 6 (CANDU 6) steam generator and its control algorithm. The mathematical model of the steam generator was developed mainly through differential equations calculated from the physical properties of the components. In addition, empirical modeling techniques were utilized in order to incorporate more complex properties of steam generators. The controller design and resulting controller performance on the actual plant are both strongly dependent on the accuracy of the mathematical model used to describe the plant. During power manoeuvrings, the level control in a steam generator is complicated by the thermal reverse effects known as 'shrink and swell'. This non-linear non-minimum phase characteristic of the steam generators is most challenging to model. Based on various recent publications, the root cause of the deficiencies in model-based controller designs is the fact that the 'shrink and swell' phenomenon is not captured by the plant model. The model developed in this project captures this phenomenon and clearly presents the adverse effect of such characteristic in the performance of conventional controllers. The resulting mathematical model developed in this project is implemented in Simulink, a graphical block diagramming tool offered by MATLAB. In addition to the plant model, the complete control algorithm of the CANDU 6 steam generator is modeled in this project. This model duplicates the actual control strategy applied in the existing steam generators in order to create a realistic interaction between the plant and its control algorithm. The control model is developed in discrete-time in order to accurately simulate the output of the digital controller. The analog model of the plant is dynamically integrated with the digital control model in the Simulink environment creating a realistic presentation of the actual communication

  10. R and D in support of CANDU plant life management

    International Nuclear Information System (INIS)

    One of the keys to the long-term success of CANDUs is a high capacity factor over the station design life. Considerable R and D in underway at AECL to develop technologies for assessing, monitoring and mitigating the effect of plant ageing and for improving plant performance and extending plant life. To achieve longer service life and to realize high capacity factor from CANDU stations, AECL is developing new technologies to enhance fuel channel and steam generator inspection capabilities, to monitor system health, and to allow preventive maintenance and cleaning (e.g., on-line chemical cleaning processes that produce small volumes of wastes). The life management strategy for fuel channels and steam generators requires a program to inspect components on a routine basis to identify mechanisms that could potentially affect fitness-for-service. In the case of fuel channels, the strategy includes inspections for dimensional changes, flaw detection, and deuterium concentration. New techniques are been developed to enhance these inspection capabilities; examples include accurate measurement of the gap between a pressure tube and its calandria tube and rapid full-length inspections of steam generator tubes for all known flaw types. Central to life management of components are Fitness-for-Service Guidelines (FFSG) that have been developed with the CANDU Owners Group (COG) that provide a standardized method to assess the potential for propagation of flaws detected during in-service inspections, and assessment of any change in fracture characteristics of the material. FFSG continue to be improved with the development of new technologies such as the capability to credit relaxation of stresses due to creep and non-rejectable flaws in pressure tubes. Effective management of plant systems throughout their lifetime requires much more than data acquisition and display - it requires that system health is continually monitored and managed. AECL has developed a system Health Monitor

  11. CANDU in-reactor quantitative visual-based inspection techniques

    Science.gov (United States)

    Rochefort, P. A.

    2009-02-01

    This paper describes two separate visual-based inspection procedures used at CANDU nuclear power generating stations. The techniques are quantitative in nature and are delivered and operated in highly radioactive environments with access that is restrictive, and in one case is submerged. Visual-based inspections at stations are typically qualitative in nature. For example a video system will be used to search for a missing component, inspect for a broken fixture, or locate areas of excessive corrosion in a pipe. In contrast, the methods described here are used to measure characteristic component dimensions that in one case ensure ongoing safe operation of the reactor and in the other support reactor refurbishment. CANDU reactors are Pressurized Heavy Water Reactors (PHWR). The reactor vessel is a horizontal cylindrical low-pressure calandria tank approximately 6 m in diameter and length, containing heavy water as a neutron moderator. Inside the calandria, 380 horizontal fuel channels (FC) are supported at each end by integral end-shields. Each FC holds 12 fuel bundles. The heavy water primary heat transport water flows through the FC pressure tube, removing the heat from the fuel bundles and delivering it to the steam generator. The general design of the reactor governs both the type of measurements that are required and the methods to perform the measurements. The first inspection procedure is a method to remotely measure the gap between FC and other in-core horizontal components. The technique involves delivering vertically a module with a high-radiation-resistant camera and lighting into the core of a shutdown but fuelled reactor. The measurement is done using a line-of-sight technique between the components. Compensation for image perspective and viewing elevation to the measurement is required. The second inspection procedure measures flaws within the reactor's end shield FC calandria tube rolled joint area. The FC calandria tube (the outer shell of the FC) is

  12. Development of a best estimate auditing code for CANDU thermal hydraulic safety analysis

    Energy Technology Data Exchange (ETDEWEB)

    Hwang, M. K.; Lee, W. J. [Korea Atomic Energy Research Institute, Taejeon (Korea)

    2001-03-01

    The main purpose of this study is to develop a thermal hydraulic auditing code for the CANDU reactor, modifying the model of existing PWR auditing tool , i.e. RELAP5/MOD3. This scope of project is a fourth step of the whole project, applying the RELAP5/MOD3/CANDU+ version for the real CANDU plant LOCA Analysis and D2O leakage incident. There are three main models under investigation, i.e. Moody critical flow model, flow regime model of horizontal CANDU bundle, and fuel element heatup model when the stratification occurs, especially when CANDU LOCA is tested. Also, for Wolsung unit 1 D2O leakage incident analysis, the plant behavior is predicted with the newly developed version for the first 1000 seconds after onset of the incident, with the main interest aiming for system pressure, level control system, and thermal hydraulic transient behavior of the secondary system. The model applied for this particular application includes heat transfer model of nuclear fuel assembly, decay heat model, and MOV (Motor Operated Valve) model. Finally, the code maintenance work, mainly correcting the known errors, is presented. 12 refs., 26 figs., 3 tabs. (Author)

  13. CANDU fuel research and development in Korea: current status and future prospects

    International Nuclear Information System (INIS)

    The current status and future prospect of CANDU fuel R and D in Korea is always subjected to the consideration of domestic and international environments concerning nuclear safety, nuclear waste, nonproliferation and economy in favor of the arguments from public acceptance, international environments, and utilities. Considering that, at the end of 2000, the procurement of additional CANDU units at the Shin Wolsong site was decided not to proceed, the current and future CANDU fuel R and D would be oriented to the safety and economy of fuel and reactor operations rather than the national strategy of nuclear fuel cycle and reactor programs in Korea. Therefore, the current CANDU advanced fuel R and D programs such as CANFLEX-NU fuel industrialization, CANFLEX-0.9% SEU/RU fuel R and D, and DUPIC fuel cycle development in a laboratory-scale will be continued for the time being as it was. But the R and D of CANDU innovative fuels such as CANFLEX-1.2% ∼ 1.5 % SEU fuel, thorium oxide fuel and DUPIC fuel would have some difficulties to continue in the mid- and long-term if they would not have the justifications in the points of the nonproliferation, economic and safety views of fuel, fuel cycle and reactor. (author)

  14. The advanced CANDU reactor: The next step in safety and economics

    International Nuclear Information System (INIS)

    The Advanced CANDU Reactor (ACRTM) is the 'Next Generation' CANDUR reactor, aimed at safe, reliable power production at a capital cost significantly less than that of current reactors such as the very successful CANDU 6 reactors (e.g., Wolsong 1-4). The Wolsong 1-4 units are being joined by the Qinshan Phase 3 units in China as the current successful examples of CANDU technology. The ACR design builds on this knowledge base, adding a selected group of innovations to obtain substantial cost reduction while retaining a proven design basis. The ACR maximizes the use of components and equipment applications that are well proven through CANDU and other nuclear experience. Joint development of equipment designs and specifications with manufactures has been emphasized. Similarly, the ACR design emphasizes constructability, and takes advantage of inherent CANDU features to enable short project and construction schedules. Overall, the ACR design represents a balance of proven design basis and innovations to give step improvements in safety, reliability and economics. The ACR development program, now well into the detail design stage, includes parallel formal licensing in the USA and Canada

  15. Current status and future prospect of Candu fuel research and development in Korea

    International Nuclear Information System (INIS)

    The current status and future prospect of CANDU fuel R and D in Korea is always subjected to the consideration of domestic and international environments concerning nuclear safety, nuclear waste, non-proliferation and economy in favor of the arguments from public acceptance, international environments, and utilities. Considering that, at the end of 2000, the procurement of additional CANDU units at the Shin Wolsong site was decided not to proceed, the current and future CANDU fuel R and D would be oriented to the safety and economy of fuel and reactor operations rather than the national strategy of nuclear fuel cycle and reactor programs in Korea. Therefore, the current CANDU advanced fuel R and D programs such as CANFLEX-NU fuel industrialization, CANFLEX-0.9% SEU/RU fuel R and D, and DUPIC fuel cycle development in a laboratory-scale will be continued for the time being as it was. But the R and D of CANDU innovative fuels such as CANFLEX- 1.2% ∼ 1.5 % SEU fuel, thorium oxide fuel and DUPIC fuel would have some difficulties to continue in the mid-and long-term if they would not have the justifications in the points of the non-proliferation, economic and safety views of fuel, fuel cycle and reactor. (author)

  16. Development of best estimate auditing code for CANDU thermal hydraulic safety analysis

    Energy Technology Data Exchange (ETDEWEB)

    Hwnag, M

    2001-04-01

    The main purpose of this study is to develop a thermal hydraulic auditing code for the CANDU reactor, modifying the model of existing PWR auditing tool , i.e. RELAP5/MOD3. This scope of project is a fourth step of the whole project, applying the RELAP5/MOD3/CANDU+ version for the real CANDU plant LOCA Analysis and D2O leakage incident. There are three main models under investigation, i.e. Moody critical flow model, flow regime model of horizontal CANDU bundle, and fuel element heatup model when the stratification occurs, especially when CANDU LOCA is tested. Also, for Wolsung unit 1 D2O leakage incident analysis, the plant behavior is predicited with the newly developed version for the first 1000 seconds after onset of the incident, with the main interest aiming for system pressure, level control system, and thermal hydraulic transient behavior of the secondary system. The model applided for this particular application includes heat transfer model of nuclear fuel assembly, decay heat model, and MOV (Motor Operated Valve) model. Finally, the code maintenance work, mainly correcting the known errors, is presented.

  17. Path Sensitization

    Institute of Scientific and Technical Information of China (English)

    赵著行; 闵应骅; 等

    1997-01-01

    For different delay models,the concept of sensitization can be very different.Traditonal concepts of sensitization cannot precisely describe circuit behavior when the input vectors change very fast.Using Boolean process aporoach,this paper presents a new definition of sensitization for arbitrary input waveforms.By this new concept it is found that if the inputs of a combinational circuit can change at any time,and each gate's delay varies within an interval (bounded gate delay model),then every path,which is not necessarily a single topological path,is sensitizable.From the experimental results it can be seen that,all nonsensitizable paths for traditional concepts actually can propagate transitions along them for some input waveforms.However,specified time between input transitions(STBIT) and minimum permissible pulse width(ε)are two major factors to make some paths non-sensitizable.

  18. Estimation of Aging Effects on LOHS for CANDU-6

    Energy Technology Data Exchange (ETDEWEB)

    Yoon, Yong Ki; Moon, Bok Ja; Kim, Seoung Rae [Nuclear Engineering Service and Solution Co. Ltd., Daejeon (Korea, Republic of)

    2014-05-15

    To evaluate the Wolsong Unit 1's capacity to respond to large-scale natural disaster exceeding design, the loss of heat sink(LOHS) accident accompanied by loss of all electric power is simulated as a beyond design basis accident. This analysis is considered the aging effects of plant as the consequences of LOHS accident. Various components of primary heat transport system(PHTS) get aged and some of the important aging effects of CANDU reactor are pressure tube(PT) diametral creep, steam generator(SG) U-tube fouling, increased feeder roughness, and feeder orifice degradation. These effects result in higher inlet header temperatures, reduced flows in some fuel channels, and higher void fraction in fuel channel outlets. Fresh and aged models are established for the analysis where fresh model is the circuit model simulating the conditions at retubing and aged model corresponds to the model reflecting the aged condition at 11 EFPY after retubing. CATHENA computer code[1] is used for the analysis of the system behavior under LOHS condition. The LOHS accident is analyzed for fresh and aged models using CATHENA thermal hydraulic computer code. The decay heat removal is one of the most important factors for mitigation of this accident. The major aging effect on decay heat removal is the reduction of heat transfer efficiency by steam generator. Thus, the channel failure time cannot be conservatively estimated if aged model is applied for the analysis of this accident.

  19. 3D simulation of CANDU reactor regulating system

    International Nuclear Information System (INIS)

    Present paper shows the evaluation of the performance of the 3-D modal synthesis based reactor kinetic model in a closed-loop environment in a MATLAB/SIMULINK based Reactor Regulating System (RRS) simulation platform. A notable advantage of the 3-D model is the level of details that it can reveal as compared to the coupled point kinetic model. Using the developed RRS simulation platform, the reactor internal behaviours can be revealed during load-following tests. The test results are also benchmarked against measurements from an existing (CANDU) power plant. It can be concluded that the 3-D reactor model produces more realistic view of the core neutron flux distribution, which is closer to the real plant measurements than that from a coupled point kinetic model. It is also shown that, through a vectorization process, the computational load of the 3-D model is comparable with that of the 14-zone coupled point kinetic model. Furthermore, the developed Graphical User Interface (GUI) software package for RRS implementation represents a user friendly and independent application environment for education training and industrial utilizations. (authors)

  20. CANDU-OCR power station options and costs

    International Nuclear Information System (INIS)

    This report updates and in some cases expands the technical and economic parameters presented originally in AECL-4441. 'Summary report on the design of a prototypical 500 MWe CANDU-OCR power station.' Updating is desirable owing to the increasing number of inquiries that have been received by Atomic Energy of Canada Ltd. from government agencies and the private sector. Each is exploring the available options in their continuing endeavour to provide sufficient and economical energy. The organic-cooled reactor (OCR) concept is particularly interesting to the oil industry because the high steam pressures it can develop allow it to be used for heavy oil extraction can also be used economically for other large thermal and electrical energy production requirements such as those encountered in district heating schemes, heavy water production and electricity production. The report describes a reference OCR-500 MWe reactor. It includes an overview of organic reactor experience and areas for further development based on 14 years of operating experience with the WR-1 reactor. A discussion of several variations on the reference design is given including estimates of costs for various reactor sizes, enrichments and operating functions. Costs are presented in a form which allow easy comparison with those of competing energy options. (auth)

  1. A framework for operator support systems for CANDU

    International Nuclear Information System (INIS)

    The size and complexity of nuclear power plants has increased significantly in the last 20 years. There is a general agreement that both plant safety and availability can be enhanced by providing the operator with more operational support if than can be done without overloading him/her with unnecessary information. Recent advances in computer technology provide opportunities for implementing operator support systems that are significantly different from the ones based on the more conventional technologies used in plant control rooms. In particular, artificial intelligence and the related technologies will play a major role in the development of innovative methods for information processing and presentation. Our approach to these technologies is that they must be integrated into the overall management and control philosophy of the plant and are not to be treated as vehicles to implement point solutions. The underlying philosophy behind this approach and the design objectives and goals for the CANDU 3 control centre are discussed in this paper. Operator support systems will integrate into the overall control philosophy by complementing the operator. There is also a role for such systems in assisting the operator to be a situation manager, organizing, managing and planning the running of the plant. Four support systems that incorporate the underlying philosophy are described

  2. A CANDU-type small/medium power reactor

    International Nuclear Information System (INIS)

    The assembly known as a CANDU power reactor consists of a number of standardized fuel channels or 'power modules'. Each of these channels produces about 5 thermal megawatts on average. Within practical limitations on fuel enrichment and ultimately on economics, the number of these channels is variable between about 50 and approximately 700. Small reactors suffer from inevitable disadvantages in terms of specific cost of design/construction as well as operating cost. Their natural 'niche' for application is in remote off-grid locations. At the same time this niche application imposes new and strict requirements for staff complement, power system reliability, and so on. The distinct advantage of small reactors arises if the market requires installation of several units in a coordinated installation program - a feature well suited to power requirements in Canada's far North. This paper examines several of the performance requirements and constraints for installation of these plants and presents means for designers to overcome the consequent negative feasibility factors.

  3. A design basis for the development of advanced CANDU control centres

    International Nuclear Information System (INIS)

    The basic design for current CANDU control centres was established in the early 1970's. Plants constructed since then have, for the most part, retained the same basic design. Several factors have led to the need to re-examine CANDU control centre design for plants to be built beyond the year 2000. These factors include the changing roles and responsibilities for the operations staff, an improved understanding of operational issues associated with supervisory control, an improved understanding of human error in operational situations, the opportunity for improved plant performance through the introduction of new technologies, and marketing pressures. This paper describes the proposed design bases for the development of advanced control centres to be implemented in CANDU plants beyond the year 2000. Four areas have been defined covering design goals, design principles, operational bases, and plant functional bases. (author)

  4. Core analysis during transition from 37-element fuel to CANFLEX-NU fuel in CANDU 6

    Energy Technology Data Exchange (ETDEWEB)

    Jeong, Chang Joon; Suk, Ho Chun [Korea Atomic Energy Research Institute, Taejon (Korea, Republic of)

    1998-12-31

    An 1200-day time-dependent fuel-management for the transition from 37-element fuel to CANFLEX-NU fuel in a CANDU 6 reactor has been simulated to show the compatibility of the CANFLEX-NU fuel with the reactor operation. The simulation calculations were carried out with the RFSP code, provided by cell averaged fuel properties obtained from the POWDERPUFS-V code. The refueling scheme for both fuels was an eight bundle shift at a time. The simulation results show that the maximum channel and bundle powers were maintained below the license limit of the CANDU 6. This indicates that the CANFLEX-NU fuel bundle is compatible with the CANDU 6 reactor operation during the transition period. 3 refs., 2 figs., 1 tab. (Author)

  5. Estimation of radiation doses characterizing CANDU spent fuel transport and intermediate dry storage

    International Nuclear Information System (INIS)

    Shielding analyses are an essential component of the nuclear safety. The estimations of radiation doses in order to reduce them under specified limitation values is the main task here. In the last decade, a general trend to raise the discharge fuel burnup has been world wide registered for both operating reactors and future reactor projects. For CANDU type reactors, one of the most attractive solutions seems to be SEU fuels utilization. The goal of this paper is to estimate CANDU spent fuel photon dose rates at the shipping cask/storage basket wall and in air, at different distances from the cask/ basket, for two different fuel projects, after a defined cooling period in the NPP pools. Spent fuel inventories and photon source profiles are obtained by means of ORIGEN-S code. The shielding calculations have been performed by using Monte Carlo MORSE-SGC code. A comparison between the two types of CANDU fuels has been also performed. (authors)

  6. Evaluation the coolant void reactivity of assemblies of CANDU-6 lattices

    International Nuclear Information System (INIS)

    It is known that the coolant void reactivity (CVR) is positive in an isolated CANDU-6 fuel cell. Here we will attempt to evaluate the CVR for a heterogeneous assembly of CANDU-6 cells using the code DRAGON. Because the existing version of DRAGON has inherent geometry limitations, CANDU-6 assembly calculations cannot be performed in the exact geometry. Accordingly, an approximate model for the geometry must be considered. Here, the model we propose consists in replacing the annular fuel pins by equivalent square fuel pins. This model can be used to calculate the effect of homogeneous or heterogeneous draining of the coolant in a single cell. It will also be used to evaluate the effect of fine mesh discretization at the corner of the lattices on cell eigenvalue as well as the CVR for the checkerboard voiding of a 2 x 2 assembly of cells. (author)

  7. An investigation into the relationship between local and global power excursions in CANDU

    International Nuclear Information System (INIS)

    If a reactor exhibits large neutronic decoupling of one core region from another, it may be able to sustain localized power excursions. If such an excursion is too localized, there may be no in-core detector close enough to detect it promptly. To confirm that CANDU reactors are unlikely to support local power excursions, we selected a credible local reactivity-insertion mechanism in the CANDU 600 and calculated the resulting neutron flux transient with a three-dimensional model. A coupled neutronics-thermohydraulics simulation of the transient was performed. The transient was subdivided into appropriate time steps, and iteration between the neutronics and thermohydraulics calculations was carried out at each step, so that the proper distribution of thermohydraulic feedback reactivity was obtained. The calculation shows that, with credible reactivity insertions, the neutronic characteristics of CANDU reactors do not allow local power excursions to occur without a comparable global power increase. The latter would not escape detection by the protective systems

  8. Simulation of CANDU Fuel Behaviour into In-Reactor LOCA Tests

    International Nuclear Information System (INIS)

    The purpose of this work is to simulate the behaviour of an instrumented, unirradiated, zircaloy sheathed UO2 fuel element assembly of CANDU type, subjected to a coolant depressurization transient in the X-2 pressurized water loop of the NRX reactor at the Chalk River Nuclear Laboratories in 1983. The high-temperature transient conditions are such as those associated with the onset of a loss of coolant accident (LOCA). The data and the information related to the experiment are those included in the OECD/NEA-IFPE Database (IFPE/CANDU-FIO-131 NEA-1783/01). As tool for this simulation is used the TRANSURANUS fuel performance code, developed at ITU, Germany, along with the corresponding fabrication and in-reactor operating conditions specific of the CANDU PHWR fuel. The results, analyzed versus the experimental ones, are encouraging and perfectible. (author)

  9. Path planning strategies for autonomous ground vehicles

    Science.gov (United States)

    Gifford, Kevin Kent

    Several key issues involved with the planning and executing of optimally generated paths for autonomous vehicles are addressed. Two new path planning algorithms are developed, and examined, which effectively minimize replanning as unmapped hazards are encountered. The individual algorithms are compared via extensive simulation. The search strategy results are implemented and tested using the University of Colorado's autonomous vehicle test-bed, RoboCar, and results show the advantages of solving the single-destination all-paths problem for autonomous vehicle path planning. Both path planners implement a graph search methodology incorporating dynamic programming that solves the single-destination shortest-paths problem. Algorithm 1, termed DP for dynamic programming, searches a state space where each state represents a potential vehicle location in a breadth-first fashion expanding from the goal to all potential start locations in the state space. Algorithm 2, termed DP*, couples the heuristic search power of the well-known A* search procedure (Nilsson-80) with the dynamic programming principle applied to graph searching to efficiently make use of overlapping subproblems. DP* is the primary research contribution of the work contained within this thesis. The advantage of solving the single-destination shortest-paths problem is that the entire terrain map is solved in terms of reaching a specified goal. Therefore, if the robot is diverted from the pre-planned path, an alternative path is already computed. The search algorithms are extended to include a probabilistic approach using empirical loss functions to incorporate terrain map uncertainties into the path considering terrain planning process. The results show the importance of considering terrain uncertainty. If the map representation ignores uncertainty by marking any area with less than perfect confidence as unpassable or assigns it the worst case rating, then the paths are longer than intuitively necessary. A

  10. Photon dose rates estimation for CANDU spent fuel transport and intermediate dry storage

    International Nuclear Information System (INIS)

    The nuclear energy world wide development is accompanied by huge quantities of spent nuclear fuel accumulation. Shielding analyses are an essential component of the nuclear safety, the estimations of radiation doses in order to reduce them under specified limit values being the main task here. According to IAEA data, more than 10 millions packages containing radioactive materials are annually world wide transported. The radioactive material transport safety must be carefully settled. Last decade, both for operating reactors and future reactor projects, a general trend to raise the discharge fuel burnup has been world wide registered. For CANDU type reactors, one of the most attractive solutions seems to be SEU fuel utilization. In the paper there are estimated the CANDU spent fuel photon dose rates at the shipping cask/ storage basket wall for two different fuel projects after a defined cooling period in the NPP pools. The CANDU fuel projects considered were the CANDU standard 37 rod fuel bundle with natural UO2 and SEU fuels. In order to obtain radionuclide inventory and irradiated fuel characteristics, ORIGEN-S code has been used. The spent fuel characteristics are presented, comparatively, for both types of CANDU fuels. By means of the same code the photon source profiles have been calculated. The shielding calculations both for spent fuel transport and intermediate storage have been performed by using Monte Carlo MORSE-SGC code. The ORIGEN-S and MORSE-SGC codes are both included in ORNL's SCALE 4.4a program package. A photon dose rates comparison between the two types of CANDU fuels has been also performed, both for spent fuel transport and intermediate dry storage. (authors)

  11. CANDU reactors, their regulation in Canada, and the identification of relevant NRC safety issues

    International Nuclear Information System (INIS)

    Atomic Energy of Canada, Limited (AECL) and its subsidiary in the US, are considering submitting the CANDU 3 design for standard design certification under 10 CFR Part 52. CANDU reactors are pressurized heavy water power reactors. They have some substantially different safety responses and safety systems than the LWRs that the commercial power reactor licensing regulations of the US Nuclear Regulatory Commission (NRC) have been developed to deal with. In this report, the authors discuss the basic design characteristics of CANDU reactors, specifically of the CANDU 3 where possible, and some safety-related consequences of these characteristics. The authors also discuss the Canadian regulatory provisions, and the CANDU safety systems that have evolved to satisfy the Canadian regulatory requirements as of December 1992. Finally, the authors identify NRC regulations, mainly in 10 CFR Parts 50 and 100, with issues for CANDU 3 reactor designs. In all, eleven such regulatory issues are identified. They are: (1) the ATWS rule (section 50.62); (2) station blackout (section 50.63); (3) conformance with Standard Review Plan (SRP); (4) appropriateness of the source term (section 50.34(f) and section 100.11); (5) applicability of reactor coolant pressure boundary (RCPB) requirements (section 50.55a, etc); (6) ECCS acceptance criteria (section 50.46)(b); (7) combustible gas control (section 50.44, etc); (8) power coefficient of reactivity (GDC 11); (9) seismic design (Part 100); (10) environmental impacts of the fuel cycle (section 51.51); and (11) (standards section 50.55a)

  12. CANDU advanced fuel R and D programs for 1997 - 2006 in Korea

    Energy Technology Data Exchange (ETDEWEB)

    Suk, H.C.; Yang, M.S.; Sim, K-S.; Yoo, K.J. [Korea Atomic Energy Research Inst., Yusong, Taejon (Korea, Republic of)

    1997-07-01

    KAERI has a comprehensive product development program of CANFLEX and DUPIC fuels to introduce them into CANDU reactors in Korea and a clear vision of how the product will evolve over the next 10 years. CANDU reactors are not the majority of nuclear power plants in Korea, but they produce significant electricity to contribute Korea's economic growth as well as to satisfy the need for energy. The key targets of the development program are safety enhancement, reduction of spent fuel volume, and economic improvements, using the inherent characteristics and advantages of CANDU technology The CANFLEX and DUPIC R and D programs are conducted currently under the second stage of Korea's Nuclear Energy R and D Project as a national mid- and long-term program over the next 10 years from 1997 to 2006. The specific activities of the programs have taken account of the domestic and international environment concerning on non-proliferation in the Peninsula of Korea. As the first of the development products in the short-term, the CANFLEX-NU fuel will be completely developed jointly by KAERI/AECL and will be useful for the older CANDU-6 Wolsong unit 1. As the second product, the CANFLEX-0.9 % equivalent SEU fuel is expected to be completely developed within the next decade. It will be used in CANDU-6 reactors in Korea immediately after the development, if the existing RU in the world is price competitive with natural uranium. The DUPIC R and D program, as a long term program, is expected to demonstrate the possibility of use of used PWR fuel in CANDU reactors in Korea during the next 10 years. The pilot scale fabrication facility would be completed around 2010. (author)

  13. Global path planning approach based on ant colony optimization algorithm

    Institute of Scientific and Technical Information of China (English)

    WEN Zhi-qiang; CAI Zi-xing

    2006-01-01

    Ant colony optimization (ACO) algorithm was modified to optimize the global path. In order to simulate the real ant colonies, according to the foraging behavior of ant colonies and the characteristic of food, conceptions of neighboring area and smell area were presented. The former can ensure the diversity of paths and the latter ensures that each ant can reach the goal. Then the whole path was divided into three parts and ACO was used to search the second part path. When the three parts pathes were adjusted,the final path was found. The valid path and invalid path were defined to ensure the path valid. Finally, the strategies of the pheromone search were applied to search the optimum path. However, when only the pheromone was used to search the optimum path, ACO converges easily. In order to avoid this premature convergence, combining pheromone search and random search, a hybrid ant colony algorithm(HACO) was used to find the optimum path. The comparison between ACO and HACO shows that HACO can be used to find the shortest path.

  14. An experimental study of a flashing-driven CANDU moderator cooling system

    International Nuclear Information System (INIS)

    The results of an experimental study to investigate the feasibility of using a passive flashing-driven natural circulation loop for CANDU-reactor moderator heat rejection are presented. A scaled loop was constructed and tested at conditions approximating those of a CANDU calandria cooling system. The results showed that stable loop operation was possible at simulated powers approaching normal full power. At lower powers, flow oscillations occurred as the flow in the hot-leg periodically changed from two-phase to single-phase. The results from earlier numerical predictions using the CATHENA thermalhydraulics code showed good qualitative agreement with the experimental results. (author). 6 refs., 11 figs

  15. Application of the SASSI soil structure interaction method to CANDU 6 NPP seismic analysis

    International Nuclear Information System (INIS)

    The standard CANDU 6 NPP has been conservatively qualified for a Design Basis Earthquake (DBE) peak horizontal ground acceleration of 0.2 g. Currently there are potential opportunities for siting the CANDU 6 at higher seismicity sites. In order to be able to extend the use of a standardized design for sites with higher seismicity than the standard plant, various design options, including the use of the SASSI Soil Structure Interaction (SSI) analysis method, are being evaluated. This paper presents the results of a study to assess the potential benefits from utilization of the SASSI computer program and the use of more realistic damping ratios for the structures

  16. Application of the SASSI soil structure interaction method to CANDU 6 NPP seismic analysis

    Energy Technology Data Exchange (ETDEWEB)

    Ricciuti, R.A.; Elgohary, M.; Usmani, S.A. [Atomic Energy of Canada Ltd., Mississauga, Ontario (Canada)

    1996-12-01

    The standard CANDU 6 NPP has been conservatively qualified for a Design Basis Earthquake (DBE) peak horizontal ground acceleration of 0.2 g. Currently there are potential opportunities for siting the CANDU 6 at higher seismicity sites. In order to be able to extend the use of a standardized design for sites with higher seismicity than the standard plant, various design options, including the use of the SASSI Soil Structure Interaction (SSI) analysis method, are being evaluated. This paper presents the results of a study to assess the potential benefits from utilization of the SASSI computer program and the use of more realistic damping ratios for the structures.

  17. Development of the safety regulatory guides on the refurbishment for the CANDU reactors

    Energy Technology Data Exchange (ETDEWEB)

    Kim, M. W.; Chin, T. E.; Rho, H. Y.; Park, H. B.; Yeom, H. G.; Hwang, G. M.; Hwang, B. G.; Seo, Y. H.; Lee, J. W. [Korea Power Engineering Co. Inc., Yongin (Korea, Republic of)

    2007-02-15

    In this study, requirements and standards concerned with safety performance for CANDU type reactors and review guidelines for facilities and performance concerned with refurbishment of major facilities such as pressure tubes, calandria tubes, and feeder popes were developed. To develop review guidelines for facilities and performance review concerned with refurbishment of CANDU reactors, review activities related with refurbishment and performance were categorized into designing and planning of equipments, removal and refurbishment of equipment, and confirmation of installation and inspection. As a result, following detailed review guidelines concerned with refurbishment of pressure tubes, calandria tubes, and feeder pipes in directly or indirectly referring to FSAR, design manual, startup-test manual were developed.

  18. Physics and Control Assessment of AN 850 Mw(e) - Leu-Candu Reactor.

    Science.gov (United States)

    Barbone, Michelangelo

    The physics and control assessment of an 850 MW(e) Low Enriched Uranium CANDU Pressurized Heavy Water (LEU -CANDU-PHW) reactor constitute the major objective of this thesis. The use of Low Enriched Uranium fuel in the present CANDU nuclear power generating stations is recognized as economically beneficial due to reduced fuelling costs. The LEU fuel cycle is also recognized as a stepping stone to transit from the present CANDU-PHW once-through natural Uranium cycle to advanced cycles such as those based on Plutonium recycle, once-through Th + U-235 cycle, Thorium with Uranium recycle and net U-235 feed, Thorium with Uranium recycle and Plutonium feed. However, although the use of Low Enriched Uranium in the present CANDU-PHW reactor has economic advantages, and it would act as a technical bridge between the present cycle and advanced cycles, technical problems in different areas of reactor physics and fuel management were anticipated. The present thesis research work adresses the areas of reactor physics, fuel management, and control (in particular, the spatial control of large CANDU-PHW reactors). The main conclusions that have been drawn following these studies are as follows: (1) The Low Enriched Uranium Cycle is feasible in a CANDU-PHW reactor of present design and provided that: (a) The enrichment is kept relatively low (that is, about 1% instead of 0.711%); (b) the number of bundles to be replaced at every refuelling operation is about one-half that of the natural Uranium fuel case; (c) The channels are refuelled in the same direction as the coolant. (2) The response of an LEU-CANDU-PHW reactor to reactivity perturbation such as single- and two-channel refuelling operation, shim transient, shutdown-start-up transient with enrichment levels of 0.9% and 1.2% is essentially very similar {provided that certain conditions in (1) are respected} to that of the natural uranium reactor core case without any reactor reoptimization. The general behaviour of the reactor

  19. Analysis of a homogenous and heterogeneous stylized half core of a CANDU reactor

    Energy Technology Data Exchange (ETDEWEB)

    EL-Khawlani, Afrah [Physics Department, Sana' a (Yemen); Aziz, Moustafa [Nuclear and radiological regulatory authority, Cairo (Egypt); Ismail, Mahmud Yehia; Ellithi, Ali Yehia [Cairo Univ. (Egypt). Faculty of Science

    2015-03-15

    The MCNPX (Monte Carlo N-Particle Transport Code System) code has been used for modeling and simulation of a half core of CANDU (CANada Deuterium-Uranium) reactor, both homogenous and heterogeneous model for the reactor core are designed. The fuel is burnt in normal operation conditions of CANDU reactors. Natural uranium fuel is used in the model. The multiplication factor for homogeneous and heterogeneous reactor core is calculated and compared during fuel burnup. The concentration of both uranium and plutonium isotopes are analysed in the model. The flux and power distributions through channels are calculated.

  20. A probabilistic method for leak-before-break analysis of CANDU reactor pressure tubes

    Energy Technology Data Exchange (ETDEWEB)

    Puls, M.P.; Wilkins, B.J.S.; Rigby, G.L. [Whiteshell Labs., Pinawa (Canada)] [and others

    1997-04-01

    A probabilistic code for the prediction of the cumulative probability of pressure tube ruptures in CANDU type reactors is described. Ruptures are assumed to result from the axial growth by delayed hydride cracking. The BLOOM code models the major phenomena that affect crack length and critical crack length during the reactor sequence of events following the first indications of leakage. BLOOM can be used to develop unit-specific estimates of the actual probability of pressure rupture in operating CANDU reactors and supplement the existing leak before break analysis.

  1. A study for good regulation of the CANDU's in Korea

    Energy Technology Data Exchange (ETDEWEB)

    Oh, Se Ki; Shin, Y. K.; Joe, S. K.; Kim, J. S.; Yu, Y. J.; Lee, Y. J. [Ajou Univ., Suwon (Korea, Republic of)

    2002-03-15

    The objective of project is to derive the policy recommendations to improve the efficiency of CANDU plants regulation. These policy recommendations will eventually contribute to the upgrading of Korean nuclear regulatory system and safety enhancement. During the second phase of this 2 years study, following research activities were done. Review the technical basis and framework of the new Canadian Regulation System and IAEA. Analysis on the interview of Wolsung operation staffs to identify important safety issues and regulation problems experienced at operation. Providing a plan of CANDU regulation system enhancement program.

  2. Application of principal component analysis for the diagnosis of neutron overpower system oscillations in CANDU reactors

    Energy Technology Data Exchange (ETDEWEB)

    Nasimi, Elnara; Gabbar, Hossam A., E-mail: Hossam.gabbar@uoit.ca

    2014-04-01

    Highlights: • Diagnosis of neutron overpower protection (NOP) in CANDU reactors. • Accurate reactor detector modeling. • NOP detectors response analysis. • Statistical methods for quantitative analysis of NOP detector behavior. - Abstract: An accurate fault modeling and troubleshooting methodology is required to aid in making risk-informed decisions related to design and operational activities of current and future generation of CANDU{sup ®} designs. This paper attempts to develop an explanation for the unanticipated detector response and overall behavior phenomena using statistical methods to compliment traditional engineering analysis techniques. Principal component analysis (PCA) methodology is used for pattern recognition using a case study of Bruce B zone-control level oscillations.

  3. Feasible advanced fuel cycle options for CANDU reactors in the Republic of Korea

    International Nuclear Information System (INIS)

    Taking into account the view points on nuclear safety, nuclear waste, non-proliferation and economics from the public, international environment, and utilities, the SEU/RU and DUPIC fuel cycles would be feasible options of advanced fuel cycles for CANDU-PHWRs in the Republic of Korea in the mid- and long-terms, respectively. Comparing with NU fuel, 0.9 % or 1.2 % SEU fuel would increase fuel burnup and hence reduce the spent fuel arisings by a factor of 2 or 3, and also could reduce CANDU fuel cycle costs by 20 to 30%. RU offers similar benefits as 0.9% SEU and is very attractive due to the significantly improved fuel cycle economics, substantially increased burnups, large reduction in fuel requirements as well as in spent fuel arisings. For RU use in a CANDU reactor, re-enrichment is not required. There are 25,000 tes RU produced from reprocessing operations in Europe and Japan, which would theoretically provide sufficient fuel for 500 CANDU 6 reactor-years of operation. According to the physics, thermal-hydraulic and thermal-mechanical assessments of CANFLEX-0.9% RU fuel for a CANDU-6 reactor, the fuel could be introduced into the reactor in a straight-forward fashion. A series of assessments of CANFLEX-DUPIC physics on the compatibility of the fuel design in the existing CANDU 6 reactors has shown that the poisoning of the central element of DUPIC with, for example, natural dysprosium, reduces the void reactivity of the fuel, and that a 2 bundle shift refuelling scheme would be the most appropriate in-core fuel management scheme for a CANDU-6 reactor. The average discharge burnup is ∼15 MWd/kgHE. Although these results have shown promising results for the DUPIC fuel cycle, more in-depth studies are required in the areas of ROP system, large LOCA safety analyses, and so on. The recycling fuel cycles of RU and DUPIC for CANDU are expected to achieve the environmental 3R's (Reduce, Reuse, Recycle) as applied to global energy use in the short- and long

  4. A probabilistic method for leak-before-break analysis of CANDU reactor pressure tubes

    International Nuclear Information System (INIS)

    A probabilistic code for the prediction of the cumulative probability of pressure tube ruptures in CANDU type reactors is described. Ruptures are assumed to result from the axial growth by delayed hydride cracking. The BLOOM code models the major phenomena that affect crack length and critical crack length during the reactor sequence of events following the first indications of leakage. BLOOM can be used to develop unit-specific estimates of the actual probability of pressure rupture in operating CANDU reactors and supplement the existing leak before break analysis

  5. Enhancing the seismic capability of the on-power refueling system of the CANDU reactor

    International Nuclear Information System (INIS)

    The CANDU reactor assembly includes several hundred horizontal fuel channels, each containing twelve fuel bundles, arranged in a square lattice, and supported by the reactor structures. CANDU operates on natural uranium or other low fissile content fuel, and is refueled on-power, with either four or eight fuel bundles in a channel being replaced during each refueling operation. The fueling machines clamp onto the opposite ends of the fuel channel to be refueled. The seismic capacity of this refueling system is evaluated in terms of its dynamic response during an earthquake. This paper describes the approach adopted to enhance the seismic capability of the fueling machine and calandria assembly for earthquakes of O.3g ground acceleration covering a broad range of soil conditions ranging from soft to hard. A detailed, 3-D finite element seismic model of the fueling machine and calandria assembly system is developed to calculate the seismic responses of the structure. Some relatively simple hardware design changes have been considered to increase the seismic capacity of the CANDU 6 reactor. These changes in the fueling machine and calandria assembly of the CANDU 6 reactor are briefly described. They have been incorporated into the finite element seismic model of the system. Most of these design changes have already been considered and implemented in other CANDU reactor projects. The current CANDU 6 reactor design fully meets the requirements of seismic qualification for sites with potential for O.2g ground acceleration where the seismic loads need to be combined with the other design loads for the support and pressure boundary components to demonstrate compliance with the applicable Code requirements. In the present study it is demonstrated that, with relatively simple hardware changes, the fueling machine and calandria assembly of the CANDU 6 reactor can withstand earthquakes of O.3g ground acceleration. Based on the current study and some preliminary analysis of the

  6. Path Dependence

    DEFF Research Database (Denmark)

    Madsen, Mogens Ove

    Begrebet Path Dependence blev oprindelig udviklet inden for New Institutionel Economics af bl.a. David, Arthur og North. Begrebet har spredt sig vidt i samfundsvidenskaberne og undergået en udvikling. Dette paper propagerer for at der er sket så en så omfattende udvikling af begrebet, at man nu k...... tale om 1. og 2. generation af Path Dependence begrebet. Den nyeste udvikling af begrebet har relevans for metodologi-diskusionerne i relation til Keynes...

  7. Path Creation

    DEFF Research Database (Denmark)

    Karnøe, Peter; Garud, Raghu

    2012-01-01

    This paper employs path creation as a lens to follow the emergence of the Danish wind turbine cluster. Supplier competencies, regulations, user preferences and a market for wind power did not pre-exist; all had to emerge in a tranformative manner involving multiple actors and artefacts. Competenc......This paper employs path creation as a lens to follow the emergence of the Danish wind turbine cluster. Supplier competencies, regulations, user preferences and a market for wind power did not pre-exist; all had to emerge in a tranformative manner involving multiple actors and artefacts...

  8. Dry storage of irradiated CANDU fuel at Pickering NGS

    International Nuclear Information System (INIS)

    Ontario Hydro generates about 86 million MW-h/year from its 20 nuclear CANDU reactors. The combination of a large generating capacity and relatively low fuel burn-up means that Ontario Hydro must manage very large volume of its used fuel. Irradiated fuel bays at Pickering NGS will be full by mid 1995. Additional storage capacity will be required by this date for the station to continue operation. Several long term storage options to supplement existing on-site facilities were studied. The dry storage system, based on the modular storage container, as an option, was found to be economical and operationally simple. The dry storage facility at Pickering NGS is planned to provide additional on-site storage capacity for fuel generated from 1994 to the end of the station's operating life (year 2025). This paper describes the design and operation of the Dry Storage System at Ontario Hydro's Pickering Nuclear Power Generating Station. The facility is planned as a two phased project. Phase I will provide a storage space for 700 dry storage containers (268,800 fuel bundles) or about 12 years of station's operation. Phase II will have the capacity for additional 800 containers (307,200 fuel bundles) and will provide storage until station decommissioning in 2025. Seventy containers will be required annually to meet storage requirements of the station's operation at 100% capacity factor. Staff of six persons will be required to operate the facility. Normal operation includes activities such as receiving and commissioning new containers, loading them with 4 modules of used fuel in the bays, draining and drying the cavity, decontaminating the container surface and lid welding. A helium leak test is performed before the container is placed in the storage. (author) 6 refs., 6 tabs., 7 figs

  9. COMET solutions to whole core CANDU-6 benchmark problems

    International Nuclear Information System (INIS)

    In this paper, the coarse mesh transport code COMET is used to solve CANDU-6 benchmark problems in two and three dimensional geometry. These problems are representative of a simplified quarter core reactor model. The COMET solutions, the core eigenvalue and the fuel pin fission density distribution, are compared to those from the Monte Carlo code MCNP using two-group cross sections. COMET decomposes the core volume into a set of non-overlapping sub-volumes (coarse meshes) and uses pre-computed heterogeneous response functions that are constructed using Legendre polynomials as boundary conditions to generate a user selected whole core solution (e.g., the core eigenvalue and fuel pin fission density distribution). These response functions are pre-computed by performing fixed source calculations with a modified version of MCNP in only the unique coarse meshes in the core. Reference solutions are calculated by MCNP5 with a two-group energy library generated with the HELIOS lattice code. In the 2-D problem, the angular current on the coarse mesh interfaces in COMET is expanded to 2. order in both spatial and angular variables. The COMET eigenvalue error is 0.09%. The corresponding average error in the fission density over all 3515 fuel pins is 0.5%. The maximum error observed is 2.0%. For the 3-D case, with 4. order expansion in space and azimuthal angle and 2. order expansion in the cosine of the polar angle, the eigenvalue differs from the reference solution by 0.05%. The average fission density error over the 42180 fuel pins is 0.7% with a maximum error of 3.3%. (authors)

  10. Neutronics-thermalhydraulics coupling in a CANDU SCWR

    Science.gov (United States)

    Adouki, Pierre

    In order to implement new nuclear technologies as a solution to the growing demand for energy, 10 countries agreed on a framework for international cooperation in 2002, to form the Generation IV International Forum (GIF). The goal of the GIF is to design the next generation of nuclear reactors that would be cost effective and would enhance safety. This forum has proposed several types of Generation IV reactors including the Supercritical Water-Cooled Reactor (SCWR). The SCWR comes in two main configurations: pressure vessel SCWR and pressure tube SCWR (PT-SCWR). In this study, the CANDU SCWR (a PT-SCWR) is considered. This reactor is oriented vertically and contains 336 channels with a length of 5 m. The target coolant inlet and outlet temperatures are 350 Celsius and 625 Celsius, respectively. The coolant flows downwards, and the reactor power is 2540 MWth. Various fuel designs have been considered in order not to exceed the linear element rating. However, the dependency between the core power and thermalhydraulics parameters results in the necessity to use a neutronics/thermalhydaulics coupling scheme to determine the core power and the thermalhydraulics parameters. The core power obtained has a power peaking factor of 1.4. The bundle power distribution for all channels has a peak at the third bundle from the inlet, but the value of this peak increases with the channel power. The heat-transfer coefficient and the specific-heat capacity have a peak at the same location in a channel, and this location shifts toward the inlet as the channel power increases. The exit coolant temperature increases with the channel power, while the exit coolant density and pressure decrease with the channel power. Also, higher channel powers lead to higher fuel and cladding temperatures. Moreover, as the coupling method is applied, the effective multiplication factor and the values of thermalhydaulics parameters oscillate as they converge.

  11. Detector response in a CANDU low void reactivity core

    International Nuclear Information System (INIS)

    The response of the in-core flux detectors to the CANFLEX Low-Void-Reactivity Fuel (LVRF) [1] bundles for use in the CANDU reactor at Bruce nuclear generation station has been studied. The study was based on 2 detector types - platinum (Pt)-clad Inconel and pure Inconel detectors, and 2 fuel types - LVRF bundles and natural-uranium (NU) bundles. Both detectors show a decrease of thermal-neutron-flux to total-photon-flux ratio when NU fuel bundles are replaced by LVRF bundles in the reactor core (7% for Inconel and 9% for Pt-clad detectors). The ratio of the prompt component of the net electron current to the total net electron current (PFe) of the detectors however shows a different response. The use of LVRF bundles in place of NU fuel bundles in the reactor core did not change the PFe of the Pt-clad Inconel detector but increased the PFe of the pure Inconel detector by less than 2%. The study shows that the Inconel detector has a larger prompt-detector response than that of the platinum-clad detector; it reacts to the change of fluxes in the reactor core more readily. On the other hand, the Pt-clad detector is less sensitive to perturbations of the neutron-to-gamma ratio. Nevertheless the changes in an absolute sense are minimal; one does not anticipate a change of the flux-monitoring system if the NU fuel bundles are replaced with the CANFLEX LVRF bundles in the core of the Bruce nuclear generating station. (authors)

  12. Safety design of next generation SUI of CANDU stations

    Energy Technology Data Exchange (ETDEWEB)

    Nasimi, Elnara [Faculty of Energy Systems and Nuclear Science, University of Ontario Institute of Technology, 2000 Simcoe St. N., Oshawa, L1H 7K4 ON (Canada); Gabbar, Hossam A., E-mail: hossam.gabbar@uoit.ca [Faculty of Energy Systems and Nuclear Science, University of Ontario Institute of Technology, 2000 Simcoe St. N., Oshawa, L1H 7K4 ON (Canada)

    2013-01-15

    Highlights: Black-Right-Pointing-Pointer Review of current SUI technologies and challenges. Black-Right-Pointing-Pointer Propose a new type of SUI detectors. Black-Right-Pointing-Pointer Propose a new SUI system architecture and layout. Black-Right-Pointing-Pointer Propose implementation procedure for SUI with reduced risks. - Abstract: Due to the age and operating experience of Nuclear Power Plants, equipment ageing and obsolescence has become one of the main challenges that need to be resolved for all systems, structures and components in order to ensure a safe and reliable production of energy. This paper summarizes the research into a methodology for modernization of Start-Up Instrumentation (SUI), both in-core and Control Room equipment, using a new generation of detectors and cables in order to manage obsolescence. The main objective of this research is to develop a new systematic approach to SUI installation/replacement procedure development and optimization. Although some additional features, such as real-time data monitoring and storage/archiving solutions for SUI systems are also examined to take full advantage of today's digital technology, the objectives of this study do not include detailed parametrical studies of detector or system performance. Instead, a number of technological, operational and maintenance issues associated with Start-Up Instrumentation systems at Nuclear Power Plants (NPPs) will be identified and a structured approach for developing a replacement/installation procedure that can be standardized and used across all of the domestic CANDU (Canadian Deuterium Uranium) stations is proposed.

  13. Neural network and genetic algorithm based global path planning in a static environment

    Institute of Scientific and Technical Information of China (English)

    DU Xin; CHEN Hua-hua; GU Wei-kang

    2005-01-01

    Mobile robot global path planning in a static environment is an important problem. The paper proposes a method of global path planning based on neural network and genetic algorithm. We constructed the neural network model of environmental information in the workspace for a robot and used this model to establish the relationship between a collision avoidance path and the output of the model. Then the two-dimensional coding for the path via-points was converted to one-dimensional one and the fitness of both the collision avoidance path and the shortest distance are integrated into a fitness function. The simulation results showed that the proposed method is correct and effective.

  14. Approximating cycles in a shortest basis of the first homology group from point data

    International Nuclear Information System (INIS)

    Inference of topological and geometric attributes of a hidden manifold from its point data is a fundamental problem arising in many scientific studies and engineering applications. In this paper, we present an algorithm to compute a set of cycles from a point data that presumably sample a smooth manifold M subset of Rd. These cycles approximate a shortest basis of the first homology group H1(M) over coefficients in the finite field Z2. Previous results addressed the issue of computing the rank of the homology groups from point data, but there is no result on approximating the shortest basis of a manifold from its point sample. In arriving at our result, we also present a polynomial time algorithm for computing a shortest basis of H1(K) for any finite simplicial complex K whose edges have non-negative weights. (paper)

  15. Shortest Path Algorithm Study on Dijkstra%基于Dijkstra最短路径算法研究

    Institute of Scientific and Technical Information of China (English)

    张明伟

    2010-01-01

    Dijkstra算法是经典的求解单源静态最短路径问题的理论基础,但是在实际应用中存在一些不足之处,影响了算法的效率.本文首先介绍了Dijkstra算法,分析了该算法的优点与缺点,并在此基础上提出求解最短路径在数据存储和搜索上的一种改进算法.

  16. Autonomous Control of Eye Based Electric Wheel Chair with Obstacle Avoidance and Shortest Path Findings Based on Dijkstra Algorithm

    Directory of Open Access Journals (Sweden)

    Kohei Arai

    2011-12-01

    Full Text Available Autonomous Eye Based Electric Wheel Chair: EBEWC control system which allows handicap person (user to control their EWC with their eyes only is proposed. Using EBEWC, user can move to anywhere they want on a same floor in a hospital autonomously with obstacle avoidance with visible camera and ultrasonic sensor. User also can control EBEWC by their eyes. The most appropriate route has to be determined with avoiding obstacles and then autonomous real time control has to be done. Such these processing time and autonomous obstacle avoidance together with the most appropriate route determination are important for the proposed EBEWC. All the required performances are evaluated and validated. Obstacles can be avoided using acquired images with forward looking camera. The proposed EBEWC system allows creation of floor layout map that contains obstacles locations in a real time basis. The created and updated maps can be share by the electric wheel chairs on a same floor of a hospital. Experimental data show that the system allows computer input (more than 80 keys almost perfectly and electric wheel chair can be controlled with human eyes-only safely.

  17. Performance Analysis of Enhanced Interior Gateway Routing Protocol (EIGRP Over Open Shortest Path First (OSPF Protocol with Opnet

    Directory of Open Access Journals (Sweden)

    Anibrika Bright Selorm Kodzo

    2016-05-01

    Full Text Available Due to the increase in the easy accessibility of computers and mobile phones alike, routing has become indispensable in deciding how computes communicate especially modern computer communication networks. This paper presents performance analysis between EIGRP and OSPFP for real time applications using Optimized Network Engineering Tool (OPNET. In order to evaluate OSPF and EIGRP’s performance, three network models were designed where 1st, 2nd and 3rd network models are configured respectively with OSPF, EIGRP and a combination of EIGRP and OSPF. Evaluation of the proposed routing protocols was performed based on quantitative metrics such as Convergence Time, Jitter, End-to-End delay, Throughput and Packet Loss through the simulated network models. The evaluation results showed that EIGRP protocol provides a better performance than OSPF routing protocol for real time applications. By examining the results (convergence times in particular, the results of simulating the various scenarios identified the routing protocol with the best performance for a large, realistic and scalable network.

  18. Destructive Examination of Experimental Candu Fuel Elements Irradiated in TRIGA-SSR Reactor

    International Nuclear Information System (INIS)

    The object of this work is the behaviour of CANDU fuel elements under power cycling conditions. The tests were run in the 14 MW(th) TRIGA-SSR (Steady State Reactor) reactor from Institute for Nuclear Research (INR) Pitesti. zircaloy-4 is the material used for CANDU fuel sheath. The importance of studying its behaviour results from the fact that the mechanical properties of the CANDU fuel sheath suffer modifications during normal and abnormal operation. In the nuclear reactor the fuel elements endure dimensional and structural changes as well as cladding oxidation, hydriding and corrosion. These changes can lead to defects and even to the loss of integrity of the cladding. This paper presents the results of examinations performed in the Post- irradiation Examination Laboratory (PIEL) from INR Pitesti, on samples from a fuel element irradiated in TRIGA-SSR reactor: (i) Dimensional and macrostructural characterization; (ii) Microstructural characterization by metallographic analyses; (iii) Determination of mechanical properties; (iv) Fracture surface analysis by scanning electron microscopy (SEM). The obtained data could be used to evaluate the security, reliability and nuclear fuel performance, and for CANDU fuel improvement. (author)

  19. Post Irradiation Examination of Experomental CANDU Fuel Elements Irradiated in TRIGA-SSR Reactor

    International Nuclear Information System (INIS)

    The object of this work is the behaviour of CANDU fuel elements under power cycling conditions. The tests were run in the 14 MW (th) TRIGA-SSR (Steady State Reactor) reactor from Institute for Nuclear Research (INR) Pitesti. Zircaloy-4 is the material used for CANDU fuel sheath. The importance of studying its behaviour results from the fact that the mechanical properties of the CANDU fuel sheath suffer modifications during normal and abnormal operation. In the nuclear reactor the fuel elements endure dimensional and structural changes as well as cladding oxidation, hydriding and corrosion. These changes can lead to defects and even to the loss of integrity of the cladding. This paper presents the results of examinations performed in the Post Irradiation Examination Laboratory (PIEL) from INR Pitesti, on samples from a fuel element irradiated in TRIGA-SSR reactor: (i) Dimensional and macrostructural characterization; (ii) Gamma scanning and tomography; (iii) Measurement of pressure, volume and isotopic composition of fission gas; (iv) Microstructural characterization by metallographic analyses; (v) Determination of mechanical properties; amd (vi) Fracture surface analysis by scanning electron microscopy (SEM). The obtained data could be used to evaluate the security, reliability and nuclear fuel performance, and for CANDU fuel improvement. (author)

  20. Load following tests on CANDU-type fuel elements in TRIGA research reactor of INR Pitesti

    International Nuclear Information System (INIS)

    Two load following (LF) tests on CANDU-type fuel elements were performed in the TRIGA Research Reactor of INR Pitesti, where the tests were designed to represent fuel in a CANDU reactor operating in a load following regime. In the first LF test the designated '78R' fuel element successfully experienced 367 power cycles, mostly between 23 and 56 kW/m average linear power. In the second LF test, developed under INR-AECL co-operation, the fuel element designated as 'ME01' withstood 200 power cycles from 27 to 54 kW/m average linear power, as well as additional ramps due to reactor trips and restarts during the test period. This experimental program is ongoing at INR Pitesti. Both LF tests were simulated with finite element computer codes in order to evaluate Stress Corrosion Fatigue (SCF) of the cladding arising from expansion and contraction of the pellets. New LF tests are planned to be performed in order to establish the limits and capabilities for CANDU fuel in LF conditions. This paper presents the results of the LF tests performed in the INR TRIGA Research Reactor compared with the analytical assessment for SCF conditions and their relation to CANDU fuel performance in LF conditions. (author)

  1. Fuel Temperature Characteristics for Fuel Channels using Burnable Poison in the CANDU reactor

    International Nuclear Information System (INIS)

    Although the CANFLEX RU fuel bundle loaded 11.0 wt% Er2O3 are originally designed focused on the safety characteristics, the fuel temperature characteristics is revealed to be not deteriorated but rather is slightly enhanced by the decreased fuel temperature in the outer ring compared with that of standard 37 fuel bundle. Recently, for an equilibrium CANDU core, the power coefficient was reported to be slightly positive when newly developed Industry Standard Tool set reactor physics codes were used. Therefore, it is required to find a new way to effectively decrease the positive power coefficient of CANDU reactor without seriously compromising the economy. In order to make the power coefficient of the CANDU reactor negative at the operating power, Roh et al. have evaluated the various burnable poison (BP) materials and its loading scheme in terms of the fuel performance and reactor safety characteristics. It was shown that reactor safety characteristics can be greatly improved by the use of the BP in the CANDU reactor. In a view of safety, the fuel temperature coefficient (FTC) is an important safety parameter and it is dependent on the fuel temperature. For an accurate evaluation of the safety-related physics parameters including FTC, the fuel temperature distribution and its correlation with the coolant temperature should be accurately identified. Therefore, we have evaluated the fuel temperature distribution of a CANFLEX fuel bundle loaded with a burnable poison and compared the standard 37 element fuel bundle and CANFELX-NU fuel bundle

  2. FMDP Reactor Alternative Summary Report: Volume 2 - CANDU heavy water reactor alternative

    International Nuclear Information System (INIS)

    The Department of Energy Office of Fissile Materials Disposition (DOE/MD) initiated a detailed analysis activity to evaluate each of ten plutonium disposition alternatives that survived an initial screening process. This document, Volume 2 of a four volume report, summarizes the results of these analyses for the CANDU reactor based plutonium disposition alternative

  3. Control and instrumentation systems for the 600 MWe CANDU PHW nuclear power plants

    International Nuclear Information System (INIS)

    The control and instrumentation systems for CANDU power plants are designed for high reliability and availabilty to meet stringent safety and operational requirements. To achieve these goals a 'defence-in-depth' design philosophy is employed. The diversely functioning systems designed to satisfy these requirements are described, along with the extensive use of computers for important plant control and man-machine functions

  4. Development of the advanced PHWR technology -Design and analysis of CANDU advanced fuel-

    Energy Technology Data Exchange (ETDEWEB)

    Suk, Hoh Chun; Shim, Kee Sub; Byun, Taek Sang; Park, Kwang Suk; Kang, Heui Yung; Kim, Bong Kee; Jung, Chang Joon; Lee, Yung Wook; Bae, Chang Joon; Kwon, Oh Sun; Oh, Duk Joo; Im, Hong Sik; Ohn, Myung Ryong; Lee, Kang Moon; Park, Joo Hwan; Lee, Eui Joon [Korea Atomic Energy Research Institute, Taejon (Korea, Republic of)

    1995-07-01

    This is the `94 annual report of the CANDU advanced fuel design and analysis project, and describes CANFLEX fuel design and mechanical integrity analysis, reactor physics analysis and safety analysis of the CANDU-6 with the CANFLEX-NU. The following is the R and D scope of this fiscal year : (1) Detail design of CANFLEX-NU and detail analysis on the fuel integrity, reactor physics and safety. (a) Detail design and mechanical integrity analysis of the bundle (b) CANDU-6 refueling simulation, and analysis on the Xe transients and adjuster system capability (c) Licensing strategy establishment and safety analysis for the CANFLEX-NU demonstration demonstration irradiation in a commercial CANDU-6. (2) Production and revision of CANFLEX-NU fuel design documents (a) Production and approval of CANFLEX-NU reference drawing, and revisions of fuel design manual and technical specifications (b) Production of draft physics design manual. (3) Basic research on CANFLEX-SEU fuel. 55 figs, 21 tabs, 45 refs. (Author).

  5. Monte Carlo Few-Group Constant Generation for CANDU 6 Core Analysis

    Directory of Open Access Journals (Sweden)

    Seung Yeol Yoo

    2015-01-01

    Full Text Available The current neutronics design methodology of CANDU-PHWRs based on the two-step calculations requires determining not only homogenized two-group constants for ordinary fuel bundle lattice cells by the WIMS-AECL lattice cell code but also incremental two-group constants arising from the penetration of control devices into the fuel bundle cells by a supercell analysis code like MULTICELL or DRAGON. As an alternative way to generate the two-group constants necessary for the CANDU-PHWR core analysis, this paper proposes utilizing a B1 theory augmented Monte Carlo (MC few-group constant generation method (B1 MC method which has been devised for the PWR fuel assembly analysis method. To examine the applicability of the B1 MC method for the CANDU 6 core analysis, the fuel bundle cell and supercell calculations are performed using it to obtain the two-group constants. By showing that the two-group constants from the B1 MC method agree well with those from WIMS-AECL and that core neutronics calculations for hypothetical CANDU 6 cores by a deterministic diffusion theory code SCAN with B1 MC method generated two-group constants also agree well with whole core MC analyses, it is concluded that the B1 MC method is well qualified for both fuel bundle cell and supercell analyses.

  6. Experimental validation of Pu-Sm evolution model for CANDU-6 power transients

    International Nuclear Information System (INIS)

    Development of a methodology to evaluate the reactivity produced by Pu-Sm transient, effect displayed after power transients. This methodology allows to predict the behavior of liquid zones with which the fine control of CANDU reactor power is made. With this information, it is easier to foresee the refueling demand after power movements. The comparison with experimental results showed good agreement. (author)

  7. ASSERT-PV 3.2: Advanced subchannel thermalhydraulics code for CANDU fuel bundles

    International Nuclear Information System (INIS)

    Highlights: • Introduction to a new version of the Canadian subchannel code, ASSERT-PV 3.2. • Enhanced models for flow-distribution, CHF and post-dryout heat transfer prediction. • Model changes focused on unique features of horizontal CANDU bundles. • Detailed description of model changes for all major thermalhydraulics models. • Discussion on rationale and limitation of the model changes. - Abstract: Atomic Energy of Canada Limited (AECL) has developed the subchannel thermalhydraulics code ASSERT-PV for the Canadian nuclear industry. The most recent release version, ASSERT-PV 3.2 has enhanced phenomenon models for improved predictions of flow distribution, dryout power and CHF location, and post-dryout (PDO) sheath temperature in horizontal CANDU fuel bundles. The focus of the improvements is mainly on modeling considerations for the unique features of CANDU bundles such as horizontal flows, small pitch to diameter ratios, high mass fluxes, and mixed and irregular subchannel geometries, compared to PWR/BWR fuel assemblies. This paper provides a general introduction to ASSERT-PV 3.2, and describes the model changes or additions in the new version to improve predictions of flow distribution, dryout power and CHF location, and PDO sheath temperatures in CANDU fuel bundles

  8. Data base for a CANDU-PHW operating on a once-through natural uranium cycle

    International Nuclear Information System (INIS)

    This report, prepared for INFCE, describes a standard 600 MW(e) CANDU-PHW reactor operating on a once-through natural uranium fuel cycle. Subsequently, data are given for an extrapolated 1000 MW(e) design (the nominal capacity adopted for the INFCE study) operating on the same fuel cycle. (author)

  9. ASSERT-PV 3.2: Advanced subchannel thermalhydraulics code for CANDU fuel bundles

    Energy Technology Data Exchange (ETDEWEB)

    Rao, Y.F., E-mail: raoy@aecl.ca; Cheng, Z., E-mail: chengz@aecl.ca; Waddington, G.M., E-mail: waddingg@aecl.ca; Nava-Dominguez, A., E-mail: navadoma@aecl.ca

    2014-08-15

    Highlights: • Introduction to a new version of the Canadian subchannel code, ASSERT-PV 3.2. • Enhanced models for flow-distribution, CHF and post-dryout heat transfer prediction. • Model changes focused on unique features of horizontal CANDU bundles. • Detailed description of model changes for all major thermalhydraulics models. • Discussion on rationale and limitation of the model changes. - Abstract: Atomic Energy of Canada Limited (AECL) has developed the subchannel thermalhydraulics code ASSERT-PV for the Canadian nuclear industry. The most recent release version, ASSERT-PV 3.2 has enhanced phenomenon models for improved predictions of flow distribution, dryout power and CHF location, and post-dryout (PDO) sheath temperature in horizontal CANDU fuel bundles. The focus of the improvements is mainly on modeling considerations for the unique features of CANDU bundles such as horizontal flows, small pitch to diameter ratios, high mass fluxes, and mixed and irregular subchannel geometries, compared to PWR/BWR fuel assemblies. This paper provides a general introduction to ASSERT-PV 3.2, and describes the model changes or additions in the new version to improve predictions of flow distribution, dryout power and CHF location, and PDO sheath temperatures in CANDU fuel bundles.

  10. The influence of lattice structure and composition on the coolant void reactivity in CANDU

    International Nuclear Information System (INIS)

    The neutronic mechanisms responsible for the production of positive void reactivity in CANDU lattices are presented. Based on an understanding of these, a method of void reactivity reduction is developed. Calculations show that a zero void reactivity lattice, which requires neutron poison in the fuel and fuel enrichment, is possible. (Author) 1 ref., 8 tabs

  11. A model for coolant void reactivity evaluation in assemblies of CANDU cells

    International Nuclear Information System (INIS)

    Coolant void reactivity is a very important safety parameter in CANDU reactor analysis. Here we evaluate the coolant void reactivity in a 2 x 2 heterogeneous assembly of CANDU cells using the code DRAGON. Since the current version of DRAGON can only treat the coolant void reactivity for a single CANDU cell, an approximate model for the geometry must be considered to perform assembly calculations in a 2 x 2 pattern. The model we propose consists of replacing the annular fuel pins by equivalent square fuel pins. The equivalence between annular fuel pins and square fuel pins is brought about by homogenizing the fuel plus its sheath and subsequently conserving the reaction rates between the two geometries using a SPH equivalence procedure. The approximate CANDU cells constructed using square pins were used to perform the transport calculations in 2 x 2 assembly patterns. In addition, the model was used to evaluate coolant void reactivity in 2 x 2 checkerboard voiding patterns. These calculations reflect more accurately the actual voiding situation being studied. This helps in assessing the effects due to the coupling of neutrons born in one cell to those born in the neighbouring cells

  12. Proceedings of the 1. international conference on CANDU fuel handling systems

    International Nuclear Information System (INIS)

    Besides information on fuel loading and handling systems for CANDU and PHWR reactors, the 25 papers in these proceedings also include some on dry storage, modification to fuel strings at Bruce A, and on the SLAR (spacer location and repositioning) system for finding and moving garter springs. The individual papers have been abstracted separately

  13. FMDP Reactor Alternative Summary Report: Volume 2 - CANDU heavy water reactor alternative

    Energy Technology Data Exchange (ETDEWEB)

    Greene, S.R.; Spellman, D.J.; Bevard, B.B. [and others

    1996-09-01

    The Department of Energy Office of Fissile Materials Disposition (DOE/MD) initiated a detailed analysis activity to evaluate each of ten plutonium disposition alternatives that survived an initial screening process. This document, Volume 2 of a four volume report, summarizes the results of these analyses for the CANDU reactor based plutonium disposition alternative.

  14. Assessment of ASSERT-PV for prediction of post-dryout heat transfer in CANDU bundles

    International Nuclear Information System (INIS)

    Highlights: • Assessment of the new Canadian subchannel code ASSERT-PV 3.2 for PDO sheath temperature prediction. • CANDU 28-, 37- and 43-element bundle PDO experiments. • Prediction improvement of ASSERT-PV 3.2 over previous code versions. • Sensitivity study of the effect of PDO model options. - Abstract: Atomic Energy of Canada Limited (AECL) has developed the subchannel thermalhydraulics code ASSERT-PV for the Canadian nuclear industry. The recently released ASSERT-PV 3.2 provides enhanced models for improved predictions of subchannel flow distribution, critical heat flux (CHF), and post-dryout (PDO) heat transfer in horizontal CANDU fuel channels. This paper presents results of an assessment of the new code version against PDO tests performed during five full-size CANDU bundle experiments conducted between 1992 and 2009 by Stern Laboratories (SL), using 28-, 37- and 43-element bundles. A total of 10 PDO test series with varying pressure-tube creep and/or bearing-pad height were analyzed. The SL experiments encompassed the bundle geometries and range of flow conditions for the intended ASSERT-PV applications for existing CANDU reactors. Code predictions of maximum PDO fuel-sheath temperature were compared against measurements from the SL PDO tests to quantify the code's prediction accuracy. The prediction statistics using the recommended model set of ASSERT-PV 3.2 were compared to those from previous code versions. Furthermore, separate-effects sensitivity studies quantified the contribution of each PDO model change or enhancement to the improvement in PDO heat transfer prediction. Overall, the assessment demonstrated significant improvement in prediction of PDO sheath temperature in horizontal fuel channels containing CANDU bundles

  15. Assessment of ASSERT-PV for prediction of critical heat flux in CANDU bundles

    International Nuclear Information System (INIS)

    Highlights: • Assessment of the new Canadian subchannel code ASSERT-PV 3.2 for CHF prediction. • CANDU 28-, 37- and 43-element bundle CHF experiments. • Prediction improvement of ASSERT-PV 3.2 over previous code versions. • Sensitivity study of the effect of CHF model options. - Abstract: Atomic Energy of Canada Limited (AECL) has developed the subchannel thermalhydraulics code ASSERT-PV for the Canadian nuclear industry. The recently released ASSERT-PV 3.2 provides enhanced models for improved predictions of flow distribution, critical heat flux (CHF), and post-dryout (PDO) heat transfer in horizontal CANDU fuel channels. This paper presents results of an assessment of the new code version against five full-scale CANDU bundle experiments conducted in 1990s and in 2009 by Stern Laboratories (SL), using 28-, 37- and 43-element (CANFLEX) bundles. A total of 15 CHF test series with varying pressure-tube creep and/or bearing-pad height were analyzed. The SL experiments encompassed the bundle geometries and range of flow conditions for the intended ASSERT-PV applications for CANDU reactors. Code predictions of channel dryout power and axial and radial CHF locations were compared against measurements from the SL CHF tests to quantify the code prediction accuracy. The prediction statistics using the recommended model set of ASSERT-PV 3.2 were compared to those from previous code versions. Furthermore, the sensitivity studies evaluated the contribution of each CHF model change or enhancement to the improvement in CHF prediction. Overall, the assessment demonstrated significant improvement in prediction of channel dryout power and axial and radial CHF locations in horizontal fuel channels containing CANDU bundles

  16. Assessment of ASSERT-PV for prediction of critical heat flux in CANDU bundles

    Energy Technology Data Exchange (ETDEWEB)

    Rao, Y.F., E-mail: raoy@aecl.ca; Cheng, Z., E-mail: chengz@aecl.ca; Waddington, G.M., E-mail: waddingg@aecl.ca

    2014-09-15

    Highlights: • Assessment of the new Canadian subchannel code ASSERT-PV 3.2 for CHF prediction. • CANDU 28-, 37- and 43-element bundle CHF experiments. • Prediction improvement of ASSERT-PV 3.2 over previous code versions. • Sensitivity study of the effect of CHF model options. - Abstract: Atomic Energy of Canada Limited (AECL) has developed the subchannel thermalhydraulics code ASSERT-PV for the Canadian nuclear industry. The recently released ASSERT-PV 3.2 provides enhanced models for improved predictions of flow distribution, critical heat flux (CHF), and post-dryout (PDO) heat transfer in horizontal CANDU fuel channels. This paper presents results of an assessment of the new code version against five full-scale CANDU bundle experiments conducted in 1990s and in 2009 by Stern Laboratories (SL), using 28-, 37- and 43-element (CANFLEX) bundles. A total of 15 CHF test series with varying pressure-tube creep and/or bearing-pad height were analyzed. The SL experiments encompassed the bundle geometries and range of flow conditions for the intended ASSERT-PV applications for CANDU reactors. Code predictions of channel dryout power and axial and radial CHF locations were compared against measurements from the SL CHF tests to quantify the code prediction accuracy. The prediction statistics using the recommended model set of ASSERT-PV 3.2 were compared to those from previous code versions. Furthermore, the sensitivity studies evaluated the contribution of each CHF model change or enhancement to the improvement in CHF prediction. Overall, the assessment demonstrated significant improvement in prediction of channel dryout power and axial and radial CHF locations in horizontal fuel channels containing CANDU bundles.

  17. Assessment of ASSERT-PV for prediction of post-dryout heat transfer in CANDU bundles

    Energy Technology Data Exchange (ETDEWEB)

    Cheng, Z., E-mail: chengz@aecl.ca; Rao, Y.F., E-mail: raoy@aecl.ca; Waddington, G.M., E-mail: waddingg@aecl.ca

    2014-10-15

    Highlights: • Assessment of the new Canadian subchannel code ASSERT-PV 3.2 for PDO sheath temperature prediction. • CANDU 28-, 37- and 43-element bundle PDO experiments. • Prediction improvement of ASSERT-PV 3.2 over previous code versions. • Sensitivity study of the effect of PDO model options. - Abstract: Atomic Energy of Canada Limited (AECL) has developed the subchannel thermalhydraulics code ASSERT-PV for the Canadian nuclear industry. The recently released ASSERT-PV 3.2 provides enhanced models for improved predictions of subchannel flow distribution, critical heat flux (CHF), and post-dryout (PDO) heat transfer in horizontal CANDU fuel channels. This paper presents results of an assessment of the new code version against PDO tests performed during five full-size CANDU bundle experiments conducted between 1992 and 2009 by Stern Laboratories (SL), using 28-, 37- and 43-element bundles. A total of 10 PDO test series with varying pressure-tube creep and/or bearing-pad height were analyzed. The SL experiments encompassed the bundle geometries and range of flow conditions for the intended ASSERT-PV applications for existing CANDU reactors. Code predictions of maximum PDO fuel-sheath temperature were compared against measurements from the SL PDO tests to quantify the code's prediction accuracy. The prediction statistics using the recommended model set of ASSERT-PV 3.2 were compared to those from previous code versions. Furthermore, separate-effects sensitivity studies quantified the contribution of each PDO model change or enhancement to the improvement in PDO heat transfer prediction. Overall, the assessment demonstrated significant improvement in prediction of PDO sheath temperature in horizontal fuel channels containing CANDU bundles.

  18. Automated refueling simulations of a CANDU for the exploitation of thorium fuels

    Science.gov (United States)

    Holmes, Bradford

    CANDU nuclear reactors are in a unique circumstance where they are able to utilize and exploit a number of different fuel options to provide power as a utility. Thorium, a fertile isotope found naturally, is one option that should be explored. Thorium is more abundant than uranium, which is the typical fuel in the reactor and the availability of thorium makes nuclear energy desirable to more countries. This document contains the culmination of a project that explores, tests, and analyzes the feasibility of using thorium in a CANDU reactor. The project first develops a set of twodimensional lattice and three dimensional control rod simulations using the DRAGON Version 4 nuclear physics codes. This step is repeated for many concentrations of thorium. The data generated in these steps is then used to determine a functional enrichment of thorium. This is done via a procedural elimination and optimization of certain key parameters including but not limited to average exit burnup and reactivity evolution. For the purposes of this project, an enrichment of 1 % thorium was found viable. Full core calculations were done using the DONJON 4 code. CANFUEL, a program which simulates the refueling operations of a CANDU reactor for this fuel type was developed and ran for a simulation period of one hundred days. The program and the fuel selection met all selected requirements for the entirety of the simulation period. CANFUEL requires optimization for fuel selection before it can be used extensively. The fuel selection was further scrutinized when a reactivity insertion event was simulated. The adjuster rod 11 withdrawal from the core was analyzed and compared to classical CANDU results in order to ensure no significant deviations or unwanted evolutions were encountered. For this case, the simulation results were deemed acceptable with no significant deviations from the classical CANDU case.

  19. MARKETING DATABASES – THE SHORTEST WAY TO CLIENT’S HEART

    Directory of Open Access Journals (Sweden)

    Popa Adela Laura

    2008-05-01

    Full Text Available The aim of this paper is to present the potential which could be offered by managing databases in direct marketing through gathering the information that could offer the shortest and efficient way to the clients needs. The paper includes the necessary steps to make this activity a real success

  20. COMPUTER REALIZATION OF SEARCH TASK OF THE SHORTEST ROUTE WITH THE HELP OF EXCEL AND VBA

    OpenAIRE

    Dorohov, А.

    2008-01-01

    The necessity of the development of simple and accessible to the final users of the applied software for the decision of local optimization tasks of transport technologies has been grounded with the help of the Excel and VBA facilities. The computer task decision and search of the shortest route has been described.

  1. 最短路径算法及其应用探讨%Shoreest Path Algorithm and its Applicatim

    Institute of Scientific and Technical Information of China (English)

    涂海丽

    2011-01-01

    The shortest path algorithm is a very important part in the design of E-map.Starting with the significance of the shortest path research,this paper analysis the basic idea of the shortest path algorithm-Dijkstra algorithm,which based on graph theory,and improved this algorithm,finally,gave the application of the improved algorithms.%电子地图设计中,最短路径算法是其重要的组成部分。本文从最短路径研究的意义入手,分析了基于图论的最短路径算法——Dijkstra算法的基本思想,并在此算法的基础上进行了改进,最后给出了这种改进算法的应用。

  2. Materials performance in CANDU reactors: The first 30 years and the prognosis for life extension and new designs

    International Nuclear Information System (INIS)

    A number of CANDU reactors have now been in-service for more than 30 years, and several are planning life extensions. This paper summarizes the major corrosion degradation operating experience of various out-of-core (i.e., excluding fuel channels and fuel) materials in-service in currently operating CANDU reactors. Also discussed are the decisions that need to be made for life extension of replaceable and non-replaceable components such as feeders and steam generators, and materials choices for new designs, such as the advanced CANDU reactor (ACR) and enhanced CANDU-6. The basis for these choices, including a brief summary of the R and D necessary to support such decisions is provided. Finally we briefly discuss the materials and R and D needs beyond the immediate future, including new concepts to improve plant operability and component reliability

  3. Explicit core-follow simulations for a CANDU 6 reactor fuelled with recovered-uranium CANFLEX bundles

    International Nuclear Information System (INIS)

    Recovered uranium (RU) is a by-product of many light-water reactor (LWR) fuel recycling programs. After fission products and plutonium (Pu) have been removed from spent LWR fuel, RU is left. A fissile content in the RU of 0.9 to 1.0% makes it impossible for reuse in an LWR without re-enrichment, but CANDU reactors have a sufficiently high neutron economy to use RU as fuel. Explicit core-follow simulations were run to analyse the viability of RU as a fuel for existing CANDU 6 cores. The core follow was performed with RFSP, using WIMS-AECL lattice properties. During the core follow, channel powers and bundle powers were tracked to determine the operating envelope for RU in a CANFLEX bundle. The results show that RU fits the operating criteria of a generic CANDU 6 core and is a viable fuel option in CANDU reactors. (author)

  4. Improvement of RELAP5/MOD3.2.2 models for the development of CANDU auditing code

    Energy Technology Data Exchange (ETDEWEB)

    Jung, B. D.; Lee, W. J.; Lim, H. S. [KAERI, Taejon (Korea, Republic of); Bang, Y. S.; Kim, M. W.; Lee, S. H. [KINS, Taejon (Korea, Republic of)

    1999-10-01

    Thermal-hydraulic models of the model improvements of NRC PWR auditing tool , i.e. RELAP5/MOD3, current auditing tool for LWR licensing, have been improved were attempted to develop a than auditingermal hydraulic auditing code for the CANDU. Major in order to identify the thermal hydraulic phenomena for the key CANDU events for key eventswere identified for reactor systems and components. Based on this, the modeling limitation of current RELAP5/MOD3 for CANDU applications were derived and the model improvement areas were identified. By improving these models in the code, RELAP5/MOD3/CANDU version has been developed. The new version was written in FORTRAN90 and its application capability has been verified through the simple verification calculations.

  5. Improvement of RELAP5/MOD3.2.2 models for the development of CANDU auditing code

    International Nuclear Information System (INIS)

    Thermal-hydraulic models of the model improvements of NRC PWR auditing tool , i.e. RELAP5/MOD3, current auditing tool for LWR licensing, have been improved were attempted to develop a than auditingermal hydraulic auditing code for the CANDU. Major in order to identify the thermal hydraulic phenomena for the key CANDU events for key eventswere identified for reactor systems and components. Based on this, the modeling limitation of current RELAP5/MOD3 for CANDU applications were derived and the model improvement areas were identified. By improving these models in the code, RELAP5/MOD3/CANDU version has been developed. The new version was written in FORTRAN90 and its application capability has been verified through the simple verification calculations

  6. Path planning using a tangent graph for mobile robots among polygonal and curved obstacles

    Energy Technology Data Exchange (ETDEWEB)

    Liu, Yun-Hui; Arimoto, Suguru (Univ. of Tokyo (Japan))

    1992-08-01

    This article proposes a tangent graph for path planning of mobile robots among obstacles with a general boundary. The tangent graph is defined on the basis of the locally shortest path. It has the same data structure as the visibility graph, but its nodes represent common tangent points on obstacle boundaries, and its edges correspond to collision-free common tangents between the boundaries and convex boundary segments between the tangent points. The tangent graph requires O(K[sup 2]) memory, where K denotes the total number of convex segments of the obstacle boundaries. The tangent graph includes all locally shortest paths and is capable of coping with path planning not only among polygonal obstacles but also among curved obstacles.

  7. Development of Off-take Model, Subcooled Boiling Model, and Radiation Heat Transfer Input Model into the MARS Code for a Regulatory Auditing of CANDU Reactors

    International Nuclear Information System (INIS)

    Korea currently has four operating units of the CANDU-6 type reactor in Wolsong. However, the safety assessment system for CANDU reactors has not been fully established due to a lack of self-reliance technology. Although the CATHENA code had been introduced from AECL, it is undesirable to use a vendor's code for a regulatory auditing analysis. In Korea, the MARS code has been developed for decades and is being considered by KINS as a thermal hydraulic regulatory auditing tool for nuclear power plants. Before this decision, KINS (Korea Institute of Nuclear Safety) had developed the RELAP5/MOD3/CANDU code for CANDU safety analyses by modifying the model of the existing PWR auditing tool, RELAP5/MOD3. The main purpose of this study is to transplant the CANDU models of the RELAP5/MOD3/CANDU code to the MARS code including a quality assurance of the developed models

  8. Development of Off-take Model, Subcooled Boiling Model, and Radiation Heat Transfer Input Model into the MARS Code for a Regulatory Auditing of CANDU Reactors

    Energy Technology Data Exchange (ETDEWEB)

    Yoon, C.; Rhee, B. W.; Chung, B. D. [Korea Atomic Energy Research Institute, Daejeon (Korea, Republic of); Ahn, S. H.; Kim, M. W. [Korea Institute of Nuclear Safety, Daejeon (Korea, Republic of)

    2009-05-15

    Korea currently has four operating units of the CANDU-6 type reactor in Wolsong. However, the safety assessment system for CANDU reactors has not been fully established due to a lack of self-reliance technology. Although the CATHENA code had been introduced from AECL, it is undesirable to use a vendor's code for a regulatory auditing analysis. In Korea, the MARS code has been developed for decades and is being considered by KINS as a thermal hydraulic regulatory auditing tool for nuclear power plants. Before this decision, KINS (Korea Institute of Nuclear Safety) had developed the RELAP5/MOD3/CANDU code for CANDU safety analyses by modifying the model of the existing PWR auditing tool, RELAP5/MOD3. The main purpose of this study is to transplant the CANDU models of the RELAP5/MOD3/CANDU code to the MARS code including a quality assurance of the developed models.

  9. Ranking paths in stochastic time-dependent networks

    DEFF Research Database (Denmark)

    Nielsen, Lars Relund; Andersen, Kim Allan; Pretolani, Daniele D.

    2014-01-01

    In this paper we address optimal routing problems in networks where travel times are both stochastic and time-dependent. In these networks, the best route choice is not necessarily a path, but rather a time-adaptive strategy that assigns successors to nodes as a function of time. Nevertheless...... be easily extended to the ranking of the first K shortest paths. Our method exploits the solution of the time-adaptive routing problem as a relaxation of the a priori problem. Computational results are presented showing that, under realistic distributions of travel times and costs, our solution methods...

  10. Path Optimization Algorithm For Network Problems Using Job Sequencing Technique

    Directory of Open Access Journals (Sweden)

    Punit Kumar Singh

    2012-06-01

    Full Text Available The job sequencing technique is used to determine an optimal sequence. It performs a series of jobs by a number of specific orders so that it calculates the optimal cost. In this paper, we propose a novel approach to find an optimal path from source to destination by taking advantage of job sequencing technique. Wehave used n jobs m machine sequencing technique and this is divided into n jobs 2 machine problems. Using Johnson’s sequencing rule, we solved the problem and obtained the (n-1 sub sequences of the route. Using the proposed algorithm, we calculated the optimal sequence, which leads to the shortest path of the network.

  11. Going against the flow: finding the optimal path

    Science.gov (United States)

    Talbot, Julian

    2010-01-01

    We consider the problem of finding the optimum path of a boat traversing a straight in a current. The path of the shortest time is found using the calculus of variations with the constraint that the boat must land directly opposite to its starting point. We compare the optimal trajectory with that where the boat's local orientation is always directed to the arrival point. When analytical solutions cannot be found we use numerical methods. The level of the exposition is suitable for advanced undergraduate students, graduate students and general physicists.

  12. Minimum-Risk Path Finding by an Adaptive Amoebal Network

    Science.gov (United States)

    Nakagaki, Toshiyuki; Iima, Makoto; Ueda, Tetsuo; Nishiura, Yasumasa; Saigusa, Tetsu; Tero, Atsushi; Kobayashi, Ryo; Showalter, Kenneth

    2007-08-01

    When two food sources are presented to the slime mold Physarum in the dark, a thick tube for absorbing nutrients is formed that connects the food sources through the shortest route. When the light-avoiding organism is partially illuminated, however, the tube connecting the food sources follows a different route. Defining risk as the experimentally measurable rate of light-avoiding movement, the minimum-risk path is exhibited by the organism, determined by integrating along the path. A model for an adaptive-tube network is presented that is in good agreement with the experimental observations.

  13. ITER SAFETY TASK NID-10A:CANDU occupational exposure experience: ORE for ITER fuel cycle and cooling systems

    International Nuclear Information System (INIS)

    This report contains information on TRITIUM Occupational Exposure (Internal Dose) from typical CANDU Nuclear Generating Stations. In addition to dose, airborne tritium levels are provided, as these strongly influence operational exposure. The exposure dose data presented in this report cover a period of five years of operation and maintenance experience from four CANDU Reactors and are considered representative of other CANDU reactors. The data are broken down according to occupational function ( Operators, Maintenance and Support Service etc.). The referenced systems are mainly centered on CANDU Hear Transport System, Moderator System, Tritium Removal Facility and Heavy Water (D20) Upgrading System. These systems contain the bulk part of tritium contamination in the CANDU Reactor. Because of certain similarities between ITER and CANDU systems, this data can be used as the most relevant TRITIUM OCCUPATIONAL DOSE information for ITER COOLING and FUEL CYCLE systems dose assessment purpose, if similar design and operation principles as described in the report are adopted. (author). 16 refs., 8 tabs., 13 figs

  14. Double global optimum genetic algorithm-particle swarm optimization-based welding robot path planning

    Science.gov (United States)

    Wang, Xuewu; Shi, Yingpan; Ding, Dongyan; Gu, Xingsheng

    2016-02-01

    Spot-welding robots have a wide range of applications in manufacturing industries. There are usually many weld joints in a welding task, and a reasonable welding path to traverse these weld joints has a significant impact on welding efficiency. Traditional manual path planning techniques can handle a few weld joints effectively, but when the number of weld joints is large, it is difficult to obtain the optimal path. The traditional manual path planning method is also time consuming and inefficient, and cannot guarantee optimality. Double global optimum genetic algorithm-particle swarm optimization (GA-PSO) based on the GA and PSO algorithms is proposed to solve the welding robot path planning problem, where the shortest collision-free paths are used as the criteria to optimize the welding path. Besides algorithm effectiveness analysis and verification, the simulation results indicate that the algorithm has strong searching ability and practicality, and is suitable for welding robot path planning.

  15. Robot Path Planning Based on Simulated Annealing and Artificial Neural Networks

    Directory of Open Access Journals (Sweden)

    Xianmin Wei

    2013-05-01

    Full Text Available As for the limitations of algorithms in global path planning of mobile robot at present, this study applies the improved simulated annealing algorithm artificial neural networks to path planning of mobile robot in order to better the weaknesses of great scale of iteration computation and slow convergence, since the best-reserved simulated annealing algorithm was introduced and it was effectively combined with other algorithms, this improved algorithm has accelerated the convergence and shortened the computing time in the path planning and the global optimal solution can be quickly obtained. Because the simulated annealing algorithm was updated and the obstacle collision penalty function represented by neural networks and the path length are treated as the energy function, not only does the planning of path meet the standards of shortest path, but also avoids collisions with obstacles. Experimental results of simulation show this improved algorithm can effectively improve the calculation speed of path planning and ensure the quality of path planning.

  16. Robot Path Planning Based on Simulated Annealing and Artificial Neural Networks

    Directory of Open Access Journals (Sweden)

    Xianmin Wei

    2013-06-01

    Full Text Available As for the limitations of algorithms in global path planning of mobile robot at present, this study applies the improved simulated annealing algorithm artificial neural networks to path planning of mobile robot in order to better the weaknesses of great scale of iteration computation and slow convergence, since the best-reserved simulated annealing algorithm was introduced and it was effectively combined with other algorithms, this improved algorithm has accelerated the convergence and shortened the computing time in the path planning and the global optimal solution can be quickly obtained. Because the simulated annealing algorithm was updated and the obstacle collision penalty function represented by neural networks and the path length are treated as the energy function, not only does the planning of path meet the standards of shortest path, but also avoids collisions with obstacles. Experimental results of simulation show this improved algorithm can effectively improve the calculation speed of path planning and ensure the quality of path planning.

  17. An Optimal Single-Path Routing Algorithm in the Datacenter Network DPillar

    OpenAIRE

    Erickson, Alejandro; Kiasari, Abbas Eslami; Navaridas, Javier; Stewart, Iain A.

    2015-01-01

    DPillar has recently been proposed as a server-centric datacenter network and is combinatorially related to (but distinct from) the well-known wrapped butterfly network. We explain the relationship between DPillar and the wrapped butterfly network before proving that the underlying graph of DPillar is a Cayley graph; hence, the datacenter network DPillar is node-symmetric. We use this symmetry property to establish a single-path routing algorithm for DPillar that computes a shortest path and ...

  18. An optimal single-path routing algorithm in the datacenter network DPillar.

    OpenAIRE

    Erickson, A.; Kiasari, A.E.; Navaridas, J.; Stewart, I.A.

    2016-01-01

    DPillar has recently been proposed as a server-centric datacenter network and is combinatorially related to (but distinct from) the well-known wrapped butterfly network. We explain the relationship between DPillar and the wrapped butterfly network before proving that the underlying graph of DPillar is a Cayley graph; hence, the datacenter network DPillar is node-symmetric. We use this symmetry property to establish a single-path routing algorithm for DPillar that computes a shortest path and ...

  19. An Optimal Path Management Strategy in Mobile Ad Hoc Network Using Fuzzy and Rough Set Theory

    OpenAIRE

    P. Seethalakshmi; M. J.A. Jude; Rajendran, G

    2011-01-01

    Problem statement: Mobile Ad Hoc Network (MANET) is a collection of wireless mobile nodes that dynamically forms a network. Most of the existing ad-hoc routing algorithms select the shortest path using various resources. However the selected path may not consider all the network parameters and this would result in link instability in the network. The problems with existing methods are frequent route change with respect to change in topology, congestion as result of traffic and battery limitat...

  20. Decay of Tails at Equilibrium for FIFO Join the Shortest Queue Networks

    CERN Document Server

    Bramson, Maury; Prabhakar, Balaji

    2011-01-01

    In join the shortest queue networks, incoming jobs are assigned to the shortest queue from among a randomly chosen subset of D queues, in a system of N queues; after completion of service at its queue, a job leaves the network. We also assume that jobs arrive into the system according to a rate-\\alpha N Poisson process, \\alpha 1. We show under the above ansatz that, as N goes to infinity, the tail of the equilibrium queue size exhibits a wide range of behavior depending on the relationship between \\beta and D. In particular, if \\beta > D/(D-1), the tail is doubly exponential and, if \\beta < D/(D-1), the tail has a power law. When \\beta = D/(D-1), the tail is exponentially distributed.