WorldWideScience

Sample records for core optimization problem

  1. The Great Deluge Algorithm applied to a nuclear reactor core design optimization problem

    International Nuclear Information System (INIS)

    Sacco, Wagner F.; Oliveira, Cassiano R.E. de

    2005-01-01

    The Great Deluge Algorithm (GDA) is a local search algorithm introduced by Dueck. It is an analogy with a flood: the 'water level' rises continuously and the proposed solution must lie above the 'surface' in order to survive. The crucial parameter is the 'rain speed', which controls convergence of the algorithm similarly to Simulated Annealing's annealing schedule. This algorithm is applied to the reactor core design optimization problem, which consists in adjusting several reactor cell parameters, such as dimensions, enrichment and materials, in order to minimize the average peak-factor in a 3-enrichment-zone reactor, considering restrictions on the average thermal flux, criticality and sub-moderation. This problem was previously attacked by the canonical genetic algorithm (GA) and by a Niching Genetic Algorithm (NGA). NGAs were designed to force the genetic algorithm to maintain a heterogeneous population throughout the evolutionary process, avoiding the phenomenon known as genetic drift, where all the individuals converge to a single solution. The results obtained by the Great Deluge Algorithm are compared to those obtained by both algorithms mentioned above. The three algorithms are submitted to the same computational effort and GDA reaches the best results, showing its potential for other applications in the nuclear engineering field as, for instance, the nuclear core reload optimization problem. One of the great advantages of this algorithm over the GA is that it does not require special operators for discrete optimization. (author)

  2. Development of a multi-objective PBIL evolutionary algorithm applied to a nuclear reactor core reload optimization problem

    International Nuclear Information System (INIS)

    Machado, Marcelo D.; Dchirru, Roberto

    2005-01-01

    The nuclear reactor core reload optimization problem consists in finding a pattern of partially burned-up and fresh fuels that optimizes the plant's next operation cycle. This optimization problem has been traditionally solved using an expert's knowledge, but recently artificial intelligence techniques have also been applied successfully. The artificial intelligence optimization techniques generally have a single objective. However, most real-world engineering problems, including nuclear core reload optimization, have more than one objective (multi-objective) and these objectives are usually conflicting. The aim of this work is to develop a tool to solve multi-objective problems based on the Population-Based Incremental Learning (PBIL) algorithm. The new tool is applied to solve the Angra 1 PWR core reload optimization problem with the purpose of creating a Pareto surface, so that a pattern selected from this surface can be applied for the plant's next operation cycle. (author)

  3. The gravitational attraction algorithm: a new metaheuristic applied to a nuclear reactor core design optimization problem

    International Nuclear Information System (INIS)

    Sacco, Wagner F.; Oliveira, Cassiano R.E. de

    2005-01-01

    A new metaheuristic called 'Gravitational Attraction Algorithm' (GAA) is introduced in this article. It is an analogy with the gravitational force field, where a body attracts another proportionally to both masses and inversely to their distances. The GAA is a populational algorithm where, first of all, the solutions are clustered using the Fuzzy Clustering Means (FCM) algorithm. Following that, the gravitational forces of the individuals in relation to each cluster are evaluated and this individual or solution is displaced to the cluster with the greatest attractive force. Once it is inside this cluster, the solution receives small stochastic variations, performing a local exploration. Then the solutions are crossed over and the process starts all over again. The parameters required by the GAA are the 'diversity factor', which is used to create a random diversity in a fashion similar to genetic algorithm's mutation, and the number of clusters for the FCM. GAA is applied to the reactor core design optimization problem which consists in adjusting several reactor cell parameters in order to minimize the average peak-factor in a 3-enrichment-zone reactor, considering operational restrictions. This problem was previously attacked using the canonical genetic algorithm (GA) and a Niching Genetic Algorithm (NGA). The new metaheuristic is then compared to those two algorithms. The three algorithms are submitted to the same computational effort and GAA reaches the best results, showing its potential for other applications in the nuclear engineering field as, for instance, the nuclear core reload optimization problem. (author)

  4. Coarse-grained parallel genetic algorithm applied to a nuclear reactor core design optimization problem

    International Nuclear Information System (INIS)

    Pereira, Claudio M.N.A.; Lapa, Celso M.F.

    2003-01-01

    This work extends the research related to generic algorithms (GA) in core design optimization problems, which basic investigations were presented in previous work. Here we explore the use of the Island Genetic Algorithm (IGA), a coarse-grained parallel GA model, comparing its performance to that obtained by the application of a traditional non-parallel GA. The optimization problem consists on adjusting several reactor cell parameters, such as dimensions, enrichment and materials, in order to minimize the average peak-factor in a 3-enrichment zone reactor, considering restrictions on the average thermal flux, criticality and sub-moderation. Our IGA implementation runs as a distributed application on a conventional local area network (LAN), avoiding the use of expensive parallel computers or architectures. After exhaustive experiments, taking more than 1500 h in 550 MHz personal computers, we have observed that the IGA provided gains not only in terms of computational time, but also in the optimization outcome. Besides, we have also realized that, for such kind of problem, which fitness evaluation is itself time consuming, the time overhead in the IGA, due to the communication in LANs, is practically imperceptible, leading to the conclusion that the use of expensive parallel computers or architecture can be avoided

  5. A hybrid niched-island genetic algorithm applied to a nuclear core optimization problem

    International Nuclear Information System (INIS)

    Pereira, Claudio M.N.A.

    2005-01-01

    Diversity maintenance is a key-feature in most genetic-based optimization processes. The quest for such characteristic, has been motivating improvements in the original genetic algorithm (GA). The use of multiple populations (called islands) has demonstrating to increase diversity, delaying the genetic drift. Island Genetic Algorithms (IGA) lead to better results, however, the drift is only delayed, but not avoided. An important advantage of this approach is the simplicity and efficiency for parallel processing. Diversity can also be improved by the use of niching techniques. Niched Genetic Algorithms (NGA) are able to avoid the genetic drift, by containing evolution in niches of a single-population GA, however computational cost is increased. In this work it is investigated the use of a hybrid Niched-Island Genetic Algorithm (NIGA) in a nuclear core optimization problem found in literature. Computational experiments demonstrate that it is possible to take advantage of both, performance enhancement due to the parallelism and drift avoidance due to the use of niches. Comparative results shown that the proposed NIGA demonstrated to be more efficient and robust than an IGA and a NGA for solving the proposed optimization problem. (author)

  6. The fuzzy clearing approach for a niching genetic algorithm applied to a nuclear reactor core design optimization problem

    International Nuclear Information System (INIS)

    Sacco, Wagner F.; Machado, Marcelo D.; Pereira, Claudio M.N.A.; Schirru, Roberto

    2004-01-01

    This article extends previous efforts on genetic algorithms (GAs) applied to a core design optimization problem. We introduce the application of a new Niching Genetic Algorithm (NGA) to this problem and compare its performance to these previous works. The optimization problem consists in adjusting several reactor cell parameters, such as dimensions, enrichment and materials, in order to minimize the average peak-factor in a three-enrichment zone reactor, considering restrictions on the average thermal flux, criticality and sub-moderation. After exhaustive experiments we observed that our new niching method performs better than the conventional GA due to a greater exploration of the search space

  7. Application of the distributed genetic algorithm for in-core fuel optimization problems under parallel computational environment

    International Nuclear Information System (INIS)

    Yamamoto, Akio; Hashimoto, Hiroshi

    2002-01-01

    The distributed genetic algorithm (DGA) is applied for loading pattern optimization problems of the pressurized water reactors. A basic concept of DGA follows that of the conventional genetic algorithm (GA). However, DGA equally distributes candidates of solutions (i.e. loading patterns) to several independent ''islands'' and evolves them in each island. Communications between islands, i.e. migrations of some candidates between islands are performed with a certain period. Since candidates of solutions independently evolve in each island while accepting different genes of migrants, premature convergence in the conventional GA can be prevented. Because many candidate loading patterns should be evaluated in GA or DGA, the parallelization is efficient to reduce turn around time. Parallel efficiency of DGA was measured using our optimization code and good efficiency was attained even in a heterogeneous cluster environment due to dynamic distribution of the calculation load. The optimization code is based on the client/server architecture with the TCP/IP native socket and a client (optimization) module and calculation server modules communicate the objects of loading patterns each other. Throughout the sensitivity study on optimization parameters of DGA, a suitable set of the parameters for a test problem was identified. Finally, optimization capability of DGA and the conventional GA was compared in the test problem and DGA provided better optimization results than the conventional GA. (author)

  8. Lanczos Tridiagonalization and Core Problems

    Czech Academy of Sciences Publication Activity Database

    Hnětynková, Iveta; Strakoš, Zdeněk

    2007-01-01

    Roč. 421, č. 2-3 (2007), s. 243-251 ISSN 0024-3795 R&D Projects: GA AV ČR 1ET400300415 Institutional research plan: CEZ:AV0Z10300504 Keywords : linear approximation problem * orthogonal transformation * core problem * Golub-Kahan bidiagonalization * Lanczos tridiagonalization * Jacobi matrix Subject RIV: BA - General Mathematics Impact factor: 0.702, year: 2007

  9. Class and Home Problems: Optimization Problems

    Science.gov (United States)

    Anderson, Brian J.; Hissam, Robin S.; Shaeiwitz, Joseph A.; Turton, Richard

    2011-01-01

    Optimization problems suitable for all levels of chemical engineering students are available. These problems do not require advanced mathematical techniques, since they can be solved using typical software used by students and practitioners. The method used to solve these problems forces students to understand the trends for the different terms…

  10. A Problem on Optimal Transportation

    Science.gov (United States)

    Cechlarova, Katarina

    2005-01-01

    Mathematical optimization problems are not typical in the classical curriculum of mathematics. In this paper we show how several generalizations of an easy problem on optimal transportation were solved by gifted secondary school pupils in a correspondence mathematical seminar, how they can be used in university courses of linear programming and…

  11. Solving global optimization problems on GPU cluster

    Energy Technology Data Exchange (ETDEWEB)

    Barkalov, Konstantin; Gergel, Victor; Lebedev, Ilya [Lobachevsky State University of Nizhni Novgorod, Gagarin Avenue 23, 603950 Nizhni Novgorod (Russian Federation)

    2016-06-08

    The paper contains the results of investigation of a parallel global optimization algorithm combined with a dimension reduction scheme. This allows solving multidimensional problems by means of reducing to data-independent subproblems with smaller dimension solved in parallel. The new element implemented in the research consists in using several graphic accelerators at different computing nodes. The paper also includes results of solving problems of well-known multiextremal test class GKLS on Lobachevsky supercomputer using tens of thousands of GPU cores.

  12. Topology Optimization for Convection Problems

    DEFF Research Database (Denmark)

    Alexandersen, Joe

    2011-01-01

    This report deals with the topology optimization of convection problems.That is, the aim of the project is to develop, implement and examine topology optimization of purely thermal and coupled thermomechanical problems,when the design-dependent eects of convection are taken into consideration.......This is done by the use of a self-programmed FORTRAN-code, which builds on an existing 2D-plane thermomechanical nite element code implementing during the course `41525 FEM-Heavy'. The topology optimizationfeatures have been implemented from scratch, and allows the program to optimize elastostatic mechanical...

  13. The optimal graph partitioning problem

    DEFF Research Database (Denmark)

    Sørensen, Michael Malmros; Holm, Søren

    1993-01-01

    . This problem can be formulated as a MILP, which turns out to be completely symmetrical with respect to the p classes, and the gap between the relaxed LP solution and the optimal solution is the largest one possible. These two properties make it very difficult to solve even smaller problems. In this paper...

  14. Topology optimization of flow problems

    DEFF Research Database (Denmark)

    Gersborg, Allan Roulund

    2007-01-01

    This thesis investigates how to apply topology optimization using the material distribution technique to steady-state viscous incompressible flow problems. The target design applications are fluid devices that are optimized with respect to minimizing the energy loss, characteristic properties...... transport in 2D Stokes flow. Using Stokes flow limits the range of applications; nonetheless, the thesis gives a proof-of-concept for the application of the method within fluid dynamic problems and it remains of interest for the design of microfluidic devices. Furthermore, the thesis contributes...... at the Technical University of Denmark. Large topology optimization problems with 2D and 3D Stokes flow modeling are solved with direct and iterative strategies employing the parallelized Sun Performance Library and the OpenMP parallelization technique, respectively....

  15. About an Optimal Visiting Problem

    Energy Technology Data Exchange (ETDEWEB)

    Bagagiolo, Fabio, E-mail: bagagiol@science.unitn.it; Benetton, Michela [Unversita di Trento, Dipartimento di Matematica (Italy)

    2012-02-15

    In this paper we are concerned with the optimal control problem consisting in minimizing the time for reaching (visiting) a fixed number of target sets, in particular more than one target. Such a problem is of course reminiscent of the famous 'Traveling Salesman Problem' and brings all its computational difficulties. Our aim is to apply the dynamic programming technique in order to characterize the value function of the problem as the unique viscosity solution of a suitable Hamilton-Jacobi equation. We introduce some 'external' variables, one per target, which keep in memory whether the corresponding target is already visited or not, and we transform the visiting problem in a suitable Mayer problem. This fact allows us to overcome the lacking of the Dynamic Programming Principle for the originary problem. The external variables evolve with a hysteresis law and the Hamilton-Jacobi equation turns out to be discontinuous.

  16. ESFR core optimization and uncertainty studies

    International Nuclear Information System (INIS)

    Rineiski, A.; Vezzoni, B.; Zhang, D.; Marchetti, M.; Gabrielli, F.; Maschek, W.; Chen, X.-N.; Buiron, L.; Krepel, J.; Sun, K.; Mikityuk, K.; Polidoro, F.; Rochman, D.; Koning, A.J.; DaCruz, D.F.; Tsige-Tamirat, H.; Sunderland, R.

    2015-01-01

    In the European Sodium Fast Reactor (ESFR) project supported by EURATOM in 2008-2012, a concept for a large 3600 MWth sodium-cooled fast reactor design was investigated. In particular, reference core designs with oxide and carbide fuel were optimized to improve their safety parameters. Uncertainties in these parameters were evaluated for the oxide option. Core modifications were performed first to reduce the sodium void reactivity effect. Introduction of a large sodium plenum with an absorber layer above the core and a lower axial fertile blanket improve the total sodium void effect appreciably, bringing it close to zero for a core with fresh fuel, in line with results obtained worldwide, while not influencing substantially other core physics parameters. Therefore an optimized configuration, CONF2, with a sodium plenum and a lower blanket was established first and used as a basis for further studies in view of deterioration of safety parameters during reactor operation. Further options to study were an inner fertile blanket, introduction of moderator pins, a smaller core height, special designs for pins, such as 'empty' pins, and subassemblies. These special designs were proposed to facilitate melted fuel relocation in order to avoid core re-criticality under severe accident conditions. In the paper further CONF2 modifications are compared in terms of safety and fuel balance. They may bring further improvements in safety, but their accurate assessment requires additional studies, including transient analyses. Uncertainty studies were performed by employing a so-called Total Monte-Carlo method, for which a large number of nuclear data files is produced for single isotopes and then used in Monte-Carlo calculations. The uncertainties for the criticality, sodium void and Doppler effects, effective delayed neutron fraction due to uncertainties in basic nuclear data were assessed for an ESFR core. They prove applicability of the available nuclear data for ESFR

  17. Well-posed optimization problems

    CERN Document Server

    Dontchev, Asen L

    1993-01-01

    This book presents in a unified way the mathematical theory of well-posedness in optimization. The basic concepts of well-posedness and the links among them are studied, in particular Hadamard and Tykhonov well-posedness. Abstract optimization problems as well as applications to optimal control, calculus of variations and mathematical programming are considered. Both the pure and applied side of these topics are presented. The main subject is often introduced by heuristics, particular cases and examples. Complete proofs are provided. The expected knowledge of the reader does not extend beyond textbook (real and functional) analysis, some topology and differential equations and basic optimization. References are provided for more advanced topics. The book is addressed to mathematicians interested in optimization and related topics, and also to engineers, control theorists, economists and applied scientists who can find here a mathematical justification of practical procedures they encounter.

  18. On the optimal sizing problem

    DEFF Research Database (Denmark)

    Vidal, Rene Victor Valqui

    1994-01-01

    The paper studies the problem of determining the number and dimensions of sizes of apparel so as to maximize profits. It develops a simple one-variable bisection search algorithm that gives the optimal solution. An example is solved interactively using a Macintosh LC and Math CAD, a mathematical...

  19. Problems of radiation protection optimization

    International Nuclear Information System (INIS)

    Morkunas, G.

    2003-01-01

    One of the basic principles - optimization of radiation protection - is rather well understood by everybody engaged in protection of humans from ionizing radiation. However, the practical application of this principle is very problematic. This fact can be explained by vagueness of concept of dose constraints, possible legal consequences of any decision based on this principle, traditions of prescriptive system of radiation protection requirements in some countries, insufficiency of qualified expertise. The examples of optimization problems are the different attention given to different kinds of practices, not optimized application of remedial measures, strict requirements for radioactive contamination of imported products, uncertainties in optimization in medical applications of ionizing radiation. Such tools as international co-operation including regional networks of information exchange, training of qualified experts, identification of measurable indicators used for judging about the level of optimization may be the helpful practical means in solving of these problems. It is evident that the principle of optimization can not be replaced by any other alternative despite its complexity. The means for its practical implementation shall be searched for. (author)

  20. Economic optimization of PWR cores with ROSA

    International Nuclear Information System (INIS)

    Verhagen, F.C.M.; Wakker, P.H.

    2005-01-01

    The core-loading pattern is decisive for fuel cycle economics, fuel safety parameters and economic planning for future cycles. ROSA, NRG's loading pattern optimization code system for PWRs, has proven for over a decade to be a valuable tool to reactor operators for improving their fuel management economics. ROSA uses simulated annealing as loading pattern optimization technique, in combination with an extremely fast 3-D neutronics code for loading pattern calculations. The code is continuously extended with new optimization parameters and rules. This paper outlines recent developments of the ROSA code system and discusses results of PWR specific applications of ROSA. Core designs with a large variety of challenging constraints have been realized with ROSA. As a typical example, for the 193 assembly, Vantage 5H/RFA-2 fueled TVA's Watts Bar unit 1, a cycle 4 core with 76 feed assemblies was designed. This was followed by a high-energy cycle 5 with only 77 feed assemblies and approximately 535 days of natural cycle length. Subsequently, an economical core using 72 bundles was designed for cycle 6. This resulted in considerable savings in the cost of feed assemblies for reloads. The typical accuracy of ROSA compared to results of license codes in within ±0.02 for normalized assembly powers, ±0.03 for maximum enthalpy rise hot channel factor (F ΔH ), and ±3 days for natural cycle length. (author)

  1. A novel optimization method, Gravitational Search Algorithm (GSA), for PWR core optimization

    International Nuclear Information System (INIS)

    Mahmoudi, S.M.; Aghaie, M.; Bahonar, M.; Poursalehi, N.

    2016-01-01

    Highlights: • The Gravitational Search Algorithm (GSA) is introduced. • The advantage of GSA is verified in Shekel’s Foxholes. • Reload optimizing in WWER-1000 and WWER-440 cases are performed. • Maximizing K eff , minimizing PPFs and flattening power density is considered. - Abstract: In-core fuel management optimization (ICFMO) is one of the most challenging concepts of nuclear engineering. In recent decades several meta-heuristic algorithms or computational intelligence methods have been expanded to optimize reactor core loading pattern. This paper presents a new method of using Gravitational Search Algorithm (GSA) for in-core fuel management optimization. The GSA is constructed based on the law of gravity and the notion of mass interactions. It uses the theory of Newtonian physics and searcher agents are the collection of masses. In this work, at the first step, GSA method is compared with other meta-heuristic algorithms on Shekel’s Foxholes problem. In the second step for finding the best core, the GSA algorithm has been performed for three PWR test cases including WWER-1000 and WWER-440 reactors. In these cases, Multi objective optimizations with the following goals are considered, increment of multiplication factor (K eff ), decrement of power peaking factor (PPF) and power density flattening. It is notable that for neutronic calculation, PARCS (Purdue Advanced Reactor Core Simulator) code is used. The results demonstrate that GSA algorithm have promising performance and could be proposed for other optimization problems of nuclear engineering field.

  2. Core optimization studies at JEN-Spain

    International Nuclear Information System (INIS)

    Gomez Alonso, M.

    1983-01-01

    The JEN-1 is a 3-MW reactor which uses flat-plate fuel elements. It was originally fueled with 20%-enriched uranium but more recently with 90%-enriched fuel. It now appears that it will have to be converted back to using 20%- enriched fuel. Progress is presently being made in fuel fabrication. Plates with meat thicknesses of up to 1.5 mm have been fabricated. Plates are being tested with 40 wt % uranium in the fuel meat. Progress is also being made in reactor design in collaboration with atomic energy commissions of other countries for swimming pool reactors being designed or under construction in Chile, Ecuador, and Spain itself. The design studies address core optimization, safety analysis report updating, irradiation facilities, etc. Core optimization is specifically addressed in this paper. A common swimming-pool-type reactor such as the JEN-1 served as an example. The philosophy adopted in this study is not to try to match the high enrichment core, but rather to treat the design as new and try to optimize it using simplified neutronic/thermal hydraulic/economic models. This philosophy appears to be somewhat original. As many as possible of the fuel parameters are constrained to remain constant

  3. Solving the uncommon reactor core neutronics problems

    International Nuclear Information System (INIS)

    Vondy, D.R.; Fowler, T.B.

    1980-01-01

    The common reactor core neutronics problems have fundamental neutron space, energy spectrum solutions. Typically the most positive eigenvalue is associated with an all-positive flux for the pseudo-steady-state condition (k/sub eff/), or the critical state is to be effected by selective adjustment of some variable such as the fuel concentration. With sophistication in reactor analysis has come the demand for solutions of other, uncommon neutronics problems. Importance functionss are needed for sensitivity and uncertainty analyses, as for ratios of intergral reaction rates such as the fuel conversion (breeding) ratio. The dominant higher harmonic solution is needed in stability analysis. Typically the desired neutronics solution must contain negative values to qualify as a higher harmonic or to satisfy a fixed source containing negative values. Both regular and adjoint solutions are of interest as are special integrals of the solutions to support analysis

  4. Characteristic statistic algorithm (CSA) for in-core loading pattern optimization

    International Nuclear Information System (INIS)

    Liu Zhihong; Hu Yongming; Shi Gong

    2007-01-01

    To solve the problem of PWR in-core loading pattern optimization, a more suitable global optimization algorithm, i.e., Characteristic statistic algorithm (CSA), is used. The searching process of this algorithm and how to apply it to this problem are presented. Loading pattern optimization code SCYCLE is developed. Two different problems on real PWR models are calculated and the results are compared with other algorithms. It is shown that SCYCLE has high efficiency and good global performance on this problem. (authors)

  5. A common and optimized age scale for Antarctic ice cores

    Science.gov (United States)

    Parrenin, F.; Veres, D.; Landais, A.; Bazin, L.; Lemieux-Dudon, B.; Toye Mahamadou Kele, H.; Wolff, E.; Martinerie, P.

    2012-04-01

    Dating ice cores is a complex problem because 1) there is a age shift between the gas bubbles and the surrounding ice 2) there are many different ice cores which can be synchronized with various proxies and 3) there are many methods to date the ice and the gas bubbles, each with advantages and drawbacks. These methods fall into the following categories: 1) Ice flow (for the ice) and firn densification modelling (for the gas bubbles); 2) Comparison of ice core proxies with insolation variations (so-called orbital tuning methods); 3) Comparison of ice core proxies with other well dated archives; 4) Identification of well-dated horizons, such as tephra layers or geomagnetic anomalies. Recently, an new dating tool has been developped (DATICE, Lemieux-Dudon et al., 2010), to take into account all the different dating information into account and produce a common and optimal chronology for ice cores with estimated confidence intervals. In this talk we will review the different dating information for Antarctic ice cores and show how the DATICE tool can be applied.

  6. SOCIAL NETWORK OPTIMIZATION A NEW METHAHEURISTIC FOR GENERAL OPTIMIZATION PROBLEMS

    Directory of Open Access Journals (Sweden)

    Hassan Sherafat

    2017-12-01

    Full Text Available In the recent years metaheuristics were studied and developed as powerful technics for hard optimization problems. Some of well-known technics in this field are: Genetic Algorithms, Tabu Search, Simulated Annealing, Ant Colony Optimization, and Swarm Intelligence, which are applied successfully to many complex optimization problems. In this paper, we introduce a new metaheuristic for solving such problems based on social networks concept, named as Social Network Optimization – SNO. We show that a wide range of np-hard optimization problems may be solved by SNO.

  7. Optimization problem in quantum cryptography

    International Nuclear Information System (INIS)

    Brandt, Howard E

    2003-01-01

    A complete optimization was recently performed, yielding the maximum information gain by a general unitary entangling probe in the four-state protocol of quantum cryptography. A larger set of optimum probe parameters was found than was known previously from an incomplete optimization. In the present work, a detailed comparison is made between the complete and incomplete optimizations. Also, a new set of optimum probe parameters is identified for the four-state protocol

  8. Topology optimization of wave-propagation problems

    DEFF Research Database (Denmark)

    Jensen, Jakob Søndergaard; Sigmund, Ole

    2006-01-01

    Topology optimization is demonstrated as a useful tool for systematic design of wave-propagation problems. We illustrate the applicability of the method for optical, acoustic and elastic devices and structures.......Topology optimization is demonstrated as a useful tool for systematic design of wave-propagation problems. We illustrate the applicability of the method for optical, acoustic and elastic devices and structures....

  9. A Mathematical Optimization Problem in Bioinformatics

    Science.gov (United States)

    Heyer, Laurie J.

    2008-01-01

    This article describes the sequence alignment problem in bioinformatics. Through examples, we formulate sequence alignment as an optimization problem and show how to compute the optimal alignment with dynamic programming. The examples and sample exercises have been used by the author in a specialized course in bioinformatics, but could be adapted…

  10. Generalized Benders’ Decomposition for topology optimization problems

    DEFF Research Database (Denmark)

    Munoz Queupumil, Eduardo Javier; Stolpe, Mathias

    2011-01-01

    ) problems with discrete design variables to global optimality. We present the theoretical aspects of the method, including a proof of finite convergence and conditions for obtaining global optimal solutions. The method is also linked to, and compared with, an Outer-Approximation approach and a mixed 0......–1 semi definite programming formulation of the considered problem. Several ways to accelerate the method are suggested and an implementation is described. Finally, a set of truss topology optimization problems are numerically solved to global optimality.......This article considers the non-linear mixed 0–1 optimization problems that appear in topology optimization of load carrying structures. The main objective is to present a Generalized Benders’ Decomposition (GBD) method for solving single and multiple load minimum compliance (maximum stiffness...

  11. Topology optimization for acoustic problems

    DEFF Research Database (Denmark)

    Dühring, Maria Bayard

    2006-01-01

    In this paper a method to control acoustic properties in a room with topology optimization is presented. It is shown how the squared sound pressure amplitude in a certain part of a room can be minimized by distribution of material in a design domain along the ceiling in 2D and 3D. Nice 0-1 designs...

  12. A nuclear reactor core fuel reload optimization using Artificial-Ant-Colony Connective Networks

    International Nuclear Information System (INIS)

    Lima, Alan M.M. de; Schirru, Roberto

    2005-01-01

    A Pressurized Water Reactor core must be reloaded every time the fuel burnup reaches a level when it is not possible to sustain nominal power operation. The nuclear core fuel reload optimization consists in finding a burned-up and fresh-fuel-assembly pattern that maximizes the number of full operational days. This problem is NP-hard, meaning that complexity grows exponentially with the number of fuel assemblies in the core. Besides that, the problem is non-linear and its search space is highly discontinual and multimodal. In this work a parallel computational system based on Ant Colony System (ACS) called Artificial-Ant-Colony Networks is introduced to solve the nuclear reactor core fuel reload optimization problem. ACS is a system based on artificial agents that uses the reinforcement learning technique and was originally developed to solve the Traveling Salesman Problem, which is conceptually similar to the nuclear fuel reload problem. (author)

  13. Computation of optimal transport and related hedging problems via penalization and neural networks

    OpenAIRE

    Eckstein, Stephan; Kupper, Michael

    2018-01-01

    This paper presents a widely applicable approach to solving (multi-marginal, martingale) optimal transport and related problems via neural networks. The core idea is to penalize the optimization problem in its dual formulation and reduce it to a finite dimensional one which corresponds to optimizing a neural network with smooth objective function. We present numerical examples from optimal transport, martingale optimal transport, portfolio optimization under uncertainty and generative adversa...

  14. Binary Cockroach Swarm Optimization for Combinatorial Optimization Problem

    Directory of Open Access Journals (Sweden)

    Ibidun Christiana Obagbuwa

    2016-09-01

    Full Text Available The Cockroach Swarm Optimization (CSO algorithm is inspired by cockroach social behavior. It is a simple and efficient meta-heuristic algorithm and has been applied to solve global optimization problems successfully. The original CSO algorithm and its variants operate mainly in continuous search space and cannot solve binary-coded optimization problems directly. Many optimization problems have their decision variables in binary. Binary Cockroach Swarm Optimization (BCSO is proposed in this paper to tackle such problems and was evaluated on the popular Traveling Salesman Problem (TSP, which is considered to be an NP-hard Combinatorial Optimization Problem (COP. A transfer function was employed to map a continuous search space CSO to binary search space. The performance of the proposed algorithm was tested firstly on benchmark functions through simulation studies and compared with the performance of existing binary particle swarm optimization and continuous space versions of CSO. The proposed BCSO was adapted to TSP and applied to a set of benchmark instances of symmetric TSP from the TSP library. The results of the proposed Binary Cockroach Swarm Optimization (BCSO algorithm on TSP were compared to other meta-heuristic algorithms.

  15. Optimization and inverse problems in electromagnetism

    CERN Document Server

    Wiak, Sławomir

    2003-01-01

    From 12 to 14 September 2002, the Academy of Humanities and Economics (AHE) hosted the workshop "Optimization and Inverse Problems in Electromagnetism". After this bi-annual event, a large number of papers were assembled and combined in this book. During the workshop recent developments and applications in optimization and inverse methodologies for electromagnetic fields were discussed. The contributions selected for the present volume cover a wide spectrum of inverse and optimal electromagnetic methodologies, ranging from theoretical to practical applications. A number of new optimal and inverse methodologies were proposed. There are contributions related to dedicated software. Optimization and Inverse Problems in Electromagnetism consists of three thematic chapters, covering: -General papers (survey of specific aspects of optimization and inverse problems in electromagnetism), -Methodologies, -Industrial Applications. The book can be useful to students of electrical and electronics engineering, computer sci...

  16. Engineering fuel reloading sequence optimization for in-core shuffling system

    International Nuclear Information System (INIS)

    Jeong, Seo G.; Suh, Kune Y.

    2008-01-01

    Optimizing the nuclear fuel reloading process is central to enhancing the economics of nuclear power plant (NPP). There are two kinds of reloading method: in-core shuffling and ex-core shuffling. In-core shuffling has an advantage of reloading time when compared with ex-core shuffling. It is, however, not easy to adopt an in-core shuffling because of additional facilities required and regulations involved at the moment. The in-core shuffling necessitates minimizing the movement of refueling machine because reloading paths can be varied according to differing reloading sequences. In the past, the reloading process depended on the expert's knowledge and experience. Recent advances in computer technology have apparently facilitated the heuristic approach to nuclear fuel reloading sequence optimization. This work presents a first in its kind of in-core shuffling whereas all the Korean NPPs have so far adopted ex-core shuffling method. Several plants recently applied the in-core shuffling strategy, thereby saving approximately 24 to 48 hours of outage time. In case of in-core shuffling one need minimize the movement of refueling machine because reloading path can be varied according to different reloading sequences. Advances in computer technology have enabled optimizing the in-core shuffling by solving a traveling salesman problem. To solve this problem, heuristic algorithm is used, such as ant colony algorithm and genetic algorithm. The Systemic Engineering Reload Analysis (SERA) program is written to optimize shuffling sequence based on heuristic algorithms. SERA is applied to the Optimized Power Reactor 1000 MWe (OPR1000) on the assumption that the NPP adopts the in-core shuffling in the foreseeable future. It is shown that the optimized shuffling sequence resulted in reduced reloading time. (author)

  17. Firefly Mating Algorithm for Continuous Optimization Problems

    Directory of Open Access Journals (Sweden)

    Amarita Ritthipakdee

    2017-01-01

    Full Text Available This paper proposes a swarm intelligence algorithm, called firefly mating algorithm (FMA, for solving continuous optimization problems. FMA uses genetic algorithm as the core of the algorithm. The main feature of the algorithm is a novel mating pair selection method which is inspired by the following 2 mating behaviors of fireflies in nature: (i the mutual attraction between males and females causes them to mate and (ii fireflies of both sexes are of the multiple-mating type, mating with multiple opposite sex partners. A female continues mating until her spermatheca becomes full, and, in the same vein, a male can provide sperms for several females until his sperm reservoir is depleted. This new feature enhances the global convergence capability of the algorithm. The performance of FMA was tested with 20 benchmark functions (sixteen 30-dimensional functions and four 2-dimensional ones against FA, ALC-PSO, COA, MCPSO, LWGSODE, MPSODDS, DFOA, SHPSOS, LSA, MPDPGA, DE, and GABC algorithms. The experimental results showed that the success rates of our proposed algorithm with these functions were higher than those of other algorithms and the proposed algorithm also required fewer numbers of iterations to reach the global optima.

  18. Windscale: tackling the core of the problem

    International Nuclear Information System (INIS)

    Anon.

    1987-01-01

    The decommissioning of the Windscale advanced gas-cooled reactor requires the design of a robot or manipulator to enter the reactor core and cut up the core into pieces that can then be loaded into concrete-filled boxes and disposed of as nuclear waste. Existing equipment is not entirely suitable so the machine is being designed specifically for the job. A British firm has been chosen to supply the equipment, which will have joy stick control, and will be delivered by mid 1988. Six months development work, then a year of trials will follow, before the dismantling process will start. The machine, its operation and the remote viewing provision are discussed. (U.K.)

  19. FIREWORKS ALGORITHM FOR UNCONSTRAINED FUNCTION OPTIMIZATION PROBLEMS

    Directory of Open Access Journals (Sweden)

    Evans BAIDOO

    2017-03-01

    Full Text Available Modern real world science and engineering problems can be classified as multi-objective optimisation problems which demand for expedient and efficient stochastic algorithms to respond to the optimization needs. This paper presents an object-oriented software application that implements a firework optimization algorithm for function optimization problems. The algorithm, a kind of parallel diffuse optimization algorithm is based on the explosive phenomenon of fireworks. The algorithm presented promising results when compared to other population or iterative based meta-heuristic algorithm after it was experimented on five standard benchmark problems. The software application was implemented in Java with interactive interface which allow for easy modification and extended experimentation. Additionally, this paper validates the effect of runtime on the algorithm performance.

  20. Approximative solutions of stochastic optimization problem

    Czech Academy of Sciences Publication Activity Database

    Lachout, Petr

    2010-01-01

    Roč. 46, č. 3 (2010), s. 513-523 ISSN 0023-5954 R&D Projects: GA ČR GA201/08/0539 Institutional research plan: CEZ:AV0Z10750506 Keywords : Stochastic optimization problem * sensitivity * approximative solution Subject RIV: BA - General Mathematics Impact factor: 0.461, year: 2010 http://library.utia.cas.cz/separaty/2010/SI/lachout-approximative solutions of stochastic optimization problem.pdf

  1. Optimization of reload core design for PWR

    International Nuclear Information System (INIS)

    Shen Wei; Xie Zhongsheng; Yin Banghua

    1995-01-01

    A direct efficient optimization technique has been effected for automatically optimizing the reload of PWR. The objective functions include: maximization of end-of-cycle (EOC) reactivity and maximization of average discharge burnup. The fuel loading optimization and burnable poison (BP) optimization are separated into two stages by using Haling principle. In the first stage, the optimum fuel reloading pattern without BP is determined by the linear programming method using enrichments as control variable, while in the second stage the optimum BP allocation is determined by the flexible tolerance method using the number of BP rods as control variable. A practical and efficient PWR reloading optimization program based on above theory has been encoded and successfully applied to Qinshan Nuclear Power Plant (QNP) cycle 2 reloading design

  2. Problem of detecting inclusions by topological optimization

    Directory of Open Access Journals (Sweden)

    I. Faye

    2014-01-01

    Full Text Available In this paper we propose a new method to detect inclusions. The proposed method is based on shape and topological optimization tools. In fact after presenting the problem, we use topologication optimization tools to detect inclusions in the domain. Numerical results are presented.

  3. Stochastic global optimization as a filtering problem

    International Nuclear Information System (INIS)

    Stinis, Panos

    2012-01-01

    We present a reformulation of stochastic global optimization as a filtering problem. The motivation behind this reformulation comes from the fact that for many optimization problems we cannot evaluate exactly the objective function to be optimized. Similarly, we may not be able to evaluate exactly the functions involved in iterative optimization algorithms. For example, we may only have access to noisy measurements of the functions or statistical estimates provided through Monte Carlo sampling. This makes iterative optimization algorithms behave like stochastic maps. Naive global optimization amounts to evolving a collection of realizations of this stochastic map and picking the realization with the best properties. This motivates the use of filtering techniques to allow focusing on realizations that are more promising than others. In particular, we present a filtering reformulation of global optimization in terms of a special case of sequential importance sampling methods called particle filters. The increasing popularity of particle filters is based on the simplicity of their implementation and their flexibility. We utilize the flexibility of particle filters to construct a stochastic global optimization algorithm which can converge to the optimal solution appreciably faster than naive global optimization. Several examples of parametric exponential density estimation are provided to demonstrate the efficiency of the approach.

  4. Topology optimization for transient heat transfer problems

    DEFF Research Database (Denmark)

    Zeidan, Said; Sigmund, Ole; Lazarov, Boyan Stefanov

    The focus of this work is on passive control of transient heat transfer problems using the topology optimization (TopOpt) method [1]. The goal is to find distributions of a limited amount of phase change material (PCM), within a given design domain, which optimizes the heat energy storage [2]. Our......, TopOpt has later been extended to transient problems in mechanics and photonics (e.g. [5], [6] and [7]). In the presented approach, the optimization is gradient-based, where in each iteration the non-steady heat conduction equation is solved,using the finite element method and an appropriate time......-stepping scheme. A PCM can efficiently absorb heat while keeping its temperature nearly unchanged [8]. The use of PCM ine.g. electronics [9] and mechanics [10], yields improved performance and lower costs depending on a.o., the spatial distribution of PCM.The considered problem consists in optimizing...

  5. Belief Propagation Algorithm for Portfolio Optimization Problems.

    Science.gov (United States)

    Shinzato, Takashi; Yasuda, Muneki

    2015-01-01

    The typical behavior of optimal solutions to portfolio optimization problems with absolute deviation and expected shortfall models using replica analysis was pioneeringly estimated by S. Ciliberti et al. [Eur. Phys. B. 57, 175 (2007)]; however, they have not yet developed an approximate derivation method for finding the optimal portfolio with respect to a given return set. In this study, an approximation algorithm based on belief propagation for the portfolio optimization problem is presented using the Bethe free energy formalism, and the consistency of the numerical experimental results of the proposed algorithm with those of replica analysis is confirmed. Furthermore, the conjecture of H. Konno and H. Yamazaki, that the optimal solutions with the absolute deviation model and with the mean-variance model have the same typical behavior, is verified using replica analysis and the belief propagation algorithm.

  6. Belief Propagation Algorithm for Portfolio Optimization Problems.

    Directory of Open Access Journals (Sweden)

    Takashi Shinzato

    Full Text Available The typical behavior of optimal solutions to portfolio optimization problems with absolute deviation and expected shortfall models using replica analysis was pioneeringly estimated by S. Ciliberti et al. [Eur. Phys. B. 57, 175 (2007]; however, they have not yet developed an approximate derivation method for finding the optimal portfolio with respect to a given return set. In this study, an approximation algorithm based on belief propagation for the portfolio optimization problem is presented using the Bethe free energy formalism, and the consistency of the numerical experimental results of the proposed algorithm with those of replica analysis is confirmed. Furthermore, the conjecture of H. Konno and H. Yamazaki, that the optimal solutions with the absolute deviation model and with the mean-variance model have the same typical behavior, is verified using replica analysis and the belief propagation algorithm.

  7. Sensitivity analysis in optimization and reliability problems

    International Nuclear Information System (INIS)

    Castillo, Enrique; Minguez, Roberto; Castillo, Carmen

    2008-01-01

    The paper starts giving the main results that allow a sensitivity analysis to be performed in a general optimization problem, including sensitivities of the objective function, the primal and the dual variables with respect to data. In particular, general results are given for non-linear programming, and closed formulas for linear programming problems are supplied. Next, the methods are applied to a collection of civil engineering reliability problems, which includes a bridge crane, a retaining wall and a composite breakwater. Finally, the sensitivity analysis formulas are extended to calculus of variations problems and a slope stability problem is used to illustrate the methods

  8. Sensitivity analysis in optimization and reliability problems

    Energy Technology Data Exchange (ETDEWEB)

    Castillo, Enrique [Department of Applied Mathematics and Computational Sciences, University of Cantabria, Avda. Castros s/n., 39005 Santander (Spain)], E-mail: castie@unican.es; Minguez, Roberto [Department of Applied Mathematics, University of Castilla-La Mancha, 13071 Ciudad Real (Spain)], E-mail: roberto.minguez@uclm.es; Castillo, Carmen [Department of Civil Engineering, University of Castilla-La Mancha, 13071 Ciudad Real (Spain)], E-mail: mariacarmen.castillo@uclm.es

    2008-12-15

    The paper starts giving the main results that allow a sensitivity analysis to be performed in a general optimization problem, including sensitivities of the objective function, the primal and the dual variables with respect to data. In particular, general results are given for non-linear programming, and closed formulas for linear programming problems are supplied. Next, the methods are applied to a collection of civil engineering reliability problems, which includes a bridge crane, a retaining wall and a composite breakwater. Finally, the sensitivity analysis formulas are extended to calculus of variations problems and a slope stability problem is used to illustrate the methods.

  9. Stochastic Linear Quadratic Optimal Control Problems

    International Nuclear Information System (INIS)

    Chen, S.; Yong, J.

    2001-01-01

    This paper is concerned with the stochastic linear quadratic optimal control problem (LQ problem, for short) for which the coefficients are allowed to be random and the cost functional is allowed to have a negative weight on the square of the control variable. Some intrinsic relations among the LQ problem, the stochastic maximum principle, and the (linear) forward-backward stochastic differential equations are established. Some results involving Riccati equation are discussed as well

  10. Topology optimization of Channel flow problems

    DEFF Research Database (Denmark)

    Gersborg-Hansen, Allan; Sigmund, Ole; Haber, R. B.

    2005-01-01

    function which measures either some local aspect of the velocity field or a global quantity, such as the rate of energy dissipation. We use the finite element method to model the flow, and we solve the optimization problem with a gradient-based math-programming algorithm that is driven by analytical......This paper describes a topology design method for simple two-dimensional flow problems. We consider steady, incompressible laminar viscous flows at low to moderate Reynolds numbers. This makes the flow problem non-linear and hence a non-trivial extension of the work of [Borrvall&Petersson 2002......]. Further, the inclusion of inertia effects significantly alters the physics, enabling solutions of new classes of optimization problems, such as velocity--driven switches, that are not addressed by the earlier method. Specifically, we determine optimal layouts of channel flows that extremize a cost...

  11. Study on ant colony optimization for fuel loading pattern problem

    International Nuclear Information System (INIS)

    Kishi, Hironori; Kitada, Takanori

    2013-01-01

    Modified ant colony optimization (ACO) was applied to the in-core fuel loading pattern (LP) optimization problem to minimize the power peaking factor (PPF) in the modeled 1/4 symmetry PWR core. Loading order was found to be important in ACO. Three different loading orders with and without the adjacent effect between fuel assemblies (FAs) were compared, and it was found that the loading order from the central core is preferable because many selections of FAs to be inserted are available in the core center region. LPs were determined from pheromone trail and heuristic information, which is a priori knowledge based on the feature of the problem. Three types of heuristic information were compared to obtain the desirable performance of searching LPs with low PPF. Moreover, mutation operation, such as the genetic algorithm (GA), was introduced into the ACO algorithm to avoid searching similar LPs because heuristic information used in ACO tends to localize the searching space in the LP problem. The performance of ACO with some improvement was compared with those of simulated annealing and GA. In conclusion, good performance can be achieved by setting proper heuristic information and mutation operation parameter in ACO. (author)

  12. A 3D stylized half-core CANDU benchmark problem

    International Nuclear Information System (INIS)

    Pounders, Justin M.; Rahnema, Farzad; Serghiuta, Dumitru; Tholammakkil, John

    2011-01-01

    A 3D stylized half-core Canadian deuterium uranium (CANDU) reactor benchmark problem is presented. The benchmark problem is comprised of a heterogeneous lattice of 37-element natural uranium fuel bundles, heavy water moderated, heavy water cooled, with adjuster rods included as reactivity control devices. Furthermore, a 2-group macroscopic cross section library has been developed for the problem to increase the utility of this benchmark for full-core deterministic transport methods development. Monte Carlo results are presented for the benchmark problem in cooled, checkerboard void, and full coolant void configurations.

  13. Application of a genetic algorithm to core reload pattern optimization

    International Nuclear Information System (INIS)

    Tanker, E.; Tanker, A.Z.

    1994-01-01

    A genetic algorithm is applied to reload pattern optimization of a PWR core. Evaluating all different distributions of a given batch load separately is found slow and ineffective. Allowing patterns from different distributions to combine reproduce, an optimized pattern better than that obtained from from linear programming is found, albeit in a longer time. (authors). 5 refs., 2 tabs

  14. Two optimal control methods for PWR core control

    International Nuclear Information System (INIS)

    Karppinen, J.; Blomsnes, B.; Versluis, R.M.

    1976-01-01

    The Multistage Mathematical Programming (MMP) and State Variable Feedback (SVF) methods for PWR core control are presented in this paper. The MMP method is primarily intended for optimization of the core behaviour with respect to xenon induced power distribution effects in load cycle operation. The SVF method is most suited for xenon oscillation damping in situations where the core load is unpredictable or expected to stay constant. Results from simulation studies in which the two methods have been applied for control of simple PWR core models are presented. (orig./RW) [de

  15. A nuclear reactor core fuel reload optimization using artificial ant colony connective networks

    International Nuclear Information System (INIS)

    Lima, Alan M.M. de; Schirru, Roberto; Carvalho da Silva, Fernando; Medeiros, Jose Antonio Carlos Canedo

    2008-01-01

    The core of a nuclear Pressurized Water Reactor (PWR) may be reloaded every time the fuel burn-up is such that it is not more possible to maintain the reactor operating at nominal power. The nuclear core fuel reload optimization problem consists in finding a pattern of burned-up and fresh-fuel assemblies that maximize the number of full operational days. This is an NP-Hard problem, meaning that complexity grows exponentially with the number of fuel assemblies in the core. Moreover, the problem is non-linear and its search space is highly discontinuous and multi-modal. Ant Colony System (ACS) is an optimization algorithm based on artificial ants that uses the reinforcement learning technique. The ACS was originally developed to solve the Traveling Salesman Problem (TSP), which is conceptually similar to the nuclear core fuel reload problem. In this work a parallel computational system based on the ACS, called Artificial Ant Colony Networks is introduced to solve the core fuel reload optimization problem

  16. A nuclear reactor core fuel reload optimization using artificial ant colony connective networks

    Energy Technology Data Exchange (ETDEWEB)

    Lima, Alan M.M. de [Universidade Federal do Rio de Janeiro, PEN/COPPE - UFRJ, Ilha do Fundao s/n, CEP 21945-970 Rio de Janeiro (Brazil)], E-mail: alanmmlima@yahoo.com.br; Schirru, Roberto [Universidade Federal do Rio de Janeiro, PEN/COPPE - UFRJ, Ilha do Fundao s/n, CEP 21945-970 Rio de Janeiro (Brazil)], E-mail: schirru@lmp.ufrj.br; Carvalho da Silva, Fernando [Universidade Federal do Rio de Janeiro, PEN/COPPE - UFRJ, Ilha do Fundao s/n, CEP 21945-970 Rio de Janeiro (Brazil)], E-mail: fernando@con.ufrj.br; Medeiros, Jose Antonio Carlos Canedo [Universidade Federal do Rio de Janeiro, PEN/COPPE - UFRJ, Ilha do Fundao s/n, CEP 21945-970 Rio de Janeiro (Brazil)], E-mail: canedo@lmp.ufrj.br

    2008-09-15

    The core of a nuclear Pressurized Water Reactor (PWR) may be reloaded every time the fuel burn-up is such that it is not more possible to maintain the reactor operating at nominal power. The nuclear core fuel reload optimization problem consists in finding a pattern of burned-up and fresh-fuel assemblies that maximize the number of full operational days. This is an NP-Hard problem, meaning that complexity grows exponentially with the number of fuel assemblies in the core. Moreover, the problem is non-linear and its search space is highly discontinuous and multi-modal. Ant Colony System (ACS) is an optimization algorithm based on artificial ants that uses the reinforcement learning technique. The ACS was originally developed to solve the Traveling Salesman Problem (TSP), which is conceptually similar to the nuclear core fuel reload problem. In this work a parallel computational system based on the ACS, called Artificial Ant Colony Networks is introduced to solve the core fuel reload optimization problem.

  17. Optimal core acquisition and remanufacturing policies under uncertain core quality fractions

    NARCIS (Netherlands)

    Teunter, R.H.; Flapper, S.D.P.

    2011-01-01

    Cores acquired by a remanufacturer are typically highly variable in quality. Even if the expected fractions of the various quality levels are known, then the exact fractions when acquiring cores are still uncertain. Our model incorporates this uncertainty in determining optimal acquisition decisions

  18. Path optimization method for the sign problem

    Directory of Open Access Journals (Sweden)

    Ohnishi Akira

    2018-01-01

    Full Text Available We propose a path optimization method (POM to evade the sign problem in the Monte-Carlo calculations for complex actions. Among many approaches to the sign problem, the Lefschetz-thimble path-integral method and the complex Langevin method are promising and extensively discussed. In these methods, real field variables are complexified and the integration manifold is determined by the flow equations or stochastically sampled. When we have singular points of the action or multiple critical points near the original integral surface, however, we have a risk to encounter the residual and global sign problems or the singular drift term problem. One of the ways to avoid the singular points is to optimize the integration path which is designed not to hit the singular points of the Boltzmann weight. By specifying the one-dimensional integration-path as z = t +if(t(f ϵ R and by optimizing f(t to enhance the average phase factor, we demonstrate that we can avoid the sign problem in a one-variable toy model for which the complex Langevin method is found to fail. In this proceedings, we propose POM and discuss how we can avoid the sign problem in a toy model. We also discuss the possibility to utilize the neural network to optimize the path.

  19. Reloading optimization of pressurized water reactor core with burnable absorber fuel

    International Nuclear Information System (INIS)

    Shi Xiuan; Liu Zhihong; Hu Yongming

    2008-01-01

    The reloading optimization problem of PWR with burnable absorber fuel is very difficult, and common optimization algorithms are inefficient and have bad global performance for it. Characteristic statistic algorithm (CSA) is very fit for the problem. In the past, the reloading optimization using CSA has shortcomings of separating the fuel assemblies' loading pattern (LP) optimization from burnable absorber's placement (BP) optimization. In this study, LP and BP were optimized simultaneously using CSA coupled with CYCLE2D, which is a core analysis code. The corresponding reloading coupling optimization software, CSALPBP, was developed. The 10th cycle reloading design of Daya Bay Nuclear Power Plant was optimized using CSALPBP. The results show that CSALPBP has high efficiency and excellent global performance. (authors)

  20. Optimization of burnable poison disposition for in-core fuel assemblies

    International Nuclear Information System (INIS)

    Zhong Wenfa; Luo Rong; Zhou Quan

    1997-09-01

    The optimization of the burnable poison disposition in the initial core loading of the 200 MW nuclear heating reactor (NHR-200), is studied. The mass fraction of the burnable poison is used as the control variable with the objective to minimize the power peaking factor. The flexible tolerance method is used to solve the nonlinear programming optimal problem. The optimization method can be used in reactor physics design, and get a new pattern of initial core which is of reference value. (2 refs., 8 figs., 1 tab.)

  1. Topology optimization of fluid mechanics problems

    DEFF Research Database (Denmark)

    Gersborg-Hansen, Allan

    While topology optimization for solid continuum structures have been studied for about 20 years and for the special case of trusses for many more years, topology optimization of fluid mechanics problems is more recent. Borrvall and Petersson [1] is the seminal reference for topology optimization......D Navier-Stokes equation as well as an example with convection dominated transport in 2D Stokes flow. Using Stokes flow limits the range of applications; nonetheless, the present work gives a proof-of-concept for the application of the method within fluid mechanics problems and it remains...... processing tool. Prior to design manufacturing this allows the engineer to quantify the performance of the computed topology design using standard, credible analysis tools with a body-fitted mesh. [1] Borrvall and Petersson (2003) "Topology optimization of fluids in Stokes flow", Int. J. Num. Meth. Fluids...

  2. Topology Optimization for Transient Wave Propagation Problems

    DEFF Research Database (Denmark)

    Matzen, René

    The study of elastic and optical waves together with intensive material research has revolutionized everyday as well as cutting edge technology in very tangible ways within the last century. Therefore it is important to continue the investigative work towards improving existing as well as innovate...... new technology, by designing new materials and their layout. The thesis presents a general framework for applying topology optimization in the design of material layouts for transient wave propagation problems. In contrast to the high level of modeling in the frequency domain, time domain topology...... optimization is still in its infancy. A generic optimization problem is formulated with an objective function that can be field, velocity, and acceleration dependent, as well as it can accommodate the dependency of filtered signals essential in signal shape optimization [P3]. The analytical design gradients...

  3. A joint routing and speed optimization problem

    OpenAIRE

    Fukasawa, Ricardo; He, Qie; Santos, Fernando; Song, Yongjia

    2016-01-01

    Fuel cost contributes to a significant portion of operating cost in cargo transportation. Though classic routing models usually treat fuel cost as input data, fuel consumption heavily depends on the travel speed, which has led to the study of optimizing speeds over a given fixed route. In this paper, we propose a joint routing and speed optimization problem to minimize the total cost, which includes the fuel consumption cost. The only assumption made on the dependence between the fuel cost an...

  4. Optimal consumption problem in the Vasicek model

    Directory of Open Access Journals (Sweden)

    Jakub Trybuła

    2015-01-01

    Full Text Available We consider the problem of an optimal consumption strategy on the infinite time horizon based on the hyperbolic absolute risk aversion utility when the interest rate is an Ornstein-Uhlenbeck process. Using the method of subsolution and supersolution we obtain the existence of solutions of the dynamic programming equation. We illustrate the paper with a numerical example of the optimal consumption strategy and the value function.

  5. Multiparameter Optimization for Electromagnetic Inversion Problem

    Directory of Open Access Journals (Sweden)

    M. Elkattan

    2017-10-01

    Full Text Available Electromagnetic (EM methods have been extensively used in geophysical investigations such as mineral and hydrocarbon exploration as well as in geological mapping and structural studies. In this paper, we developed an inversion methodology for Electromagnetic data to determine physical parameters of a set of horizontal layers. We conducted Forward model using transmission line method. In the inversion part, we solved multi parameter optimization problem where, the parameters are conductivity, dielectric constant, and permeability of each layer. The optimization problem was solved by simulated annealing approach. The inversion methodology was tested using a set of models representing common geological formations.

  6. Optimization of core reload design for low-leakage fuel management in pressurized water reactors

    International Nuclear Information System (INIS)

    Kim, Y.J.; Downar, T.J.; Sesonske, A.

    1987-01-01

    A method was developed to optimize pressurized water reactor low-leakage core reload designs that features the decoupling and sequential optimization of the fuel arrangement and control problems. The two-stage optimization process provides the maximum cycle length for a given fresh fuel loading subject to power peaking constraints. In the first stage, a best fuel arrangement is determined at the end of cycle (EOC) in the absence of all control poisons by employing a direct search method. The constant power, Haling depletion is used to provide the cycle length and EOC power peaking for each candidate core fuel arrangement. In the second stage, the core control poison requirements to meet the core peaking constraints throughout the cycle are determined using an approximate nonlinear programming technique

  7. Preliminary analysis on in-core fuel management optimization of molten salt pebble-bed reactor

    International Nuclear Information System (INIS)

    Xia Bing; Jing Xingqing; Xu Xiaolin; Lv Yingzhong

    2013-01-01

    The Nuclear Hot Spring (NHS) is a molten salt pebble-bed reactor featured by full power natural circulation. The unique horizontal coolant flow of the NHS demands the fuel recycling schemes based on radial zoning refueling and the corresponding method of fuel management optimization. The local searching algorithm (LSA) and the simulated annealing algorithm (SAA), the stochastic optimization methods widely used in the refueling optimization problems in LWRs, were applied to the analysis of refueling optimization of the NHS. The analysis results indicate that, compared with the LSA, the SAA can survive the traps of local optimized solutions and reach the global optimized solution, and the quality of optimization of the SAA is independent of the choice of the initial solution. The optimization result gives excellent effects on the in-core power flattening and the suppression of fuel center temperature. For the one-dimensional zoning refueling schemes of the NHS, the SAA is an appropriate optimization method. (authors)

  8. In-Core Fuel Management with Biased Multiobjective Function Optimization

    International Nuclear Information System (INIS)

    Shatilla, Youssef A.; Little, David C.; Penkrot, Jack A.; Holland, Richard Andrew

    2000-01-01

    The capability of biased multiobjective function optimization has been added to the Westinghouse Electric Company's (Westinghouse's) Advanced Loading Pattern Search code (ALPS). The search process, given a user-defined set of design constraints, proceeds to minimize a global parameter called the total value associated with constraints compliance (VACC), an importance-weighted measure of the deviation from limit and/or margin target. The search process takes into consideration two equally important user-defined factors while minimizing the VACC, namely, the relative importance of each constraint with respect to the others and the optimization of each constraint according to its own objective function. Hence, trading off margin-to-design limits from where it is abundantly available to where it is badly needed can now be accomplished. Two practical methods are provided to the user for input of constraints and associated objective functions. One consists of establishing design limits based on traditional core design parameters such as assembly/pin burnup, power, or reactivity. The second method allows the user to write a program, or script, to define a logic not possible through ordinary means. This method of script writing was made possible through the application resident compiler feature of the technical user language integration processor (tulip), developed at Westinghouse. For the optimization problems studied, ALPS not only produced candidate loading patterns (LPs) that met all of the conflicting design constraints, but in cases where the design appeared to be over constrained gave a wide range of LPs that came very close to meeting all the constraints based on the associated objective functions

  9. Automated Design and Optimization of Pebble-bed Reactor Cores

    International Nuclear Information System (INIS)

    Gougar, Hans D.; Ougouag, Abderrafi M.; Terry, William K.

    2010-01-01

    We present a conceptual design approach for high-temperature gas-cooled reactors using recirculating pebble-bed cores. The design approach employs PEBBED, a reactor physics code specifically designed to solve for and analyze the asymptotic burnup state of pebble-bed reactors, in conjunction with a genetic algorithm to obtain a core that maximizes a fitness value that is a function of user-specified parameters. The uniqueness of the asymptotic core state and the small number of independent parameters that define it suggest that core geometry and fuel cycle can be efficiently optimized toward a specified objective. PEBBED exploits a novel representation of the distribution of pebbles that enables efficient coupling of the burnup and neutron diffusion solvers. With this method, even complex pebble recirculation schemes can be expressed in terms of a few parameters that are amenable to modern optimization techniques. With PEBBED, the user chooses the type and range of core physics parameters that represent the design space. A set of traits, each with acceptable and preferred values expressed by a simple fitness function, is used to evaluate the candidate reactor cores. The stochastic search algorithm automatically drives the generation of core parameters toward the optimal core as defined by the user. The optimized design can then be modeled and analyzed in greater detail using higher resolution and more computationally demanding tools to confirm the desired characteristics. For this study, the design of pebble-bed high temperature reactor concepts subjected to demanding physical constraints demonstrated the efficacy of the PEBBED algorithm.

  10. Optimal power and distribution control for weakly-coupled-core reactor

    International Nuclear Information System (INIS)

    Oohori, Takahumi; Kaji, Ikuo

    1977-01-01

    A numerical procedure has been devised for obtaining the optimal power and distribution control for a weakly-coupled-core reactor. Several difficulties were encountered in solving this optimization problem: (1) nonlinearity of the reactor kinetics equations; (2) neutron-leakage interaction between the cores; (3) localized power changes occurring in addition to the total power changes; (4) constraints imposed on the states - e.g. reactivity, reactor period. To obviate these difficulties, use is made of the generalized Newton method to convert the problem into an iterative sequence of linear programming problems, after approximating the differential equations and the integral performance criterion by a set of discrete algebraic equations. In this procedure, a heuristic but effective method is used for deriving an initial approximation, which is then made to converge toward the optimal solution. Delayed-neutron one-group point reactor models embodying transient temperature feed-back to the reactivity are used in obtaining the kinetics equations for the weakly-coupled-core reactor. The criterion adopted for determining the optimality is a norm relevant to the deviations of neutron density from the desired trajectories or else to the time derivatives of the neutron density; uniform control intervals are prescribed. Examples are given of two coupled-core reactors with typical parameters to illustrate the results obtained with this procedure. A comparison is also made between the coupled-core reactor and the one-point reactor. (auth.)

  11. Problems of the power plant shield optimization

    International Nuclear Information System (INIS)

    Abagyan, A.A.; Dubinin, A.A.; Zhuravlev, V.I.; Kurachenko, Yu.A.; Petrov, Eh.E.

    1981-01-01

    General approaches to the solution of problems on the nuclear power plant radiation shield optimization are considered. The requirements to the shield parameters are formulated in a form of restrictions on a number of functionals, determined by the solution of γ quantum and neutron transport equations or dimensional and weight characteristics of shield components. Functional determined by weight-dimensional parameters (shield cost, mass and thickness) and functionals, determined by radiation fields (equivalent dose rate, produced by neutrons and γ quanta, activation functional, radiation functional, heat flux, integral heat flux in a particular part of the shield volume, total energy flux through a particular shield surface are considered. The following methods of numerical solution of simplified optimization problems are discussed: semiempirical methods using radiation transport physical leaks, numerical solution of approximate transport equations, numerical solution of transport equations for the simplest configurations making possible to decrease essentially a number of variables in the problem. The conclusion is drawn that the attained level of investigations on the problem of nuclear power plant shield optimization gives the possibility to pass on at present to the solution of problems with a more detailed account of the real shield operating conditions (shield temperature field account, its strength and other characteristics) [ru

  12. Optimized core loading sequence for Ukraine WWER-1000 reactors

    International Nuclear Information System (INIS)

    Dye, M.; Shah, H.

    2015-01-01

    Fuel Assemblies (WFAs) experienced mechanical damage of the grids during loading at both South Ukraine 2 (SU2) and South Ukraine 3 (SU3). The grids were damaged due to high lateral loads exceeding their strength limit. The high lateral loads were caused by a combination of distortion and stiffness of the mixed core fuel assemblies and significant fuel assembly-to-fuel assembly interaction combined with the core loading sequence being used. To prevent damage of the WFA grids during core loading, Westinghouse has developed a loading sequence technique and loading aides (smooth sided dummies and top nozzle loading guides) designed to minimize fuel assembly-to-fuel assembly interaction while maximizing the potential for successful loading (i.e., no fuel assembly damage and minimized loading time). The loading sequence technique accounts for cycle-specific core loading patterns and is based on previous Westinghouse WWER core loading experience and fundamental principles. The loading aids are developed to “open-up” the target core location or to provide guidance into a target core location. The Westinghouse optimized core loading sequence and smooth sided dummies were utilized during the successful loading of SU3 Cycle 25 mixed core in March 2015, with no instances of fuel assembly damage and yet still provided considerable time savings relative to the 2012 and 2013 SU3 reload campaigns. (authors)

  13. Optimal burnable poison utilization in PWR core reload design

    International Nuclear Information System (INIS)

    Downar, T.J.

    1986-01-01

    A method was developed for determining the optimal distribution and depletion of burnable poisons in a Pressurized Water Reactor core. The well-known Haling depletion technique is used to achieve the end-of-cycle core state where the fuel assembly arrangement is configured in the absence of all control poison. The soluble and burnable poison required to control the core reactivity and power distribution are solved for as unknown variables while step depleting the cycle in reverse with a target power distribution. The method was implemented in the NRC approved licensing code SIMULATE

  14. Statistical physics of hard optimization problems

    International Nuclear Information System (INIS)

    Zdeborova, L.

    2009-01-01

    Optimization is fundamental in many areas of science, from computer science and information theory to engineering and statistical physics, as well as to biology or social sciences. It typically involves a large number of variables and a cost function depending on these variables. Optimization problems in the non-deterministic polynomial (NP)-complete class are particularly difficult, it is believed that the number of operations required to minimize the cost function is in the most difficult cases exponential in the system size. However, even in an NP-complete problem the practically arising instances might, in fact, be easy to solve. The principal question we address in this article is: How to recognize if an NP-complete constraint satisfaction problem is typically hard and what are the main reasons for this? We adopt approaches from the statistical physics of disordered systems, in particular the cavity method developed originally to describe glassy systems. We describe new properties of the space of solutions in two of the most studied constraint satisfaction problems - random satisfy ability and random graph coloring. We suggest a relation between the existence of the so-called frozen variables and the algorithmic hardness of a problem. Based on these insights, we introduce a new class of problems which we named ”locked” constraint satisfaction, where the statistical description is easily solvable, but from the algorithmic point of view they are even more challenging than the canonical satisfy ability.

  15. Statistical physics of hard optimization problems

    International Nuclear Information System (INIS)

    Zdeborova, L.

    2009-01-01

    Optimization is fundamental in many areas of science, from computer science and information theory to engineering and statistical physics, as well as to biology or social sciences. It typically involves a large number of variables and a cost function depending on these variables. Optimization problems in the non-deterministic polynomial-complete class are particularly difficult, it is believed that the number of operations required to minimize the cost function is in the most difficult cases exponential in the system size. However, even in an non-deterministic polynomial-complete problem the practically arising instances might, in fact, be easy to solve. The principal the question we address in the article is: How to recognize if an non-deterministic polynomial-complete constraint satisfaction problem is typically hard and what are the main reasons for this? We adopt approaches from the statistical physics of disordered systems, in particular the cavity method developed originally to describe glassy systems. We describe new properties of the space of solutions in two of the most studied constraint satisfaction problems - random satisfiability and random graph coloring. We suggest a relation between the existence of the so-called frozen variables and the algorithmic hardness of a problem. Based on these insights, we introduce a new class of problems which we named 'locked' constraint satisfaction, where the statistical description is easily solvable, but from the algorithmic point of view they are even more challenging than the canonical satisfiability (Authors)

  16. Statistical physics of hard optimization problems

    Science.gov (United States)

    Zdeborová, Lenka

    2009-06-01

    Optimization is fundamental in many areas of science, from computer science and information theory to engineering and statistical physics, as well as to biology or social sciences. It typically involves a large number of variables and a cost function depending on these variables. Optimization problems in the non-deterministic polynomial (NP)-complete class are particularly difficult, it is believed that the number of operations required to minimize the cost function is in the most difficult cases exponential in the system size. However, even in an NP-complete problem the practically arising instances might, in fact, be easy to solve. The principal question we address in this article is: How to recognize if an NP-complete constraint satisfaction problem is typically hard and what are the main reasons for this? We adopt approaches from the statistical physics of disordered systems, in particular the cavity method developed originally to describe glassy systems. We describe new properties of the space of solutions in two of the most studied constraint satisfaction problems - random satisfiability and random graph coloring. We suggest a relation between the existence of the so-called frozen variables and the algorithmic hardness of a problem. Based on these insights, we introduce a new class of problems which we named "locked" constraint satisfaction, where the statistical description is easily solvable, but from the algorithmic point of view they are even more challenging than the canonical satisfiability.

  17. Application of genetic algorithms to in-core nuclear fuel management optimization

    International Nuclear Information System (INIS)

    Poon, P.W.; Parks, G.T.

    1993-01-01

    The search for an optimal arrangement of fresh and burnt fuel and control material within the core of a PWR represents a formidable optimization problem. The approach of combining the robust optimization capabilities of the Simulated Annealing (SA) algorithm with the computational speed of a Generalized Perturbation Theory (GPT) based evaluation methodology in the code FORMOSA has proved to be very effective. In this paper, we show that the incorporation of another stochastic search technique, a Genetic Algorithm, results in comparable optimization performance on serial computers and offers substantially superior performance on parallel machines. (orig.)

  18. Core design and operation optimization methods based on time-dependent perturbation theory

    International Nuclear Information System (INIS)

    Greenspan, E.

    1983-08-01

    A general approach for the optimization of nuclear reactor core design and operation is outlined; it is based on two cornerstones: a newly developed time-dependent (or burnup-dependent) perturbation theory for nonlinear problems and a succesive iteration technique. The resulting approach is capable of handling realistic reactor models using computational methods of any degree of sophistication desired, while accounting for all the constraints imposed. Three general optimization strategies, different in the way for handling the constraints, are formulated. (author)

  19. Cusp-core problem and strong gravitational lensing

    International Nuclear Information System (INIS)

    Li Nan; Chen Daming

    2009-01-01

    Cosmological numerical simulations of galaxy formation have led to the cuspy density profile of a pure cold dark matter halo toward the center, which is in sharp contradiction with the observations of the rotation curves of cold dark matter-dominated dwarf and low surface brightness disk galaxies, with the latter tending to favor mass profiles with a flat central core. Many efforts have been devoted to resolving this cusp-core problem in recent years, among them, baryon-cold dark matter interactions are considered to be the main physical mechanisms erasing the cold dark matter (CDM) cusp into a flat core in the centers of all CDM halos. Clearly, baryon-cold dark matter interactions are not customized only for CDM-dominated disk galaxies, but for all types, including giant ellipticals. We first fit the most recent high resolution observations of rotation curves with the Burkert profile, then use the constrained core size-halo mass relation to calculate the lensing frequency, and compare the predicted results with strong lensing observations. Unfortunately, it turns out that the core size constrained from rotation curves of disk galaxies cannot be extrapolated to giant ellipticals. We conclude that, in the standard cosmological paradigm, baryon-cold dark matter interactions are not universal mechanisms for galaxy formation, and therefore, they cannot be true solutions to the cusp-core problem.

  20. BRAIN Journal - Solving Optimization Problems via Vortex Optimization Algorithm and Cognitive Development Optimization Algorithm

    OpenAIRE

    Ahmet Demir; Utku Kose

    2016-01-01

    ABSTRACT In the fields which require finding the most appropriate value, optimization became a vital approach to employ effective solutions. With the use of optimization techniques, many different fields in the modern life have found solutions to their real-world based problems. In this context, classical optimization techniques have had an important popularity. But after a while, more advanced optimization problems required the use of more effective techniques. At this point, Computer Sc...

  1. Solving Optimization Problems via Vortex Optimization Algorithm and Cognitive Development Optimization Algorithm

    OpenAIRE

    Ahmet Demir; Utku kose

    2017-01-01

    In the fields which require finding the most appropriate value, optimization became a vital approach to employ effective solutions. With the use of optimization techniques, many different fields in the modern life have found solutions to their real-world based problems. In this context, classical optimization techniques have had an important popularity. But after a while, more advanced optimization problems required the use of more effective techniques. At this point, Computer Science took an...

  2. Optimizations of Unstructured Aerodynamics Computations for Many-core Architectures

    KAUST Repository

    Al Farhan, Mohammed Ahmed

    2018-04-13

    We investigate several state-of-the-practice shared-memory optimization techniques applied to key routines of an unstructured computational aerodynamics application with irregular memory accesses. We illustrate for the Intel KNL processor, as a representative of the processors in contemporary leading supercomputers, identifying and addressing performance challenges without compromising the floating point numerics of the original code. We employ low and high-level architecture-specific code optimizations involving thread and data-level parallelism. Our approach is based upon a multi-level hierarchical distribution of work and data across both the threads and the SIMD units within every hardware core. On a 64-core KNL chip, we achieve nearly 2.9x speedup of the dominant routines relative to the baseline. These exhibit almost linear strong scalability up to 64 threads, and thereafter some improvement with hyperthreading. At substantially fewer Watts, we achieve up to 1.7x speedup relative to the performance of 72 threads of a 36-core Haswell CPU and roughly equivalent performance to 112 threads of a 56-core Skylake scalable processor. These optimizations are expected to be of value for many other unstructured mesh PDE-based scientific applications as multi and many-core architecture evolves.

  3. Finite Optimal Stopping Problems: The Seller's Perspective

    Science.gov (United States)

    Hemmati, Mehdi; Smith, J. Cole

    2011-01-01

    We consider a version of an optimal stopping problem, in which a customer is presented with a finite set of items, one by one. The customer is aware of the number of items in the finite set and the minimum and maximum possible value of each item, and must purchase exactly one item. When an item is presented to the customer, she or he observes its…

  4. Solving the uncommon nuclear reactor core neutronics problems

    International Nuclear Information System (INIS)

    Vondy, D.R.; Fowler, T.B.

    1983-01-01

    Calculational procedures have been implemented for solving importance and higher harmonic neutronics problems. Solutions are obtained routinely to support analysis of reactor core performance, treating up to three space coordinates with the multigroup diffusion theory approximation to neutron transport. The techniques used and some of the calculational difficulties are discussed

  5. Improving Battery Reactor Core Design Using Optimization Method

    International Nuclear Information System (INIS)

    Son, Hyung M.; Suh, Kune Y.

    2011-01-01

    The Battery Omnibus Reactor Integral System (BORIS) is a small modular fast reactor being designed at Seoul National University to satisfy various energy demands, to maintain inherent safety by liquid-metal coolant lead for natural circulation heat transport, and to improve power conversion efficiency with the Modular Optimal Balance Integral System (MOBIS) using the supercritical carbon dioxide as working fluid. This study is focused on developing the Neutronics Optimized Reactor Analysis (NORA) method that can quickly generate conceptual design of a battery reactor core by means of first principle calculations, which is part of the optimization process for reactor assembly design of BORIS

  6. Simulated annealing algorithm for reactor in-core design optimizations

    International Nuclear Information System (INIS)

    Zhong Wenfa; Zhou Quan; Zhong Zhaopeng

    2001-01-01

    A nuclear reactor must be optimized for in core fuel management to make full use of the fuel, to reduce the operation cost and to flatten the power distribution reasonably. The author presents a simulated annealing algorithm. The optimized objective function and the punishment function were provided for optimizing the reactor physics design. The punishment function was used to practice the simulated annealing algorithm. The practical design of the NHR-200 was calculated. The results show that the K eff can be increased by 2.5% and the power distribution can be flattened

  7. Iterative solution to the optimal poison management problem in pressurized water reactors

    International Nuclear Information System (INIS)

    Colletti, J.P.; Levine, S.H.; Lewis, J.B.

    1983-01-01

    A new method for solving the optimal poison management problem for a multiregion pressurized water reactor has been developed. The optimization objective is to maximize the end-of-cycle core excess reactivity for any given beginning-of-cycle fuel loading. The problem is treated as an optimal control problem with the region burnup and control absorber concentrations acting as the state and control variables, respectively. Constraints are placed on the power peaking, soluble boron concentration, and control absorber concentrations. The solution method consists of successive relinearizations of the system equations resulting in a sequence of nonlinear programming problems whose solutions converge to the desired optimal control solution. Application of the method to several test problems based on a simplified three-region reactor suggests a bang-bang optimal control strategy with the peak power location switching between the inner and outer regions of the core and the critical soluble boron concentration as low as possible throughout the cycle

  8. Optimal control problem for the extended Fisher–Kolmogorov equation

    Indian Academy of Sciences (India)

    In this paper, the optimal control problem for the extended Fisher–Kolmogorov equation is studied. The optimal control under boundary condition is given, the existence of optimal solution to the equation is proved and the optimality system is established.

  9. Efforts for optimization of BWR core internals replacement

    International Nuclear Information System (INIS)

    Iizuka, N.

    2000-01-01

    The core internal components replacement of a BWR was successfully completed at Fukushima-Daiichi Unit 3 (1F3) of the Tokyo Electric Power Company (TEPCO) in 1998. The core shroud and the majority of the internal components made by type 304 stainless steel (SS) were replaced with the ones made of low carbon type 316L SS to improve Intergranular Stress Corrosion Cracking (IGSCC) resistance. Although this core internals replacement project was completed, several factors combined to result in a longer-than-expected period for the outage. It was partly because the removal work of the internal components was delayed. Learning a lesson from whole experience in this project, some methods were adopted for the next replacement project at Fukushima-Daiichi Unit 2 (1F2) to shorten the outage and reduce the total radiation exposure. Those are new removal processes and new welding machine and so on. The core internals replacement work was ended at 1F2 in 1999, and both the period of outage and the total radiation exposure were the same degree as expected previous to starting of this project. This result shows that the methods adopted in this project are basically applicable for the core internals replacement work and the whole works about the BWR core internals replacement were optimized. The outline of the core internals replacement project and applied technologies at 1F3 and 1F2 are discussed in this paper. (author)

  10. Genetic algorithm for the optimization of the loading pattern for reactor core fuel management

    International Nuclear Information System (INIS)

    Zhou Sheng; Hu Yongming; zheng Wenxiang

    2000-01-01

    The paper discusses the application of a genetic algorithm to the optimization of the loading pattern for in-core fuel management with the NP characteristics. The algorithm develops a matrix model for the fuel assembly loading pattern. The burnable poisons matrix was assigned randomly considering the distributed nature of the poisons. A method based on the traveling salesman problem was used to solve the problem. A integrated code for in-core fuel management was formed by combining this code with a reactor physics code

  11. Solving Optimization Problems via Vortex Optimization Algorithm and Cognitive Development Optimization Algorithm

    Directory of Open Access Journals (Sweden)

    Ahmet Demir

    2017-01-01

    Full Text Available In the fields which require finding the most appropriate value, optimization became a vital approach to employ effective solutions. With the use of optimization techniques, many different fields in the modern life have found solutions to their real-world based problems. In this context, classical optimization techniques have had an important popularity. But after a while, more advanced optimization problems required the use of more effective techniques. At this point, Computer Science took an important role on providing software related techniques to improve the associated literature. Today, intelligent optimization techniques based on Artificial Intelligence are widely used for optimization problems. The objective of this paper is to provide a comparative study on the employment of classical optimization solutions and Artificial Intelligence solutions for enabling readers to have idea about the potential of intelligent optimization techniques. At this point, two recently developed intelligent optimization algorithms, Vortex Optimization Algorithm (VOA and Cognitive Development Optimization Algorithm (CoDOA, have been used to solve some multidisciplinary optimization problems provided in the source book Thomas' Calculus 11th Edition and the obtained results have compared with classical optimization solutions. 

  12. Wireline coring/open center reaming: Technical problems and solutions

    International Nuclear Information System (INIS)

    Fehr, G.

    1996-01-01

    At the 1993 ASME Energy Technology Conference, a paper, ''Field Experience with Wireline Coring through a Dual Wall Drilling System'', was presented. It described the initial scientific drilling which started in the spring of 1992 using wireline coring within a 9 5/8 inch dual wall drill pipe through an open center reaming bit, and some of the improvements made since the prototype drilling tests. New and as yet unsolved problems were identified. This follow-on work brings the industry up-to-date with a survey of how these difficulties have been solved, or, if not solved, the status of the effort made for each of the air coring/reaming technical challenges on the Yucca Mountain Site Characterization Project at the US Department of Energy Nevada Test Site

  13. Linux software for large topology optimization problems

    DEFF Research Database (Denmark)

    evolving product, which allows a parallel solution of the PDE, it lacks the important feature that the matrix-generation part of the computations is localized to each processor. This is well-known to be critical for obtaining a useful speedup on a Linux cluster and it motivates the search for a COMSOL......-like package for large topology optimization problems. One candidate for such software is developed for Linux by Sandia Nat’l Lab in the USA being the Sundance system. Sundance also uses a symbolic representation of the PDE and a scalable numerical solution is achieved by employing the underlying Trilinos...

  14. Engineering application of in-core fuel management optimization code with CSA algorithm

    Energy Technology Data Exchange (ETDEWEB)

    Liu, Zhihong; Hu, Yongming [INET, Tsinghua university, Beijing 100084 (China)

    2009-06-15

    PWR in-core loading (reloading) pattern optimization is a complex combined problem. An excellent fuel management optimization code can greatly improve the efficiency of core reloading design, and bring economic and safety benefits. Today many optimization codes with experiences or searching algorithms (such as SA, GA, ANN, ACO) have been developed, while how to improve their searching efficiency and engineering usability still needs further research. CSA (Characteristic Statistic Algorithm) is a global optimization algorithm with high efficiency developed by our team. The performance of CSA has been proved on many problems (such as Traveling Salesman Problems). The idea of CSA is to induce searching direction by the statistic distribution of characteristic values. This algorithm is quite suitable for fuel management optimization. Optimization code with CSA has been developed and was used on many core models. The research in this paper is to improve the engineering usability of CSA code according to all the actual engineering requirements. Many new improvements have been completed in this code, such as: 1. Considering the asymmetry of burn-up in one assembly, the rotation of each assembly is considered as new optimization variables in this code. 2. Worth of control rods must satisfy the given constraint, so some relative modifications are added into optimization code. 3. To deal with the combination of alternate cycles, multi-cycle optimization is considered in this code. 4. To confirm the accuracy of optimization results, many identifications of the physics calculation module in this code have been done, and the parameters of optimization schemes are checked by SCIENCE code. The improved optimization code with CSA has been used on Qinshan nuclear plant of China. The reloading of cycle 7, 8, 9 (12 months, no burnable poisons) and the 18 months equilibrium cycle (with burnable poisons) reloading are optimized. At last, many optimized schemes are found by CSA code

  15. Guaranteed Discrete Energy Optimization on Large Protein Design Problems.

    Science.gov (United States)

    Simoncini, David; Allouche, David; de Givry, Simon; Delmas, Céline; Barbe, Sophie; Schiex, Thomas

    2015-12-08

    In Computational Protein Design (CPD), assuming a rigid backbone and amino-acid rotamer library, the problem of finding a sequence with an optimal conformation is NP-hard. In this paper, using Dunbrack's rotamer library and Talaris2014 decomposable energy function, we use an exact deterministic method combining branch and bound, arc consistency, and tree-decomposition to provenly identify the global minimum energy sequence-conformation on full-redesign problems, defining search spaces of size up to 10(234). This is achieved on a single core of a standard computing server, requiring a maximum of 66GB RAM. A variant of the algorithm is able to exhaustively enumerate all sequence-conformations within an energy threshold of the optimum. These proven optimal solutions are then used to evaluate the frequencies and amplitudes, in energy and sequence, at which an existing CPD-dedicated simulated annealing implementation may miss the optimum on these full redesign problems. The probability of finding an optimum drops close to 0 very quickly. In the worst case, despite 1,000 repeats, the annealing algorithm remained more than 1 Rosetta unit away from the optimum, leading to design sequences that could differ from the optimal sequence by more than 30% of their amino acids.

  16. Parallel particle swarm optimization algorithm in nuclear problems

    International Nuclear Information System (INIS)

    Waintraub, Marcel; Pereira, Claudio M.N.A.; Schirru, Roberto

    2009-01-01

    Particle Swarm Optimization (PSO) is a population-based metaheuristic (PBM), in which solution candidates evolve through simulation of a simplified social adaptation model. Putting together robustness, efficiency and simplicity, PSO has gained great popularity. Many successful applications of PSO are reported, in which PSO demonstrated to have advantages over other well-established PBM. However, computational costs are still a great constraint for PSO, as well as for all other PBMs, especially in optimization problems with time consuming objective functions. To overcome such difficulty, parallel computation has been used. The default advantage of parallel PSO (PPSO) is the reduction of computational time. Master-slave approaches, exploring this characteristic are the most investigated. However, much more should be expected. It is known that PSO may be improved by more elaborated neighborhood topologies. Hence, in this work, we develop several different PPSO algorithms exploring the advantages of enhanced neighborhood topologies implemented by communication strategies in multiprocessor architectures. The proposed PPSOs have been applied to two complex and time consuming nuclear engineering problems: reactor core design and fuel reload optimization. After exhaustive experiments, it has been concluded that: PPSO still improves solutions after many thousands of iterations, making prohibitive the efficient use of serial (non-parallel) PSO in such kind of realworld problems; and PPSO with more elaborated communication strategies demonstrated to be more efficient and robust than the master-slave model. Advantages and peculiarities of each model are carefully discussed in this work. (author)

  17. Hybrid intelligent optimization methods for engineering problems

    Science.gov (United States)

    Pehlivanoglu, Yasin Volkan

    The purpose of optimization is to obtain the best solution under certain conditions. There are numerous optimization methods because different problems need different solution methodologies; therefore, it is difficult to construct patterns. Also mathematical modeling of a natural phenomenon is almost based on differentials. Differential equations are constructed with relative increments among the factors related to yield. Therefore, the gradients of these increments are essential to search the yield space. However, the landscape of yield is not a simple one and mostly multi-modal. Another issue is differentiability. Engineering design problems are usually nonlinear and they sometimes exhibit discontinuous derivatives for the objective and constraint functions. Due to these difficulties, non-gradient-based algorithms have become more popular in recent decades. Genetic algorithms (GA) and particle swarm optimization (PSO) algorithms are popular, non-gradient based algorithms. Both are population-based search algorithms and have multiple points for initiation. A significant difference from a gradient-based method is the nature of the search methodologies. For example, randomness is essential for the search in GA or PSO. Hence, they are also called stochastic optimization methods. These algorithms are simple, robust, and have high fidelity. However, they suffer from similar defects, such as, premature convergence, less accuracy, or large computational time. The premature convergence is sometimes inevitable due to the lack of diversity. As the generations of particles or individuals in the population evolve, they may lose their diversity and become similar to each other. To overcome this issue, we studied the diversity concept in GA and PSO algorithms. Diversity is essential for a healthy search, and mutations are the basic operators to provide the necessary variety within a population. After having a close scrutiny of the diversity concept based on qualification and

  18. Relaxations to Sparse Optimization Problems and Applications

    Science.gov (United States)

    Skau, Erik West

    Parsimony is a fundamental property that is applied to many characteristics in a variety of fields. Of particular interest are optimization problems that apply rank, dimensionality, or support in a parsimonious manner. In this thesis we study some optimization problems and their relaxations, and focus on properties and qualities of the solutions of these problems. The Gramian tensor decomposition problem attempts to decompose a symmetric tensor as a sum of rank one tensors.We approach the Gramian tensor decomposition problem with a relaxation to a semidefinite program. We study conditions which ensure that the solution of the relaxed semidefinite problem gives the minimal Gramian rank decomposition. Sparse representations with learned dictionaries are one of the leading image modeling techniques for image restoration. When learning these dictionaries from a set of training images, the sparsity parameter of the dictionary learning algorithm strongly influences the content of the dictionary atoms.We describe geometrically the content of trained dictionaries and how it changes with the sparsity parameter.We use statistical analysis to characterize how the different content is used in sparse representations. Finally, a method to control the structure of the dictionaries is demonstrated, allowing us to learn a dictionary which can later be tailored for specific applications. Variations of dictionary learning can be broadly applied to a variety of applications.We explore a pansharpening problem with a triple factorization variant of coupled dictionary learning. Another application of dictionary learning is computer vision. Computer vision relies heavily on object detection, which we explore with a hierarchical convolutional dictionary learning model. Data fusion of disparate modalities is a growing topic of interest.We do a case study to demonstrate the benefit of using social media data with satellite imagery to estimate hazard extents. In this case study analysis we

  19. Swarm intelligence of artificial bees applied to In-Core Fuel Management Optimization

    Energy Technology Data Exchange (ETDEWEB)

    Santos de Oliveira, Iona Maghali, E-mail: ioliveira@con.ufrj.br [Nuclear Engineering Program, Federal University of Rio de Janeiro, P.O. Box 68509, Zip Code 21945-970, Rio de Janeiro, RJ (Brazil); Schirru, Roberto, E-mail: schirru@lmp.ufrj.br [Nuclear Engineering Program, Federal University of Rio de Janeiro, P.O. Box 68509, Zip Code 21945-970, Rio de Janeiro, RJ (Brazil)

    2011-05-15

    Research highlights: > We present Artificial Bee Colony with Random Keys (ABCRK) for In-Core Fuel Management Optimization. > Its performance is examined through the optimization of a Brazilian '2-loop' PWR. > Feasibility of using ABCRK is shown against some well known population-based algorithms. > Additional advantage includes the utilization of fewer control parameters. - Abstract: Artificial Bee Colony (ABC) algorithm is a relatively new member of swarm intelligence. ABC tries to simulate the intelligent behavior of real honey bees in food foraging and can be used for solving continuous optimization and multi-dimensional numeric problems. This paper introduces the Artificial Bee Colony with Random Keys (ABCRK), a modified ABC algorithm for solving combinatorial problems such as the In-Core Fuel Management Optimization (ICFMO). The ICFMO is a hard combinatorial optimization problem in Nuclear Engineering which during many years has been solved by expert knowledge. It aims at getting the best arrangement of fuel in the nuclear reactor core that leads to a maximization of the operating time. As a consequence, the operation cost decreases and money is saved. In this study, ABCRK is used for optimizing the ICFMO problem of a Brazilian '2-loop' Pressurized Water Reactor (PWR) Nuclear Power Plant (NPP) and the results obtained with the proposed algorithm are compared with those obtained by Genetic Algorithms (GA) and Particle Swarm Optimization (PSO). The results show that the performance of the ABCRK algorithm is better than or similar to that of other population-based algorithms, with the advantage of employing fewer control parameters.

  20. Swarm intelligence of artificial bees applied to In-Core Fuel Management Optimization

    International Nuclear Information System (INIS)

    Santos de Oliveira, Iona Maghali; Schirru, Roberto

    2011-01-01

    Research highlights: → We present Artificial Bee Colony with Random Keys (ABCRK) for In-Core Fuel Management Optimization. → Its performance is examined through the optimization of a Brazilian '2-loop' PWR. → Feasibility of using ABCRK is shown against some well known population-based algorithms. → Additional advantage includes the utilization of fewer control parameters. - Abstract: Artificial Bee Colony (ABC) algorithm is a relatively new member of swarm intelligence. ABC tries to simulate the intelligent behavior of real honey bees in food foraging and can be used for solving continuous optimization and multi-dimensional numeric problems. This paper introduces the Artificial Bee Colony with Random Keys (ABCRK), a modified ABC algorithm for solving combinatorial problems such as the In-Core Fuel Management Optimization (ICFMO). The ICFMO is a hard combinatorial optimization problem in Nuclear Engineering which during many years has been solved by expert knowledge. It aims at getting the best arrangement of fuel in the nuclear reactor core that leads to a maximization of the operating time. As a consequence, the operation cost decreases and money is saved. In this study, ABCRK is used for optimizing the ICFMO problem of a Brazilian '2-loop' Pressurized Water Reactor (PWR) Nuclear Power Plant (NPP) and the results obtained with the proposed algorithm are compared with those obtained by Genetic Algorithms (GA) and Particle Swarm Optimization (PSO). The results show that the performance of the ABCRK algorithm is better than or similar to that of other population-based algorithms, with the advantage of employing fewer control parameters.

  1. Essays on variational approximation techniques for stochastic optimization problems

    Science.gov (United States)

    Deride Silva, Julio A.

    This dissertation presents five essays on approximation and modeling techniques, based on variational analysis, applied to stochastic optimization problems. It is divided into two parts, where the first is devoted to equilibrium problems and maxinf optimization, and the second corresponds to two essays in statistics and uncertainty modeling. Stochastic optimization lies at the core of this research as we were interested in relevant equilibrium applications that contain an uncertain component, and the design of a solution strategy. In addition, every stochastic optimization problem relies heavily on the underlying probability distribution that models the uncertainty. We studied these distributions, in particular, their design process and theoretical properties such as their convergence. Finally, the last aspect of stochastic optimization that we covered is the scenario creation problem, in which we described a procedure based on a probabilistic model to create scenarios for the applied problem of power estimation of renewable energies. In the first part, Equilibrium problems and maxinf optimization, we considered three Walrasian equilibrium problems: from economics, we studied a stochastic general equilibrium problem in a pure exchange economy, described in Chapter 3, and a stochastic general equilibrium with financial contracts, in Chapter 4; finally from engineering, we studied an infrastructure planning problem in Chapter 5. We stated these problems as belonging to the maxinf optimization class and, in each instance, we provided an approximation scheme based on the notion of lopsided convergence and non-concave duality. This strategy is the foundation of the augmented Walrasian algorithm, whose convergence is guaranteed by lopsided convergence, that was implemented computationally, obtaining numerical results for relevant examples. The second part, Essays about statistics and uncertainty modeling, contains two essays covering a convergence problem for a sequence

  2. Optimization programs for reactor core fuel loading exhibiting reduced neutron leakage

    International Nuclear Information System (INIS)

    Darilek, P.

    1991-01-01

    The program MAXIM was developed for the optimization of the fuel loading of WWER-440 reactors. It enables the reactor core reactivity to be maximized by modifying the arrangement of the fuel assemblies. The procedure is divided into three steps. The first step includes the passage from the three-dimensional model of the reactor core to the two-dimensional model. In the second step, the solution to the problem is sought assuming that the multiplying properties, or the reactivity in the zones of the core, vary continuously. In the third step, parameters of actual fuel assemblies are inserted in the ''continuous'' solution obtained. Combined with the program PROPAL for a detailed refinement of the loading, the program MAXIM forms a basis for the development of programs for the optimization of fuel loading with burnable poisons. (Z.M.). 16 refs

  3. Development of a parallel genetic algorithm using MPI and its application in a nuclear reactor core. Design optimization

    International Nuclear Information System (INIS)

    Waintraub, Marcel; Pereira, Claudio M.N.A.; Baptista, Rafael P.

    2005-01-01

    This work presents the development of a distributed parallel genetic algorithm applied to a nuclear reactor core design optimization. In the implementation of the parallelism, a 'Message Passing Interface' (MPI) library, standard for parallel computation in distributed memory platforms, has been used. Another important characteristic of MPI is its portability for various architectures. The main objectives of this paper are: validation of the results obtained by the application of this algorithm in a nuclear reactor core optimization problem, through comparisons with previous results presented by Pereira et al.; and performance test of the Brazilian Nuclear Engineering Institute (IEN) cluster in reactors physics optimization problems. The experiments demonstrated that the developed parallel genetic algorithm using the MPI library presented significant gains in the obtained results and an accentuated reduction of the processing time. Such results ratify the use of the parallel genetic algorithms for the solution of nuclear reactor core optimization problems. (author)

  4. A hybrid iterative scheme for optimal control problems governed by ...

    African Journals Online (AJOL)

    MRT

    KEY WORDS: Optimal control problem; Fredholm integral equation; ... control problems governed by Fredholm integral and integro-differential equations is given in (Brunner and Yan, ..... The exact optimal trajectory and control functions are. 2.

  5. Particle Swarm Optimization for Structural Design Problems

    Directory of Open Access Journals (Sweden)

    Hamit SARUHAN

    2010-02-01

    Full Text Available The aim of this paper is to employ the Particle Swarm Optimization (PSO technique to a mechanical engineering design problem which is minimizing the volume of a cantilevered beam subject to bending strength constraints. Mechanical engineering design problems are complex activities which are computing capability are more and more required. The most of these problems are solved by conventional mathematical programming techniques that require gradient information. These techniques have several drawbacks from which the main one is becoming trapped in local optima. As an alternative to gradient-based techniques, the PSO does not require the evaluation of gradients of the objective function. The PSO algorithm employs the generation of guided random positions when they search for the global optimum point. The PSO which is a nature inspired heuristics search technique imitates the social behavior of bird flocking. The results obtained by the PSO are compared with Mathematical Programming (MP. It is demonstrated that the PSO performed and obtained better convergence reliability on the global optimum point than the MP. Using the MP, the volume of 2961000 mm3 was obtained while the beam volume of 2945345 mm3 was obtained by the PSO.

  6. System and economic optimization problems of NPPs and its ideology

    International Nuclear Information System (INIS)

    Klimenko, A.V.; Mironovich, V.L.

    2016-01-01

    The iterative circuit design of optimization of system of links of nuclear fuel and energy complex (NFEC) is presented in the paper. Problems of system optimization of links NFEC as functional of NPP optimization are indicated and investigated [ru

  7. A system for obtaining an optimized pre design of nuclear reactor core

    International Nuclear Information System (INIS)

    Mai, L.A.

    1989-01-01

    This work proposes a method for obtaing a first design of nuclear reactor cores. It takes into consideration the objectives of the project, physical limits, economical limits and the reactor safety. For this purpose, some simplifications were made in the reactor model: one-energy-group, unidimensional and homogeneous core. The adopted model represents a typical PWR core and the optimized parameters are the fuel thickness, refletor thickness, enrichement and moderating ratio. The objective is to gain a larger residual reactivity at the end of the cycle. This work also presents results for a PWR core. From the results, many conclusions are established: system efficiency, limitations and problems. Also some suggestions are proposed to improve the system performance for futures works. (author) [pt

  8. A system to obtain an optimized first design of a nuclear reactor core

    International Nuclear Information System (INIS)

    Mai, L.A.

    1988-01-01

    This work proposes a method for obtaining a first design of nuclear reactor cores. It takes into consideration the objectives of the project, physical limits, economical limits and the reactor safety. For this purpose, some simplifications were made in the reactor model: one energy-group, one-dimensional and homogeneous core. The adopted model represents a typical PWR core and the optimized parameters are the fuel thickness, reflector thickness, enrichment and moderating ratio. The objective is to gain a larger residual reactivity at the end of the cycle. This work also presents results for a PWR core. From the results, many conclusions are established: system efficiency, limitations and problems. Also some suggestions are proposed to improve the system performance for future works. (autor)

  9. Optimization of the core configuration design using a hybrid artificial intelligence algorithm for research reactors

    International Nuclear Information System (INIS)

    Hedayat, Afshin; Davilu, Hadi; Barfrosh, Ahmad Abdollahzadeh; Sepanloo, Kamran

    2009-01-01

    To successfully carry out material irradiation experiments and radioisotope productions, a high thermal neutron flux at irradiation box over a desired life time of a core configuration is needed. On the other hand, reactor safety and operational constraints must be preserved during core configuration selection. Two main objectives and two safety and operational constraints are suggested to optimize reactor core configuration design. Suggested parameters and conditions are considered as two separate fitness functions composed of two main objectives and two penalty functions. This is a constrained and combinatorial type of a multi-objective optimization problem. In this paper, a fast and effective hybrid artificial intelligence algorithm is introduced and developed to reach a Pareto optimal set. The hybrid algorithm is composed of a fast and elitist multi-objective genetic algorithm (GA) and a fast fitness function evaluating system based on the cascade feed forward artificial neural networks (ANNs). A specific GA representation of core configuration and also special GA operators are introduced and used to overcome the combinatorial constraints of this optimization problem. A software package (Core Pattern Calculator 1) is developed to prepare and reform required data for ANNs training and also to revise the optimization results. Some practical test parameters and conditions are suggested to adjust main parameters of the hybrid algorithm. Results show that introduced ANNs can be trained and estimate selected core parameters of a research reactor very quickly. It improves effectively optimization process. Final optimization results show that a uniform and dense diversity of Pareto fronts are gained over a wide range of fitness function values. To take a more careful selection of Pareto optimal solutions, a revision system is introduced and used. The revision of gained Pareto optimal set is performed by using developed software package. Also some secondary operational

  10. Optimization of the core configuration design using a hybrid artificial intelligence algorithm for research reactors

    Energy Technology Data Exchange (ETDEWEB)

    Hedayat, Afshin, E-mail: ahedayat@aut.ac.i [Department of Nuclear Engineering and Physics, Amirkabir University of Technology (Tehran Polytechnic), 424 Hafez Avenue, P.O. Box 15875-4413, Tehran (Iran, Islamic Republic of); Reactor Research and Development School, Nuclear Science and Technology Research Institute (NSTRI), End of North Karegar Street, P.O. Box 14395-836, Tehran (Iran, Islamic Republic of); Davilu, Hadi [Department of Nuclear Engineering and Physics, Amirkabir University of Technology (Tehran Polytechnic), 424 Hafez Avenue, P.O. Box 15875-4413, Tehran (Iran, Islamic Republic of); Barfrosh, Ahmad Abdollahzadeh [Department of Computer Engineering, Amirkabir University of Technology (Tehran Polytechnic), 424 Hafez Avenue, P.O. Box 15875-4413, Tehran (Iran, Islamic Republic of); Sepanloo, Kamran [Reactor Research and Development School, Nuclear Science and Technology Research Institute (NSTRI), End of North Karegar Street, P.O. Box 14395-836, Tehran (Iran, Islamic Republic of)

    2009-12-15

    To successfully carry out material irradiation experiments and radioisotope productions, a high thermal neutron flux at irradiation box over a desired life time of a core configuration is needed. On the other hand, reactor safety and operational constraints must be preserved during core configuration selection. Two main objectives and two safety and operational constraints are suggested to optimize reactor core configuration design. Suggested parameters and conditions are considered as two separate fitness functions composed of two main objectives and two penalty functions. This is a constrained and combinatorial type of a multi-objective optimization problem. In this paper, a fast and effective hybrid artificial intelligence algorithm is introduced and developed to reach a Pareto optimal set. The hybrid algorithm is composed of a fast and elitist multi-objective genetic algorithm (GA) and a fast fitness function evaluating system based on the cascade feed forward artificial neural networks (ANNs). A specific GA representation of core configuration and also special GA operators are introduced and used to overcome the combinatorial constraints of this optimization problem. A software package (Core Pattern Calculator 1) is developed to prepare and reform required data for ANNs training and also to revise the optimization results. Some practical test parameters and conditions are suggested to adjust main parameters of the hybrid algorithm. Results show that introduced ANNs can be trained and estimate selected core parameters of a research reactor very quickly. It improves effectively optimization process. Final optimization results show that a uniform and dense diversity of Pareto fronts are gained over a wide range of fitness function values. To take a more careful selection of Pareto optimal solutions, a revision system is introduced and used. The revision of gained Pareto optimal set is performed by using developed software package. Also some secondary operational

  11. A non-algorithmic approach to the In-core-fuel management problem of a PWR core

    International Nuclear Information System (INIS)

    Kimhy, Y.

    1992-03-01

    The primary objective of a commercial nuclear power plant operation is to produce electricity a low cost while satisfying safety constraints imposed on the operating conditions. Design of a fuel reload cycle for the current generation nuclear power plant represents a multistage process with a series of design decisions taken at various time points. Of these stages, reload core design is an important stage, due to its impact on safety and economic plant performance parameters. Overall. performance of the plant during the power production cycle depends on chosen fresh fuel parameters, as well as specific fuel configuration of the reactor core. The motivation to computerize generation and optimization of fuel reload configurations follows from some reasons: first, reload is performed periodically and requires manipulation of a large amount of data. second, in recent years, more complicated fuel loading patterns were developed and implemented following changes in fuel design and/or operational requirements, such as, longer cycles, advanced burnable poison designs, low leakage loading patterns and reduction of irradiation-induced damage of the pressure vessel. An algorithmic approach to the problem was generally adopted. The nature of the reload design process is a 'heuristic' search performed manually by a fuel manager. The knowledge used by the fuel manager is mostly accumulated experience in reactor physics and core calculations. These features of the problem and the inherent disadvantage of the algorithmic method are the main reasons to explore a non-algorithmic approach for solving the reload configuration problem. Several features of the 'solutions space' ( a collection of acceptable final configurations ) are emphasized in this work: 1) the space contain numerous number of entities (> 25) that are distributed un homogeneously, 2) the lack of a monotonic objective function decrease the probability to find an isolated optimum configuration by depth first search or

  12. Heuristic rules embedded genetic algorithm for in-core fuel management optimization

    Science.gov (United States)

    Alim, Fatih

    The objective of this study was to develop a unique methodology and a practical tool for designing loading pattern (LP) and burnable poison (BP) pattern for a given Pressurized Water Reactor (PWR) core. Because of the large number of possible combinations for the fuel assembly (FA) loading in the core, the design of the core configuration is a complex optimization problem. It requires finding an optimal FA arrangement and BP placement in order to achieve maximum cycle length while satisfying the safety constraints. Genetic Algorithms (GA) have been already used to solve this problem for LP optimization for both PWR and Boiling Water Reactor (BWR). The GA, which is a stochastic method works with a group of solutions and uses random variables to make decisions. Based on the theories of evaluation, the GA involves natural selection and reproduction of the individuals in the population for the next generation. The GA works by creating an initial population, evaluating it, and then improving the population by using the evaluation operators. To solve this optimization problem, a LP optimization package, GARCO (Genetic Algorithm Reactor Code Optimization) code is developed in the framework of this thesis. This code is applicable for all types of PWR cores having different geometries and structures with an unlimited number of FA types in the inventory. To reach this goal, an innovative GA is developed by modifying the classical representation of the genotype. To obtain the best result in a shorter time, not only the representation is changed but also the algorithm is changed to use in-core fuel management heuristics rules. The improved GA code was tested to demonstrate and verify the advantages of the new enhancements. The developed methodology is explained in this thesis and preliminary results are shown for the VVER-1000 reactor hexagonal geometry core and the TMI-1 PWR. The improved GA code was tested to verify the advantages of new enhancements. The core physics code

  13. Finite Volumes Discretization of Topology Optimization Problems

    DEFF Research Database (Denmark)

    Evgrafov, Anton; Gregersen, Misha Marie; Sørensen, Mads Peter

    , FVMs represent a standard method of discretization within engineering communities dealing with computational uid dy- namics, transport, and convection-reaction problems. Among various avours of FVMs, cell based approaches, where all variables are associated only with cell centers, are particularly...... computations is done using nite element methods (FEMs). Despite some limited recent eorts [1, 2], we have only started to develop our understanding of the interplay between the control in the coecients and FVMs. Recent advances in discrete functional analysis allow us to analyze convergence of FVM...... of the induced parametrization of the design space that allows optimization algorithms to eciently explore it, and the ease of integration with existing computational codes in a variety of application areas, the simplicity and eciency of sensitivity analyses|all stemming from the use of the same grid throughout...

  14. Optimization methods for activities selection problems

    Science.gov (United States)

    Mahad, Nor Faradilah; Alias, Suriana; Yaakop, Siti Zulaika; Arshad, Norul Amanina Mohd; Mazni, Elis Sofia

    2017-08-01

    Co-curriculum activities must be joined by every student in Malaysia and these activities bring a lot of benefits to the students. By joining these activities, the students can learn about the time management and they can developing many useful skills. This project focuses on the selection of co-curriculum activities in secondary school using the optimization methods which are the Analytic Hierarchy Process (AHP) and Zero-One Goal Programming (ZOGP). A secondary school in Negeri Sembilan, Malaysia was chosen as a case study. A set of questionnaires were distributed randomly to calculate the weighted for each activity based on the 3 chosen criteria which are soft skills, interesting activities and performances. The weighted was calculated by using AHP and the results showed that the most important criteria is soft skills. Then, the ZOGP model will be analyzed by using LINGO Software version 15.0. There are two priorities to be considered. The first priority which is to minimize the budget for the activities is achieved since the total budget can be reduced by RM233.00. Therefore, the total budget to implement the selected activities is RM11,195.00. The second priority which is to select the co-curriculum activities is also achieved. The results showed that 9 out of 15 activities were selected. Thus, it can concluded that AHP and ZOGP approach can be used as the optimization methods for activities selection problem.

  15. A higher order depletion perturbation theory with application to in-core fuel management optimization

    International Nuclear Information System (INIS)

    Kropaczek, D.J.; Turinsky, P.J.

    1990-01-01

    Perturbation techniques utilized in reactor analysis have recently been applied in the solution of the in-core nuclear fuel management optimization problem. The use of such methods is motivated by the need to evaluate many times over, the core physics characteristics of loading pattern solutions obtained through an optimization process, which is typically iterative. Perturbation theory provides an efficient alternative to the prohibitively expensive, repetitive solutions of the system few-group neutron diffusion equations required in solving the fuel placement problem. A primary concern in the use of such methods is the control of perturbation errors arising during the fuel shuffling process. First-order accurate models inevitably resort to undue restriction of fuel movement during the optimization process to control these errors. Higher order perturbation theory models have the potential to overcome such limitations, which may result in the identification of local versus global optima. An accurate, computationally efficient reactor physics model based on higher order perturbation theory and geared toward the needs of large-scale in-core fuel management optimization is presented in this paper

  16. Multi-objective and multi-physics optimization methodology for SFR core: application to CFV concept

    International Nuclear Information System (INIS)

    Fabbris, Olivier

    2014-01-01

    Nuclear reactor core design is a highly multidisciplinary task where neutronics, thermal-hydraulics, fuel thermo-mechanics and fuel cycle are involved. The problem is moreover multi-objective (several performances) and highly dimensional (several tens of design parameters).As the reference deterministic calculation codes for core characterization require important computing resources, the classical design method is not well suited to investigate and optimize new innovative core concepts. To cope with these difficulties, a new methodology has been developed in this thesis. Our work is based on the development and validation of simplified neutronics and thermal-hydraulics calculation schemes allowing the full characterization of Sodium-cooled Fast Reactor core regarding both neutronics performances and behavior during thermal hydraulic dimensioning transients.The developed methodology uses surrogate models (or meta-models) able to replace the neutronics and thermal-hydraulics calculation chain. Advanced mathematical methods for the design of experiment, building and validation of meta-models allows substituting this calculation chain by regression models with high prediction capabilities.The methodology is applied on a very large design space to a challenging core called CFV (French acronym for low void effect core) with a large gain on the sodium void effect. Global sensitivity analysis leads to identify the significant design parameters on the core design and its behavior during unprotected transient which can lead to severe accidents. Multi-objective optimizations lead to alternative core configurations with significantly improved performances. Validation results demonstrate the relevance of the methodology at the pre-design stage of a Sodium-cooled Fast Reactor core. (author) [fr

  17. Accelerating the SCE-UA Global Optimization Method Based on Multi-Core CPU and Many-Core GPU

    Directory of Open Access Journals (Sweden)

    Guangyuan Kan

    2016-01-01

    Full Text Available The famous global optimization SCE-UA method, which has been widely used in the field of environmental model parameter calibration, is an effective and robust method. However, the SCE-UA method has a high computational load which prohibits the application of SCE-UA to high dimensional and complex problems. In recent years, the hardware of computer, such as multi-core CPUs and many-core GPUs, improves significantly. These much more powerful new hardware and their software ecosystems provide an opportunity to accelerate the SCE-UA method. In this paper, we proposed two parallel SCE-UA methods and implemented them on Intel multi-core CPU and NVIDIA many-core GPU by OpenMP and CUDA Fortran, respectively. The Griewank benchmark function was adopted in this paper to test and compare the performances of the serial and parallel SCE-UA methods. According to the results of the comparison, some useful advises were given to direct how to properly use the parallel SCE-UA methods.

  18. Core optimization studies for a small heating reactor

    International Nuclear Information System (INIS)

    Galperin, A.

    1986-11-01

    Small heating reactor cores are characterized by a high contribution of the leakage to the neutron balance and by a large power density variation in the axial direction. A limited number of positions is available for the control rods, which are necessary to satisfy overall reactivity requirements subject to a safety related constraint on the maximum worth of each rod. Design approaches aimed to improve safety and fuel utilization performance of the core include separation of the cooling and moderating functions of the water with the core in order to reduce hot-to-cold reactivity shift and judicious application of the axial Gd zoning aimed to improve the discharge burnup distribution. Several design options are analyzed indicating a satisfactory solution of the axial burnup distribution problem. The feasibility of the control rod system including zircaloy, stainless steel, natural boron and possibly enriched boron rods is demonstrated. A preliminary analysis indicates directions for further improvements of the core performance by an additional reduction of the hot-to-cold reactivity shift and by a reduction of the depletion reactivity swing adopting a higher gadolinium concentration in the fuel or a two-batch fuel management scheme. (author)

  19. A supercomputing application for reactors core design and optimization

    International Nuclear Information System (INIS)

    Hourcade, Edouard; Gaudier, Fabrice; Arnaud, Gilles; Funtowiez, David; Ammar, Karim

    2010-01-01

    Advanced nuclear reactor designs are often intuition-driven processes where designers first develop or use simplified simulation tools for each physical phenomenon involved. Through the project development, complexity in each discipline increases and implementation of chaining/coupling capabilities adapted to supercomputing optimization process are often postponed to a further step so that task gets increasingly challenging. In the context of renewal in reactor designs, project of first realization are often run in parallel with advanced design although very dependant on final options. As a consequence, the development of tools to globally assess/optimize reactor core features, with the on-going design methods accuracy, is needed. This should be possible within reasonable simulation time and without advanced computer skills needed at project management scale. Also, these tools should be ready to easily cope with modeling progresses in each discipline through project life-time. An early stage development of multi-physics package adapted to supercomputing is presented. The URANIE platform, developed at CEA and based on the Data Analysis Framework ROOT, is very well adapted to this approach. It allows diversified sampling techniques (SRS, LHS, qMC), fitting tools (neuronal networks...) and optimization techniques (genetic algorithm). Also data-base management and visualization are made very easy. In this paper, we'll present the various implementing steps of this core physics tool where neutronics, thermo-hydraulics, and fuel mechanics codes are run simultaneously. A relevant example of optimization of nuclear reactor safety characteristics will be presented. Also, flexibility of URANIE tool will be illustrated with the presentation of several approaches to improve Pareto front quality. (author)

  20. Nuclear many-body problem with repulsive hard core interactions

    Energy Technology Data Exchange (ETDEWEB)

    Haddad, L M

    1965-07-01

    The nuclear many-body problem is considered using the perturbation-theoretic approach of Brueckner and collaborators. This approach is outlined with particular attention paid to the graphical representation of the terms in the perturbation expansion. The problem is transformed to centre-of-mass coordinates in configuration space and difficulties involved in ordinary methods of solution of the resulting equation are discussed. A new technique, the 'reference spectrum method', devised by Bethe, Brandow and Petschek in an attempt to simplify the numerical work in presented. The basic equations are derived in this approximation and considering the repulsive hard core part of the interaction only, the effective mass is calculated at high momentum (using the same energy spectrum for both 'particle' and 'hole' states). The result of 0.87m is in agreement with that of Bethe et al. A more complete treatment using the reference spectrum method in introduced and a self-consistent set of equations is established for the reference spectrum parameters again for the case of hard core repulsions. (author)

  1. Performance of Estimation of distribution algorithm for initial core loading optimization of AHWR-LEU

    International Nuclear Information System (INIS)

    Thakur, Amit; Singh, Baltej; Gupta, Anurag; Duggal, Vibhuti; Bhatt, Kislay; Krishnani, P.D.

    2016-01-01

    Highlights: • EDA has been applied to optimize initial core of AHWR-LEU. • Suitable value of weighing factor ‘α’ and population size in EDA was estimated. • The effect of varying initial distribution function on optimized solution was studied. • For comparison, Genetic algorithm was also applied. - Abstract: Population based evolutionary algorithms now form an integral part of fuel management in nuclear reactors and are frequently being used for fuel loading pattern optimization (LPO) problems. In this paper we have applied Estimation of distribution algorithm (EDA) to optimize initial core loading pattern (LP) of AHWR-LEU. In EDA, new solutions are generated by sampling the probability distribution model estimated from the selected best candidate solutions. The weighing factor ‘α’ decides the fraction of current best solution for updating the probability distribution function after each generation. A wider use of EDA warrants a comprehensive study on parameters like population size, weighing factor ‘α’ and initial probability distribution function. In the present study, we have done an extensive analysis on these parameters (population size, weighing factor ‘α’ and initial probability distribution function) in EDA. It is observed that choosing a very small value of ‘α’ may limit the search of optimized solutions in the near vicinity of initial probability distribution function and better loading patterns which are away from initial distribution function may not be considered with due weightage. It is also observed that increasing the population size improves the optimized loading pattern, however the algorithm still fails if the initial distribution function is not close to the expected optimized solution. We have tried to find out the suitable values for ‘α’ and population size to be considered for AHWR-LEU initial core loading pattern optimization problem. For sake of comparison and completeness, we have also addressed the

  2. The core of the global warming problem: energy

    International Nuclear Information System (INIS)

    Hu, E.

    2005-01-01

    From the thermodynamic point of view, the global warming problem is an 'energy balance' problem. The heat (energy) accumulation in the earth and its atmosphere is the cause of global warming. This accumulation is mainly due to the imbalance of (solar) energy reaching and the energy leaving the earth, caused by 'greenhouse effect' in which the CO 2 and other greenhouse gases play a critical role; so that balance of the energy entering and leaving the earth should be the key to solve the problem. Currently in the battle of tackling the global warming, we mainly focus on the development of CO 2 -related measures, i.e., emission reduction, CO 2 sequestration, and CO 2 recycle technologies. It is right in technical aspect, because they are attempting to thin the CO 2 'blanket' around the earth. However, 'Energy' that is the core of the problem has been overlooked, at least in management/policy aspect. This paper is proposing an 'Energy Credit' i.e., the energy measure concept as an alternative to the 'CO 2 credit' that is currently in place in the proposed emission trading scheme. The proposed energy credit concept has the advantages such as covering broad activities related to the global warming and not just direct emissions. Three examples are given in the paper to demonstrate the concept of the energy measure and its advantages over the CO 2 credit concept. (Author)

  3. MTR core loading pattern optimization using burnup dependent group constants

    Directory of Open Access Journals (Sweden)

    Iqbal Masood

    2008-01-01

    Full Text Available A diffusion theory based MTR fuel management methodology has been developed for finding superior core loading patterns at any stage for MTR systems, keeping track of burnup of individual fuel assemblies throughout their history. It is based on using burnup dependent group constants obtained by the WIMS-D/4 computer code for standard fuel elements and control fuel elements. This methodology has been implemented in a computer program named BFMTR, which carries out detailed five group diffusion theory calculations using the CITATION code as a subroutine. The core-wide spatial flux and power profiles thus obtained are used for calculating the peak-to-average power and flux-ratios along with the available excess reactivity of the system. The fuel manager can use the BFMTR code for loading pattern optimization for maximizing the excess reactivity, keeping the peak-to-average power as well as flux-ratio within constraints. The results obtained by the BFMTR code have been found to be in good agreement with the corresponding experimental values for the equilibrium core of the Pakistan Research Reactor-1.

  4. A hybrid method for in-core optimization of pressurized water reactor reload core design

    International Nuclear Information System (INIS)

    Stevens, J.G.

    1995-05-01

    The objective of this research is the development of an accurate, practical, and robust method for optimization of the design of loading patterns for pressurized water reactors, a nonlinear, non-convex, integer optimization problem. The many logical constraints which may be applied during the design process are modeled herein by a network construction upon which performance objectives and safety constraints from reactor physics calculations are optimized. This thesis presents the synthesis of the strengths of previous algorithms developed for reload design optimization and extension of robustness through development of a hybrid liberated search algorithm. Development of three independent methods for reload design optimization is presented: random direct search for local improvement, liberated search by simulated annealing, and deterministic search for local improvement via successive linear assignment by branch and bound. Comparative application of the methods to a variety of problems is discussed, including an exhaustive enumeration benchmark created to allow comparison of search results to a known global optimum for a large scale problem. While direct search and determinism are shown to be capable of finding improvement, only the liberation of simulated annealing is found to perform robustly in the non-convex design spaces. The hybrid method SHAMAN is presented. The algorithm applies: determinism to shuffle an initial solution for satisfaction of heuristics and symmetry; liberated search through simulated annealing with a bounds cooling constraint treatment; and search bias through relational heuristics for the application of engineering judgment. The accuracy, practicality, and robustness of the SHAMAN algorithm is demonstrated through application to a variety of reload loading pattern optimization problems

  5. A multi-cycle optimization approach for low leakage in-core fuel management

    International Nuclear Information System (INIS)

    Cheng Pingdong; Shen Wei

    1999-01-01

    A new approach was developed to optimize pressurized waster reactor (PWR) low-leakage multi-cycle reload core design. The multi-cycle optimization process is carried out by the following three steps: The first step is a linear programming in search for an optimum power sharing distribution and optimum cycle length distribution for the successive several cycles to yield maximum multi-cycle total cycle length. In the second step, the fuel arrangement and burnable poison (BP) assignment are decoupled by using Haling power distribution and the optimum fuel arrangement is determined at the EOL in the absence of all BPs by employing a linear programming method or direct search method with objective function to force the calculated cycle length to be as close as possible to the optimum single cycle length obtained in the first step and with optimum power sharing distribution as additional constraints during optimization. In the third step, the BP assignment is optimized by the Flexible Tolerance Method (FTM) or linear programming method using the number of BP rods as control variable. The technology employed in the second and third steps was the usual decoupling method used in low-leakage core design. The first step was developed specially for multi-cycle optimization design and discussed in detail. Based on the proposed method a computer code MCYCO was encoded and tested for Qinshan Nuclear Power Plant (QNPP) low leakage reload core design. The multi-cycle optimization method developed, together with the program MCYCO, provides an applicable tool for solving the PWR low leakage reload core design problem

  6. Optimal management with hybrid dynamics : The shallow lake problem

    NARCIS (Netherlands)

    Reddy, P.V.; Schumacher, Hans; Engwerda, Jacob; Camlibel, M.K.; Julius, A.A.; Pasumarthy, R.

    2015-01-01

    In this article we analyze an optimal management problem that arises in ecological economics using hybrid systems modeling. First, we introduce a discounted autonomous infinite horizon hybrid optimal control problem and develop few tools to analyze the necessary conditions for optimality. Next,

  7. On a Highly Nonlinear Self-Obstacle Optimal Control Problem

    Energy Technology Data Exchange (ETDEWEB)

    Di Donato, Daniela, E-mail: daniela.didonato@unitn.it [University of Trento, Department of Mathematics (Italy); Mugnai, Dimitri, E-mail: dimitri.mugnai@unipg.it [Università di Perugia, Dipartimento di Matematica e Informatica (Italy)

    2015-10-15

    We consider a non-quadratic optimal control problem associated to a nonlinear elliptic variational inequality, where the obstacle is the control itself. We show that, fixed a desired profile, there exists an optimal solution which is not far from it. Detailed characterizations of the optimal solution are given, also in terms of approximating problems.

  8. A note on the depth function of combinatorial optimization problems

    NARCIS (Netherlands)

    Woeginger, G.J.

    2001-01-01

    In a recent paper [Discrete Appl. Math. 43 (1993) 115–129], Kern formulates two conjectures on the relationship between the computational complexity of computing the depth function of a discrete optimization problem and the computational complexity of solving this optimization problem to optimality.

  9. An Interval Bound Algorithm of optimizing reactor core loading pattern by using reactivity interval schema

    International Nuclear Information System (INIS)

    Gong Zhaohu; Wang Kan; Yao Dong

    2011-01-01

    Highlights: → We present a new Loading Pattern Optimization method - Interval Bound Algorithm (IBA). → IBA directly uses the reactivity of fuel assemblies and burnable poison. → IBA can optimize fuel assembly orientation in a coupled way. → Numerical experiment shows that IBA outperforms genetic algorithm and engineers. → We devise DDWF technique to deal with multiple objectives and constraints. - Abstract: In order to optimize the core loading pattern in Nuclear Power Plants, the paper presents a new optimization method - Interval Bound Algorithm (IBA). Similar to the typical population based algorithms, e.g. genetic algorithm, IBA maintains a population of solutions and evolves them during the optimization process. IBA acquires the solution by statistical learning and sampling the control variable intervals of the population in each iteration. The control variables are the transforms of the reactivity of fuel assemblies or the worth of burnable poisons, which are the crucial heuristic information for loading pattern optimization problems. IBA can deal with the relationship between the dependent variables by defining the control variables. Based on the IBA algorithm, a parallel Loading Pattern Optimization code, named IBALPO, has been developed. To deal with multiple objectives and constraints, the Dynamic Discontinuous Weight Factors (DDWF) for the fitness function have been used in IBALPO. Finally, the code system has been used to solve a realistic reloading problem and a better pattern has been obtained compared with the ones searched by engineers and genetic algorithm, thus the performance of the code is proved.

  10. A nuclear heuristic for application to metaheuristics in-core fuel management optimization

    Energy Technology Data Exchange (ETDEWEB)

    Meneses, Anderson Alvarenga de Moura, E-mail: ameneses@lmp.ufrj.b [COPPE/Federal University of Rio de Janeiro, RJ (Brazil). Nuclear Engineering Program; Dalle Molle Institute for Artificial Intelligence (IDSIA), Manno-Lugano, TI (Switzerland); Gambardella, Luca Maria, E-mail: luca@idsia.c [Dalle Molle Institute for Artificial Intelligence (IDSIA), Manno-Lugano, TI (Switzerland); Schirru, Roberto, E-mail: schirru@lmp.ufrj.b [COPPE/Federal University of Rio de Janeiro, RJ (Brazil). Nuclear Engineering Program

    2009-07-01

    The In-Core Fuel Management Optimization (ICFMO) is a well-known problem of nuclear engineering whose features are complexity, high number of feasible solutions, and a complex evaluation process with high computational cost, thus it is prohibitive to have a great number of evaluations during an optimization process. Heuristics are criteria or principles for deciding which among several alternative courses of action are more effective with respect to some goal. In this paper, we propose a new approach for the use of relational heuristics for the search in the ICFMO. The Heuristic is based on the reactivity of the fuel assemblies and their position into the reactor core. It was applied to random search, resulting in less computational effort concerning the number of evaluations of loading patterns during the search. The experiments demonstrate that it is possible to achieve results comparable to results in the literature, for future application to metaheuristics in the ICFMO. (author)

  11. A nuclear heuristic for application to metaheuristics in-core fuel management optimization

    International Nuclear Information System (INIS)

    Meneses, Anderson Alvarenga de Moura; Gambardella, Luca Maria; Schirru, Roberto

    2009-01-01

    The In-Core Fuel Management Optimization (ICFMO) is a well-known problem of nuclear engineering whose features are complexity, high number of feasible solutions, and a complex evaluation process with high computational cost, thus it is prohibitive to have a great number of evaluations during an optimization process. Heuristics are criteria or principles for deciding which among several alternative courses of action are more effective with respect to some goal. In this paper, we propose a new approach for the use of relational heuristics for the search in the ICFMO. The Heuristic is based on the reactivity of the fuel assemblies and their position into the reactor core. It was applied to random search, resulting in less computational effort concerning the number of evaluations of loading patterns during the search. The experiments demonstrate that it is possible to achieve results comparable to results in the literature, for future application to metaheuristics in the ICFMO. (author)

  12. Optimization of the coherence function estimation for multi-core central processing unit

    Science.gov (United States)

    Cheremnov, A. G.; Faerman, V. A.; Avramchuk, V. S.

    2017-02-01

    The paper considers use of parallel processing on multi-core central processing unit for optimization of the coherence function evaluation arising in digital signal processing. Coherence function along with other methods of spectral analysis is commonly used for vibration diagnosis of rotating machinery and its particular nodes. An algorithm is given for the function evaluation for signals represented with digital samples. The algorithm is analyzed for its software implementation and computational problems. Optimization measures are described, including algorithmic, architecture and compiler optimization, their results are assessed for multi-core processors from different manufacturers. Thus, speeding-up of the parallel execution with respect to sequential execution was studied and results are presented for Intel Core i7-4720HQ и AMD FX-9590 processors. The results show comparatively high efficiency of the optimization measures taken. In particular, acceleration indicators and average CPU utilization have been significantly improved, showing high degree of parallelism of the constructed calculating functions. The developed software underwent state registration and will be used as a part of a software and hardware solution for rotating machinery fault diagnosis and pipeline leak location with acoustic correlation method.

  13. Progress and problems in modelling HTR core dynamics

    International Nuclear Information System (INIS)

    Scherer, W.; Gerwin, H.

    1991-01-01

    In recent years greater effort has been made to establish theoretical models for HTR core dynamics. At KFA Juelich the TINTE (TIme dependent Neutronics and TEmperatures) code system has been developed, which is able to model the primary circuit of an HTR plant using modern numerical techniques and taking into account the mutual interference of the relevant physical variables. The HTR core is treated in 2-D R-Z geometry for both nucleonics and thermo-fluid-dynamics. 2-energy-group diffusion theory is used in the nuclear part including 6 groups of delayed neutron precursors and 14 groups of decay heat producers. Local and non-local heat sources are incorporated, thus simulating gamma ray transport. The thermo-fluid-dynamics module accounts for heterogeneity effects due to the pebble bed structure. Pipes and other components of the primary loop are modelled in 1-D geometry. Forced convection may be treated as well as natural convection in case of blower breakdown accidents. Validation of TINTE has started using the results of a comprehensive experimental program that has been performed at the Arbeitsgemeinschaft Versuchsreaktor GmbH (AVR) high temperature pebble bed reactor at Juelich. In the frame of this program power transients were initiated by varying the helium blower rotational speed or by moving the control rods. In most cases a good accordance between experiment and calculation was found. Problems in modelling the special AVR reactor geometry in two dimensions are described and suggestions for overcoming the uncertainties of experimentally determined control rod reactivities are given. The influence of different polynomial expansions of xenon cross sections to long term transients is discussed together with effects of burnup during that time. Up to now the TINTE code has proven its general applicability to operational core transients of HTR. The effects of water ingress on reactivity, fuel element corrosion and cooling gas properties are now being

  14. Replica analysis for the duality of the portfolio optimization problem.

    Science.gov (United States)

    Shinzato, Takashi

    2016-11-01

    In the present paper, the primal-dual problem consisting of the investment risk minimization problem and the expected return maximization problem in the mean-variance model is discussed using replica analysis. As a natural extension of the investment risk minimization problem under only a budget constraint that we analyzed in a previous study, we herein consider a primal-dual problem in which the investment risk minimization problem with budget and expected return constraints is regarded as the primal problem, and the expected return maximization problem with budget and investment risk constraints is regarded as the dual problem. With respect to these optimal problems, we analyze a quenched disordered system involving both of these optimization problems using the approach developed in statistical mechanical informatics and confirm that both optimal portfolios can possess the primal-dual structure. Finally, the results of numerical simulations are shown to validate the effectiveness of the proposed method.

  15. Replica analysis for the duality of the portfolio optimization problem

    Science.gov (United States)

    Shinzato, Takashi

    2016-11-01

    In the present paper, the primal-dual problem consisting of the investment risk minimization problem and the expected return maximization problem in the mean-variance model is discussed using replica analysis. As a natural extension of the investment risk minimization problem under only a budget constraint that we analyzed in a previous study, we herein consider a primal-dual problem in which the investment risk minimization problem with budget and expected return constraints is regarded as the primal problem, and the expected return maximization problem with budget and investment risk constraints is regarded as the dual problem. With respect to these optimal problems, we analyze a quenched disordered system involving both of these optimization problems using the approach developed in statistical mechanical informatics and confirm that both optimal portfolios can possess the primal-dual structure. Finally, the results of numerical simulations are shown to validate the effectiveness of the proposed method.

  16. Intelligent stochastic optimization routine for in-core fuel cycle design

    International Nuclear Information System (INIS)

    Parks, G.T.

    1988-01-01

    Any reactor fuel management strategy must specify the fuel design, batch sizes, loading configurations, and operational procedures for each cycle. To permit detailed design studies, the complex core characteristics must necessarily be computer modeled. Thus, the identification of an optimal fuel cycle design represents an optimization problem with a nonlinear objective function (OF), nonlinear safety constraints, many control variables, and no direct derivative information. Most available library routines cannot tackle such problems; this paper introduces an intelligent stochastic optimization routine that can. There has been considerable interest recently in the application of stochastic methods to difficult optimization problems, based on the statistical mechanics algorithms originally attributed to Metropolis. Previous work showed that, in optimizing the performance of a British advanced gas-cooled reactor fuel stringer, a rudimentary version of the Metropolis algorithm performed as efficiently as the only suitable routine in the Numerical Algorithms Group library. Since then the performance of the Metropolis algorithm has been considerably enhanced by the introduction of self-tuning capabilities by which the routine adjusts its control parameters and search pattern as it progresses. Both features can be viewed as examples of artificial intelligence, in which the routine uses the accumulation of data, or experience, to guide its future actions

  17. Toward solving the sign problem with path optimization method

    Science.gov (United States)

    Mori, Yuto; Kashiwa, Kouji; Ohnishi, Akira

    2017-12-01

    We propose a new approach to circumvent the sign problem in which the integration path is optimized to control the sign problem. We give a trial function specifying the integration path in the complex plane and tune it to optimize the cost function which represents the seriousness of the sign problem. We call it the path optimization method. In this method, we do not need to solve the gradient flow required in the Lefschetz-thimble method and then the construction of the integration-path contour arrives at the optimization problem where several efficient methods can be applied. In a simple model with a serious sign problem, the path optimization method is demonstrated to work well; the residual sign problem is resolved and precise results can be obtained even in the region where the global sign problem is serious.

  18. An optimal design problem in wave propagation

    DEFF Research Database (Denmark)

    Bellido, J.C.; Donoso, Alberto

    2007-01-01

    of finding the best distributions of the two initial materials in a rod in order to minimize the vibration energy in the structure under periodic loading of driving frequency Omega. We comment on relaxation and optimality conditions, and perform numerical simulations of the optimal configurations. We prove...... also the existence of classical solutions in certain cases....

  19. Identification and optimization problems in plasma physics

    International Nuclear Information System (INIS)

    Gilbert, J.C.

    1986-06-01

    Parameter identification of the current in a tokamak plasma is studied. Plasma equilibrium in a vacuum container with a diaphragm is analyzed. A variable metric method with reduced optimization with nonlinear equality constraints; and a quasi-Newton reduced optimization method with constraints giving priority to restoration are presented [fr

  20. Particle swarm optimization - Genetic algorithm (PSOGA) on linear transportation problem

    Science.gov (United States)

    Rahmalia, Dinita

    2017-08-01

    Linear Transportation Problem (LTP) is the case of constrained optimization where we want to minimize cost subject to the balance of the number of supply and the number of demand. The exact method such as northwest corner, vogel, russel, minimal cost have been applied at approaching optimal solution. In this paper, we use heurisitic like Particle Swarm Optimization (PSO) for solving linear transportation problem at any size of decision variable. In addition, we combine mutation operator of Genetic Algorithm (GA) at PSO to improve optimal solution. This method is called Particle Swarm Optimization - Genetic Algorithm (PSOGA). The simulations show that PSOGA can improve optimal solution resulted by PSO.

  1. Optimal solutions for routing problems with profits

    NARCIS (Netherlands)

    Archetti, C.; Bianchessi, N.; Speranza, M. G.

    2013-01-01

    In this paper, we present a branch-and-price algorithm to solve two well-known vehicle routing problems with profits, the Capacitated Team Orienteering Problem and the Capacitated Profitable Tour Problem. A restricted master heuristic is applied at each node of the branch-and-bound tree in order to

  2. ISOGEOMETRIC SHAPE OPTIMIZATION FOR ELECTROMAGNETIC SCATTERING PROBLEMS

    DEFF Research Database (Denmark)

    Nguyen, D. M.; Evgrafov, Anton; Gravesen, Jens

    2012-01-01

    We consider the benchmark problem of magnetic energy density enhancement in a small spatial region by varying the shape of two symmetric conducting scatterers. We view this problem as a prototype for a wide variety of geometric design problems in electromagnetic applications. Our approach...

  3. Advances in bio-inspired computing for combinatorial optimization problems

    CERN Document Server

    Pintea, Camelia-Mihaela

    2013-01-01

    Advances in Bio-inspired Combinatorial Optimization Problems' illustrates several recent bio-inspired efficient algorithms for solving NP-hard problems.Theoretical bio-inspired concepts and models, in particular for agents, ants and virtual robots are described. Large-scale optimization problems, for example: the Generalized Traveling Salesman Problem and the Railway Traveling Salesman Problem, are solved and their results are discussed.Some of the main concepts and models described in this book are: inner rule to guide ant search - a recent model in ant optimization, heterogeneous sensitive a

  4. A Linearized Relaxing Algorithm for the Specific Nonlinear Optimization Problem

    Directory of Open Access Journals (Sweden)

    Mio Horai

    2016-01-01

    Full Text Available We propose a new method for the specific nonlinear and nonconvex global optimization problem by using a linear relaxation technique. To simplify the specific nonlinear and nonconvex optimization problem, we transform the problem to the lower linear relaxation form, and we solve the linear relaxation optimization problem by the Branch and Bound Algorithm. Under some reasonable assumptions, the global convergence of the algorithm is certified for the problem. Numerical results show that this method is more efficient than the previous methods.

  5. A Linear Programming Reformulation of the Standard Quadratic Optimization Problem

    NARCIS (Netherlands)

    de Klerk, E.; Pasechnik, D.V.

    2005-01-01

    The problem of minimizing a quadratic form over the standard simplex is known as the standard quadratic optimization problem (SQO).It is NPhard, and contains the maximum stable set problem in graphs as a special case.In this note we show that the SQO problem may be reformulated as an (exponentially

  6. Core scanning for Th, U and K. Problems and solutions

    International Nuclear Information System (INIS)

    Korsbech, U.

    1994-08-01

    A core scanner with a 10cm x 10cm Nal(Tl) crystal and a 256 channel analyzer has been built and calibrated for spectral gamma-ray measurement of Th, U and K in cores from boreholes. The calibration has been performed for cores of different diameters and densities, and the influence of liners, incomplete cores, and a varying core to detector distances have been investigated. A single formula for determination of the sensitivities for the window method has been developed. The stability against changes in temperature and radon background is evaluated. Proposals for an improved and faster measuring technique with two or more detectors is put forward. (au)

  7. Frequency response as a surrogate eigenvalue problem in topology optimization

    DEFF Research Database (Denmark)

    Andreassen, Erik; Ferrari, Federico; Sigmund, Ole

    2018-01-01

    This article discusses the use of frequency response surrogates for eigenvalue optimization problems in topology optimization that may be used to avoid solving the eigenvalue problem. The motivation is to avoid complications that arise from multiple eigenvalues and the computational complexity as...

  8. Ant Colony Optimization and the Minimum Cut Problem

    DEFF Research Database (Denmark)

    Kötzing, Timo; Lehre, Per Kristian; Neumann, Frank

    2010-01-01

    Ant Colony Optimization (ACO) is a powerful metaheuristic for solving combinatorial optimization problems. With this paper we contribute to the theoretical understanding of this kind of algorithm by investigating the classical minimum cut problem. An ACO algorithm similar to the one that was prov...

  9. Artificial bee colony algorithm for constrained possibilistic portfolio optimization problem

    Science.gov (United States)

    Chen, Wei

    2015-07-01

    In this paper, we discuss the portfolio optimization problem with real-world constraints under the assumption that the returns of risky assets are fuzzy numbers. A new possibilistic mean-semiabsolute deviation model is proposed, in which transaction costs, cardinality and quantity constraints are considered. Due to such constraints the proposed model becomes a mixed integer nonlinear programming problem and traditional optimization methods fail to find the optimal solution efficiently. Thus, a modified artificial bee colony (MABC) algorithm is developed to solve the corresponding optimization problem. Finally, a numerical example is given to illustrate the effectiveness of the proposed model and the corresponding algorithm.

  10. Sufficient conditions for Lagrange, Mayer, and Bolza optimization problems

    Directory of Open Access Journals (Sweden)

    Boltyanski V.

    2001-01-01

    Full Text Available The Maximum Principle [2,13] is a well known necessary condition for optimality. This condition, generally, is not sufficient. In [3], the author proved that if there exists regular synthesis of trajectories, the Maximum Principle also is a sufficient condition for time-optimality. In this article, we generalize this result for Lagrange, Mayer, and Bolza optimization problems.

  11. Optimal Control Problems for Nonlinear Variational Evolution Inequalities

    Directory of Open Access Journals (Sweden)

    Eun-Young Ju

    2013-01-01

    Full Text Available We deal with optimal control problems governed by semilinear parabolic type equations and in particular described by variational inequalities. We will also characterize the optimal controls by giving necessary conditions for optimality by proving the Gâteaux differentiability of solution mapping on control variables.

  12. Mathematical programming methods for large-scale topology optimization problems

    DEFF Research Database (Denmark)

    Rojas Labanda, Susana

    for mechanical problems, but has rapidly extended to many other disciplines, such as fluid dynamics and biomechanical problems. However, the novelty and improvements of optimization methods has been very limited. It is, indeed, necessary to develop of new optimization methods to improve the final designs......, and at the same time, reduce the number of function evaluations. Nonlinear optimization methods, such as sequential quadratic programming and interior point solvers, have almost not been embraced by the topology optimization community. Thus, this work is focused on the introduction of this kind of second...... for the classical minimum compliance problem. Two of the state-of-the-art optimization algorithms are investigated and implemented for this structural topology optimization problem. A Sequential Quadratic Programming (TopSQP) and an interior point method (TopIP) are developed exploiting the specific mathematical...

  13. On the optimization of thorium bundle distribution in the initial core loading for a PHWR

    International Nuclear Information System (INIS)

    Mishra, S.; Ray, S.; Kumar, A.N.; Modak, R.S.; Ganesan, S.

    2009-01-01

    If the initial core of Indian 220 MWe PHWR is loaded with all fresh Natural Uranium fuel, only about 70% Full Power can be drawn in the initial operation due to large power peaking. It is possible to load few tens of Th bundles at selected locations to get nearly full power without violating any safety limits. Finding the best possible locations is, however, a fairly complex and massive combinatorial optimization problem. Here, optimum solutions are obtained by a latest evolutionary algorithm called EDA implemented on the EKA built at Computational Research Laboratories (CRL) in Pune. The effect of varying the number of Th bundles on results is discussed. (author)

  14. A genetic algorithm solution for combinatorial problems - the nuclear core reload example

    Energy Technology Data Exchange (ETDEWEB)

    Schirru, R.; Silva, F.C. [Universidade Federal, Rio de Janeiro, RJ (Brazil). Coordenacao dos Programas de Pos-graduacao de Engenharia; Pereira, C.M.N.A. [Instituto de Engenharia Nuclear (IEN), Rio de Janeiro, RJ (Brazil); Chapot, J.L.C. [FURNAS, Rio de Janeiro, RJ (Brazil)

    1997-12-01

    This paper presents a solution to Traveling Salesman Problem based upon genetic algorithms (GA), using the classic crossover, but avoiding the feasibility problem in offspring individuals, allowing the natural evolution of the GA without introduction of heuristics in the genetic crossover operator. The genetic model presented, that we call the List Model (LM) is based on the encoding and decoding genotype in the way to always generate a phenotype that has a valid structure, over which will be applied the fitness, represented by the total distance. The main purpose of this work was to develop the basis for a new genetic model to be used in the reload of nuclear core of a PWR. In a generic way, this problem can be interpreted as a a search of the optimal combination of N different fuel elements in N nuclear core `holes`, where each combination or load pattern, determines the neutron flux shape and its associate peak factor. The goal is to find out the load pattern that minimizes the peak factor and consequently maximize the useful life of the nuclear fuel. The GA with the List Model was applied to the Angra-1 PWR reload problem and the results are remarkably better than the ones used in the last fuel cycle. (author). 12 refs., 3 figs., 2 tabs.

  15. 3D Topology optimization of Stokes flow problems

    DEFF Research Database (Denmark)

    Gersborg-Hansen, Allan; Dammann, Bernd

    of energy efficient devices for 2D Stokes flow. Creeping flow problems are described by the Stokes equations which model very viscous fluids at macro scales or ordinary fluids at very small scales. The latter gives the motivation for topology optimization problems based on the Stokes equations being a model......The present talk is concerned with the application of topology optimization to creeping flow problems in 3D. This research is driven by the fact that topology optimization has proven very successful as a tool in academic and industrial design problems. Success stories are reported from such diverse...

  16. Applications of functional analysis to optimal control problems

    International Nuclear Information System (INIS)

    Mizukami, K.

    1976-01-01

    Some basic concepts in functional analysis, a general norm, the Hoelder inequality, functionals and the Hahn-Banach theorem are described; a mathematical formulation of two optimal control problems is introduced by the method of functional analysis. The problem of time-optimal control systems with both norm constraints on control inputs and on state variables at discrete intermediate times is formulated as an L-problem in the theory of moments. The simplex method is used for solving a non-linear minimizing problem inherent in the functional analysis solution to this problem. Numerical results are presented for a train operation. The second problem is that of optimal control of discrete linear systems with quadratic cost functionals. The problem is concerned with the case of unconstrained control and fixed endpoints. This problem is formulated in terms of norms of functionals on suitable Banach spaces. (author)

  17. Optimization Problems in Supply Chain Management

    NARCIS (Netherlands)

    D. Romero Morales (Dolores)

    2000-01-01

    textabstractMaria Dolores Romero Morales was born on Augustus 5th, 1971, in Sevilla (Spain). She studied Mathematics at University of Sevilla from 1989 to 1994 and specialized in Statistics and Operations Research. She wrote her Master's thesis on Global Optimization in Location Theory under the

  18. Improved Ant Colony Optimization for Seafood Product Delivery Routing Problem

    Directory of Open Access Journals (Sweden)

    Baozhen Yao

    2014-02-01

    Full Text Available This paper deals with a real-life vehicle delivery routing problem, which is a seafood product delivery routing problem. Considering the features of the seafood product delivery routing problem, this paper formulated this problem as a multi-depot open vehicle routing problem. Since the multi-depot open vehicle routing problem is a very complex problem, a method is used to reduce the complexity of the problem by changing the multi-depot open vehicle routing problem into an open vehicle routing problem with a dummy central depot in this paper. Then, ant colony optimization is used to solve the problem. To improve the performance of the algorithm, crossover operation and some adaptive strategies are used. Finally, the computational results for the benchmark problems of the multi-depot vehicle routing problem indicate that the proposed ant colony optimization is an effective method to solve the multi-depot vehicle routing problem. Furthermore, the computation results of the seafood product delivery problem from Dalian, China also suggest that the proposed ant colony optimization is feasible to solve the seafood product delivery routing problem.

  19. Topology optimization of fluid-structure-interaction problems in poroelasticity

    DEFF Research Database (Denmark)

    Andreasen, Casper Schousboe; Sigmund, Ole

    2013-01-01

    This paper presents a method for applying topology optimization to fluid-structure interaction problems in saturated poroelastic media. The method relies on a multiple-scale method applied to periodic media. The resulting model couples the Stokes flow in the pores of the structure with the deform...... by topology optimization in order to optimize the performance of a shock absorber and test the pressure loading capabilities and optimization of an internally pressurized lid. © 2013 Published by Elsevier B.V....

  20. Some Optimization Problems for p-Laplacian Type Equations

    International Nuclear Information System (INIS)

    Del Pezzo, L. M.; Fernandez Bonder, J.

    2009-01-01

    In this paper we study some optimization problems for nonlinear elastic membranes. More precisely, we consider the problem of optimizing the cost functional over some admissible class of loads f where u is the (unique) solution to the problem -Δ p u+ vertical bar u vertical bar p-2 u=0 in Ω with vertical bar ∇u vertical bar p-2 u ν =f on ∂Ω

  1. Optimization design of toroidal core for magnetic energy harvesting near power line by considering saturation effect

    Science.gov (United States)

    Park, Bumjin; Kim, Dongwook; Park, Jaehyoung; Kim, Kibeom; Koo, Jay; Park, HyunHo; Ahn, Seungyoung

    2018-05-01

    Recently, magnetic energy harvesting technologies have been studied actively for self-sustainable operation of applications around power line. However, magnetic energy harvesting around power lines has the problem of magnetic saturation, which can cause power performance degradation of the harvester. In this paper, optimal design of a toroidal core for magnetic energy harvesters has been proposed with consideration of magnetic saturation near power lines. Using Permeability-H curve and Ampere's circuital law, the optimum dimensional parameters needed to generate induced voltage were analyzed via calculation and simulation. To reflect a real environment, we consider the nonlinear characteristic of the magnetic core material and supply current through a 3-phase distribution panel used in the industry. The effectiveness of the proposed design methodology is verified by experiments in a power distribution panel and takes 60.9 V from power line current of 60 A at 60 Hz.

  2. A Global Optimization Algorithm for Sum of Linear Ratios Problem

    OpenAIRE

    Yuelin Gao; Siqiao Jin

    2013-01-01

    We equivalently transform the sum of linear ratios programming problem into bilinear programming problem, then by using the linear characteristics of convex envelope and concave envelope of double variables product function, linear relaxation programming of the bilinear programming problem is given, which can determine the lower bound of the optimal value of original problem. Therefore, a branch and bound algorithm for solving sum of linear ratios programming problem is put forward, and the c...

  3. Constraint interface preconditioning for topology optimization problems

    Czech Academy of Sciences Publication Activity Database

    Kočvara, Michal; Loghin, D.; Turner, J.

    2016-01-01

    Roč. 38, č. 1 (2016), A128-A145 ISSN 1064-8275 R&D Projects: GA AV ČR IAA100750802 Grant - others:European Commission - EC(XE) 313781 Institutional support: RVO:67985556 Keywords : topology optimization * domain decomposition * Newton-Krylov Subject RIV: BA - General Mathematics Impact factor: 2.195, year: 2016 http://library.utia.cas.cz/separaty/2016/MTR/kocvara-0460325.pdf

  4. Portfolio optimization and the random magnet problem

    Science.gov (United States)

    Rosenow, B.; Plerou, V.; Gopikrishnan, P.; Stanley, H. E.

    2002-08-01

    Diversification of an investment into independently fluctuating assets reduces its risk. In reality, movements of assets are mutually correlated and therefore knowledge of cross-correlations among asset price movements are of great importance. Our results support the possibility that the problem of finding an investment in stocks which exposes invested funds to a minimum level of risk is analogous to the problem of finding the magnetization of a random magnet. The interactions for this "random magnet problem" are given by the cross-correlation matrix C of stock returns. We find that random matrix theory allows us to make an estimate for C which outperforms the standard estimate in terms of constructing an investment which carries a minimum level of risk.

  5. Topology optimization problems with design-dependent sets of constraints

    DEFF Research Database (Denmark)

    Schou, Marie-Louise Højlund

    Topology optimization is a design tool which is used in numerous fields. It can be used whenever the design is driven by weight and strength considerations. The basic concept of topology optimization is the interpretation of partial differential equation coefficients as effective material...... properties and designing through changing these coefficients. For example, consider a continuous structure. Then the basic concept is to represent this structure by small pieces of material that are coinciding with the elements of a finite element model of the structure. This thesis treats stress constrained...... structural topology optimization problems. For such problems a stress constraint for an element should only be present in the optimization problem when the structural design variable corresponding to this element has a value greater than zero. We model the stress constrained topology optimization problem...

  6. Optimal Wafer Cutting in Shuttle Layout Problems

    DEFF Research Database (Denmark)

    Nisted, Lasse; Pisinger, David; Altman, Avri

    2011-01-01

    . The shuttle layout problem is frequently solved in two phases: first, a floorplan of the shuttle is generated. Then, a cutting plan is found which minimizes the overall number of wafers needed to satisfy the demand of each die type. Since some die types require special production technologies, only compatible...

  7. Constraint Optimization for Highly Constrained Logistic Problems

    DEFF Research Database (Denmark)

    Mochnacs, Maria Kinga; Tanaka, Meang Akira; Nyborg, Anders

    This report investigates whether propagators combined with branch and bound algorithm are suitable for solving the storage area stowage problem within reasonable time. The approach has not been attempted before and experiments show that the implementation was not capable of solving the storage ar...

  8. Self-adaptive global best harmony search algorithm applied to reactor core fuel management optimization

    International Nuclear Information System (INIS)

    Poursalehi, N.; Zolfaghari, A.; Minuchehr, A.; Valavi, K.

    2013-01-01

    Highlights: • SGHS enhanced the convergence rate of LPO using some improvements in comparison to basic HS and GHS. • SGHS optimization algorithm obtained averagely better fitness relative to basic HS and GHS algorithms. • Upshot of the SGHS implementation in the LPO reveals its flexibility, efficiency and reliability. - Abstract: The aim of this work is to apply the new developed optimization algorithm, Self-adaptive Global best Harmony Search (SGHS), for PWRs fuel management optimization. SGHS algorithm has some modifications in comparison with basic Harmony Search (HS) and Global-best Harmony Search (GHS) algorithms such as dynamically change of parameters. For the demonstration of SGHS ability to find an optimal configuration of fuel assemblies, basic Harmony Search (HS) and Global-best Harmony Search (GHS) algorithms also have been developed and investigated. For this purpose, Self-adaptive Global best Harmony Search Nodal Expansion package (SGHSNE) has been developed implementing HS, GHS and SGHS optimization algorithms for the fuel management operation of nuclear reactor cores. This package uses developed average current nodal expansion code which solves the multi group diffusion equation by employment of first and second orders of Nodal Expansion Method (NEM) for two dimensional, hexagonal and rectangular geometries, respectively, by one node per a FA. Loading pattern optimization was performed using SGHSNE package for some test cases to present the SGHS algorithm capability in converging to near optimal loading pattern. Results indicate that the convergence rate and reliability of the SGHS method are quite promising and practically, SGHS improves the quality of loading pattern optimization results relative to HS and GHS algorithms. As a result, it has the potential to be used in the other nuclear engineering optimization problems

  9. THE CUSP/CORE PROBLEM AND THE SECONDARY INFALL MODEL

    International Nuclear Information System (INIS)

    Del Popolo, A.

    2009-01-01

    We study the cusp/core problem using a secondary infall model that takes into account the effect of ordered and random angular momentum, dynamical friction, and baryons adiabatic contraction (AC). The model is applied to structures on galactic scales (normal and dwarfs spiral galaxies) and on clusters of galaxies scales. Our analysis suggest that angular momentum and dynamical friction are able, on galactic scales, to overcome the competing effect of AC eliminating the cusp. The slope of density profile of inner halos flattens with decreasing halo mass and the profile is well approximated by a Burkert's profile. In order to obtain the Navarro-Frenk-White (NFW) profile, starting from the profiles obtained from our model, the magnitude of angular momentum and dynamical friction must be reduced with respect to the values predicted by the model itself. The rotation curves of four lower sideband galaxies from Gentile et al. are compared to the rotation curves obtained by the model in the present paper obtaining a good fit to the observational data. The time evolution of the density profile of a galaxy of 10 8 -10 9 M sun shows that after a transient steepening, due to the AC, the density profile flattens to α ≅ 0. On cluster scales we observe a similar evolution of the dark matter (DM) density profile but in this case the density profile slope flattens to α ≅ 0.6 for a cluster of ≅10 14 M sun . The total mass profile, differently from that of DM, shows a central cusp well fitted by an NFW model.

  10. Solving Multiobjective Optimization Problems Using Artificial Bee Colony Algorithm

    Directory of Open Access Journals (Sweden)

    Wenping Zou

    2011-01-01

    Full Text Available Multiobjective optimization has been a difficult problem and focus for research in fields of science and engineering. This paper presents a novel algorithm based on artificial bee colony (ABC to deal with multi-objective optimization problems. ABC is one of the most recently introduced algorithms based on the intelligent foraging behavior of a honey bee swarm. It uses less control parameters, and it can be efficiently used for solving multimodal and multidimensional optimization problems. Our algorithm uses the concept of Pareto dominance to determine the flight direction of a bee, and it maintains nondominated solution vectors which have been found in an external archive. The proposed algorithm is validated using the standard test problems, and simulation results show that the proposed approach is highly competitive and can be considered a viable alternative to solve multi-objective optimization problems.

  11. Optimality conditions for the numerical solution of optimization problems with PDE constraints :

    Energy Technology Data Exchange (ETDEWEB)

    Aguilo Valentin, Miguel Alejandro; Ridzal, Denis

    2014-03-01

    A theoretical framework for the numerical solution of partial di erential equation (PDE) constrained optimization problems is presented in this report. This theoretical framework embodies the fundamental infrastructure required to e ciently implement and solve this class of problems. Detail derivations of the optimality conditions required to accurately solve several parameter identi cation and optimal control problems are also provided in this report. This will allow the reader to further understand how the theoretical abstraction presented in this report translates to the application.

  12. Present-day Problems and Methods of Optimization in Mechatronics

    Directory of Open Access Journals (Sweden)

    Tarnowski Wojciech

    2017-06-01

    Full Text Available It is justified that design is an inverse problem, and the optimization is a paradigm. Classes of design problems are proposed and typical obstacles are recognized. Peculiarities of the mechatronic designing are specified as a proof of a particle importance of optimization in the mechatronic design. Two main obstacles of optimization are discussed: a complexity of mathematical models and an uncertainty of the value system, in concrete case. Then a set of non-standard approaches and methods are presented and discussed, illustrated by examples: a fuzzy description, a constraint-based iterative optimization, AHP ranking method and a few MADM functions in Matlab.

  13. Comments on `A discrete optimal control problem for descriptor systems'

    DEFF Research Database (Denmark)

    Ravn, Hans

    1990-01-01

    In the above-mentioned work (see ibid., vol.34, p.177-81 (1989)), necessary and sufficient optimality conditions are derived for a discrete-time optimal problem, as well as other specific cases of implicit and explicit dynamic systems. The commenter corrects a mistake and demonstrates that there ......In the above-mentioned work (see ibid., vol.34, p.177-81 (1989)), necessary and sufficient optimality conditions are derived for a discrete-time optimal problem, as well as other specific cases of implicit and explicit dynamic systems. The commenter corrects a mistake and demonstrates...

  14. Topology optimization for acoustic-structure interaction problems

    DEFF Research Database (Denmark)

    Yoon, Gil Ho; Jensen, Jakob Søndergaard; Sigmund, Ole

    2006-01-01

    We propose a gradient based topology optimization algorithm for acoustic-structure (vibro-acoustic) interaction problems without an explicit interfacing boundary representation. In acoustic-structure interaction problems, the pressure field and the displacement field are governed by the Helmholtz...... to subdomain interfaces evolving during the optimization process. In this paper, we propose to use a mixed finite element formulation with displacements and pressure as primary variables (u/p formulation) which eliminates the need for explicit boundary representation. In order to describe the Helmholtz......-dimensional acoustic-structure interaction problems are optimized to show the validity of the proposed method....

  15. A reduced scale two loop PWR core designed with particle swarm optimization technique

    International Nuclear Information System (INIS)

    Lima Junior, Carlos A. Souza; Pereira, Claudio M.N.A; Lapa, Celso M.F.; Cunha, Joao J.; Alvim, Antonio C.M.

    2007-01-01

    Reduced scale experiments are often employed in engineering projects because they are much cheaper than real scale testing. Unfortunately, designing reduced scale thermal-hydraulic circuit or equipment, with the capability of reproducing, both accurately and simultaneously, all physical phenomena that occur in real scale and at operating conditions, is a difficult task. To solve this problem, advanced optimization techniques, such as Genetic Algorithms, have been applied. Following this research line, we have performed investigations, using the Particle Swarm Optimization (PSO) Technique, to design a reduced scale two loop Pressurized Water Reactor (PWR) core, considering 100% of nominal power and non accidental operating conditions. Obtained results show that the proposed methodology is a promising approach for forced flow reduced scale experiments. (author)

  16. Iterative solution to the optimal control of depletion problem in pressurized water reactors

    International Nuclear Information System (INIS)

    Colletti, J.P.

    1981-01-01

    A method is described for determining the optimal time and spatial dependence of control absorbers in the core of a pressurized water reactor over a single refueling cycle. The reactor is modeled in two dimensions with many regions using two-group diffusion theory. The problem is formulated as an optimal control problem with the cycle length fixed and the initial reactor state known. Constraints are placed on the regionwise normalized powers, control absorber concentrations, and the critical soluble boron concentration of the core. The cost functional contains two terms which may be used individually or together. One term maximizes the end-of-cycle (EOC) critical soluble boron concentration, and the other minimizes the norm of the distance between the actual and a target EOC burnup distribution. Results are given for several test problems which are based on a three-region model of the Three Mile Island Unit 1 reactor. The resulting optimal control strategies are bang-bang and lead to EOC states with the power peaking at its maximum and no control absorbers remaining in the core. Throughout the cycle the core soluble boron concentration is zero

  17. Comparison of optimal design methods in inverse problems

    International Nuclear Information System (INIS)

    Banks, H T; Holm, K; Kappel, F

    2011-01-01

    Typical optimal design methods for inverse or parameter estimation problems are designed to choose optimal sampling distributions through minimization of a specific cost function related to the resulting error in parameter estimates. It is hoped that the inverse problem will produce parameter estimates with increased accuracy using data collected according to the optimal sampling distribution. Here we formulate the classical optimal design problem in the context of general optimization problems over distributions of sampling times. We present a new Prohorov metric-based theoretical framework that permits one to treat succinctly and rigorously any optimal design criteria based on the Fisher information matrix. A fundamental approximation theory is also included in this framework. A new optimal design, SE-optimal design (standard error optimal design), is then introduced in the context of this framework. We compare this new design criterion with the more traditional D-optimal and E-optimal designs. The optimal sampling distributions from each design are used to compute and compare standard errors; the standard errors for parameters are computed using asymptotic theory or bootstrapping and the optimal mesh. We use three examples to illustrate ideas: the Verhulst–Pearl logistic population model (Banks H T and Tran H T 2009 Mathematical and Experimental Modeling of Physical and Biological Processes (Boca Raton, FL: Chapman and Hall/CRC)), the standard harmonic oscillator model (Banks H T and Tran H T 2009) and a popular glucose regulation model (Bergman R N, Ider Y Z, Bowden C R and Cobelli C 1979 Am. J. Physiol. 236 E667–77; De Gaetano A and Arino O 2000 J. Math. Biol. 40 136–68; Toffolo G, Bergman R N, Finegood D T, Bowden C R and Cobelli C 1980 Diabetes 29 979–90)

  18. Comparison of optimal design methods in inverse problems

    Science.gov (United States)

    Banks, H. T.; Holm, K.; Kappel, F.

    2011-07-01

    Typical optimal design methods for inverse or parameter estimation problems are designed to choose optimal sampling distributions through minimization of a specific cost function related to the resulting error in parameter estimates. It is hoped that the inverse problem will produce parameter estimates with increased accuracy using data collected according to the optimal sampling distribution. Here we formulate the classical optimal design problem in the context of general optimization problems over distributions of sampling times. We present a new Prohorov metric-based theoretical framework that permits one to treat succinctly and rigorously any optimal design criteria based on the Fisher information matrix. A fundamental approximation theory is also included in this framework. A new optimal design, SE-optimal design (standard error optimal design), is then introduced in the context of this framework. We compare this new design criterion with the more traditional D-optimal and E-optimal designs. The optimal sampling distributions from each design are used to compute and compare standard errors; the standard errors for parameters are computed using asymptotic theory or bootstrapping and the optimal mesh. We use three examples to illustrate ideas: the Verhulst-Pearl logistic population model (Banks H T and Tran H T 2009 Mathematical and Experimental Modeling of Physical and Biological Processes (Boca Raton, FL: Chapman and Hall/CRC)), the standard harmonic oscillator model (Banks H T and Tran H T 2009) and a popular glucose regulation model (Bergman R N, Ider Y Z, Bowden C R and Cobelli C 1979 Am. J. Physiol. 236 E667-77 De Gaetano A and Arino O 2000 J. Math. Biol. 40 136-68 Toffolo G, Bergman R N, Finegood D T, Bowden C R and Cobelli C 1980 Diabetes 29 979-90).

  19. Harnessing Petaflop-Scale Multi-Core Supercomputing for Problems in Space Science

    Science.gov (United States)

    Albright, B. J.; Yin, L.; Bowers, K. J.; Daughton, W.; Bergen, B.; Kwan, T. J.

    2008-12-01

    The particle-in-cell kinetic plasma code VPIC has been migrated successfully to the world's fastest supercomputer, Roadrunner, a hybrid multi-core platform built by IBM for the Los Alamos National Laboratory. How this was achieved will be described and examples of state-of-the-art calculations in space science, in particular, the study of magnetic reconnection, will be presented. With VPIC on Roadrunner, we have performed, for the first time, plasma PIC calculations with over one trillion particles, >100× larger than calculations considered "heroic" by community standards. This allows examination of physics at unprecedented scale and fidelity. Roadrunner is an example of an emerging paradigm in supercomputing: the trend toward multi-core systems with deep hierarchies and where memory bandwidth optimization is vital to achieving high performance. Getting VPIC to perform well on such systems is a formidable challenge: the core algorithm is memory bandwidth limited with low compute-to-data ratio and requires random access to memory in its inner loop. That we were able to get VPIC to perform and scale well, achieving >0.374 Pflop/s and linear weak scaling on real physics problems on up to the full 12240-core Roadrunner machine, bodes well for harnessing these machines for our community's needs in the future. Many of the design considerations encountered commute to other multi-core and accelerated (e.g., via GPU) platforms and we modified VPIC with flexibility in mind. These will be summarized and strategies for how one might adapt a code for such platforms will be shared. Work performed under the auspices of the U.S. DOE by the LANS LLC Los Alamos National Laboratory. Dr. Bowers is a LANL Guest Scientist; he is presently at D. E. Shaw Research LLC, 120 W 45th Street, 39th Floor, New York, NY 10036.

  20. New Exact Penalty Functions for Nonlinear Constrained Optimization Problems

    Directory of Open Access Journals (Sweden)

    Bingzhuang Liu

    2014-01-01

    Full Text Available For two kinds of nonlinear constrained optimization problems, we propose two simple penalty functions, respectively, by augmenting the dimension of the primal problem with a variable that controls the weight of the penalty terms. Both of the penalty functions enjoy improved smoothness. Under mild conditions, it can be proved that our penalty functions are both exact in the sense that local minimizers of the associated penalty problem are precisely the local minimizers of the original constrained problem.

  1. An optimal control approach to manpower planning problem

    Directory of Open Access Journals (Sweden)

    H. W. J. Lee

    2001-01-01

    Full Text Available A manpower planning problem is studied in this paper. The model includes scheduling different types of workers over different tasks, employing and terminating different types of workers, and assigning different types of workers to various trainning programmes. The aim is to find an optimal way to do all these while keeping the time-varying demand for minimum number of workers working on each different tasks satisfied. The problem is posed as an optimal discrete-valued control problem in discrete time. A novel numerical scheme is proposed to solve the problem, and an illustrative example is provided.

  2. Topology Optimization of Large Scale Stokes Flow Problems

    DEFF Research Database (Denmark)

    Aage, Niels; Poulsen, Thomas Harpsøe; Gersborg-Hansen, Allan

    2008-01-01

    This note considers topology optimization of large scale 2D and 3D Stokes flow problems using parallel computations. We solve problems with up to 1.125.000 elements in 2D and 128.000 elements in 3D on a shared memory computer consisting of Sun UltraSparc IV CPUs.......This note considers topology optimization of large scale 2D and 3D Stokes flow problems using parallel computations. We solve problems with up to 1.125.000 elements in 2D and 128.000 elements in 3D on a shared memory computer consisting of Sun UltraSparc IV CPUs....

  3. Optimal stability polynomials for numerical integration of initial value problems

    KAUST Repository

    Ketcheson, David I.; Ahmadia, Aron

    2013-01-01

    We consider the problem of finding optimally stable polynomial approximations to the exponential for application to one-step integration of initial value ordinary and partial differential equations. The objective is to find the largest stable step

  4. Infinite-horizon optimal control problems in economics

    Energy Technology Data Exchange (ETDEWEB)

    Aseev, Sergei M; Besov, Konstantin O; Kryazhimskii, Arkadii V

    2012-04-30

    This paper extends optimal control theory to a class of infinite-horizon problems that arise in studying models of optimal dynamic allocation of economic resources. In a typical problem of this sort the initial state is fixed, no constraints are imposed on the behaviour of the admissible trajectories at large times, and the objective functional is given by a discounted improper integral. We develop the method of finite-horizon approximations in a broad context and use it to derive complete versions of the Pontryagin maximum principle for such problems. We provide sufficient conditions for the normality of infinite-horizon optimal control problems and for the validity of the 'standard' limit transversality conditions with time going to infinity. As a meaningful example, we consider a new two-sector model of optimal economic growth subject to a random jump in prices. Bibliography: 53 titles.

  5. An inverse optimal control problem in the electrical discharge ...

    Indian Academy of Sciences (India)

    Marin Gostimirovic

    2018-05-10

    May 10, 2018 ... Keywords. EDM process; discharge energy; heat source parameters; inverse problem; optimization. 1. Introduction .... ation, thermal modeling of the EDM process would become ..... simulation of die-sinking EDM. CIRP Ann.

  6. Infinite-horizon optimal control problems in economics

    International Nuclear Information System (INIS)

    Aseev, Sergei M; Besov, Konstantin O; Kryazhimskii, Arkadii V

    2012-01-01

    This paper extends optimal control theory to a class of infinite-horizon problems that arise in studying models of optimal dynamic allocation of economic resources. In a typical problem of this sort the initial state is fixed, no constraints are imposed on the behaviour of the admissible trajectories at large times, and the objective functional is given by a discounted improper integral. We develop the method of finite-horizon approximations in a broad context and use it to derive complete versions of the Pontryagin maximum principle for such problems. We provide sufficient conditions for the normality of infinite-horizon optimal control problems and for the validity of the 'standard' limit transversality conditions with time going to infinity. As a meaningful example, we consider a new two-sector model of optimal economic growth subject to a random jump in prices. Bibliography: 53 titles.

  7. A nuclear reactor core fuel reload optimization using Artificial-Ant-Colony Connective Networks; Recarga de reatores nucleares utilizando redes conectivas de colonias de formigas artificiais

    Energy Technology Data Exchange (ETDEWEB)

    Lima, Alan M.M. de; Schirru, Roberto [Universidade Federal, Rio de Janeiro, RJ (Brazil). Coordenacao dos Programas de Pos-graduacao de Engenharia. Programa de Engenharia Nuclear]. E-mail: alan@lmp.ufrj.br; schirru@lmp.ufrj.br

    2005-07-01

    A Pressurized Water Reactor core must be reloaded every time the fuel burnup reaches a level when it is not possible to sustain nominal power operation. The nuclear core fuel reload optimization consists in finding a burned-up and fresh-fuel-assembly pattern that maximizes the number of full operational days. This problem is NP-hard, meaning that complexity grows exponentially with the number of fuel assemblies in the core. Besides that, the problem is non-linear and its search space is highly discontinual and multimodal. In this work a parallel computational system based on Ant Colony System (ACS) called Artificial-Ant-Colony Networks is introduced to solve the nuclear reactor core fuel reload optimization problem. ACS is a system based on artificial agents that uses the reinforcement learning technique and was originally developed to solve the Traveling Salesman Problem, which is conceptually similar to the nuclear fuel reload problem. (author)

  8. An Optimal Linear Coding for Index Coding Problem

    OpenAIRE

    Pezeshkpour, Pouya

    2015-01-01

    An optimal linear coding solution for index coding problem is established. Instead of network coding approach by focus on graph theoric and algebraic methods a linear coding program for solving both unicast and groupcast index coding problem is presented. The coding is proved to be the optimal solution from the linear perspective and can be easily utilize for any number of messages. The importance of this work is lying mostly on the usage of the presented coding in the groupcast index coding ...

  9. Complicated problem solution techniques in optimal parameter searching

    International Nuclear Information System (INIS)

    Gergel', V.P.; Grishagin, V.A.; Rogatneva, E.A.; Strongin, R.G.; Vysotskaya, I.N.; Kukhtin, V.V.

    1992-01-01

    An algorithm is presented of a global search for numerical solution of multidimentional multiextremal multicriteria optimization problems with complicated constraints. A boundedness of object characteristic changes is assumed at restricted changes of its parameters (Lipschitz condition). The algorithm was realized as a computer code. The algorithm was realized as a computer code. The programme was used to solve in practice the different applied optimization problems. 10 refs.; 3 figs

  10. Nonlinear Multidimensional Assignment Problems Efficient Conic Optimization Methods and Applications

    Science.gov (United States)

    2015-06-24

    WORK UNIT NUMBER 7. PERFORMING ORGANIZATION NAME(S) AND ADDRESS(ES) Arizona State University School of Mathematical & Statistical Sciences 901 S...SUPPLEMENTARY NOTES 14. ABSTRACT The major goals of this project were completed: the exact solution of previously unsolved challenging combinatorial optimization... combinatorial optimization problem, the Directional Sensor Problem, was solved in two ways. First, heuristically in an engineering fashion and second, exactly

  11. Topology optimization of vibration and wave propagation problems

    DEFF Research Database (Denmark)

    Jensen, Jakob Søndergaard

    2007-01-01

    The method of topology optimization is a versatile method to determine optimal material layouts in mechanical structures. The method relies on, in principle, unlimited design freedom that can be used to design materials, structures and devices with significantly improved performance and sometimes...... novel functionality. This paper addresses basic issues in simulation and topology design of vibration and wave propagation problems. Steady-state and transient wave propagation problems are addressed and application examples for both cases are presented....

  12. On some fundamental properties of structural topology optimization problems

    DEFF Research Database (Denmark)

    Stolpe, Mathias

    2010-01-01

    We study some fundamental mathematical properties of discretized structural topology optimization problems. Either compliance is minimized with an upper bound on the volume of the structure, or volume is minimized with an upper bound on the compliance. The design variables are either continuous o....... The presented examples can be used as teaching material in graduate and undergraduate courses on structural topology optimization....

  13. STATEMENT OF THE OPTIMIZATION PROBLEM OF CARBON PRODUCTS PRODUCTION

    Directory of Open Access Journals (Sweden)

    O. A. Zhuchenko

    2016-08-01

    Full Text Available The paper formulated optimization problem formulation production of carbon products. The analysis of technical and economic parameters that can be used to optimize the production of carbonaceous products had been done by the author. To evaluate the efficiency of the energy-intensive production uses several technical and economic indicators. In particular, the specific cost, productivity, income and profitability of production. Based on a detailed analysis had been formulated optimality criterion that takes into account the technological components of profitability. The components in detail the criteria and the proposed method of calculating non-trivial, one of them - the production cost of each product. When solving the optimization problem of technological modes of production into account constraints on the variables are optimized. Thus, restrictions may be expressed on the number of each product produced. Have been formulated the method of calculating the cost per unit of product. Attention is paid to the quality indices of finished products as an additional constraint in the optimization problem. As a result have been formulated the general problem of optimizing the production of carbon products, which includes the optimality criterion and restrictions.

  14. SolveDB: Integrating Optimization Problem Solvers Into SQL Databases

    DEFF Research Database (Denmark)

    Siksnys, Laurynas; Pedersen, Torben Bach

    2016-01-01

    for optimization problems, (2) an extensible infrastructure for integrating different solvers, and (3) query optimization techniques to achieve the best execution performance and/or result quality. Extensive experiments with the PostgreSQL-based implementation show that SolveDB is a versatile tool offering much...

  15. Effective Teaching of Economics: A Constrained Optimization Problem?

    Science.gov (United States)

    Hultberg, Patrik T.; Calonge, David Santandreu

    2017-01-01

    One of the fundamental tenets of economics is that decisions are often the result of optimization problems subject to resource constraints. Consumers optimize utility, subject to constraints imposed by prices and income. As economics faculty, instructors attempt to maximize student learning while being constrained by their own and students'…

  16. Climate Intervention as an Optimization Problem

    Science.gov (United States)

    Caldeira, Ken; Ban-Weiss, George A.

    2010-05-01

    Typically, climate models simulations of intentional intervention in the climate system have taken the approach of imposing a change (eg, in solar flux, aerosol concentrations, aerosol emissions) and then predicting how that imposed change might affect Earth's climate or chemistry. Computations proceed from cause to effect. However, humans often proceed from "What do I want?" to "How do I get it?" One approach to thinking about intentional intervention in the climate system ("geoengineering") is to ask "What kind of climate do we want?" and then ask "What pattern of radiative forcing would come closest to achieving that desired climate state?" This involves defining climate goals and a cost function that measures how closely those goals are attained. (An important next step is to ask "How would we go about producing these desired patterns of radiative forcing?" However, this question is beyond the scope of our present study.) We performed a variety of climate simulations in NCAR's CAM3.1 atmospheric general circulation model with a slab ocean model and thermodynamic sea ice model. We then evaluated, for a specific set of climate forcing basis functions (ie, aerosol concentration distributions), the extent to which the climate response to a linear combination of those basis functions was similar to a linear combination of the climate response to each basis function taken individually. We then developed several cost functions (eg, relative to the 1xCO2 climate, minimize rms difference in zonal and annual mean land temperature, minimize rms difference in zonal and annual mean runoff, minimize rms difference in a combination of these temperature and runoff indices) and then predicted optimal combinations of our basis functions that would minimize these cost functions. Lastly, we produced forward simulations of the predicted optimal radiative forcing patterns and compared these with our expected results. Obviously, our climate model is much simpler than reality and

  17. Problems in determining the optimal use of road safety measures

    DEFF Research Database (Denmark)

    Elvik, Rune

    2014-01-01

    for intervention that ensures maximum safety benefits. The third problem is how to develop policy options to minimise the risk of indivisibilities and irreversible choices. The fourth problem is how to account for interaction effects between road safety measures when determining their optimal use. The fifth......This paper discusses some problems in determining the optimal use of road safety measures. The first of these problems is how best to define the baseline option, i.e. what will happen if no new safety measures are introduced. The second problem concerns choice of a method for selection of targets...... problem is how to obtain the best mix of short-term and long-term measures in a safety programme. The sixth problem is how fixed parameters for analysis, including the monetary valuation of road safety, influence the results of analyses. It is concluded that it is at present not possible to determine...

  18. Random Matrix Approach for Primal-Dual Portfolio Optimization Problems

    Science.gov (United States)

    Tada, Daichi; Yamamoto, Hisashi; Shinzato, Takashi

    2017-12-01

    In this paper, we revisit the portfolio optimization problems of the minimization/maximization of investment risk under constraints of budget and investment concentration (primal problem) and the maximization/minimization of investment concentration under constraints of budget and investment risk (dual problem) for the case that the variances of the return rates of the assets are identical. We analyze both optimization problems by the Lagrange multiplier method and the random matrix approach. Thereafter, we compare the results obtained from our proposed approach with the results obtained in previous work. Moreover, we use numerical experiments to validate the results obtained from the replica approach and the random matrix approach as methods for analyzing both the primal and dual portfolio optimization problems.

  19. Optimizations of Unstructured Aerodynamics Computations for Many-core Architectures

    KAUST Repository

    Al Farhan, Mohammed Ahmed; Keyes, David E.

    2018-01-01

    involving thread and data-level parallelism. Our approach is based upon a multi-level hierarchical distribution of work and data across both the threads and the SIMD units within every hardware core. On a 64-core KNL chip, we achieve nearly 2.9x speedup

  20. Prederivatives of gamma paraconvex set-valued maps and Pareto optimality conditions for set optimization problems.

    Science.gov (United States)

    Huang, Hui; Ning, Jixian

    2017-01-01

    Prederivatives play an important role in the research of set optimization problems. First, we establish several existence theorems of prederivatives for γ -paraconvex set-valued mappings in Banach spaces with [Formula: see text]. Then, in terms of prederivatives, we establish both necessary and sufficient conditions for the existence of Pareto minimal solution of set optimization problems.

  1. Finite element program ARKAS: verification for IAEA benchmark problem analysis on core-wide mechanical analysis of LMFBR cores

    International Nuclear Information System (INIS)

    Nakagawa, M.; Tsuboi, Y.

    1990-01-01

    ''ARKAS'' code verification, with the problems set in the International Working Group on Fast Reactors (IWGFR) Coordinated Research Programme (CRP) on the inter-comparison between liquid metal cooled fast breeder reactor (LMFBR) Core Mechanics Codes, is discussed. The CRP was co-ordinated by the IWGFR around problems set by Dr. R.G. Anderson (UKAEA) and arose from the IWGFR specialists' meeting on The Predictions and Experience of Core Distortion Behaviour (ref. 2). The problems for the verification (''code against code'') and validation (''code against experiment'') were set and calculated by eleven core mechanics codes from nine countries. All the problems have been completed and were solved with the core structural mechanics code ARKAS. Predictions by ARKAS agreed very well with other solutions for the well-defined verification problems. For the validation problems based on Japanese ex-reactor 2-D thermo-elastic experiments, the agreements between measured and calculated values were fairly good. This paper briefly describes the numerical model of the ARKAS code, and discusses some typical results. (author)

  2. ON THE OPTIMAL CONTROL OF A PROBLEM OF ENVIRONMENTAL POLLUTION

    Directory of Open Access Journals (Sweden)

    José Dávalos Chuquipoma

    2016-06-01

    Full Text Available This article is studied the optimal control of distributed parameter systems applied to an environmental pollution problem. The model consists of a differential equation partial parabolic modeling of a pollutant transport in a fluid. The model is considered the speed with which the pollutant spreads in the environment and degradation that suffers the contaminant by the presence of a factor biological inhibitor, which breaks the contaminant at a rate that is not dependent on space and time. Using the method of Lagrange multipliers is possible to prove the existence solving the problem of control and obtaining optimality conditions for optimal control.

  3. The Expanded Invasive Weed Optimization Metaheuristic for Solving Continuous and Discrete Optimization Problems

    Directory of Open Access Journals (Sweden)

    Henryk Josiński

    2014-01-01

    Full Text Available This paper introduces an expanded version of the Invasive Weed Optimization algorithm (exIWO distinguished by the hybrid strategy of the search space exploration proposed by the authors. The algorithm is evaluated by solving three well-known optimization problems: minimization of numerical functions, feature selection, and the Mona Lisa TSP Challenge as one of the instances of the traveling salesman problem. The achieved results are compared with analogous outcomes produced by other optimization methods reported in the literature.

  4. Genetic algorithm with fuzzy clustering for optimization of nuclear reactor problems

    International Nuclear Information System (INIS)

    Machado, Marcelo Dornellas; Sacco, Wagner Figueiredo; Schirru, Roberto

    2000-01-01

    Genetic Algorithms (GAs) are biologically motivated adaptive systems which have been used, with good results, in function optimization. However, traditional GAs rapidly push an artificial population toward convergence. That is, all individuals in the population soon become nearly identical. Niching Methods allow genetic algorithms to maintain a population of diverse individuals. GAs that incorporate these methods are capable of locating multiple, optimal solutions within a single population. The purpose of this study is to introduce a new niching technique based on the fuzzy clustering method FCM, bearing in mind its eventual application in nuclear reactor related problems, specially the nuclear reactor core reload one, which has multiple solutions. tests are performed using widely known test functions and their results show that the new method is quite promising, specially to a future application in real world problems like the nuclear reactor core reload. (author)

  5. Utilization of niching methods of genetic algorithms in nuclear reactor problems optimization

    International Nuclear Information System (INIS)

    Sacco, Wagner Figueiredo; Schirru, Roberto

    2000-01-01

    Genetic Algorithms (GAs) are biologically motivated adaptive systems which have been used, with good results, in function optimization. However, traditional GAs rapidly push an artificial population toward convergence. That is, all individuals in the population soon become nearly identical. Niching Methods allow genetic algorithms to maintain a population of diverse individuals. GAs that incorporate these methods are capable of locating multiple, optimal solutions within a single population. The purpose of this study is to test existing niching techniques and two methods introduced herein, bearing in mind their eventual application in nuclear reactor related problems, specially the nuclear reactor core reload one, which has multiple solutions. Tests are performed using widely known test functions and their results show that the new methods are quite promising, specially in real world problems like the nuclear reactor core reload. (author)

  6. Strong Duality and Optimality Conditions for Generalized Equilibrium Problems

    Directory of Open Access Journals (Sweden)

    D. H. Fang

    2013-01-01

    Full Text Available We consider a generalized equilibrium problem involving DC functions. By using the properties of the epigraph of the conjugate functions, some sufficient and/or necessary conditions for the weak and strong duality results and optimality conditions for generalized equilibrium problems are provided.

  7. Optimization of the solution of the problem of scheduling theory ...

    African Journals Online (AJOL)

    This article describes the genetic algorithm used to solve the problem related to the scheduling theory. A large number of different methods is described in the scientific literature. The main issue that faced the problem in question is that it is necessary to search the optimal solution in a large search space for the set of ...

  8. Multi-physics and multi-objective design of heterogeneous SFR core: development of an optimization method under uncertainty

    International Nuclear Information System (INIS)

    Ammar, Karim

    2014-01-01

    Since Phenix shutting down in 2010, CEA does not have Sodium Fast Reactor (SFR) in operating condition. According to global energetic challenge and fast reactor abilities, CEA launched a program of industrial demonstrator called ASTRID (Advanced Sodium Technological Reactor for Industrial Demonstration), a reactor with electric power capacity equal to 600 MW. Objective of the prototype is, in first to be a response to environmental constraints, in second demonstrates the industrial viability of SFR reactor. The goal is to have a safety level at least equal to 3. generation reactors. ASTRID design integrates Fukushima feedback; Waste reprocessing (with minor actinide transmutation) and it linked industry. Installation safety is the priority. In all cases, no radionuclide should be released into environment. To achieve this objective, it is imperative to predict the impact of uncertainty sources on reactor behaviour. In this context, this thesis aims to develop new optimization methods for SFR cores. The goal is to improve the robustness and reliability of reactors in response to existing uncertainties. We will use ASTRID core as reference to estimate interest of new methods and tools developed. The impact of multi-Physics uncertainties in the calculation of the core performance and the use of optimization methods introduce new problems: How to optimize 'complex' cores (i.e. associated with design spaces of high dimensions with more than 20 variable parameters), taking into account the uncertainties? What is uncertainties behaviour for optimization core compare to reference core? Taking into account uncertainties, optimization core are they still competitive? Optimizations improvements are higher than uncertainty margins? The thesis helps to develop and implement methods necessary to take into account uncertainties in the new generation of simulation tools. Statistical methods to ensure consistency of complex multi-Physics simulation results are also

  9. Global Optimization for Bus Line Timetable Setting Problem

    Directory of Open Access Journals (Sweden)

    Qun Chen

    2014-01-01

    Full Text Available This paper defines bus timetables setting problem during each time period divided in terms of passenger flow intensity; it is supposed that passengers evenly arrive and bus runs are set evenly; the problem is to determine bus runs assignment in each time period to minimize the total waiting time of passengers on platforms if the number of the total runs is known. For such a multistage decision problem, this paper designed a dynamic programming algorithm to solve it. Global optimization procedures using dynamic programming are developed. A numerical example about bus runs assignment optimization of a single line is given to demonstrate the efficiency of the proposed methodology, showing that optimizing buses’ departure time using dynamic programming can save computational time and find the global optimal solution.

  10. An intutionistic fuzzy optimization approach to vendor selection problem

    Directory of Open Access Journals (Sweden)

    Prabjot Kaur

    2016-09-01

    Full Text Available Selecting the right vendor is an important business decision made by any organization. The decision involves multiple criteria and if the objectives vary in preference and scope, then nature of decision becomes multiobjective. In this paper, a vendor selection problem has been formulated as an intutionistic fuzzy multiobjective optimization where appropriate number of vendors is to be selected and order allocated to them. The multiobjective problem includes three objectives: minimizing the net price, maximizing the quality, and maximizing the on time deliveries subject to supplier's constraints. The objection function and the demand are treated as intutionistic fuzzy sets. An intutionistic fuzzy set has its ability to handle uncertainty with additional degrees of freedom. The Intutionistic fuzzy optimization (IFO problem is converted into a crisp linear form and solved using optimization software Tora. The advantage of IFO is that they give better results than fuzzy/crisp optimization. The proposed approach is explained by a numerical example.

  11. Computer realization of an algorithm for determining the optimal arrangement of a fast power reactor core with hexagonal assemblies

    International Nuclear Information System (INIS)

    Karpov, V.A.; Rybnikov, A.F.

    1983-01-01

    An algorithm for solving the problems associated with fast nuclear reactor computer-aided design is suggested. Formulation of the discrete optimization problem dealing with chosing of the first loading arrangement, determination of the control element functional purpose and the order of their rearrangement during reactor operation as well as the choice of operations for core reloading is given. An algorithm for computerized solutions of the mentioned optimization problem based on variational methods relized in the form of the DESIGN program complex written in FORTRAN for the BEhSM-6 computer is proposed. A fast-response program for solving the diffusion equations of two-dimensional reactor permitting to obtain the optimization problem solution at reasonable period of time is developed to conduct necessary neutron-physical calculations for the reactor in hexagonal geometry. The DESIGN program can be included into a computer-aided design system for automation of the procedure of determining the fast power reactor core arrangement. Application of the DESIGN program permits to avoid the routine calculations on substantiation of neutron-physical and thermal-hydraulic characteristics of the reactor core that releases operators from essential waste of time and increases efficiency of their work

  12. A Global Optimization Algorithm for Sum of Linear Ratios Problem

    Directory of Open Access Journals (Sweden)

    Yuelin Gao

    2013-01-01

    Full Text Available We equivalently transform the sum of linear ratios programming problem into bilinear programming problem, then by using the linear characteristics of convex envelope and concave envelope of double variables product function, linear relaxation programming of the bilinear programming problem is given, which can determine the lower bound of the optimal value of original problem. Therefore, a branch and bound algorithm for solving sum of linear ratios programming problem is put forward, and the convergence of the algorithm is proved. Numerical experiments are reported to show the effectiveness of the proposed algorithm.

  13. Multiobjective optimization for design of multifunctional sandwich panel heat pipes with micro-architected truss cores

    International Nuclear Information System (INIS)

    Roper, Christopher S.

    2011-01-01

    A micro-architected multifunctional structure, a sandwich panel heat pipe with a micro-scale truss core and arterial wick, is modeled and optimized. To characterize multiple functionalities, objective equations are formulated for density, compressive modulus, compressive strength, and maximum heat flux. Multiobjective optimization is used to determine the Pareto-optimal design surfaces, which consist of hundreds of individually optimized designs. The Pareto-optimal surfaces for different working fluids (water, ethanol, and perfluoro(methylcyclohexane)) as well as different micro-scale truss core materials (metal, ceramic, and polymer) are determined and compared. Examination of the Pareto fronts allows comparison of the trade-offs between density, compressive stiffness, compressive strength, and maximum heat flux in the design of multifunctional sandwich panel heat pipes with micro-scale truss cores. Heat fluxes up to 3.0 MW/m 2 are predicted for silicon carbide truss core heat pipes with water as the working fluid.

  14. ON PROBLEM OF REGIONAL WAREHOUSE AND TRANSPORT INFRASTRUCTURE OPTIMIZATION

    Directory of Open Access Journals (Sweden)

    I. Yu. Miretskiy

    2017-01-01

    Full Text Available The article suggests an approach of solving the problem of warehouse and transport infrastructure optimization in a region. The task is to determine the optimal capacity and location of the support network of warehouses in the region, as well as power, composition and location of motor fleets. Optimization is carried out using mathematical models of a regional warehouse network and a network of motor fleets. These models are presented as mathematical programming problems with separable functions. The process of finding the optimal solution of problems is complicated due to high dimensionality, non-linearity of functions, and the fact that a part of variables are constrained to integer, and some variables can take values only from a discrete set. Given the mentioned above complications search for an exact solution was rejected. The article suggests an approximate approach to solving problems. This approach employs effective computational schemes for solving multidimensional optimization problems. We use the continuous relaxation of the original problem to obtain its approximate solution. An approximately optimal solution of continuous relaxation is taken as an approximate solution of the original problem. The suggested solution method implies linearization of the obtained continuous relaxation and use of the separable programming scheme and the scheme of branches and bounds. We describe the use of the simplex method for solving the linearized continuous relaxation of the original problem and the specific moments of the branches and bounds method implementation. The paper shows the finiteness of the algorithm and recommends how to accelerate process of finding a solution.

  15. Integrating packing and distribution problems and optimization through mathematical programming

    Directory of Open Access Journals (Sweden)

    Fabio Miguel

    2016-06-01

    Full Text Available This paper analyzes the integration of two combinatorial problems that frequently arise in production and distribution systems. One is the Bin Packing Problem (BPP problem, which involves finding an ordering of some objects of different volumes to be packed into the minimal number of containers of the same or different size. An optimal solution to this NP-Hard problem can be approximated by means of meta-heuristic methods. On the other hand, we consider the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW, which is a variant of the Travelling Salesman Problem (again a NP-Hard problem with extra constraints. Here we model those two problems in a single framework and use an evolutionary meta-heuristics to solve them jointly. Furthermore, we use data from a real world company as a test-bed for the method introduced here.

  16. Particle swarm optimization with random keys applied to the nuclear reactor reload problem

    Energy Technology Data Exchange (ETDEWEB)

    Meneses, Anderson Alvarenga de Moura [Universidade Federal do Rio de Janeiro (UFRJ), RJ (Brazil). Coordenacao dos Programas de Pos-graduacao de Engenharia (COPPE). Programa de Engenharia Nuclear; Fundacao Educacional de Macae (FUNEMAC), RJ (Brazil). Faculdade Professor Miguel Angelo da Silva Santos; Machado, Marcelo Dornellas; Medeiros, Jose Antonio Carlos Canedo; Schirru, Roberto [Universidade Federal do Rio de Janeiro (UFRJ), RJ (Brazil). Coordenacao dos Programas de Pos-graduacao de Engenharia (COPPE). Programa de Engenharia Nuclear]. E-mails: ameneses@con.ufrj.br; marcelo@lmp.ufrj.br; canedo@lmp.ufrj.br; schirru@lmp.ufrj.br

    2007-07-01

    In 1995, Kennedy and Eberhart presented the Particle Swarm Optimization (PSO), an Artificial Intelligence metaheuristic technique to optimize non-linear continuous functions. The concept of Swarm Intelligence is based on the socials aspects of intelligence, it means, the ability of individuals to learn with their own experience in a group as well as to take advantage of the performance of other individuals. Some PSO models for discrete search spaces have been developed for combinatorial optimization, although none of them presented satisfactory results to optimize a combinatorial problem as the nuclear reactor fuel reloading problem (NRFRP). In this sense, we developed the Particle Swarm Optimization with Random Keys (PSORK) in previous research to solve Combinatorial Problems. Experiences demonstrated that PSORK performed comparable to or better than other techniques. Thus, PSORK metaheuristic is being applied in optimization studies of the NRFRP for Angra 1 Nuclear Power Plant. Results will be compared with Genetic Algorithms and the manual method provided by a specialist. In this experience, the problem is being modeled for an eight-core symmetry and three-dimensional geometry, aiming at the minimization of the Nuclear Enthalpy Power Peaking Factor as well as the maximization of the cycle length. (author)

  17. Particle swarm optimization with random keys applied to the nuclear reactor reload problem

    International Nuclear Information System (INIS)

    Meneses, Anderson Alvarenga de Moura; Fundacao Educacional de Macae; Machado, Marcelo Dornellas; Medeiros, Jose Antonio Carlos Canedo; Schirru, Roberto

    2007-01-01

    In 1995, Kennedy and Eberhart presented the Particle Swarm Optimization (PSO), an Artificial Intelligence metaheuristic technique to optimize non-linear continuous functions. The concept of Swarm Intelligence is based on the socials aspects of intelligence, it means, the ability of individuals to learn with their own experience in a group as well as to take advantage of the performance of other individuals. Some PSO models for discrete search spaces have been developed for combinatorial optimization, although none of them presented satisfactory results to optimize a combinatorial problem as the nuclear reactor fuel reloading problem (NRFRP). In this sense, we developed the Particle Swarm Optimization with Random Keys (PSORK) in previous research to solve Combinatorial Problems. Experiences demonstrated that PSORK performed comparable to or better than other techniques. Thus, PSORK metaheuristic is being applied in optimization studies of the NRFRP for Angra 1 Nuclear Power Plant. Results will be compared with Genetic Algorithms and the manual method provided by a specialist. In this experience, the problem is being modeled for an eight-core symmetry and three-dimensional geometry, aiming at the minimization of the Nuclear Enthalpy Power Peaking Factor as well as the maximization of the cycle length. (author)

  18. On the complexity of determining tolerances for ->e--optimal solutions to min-max combinatorial optimization problems

    NARCIS (Netherlands)

    Ghosh, D.; Sierksma, G.

    2000-01-01

    Sensitivity analysis of e-optimal solutions is the problem of calculating the range within which a problem parameter may lie so that the given solution re-mains e-optimal. In this paper we study the sensitivity analysis problem for e-optimal solutions tocombinatorial optimization problems with

  19. Finding Multiple Optimal Solutions to Optimal Load Distribution Problem in Hydropower Plant

    Directory of Open Access Journals (Sweden)

    Xinhao Jiang

    2012-05-01

    Full Text Available Optimal load distribution (OLD among generator units of a hydropower plant is a vital task for hydropower generation scheduling and management. Traditional optimization methods for solving this problem focus on finding a single optimal solution. However, many practical constraints on hydropower plant operation are very difficult, if not impossible, to be modeled, and the optimal solution found by those models might be of limited practical uses. This motivates us to find multiple optimal solutions to the OLD problem, which can provide more flexible choices for decision-making. Based on a special dynamic programming model, we use a modified shortest path algorithm to produce multiple solutions to the problem. It is shown that multiple optimal solutions exist for the case study of China’s Geheyan hydropower plant, and they are valuable for assessing the stability of generator units, showing the potential of reducing occurrence times of units across vibration areas.

  20. SOLVING ENGINEERING OPTIMIZATION PROBLEMS WITH THE SWARM INTELLIGENCE METHODS

    Directory of Open Access Journals (Sweden)

    V. Panteleev Andrei

    2017-01-01

    Full Text Available An important stage in problem solving process for aerospace and aerostructures designing is calculating their main charac- teristics optimization. The results of the four constrained optimization problems related to the design of various technical systems: such as determining the best parameters of welded beams, pressure vessel, gear, spring are presented. The purpose of each task is to minimize the cost and weight of the construction. The object functions in optimization practical problem are nonlinear functions with a lot of variables and a complex layer surface indentations. That is why using classical approach for extremum seeking is not efficient. Here comes the necessity of using such methods of optimization that allow to find a near optimal solution in acceptable amount of time with the minimum waste of computer power. Such methods include the methods of Swarm Intelligence: spiral dy- namics algorithm, stochastic diffusion search, hybrid seeker optimization algorithm. The Swarm Intelligence methods are designed in such a way that a swarm consisting of agents carries out the search for extremum. In search for the point of extremum, the parti- cles exchange information and consider their experience as well as the experience of population leader and the neighbors in some area. To solve the listed problems there has been designed a program complex, which efficiency is illustrated by the solutions of four applied problems. Each of the considered applied optimization problems is solved with all the three chosen methods. The ob- tained numerical results can be compared with the ones found in a swarm with a particle method. The author gives recommenda- tions on how to choose methods parameters and penalty function value, which consider inequality constraints.

  1. Turnpike theory of continuous-time linear optimal control problems

    CERN Document Server

    Zaslavski, Alexander J

    2015-01-01

    Individual turnpike results are of great interest due to their numerous applications in engineering and in economic theory; in this book the study is focused on new results of turnpike phenomenon in linear optimal control problems.  The book is intended for engineers as well as for mathematicians interested in the calculus of variations, optimal control, and in applied functional analysis. Two large classes of problems are studied in more depth. The first class studied in Chapter 2 consists of linear control problems with periodic nonsmooth convex integrands. Chapters 3-5 consist of linear control problems with autonomous nonconvex and nonsmooth integrands.  Chapter 6 discusses a turnpike property for dynamic zero-sum games with linear constraints. Chapter 7 examines genericity results. In Chapter 8, the description of structure of variational problems with extended-valued integrands is obtained. Chapter 9 ends the exposition with a study of turnpike phenomenon for dynamic games with extended value integran...

  2. A coherent Ising machine for 2000-node optimization problems

    Science.gov (United States)

    Inagaki, Takahiro; Haribara, Yoshitaka; Igarashi, Koji; Sonobe, Tomohiro; Tamate, Shuhei; Honjo, Toshimori; Marandi, Alireza; McMahon, Peter L.; Umeki, Takeshi; Enbutsu, Koji; Tadanaga, Osamu; Takenouchi, Hirokazu; Aihara, Kazuyuki; Kawarabayashi, Ken-ichi; Inoue, Kyo; Utsunomiya, Shoko; Takesue, Hiroki

    2016-11-01

    The analysis and optimization of complex systems can be reduced to mathematical problems collectively known as combinatorial optimization. Many such problems can be mapped onto ground-state search problems of the Ising model, and various artificial spin systems are now emerging as promising approaches. However, physical Ising machines have suffered from limited numbers of spin-spin couplings because of implementations based on localized spins, resulting in severe scalability problems. We report a 2000-spin network with all-to-all spin-spin couplings. Using a measurement and feedback scheme, we coupled time-multiplexed degenerate optical parametric oscillators to implement maximum cut problems on arbitrary graph topologies with up to 2000 nodes. Our coherent Ising machine outperformed simulated annealing in terms of accuracy and computation time for a 2000-node complete graph.

  3. Optimal stability polynomials for numerical integration of initial value problems

    KAUST Repository

    Ketcheson, David I.

    2013-01-08

    We consider the problem of finding optimally stable polynomial approximations to the exponential for application to one-step integration of initial value ordinary and partial differential equations. The objective is to find the largest stable step size and corresponding method for a given problem when the spectrum of the initial value problem is known. The problem is expressed in terms of a general least deviation feasibility problem. Its solution is obtained by a new fast, accurate, and robust algorithm based on convex optimization techniques. Global convergence of the algorithm is proven in the case that the order of approximation is one and in the case that the spectrum encloses a starlike region. Examples demonstrate the effectiveness of the proposed algorithm even when these conditions are not satisfied.

  4. The Coral Reefs Optimization Algorithm: A Novel Metaheuristic for Efficiently Solving Optimization Problems

    Science.gov (United States)

    Salcedo-Sanz, S.; Del Ser, J.; Landa-Torres, I.; Gil-López, S.; Portilla-Figueras, J. A.

    2014-01-01

    This paper presents a novel bioinspired algorithm to tackle complex optimization problems: the coral reefs optimization (CRO) algorithm. The CRO algorithm artificially simulates a coral reef, where different corals (namely, solutions to the optimization problem considered) grow and reproduce in coral colonies, fighting by choking out other corals for space in the reef. This fight for space, along with the specific characteristics of the corals' reproduction, produces a robust metaheuristic algorithm shown to be powerful for solving hard optimization problems. In this research the CRO algorithm is tested in several continuous and discrete benchmark problems, as well as in practical application scenarios (i.e., optimum mobile network deployment and off-shore wind farm design). The obtained results confirm the excellent performance of the proposed algorithm and open line of research for further application of the algorithm to real-world problems. PMID:25147860

  5. Optimization of fuel core loading pattern design in a VVER nuclear power reactors using Particle Swarm Optimization (PSO)

    International Nuclear Information System (INIS)

    Babazadeh, Davood; Boroushaki, Mehrdad; Lucas, Caro

    2009-01-01

    The two main goals in core fuel loading pattern design optimization are maximizing the core effective multiplication factor (K eff ) in order to extract the maximum energy, and keeping the local power peaking factor (P q ) lower than a predetermined value to maintain fuel integrity. In this research, a new strategy based on Particle Swarm Optimization (PSO) algorithm has been developed to optimize the fuel core loading pattern in a typical VVER. The PSO algorithm presents a simple social model by inspiration from bird collective behavior in finding food. A modified version of PSO algorithm for discrete variables has been developed and implemented successfully for the multi-objective optimization of fuel loading pattern design with constraints of keeping P q lower than a predetermined value and maximizing K eff . This strategy has been accomplished using WIMSD and CITATION calculation codes. Simulation results show that this algorithm can help in the acquisition of a new pattern without contravention of the constraints.

  6. Improving the calculated core stability by the core nuclear design optimization

    International Nuclear Information System (INIS)

    Partanen, P.

    1995-01-01

    Three different equilibrium core loadings for TVO II reactor have been generated in order to improve the core stability properties at uprated power level. The reactor thermal power is assumed to be uprated from 2160 MW th to 2500 MW th , which moves the operating point after a rapid pump rundown where the core stability has been calculated from 1340 MW th and 3200 kg/s to 1675 MW th and 4000 kg/s. The core has been refuelled with ABB Atom Svea-100 -fuel, which has 3,64% w/o U-235 average enrichment in the highly enriched zone. PHOENIX lattice code has been used to provide the homogenized nuclear constants. POLCA4 static core simulator has been used for core loadings and cycle simulations and RAMONA-3B program for simulating the dynamic response to the disturbance for which the stability behaviour has been evaluated. The core decay ratio has been successfully reduced from 0,83 to 0,55 mainly by reducing the power peaking factors. (orig.) (7 figs., 1 tab.)

  7. Optimal recombination in genetic algorithms for combinatorial optimization problems: Part I

    Directory of Open Access Journals (Sweden)

    Eremeev Anton V.

    2014-01-01

    Full Text Available This paper surveys results on complexity of the optimal recombination problem (ORP, which consists in finding the best possible offspring as a result of a recombination operator in a genetic algorithm, given two parent solutions. We consider efficient reductions of the ORPs, allowing to establish polynomial solvability or NP-hardness of the ORPs, as well as direct proofs of hardness results. Part I presents the basic principles of optimal recombination with a survey of results on Boolean Linear Programming Problems. Part II (to appear in a subsequent issue is devoted to the ORPs for problems which are naturally formulated in terms of search for an optimal permutation.

  8. Particle swarm as optimization tool in complex nuclear engineering problems

    International Nuclear Information System (INIS)

    Medeiros, Jose Antonio Carlos Canedo

    2005-06-01

    Due to its low computational cost, gradient-based search techniques associated to linear programming techniques are being used as optimization tools. These techniques, however, when applied to multimodal search spaces, can lead to local optima. When finding solutions for complex multimodal domains, random search techniques are being used with great efficacy. In this work we exploit the swarm optimization algorithm search power capacity as an optimization tool for the solution of complex high dimension and multimodal search spaces of nuclear problems. Due to its easy and natural representation of high dimension domains, the particle swarm optimization was applied with success for the solution of complex nuclear problems showing its efficacy in the search of solutions in high dimension and complex multimodal spaces. In one of these applications it enabled a natural and trivial solution in a way not obtained with other methods confirming the validity of its application. (author)

  9. Galerkin approximations of nonlinear optimal control problems in Hilbert spaces

    Directory of Open Access Journals (Sweden)

    Mickael D. Chekroun

    2017-07-01

    Full Text Available Nonlinear optimal control problems in Hilbert spaces are considered for which we derive approximation theorems for Galerkin approximations. Approximation theorems are available in the literature. The originality of our approach relies on the identification of a set of natural assumptions that allows us to deal with a broad class of nonlinear evolution equations and cost functionals for which we derive convergence of the value functions associated with the optimal control problem of the Galerkin approximations. This convergence result holds for a broad class of nonlinear control strategies as well. In particular, we show that the framework applies to the optimal control of semilinear heat equations posed on a general compact manifold without boundary. The framework is then shown to apply to geoengineering and mitigation of greenhouse gas emissions formulated here in terms of optimal control of energy balance climate models posed on the sphere $\\mathbb{S}^2$.

  10. Quantum behaved Particle Swarm Optimization with Differential Mutation operator applied to WWER-1000 in-core fuel management optimization

    International Nuclear Information System (INIS)

    Jamalipour, Mostafa; Sayareh, Reza; Gharib, Morteza; Khoshahval, Farrokh; Karimi, Mahmood Reza

    2013-01-01

    Highlights: ► A new method called QPSO-DM is applied to BNPP in-core fuel management optimization. ► It is found that QPSO-DM performs better than PSO and QPSO. ► This method provides a permissible arrangement for optimum loading pattern. - Abstract: This paper presents a new method using Quantum Particle Swarm Optimization with Differential Mutation operator (QPSO-DM) for optimizing WWER-1000 core fuel management. Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) have shown good performance on in-core fuel management optimization (ICFMO). The objective of this paper is to show that QPSO-DM performs very well and is comparable to PSO and Quantum Particle Swarm Optimization (QPSO). Most of the strategies for ICFMO are based on maximizing multiplication factor (k eff ) to increase cycle length and minimizing power peaking factor (P q ) in order to improve fuel integrity. PSO, QPSO and QPSO-DM have been implemented to fulfill these requirements for the first operating cycle of WWER-1000 Bushehr Nuclear Power Plant (BNPP). The results show that QPSO-DM performs better than the others. A program has been written in MATLAB to map PSO, QPSO and QPSO-DM for loading pattern optimization. WIMS and CITATION have been used to simulate reactor core for neutronic calculations

  11. Core Problem: Does the CV Parent Body Magnetization require differentiation?

    Science.gov (United States)

    O'Brien, T.; Tarduno, J. A.; Smirnov, A. V.

    2016-12-01

    Evidence for the presence of past dynamos from magnetic studies of meteorites can provide key information on the nature and evolution of parent bodies. However, the suggestion of a past core dynamo for the CV parent body based on the study of the Allende meteorite has led to a paradox: a core dynamo requires differentiation, evidence for which is missing in the meteorite record. The key parameter used to distinguish core dynamo versus external field mechanisms is absolute field paleointensity, with high values (>>1 μT) favoring the former. Here we explore the fundamental requirements for absolute field intensity measurement in the Allende meteorite: single domain grains that are non-interacting. Magnetic hysteresis and directional data define strong magnetic interactions, negating a standard interpretation of paleointensity measurements in terms of absolute paleofield values. The Allende low field magnetic susceptibility is dominated by magnetite and FeNi grains, whereas the magnetic remanence is carried by an iron sulfide whose remanence-carrying capacity increases with laboratory cycling at constant field values, indicating reordering. The iron sulfide and FeNi grains are in close proximity, providing mineralogical context for interactions. We interpret the magnetization of Allende to record the intense early solar wind with metal-sulfide interactions amplifying the field, giving the false impression of a higher field value in some prior studies. An undifferentiated CV parent body is thus compatible with Allende's magnetization. Early solar wind magnetization should be the null hypothesis for evaluating the source of magnetization for chondrites and other meteorites.

  12. Optimization of in-core fuel management and control rod strategy in equilibrium fuel cycle

    International Nuclear Information System (INIS)

    Sekimizu, Koichi

    1975-01-01

    An in-core fuel management problem is formulated for the equilibrium fuel cycle in an N-region nuclear reactor model. The formulation shows that the infinite multiplication factor k infinity requisite for newly charged fuel can be separated into two terms - one corresponding to the average k infinity at the end of the cycle and the other representing the direct contribution of the shuffling scheme and control rod programming. This formulation is applied to a three-region cylindrical reactor to obtain simultaneous optimization of shuffling and control rod programming. It is demonstrated that this formulation aids greatly in gaining a better understanding of the effects of changes in the shuffling scheme and control rod programming on equilibrium fuel cycle performance. (auth.)

  13. Finding optimal measures of core inflation in the Kyrgyz Republic

    Czech Academy of Sciences Publication Activity Database

    Uzagalieva, Ainura

    -, č. 261 (2005), s. 1-37 ISSN 1211-3298 Institutional research plan: CEZ:AV0Z70850503 Keywords : Kyrgyz Republic * core inflation * monetary policy Subject RIV: AH - Economics http://www.cerge-ei.cz/pdf/wp/Wp261.pdf

  14. Parallel and Cooperative Particle Swarm Optimizer for Multimodal Problems

    Directory of Open Access Journals (Sweden)

    Geng Zhang

    2015-01-01

    Full Text Available Although the original particle swarm optimizer (PSO method and its related variant methods show some effectiveness for solving optimization problems, it may easily get trapped into local optimum especially when solving complex multimodal problems. Aiming to solve this issue, this paper puts forward a novel method called parallel and cooperative particle swarm optimizer (PCPSO. In case that the interacting of the elements in D-dimensional function vector X=[x1,x2,…,xd,…,xD] is independent, cooperative particle swarm optimizer (CPSO is used. Based on this, the PCPSO is presented to solve real problems. Since the dimension cannot be split into several lower dimensional search spaces in real problems because of the interacting of the elements, PCPSO exploits the cooperation of two parallel CPSO algorithms by orthogonal experimental design (OED learning. Firstly, the CPSO algorithm is used to generate two locally optimal vectors separately; then the OED is used to learn the merits of these two vectors and creates a better combination of them to generate further search. Experimental studies on a set of test functions show that PCPSO exhibits better robustness and converges much closer to the global optimum than several other peer algorithms.

  15. Optimal Design and Analysis of the Stepped Core for Wireless Power Transfer Systems

    Directory of Open Access Journals (Sweden)

    Xiu Zhang

    2016-01-01

    Full Text Available The key of wireless power transfer technology rests on finding the most suitable means to improve the efficiency of the system. The wireless power transfer system applied in implantable medical devices can reduce the patients’ physical and economic burden because it will achieve charging in vitro. For a deep brain stimulator, in this paper, the transmitter coil is designed and optimized. According to the previous research results, the coils with ferrite core can improve the performance of the wireless power transfer system. Compared with the normal ferrite core, the stepped core can produce more uniform magnetic flux density. In this paper, the finite element method (FEM is used to analyze the system. The simulation results indicate that the core loss generated in the optimal stepped ferrite core can reduce about 10% compared with the normal ferrite core, and the efficiency of the wireless power transfer system can be increased significantly.

  16. Optimal Control Problems for Partial Differential Equations on Reticulated Domains

    CERN Document Server

    Kogut, Peter I

    2011-01-01

    In the development of optimal control, the complexity of the systems to which it is applied has increased significantly, becoming an issue in scientific computing. In order to carry out model-reduction on these systems, the authors of this work have developed a method based on asymptotic analysis. Moving from abstract explanations to examples and applications with a focus on structural network problems, they aim at combining techniques of homogenization and approximation. Optimal Control Problems for Partial Differential Equations on Reticulated Domains is an excellent reference tool for gradu

  17. Intelligent discrete particle swarm optimization for multiprocessor task scheduling problem

    Directory of Open Access Journals (Sweden)

    S Sarathambekai

    2017-03-01

    Full Text Available Discrete particle swarm optimization is one of the most recently developed population-based meta-heuristic optimization algorithm in swarm intelligence that can be used in any discrete optimization problems. This article presents a discrete particle swarm optimization algorithm to efficiently schedule the tasks in the heterogeneous multiprocessor systems. All the optimization algorithms share a common algorithmic step, namely population initialization. It plays a significant role because it can affect the convergence speed and also the quality of the final solution. The random initialization is the most commonly used method in majority of the evolutionary algorithms to generate solutions in the initial population. The initial good quality solutions can facilitate the algorithm to locate the optimal solution or else it may prevent the algorithm from finding the optimal solution. Intelligence should be incorporated to generate the initial population in order to avoid the premature convergence. This article presents a discrete particle swarm optimization algorithm, which incorporates opposition-based technique to generate initial population and greedy algorithm to balance the load of the processors. Make span, flow time, and reliability cost are three different measures used to evaluate the efficiency of the proposed discrete particle swarm optimization algorithm for scheduling independent tasks in distributed systems. Computational simulations are done based on a set of benchmark instances to assess the performance of the proposed algorithm.

  18. Solving Unconstrained Global Optimization Problems via Hybrid Swarm Intelligence Approaches

    Directory of Open Access Journals (Sweden)

    Jui-Yu Wu

    2013-01-01

    Full Text Available Stochastic global optimization (SGO algorithms such as the particle swarm optimization (PSO approach have become popular for solving unconstrained global optimization (UGO problems. The PSO approach, which belongs to the swarm intelligence domain, does not require gradient information, enabling it to overcome this limitation of traditional nonlinear programming methods. Unfortunately, PSO algorithm implementation and performance depend on several parameters, such as cognitive parameter, social parameter, and constriction coefficient. These parameters are tuned by using trial and error. To reduce the parametrization of a PSO method, this work presents two efficient hybrid SGO approaches, namely, a real-coded genetic algorithm-based PSO (RGA-PSO method and an artificial immune algorithm-based PSO (AIA-PSO method. The specific parameters of the internal PSO algorithm are optimized using the external RGA and AIA approaches, and then the internal PSO algorithm is applied to solve UGO problems. The performances of the proposed RGA-PSO and AIA-PSO algorithms are then evaluated using a set of benchmark UGO problems. Numerical results indicate that, besides their ability to converge to a global minimum for each test UGO problem, the proposed RGA-PSO and AIA-PSO algorithms outperform many hybrid SGO algorithms. Thus, the RGA-PSO and AIA-PSO approaches can be considered alternative SGO approaches for solving standard-dimensional UGO problems.

  19. Coevolutionary particle swarm optimization using Gaussian distribution for solving constrained optimization problems.

    Science.gov (United States)

    Krohling, Renato A; Coelho, Leandro dos Santos

    2006-12-01

    In this correspondence, an approach based on coevolutionary particle swarm optimization to solve constrained optimization problems formulated as min-max problems is presented. In standard or canonical particle swarm optimization (PSO), a uniform probability distribution is used to generate random numbers for the accelerating coefficients of the local and global terms. We propose a Gaussian probability distribution to generate the accelerating coefficients of PSO. Two populations of PSO using Gaussian distribution are used on the optimization algorithm that is tested on a suite of well-known benchmark constrained optimization problems. Results have been compared with the canonical PSO (constriction factor) and with a coevolutionary genetic algorithm. Simulation results show the suitability of the proposed algorithm in terms of effectiveness and robustness.

  20. Heuristic Optimization for the Discrete Virtual Power Plant Dispatch Problem

    DEFF Research Database (Denmark)

    Petersen, Mette Kirschmeyer; Hansen, Lars Henrik; Bendtsen, Jan Dimon

    2014-01-01

    We consider a Virtual Power Plant, which is given the task of dispatching a fluctuating power supply to a portfolio of flexible consumers. The flexible consumers are modeled as discrete batch processes, and the associated optimization problem is denoted the Discrete Virtual Power Plant Dispatch...... Problem. First NP-completeness of the Discrete Virtual Power Plant Dispatch Problem is proved formally. We then proceed to develop tailored versions of the meta-heuristic algorithms Hill Climber and Greedy Randomized Adaptive Search Procedure (GRASP). The algorithms are tuned and tested on portfolios...... of varying sizes. We find that all the tailored algorithms perform satisfactorily in the sense that they are able to find sub-optimal, but usable, solutions to very large problems (on the order of 10 5 units) at computation times on the scale of just 10 seconds, which is far beyond the capabilities...

  1. Solving optimization problems by the public goods game

    Science.gov (United States)

    Javarone, Marco Alberto

    2017-09-01

    We introduce a method based on the Public Goods Game for solving optimization tasks. In particular, we focus on the Traveling Salesman Problem, i.e. a NP-hard problem whose search space exponentially grows increasing the number of cities. The proposed method considers a population whose agents are provided with a random solution to the given problem. In doing so, agents interact by playing the Public Goods Game using the fitness of their solution as currency of the game. Notably, agents with better solutions provide higher contributions, while those with lower ones tend to imitate the solution of richer agents for increasing their fitness. Numerical simulations show that the proposed method allows to compute exact solutions, and suboptimal ones, in the considered search spaces. As result, beyond to propose a new heuristic for combinatorial optimization problems, our work aims to highlight the potentiality of evolutionary game theory beyond its current horizons.

  2. Newton-type methods for optimization and variational problems

    CERN Document Server

    Izmailov, Alexey F

    2014-01-01

    This book presents comprehensive state-of-the-art theoretical analysis of the fundamental Newtonian and Newtonian-related approaches to solving optimization and variational problems. A central focus is the relationship between the basic Newton scheme for a given problem and algorithms that also enjoy fast local convergence. The authors develop general perturbed Newtonian frameworks that preserve fast convergence and consider specific algorithms as particular cases within those frameworks, i.e., as perturbations of the associated basic Newton iterations. This approach yields a set of tools for the unified treatment of various algorithms, including some not of the Newton type per se. Among the new subjects addressed is the class of degenerate problems. In particular, the phenomenon of attraction of Newton iterates to critical Lagrange multipliers and its consequences as well as stabilized Newton methods for variational problems and stabilized sequential quadratic programming for optimization. This volume will b...

  3. Global Sufficient Optimality Conditions for a Special Cubic Minimization Problem

    Directory of Open Access Journals (Sweden)

    Xiaomei Zhang

    2012-01-01

    Full Text Available We present some sufficient global optimality conditions for a special cubic minimization problem with box constraints or binary constraints by extending the global subdifferential approach proposed by V. Jeyakumar et al. (2006. The present conditions generalize the results developed in the work of V. Jeyakumar et al. where a quadratic minimization problem with box constraints or binary constraints was considered. In addition, a special diagonal matrix is constructed, which is used to provide a convenient method for justifying the proposed sufficient conditions. Then, the reformulation of the sufficient conditions follows. It is worth noting that this reformulation is also applicable to the quadratic minimization problem with box or binary constraints considered in the works of V. Jeyakumar et al. (2006 and Y. Wang et al. (2010. Finally some examples demonstrate that our optimality conditions can effectively be used for identifying global minimizers of the certain nonconvex cubic minimization problem.

  4. Core-collapse supernovae - successes, problems, and perspectives

    CERN Document Server

    Janka, H T

    2000-01-01

    Multi-dimensional hydrodynamic simulations of the post-bounce evolution of collapsed stellar iron cores have demonstrated that convective overturn between the stalled shock and the neutrinosphere can have an important effect on the neutrino-driven explosion mechanism. Whether a model yields a successful explosion or not, however, still depends on the power of neutrino energy deposition behind the stalled shock. The neutrino interaction with the stellar gas in the 'hot bubble' also determines the duration of the shock stagnation phase, the explosion energy, and the composition of the neutrino-heated supernova ejecta. More accurate models require a more precise calculation of the neutrino luminosities and spectra and of the angular distributions of the neutrinos in the heating region. Therefore it is necessary to improve the numerical treatment of the neutrino transport, to take into account convective processes inside the newly formed neutron star, and to develop a better understanding of the neutrino opacitie...

  5. Compiling Planning into Quantum Optimization Problems: A Comparative Study

    Science.gov (United States)

    2015-06-07

    to SAT, and then reduces higher order terms to quadratic terms through a series of gadgets . Our mappings allow both positive and negative preconditions...to its being specific to this type of problem) and likely benefits from an homogeneous parameter setting (Venturelli et al. 2014), as it generates a...Guzik, A. 2013. Resource efficient gadgets for compiling adiabatic quan- tum optimization problems. Annalen der Physik 525(10- 11):877–888. Blum, A

  6. Optimal Results and Numerical Simulations for Flow Shop Scheduling Problems

    Directory of Open Access Journals (Sweden)

    Tao Ren

    2012-01-01

    Full Text Available This paper considers the m-machine flow shop problem with two objectives: makespan with release dates and total quadratic completion time, respectively. For Fm|rj|Cmax, we prove the asymptotic optimality for any dense scheduling when the problem scale is large enough. For Fm‖ΣCj2, improvement strategy with local search is presented to promote the performance of the classical SPT heuristic. At the end of the paper, simulations show the effectiveness of the improvement strategy.

  7. Agent assisted interactive algorithm for computationally demanding multiobjective optimization problems

    OpenAIRE

    Ojalehto, Vesa; Podkopaev, Dmitry; Miettinen, Kaisa

    2015-01-01

    We generalize the applicability of interactive methods for solving computationally demanding, that is, time-consuming, multiobjective optimization problems. For this purpose we propose a new agent assisted interactive algorithm. It employs a computationally inexpensive surrogate problem and four different agents that intelligently update the surrogate based on the preferences specified by a decision maker. In this way, we decrease the waiting times imposed on the decision maker du...

  8. Do Imitation Problems Reflect a Core Characteristic in Autism? Evidence from a Literature Review

    Science.gov (United States)

    Vanvuchelen, Marleen; Roeyers, Herbert; De Weerdt, Willy

    2011-01-01

    Although imitation problems have been associated with autism for many years, the issue if these problems are a core deficit in autism remains subject of debate. In this review article, the question if autism imitation problems fulfil the criteria of uniqueness, specificity, universality, persistency, precedence and broadness is explored and…

  9. Dynamic Vehicle Routing Problems with Enhanced Ant Colony Optimization

    Directory of Open Access Journals (Sweden)

    Haitao Xu

    2018-01-01

    Full Text Available As we all know, there are a great number of optimization problems in the world. One of the relatively complicated and high-level problems is the vehicle routing problem (VRP. Dynamic vehicle routing problem (DVRP is a major variant of VRP, and it is closer to real logistic scene. In DVRP, the customers’ demands appear with time, and the unserved customers’ points must be updated and rearranged while carrying out the programming paths. Owing to the complexity and significance of the problem, DVRP applications have grabbed the attention of researchers in the past two decades. In this paper, we have two main contributions to solving DVRP. Firstly, DVRP is solved with enhanced Ant Colony Optimization (E-ACO, which is the traditional Ant Colony Optimization (ACO fusing improved K-means and crossover operation. K-means can divide the region with the most reasonable distance, while ACO using crossover is applied to extend search space and avoid falling into local optimum prematurely. Secondly, several new evaluation benchmarks are proposed, which can objectively and comprehensively estimate the proposed method. In the experiment, the results for different scale problems are compared to those of previously published papers. Experimental results show that the algorithm is feasible and efficient.

  10. On the equivalence of optimality criterion and sequential approximate optimization methods in the classical layout problem

    NARCIS (Netherlands)

    Groenwold, A.A.; Etman, L.F.P.

    2008-01-01

    We study the classical topology optimization problem, in which minimum compliance is sought, subject to linear constraints. Using a dual statement, we propose two separable and strictly convex subproblems for use in sequential approximate optimization (SAO) algorithms.Respectively, the subproblems

  11. Optimal recombination in genetic algorithms for combinatorial optimization problems: Part II

    Directory of Open Access Journals (Sweden)

    Eremeev Anton V.

    2014-01-01

    Full Text Available This paper surveys results on complexity of the optimal recombination problem (ORP, which consists in finding the best possible offspring as a result of a recombination operator in a genetic algorithm, given two parent solutions. In Part II, we consider the computational complexity of ORPs arising in genetic algorithms for problems on permutations: the Travelling Salesman Problem, the Shortest Hamilton Path Problem and the Makespan Minimization on Single Machine and some other related problems. The analysis indicates that the corresponding ORPs are NP-hard, but solvable by faster algorithms, compared to the problems they are derived from.

  12. Quadratic third-order tensor optimization problem with quadratic constraints

    Directory of Open Access Journals (Sweden)

    Lixing Yang

    2014-05-01

    Full Text Available Quadratically constrained quadratic programs (QQPs problems play an important modeling role for many diverse problems. These problems are in general NP hard and numerically intractable. Semidenite programming (SDP relaxations often provide good approximate solutions to these hard problems. For several special cases of QQP, e.g., convex programs and trust region subproblems, SDP relaxation provides the exact optimal value, i.e., there is a zero duality gap. However, this is not true for the general QQP, or even the QQP with two convex constraints, but a nonconvex objective.In this paper, we consider a certain QQP where the variable is neither vector nor matrix but a third-order tensor. This problem can be viewed as a generalization of the ordinary QQP with vector or matrix as it's variant. Under some mild conditions, we rst show that SDP relaxation provides exact optimal solutions for the original problem. Then we focus on two classes of homogeneous quadratic tensor programming problems which have no requirements on the constraints number. For one, we provide an easily implemental polynomial time algorithm to approximately solve the problem and discuss the approximation ratio. For the other, we show there is no gap between the SDP relaxation and itself.

  13. The Bird Core for Minimum Cost Spanning Tree problems Revisited : Monotonicity and Additivity Aspects

    NARCIS (Netherlands)

    Tijs, S.H.; Moretti, S.; Brânzei, R.; Norde, H.W.

    2005-01-01

    A new way is presented to define for minimum cost spanning tree (mcst-) games the irreducible core, which is introduced by Bird in 1976.The Bird core correspondence turns out to have interesting monotonicity and additivity properties and each stable cost monotonic allocation rule for mcst-problems

  14. Optimization problems with equilibrium constraints and their numerical solution

    Czech Academy of Sciences Publication Activity Database

    Kočvara, Michal; Outrata, Jiří

    Roč. 101 , č. 1 (2004), s. 119-149 ISSN 0025-5610 R&D Projects: GA AV ČR IAA1075005 Grant - others:BMBF(DE) 03ZOM3ER Institutional research plan: CEZ:AV0Z1075907 Keywords : optimization problems * MPEC * MPCC Subject RIV: BA - General Mathematics Impact factor: 1.016, year: 2004

  15. Scenario tree generation and multi-asset financial optimization problems

    DEFF Research Database (Denmark)

    Geyer, Alois; Hanke, Michael; Weissensteiner, Alex

    2013-01-01

    We compare two popular scenario tree generation methods in the context of financial optimization: moment matching and scenario reduction. Using a simple problem with a known analytic solution, moment matching-when ensuring absence of arbitrage-replicates this solution precisely. On the other hand...

  16. Optimal portfolio selection for general provisioning and terminal wealth problems

    NARCIS (Netherlands)

    van Weert, K.; Dhaene, J.; Goovaerts, M.

    2010-01-01

    In Dhaene et al. (2005), multiperiod portfolio selection problems are discussed, using an analytical approach to find optimal constant mix investment strategies in a provisioning or a savings context. In this paper we extend some of these results, investigating some specific, real-life situations.

  17. Optimal portfolio selection for general provisioning and terminal wealth problems

    NARCIS (Netherlands)

    van Weert, K.; Dhaene, J.; Goovaerts, M.

    2009-01-01

    In Dhaene et al. (2005), multiperiod portfolio selection problems are discussed, using an analytical approach to find optimal constant mix investment strategies in a provisioning or savings context. In this paper we extend some of these results, investigating some specific, real-life situations. The

  18. New preconditioned conjugate gradient algorithms for nonlinear unconstrained optimization problems

    International Nuclear Information System (INIS)

    Al-Bayati, A.; Al-Asadi, N.

    1997-01-01

    This paper presents two new predilection conjugate gradient algorithms for nonlinear unconstrained optimization problems and examines their computational performance. Computational experience shows that the new proposed algorithms generally imp lone the efficiency of Nazareth's [13] preconditioned conjugate gradient algorithm. (authors). 16 refs., 1 tab

  19. Proposal of Evolutionary Simplex Method for Global Optimization Problem

    Science.gov (United States)

    Shimizu, Yoshiaki

    To make an agile decision in a rational manner, role of optimization engineering has been notified increasingly under diversified customer demand. With this point of view, in this paper, we have proposed a new evolutionary method serving as an optimization technique in the paradigm of optimization engineering. The developed method has prospects to solve globally various complicated problem appearing in real world applications. It is evolved from the conventional method known as Nelder and Mead’s Simplex method by virtue of idea borrowed from recent meta-heuristic method such as PSO. Mentioning an algorithm to handle linear inequality constraints effectively, we have validated effectiveness of the proposed method through comparison with other methods using several benchmark problems.

  20. Redundant interferometric calibration as a complex optimization problem

    Science.gov (United States)

    Grobler, T. L.; Bernardi, G.; Kenyon, J. S.; Parsons, A. R.; Smirnov, O. M.

    2018-05-01

    Observations of the redshifted 21 cm line from the epoch of reionization have recently motivated the construction of low-frequency radio arrays with highly redundant configurations. These configurations provide an alternative calibration strategy - `redundant calibration' - and boost sensitivity on specific spatial scales. In this paper, we formulate calibration of redundant interferometric arrays as a complex optimization problem. We solve this optimization problem via the Levenberg-Marquardt algorithm. This calibration approach is more robust to initial conditions than current algorithms and, by leveraging an approximate matrix inversion, allows for further optimization and an efficient implementation (`redundant STEFCAL'). We also investigated using the preconditioned conjugate gradient method as an alternative to the approximate matrix inverse, but found that its computational performance is not competitive with respect to `redundant STEFCAL'. The efficient implementation of this new algorithm is made publicly available.

  1. Utilizing Problem Structure in Optimization of Radiation Therapy

    International Nuclear Information System (INIS)

    Carlsson, Fredrik

    2008-04-01

    In this thesis, optimization approaches for intensity-modulated radiation therapy are developed and evaluated with focus on numerical efficiency and treatment delivery aspects. The first two papers deal with strategies for solving fluence map optimization problems efficiently while avoiding solutions with jagged fluence profiles. The last two papers concern optimization of step-and-shoot parameters with emphasis on generating treatment plans that can be delivered efficiently and accurately. In the first paper, the problem dimension of a fluence map optimization problem is reduced through a spectral decomposition of the Hessian of the objective function. The weights of the eigenvectors corresponding to the p largest eigenvalues are introduced as optimization variables, and the impact on the solution of varying p is studied. Including only a few eigenvector weights results in faster initial decrease of the objective value, but with an inferior solution, compared to optimization of the bixel weights. An approach combining eigenvector weights and bixel weights produces improved solutions, but at the expense of the pre-computational time for the spectral decomposition. So-called iterative regularization is performed on fluence map optimization problems in the second paper. The idea is to find regular solutions by utilizing an optimization method that is able to find near-optimal solutions with non-jagged fluence profiles in few iterations. The suitability of a quasi-Newton sequential quadratic programming method is demonstrated by comparing the treatment quality of deliverable step-and-shoot plans, generated through leaf sequencing with a fixed number of segments, for different number of bixel-weight iterations. A conclusion is that over-optimization of the fluence map optimization problem prior to leaf sequencing should be avoided. An approach for dynamically generating multileaf collimator segments using a column generation approach combined with optimization of

  2. Problem statement for optimal design of steel structures

    Directory of Open Access Journals (Sweden)

    Ginzburg Aleksandr Vital'evich

    2014-07-01

    Full Text Available The presented article considers the following complex of tasks. The main stages of the life cycle of a building construction with the indication of process entrance and process exit are described. Requirements imposed on steel constructions are considered. The optimum range of application for steel designs is specified, as well as merits and demerits of a design material. The nomenclature of metal designs is listed - the block diagram is constructed. Possible optimality criteria of steel designs, offered by various authors for various types of constructions are considered. It is established that most often the criterion of a minimum of design mass is accepted as criterion of optimality; more rarely - a minimum of the given expenses, a minimum of a design cost in business. In the present article special attention is paid to a type of objective function of optimization problem. It is also established that depending on the accepted optimality criterion, the use of different types of functions is possible. This complexity of objective function depends on completeness of optimality criterion application. In the work the authors consider the following objective functions: the mass of the main element of a design; objective function by criterion of factory cost; objective function by criterion of cost in business. According to these examples it can be seen that objective functions by the criteria of labor expenses for production of designs are generally non-linear, which complicates solving the optimization problem. Another important factor influencing the problem of optimal design solution for steel designs, which is analyzed, is account for operating restrictions. In the article 8 groups of restrictions are analyzed. Attempts to completely account for the parameters of objective function optimized by particular optimality criteria, taking into account all the operating restrictions, considerably complicates the problem of designing. For solving this

  3. Optimizing investment fund allocation using vehicle routing problem framework

    Science.gov (United States)

    Mamat, Nur Jumaadzan Zaleha; Jaaman, Saiful Hafizah; Ahmad, Rokiah Rozita

    2014-07-01

    The objective of investment is to maximize total returns or minimize total risks. To determine the optimum order of investment, vehicle routing problem method is used. The method which is widely used in the field of resource distribution shares almost similar characteristics with the problem of investment fund allocation. In this paper we describe and elucidate the concept of using vehicle routing problem framework in optimizing the allocation of investment fund. To better illustrate these similarities, sectorial data from FTSE Bursa Malaysia is used. Results show that different values of utility for risk-averse investors generate the same investment routes.

  4. Ordinal optimization and its application to complex deterministic problems

    Science.gov (United States)

    Yang, Mike Shang-Yu

    1998-10-01

    We present in this thesis a new perspective to approach a general class of optimization problems characterized by large deterministic complexities. Many problems of real-world concerns today lack analyzable structures and almost always involve high level of difficulties and complexities in the evaluation process. Advances in computer technology allow us to build computer models to simulate the evaluation process through numerical means, but the burden of high complexities remains to tax the simulation with an exorbitant computing cost for each evaluation. Such a resource requirement makes local fine-tuning of a known design difficult under most circumstances, let alone global optimization. Kolmogorov equivalence of complexity and randomness in computation theory is introduced to resolve this difficulty by converting the complex deterministic model to a stochastic pseudo-model composed of a simple deterministic component and a white-noise like stochastic term. The resulting randomness is then dealt with by a noise-robust approach called Ordinal Optimization. Ordinal Optimization utilizes Goal Softening and Ordinal Comparison to achieve an efficient and quantifiable selection of designs in the initial search process. The approach is substantiated by a case study in the turbine blade manufacturing process. The problem involves the optimization of the manufacturing process of the integrally bladed rotor in the turbine engines of U.S. Air Force fighter jets. The intertwining interactions among the material, thermomechanical, and geometrical changes makes the current FEM approach prohibitively uneconomical in the optimization process. The generalized OO approach to complex deterministic problems is applied here with great success. Empirical results indicate a saving of nearly 95% in the computing cost.

  5. Methods optimization for the first time core critical

    International Nuclear Information System (INIS)

    Yan Liang

    2014-01-01

    The PWR reactor core commissioning programs the content of the first critical reactor physics experiment, and describes thc physical test method. However, all the methods arc not exactly the same but efficient. This article aims to enhance the reactor for the first time in the process of critical safety, shorten the overall time of critical physical test for the first time, and improve the integrity of critical physical test data for the first time and accuracy, eventually to improve the operation of the plant economic benefit adopting sectional dilution, power feedback for Doppler point improvement of physical test methods, and so on. (author)

  6. Statistical physics of hard combinatorial optimization: Vertex cover problem

    Science.gov (United States)

    Zhao, Jin-Hua; Zhou, Hai-Jun

    2014-07-01

    Typical-case computation complexity is a research topic at the boundary of computer science, applied mathematics, and statistical physics. In the last twenty years, the replica-symmetry-breaking mean field theory of spin glasses and the associated message-passing algorithms have greatly deepened our understanding of typical-case computation complexity. In this paper, we use the vertex cover problem, a basic nondeterministic-polynomial (NP)-complete combinatorial optimization problem of wide application, as an example to introduce the statistical physical methods and algorithms. We do not go into the technical details but emphasize mainly the intuitive physical meanings of the message-passing equations. A nonfamiliar reader shall be able to understand to a large extent the physics behind the mean field approaches and to adjust the mean field methods in solving other optimization problems.

  7. Particle Swarm Optimization and Uncertainty Assessment in Inverse Problems

    Directory of Open Access Journals (Sweden)

    José L. G. Pallero

    2018-01-01

    Full Text Available Most inverse problems in the industry (and particularly in geophysical exploration are highly underdetermined because the number of model parameters too high to achieve accurate data predictions and because the sampling of the data space is scarce and incomplete; it is always affected by different kinds of noise. Additionally, the physics of the forward problem is a simplification of the reality. All these facts result in that the inverse problem solution is not unique; that is, there are different inverse solutions (called equivalent, compatible with the prior information that fits the observed data within similar error bounds. In the case of nonlinear inverse problems, these equivalent models are located in disconnected flat curvilinear valleys of the cost-function topography. The uncertainty analysis consists of obtaining a representation of this complex topography via different sampling methodologies. In this paper, we focus on the use of a particle swarm optimization (PSO algorithm to sample the region of equivalence in nonlinear inverse problems. Although this methodology has a general purpose, we show its application for the uncertainty assessment of the solution of a geophysical problem concerning gravity inversion in sedimentary basins, showing that it is possible to efficiently perform this task in a sampling-while-optimizing mode. Particularly, we explain how to use and analyze the geophysical models sampled by exploratory PSO family members to infer different descriptors of nonlinear uncertainty.

  8. Global Optimization of Nonlinear Blend-Scheduling Problems

    Directory of Open Access Journals (Sweden)

    Pedro A. Castillo Castillo

    2017-04-01

    Full Text Available The scheduling of gasoline-blending operations is an important problem in the oil refining industry. This problem not only exhibits the combinatorial nature that is intrinsic to scheduling problems, but also non-convex nonlinear behavior, due to the blending of various materials with different quality properties. In this work, a global optimization algorithm is proposed to solve a previously published continuous-time mixed-integer nonlinear scheduling model for gasoline blending. The model includes blend recipe optimization, the distribution problem, and several important operational features and constraints. The algorithm employs piecewise McCormick relaxation (PMCR and normalized multiparametric disaggregation technique (NMDT to compute estimates of the global optimum. These techniques partition the domain of one of the variables in a bilinear term and generate convex relaxations for each partition. By increasing the number of partitions and reducing the domain of the variables, the algorithm is able to refine the estimates of the global solution. The algorithm is compared to two commercial global solvers and two heuristic methods by solving four examples from the literature. Results show that the proposed global optimization algorithm performs on par with commercial solvers but is not as fast as heuristic approaches.

  9. Stability, Optimality and Manipulation in Matching Problems with Weighted Preferences

    Directory of Open Access Journals (Sweden)

    Maria Silvia Pini

    2013-11-01

    Full Text Available The stable matching problem (also known as the stable marriage problem is a well-known problem of matching men to women, so that no man and woman, who are not married to each other, both prefer each other. Such a problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools or, more generally, to any two-sided market. In the classical stable marriage problem, both men and women express a strict preference order over the members of the other sex, in a qualitative way. Here, we consider stable marriage problems with weighted preferences: each man (resp., woman provides a score for each woman (resp., man. Such problems are more expressive than the classical stable marriage problems. Moreover, in some real-life situations, it is more natural to express scores (to model, for example, profits or costs rather than a qualitative preference ordering. In this context, we define new notions of stability and optimality, and we provide algorithms to find marriages that are stable and/or optimal according to these notions. While expressivity greatly increases by adopting weighted preferences, we show that, in most cases, the desired solutions can be found by adapting existing algorithms for the classical stable marriage problem. We also consider the manipulability properties of the procedures that return such stable marriages. While we know that all procedures are manipulable by modifying the preference lists or by truncating them, here, we consider if manipulation can occur also by just modifying the weights while preserving the ordering and avoiding truncation. It turns out that, by adding weights, in some cases, we may increase the possibility of manipulating, and this cannot be avoided by any reasonable restriction on the weights.

  10. Multiresolution strategies for the numerical solution of optimal control problems

    Science.gov (United States)

    Jain, Sachin

    There exist many numerical techniques for solving optimal control problems but less work has been done in the field of making these algorithms run faster and more robustly. The main motivation of this work is to solve optimal control problems accurately in a fast and efficient way. Optimal control problems are often characterized by discontinuities or switchings in the control variables. One way of accurately capturing the irregularities in the solution is to use a high resolution (dense) uniform grid. This requires a large amount of computational resources both in terms of CPU time and memory. Hence, in order to accurately capture any irregularities in the solution using a few computational resources, one can refine the mesh locally in the region close to an irregularity instead of refining the mesh uniformly over the whole domain. Therefore, a novel multiresolution scheme for data compression has been designed which is shown to outperform similar data compression schemes. Specifically, we have shown that the proposed approach results in fewer grid points in the grid compared to a common multiresolution data compression scheme. The validity of the proposed mesh refinement algorithm has been verified by solving several challenging initial-boundary value problems for evolution equations in 1D. The examples have demonstrated the stability and robustness of the proposed algorithm. The algorithm adapted dynamically to any existing or emerging irregularities in the solution by automatically allocating more grid points to the region where the solution exhibited sharp features and fewer points to the region where the solution was smooth. Thereby, the computational time and memory usage has been reduced significantly, while maintaining an accuracy equivalent to the one obtained using a fine uniform mesh. Next, a direct multiresolution-based approach for solving trajectory optimization problems is developed. The original optimal control problem is transcribed into a

  11. ISP: an optimal out-of-core image-set processing streaming architecture for parallel heterogeneous systems.

    Science.gov (United States)

    Ha, Linh Khanh; Krüger, Jens; Dihl Comba, João Luiz; Silva, Cláudio T; Joshi, Sarang

    2012-06-01

    Image population analysis is the class of statistical methods that plays a central role in understanding the development, evolution, and disease of a population. However, these techniques often require excessive computational power and memory that are compounded with a large number of volumetric inputs. Restricted access to supercomputing power limits its influence in general research and practical applications. In this paper we introduce ISP, an Image-Set Processing streaming framework that harnesses the processing power of commodity heterogeneous CPU/GPU systems and attempts to solve this computational problem. In ISP, we introduce specially designed streaming algorithms and data structures that provide an optimal solution for out-of-core multiimage processing problems both in terms of memory usage and computational efficiency. ISP makes use of the asynchronous execution mechanism supported by parallel heterogeneous systems to efficiently hide the inherent latency of the processing pipeline of out-of-core approaches. Consequently, with computationally intensive problems, the ISP out-of-core solution can achieve the same performance as the in-core solution. We demonstrate the efficiency of the ISP framework on synthetic and real datasets.

  12. Luminescence and efficiency optimization of InGaN/GaN core-shell nanowire LEDs by numerical modelling

    Science.gov (United States)

    Römer, Friedhard; Deppner, Marcus; Andreev, Zhelio; Kölper, Christopher; Sabathil, Matthias; Strassburg, Martin; Ledig, Johannes; Li, Shunfeng; Waag, Andreas; Witzigmann, Bernd

    2012-02-01

    We present a computational study on the anisotropic luminescence and the efficiency of a core-shell type nanowire LED based on GaN with InGaN active quantum wells. The physical simulator used for analyzing this device integrates a multidimensional drift-diffusion transport solver and a k . p Schrödinger problem solver for quantization effects and luminescence. The solution of both problems is coupled to achieve self-consistency. Using this solver we investigate the effect of dimensions, design of quantum wells, and current injection on the efficiency and luminescence of the core-shell nanowire LED. The anisotropy of the luminescence and re-absorption is analyzed with respect to the external efficiency of the LED. From the results we derive strategies for design optimization.

  13. In-core nuclear fuel management optimization of VVER1000 using perturbation theory

    International Nuclear Information System (INIS)

    Hosseini, Mohammad; Vosoughi, Naser

    2011-01-01

    In-core nuclear fuel management is one of the most important concerns in the design of nuclear reactors. The two main goals in core fuel loading pattern design optimization are maximizing the core effective multiplication factor in order to extract the maximum energy, and keeping the local power peaking factor lower than a predetermined value to maintain fuel integrity. Because of the numerous possible patterns of the fuel assemblies in the reactor core, finding the best configuration is so important and complex. Different methods for optimization of fuel loading pattern in the core have been introduced so far. In this study, a software is programmed in C ⧣ language to find an order of the fuel loading pattern of the VVER-1000 reactor core using the perturbation theory. Our optimization method is based on minimizing the radial power peaking factor. The optimization process lunches by considering the initial loading pattern and the specifications of the fuel assemblies which are given as the input of the software. It shall be noticed that the designed algorithm is performed by just shuffling the fuel assemblies. The obtained results by employing the mentioned method on a typical reactor reveal that this method has a high precision in achieving a pattern with an allowable radial power peaking factor. (author)

  14. Optimizing Human Diet Problem Based on Price and Taste Using

    Directory of Open Access Journals (Sweden)

    Hossein EGHBALI

    2012-07-01

    Full Text Available Low price and good taste of foods are regarded as two major factors for optimal human nutrition. Due to price fluctuations and taste diversity, these two factors cannot be certainly and determinately evaluated. This problem must be viewed from another perspective because of the uncertainty about the amount of nutrients per unit of foods and also diversity of people’s daily needs to receive them.This paper discusses human diet problem in fuzzy environment. The approach deals with multi-objective fuzzy linear programming problem using a fuzzy programming technique for its solution. By prescribing a diet merely based on crisp data, some ofthe realities are neglected. For the same reason, we dealt with human diet problem through fuzzy approach. Results indicated uncertainty about factors of nutrition diet -including taste and price, amount of nutrients and their intake- would affect diet quality, making the proposed diet more realistic.

  15. Heuristic versus statistical physics approach to optimization problems

    International Nuclear Information System (INIS)

    Jedrzejek, C.; Cieplinski, L.

    1995-01-01

    Optimization is a crucial ingredient of many calculation schemes in science and engineering. In this paper we assess several classes of methods: heuristic algorithms, methods directly relying on statistical physics such as the mean-field method and simulated annealing; and Hopfield-type neural networks and genetic algorithms partly related to statistical physics. We perform the analysis for three types of problems: (1) the Travelling Salesman Problem, (2) vector quantization, and (3) traffic control problem in multistage interconnection network. In general, heuristic algorithms perform better (except for genetic algorithms) and much faster but have to be specific for every problem. The key to improving the performance could be to include heuristic features into general purpose statistical physics methods. (author)

  16. Development of a VVER-1000 core loading pattern optimization program based on perturbation theory

    International Nuclear Information System (INIS)

    Hosseini, Mohammad; Vosoughi, Naser

    2012-01-01

    Highlights: ► We use perturbation theory to find an optimum fuel loading pattern in a VVER-1000. ► We provide a software for in-core fuel management optimization. ► We consider two objectives for our method (perturbation theory). ► We show that perturbation theory method is very fast and accurate for optimization. - Abstract: In-core nuclear fuel management is one of the most important concerns in the design of nuclear reactors. Two main goals in core fuel loading pattern design optimization are maximizing the core effective multiplication factor in order to extract the maximum energy, and keeping the local power peaking factor lower than a predetermined value to maintain the fuel integrity. Because of the numerous possible patterns of fuel assemblies in the reactor core, finding the best configuration is so important and challenging. Different techniques for optimization of fuel loading pattern in the reactor core have been introduced by now. In this study, a software is programmed in C language to find an order of the fuel loading pattern of a VVER-1000 reactor core using the perturbation theory. Our optimization method is based on minimizing the radial power peaking factor. The optimization process launches by considering an initial loading pattern and the specifications of the fuel assemblies which are given as the input of the software. The results on a typical VVER-1000 reactor reveal that the method could reach to a pattern with an allowed radial power peaking factor and increases the cycle length 1.1 days, as well.

  17. A novel comprehensive learning artificial bee colony optimizer for dynamic optimization biological problems

    Directory of Open Access Journals (Sweden)

    Weixing Su

    2017-03-01

    Full Text Available There are many dynamic optimization problems in the real world, whose convergence and searching ability is cautiously desired, obviously different from static optimization cases. This requires an optimization algorithm adaptively seek the changing optima over dynamic environments, instead of only finding the global optimal solution in the static environment. This paper proposes a novel comprehensive learning artificial bee colony optimizer (CLABC for optimization in dynamic environments problems, which employs a pool of optimal foraging strategies to balance the exploration and exploitation tradeoff. The main motive of CLABC is to enrich artificial bee foraging behaviors in the ABC model by combining Powell’s pattern search method, life-cycle, and crossover-based social learning strategy. The proposed CLABC is a more bee-colony-realistic model that the bee can reproduce and die dynamically throughout the foraging process and population size varies as the algorithm runs. The experiments for evaluating CLABC are conducted on the dynamic moving peak benchmarks. Furthermore, the proposed algorithm is applied to a real-world application of dynamic RFID network optimization. Statistical analysis of all these cases highlights the significant performance improvement due to the beneficial combination and demonstrates the performance superiority of the proposed algorithm.

  18. A novel comprehensive learning artificial bee colony optimizer for dynamic optimization biological problems.

    Science.gov (United States)

    Su, Weixing; Chen, Hanning; Liu, Fang; Lin, Na; Jing, Shikai; Liang, Xiaodan; Liu, Wei

    2017-03-01

    There are many dynamic optimization problems in the real world, whose convergence and searching ability is cautiously desired, obviously different from static optimization cases. This requires an optimization algorithm adaptively seek the changing optima over dynamic environments, instead of only finding the global optimal solution in the static environment. This paper proposes a novel comprehensive learning artificial bee colony optimizer (CLABC) for optimization in dynamic environments problems, which employs a pool of optimal foraging strategies to balance the exploration and exploitation tradeoff. The main motive of CLABC is to enrich artificial bee foraging behaviors in the ABC model by combining Powell's pattern search method, life-cycle, and crossover-based social learning strategy. The proposed CLABC is a more bee-colony-realistic model that the bee can reproduce and die dynamically throughout the foraging process and population size varies as the algorithm runs. The experiments for evaluating CLABC are conducted on the dynamic moving peak benchmarks. Furthermore, the proposed algorithm is applied to a real-world application of dynamic RFID network optimization. Statistical analysis of all these cases highlights the significant performance improvement due to the beneficial combination and demonstrates the performance superiority of the proposed algorithm.

  19. Incorporating the Common Core's Problem Solving Standard for Mathematical Practice into an Early Elementary Inclusive Classroom

    Science.gov (United States)

    Fletcher, Nicole

    2014-01-01

    Mathematics curriculum designers and policy decision makers are beginning to recognize the importance of problem solving, even at the earliest stages of mathematics learning. The Common Core includes sense making and perseverance in solving problems in its standards for mathematical practice for students at all grade levels. Incorporating problem…

  20. RECIPES FOR BUILDING THE DUAL OF CONIC OPTIMIZATION PROBLEM

    Directory of Open Access Journals (Sweden)

    Diah Chaerani

    2010-08-01

    Full Text Available Building the dual of the primal problem of Conic Optimization (CO isa very important step to make the ¯nding optimal solution. In many cases a givenproblem does not have the simple structure of CO problem (i.e., minimizing a linearfunction over an intersection between a±ne space and convex cones but there areseveral conic constraints and sometimes also equality constraints. In this paper wedeal with the question how to form the dual problem in such cases. We discuss theanswer by considering several conic constraints with or without equality constraints.The recipes for building the dual of such cases is formed in standard matrix forms,such that it can be used easily on the numerical experiment. Special attention isgiven to dual development of special classes of CO problems, i.e., conic quadraticand semide¯nite problems. In this paper, we also brie°y present some preliminariestheory on CO as an introduction to the main topic

  1. On the MSE Performance and Optimization of Regularized Problems

    KAUST Repository

    Alrashdi, Ayed

    2016-11-01

    The amount of data that has been measured, transmitted/received, and stored in the recent years has dramatically increased. So, today, we are in the world of big data. Fortunately, in many applications, we can take advantages of possible structures and patterns in the data to overcome the curse of dimensionality. The most well known structures include sparsity, low-rankness, block sparsity. This includes a wide range of applications such as machine learning, medical imaging, signal processing, social networks and computer vision. This also led to a specific interest in recovering signals from noisy compressed measurements (Compressed Sensing (CS) problem). Such problems are generally ill-posed unless the signal is structured. The structure can be captured by a regularizer function. This gives rise to a potential interest in regularized inverse problems, where the process of reconstructing the structured signal can be modeled as a regularized problem. This thesis particularly focuses on finding the optimal regularization parameter for such problems, such as ridge regression, LASSO, square-root LASSO and low-rank Generalized LASSO. Our goal is to optimally tune the regularizer to minimize the mean-squared error (MSE) of the solution when the noise variance or structure parameters are unknown. The analysis is based on the framework of the Convex Gaussian Min-max Theorem (CGMT) that has been used recently to precisely predict performance errors.

  2. A concept for global optimization of topology design problems

    DEFF Research Database (Denmark)

    Stolpe, Mathias; Achtziger, Wolfgang; Kawamoto, Atsushi

    2006-01-01

    We present a concept for solving topology design problems to proven global optimality. We propose that the problems are modeled using the approach of simultaneous analysis and design with discrete design variables and solved with convergent branch and bound type methods. This concept is illustrated...... on two applications. The first application is the design of stiff truss structures where the bar areas are chosen from a finite set of available areas. The second considered application is simultaneous topology and geometry design of planar articulated mechanisms. For each application we outline...

  3. Analytic semigroups and optimal regularity in parabolic problems

    CERN Document Server

    Lunardi, Alessandra

    2012-01-01

    The book shows how the abstract methods of analytic semigroups and evolution equations in Banach spaces can be fruitfully applied to the study of parabolic problems. Particular attention is paid to optimal regularity results in linear equations. Furthermore, these results are used to study several other problems, especially fully nonlinear ones. Owing to the new unified approach chosen, known theorems are presented from a novel perspective and new results are derived. The book is self-contained. It is addressed to PhD students and researchers interested in abstract evolution equations and in p

  4. Topology optimization of coated structures and material interface problems

    DEFF Research Database (Denmark)

    Clausen, Anders; Aage, Niels; Sigmund, Ole

    2015-01-01

    This paper presents a novel method for including coated structures and prescribed material interface properties into the minimum compliance topology optimization problem. Several elements of the method are applicable to a broader range of interface problems. The approach extends the standard SIMP......-step filtering/projection approach. The modeled coating thickness is derived analytically, and the coating is shown to be accurately controlled and applied in a highly uniform manner over the structure. An alternative interpretation of the model is to perform single-material design for additive manufacturing...

  5. An Elite Decision Making Harmony Search Algorithm for Optimization Problem

    Directory of Open Access Journals (Sweden)

    Lipu Zhang

    2012-01-01

    Full Text Available This paper describes a new variant of harmony search algorithm which is inspired by a well-known item “elite decision making.” In the new algorithm, the good information captured in the current global best and the second best solutions can be well utilized to generate new solutions, following some probability rule. The generated new solution vector replaces the worst solution in the solution set, only if its fitness is better than that of the worst solution. The generating and updating steps and repeated until the near-optimal solution vector is obtained. Extensive computational comparisons are carried out by employing various standard benchmark optimization problems, including continuous design variables and integer variables minimization problems from the literature. The computational results show that the proposed new algorithm is competitive in finding solutions with the state-of-the-art harmony search variants.

  6. Shape optimization for Stokes problem with threshold slip

    Czech Academy of Sciences Publication Activity Database

    Haslinger, J.; Stebel, Jan; Taoufik, S.

    2014-01-01

    Roč. 59, č. 6 (2014), s. 631-652 ISSN 0862-7940 R&D Projects: GA ČR GA201/09/0917; GA ČR(CZ) GAP201/12/0671 Institutional support: RVO:67985840 Keywords : Stokes problem * friction boundary condition * shape optimization Subject RIV: BA - General Mathematics Impact factor: 0.400, year: 2014 http://link.springer.com/article/10.1007%2Fs10492-014-0077-z

  7. Optimizing Distribution Problems using WinQSB Software

    Directory of Open Access Journals (Sweden)

    Daniel Mihai Amariei

    2015-07-01

    Full Text Available In the present paper we are presenting a problem of distribution using the Network Modeling Module of the WinQSB software, were we have 5 athletes which we must assign the optimal sample, function of the obtained time, so as to obtain the maximum output of the athletes. Also we analyzed the case of an accident of 2 athletes, the coupling of 3 athletes with 5 various athletic events causing the maximum coupling, done using the Hungarian algorithm.

  8. Integrals of Motion for Discrete-Time Optimal Control Problems

    OpenAIRE

    Torres, Delfim F. M.

    2003-01-01

    We obtain a discrete time analog of E. Noether's theorem in Optimal Control, asserting that integrals of motion associated to the discrete time Pontryagin Maximum Principle can be computed from the quasi-invariance properties of the discrete time Lagrangian and discrete time control system. As corollaries, results for first-order and higher-order discrete problems of the calculus of variations are obtained.

  9. A fractional optimal control problem for maximizing advertising efficiency

    OpenAIRE

    Igor Bykadorov; Andrea Ellero; Stefania Funari; Elena Moretti

    2007-01-01

    We propose an optimal control problem to model the dynamics of the communication activity of a firm with the aim of maximizing its efficiency. We assume that the advertising effort undertaken by the firm contributes to increase the firm's goodwill and that the goodwill affects the firm's sales. The aim is to find the advertising policies in order to maximize the firm's efficiency index which is computed as the ratio between "outputs" and "inputs" properly weighted; the outputs are represented...

  10. Tokenplan: A Planner for Both Satisfaction and Optimization Problem

    OpenAIRE

    Meiller, Yannick; Fabiani, Patrick

    2001-01-01

    Tokenplan is a planner based on the use of Petri nets. Its main feature is the flexibility it offers in the way it builds the planning graph. The Fifth International Conference on Artificial Intelligence Planning and Scheduling planning competition validated its behavior with a graphplan-like behavior. The next step is to demonstrate the benefits we expect from our planner in planning problems involving optimization and uncertainty handling.

  11. Heuristics for NP-hard optimization problems - simpler is better!?

    Directory of Open Access Journals (Sweden)

    Žerovnik Janez

    2015-11-01

    Full Text Available We provide several examples showing that local search, the most basic metaheuristics, may be a very competitive choice for solving computationally hard optimization problems. In addition, generation of starting solutions by greedy heuristics should be at least considered as one of very natural possibilities. In this critical survey, selected examples discussed include the traveling salesman, the resource-constrained project scheduling, the channel assignment, and computation of bounds for the Shannon capacity.

  12. On Equivalence between Optimality Criteria and Projected Gradient Methods with Application to Topology Optimization Problem

    OpenAIRE

    Ananiev, Sergey

    2006-01-01

    The paper demonstrates the equivalence between the optimality criteria (OC) method, initially proposed by Bendsoe & Kikuchi for topology optimization problem, and the projected gradient method. The equivalence is shown using Hestenes definition of Lagrange multipliers. Based on this development, an alternative formulation of the Karush-Kuhn-Tucker (KKT) condition is suggested. Such reformulation has some advantages, which will be also discussed in the paper. For verification purposes the modi...

  13. Robust Optimization Model for Production Planning Problem under Uncertainty

    Directory of Open Access Journals (Sweden)

    Pembe GÜÇLÜ

    2017-01-01

    Full Text Available Conditions of businesses change very quickly. To take into account the uncertainty engendered by changes has become almost a rule while planning. Robust optimization techniques that are methods of handling uncertainty ensure to produce less sensitive results to changing conditions. Production planning, is to decide from which product, when and how much will be produced, with a most basic definition. Modeling and solution of the Production planning problems changes depending on structure of the production processes, parameters and variables. In this paper, it is aimed to generate and apply scenario based robust optimization model for capacitated two-stage multi-product production planning problem under parameter and demand uncertainty. With this purpose, production planning problem of a textile company that operate in İzmir has been modeled and solved, then deterministic scenarios’ and robust method’s results have been compared. Robust method has provided a production plan that has higher cost but, will result close to feasible and optimal for most of the different scenarios in the future.

  14. Bi-objective optimization for multi-modal transportation routing planning problem based on Pareto optimality

    Directory of Open Access Journals (Sweden)

    Yan Sun

    2015-09-01

    Full Text Available Purpose: The purpose of study is to solve the multi-modal transportation routing planning problem that aims to select an optimal route to move a consignment of goods from its origin to its destination through the multi-modal transportation network. And the optimization is from two viewpoints including cost and time. Design/methodology/approach: In this study, a bi-objective mixed integer linear programming model is proposed to optimize the multi-modal transportation routing planning problem. Minimizing the total transportation cost and the total transportation time are set as the optimization objectives of the model. In order to balance the benefit between the two objectives, Pareto optimality is utilized to solve the model by gaining its Pareto frontier. The Pareto frontier of the model can provide the multi-modal transportation operator (MTO and customers with better decision support and it is gained by the normalized normal constraint method. Then, an experimental case study is designed to verify the feasibility of the model and Pareto optimality by using the mathematical programming software Lingo. Finally, the sensitivity analysis of the demand and supply in the multi-modal transportation organization is performed based on the designed case. Findings: The calculation results indicate that the proposed model and Pareto optimality have good performance in dealing with the bi-objective optimization. The sensitivity analysis also shows the influence of the variation of the demand and supply on the multi-modal transportation organization clearly. Therefore, this method can be further promoted to the practice. Originality/value: A bi-objective mixed integer linear programming model is proposed to optimize the multi-modal transportation routing planning problem. The Pareto frontier based sensitivity analysis of the demand and supply in the multi-modal transportation organization is performed based on the designed case.

  15. An Improved Real-Coded Population-Based Extremal Optimization Method for Continuous Unconstrained Optimization Problems

    Directory of Open Access Journals (Sweden)

    Guo-Qiang Zeng

    2014-01-01

    Full Text Available As a novel evolutionary optimization method, extremal optimization (EO has been successfully applied to a variety of combinatorial optimization problems. However, the applications of EO in continuous optimization problems are relatively rare. This paper proposes an improved real-coded population-based EO method (IRPEO for continuous unconstrained optimization problems. The key operations of IRPEO include generation of real-coded random initial population, evaluation of individual and population fitness, selection of bad elements according to power-law probability distribution, generation of new population based on uniform random mutation, and updating the population by accepting the new population unconditionally. The experimental results on 10 benchmark test functions with the dimension N=30 have shown that IRPEO is competitive or even better than the recently reported various genetic algorithm (GA versions with different mutation operations in terms of simplicity, effectiveness, and efficiency. Furthermore, the superiority of IRPEO to other evolutionary algorithms such as original population-based EO, particle swarm optimization (PSO, and the hybrid PSO-EO is also demonstrated by the experimental results on some benchmark functions.

  16. Issues and Strategies in Solving Multidisciplinary Optimization Problems

    Science.gov (United States)

    Patnaik, Surya

    2013-01-01

    Optimization research at NASA Glenn Research Center has addressed the design of structures, aircraft and airbreathing propulsion engines. The accumulated multidisciplinary design activity is collected under a testbed entitled COMETBOARDS. Several issues were encountered during the solution of the problems. Four issues and the strategies adapted for their resolution are discussed. This is followed by a discussion on analytical methods that is limited to structural design application. An optimization process can lead to an inefficient local solution. This deficiency was encountered during design of an engine component. The limitation was overcome through an augmentation of animation into optimization. Optimum solutions obtained were infeasible for aircraft and airbreathing propulsion engine problems. Alleviation of this deficiency required a cascading of multiple algorithms. Profile optimization of a beam produced an irregular shape. Engineering intuition restored the regular shape for the beam. The solution obtained for a cylindrical shell by a subproblem strategy converged to a design that can be difficult to manufacture. Resolution of this issue remains a challenge. The issues and resolutions are illustrated through a set of problems: Design of an engine component, Synthesis of a subsonic aircraft, Operation optimization of a supersonic engine, Design of a wave-rotor-topping device, Profile optimization of a cantilever beam, and Design of a cylindrical shell. This chapter provides a cursory account of the issues. Cited references provide detailed discussion on the topics. Design of a structure can also be generated by traditional method and the stochastic design concept. Merits and limitations of the three methods (traditional method, optimization method and stochastic concept) are illustrated. In the traditional method, the constraints are manipulated to obtain the design and weight is back calculated. In design optimization, the weight of a structure becomes the

  17. Study on the mechanism and efficiency of simulated annealing using an LP optimization benchmark problem - 113

    International Nuclear Information System (INIS)

    Qianqian, Li; Xiaofeng, Jiang; Shaohong, Zhang

    2010-01-01

    Simulated Annealing Algorithm (SAA) for solving combinatorial optimization problems is a popular method for loading pattern optimization. The main purpose of this paper is to understand the underlying search mechanism of SAA and to study its efficiency. In this study, a general SAA that employs random pair exchange of fuel assemblies to search for the optimum fuel Loading Pattern (LP) is applied to an exhaustively searched LP optimization benchmark problem. All the possible LPs of the benchmark problem have been enumerated and evaluated via the use of the very fast and accurate Hybrid Harmonics and Linear Perturbation (HHLP) method, such that the mechanism of SA for LP optimization can be explicitly analyzed and its search efficiency evaluated. The generic core geometry itself dictates that only a small number LPs can be generated by performing random single pair exchanges and that the LPs are necessarily mostly similar to the initial LP. This phase space effect turns out to be the basic mechanism in SAA that can explain its efficiency and good local search ability. A measure of search efficiency is introduced which shows that the stochastic nature of SAA greatly influences the variability of its search efficiency. It is also found that using fuel assembly k-infinity distribution as a technique to filter the LPs can significantly enhance the SAA search efficiency. (authors)

  18. Solvability of the Core Problem with Multiple Right-Hand Sides in the TLS Sense

    Czech Academy of Sciences Publication Activity Database

    Hnětynková, Iveta; Plešinger, M.; Sima, D.M.

    2016-01-01

    Roč. 37, č. 3 (2016), s. 861-876 ISSN 0895-4798 R&D Projects: GA ČR GA13-06684S Institutional support: RVO:67985807 Keywords : total least squares (TLS) problem * multiple right-hand sides * core problem * linear approximation problem * error-in-variables modeling * orthogonal regression * classical TLS algorithm Subject RIV: BA - General Mathematics Impact factor: 2.194, year: 2016

  19. The Core Problem within a Linear Approximation Problem $AX/approx B$ with Multiple Right-Hand Sides

    Czech Academy of Sciences Publication Activity Database

    Hnětynková, Iveta; Plešinger, Martin; Strakoš, Z.

    2013-01-01

    Roč. 34, č. 3 (2013), s. 917-931 ISSN 0895-4798 R&D Projects: GA ČR GA13-06684S Grant - others:GA ČR(CZ) GA201/09/0917; GA MŠk(CZ) EE2.3.09.0155; GA MŠk(CZ) EE2.3.30.0065 Program:GA Institutional support: RVO:67985807 Keywords : total least squares problem * multiple right-hand sides * core problem * linear approximation problem * error-in-variables modeling * orthogonal regression * singular value decomposition Subject RIV: BA - General Mathematics Impact factor: 1.806, year: 2013

  20. Prediction and Optimization of Key Performance Indicators in the Production of Stator Core Using a GA-NN Approach

    Science.gov (United States)

    Rajora, M.; Zou, P.; Xu, W.; Jin, L.; Chen, W.; Liang, S. Y.

    2017-12-01

    With the rapidly changing demands of the manufacturing market, intelligent techniques are being used to solve engineering problems due to their ability to handle nonlinear complex problems. For example, in the conventional production of stator cores, it is relied upon experienced engineers to make an initial plan on the number of compensation sheets to be added to achieve uniform pressure distribution throughout the laminations. Additionally, these engineers must use their experience to revise the initial plans based upon the measurements made during the production of stator core. However, this method yields inconsistent results as humans are incapable of storing and analysing large amounts of data. In this article, first, a Neural Network (NN), trained using a hybrid Levenberg-Marquardt (LM) - Genetic Algorithm (GA), is developed to assist the engineers with the decision-making process. Next, the trained NN is used as a fitness function in an optimization algorithm to find the optimal values of the initial compensation sheet plan with the aim of minimizing the required revisions during the production of the stator core.

  1. Topology Optimization for Wave Propagation Problems with Experimental Validation

    DEFF Research Database (Denmark)

    Christiansen, Rasmus Ellebæk

    designed using the proposed method is provided. A novel approach for designing meta material slabs with selectively tuned negative refractive behavior is outlined. Numerical examples demonstrating the behavior of a slab under different conditions is provided. Results from an experimental studydemonstrating...... agreement with numerical predictions are presented. Finally an approach for designing acoustic wave shaping devices is treated. Three examples of applications are presented, a directional sound emission device, a wave splitting device and a flat focusing lens. Experimental results for the first two devices......This Thesis treats the development and experimental validation of density-based topology optimization methods for wave propagation problems. Problems in the frequency regime where design dimensions are between approximately one fourth and ten wavelengths are considered. All examples treat problems...

  2. A class-based search for the in-core fuel management optimization of a pressurized water reactor

    International Nuclear Information System (INIS)

    Alvarenga de Moura Meneses, Anderson; Rancoita, Paola; Schirru, Roberto; Gambardella, Luca Maria

    2010-01-01

    The In-Core Fuel Management Optimization (ICFMO) is a prominent problem in nuclear engineering, with high complexity and studied for more than 40 years. Besides manual optimization and knowledge-based methods, optimization metaheuristics such as Genetic Algorithms, Ant Colony Optimization and Particle Swarm Optimization have yielded outstanding results for the ICFMO. In the present article, the Class-Based Search (CBS) is presented for application to the ICFMO. It is a novel metaheuristic approach that performs the search based on the main nuclear characteristics of the fuel assemblies, such as reactivity. The CBS is then compared to the one of the state-of-art algorithms applied to the ICFMO, the Particle Swarm Optimization. Experiments were performed for the optimization of Angra 1 Nuclear Power Plant, located at the Southeast of Brazil. The CBS presented noticeable performance, providing Loading Patterns that yield a higher average of Effective Full Power Days in the simulation of Angra 1 NPP operation, according to our methodology.

  3. A class-based search for the in-core fuel management optimization of a pressurized water reactor

    Energy Technology Data Exchange (ETDEWEB)

    Alvarenga de Moura Meneses, Anderson, E-mail: ameneses@lmp.ufrj.b [Federal University of Rio de Janeiro, COPPE, Nuclear Engineering Program, CP 68509, CEP 21.941-972, Rio de Janeiro, RJ (Brazil); Rancoita, Paola [IDSIA (Dalle Molle Institute for Artificial Intelligence), Galleria 2, 6982 Manno-Lugano, TI (Switzerland); Mathematics Department, Universita degli Studi di Milano (Italy); Schirru, Roberto [Federal University of Rio de Janeiro, COPPE, Nuclear Engineering Program, CP 68509, CEP 21.941-972, Rio de Janeiro, RJ (Brazil); Gambardella, Luca Maria [IDSIA (Dalle Molle Institute for Artificial Intelligence), Galleria 2, 6982 Manno-Lugano, TI (Switzerland)

    2010-11-15

    The In-Core Fuel Management Optimization (ICFMO) is a prominent problem in nuclear engineering, with high complexity and studied for more than 40 years. Besides manual optimization and knowledge-based methods, optimization metaheuristics such as Genetic Algorithms, Ant Colony Optimization and Particle Swarm Optimization have yielded outstanding results for the ICFMO. In the present article, the Class-Based Search (CBS) is presented for application to the ICFMO. It is a novel metaheuristic approach that performs the search based on the main nuclear characteristics of the fuel assemblies, such as reactivity. The CBS is then compared to the one of the state-of-art algorithms applied to the ICFMO, the Particle Swarm Optimization. Experiments were performed for the optimization of Angra 1 Nuclear Power Plant, located at the Southeast of Brazil. The CBS presented noticeable performance, providing Loading Patterns that yield a higher average of Effective Full Power Days in the simulation of Angra 1 NPP operation, according to our methodology.

  4. Optimal Water-Power Flow Problem: Formulation and Distributed Optimal Solution

    Energy Technology Data Exchange (ETDEWEB)

    Dall-Anese, Emiliano [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Zhao, Changhong [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Zamzam, Admed S. [University of Minnesota; Sidiropoulos, Nicholas D. [University of Minnesota; Taylor, Josh A. [University of Toronto

    2018-01-12

    This paper formalizes an optimal water-power flow (OWPF) problem to optimize the use of controllable assets across power and water systems while accounting for the couplings between the two infrastructures. Tanks and pumps are optimally managed to satisfy water demand while improving power grid operations; {for the power network, an AC optimal power flow formulation is augmented to accommodate the controllability of water pumps.} Unfortunately, the physics governing the operation of the two infrastructures and coupling constraints lead to a nonconvex (and, in fact, NP-hard) problem; however, after reformulating OWPF as a nonconvex, quadratically-constrained quadratic problem, a feasible point pursuit-successive convex approximation approach is used to identify feasible and optimal solutions. In addition, a distributed solver based on the alternating direction method of multipliers enables water and power operators to pursue individual objectives while respecting the couplings between the two networks. The merits of the proposed approach are demonstrated for the case of a distribution feeder coupled with a municipal water distribution network.

  5. An Efficient Optimization Method for Solving Unsupervised Data Classification Problems

    Directory of Open Access Journals (Sweden)

    Parvaneh Shabanzadeh

    2015-01-01

    Full Text Available Unsupervised data classification (or clustering analysis is one of the most useful tools and a descriptive task in data mining that seeks to classify homogeneous groups of objects based on similarity and is used in many medical disciplines and various applications. In general, there is no single algorithm that is suitable for all types of data, conditions, and applications. Each algorithm has its own advantages, limitations, and deficiencies. Hence, research for novel and effective approaches for unsupervised data classification is still active. In this paper a heuristic algorithm, Biogeography-Based Optimization (BBO algorithm, was adapted for data clustering problems by modifying the main operators of BBO algorithm, which is inspired from the natural biogeography distribution of different species. Similar to other population-based algorithms, BBO algorithm starts with an initial population of candidate solutions to an optimization problem and an objective function that is calculated for them. To evaluate the performance of the proposed algorithm assessment was carried on six medical and real life datasets and was compared with eight well known and recent unsupervised data classification algorithms. Numerical results demonstrate that the proposed evolutionary optimization algorithm is efficient for unsupervised data classification.

  6. On the degeneracy of the IMRT optimization problem

    International Nuclear Information System (INIS)

    Alber, M.; Meedt, G.; Nuesslin, F.; Reemtsen, R.

    2002-01-01

    One approach to the computation of photon IMRT treatment plans is the formulation of an optimization problem with an objective function that derives from an objective density. An investigation of the second-order properties of such an objective function in a neighborhood of the minimizer opens an intuitive access to many traits of this approach. A general finding is that only a small subset of the parameter space has nonzero curvature, while the objective function is entirely flat in a neighborhood of the minimizer in most directions. The dimension of the subspace of vanishing curvature serves as a measure for the degeneracy of the solution. This finding is important both for algorithm design and evaluation of the mathematical model of clinical intuition, expressed by the objective function. The structure of the subspace of great curvature is found to be imposed on the problem by conflicts between objectives of target and critical structures. These conflicts and their corresponding modes of resolution form a common trait between all reasonable treatment plans of a given case. The high degree of degeneracy makes the use of a conjugate gradient optimization algorithm particularly favorable since the number of iterations to convergence is equivalent to the number of different eigenvalues of the curvature tensor and is hence independent from the number of optimization parameters. A high level of degeneracy of the fluence profiles implies that it should be possible to stipulate further delivery-related conditions without causing severe deterioration of the dose distribution

  7. Adjoint optimization of natural convection problems: differentially heated cavity

    Science.gov (United States)

    Saglietti, Clio; Schlatter, Philipp; Monokrousos, Antonios; Henningson, Dan S.

    2017-12-01

    Optimization of natural convection-driven flows may provide significant improvements to the performance of cooling devices, but a theoretical investigation of such flows has been rarely done. The present paper illustrates an efficient gradient-based optimization method for analyzing such systems. We consider numerically the natural convection-driven flow in a differentially heated cavity with three Prandtl numbers (Pr=0.15{-}7) at super-critical conditions. All results and implementations were done with the spectral element code Nek5000. The flow is analyzed using linear direct and adjoint computations about a nonlinear base flow, extracting in particular optimal initial conditions using power iteration and the solution of the full adjoint direct eigenproblem. The cost function for both temperature and velocity is based on the kinetic energy and the concept of entransy, which yields a quadratic functional. Results are presented as a function of Prandtl number, time horizons and weights between kinetic energy and entransy. In particular, it is shown that the maximum transient growth is achieved at time horizons on the order of 5 time units for all cases, whereas for larger time horizons the adjoint mode is recovered as optimal initial condition. For smaller time horizons, the influence of the weights leads either to a concentric temperature distribution or to an initial condition pattern that opposes the mean shear and grows according to the Orr mechanism. For specific cases, it could also been shown that the computation of optimal initial conditions leads to a degenerate problem, with a potential loss of symmetry. In these situations, it turns out that any initial condition lying in a specific span of the eigenfunctions will yield exactly the same transient amplification. As a consequence, the power iteration converges very slowly and fails to extract all possible optimal initial conditions. According to the authors' knowledge, this behavior is illustrated here for

  8. An elitist teaching-learning-based optimization algorithm for solving complex constrained optimization problems

    Directory of Open Access Journals (Sweden)

    Vivek Patel

    2012-08-01

    Full Text Available Nature inspired population based algorithms is a research field which simulates different natural phenomena to solve a wide range of problems. Researchers have proposed several algorithms considering different natural phenomena. Teaching-Learning-based optimization (TLBO is one of the recently proposed population based algorithm which simulates the teaching-learning process of the class room. This algorithm does not require any algorithm-specific control parameters. In this paper, elitism concept is introduced in the TLBO algorithm and its effect on the performance of the algorithm is investigated. The effects of common controlling parameters such as the population size and the number of generations on the performance of the algorithm are also investigated. The proposed algorithm is tested on 35 constrained benchmark functions with different characteristics and the performance of the algorithm is compared with that of other well known optimization algorithms. The proposed algorithm can be applied to various optimization problems of the industrial environment.

  9. Analyze the optimal solutions of optimization problems by means of fractional gradient based system using VIM

    Directory of Open Access Journals (Sweden)

    Firat Evirgen

    2016-04-01

    Full Text Available In this paper, a class of Nonlinear Programming problem is modeled with gradient based system of fractional order differential equations in Caputo's sense. To see the overlap between the equilibrium point of the fractional order dynamic system and theoptimal solution of the NLP problem in a longer timespan the Multistage Variational İteration Method isapplied. The comparisons among the multistage variational iteration method, the variationaliteration method and the fourth order Runge-Kutta method in fractional and integer order showthat fractional order model and techniques can be seen as an effective and reliable tool for finding optimal solutions of Nonlinear Programming problems.

  10. Generalized perturbation theory error control within PWR core-loading pattern optimization

    International Nuclear Information System (INIS)

    Imbriani, J.S.; Turinsky, P.J.; Kropaczek, D.J.

    1995-01-01

    The fuel management optimization code FORMOSA-P has been developed to determine the family of near-optimum loading patterns for PWR reactors. The code couples the optimization technique of simulated annealing (SA) with a generalized perturbation theory (GPT) model for evaluating core physics characteristics. To ensure the accuracy of the GPT predictions, as well as to maximize the efficient of the SA search, a GPT error control method has been developed

  11. On the robust optimization to the uncertain vaccination strategy problem

    International Nuclear Information System (INIS)

    Chaerani, D.; Anggriani, N.; Firdaniza

    2014-01-01

    In order to prevent an epidemic of infectious diseases, the vaccination coverage needs to be minimized and also the basic reproduction number needs to be maintained below 1. This means that as we get the vaccination coverage as minimum as possible, thus we need to prevent the epidemic to a small number of people who already get infected. In this paper, we discuss the case of vaccination strategy in term of minimizing vaccination coverage, when the basic reproduction number is assumed as an uncertain parameter that lies between 0 and 1. We refer to the linear optimization model for vaccination strategy that propose by Becker and Starrzak (see [2]). Assuming that there is parameter uncertainty involved, we can see Tanner et al (see [9]) who propose the optimal solution of the problem using stochastic programming. In this paper we discuss an alternative way of optimizing the uncertain vaccination strategy using Robust Optimization (see [3]). In this approach we assume that the parameter uncertainty lies within an ellipsoidal uncertainty set such that we can claim that the obtained result will be achieved in a polynomial time algorithm (as it is guaranteed by the RO methodology). The robust counterpart model is presented

  12. On the robust optimization to the uncertain vaccination strategy problem

    Energy Technology Data Exchange (ETDEWEB)

    Chaerani, D., E-mail: d.chaerani@unpad.ac.id; Anggriani, N., E-mail: d.chaerani@unpad.ac.id; Firdaniza, E-mail: d.chaerani@unpad.ac.id [Department of Mathematics, Faculty of Mathematics and Natural Sciences, University of Padjadjaran Indonesia, Jalan Raya Bandung Sumedang KM 21 Jatinangor Sumedang 45363 (Indonesia)

    2014-02-21

    In order to prevent an epidemic of infectious diseases, the vaccination coverage needs to be minimized and also the basic reproduction number needs to be maintained below 1. This means that as we get the vaccination coverage as minimum as possible, thus we need to prevent the epidemic to a small number of people who already get infected. In this paper, we discuss the case of vaccination strategy in term of minimizing vaccination coverage, when the basic reproduction number is assumed as an uncertain parameter that lies between 0 and 1. We refer to the linear optimization model for vaccination strategy that propose by Becker and Starrzak (see [2]). Assuming that there is parameter uncertainty involved, we can see Tanner et al (see [9]) who propose the optimal solution of the problem using stochastic programming. In this paper we discuss an alternative way of optimizing the uncertain vaccination strategy using Robust Optimization (see [3]). In this approach we assume that the parameter uncertainty lies within an ellipsoidal uncertainty set such that we can claim that the obtained result will be achieved in a polynomial time algorithm (as it is guaranteed by the RO methodology). The robust counterpart model is presented.

  13. Spectral Analysis of Large Finite Element Problems by Optimization Methods

    Directory of Open Access Journals (Sweden)

    Luca Bergamaschi

    1994-01-01

    Full Text Available Recently an efficient method for the solution of the partial symmetric eigenproblem (DACG, deflated-accelerated conjugate gradient was developed, based on the conjugate gradient (CG minimization of successive Rayleigh quotients over deflated subspaces of decreasing size. In this article four different choices of the coefficient βk required at each DACG iteration for the computation of the new search direction Pk are discussed. The “optimal” choice is the one that yields the same asymptotic convergence rate as the CG scheme applied to the solution of linear systems. Numerical results point out that the optimal βk leads to a very cost effective algorithm in terms of CPU time in all the sample problems presented. Various preconditioners are also analyzed. It is found that DACG using the optimal βk and (LLT−1 as a preconditioner, L being the incomplete Cholesky factor of A, proves a very promising method for the partial eigensolution. It appears to be superior to the Lanczos method in the evaluation of the 40 leftmost eigenpairs of five finite element problems, and particularly for the largest problem, with size equal to 4560, for which the speed gain turns out to fall between 2.5 and 6.0, depending on the eigenpair level.

  14. PID controller tuning using metaheuristic optimization algorithms for benchmark problems

    Science.gov (United States)

    Gholap, Vishal; Naik Dessai, Chaitali; Bagyaveereswaran, V.

    2017-11-01

    This paper contributes to find the optimal PID controller parameters using particle swarm optimization (PSO), Genetic Algorithm (GA) and Simulated Annealing (SA) algorithm. The algorithms were developed through simulation of chemical process and electrical system and the PID controller is tuned. Here, two different fitness functions such as Integral Time Absolute Error and Time domain Specifications were chosen and applied on PSO, GA and SA while tuning the controller. The proposed Algorithms are implemented on two benchmark problems of coupled tank system and DC motor. Finally, comparative study has been done with different algorithms based on best cost, number of iterations and different objective functions. The closed loop process response for each set of tuned parameters is plotted for each system with each fitness function.

  15. Using combinatorial problem decomposition for optimizing plutonium inventory management

    International Nuclear Information System (INIS)

    Niquil, Y.; Gondran, M.; Voskanian, A.; Paris-11 Univ., 91 - Orsay

    1997-03-01

    Plutonium Inventory Management Optimization can be modeled as a very large 0-1 linear program. To solve it, problem decomposition is necessary, since other classic techniques are not efficient for such a size. The first decomposition consists in favoring constraints that are the most difficult to reach and variables that have the highest influence on the cost: fortunately, both correspond to stock output decisions. The second decomposition consists in mixing continuous linear program solving and integer linear program solving. Besides, the first decisions to be taken are systematically favored, for they are based on data considered to be sure, when data supporting later decisions in known with less accuracy and confidence. (author)

  16. Macroscopic relationship in primal-dual portfolio optimization problem

    Science.gov (United States)

    Shinzato, Takashi

    2018-02-01

    In the present paper, using a replica analysis, we examine the portfolio optimization problem handled in previous work and discuss the minimization of investment risk under constraints of budget and expected return for the case that the distribution of the hyperparameters of the mean and variance of the return rate of each asset are not limited to a specific probability family. Findings derived using our proposed method are compared with those in previous work to verify the effectiveness of our proposed method. Further, we derive a Pythagorean theorem of the Sharpe ratio and macroscopic relations of opportunity loss. Using numerical experiments, the effectiveness of our proposed method is demonstrated for a specific situation.

  17. Topology optimization of 3D Stokes flow problems

    DEFF Research Database (Denmark)

    Gersborg-Hansen, Allan; Sigmund, Ole; Bendsøe, Martin P.

    fluid mechanics. In future practice a muTAS could be used by doctors, engineers etc. as a hand held device with short reaction time that provides on-site analysis of a flowing substance such as blood, polluted water or similar. Borrvall and Petersson [2] paved the road for using the topology...... particular at micro scales since they are easily manufacturable and maintenance free. Here we consider topology optimization of 3D Stokes flow problems which is a reasonable fluid model to use at small scales. The presentation elaborates on effects caused by 3D fluid modelling on the design. Numerical...

  18. Approximability of optimization problems through adiabatic quantum computation

    CERN Document Server

    Cruz-Santos, William

    2014-01-01

    The adiabatic quantum computation (AQC) is based on the adiabatic theorem to approximate solutions of the Schrödinger equation. The design of an AQC algorithm involves the construction of a Hamiltonian that describes the behavior of the quantum system. This Hamiltonian is expressed as a linear interpolation of an initial Hamiltonian whose ground state is easy to compute, and a final Hamiltonian whose ground state corresponds to the solution of a given combinatorial optimization problem. The adiabatic theorem asserts that if the time evolution of a quantum system described by a Hamiltonian is l

  19. Empirical Estimates in Economic and Financial Optimization Problems

    Czech Academy of Sciences Publication Activity Database

    Houda, Michal; Kaňková, Vlasta

    2012-01-01

    Roč. 19, č. 29 (2012), s. 50-69 ISSN 1212-074X R&D Projects: GA ČR GAP402/10/1610; GA ČR GAP402/11/0150; GA ČR GAP402/10/0956 Institutional research plan: CEZ:AV0Z10750506 Keywords : stochastic programming * empirical estimates * moment generating functions * stability * Wasserstein metric * L1-norm * Lipschitz property * consistence * convergence rate * normal distribution * Pareto distribution * Weibull distribution * distribution tails * simulation Subject RIV: BB - Applied Statistics, Operational Research http://library.utia.cas.cz/separaty/2012/E/houda-empirical estimates in economic and financial optimization problems.pdf

  20. Solution for state constrained optimal control problems applied to power split control for hybrid vehicles

    NARCIS (Netherlands)

    Keulen, van T.A.C.; Gillot, J.; Jager, de A.G.; Steinbuch, M.

    2014-01-01

    This paper presents a numerical solution for scalar state constrained optimal control problems. The algorithm rewrites the constrained optimal control problem as a sequence of unconstrained optimal control problems which can be solved recursively as a two point boundary value problem. The solution

  1. Optimized core design and fuel management of a pebble-bed type nuclear reactor

    NARCIS (Netherlands)

    Boer, B.

    2009-01-01

    The core design of a pebble-bed type Very High Temperature Reactor (VHTR) is optimized, aiming for an increase of the coolant outlet temperature to 1000 C, while retaining its inherent safety features. The VHTR has been selected by the international Generation IV research initiative as one of the

  2. Optimization of multi-phase compressible lattice Boltzmann codes on massively parallel multi-core systems

    NARCIS (Netherlands)

    Biferale, L.; Mantovani, F.; Pivanti, M.; Pozzati, F.; Sbragaglia, M.; Schifano, S.F.; Toschi, F.; Tripiccione, R.

    2011-01-01

    We develop a Lattice Boltzmann code for computational fluid-dynamics and optimize it for massively parallel systems based on multi-core processors. Our code describes 2D multi-phase compressible flows. We analyze the performance bottlenecks that we find as we gradually expose a larger fraction of

  3. A Monarch Butterfly Optimization for the Dynamic Vehicle Routing Problem

    Directory of Open Access Journals (Sweden)

    Shifeng Chen

    2017-09-01

    Full Text Available The dynamic vehicle routing problem (DVRP is a variant of the Vehicle Routing Problem (VRP in which customers appear dynamically. The objective is to determine a set of routes that minimizes the total travel distance. In this paper, we propose a monarch butterfly optimization (MBO algorithm to solve DVRPs, utilizing a greedy strategy. Both migration operation and the butterfly adjusting operator only accept the offspring of butterfly individuals that have better fitness than their parents. To improve performance, a later perturbation procedure is implemented, to maintain a balance between global diversification and local intensification. The computational results indicate that the proposed technique outperforms the existing approaches in the literature for average performance by at least 9.38%. In addition, 12 new best solutions were found. This shows that this proposed technique consistently produces high-quality solutions and outperforms other published heuristics for the DVRP.

  4. Reactive Robustness and Integrated Approaches for Railway Optimization Problems

    DEFF Research Database (Denmark)

    Haahr, Jørgen Thorlund

    journeys helps the driver to drive efficiently and enhances robustness in a realistic (dynamic) environment. Four international scientific prizes have been awarded for distinct parts of the research during the course of this PhD project. The first prize was awarded for work during the \\2014 RAS Problem...... to absorb or withstand unexpected events such as delays. Making robust plans is central in order to maintain a safe and timely railway operation. This thesis focuses on reactive robustness, i.e., the ability to react once a plan is rendered infeasible in operation due to disruptions. In such time...... Solving Competition", where a freight yard optimization problem was considered. The second junior (PhD) prize was awared for the work performed in the \\ROADEF/EURO Challenge 2014: Trains don't vanish!", where the planning of rolling stock movements at a large station was considered. An honorable mention...

  5. Optimization method for an evolutional type inverse heat conduction problem

    International Nuclear Information System (INIS)

    Deng Zuicha; Yu Jianning; Yang Liu

    2008-01-01

    This paper deals with the determination of a pair (q, u) in the heat conduction equation u t -u xx +q(x,t)u=0, with initial and boundary conditions u(x,0)=u 0 (x), u x vertical bar x=0 =u x vertical bar x=1 =0, from the overspecified data u(x, t) = g(x, t). By the time semi-discrete scheme, the problem is transformed into a sequence of inverse problems in which the unknown coefficients are purely space dependent. Based on the optimal control framework, the existence, uniqueness and stability of the solution (q, u) are proved. A necessary condition which is a couple system of a parabolic equation and parabolic variational inequality is deduced

  6. Optimization method for an evolutional type inverse heat conduction problem

    Science.gov (United States)

    Deng, Zui-Cha; Yu, Jian-Ning; Yang, Liu

    2008-01-01

    This paper deals with the determination of a pair (q, u) in the heat conduction equation u_t-u_{xx}+q(x,t)u=0, with initial and boundary conditions u(x,0)=u_0(x),\\qquad u_x|_{x=0}=u_x|_{x=1}=0, from the overspecified data u(x, t) = g(x, t). By the time semi-discrete scheme, the problem is transformed into a sequence of inverse problems in which the unknown coefficients are purely space dependent. Based on the optimal control framework, the existence, uniqueness and stability of the solution (q, u) are proved. A necessary condition which is a couple system of a parabolic equation and parabolic variational inequality is deduced.

  7. Fast three-dimensional core optimization based on modified one-group model

    Energy Technology Data Exchange (ETDEWEB)

    Freire, Fernando S. [ELETROBRAS Termonuclear S.A. - ELETRONUCLEAR, Rio de Janeiro, RJ (Brazil). Dept. GCN-T], e-mail: freire@eletronuclear.gov.br; Martinez, Aquilino S.; Silva, Fernando C. da [Coordenacao dos Programas de Pos-graduacao de Engenharia (COPPE/UFRJ), Rio de Janeiro, RJ (Brazil). Programa de Engenharia Nuclear], e-mail: aquilino@con.ufrj.br, e-mail: fernando@con.ufrj.br

    2009-07-01

    The optimization of any nuclear reactor core is an extremely complex process that consumes a large amount of computer time. Fortunately, the nuclear designer can rely on a variety of methodologies able to approximate the analysis of each available core loading pattern. Two-dimensional codes are usually used to analyze the loading scheme. However, when particular axial effects are present in the core, two-dimensional analysis cannot produce good results and three-dimensional analysis can be required at all time. Basically, in this paper are presented the major advantages that can be found when one use the modified one-group diffusion theory coupled with a buckling correction model in optimization process. The results of the proposed model are very accurate when compared to benchmark results obtained from detailed calculations using three-dimensional nodal codes (author)

  8. Fast three-dimensional core optimization based on modified one-group model

    International Nuclear Information System (INIS)

    Freire, Fernando S.; Martinez, Aquilino S.; Silva, Fernando C. da

    2009-01-01

    The optimization of any nuclear reactor core is an extremely complex process that consumes a large amount of computer time. Fortunately, the nuclear designer can rely on a variety of methodologies able to approximate the analysis of each available core loading pattern. Two-dimensional codes are usually used to analyze the loading scheme. However, when particular axial effects are present in the core, two-dimensional analysis cannot produce good results and three-dimensional analysis can be required at all time. Basically, in this paper are presented the major advantages that can be found when one use the modified one-group diffusion theory coupled with a buckling correction model in optimization process. The results of the proposed model are very accurate when compared to benchmark results obtained from detailed calculations using three-dimensional nodal codes (author)

  9. Band Generalization of the Golub-Kahan Bidiagonalization, Generalized Jacobi Matrices, and the Core Problem

    Czech Academy of Sciences Publication Activity Database

    Hnětynková, Iveta; Plešinger, M.; Strakoš, Z.

    2015-01-01

    Roč. 36, č. 2 (2015), s. 417-434 ISSN 0895-4798 R&D Projects: GA ČR GA13-06684S Grant - others:GA MŠk(CZ) EE2.3.30.0065; GA MŠk(CZ) LL1202 Keywords : total least squares problem * multiple right-hand sides * core problem * Golub-Kahan bidiagonalization * generalized Jacobi matrices Subject RIV: BA - General Mathematics Impact factor: 1.883, year: 2015

  10. A DE-Based Scatter Search for Global Optimization Problems

    Directory of Open Access Journals (Sweden)

    Kun Li

    2015-01-01

    Full Text Available This paper proposes a hybrid scatter search (SS algorithm for continuous global optimization problems by incorporating the evolution mechanism of differential evolution (DE into the reference set updated procedure of SS to act as the new solution generation method. This hybrid algorithm is called a DE-based SS (SSDE algorithm. Since different kinds of mutation operators of DE have been proposed in the literature and they have shown different search abilities for different kinds of problems, four traditional mutation operators are adopted in the hybrid SSDE algorithm. To adaptively select the mutation operator that is most appropriate to the current problem, an adaptive mechanism for the candidate mutation operators is developed. In addition, to enhance the exploration ability of SSDE, a reinitialization method is adopted to create a new population and subsequently construct a new reference set whenever the search process of SSDE is trapped in local optimum. Computational experiments on benchmark problems show that the proposed SSDE is competitive or superior to some state-of-the-art algorithms in the literature.

  11. Enhanced ant colony optimization for inventory routing problem

    Science.gov (United States)

    Wong, Lily; Moin, Noor Hasnah

    2015-10-01

    The inventory routing problem (IRP) integrates and coordinates two important components of supply chain management which are transportation and inventory management. We consider a one-to-many IRP network for a finite planning horizon. The demand for each product is deterministic and time varying as well as a fleet of capacitated homogeneous vehicles, housed at a depot/warehouse, delivers the products from the warehouse to meet the demand specified by the customers in each period. The inventory holding cost is product specific and is incurred at the customer sites. The objective is to determine the amount of inventory and to construct a delivery routing that minimizes both the total transportation and inventory holding cost while ensuring each customer's demand is met over the planning horizon. The problem is formulated as a mixed integer programming problem and is solved using CPLEX 12.4 to get the lower and upper bound (best integer) for each instance considered. We propose an enhanced ant colony optimization (ACO) to solve the problem and the built route is improved by using local search. The computational experiments demonstrating the effectiveness of our approach is presented.

  12. A New Optimization Framework To Solve The Optimal Feeder Reconfiguration And Capacitor Placement Problems

    Directory of Open Access Journals (Sweden)

    Mohammad-Reza Askari

    2015-07-01

    Full Text Available Abstract This paper introduces a new stochastic optimization framework based bat algorithm BA to solve the optimal distribution feeder reconfiguration DFR as well as the shunt capacitor placement and sizing in the distribution systems. The objective functions to be investigated are minimization of the active power losses and minimization of the total network costs an. In order to consider the uncertainties of the active and reactive loads in the problem point estimate method PEM with 2m scheme is employed as the stochastic tool. The feasibility and good performance of the proposed method are examined on the IEEE 69-bus test system.

  13. Modified Monkey Optimization Algorithm for Solving Optimal Reactive Power Dispatch Problem

    Directory of Open Access Journals (Sweden)

    Kanagasabai Lenin

    2015-04-01

    Full Text Available In this paper, a novel approach Modified Monkey optimization (MMO algorithm for solving optimal reactive power dispatch problem has been presented. MMO is a population based stochastic meta-heuristic algorithm and it is inspired by intelligent foraging behaviour of monkeys. This paper improves both local leader and global leader phases.  The proposed (MMO algorithm has been tested in standard IEEE 30 bus test system and simulation results show the worthy performance of the proposed algorithm in reducing the real power loss.

  14. Optimization of the injection molding process for development of high performance calcium oxide -based ceramic cores

    Science.gov (United States)

    Zhou, P. P.; Wu, G. Q.; Tao, Y.; Cheng, X.; Zhao, J. Q.; Nan, H.

    2018-02-01

    The binder composition used for ceramic injection molding plays a crucial role on the final properties of sintered ceramic and to avoid defects on green parts. In this study, the effects of binder compositions on the rheological, microstructures and the mechanical properties of CaO based ceramic cores were investigated. It was found that the optimized formulation for dispersant, solid loading was 1.5 wt% and 84 wt%, respectively. The microstructures, such as porosity, pore size distribution and grain boundary density were closely related to the plasticizer contents. The decrease of plasticizer contents can enhance the strength of the ceramic cores but with decreased shrinkage. Meanwhile, the creep resistance of ceramic cores was enhanced by decreasing of plasticizer contents. The flexural strength of the core was found to decrease with the increase of the porosity, the improvement of creep resistance is closely related to the decrease of porosity and grain boundary density.

  15. Measuring the Core Components of Maladaptive Personality: Severity Indices of Personality Problems (SIPP-118)

    NARCIS (Netherlands)

    H. Andrea (Helene); R. Verheul (Roel); C.C. Berghout (Casper); C. Dolan (Conor); P.J.A. van der Kroft (Petra); A.W. Bateman (Anthony); P. Fonagy (Peter); J.J. van Busschbach (Jan)

    2007-01-01

    textabstractThis report describes a series of studies among 2231 subjects on the development of the Severity Indices for Personality Problems (SIPP), a self-report questionnaire measuring the core components of (mal)adaptive personality functioning. Results show that the 16 facets have good

  16. Evaluation of the need for stochastic optimization of out-of-core nuclear fuel management decisions

    International Nuclear Information System (INIS)

    Thomas, R.L. Jr.

    1989-01-01

    Work has been completed on utilizing mathematical optimization techniques to optimize out-of-core nuclear fuel management decisions. The objective of such optimization is to minimize the levelized fuel cycle cost over some planning horizon. Typical decision variables include feed enrichments and number of assemblies, burnable poison requirements, and burned fuel to reinsert for every cycle in the planning horizon. Engineering constraints imposed consist of such items as discharge burnup limits, maximum enrichment limit, and target cycle energy productions. Earlier the authors reported on the development of the OCEON code, which employs the integer Monte Carlo Programming method as the mathematical optimization method. The discharge burnpups, and feed enrichment and burnable poison requirements are evaluated, initially employing a linear reactivity core physics model and refined using a coarse mesh nodal model. The economic evaluation is completed using a modification of the CINCAS methodology. Interest now is to assess the need for stochastic optimization, which will account for cost components and cycle energy production uncertainties. The implication of the present studies is that stochastic optimization in regard to cost component uncertainties need not be completed since deterministic optimization will identify nearly the same family of near-optimum cycling schemes

  17. Simultaneous Optimization of Tallies in Difficult Shielding Problems

    International Nuclear Information System (INIS)

    Peplow, Douglas E.; Evans, Thomas M.; Wagner, John C.

    2008-01-01

    Monte Carlo is quite useful for calculating specific quantities in complex transport problems. Many variance reduction strategies have been developed that accelerate Monte Carlo calculations for specific tallies. However, when trying to calculate multiple tallies or a mesh tally, users have had to accept different levels of relative uncertainty among the tallies or run separate calculations optimized for each individual tally. To address this limitation, an extension of the CADIS (Consistent Adjoint Driven Importance Sampling) method, which is used for difficult source/detector problems, has been developed to optimize several tallies or the cells of a mesh tally simultaneously. The basis for this method is the development of an importance function that represents the importance of particles to the objective of uniform Monte Carlo particle density in the desired tally regions. This method utilizes the results of a forward discrete ordinates solution, which may be based on a quick, coarse-mesh calculation, to develop a forward-weighted source for the adjoint calculation. The importance map and the biased source computed from the adjoint flux are then used in the forward Monte Carlo calculation to obtain approximately uniform relative uncertainties for the desired tallies. This extension is called forward-weighted CADIS, or FW-CADIS

  18. The effects of core zoning on optimization of design analysis of molten salt reactor

    International Nuclear Information System (INIS)

    Guo, Zhangpeng; Wang, Chenglong; Zhang, Dalin; Chaudri, Khurrum Saleem; Tian, Wenxi; Su, Guanghui; Qiu, Suizheng

    2013-01-01

    Highlights: • 1/8 of core is simulated by MCNP and thermal-hydraulic code simultaneously. • Effects of core zoning are studied by dividing the core into two regions. • Both the neutronics and thermal-hydraulic behavior are investigated. • The flat flux distribution is achieved in the optimization analysis. • The flat flux can lead to worse thermal-hydraulic behavior occasionally. - Abstract: The molten salt reactor (MSR) is one of six advanced reactor types in the frame of the Generation 4 International Forum. In this study, a multiple-channel analysis code (MAC) is developed to analyze thermal-hydraulics behavior and MCNP4c is used to study the neutronics behavior of Molten Salt Reactor Experiment (MSRE). The MAC calculates thermal-hydraulic parameters, namely temperature distribution, flow distribution and pressure drop. The MCNP4c performs the analysis of effective multiplication factor, neutron flux, power distribution and conversion ratio. In this work, the modification of core configuration is achieved by different core zoning and various fuel channel diameters, contributing to flat flux distribution. Specifically, the core is divided into two regions and the effects of different core zoning on the both neutronics and thermal-hydraulic behavior of moderated molten salt reactor are investigated. We conclude that the flat flux distribution cannot always guarantee better performance in thermal-hydraulic perspective and can decreases the graphite lifetime significantly

  19. Application of metaheuristics to Loading Pattern Optimization problems based on the IAEA-3D and BIBLIS-2D data

    International Nuclear Information System (INIS)

    Meneses, Anderson Alvarenga de Moura; Araujo, Lenilson Moreira; Nast, Fernando Nogueira; Da Silva, Patrick Vasconcelos; Schirru, Roberto

    2018-01-01

    Highlights: •Metaheuristics were applied to Loading Pattern Optimization problems and compared. •The problems are based on data of the benchmarks IAEA and BIBLIS. •The metaheuristics compared were PSO, Cross-Entropy, PBIL and Artificial Bee Colony. •Angra 1 NPP data were also used for further comparison of the algorithms. -- Abstract: The Loading Pattern Optimization (LPO) of a Nuclear Power Plant (NPP), or in-core fuel management optimization, is a real-world and prominent problem in Nuclear Engineering with the goal of finding an optimal (or near-optimal) Loading Pattern (LP), in terms of energy production, within adequate safety margins. Most of the reactor models used in the LPO problem are particular cases, such as research or power reactors with technical data that cannot be made available for several reasons, which makes the reproducibility of tests unattainable. In the present article we report the results of LPO of problems based upon reactor physics benchmarks. Since such data are well-known and widely available in the literature, it is possible to reproduce tests for comparison of techniques. We performed the LPO with the data of the benchmarks IAEA-3D and BIBLIS-2D. The Reactor Physics code RECNOD, which was used in previous works for the optimization of Angra 1 NPP in Brazil, was also used for further comparison. Four Optimization Metaheuristics (OMHs) were applied to those problems: Particle Swarm Optimization (PSO), Cross-Entropy algorithm (CE), Artificial Bee Colony (ABC) and Population-Based Incremental Learning (PBIL). For IAEA-3D, the best algorithm was the ABC. For BIBLIS-2D, PBIL was the best OMH. For Angra 1 / RECNOD optimization problem, PBIL, ABC and CE were the best OMHs.

  20. In core fuel management optimization by varying the equilibrium cycle average flux shape for batch refuelled reactors

    International Nuclear Information System (INIS)

    Jong, A.J. de.

    1992-12-01

    We suggest a method to overcome this problem of optimization by varying reloading patterns by characterizing each particular reloading pattern by a set of intermediate parameters that are numbers. Plots of the objective function versus the intermediate parameters can be made. When the intermediate parameters represent the reloading patterns in a unique way, the optimum of the objective function can be found by interpolation within such plots and we can find the optimal reloading pattern in terms of intermediate parameters. These have to be transformed backwards to find an optimal reloading pattern. The intermediate parameters are closely related to the time averaged neutron flux shape in the core during an equilibrium cycle. This flux shape is characterized by a set of ratios of the space averaged fluxes in the fuel zones and the space averaged flux in the zone with the fresh fuel elements. An advantage of this choice of intermediate parameters is that it permits analytical calculation of equilibrium cycle fuel densities in the fuel zones for any applied reloading patten characterized by a set of equilibrium cycle average flux ratios and thus, provides analytical calculations of fuel management objective functions. The method is checked for the burnup of one fissile nuclide in a reactor core with the geometry of the PWR at Borssele. For simplicity, neither the conversion of fuel, nor the buildup of fission products were taken into account in this study. Since these phenomena can also be described by the equilibrium cycle average flux ratios, it is likely that this method can be extended to a more realistic method for global in core fuel management optimization. (orig./GL)

  1. Necessary optimality conditions of the second oder in a stochastic optimal control problem with delay argument

    Directory of Open Access Journals (Sweden)

    Rashad O. Mastaliev

    2016-12-01

    Full Text Available The optimal control problem of nonlinear stochastic systems which mathematical model is given by Ito stochastic differential equation with delay argument is considered. Assuming that the concerned region is open for the control by the first and the second variation (classical sense of the quality functional we obtain the necessary optimality condition of the first and the second order. In the particular case we receive the stochastic analog of the Legendre—Clebsch condition and some constructively verified conclusions from the second order necessary condition. We investigate the Legendre–Clebsch conditions for the degeneration case and obtain the necessary conditions of optimality for a special control, in the classical sense.

  2. Dynamic-Programming Approaches to Single- and Multi-Stage Stochastic Knapsack Problems for Portfolio Optimization

    National Research Council Canada - National Science Library

    Khoo, Wai

    1999-01-01

    .... These problems model stochastic portfolio optimization problems (SPOPs) which assume deterministic unit weight, and normally distributed unit return with known mean and variance for each item type...

  3. On the problem of in-core fuel management in power reactors

    International Nuclear Information System (INIS)

    Marinkovic, N.; Matausek, M.V.

    1985-01-01

    Within the scope of in-core fuel management including refuelling schedule and reactivity control it is indispensable to define nuclear fuel worth, optimal depletion of the spent fuel assemblies as well as isotopic composition of the spent fuel. This paper shows the computed values of the mentioned parameters in case of different reactor types, PWR, WWER, HWR and BWR of 1000 MWe as well as the intensity of radiation of the spent fuel 3 and 1 years after fission.(author)

  4. Comparison of computational performance of GA and PSO optimization techniques when designing similar systems - Typical PWR core case

    Energy Technology Data Exchange (ETDEWEB)

    Souza Lima, Carlos A. [Instituto de Engenharia Nuclear - Divisao de Reatores/PPGIEN, Rua Helio de Almeida 75, Cidade Universitaria - Ilha do Fundao, P.O. Box: 68550 - Zip Code: 21941-972, Rio de Janeiro (Brazil); Instituto Politecnico, Universidade do Estado do Rio de Janeiro, Pos-Graduacao em Modelagem Computacional, Rua Alberto Rangel - s/n, Vila Nova, Nova Friburgo, Zip Code: 28630-050, Nova Friburgo (Brazil); Lapa, Celso Marcelo F.; Pereira, Claudio Marcio do N.A. [Instituto de Engenharia Nuclear - Divisao de Reatores/PPGIEN, Rua Helio de Almeida 75, Cidade Universitaria - Ilha do Fundao, P.O. Box: 68550 - Zip Code: 21941-972, Rio de Janeiro (Brazil); Instituto Nacional de Ciencia e Tecnologia de Reatores Nucleares Inovadores (INCT) (Brazil); Cunha, Joao J. da [Eletronuclear Eletrobras Termonuclear - Gerencia de Analise de Seguranca Nuclear, Rua da Candelaria, 65, 7 andar. Centro, Zip Code: 20091-906, Rio de Janeiro (Brazil); Alvim, Antonio Carlos M. [Universidade Federal do Rio de Janeiro, COPPE/Nuclear, Cidade Universitaria - Ilha do Fundao s/n, P.O.Box 68509 - Zip Code: 21945-970, Rio de Janeiro (Brazil); Instituto Nacional de Ciencia e Tecnologia de Reatores Nucleares Inovadores (INCT) (Brazil)

    2011-06-15

    Research highlights: > Performance of PSO and GA techniques applied to similar system design. > This work uses ANGRA1 (two loop PWR) core as a prototype. > Results indicate that PSO technique is more adequate than GA to solve this kind of problem. - Abstract: This paper compares the performance of two optimization techniques, particle swarm optimization (PSO) and genetic algorithm (GA) applied to the design a typical reduced scale two loop Pressurized Water Reactor (PWR) core, at full power in single phase forced circulation flow. This comparison aims at analyzing the performance in reaching the global optimum, considering that both heuristics are based on population search methods, that is, methods whose population (candidate solution set) evolve from one generation to the next using a combination of deterministic and probabilistic rules. The simulated PWR, similar to ANGRA 1 power plant, was used as a case example to compare the performance of PSO and GA. Results from simulations indicated that PSO is more adequate to solve this kind of problem.

  5. Comparison of computational performance of GA and PSO optimization techniques when designing similar systems - Typical PWR core case

    International Nuclear Information System (INIS)

    Souza Lima, Carlos A.; Lapa, Celso Marcelo F.; Pereira, Claudio Marcio do N.A.; Cunha, Joao J. da; Alvim, Antonio Carlos M.

    2011-01-01

    Research highlights: → Performance of PSO and GA techniques applied to similar system design. → This work uses ANGRA1 (two loop PWR) core as a prototype. → Results indicate that PSO technique is more adequate than GA to solve this kind of problem. - Abstract: This paper compares the performance of two optimization techniques, particle swarm optimization (PSO) and genetic algorithm (GA) applied to the design a typical reduced scale two loop Pressurized Water Reactor (PWR) core, at full power in single phase forced circulation flow. This comparison aims at analyzing the performance in reaching the global optimum, considering that both heuristics are based on population search methods, that is, methods whose population (candidate solution set) evolve from one generation to the next using a combination of deterministic and probabilistic rules. The simulated PWR, similar to ANGRA 1 power plant, was used as a case example to compare the performance of PSO and GA. Results from simulations indicated that PSO is more adequate to solve this kind of problem.

  6. Optimization and photomodification of extremely broadband optical response of plasmonic core-shell obscurants.

    Science.gov (United States)

    de Silva, Vashista C; Nyga, Piotr; Drachev, Vladimir P

    2016-12-15

    Plasmonic resonances of the metallic shells depend on their nanostructure and geometry of the core, which can be optimized for the broadband extinction normalized by mass. The fractal nanostructures can provide a broadband extinction. It allows as well for a laser photoburning of holes in the extinction spectra and consequently windows of transparency in a controlled manner. The studied core-shell microparticles synthesized using colloidal chemistry consist of gold fractal nanostructures grown on precipitated calcium carbonate (PCC) microparticles or silica (SiO 2 ) microspheres. The optimization includes different core sizes and shapes, and shell nanostructures. It shows that the rich surface of the PCC flakes is the best core for the fractal shells providing the highest mass normalized extinction over the extremely broad spectral range. The mass normalized extinction cross section up to 3m 2 /g has been demonstrated in the broad spectral range from the visible to mid-infrared. Essentially, the broadband response is a characteristic feature of each core-shell microparticle in contrast to a combination of several structures resonant at different wavelengths, for example nanorods with different aspect ratios. The photomodification at an IR wavelength makes the window of transparency at the longer wavelength side. Copyright © 2016 Elsevier Inc. All rights reserved.

  7. Optimization of core reload design for low leakage fuel management in pressurized water reactors

    International Nuclear Information System (INIS)

    Kim, Y.J.

    1986-01-01

    A new method was developed to optimize pressurized water reactor core reload design for low leakage fuel management, a strategy recently adopted by most utilities to extend cycle length and mitigate pressurized thermal shock concerns. The method consists of a two-stage optimization process which provides the maximum cycle length for a given fresh fuel loading subject to power peaking constraints. In the first stage, a best fuel arrangement is determined at the end of cycle in the absence of burnable poisons. A direct search method is employed in conjunction with a constant power, Haling depletion. In the second stage, the core control poison requirements are determined using a linear programming technique. The solution provides the fresh fuel burnable poison loading required to meet core power peaking constraints. An accurate method of explicitly modeling burnable absorbers was developed for this purpose. The design method developed here was implemented in a currently recognized fuel licensing code, SIMULATE, that was adapted to the CYBER-205 computer. This methodology was applied to core reload design of cycles 9 and 10 for the Commonwealth Edison Zion, Unit-1 Reactor. The results showed that the optimum loading pattern for cycle 9 yielded almost a 9% increase in the cycle length while reducing core vessel fluence by 30% compared with the reference design used by Commonwealth Edison

  8. A Framework for Constrained Optimization Problems Based on a Modified Particle Swarm Optimization

    Directory of Open Access Journals (Sweden)

    Biwei Tang

    2016-01-01

    Full Text Available This paper develops a particle swarm optimization (PSO based framework for constrained optimization problems (COPs. Aiming at enhancing the performance of PSO, a modified PSO algorithm, named SASPSO 2011, is proposed by adding a newly developed self-adaptive strategy to the standard particle swarm optimization 2011 (SPSO 2011 algorithm. Since the convergence of PSO is of great importance and significantly influences the performance of PSO, this paper first theoretically investigates the convergence of SASPSO 2011. Then, a parameter selection principle guaranteeing the convergence of SASPSO 2011 is provided. Subsequently, a SASPSO 2011-based framework is established to solve COPs. Attempting to increase the diversity of solutions and decrease optimization difficulties, the adaptive relaxation method, which is combined with the feasibility-based rule, is applied to handle constraints of COPs and evaluate candidate solutions in the developed framework. Finally, the proposed method is verified through 4 benchmark test functions and 2 real-world engineering problems against six PSO variants and some well-known methods proposed in the literature. Simulation results confirm that the proposed method is highly competitive in terms of the solution quality and can be considered as a vital alternative to solve COPs.

  9. PARETO OPTIMAL SOLUTIONS FOR MULTI-OBJECTIVE GENERALIZED ASSIGNMENT PROBLEM

    Directory of Open Access Journals (Sweden)

    S. Prakash

    2012-01-01

    Full Text Available

    ENGLISH ABSTRACT: The Multi-Objective Generalized Assignment Problem (MGAP with two objectives, where one objective is linear and the other one is non-linear, has been considered, with the constraints that a job is assigned to only one worker – though he may be assigned more than one job, depending upon the time available to him. An algorithm is proposed to find the set of Pareto optimal solutions of the problem, determining assignments of jobs to workers with two objectives without setting priorities for them. The two objectives are to minimise the total cost of the assignment and to reduce the time taken to complete all the jobs.

    AFRIKAANSE OPSOMMING: ‘n Multi-doelwit veralgemeende toekenningsprobleem (“multi-objective generalised assignment problem – MGAP” met twee doelwitte, waar die een lineêr en die ander nielineêr is nie, word bestudeer, met die randvoorwaarde dat ‘n taak slegs toegedeel word aan een werker – alhoewel meer as een taak aan hom toegedeel kan word sou die tyd beskikbaar wees. ‘n Algoritme word voorgestel om die stel Pareto-optimale oplossings te vind wat die taaktoedelings aan werkers onderhewig aan die twee doelwitte doen sonder dat prioriteite toegeken word. Die twee doelwitte is om die totale koste van die opdrag te minimiseer en om die tyd te verminder om al die take te voltooi.

  10. Problems of future energy market planning and optimization

    International Nuclear Information System (INIS)

    Vladimir Lelek; David Jaluvka

    2007-01-01

    Problems of future energy supply in the form, which is demanded - heat, liquid fuel, electricity - are described. There are several factors, which probably could be studied separately: technology and its sustain ability with respect to the raw materials resources, long time for capacity construction, for some form of energy even absence of sufficiently deep technology knowledge and model of prices. Prices are specially peculiar problem - they could be very different from the standard approach (investment, operation and maintenance, fuel, profit), if there are market instabilities and you are not able to supply market by the demanded amount form of energy with the consequences on production. Expected effect will be jump in prices or regulated supply to equalize supply and use. Such situation will be until the new capacities are put into operation or new technologies of production are established - it could be time about ten or more years and this can completely change our standard consideration of profit. The main profit will be to avoid losses and unemployment. Also concept of local or domestic raw material resources could be changed - in the free market your resources will be sold to those paying more. Probable development of energy market is described in the article and special attention is devoted to the nuclear energy, which not only consume, but also produce raw material and how to proceed to avoid crises in supply. Contemporary understanding of the problem does not enable to formulate it strictly as mathematical optimization task (Authors)

  11. Automated bond order assignment as an optimization problem.

    Science.gov (United States)

    Dehof, Anna Katharina; Rurainski, Alexander; Bui, Quang Bao Anh; Böcker, Sebastian; Lenhof, Hans-Peter; Hildebrandt, Andreas

    2011-03-01

    Numerous applications in Computational Biology process molecular structures and hence strongly rely not only on correct atomic coordinates but also on correct bond order information. For proteins and nucleic acids, bond orders can be easily deduced but this does not hold for other types of molecules like ligands. For ligands, bond order information is not always provided in molecular databases and thus a variety of approaches tackling this problem have been developed. In this work, we extend an ansatz proposed by Wang et al. that assigns connectivity-based penalty scores and tries to heuristically approximate its optimum. In this work, we present three efficient and exact solvers for the problem replacing the heuristic approximation scheme of the original approach: an A*, an ILP and an fixed-parameter approach (FPT) approach. We implemented and evaluated the original implementation, our A*, ILP and FPT formulation on the MMFF94 validation suite and the KEGG Drug database. We show the benefit of computing exact solutions of the penalty minimization problem and the additional gain when computing all optimal (or even suboptimal) solutions. We close with a detailed comparison of our methods. The A* and ILP solution are integrated into the open-source C++ LGPL library BALL and the molecular visualization and modelling tool BALLView and can be downloaded from our homepage www.ball-project.org. The FPT implementation can be downloaded from http://bio.informatik.uni-jena.de/software/.

  12. Feed Forward Neural Network and Optimal Control Problem with Control and State Constraints

    Science.gov (United States)

    Kmet', Tibor; Kmet'ová, Mária

    2009-09-01

    A feed forward neural network based optimal control synthesis is presented for solving optimal control problems with control and state constraints. The paper extends adaptive critic neural network architecture proposed by [5] to the optimal control problems with control and state constraints. The optimal control problem is transcribed into a nonlinear programming problem which is implemented with adaptive critic neural network. The proposed simulation method is illustrated by the optimal control problem of nitrogen transformation cycle model. Results show that adaptive critic based systematic approach holds promise for obtaining the optimal control with control and state constraints.

  13. Transient analyses for a molten salt fast reactor with optimized core geometry

    Energy Technology Data Exchange (ETDEWEB)

    Li, R., E-mail: rui.li@kit.edu [Institute for Nuclear and Energy Technologies (IKET), Karlsruhe Institute of Technology (KIT), Hermann-von-Helmholtz-Platz 1, D-76344 Eggenstein-Leopoldshafen (Germany); Wang, S.; Rineiski, A.; Zhang, D. [Institute for Nuclear and Energy Technologies (IKET), Karlsruhe Institute of Technology (KIT), Hermann-von-Helmholtz-Platz 1, D-76344 Eggenstein-Leopoldshafen (Germany); Merle-Lucotte, E. [Laboratoire de Physique Subatomique et de Cosmologie – IN2P3 – CNRS/Grenoble INP/UJF, 53, rue des Martyrs, 38026 Grenoble (France)

    2015-10-15

    Highlights: • MSFR core is analyzed by fully coupling neutronics and thermal-hydraulics codes. • We investigated four types of transients intensively with the optimized core geometry. • It demonstrates MSFR has a high safety potential. - Abstract: Molten salt reactors (MSRs) have encountered a marked resurgence of interest over the past decades, highlighted by their inclusion as one of the six candidate reactors of the Generation IV advanced nuclear power systems. The present work is carried out in the framework of the European FP-7 project EVOL (Evaluation and Viability Of Liquid fuel fast reactor system). One of the project tasks is to report on safety analyses: calculations of reactor transients using various numerical codes for the molten salt fast reactor (MSFR) under different boundary conditions, assumptions, and for different selected scenarios. Based on the original reference core geometry, an optimized geometry was proposed by Rouch et al. (2014. Ann. Nucl. Energy 64, 449) on thermal-hydraulic design aspects to avoid a recirculation zone near the blanket which accumulates heat and very high temperature exceeding the salt boiling point. Using both fully neutronics thermal-hydraulic coupled codes (SIMMER and COUPLE), we also re-confirm the efforts step by step toward a core geometry without the recirculation zone in particular as concerns the modifications of the core geometrical shape. Different transients namely Unprotected Loss of Heat Sink (ULOHS), Unprotected Loss of Flow (ULOF), Unprotected Transient Over Power (UTOP), Fuel Salt Over Cooling (FSOC) are intensively investigated and discussed with the optimized core geometry. It is demonstrated that due to inherent negative feedbacks, an MSFR plant has a high safety potential.

  14. Two-dimensional core calculation research for fuel management optimization based on CPACT code

    International Nuclear Information System (INIS)

    Chen Xiaosong; Peng Lianghui; Gang Zhi

    2013-01-01

    Fuel management optimization process requires rapid assessment for the core layout program, and the commonly used methods include two-dimensional diffusion nodal method, perturbation method, neural network method and etc. A two-dimensional loading patterns evaluation code was developed based on the three-dimensional LWR diffusion calculation program CPACT. Axial buckling introduced to simulate the axial leakage was searched in sub-burnup sections to correct the two-dimensional core diffusion calculation results. Meanwhile, in order to get better accuracy, the weight equivalent volume method of the control rod assembly cross-section was improved. (authors)

  15. Optimization of High-Resolution Continuous Flow Analysis for Transient Climate Signals in Ice Cores

    DEFF Research Database (Denmark)

    Bigler, Matthias; Svensson, Anders; Kettner, Ernesto

    2011-01-01

    Over the past two decades, continuous flow analysis (CFA) systems have been refined and widely used to measure aerosol constituents in polar and alpine ice cores in very high-depth resolution. Here we present a newly designed system consisting of sodium, ammonium, dust particles, and electrolytic...... meltwater conductivity detection modules. The system is optimized for high- resolution determination of transient signals in thin layers of deep polar ice cores. Based on standard measurements and by comparing sections of early Holocene and glacial ice from Greenland, we find that the new system features...

  16. Electrical Discharge Platinum Machining Optimization Using Stefan Problem Solutions

    Directory of Open Access Journals (Sweden)

    I. B. Stavitskiy

    2015-01-01

    Full Text Available The article presents the theoretical study results of platinum workability by electrical discharge machining (EDM, based on the solution of the thermal problem of moving the boundary of material change phase, i.e. Stefan problem. The problem solution enables defining the surface melt penetration of the material under the heat flow proceeding from the time of its action and the physical properties of the processed material. To determine the rational EDM operating conditions of platinum the article suggests relating its workability with machinability of materials, for which the rational EDM operating conditions are, currently, defined. It is shown that at low densities of the heat flow corresponding to the finishing EDM operating conditions, the processing conditions used for steel 45 are appropriate for platinum machining; with EDM at higher heat flow densities (e.g. 50 GW / m2 for this purpose copper processing conditions are used; at the high heat flow densities corresponding to heavy roughing EDM it is reasonable to use tungsten processing conditions. The article also represents how the minimum width of the current pulses, at which platinum starts melting and, accordingly, the EDM process becomes possible, depends on the heat flow density. It is shown that the processing of platinum is expedient at a pulse width corresponding to the values, called the effective pulse width. Exceeding these values does not lead to a substantial increase in removal of material per pulse, but considerably reduces the maximum repetition rate and therefore, the EDM capacity. The paper shows the effective pulse width versus the heat flow density. It also presents the dependences of the maximum platinum surface melt penetration and the corresponding pulse width on the heat flow density. Results obtained using solutions of the Stephen heat problem can be used to optimize EDM operating conditions of platinum machining.

  17. The Geriatric ICF Core Set reflecting health-related problems in community-living older adults aged 75 years and older without dementia: development and validation.

    Science.gov (United States)

    Spoorenberg, Sophie L W; Reijneveld, Sijmen A; Middel, Berrie; Uittenbroek, Ronald J; Kremer, Hubertus P H; Wynia, Klaske

    2015-01-01

    The aim of the present study was to develop a valid Geriatric ICF Core Set reflecting relevant health-related problems of community-living older adults without dementia. A Delphi study was performed in order to reach consensus (≥70% agreement) on second-level categories from the International Classification of Functioning, Disability and Health (ICF). The Delphi panel comprised 41 older adults, medical and non-medical experts. Content validity of the set was tested in a cross-sectional study including 267 older adults identified as frail or having complex care needs. Consensus was reached for 30 ICF categories in the Delphi study (fourteen Body functions, ten Activities and Participation and six Environmental Factors categories). Content validity of the set was high: the prevalence of all the problems was >10%, except for d530 Toileting. The most frequently reported problems were b710 Mobility of joint functions (70%), b152 Emotional functions (65%) and b455 Exercise tolerance functions (62%). No categories had missing values. The final Geriatric ICF Core Set is a comprehensive and valid set of 29 ICF categories, reflecting the most relevant health-related problems among community-living older adults without dementia. This Core Set may contribute to optimal care provision and support of the older population. Implications for Rehabilitation The Geriatric ICF Core Set may provide a practical tool for gaining an understanding of the relevant health-related problems of community-living older adults without dementia. The Geriatric ICF Core Set may be used in primary care practice as an assessment tool in order to tailor care and support to the needs of older adults. The Geriatric ICF Core Set may be suitable for use in multidisciplinary teams in integrated care settings, since it is based on a broad range of problems in functioning. Professionals should pay special attention to health problems related to mobility and emotional functioning since these are the most

  18. Wolf Search Algorithm for Solving Optimal Reactive Power Dispatch Problem

    Directory of Open Access Journals (Sweden)

    Kanagasabai Lenin

    2015-03-01

    Full Text Available This paper presents a new bio-inspired heuristic optimization algorithm called the Wolf Search Algorithm (WSA for solving the multi-objective reactive power dispatch problem. Wolf Search algorithm is a new bio – inspired heuristic algorithm which based on wolf preying behaviour. The way wolves search for food and survive by avoiding their enemies has been imitated to formulate the algorithm for solving the reactive power dispatches. And the speciality  of wolf is  possessing  both individual local searching ability and autonomous flocking movement and this special property has been utilized to formulate the search algorithm .The proposed (WSA algorithm has been tested on standard IEEE 30 bus test system and simulation results shows clearly about the good performance of the proposed algorithm .

  19. Using combinatorial problem decomposition for optimizing plutonium inventory management

    Energy Technology Data Exchange (ETDEWEB)

    Niquil, Y.; Gondran, M. [Electricite de France (EDF), 92 - Clamart (France). Direction des Etudes et Recherches; Voskanian, A. [Electricite de France (EDF), 92 - Clamart (France). Direction des Etudes et Recherches]|[Paris-11 Univ., 91 - Orsay (France). Lab. de Recherche en Informatique

    1997-03-01

    Plutonium Inventory Management Optimization can be modeled as a very large 0-1 linear program. To solve it, problem decomposition is necessary, since other classic techniques are not efficient for such a size. The first decomposition consists in favoring constraints that are the most difficult to reach and variables that have the highest influence on the cost: fortunately, both correspond to stock output decisions. The second decomposition consists in mixing continuous linear program solving and integer linear program solving. Besides, the first decisions to be taken are systematically favored, for they are based on data considered to be sure, when data supporting later decisions in known with less accuracy and confidence. (author) 7 refs.

  20. Fractional and multivariable calculus model building and optimization problems

    CERN Document Server

    Mathai, A M

    2017-01-01

    This textbook presents a rigorous approach to multivariable calculus in the context of model building and optimization problems. This comprehensive overview is based on lectures given at five SERC Schools from 2008 to 2012 and covers a broad range of topics that will enable readers to understand and create deterministic and nondeterministic models. Researchers, advanced undergraduate, and graduate students in mathematics, statistics, physics, engineering, and biological sciences will find this book to be a valuable resource for finding appropriate models to describe real-life situations. The first chapter begins with an introduction to fractional calculus moving on to discuss fractional integrals, fractional derivatives, fractional differential equations and their solutions. Multivariable calculus is covered in the second chapter and introduces the fundamentals of multivariable calculus (multivariable functions, limits and continuity, differentiability, directional derivatives and expansions of multivariable ...

  1. Optimal consumption—portfolio problem with CVaR constraints

    International Nuclear Information System (INIS)

    Zhang, Qingye; Gao, Yan

    2016-01-01

    The optimal portfolio selection is a fundamental issue in finance, and its two most important ingredients are risk and return. Merton's pioneering work in dynamic portfolio selection emphasized only the expected utility of the consumption and the terminal wealth. To make the optimal portfolio strategy be achievable, risk control over bankruptcy during the investment horizon is an indispensable ingredient. So, in this paper, we consider the consumption-portfolio problem coupled with a dynamic risk control. More specifically, different from the existing literature, we impose a dynamic relative CVaR constraint on it. By the stochastic dynamic programming techniques, we derive the corresponding Hamilton–Jacobi–Bellman (HJB) equation. Moreover, by the Lagrange multiplier method, the closed form solution is provided when the utility function is a logarithmic one. At last, an illustrative empirical study is given. The results show the distinct difference of the portfolio strategies with and without the CVaR constraints: the proportion invested in the risky assets is reduced over time with CVaR constraint instead of being constant without CVaR constraints. This can provide a good decision-making reference for the investors.

  2. Level set method for optimal shape design of MRAM core. Micromagnetic approach

    International Nuclear Information System (INIS)

    Melicher, Valdemar; Cimrak, Ivan; Keer, Roger van

    2008-01-01

    We aim at optimizing the shape of the magnetic core in MRAM memories. The evolution of the magnetization during the writing process is described by the Landau-Lifshitz equation (LLE). The actual shape of the core in one cell is characterized by the coefficient γ. Cost functional f=f(γ) expresses the quality of the writing process having in mind the competition between the full-select and the half-select element. We derive an explicit form of the derivative F=∂f/∂γ which allows for the use of gradient-type methods for the actual computation of the optimized shape (e.g., steepest descend method). The level set method (LSM) is employed for the representation of the piecewise constant coefficient γ

  3. Optimizing a three-element core design for the Advanced Neutron Source Reactor

    International Nuclear Information System (INIS)

    West, C.D.

    1995-01-01

    Source of neutrons in the proposed Advanced Neutron Source facility is a multipurpose research reactor providing 5-10 times the flux, for neutron beams, of the best existing facilities. Baseline design for the reactor core, based on the ''no new inventions'' rule, was an assembly of two annular fuel elements similar to those used in the Oak Ridge and Grenoble high flux reactors, containing highly enriched U silicide particles. DOE commissioned a study of the use of medium- or low-enriched U; a three-element core design was studied as a means to provide extra volume to accommodate the additional U compound required when the fissionable 235 U has to be diluted with 238 U to reduce the enrichment. This paper describes the design and optimization of that three-element core

  4. Separability of diagonal symmetric states: a quadratic conic optimization problem

    Directory of Open Access Journals (Sweden)

    Jordi Tura

    2018-01-01

    Full Text Available We study the separability problem in mixtures of Dicke states i.e., the separability of the so-called Diagonal Symmetric (DS states. First, we show that separability in the case of DS in $C^d\\otimes C^d$ (symmetric qudits can be reformulated as a quadratic conic optimization problem. This connection allows us to exchange concepts and ideas between quantum information and this field of mathematics. For instance, copositive matrices can be understood as indecomposable entanglement witnesses for DS states. As a consequence, we show that positivity of the partial transposition (PPT is sufficient and necessary for separability of DS states for $d \\leq 4$. Furthermore, for $d \\geq 5$, we provide analytic examples of PPT-entangled states. Second, we develop new sufficient separability conditions beyond the PPT criterion for bipartite DS states. Finally, we focus on $N$-partite DS qubits, where PPT is known to be necessary and sufficient for separability. In this case, we present a family of almost DS states that are PPT with respect to each partition but nevertheless entangled.

  5. Optimal Control Approaches to the Aggregate Production Planning Problem

    Directory of Open Access Journals (Sweden)

    Yasser A. Davizón

    2015-12-01

    Full Text Available In the area of production planning and control, the aggregate production planning (APP problem represents a great challenge for decision makers in production-inventory systems. Tradeoff between inventory-capacity is known as the APP problem. To address it, static and dynamic models have been proposed, which in general have several shortcomings. It is the premise of this paper that the main drawback of these proposals is, that they do not take into account the dynamic nature of the APP. For this reason, we propose the use of an Optimal Control (OC formulation via the approach of energy-based and Hamiltonian-present value. The main contribution of this paper is the mathematical model which integrates a second order dynamical system coupled with a first order system, incorporating production rate, inventory level, and capacity as well with the associated cost by work force in the same formulation. Also, a novel result in relation with the Hamiltonian-present value in the OC formulation is that it reduces the inventory level compared with the pure energy based approach for APP. A set of simulations are provided which verifies the theoretical contribution of this work.

  6. A modified teaching–learning based optimization for multi-objective optimal power flow problem

    International Nuclear Information System (INIS)

    Shabanpour-Haghighi, Amin; Seifi, Ali Reza; Niknam, Taher

    2014-01-01

    Highlights: • A new modified teaching–learning based algorithm is proposed. • A self-adaptive wavelet mutation strategy is used to enhance the performance. • To avoid reaching a large repository size, a fuzzy clustering technique is used. • An efficiently smart population selection is utilized. • Simulations show the superiority of this algorithm compared with other ones. - Abstract: In this paper, a modified teaching–learning based optimization algorithm is analyzed to solve the multi-objective optimal power flow problem considering the total fuel cost and total emission of the units. The modified phase of the optimization algorithm utilizes a self-adapting wavelet mutation strategy. Moreover, a fuzzy clustering technique is proposed to avoid extremely large repository size besides a smart population selection for the next iteration. These techniques make the algorithm searching a larger space to find the optimal solutions while speed of the convergence remains good. The IEEE 30-Bus and 57-Bus systems are used to illustrate performance of the proposed algorithm and results are compared with those in literatures. It is verified that the proposed approach has better performance over other techniques

  7. Multiswarm comprehensive learning particle swarm optimization for solving multiobjective optimization problems.

    Science.gov (United States)

    Yu, Xiang; Zhang, Xueqing

    2017-01-01

    Comprehensive learning particle swarm optimization (CLPSO) is a powerful state-of-the-art single-objective metaheuristic. Extending from CLPSO, this paper proposes multiswarm CLPSO (MSCLPSO) for multiobjective optimization. MSCLPSO involves multiple swarms, with each swarm associated with a separate original objective. Each particle's personal best position is determined just according to the corresponding single objective. Elitists are stored externally. MSCLPSO differs from existing multiobjective particle swarm optimizers in three aspects. First, each swarm focuses on optimizing the associated objective using CLPSO, without learning from the elitists or any other swarm. Second, mutation is applied to the elitists and the mutation strategy appropriately exploits the personal best positions and elitists. Third, a modified differential evolution (DE) strategy is applied to some extreme and least crowded elitists. The DE strategy updates an elitist based on the differences of the elitists. The personal best positions carry useful information about the Pareto set, and the mutation and DE strategies help MSCLPSO discover the true Pareto front. Experiments conducted on various benchmark problems demonstrate that MSCLPSO can find nondominated solutions distributed reasonably over the true Pareto front in a single run.

  8. Optimizing the Betts-Miller-Janjic cumulus parameterization with Intel Many Integrated Core (MIC) architecture

    Science.gov (United States)

    Huang, Melin; Huang, Bormin; Huang, Allen H.-L.

    2015-10-01

    The schemes of cumulus parameterization are responsible for the sub-grid-scale effects of convective and/or shallow clouds, and intended to represent vertical fluxes due to unresolved updrafts and downdrafts and compensating motion outside the clouds. Some schemes additionally provide cloud and precipitation field tendencies in the convective column, and momentum tendencies due to convective transport of momentum. The schemes all provide the convective component of surface rainfall. Betts-Miller-Janjic (BMJ) is one scheme to fulfill such purposes in the weather research and forecast (WRF) model. National Centers for Environmental Prediction (NCEP) has tried to optimize the BMJ scheme for operational application. As there are no interactions among horizontal grid points, this scheme is very suitable for parallel computation. With the advantage of Intel Xeon Phi Many Integrated Core (MIC) architecture, efficient parallelization and vectorization essentials, it allows us to optimize the BMJ scheme. If compared to the original code respectively running on one CPU socket (eight cores) and on one CPU core with Intel Xeon E5-2670, the MIC-based optimization of this scheme running on Xeon Phi coprocessor 7120P improves the performance by 2.4x and 17.0x, respectively.

  9. Improved Particle Swarm Optimization with a Collective Local Unimodal Search for Continuous Optimization Problems

    Science.gov (United States)

    Arasomwan, Martins Akugbe; Adewumi, Aderemi Oluyinka

    2014-01-01

    A new local search technique is proposed and used to improve the performance of particle swarm optimization algorithms by addressing the problem of premature convergence. In the proposed local search technique, a potential particle position in the solution search space is collectively constructed by a number of randomly selected particles in the swarm. The number of times the selection is made varies with the dimension of the optimization problem and each selected particle donates the value in the location of its randomly selected dimension from its personal best. After constructing the potential particle position, some local search is done around its neighbourhood in comparison with the current swarm global best position. It is then used to replace the global best particle position if it is found to be better; otherwise no replacement is made. Using some well-studied benchmark problems with low and high dimensions, numerical simulations were used to validate the performance of the improved algorithms. Comparisons were made with four different PSO variants, two of the variants implement different local search technique while the other two do not. Results show that the improved algorithms could obtain better quality solution while demonstrating better convergence velocity and precision, stability, robustness, and global-local search ability than the competing variants. PMID:24723827

  10. Comparative performance of an elitist teaching-learning-based optimization algorithm for solving unconstrained optimization problems

    Directory of Open Access Journals (Sweden)

    R. Venkata Rao

    2013-01-01

    Full Text Available Teaching-Learning-based optimization (TLBO is a recently proposed population based algorithm, which simulates the teaching-learning process of the class room. This algorithm requires only the common control parameters and does not require any algorithm-specific control parameters. In this paper, the effect of elitism on the performance of the TLBO algorithm is investigated while solving unconstrained benchmark problems. The effects of common control parameters such as the population size and the number of generations on the performance of the algorithm are also investigated. The proposed algorithm is tested on 76 unconstrained benchmark functions with different characteristics and the performance of the algorithm is compared with that of other well known optimization algorithms. A statistical test is also performed to investigate the results obtained using different algorithms. The results have proved the effectiveness of the proposed elitist TLBO algorithm.

  11. On the Equivalence of Quadratic Optimization Problems Commonly Used in Portfolio Theory

    OpenAIRE

    Taras Bodnar; Nestor Parolya; Wolfgang Schmid

    2012-01-01

    In the paper, we consider three quadratic optimization problems which are frequently applied in portfolio theory, i.e, the Markowitz mean-variance problem as well as the problems based on the mean-variance utility function and the quadratic utility.Conditions are derived under which the solutions of these three optimization procedures coincide and are lying on the efficient frontier, the set of mean-variance optimal portfolios. It is shown that the solutions of the Markowitz optimization prob...

  12. The Relationship between Sleep Problems, Neurobiological Alterations, Core Symptoms of Autism Spectrum Disorder, and Psychiatric Comorbidities

    Directory of Open Access Journals (Sweden)

    Luigi Mazzone

    2018-05-01

    Full Text Available Children with Autism Spectrum Disorder (ASD are at an increased risk for sleep disturbances, and studies indicate that between 50 and 80% of children with ASD experience sleep problems. These problems increase parental stress and adversely affect family quality of life. Studies have also suggested that sleep disturbances may increase behavioral problems in this clinical population. Although understanding the causes of sleep disorders in ASD is a clinical priority, the causal relationship between these two conditions remains unclear. Given the complex nature of ASD, the etiology of sleep problems in this clinical population is probably multi-factorial. In this overview, we discuss in detail three possible etiological explanations of sleep problems in ASD that can all contribute to the high rate of these symptoms in ASD. Specifically, we examine how neurobiological alterations, genetic mutations, and disrupted sleep architecture can cause sleep problems in individuals with ASD. We also discuss how sleep problems may be a direct result of core symptoms of ASD. Finally, a detailed examination of the relationship between sleep problems and associated clinical features and psychiatric comorbidities in individuals with ASD is described.

  13. Optimization of refueling-shuffling scheme in PWR core by random search strategy

    International Nuclear Information System (INIS)

    Wu Yuan

    1991-11-01

    A random method for simulating optimization of refueling management in a pressurized water reactor (PWR) core is described. The main purpose of the optimization was to select the 'best' refueling arrangement scheme which would produce maximum economic benefits under certain imposed conditions. To fulfill this goal, an effective optimization strategy, two-stage random search method was developed. First, the search was made in a manner similar to the stratified sampling technique. A local optimum can be reached by comparison of the successive results. Then the other random experiences would be carried on between different strata to try to find the global optimum. In general, it can be used as a practical tool for conventional fuel management scheme. However, it can also be used in studies on optimization of Low-Leakage fuel management. Some calculations were done for a typical PWR core on a CYBER-180/830 computer. The results show that the method proposed can obtain satisfactory approach at reasonable low computational cost

  14. An Introduction to Kristof's Theorem for Solving Least-Square Optimization Problems Without Calculus.

    Science.gov (United States)

    Waller, Niels

    2018-01-01

    Kristof's Theorem (Kristof, 1970 ) describes a matrix trace inequality that can be used to solve a wide-class of least-square optimization problems without calculus. Considering its generality, it is surprising that Kristof's Theorem is rarely used in statistics and psychometric applications. The underutilization of this method likely stems, in part, from the mathematical complexity of Kristof's ( 1964 , 1970 ) writings. In this article, I describe the underlying logic of Kristof's Theorem in simple terms by reviewing four key mathematical ideas that are used in the theorem's proof. I then show how Kristof's Theorem can be used to provide novel derivations to two cognate models from statistics and psychometrics. This tutorial includes a glossary of technical terms and an online supplement with R (R Core Team, 2017 ) code to perform the calculations described in the text.

  15. Modified Backtracking Search Optimization Algorithm Inspired by Simulated Annealing for Constrained Engineering Optimization Problems

    Directory of Open Access Journals (Sweden)

    Hailong Wang

    2018-01-01

    Full Text Available The backtracking search optimization algorithm (BSA is a population-based evolutionary algorithm for numerical optimization problems. BSA has a powerful global exploration capacity while its local exploitation capability is relatively poor. This affects the convergence speed of the algorithm. In this paper, we propose a modified BSA inspired by simulated annealing (BSAISA to overcome the deficiency of BSA. In the BSAISA, the amplitude control factor (F is modified based on the Metropolis criterion in simulated annealing. The redesigned F could be adaptively decreased as the number of iterations increases and it does not introduce extra parameters. A self-adaptive ε-constrained method is used to handle the strict constraints. We compared the performance of the proposed BSAISA with BSA and other well-known algorithms when solving thirteen constrained benchmarks and five engineering design problems. The simulation results demonstrated that BSAISA is more effective than BSA and more competitive with other well-known algorithms in terms of convergence speed.

  16. Efficient Output Solution for Nonlinear Stochastic Optimal Control Problem with Model-Reality Differences

    Directory of Open Access Journals (Sweden)

    Sie Long Kek

    2015-01-01

    Full Text Available A computational approach is proposed for solving the discrete time nonlinear stochastic optimal control problem. Our aim is to obtain the optimal output solution of the original optimal control problem through solving the simplified model-based optimal control problem iteratively. In our approach, the adjusted parameters are introduced into the model used such that the differences between the real system and the model used can be computed. Particularly, system optimization and parameter estimation are integrated interactively. On the other hand, the output is measured from the real plant and is fed back into the parameter estimation problem to establish a matching scheme. During the calculation procedure, the iterative solution is updated in order to approximate the true optimal solution of the original optimal control problem despite model-reality differences. For illustration, a wastewater treatment problem is studied and the results show the efficiency of the approach proposed.

  17. Optimal control problem for the extended Fisher–Kolmogorov equation

    Indian Academy of Sciences (India)

    by methods of optimal control, such as chemical engineering and vehicle ... ern optimal control theories and applied models are not only represented by .... Obviously, equation (2.5) is an ordinary differential equation and according to ODE.

  18. CORE

    DEFF Research Database (Denmark)

    Krigslund, Jeppe; Hansen, Jonas; Hundebøll, Martin

    2013-01-01

    State-of-the-art in network coding for wireless, meshed networks typically considers two problems separately. First, the problem of providing reliability for a single session. Second, the problem of opportunistic combination of flows by using minimalistic coding, i.e., by XORing packets from diff...

  19. A Risk-Sensitive Portfolio Optimization Problem with Fixed Incomes Securities

    OpenAIRE

    Goel, Mayank; Kumar, K. Suresh

    2007-01-01

    We discuss a class of risk-sensitive portfolio optimization problems. We consider the portfolio optimization model investigated by Nagai in 2003. The model by its nature can include fixed income securities as well in the portfolio. Under fairly general conditions, we prove the existence of optimal portfolio in both finite and infinite horizon problems.

  20. IP cores design from specifications to production modeling, verification, optimization, and protection

    CERN Document Server

    Mohamed, Khaled Salah

    2016-01-01

    This book describes the life cycle process of IP cores, from specification to production, including IP modeling, verification, optimization, and protection. Various trade-offs in the design process are discussed, including  those associated with many of the most common memory cores, controller IPs  and system-on-chip (SoC) buses. Readers will also benefit from the author’s practical coverage of new verification methodologies. such as bug localization, UVM, and scan-chain.  A SoC case study is presented to compare traditional verification with the new verification methodologies. ·         Discusses the entire life cycle process of IP cores, from specification to production, including IP modeling, verification, optimization, and protection; ·         Introduce a deep introduction for Verilog for both implementation and verification point of view.  ·         Demonstrates how to use IP in applications such as memory controllers and SoC buses. ·         Describes a new ver...

  1. Behavior-aware cache hierarchy optimization for low-power multi-core embedded systems

    Science.gov (United States)

    Zhao, Huatao; Luo, Xiao; Zhu, Chen; Watanabe, Takahiro; Zhu, Tianbo

    2017-07-01

    In modern embedded systems, the increasing number of cores requires efficient cache hierarchies to ensure data throughput, but such cache hierarchies are restricted by their tumid size and interference accesses which leads to both performance degradation and wasted energy. In this paper, we firstly propose a behavior-aware cache hierarchy (BACH) which can optimally allocate the multi-level cache resources to many cores and highly improved the efficiency of cache hierarchy, resulting in low energy consumption. The BACH takes full advantage of the explored application behaviors and runtime cache resource demands as the cache allocation bases, so that we can optimally configure the cache hierarchy to meet the runtime demand. The BACH was implemented on the GEM5 simulator. The experimental results show that energy consumption of a three-level cache hierarchy can be saved from 5.29% up to 27.94% compared with other key approaches while the performance of the multi-core system even has a slight improvement counting in hardware overhead.

  2. Averaging and Linear Programming in Some Singularly Perturbed Problems of Optimal Control

    Energy Technology Data Exchange (ETDEWEB)

    Gaitsgory, Vladimir, E-mail: vladimir.gaitsgory@mq.edu.au [Macquarie University, Department of Mathematics (Australia); Rossomakhine, Sergey, E-mail: serguei.rossomakhine@flinders.edu.au [Flinders University, Flinders Mathematical Sciences Laboratory, School of Computer Science, Engineering and Mathematics (Australia)

    2015-04-15

    The paper aims at the development of an apparatus for analysis and construction of near optimal solutions of singularly perturbed (SP) optimal controls problems (that is, problems of optimal control of SP systems) considered on the infinite time horizon. We mostly focus on problems with time discounting criteria but a possibility of the extension of results to periodic optimization problems is discussed as well. Our consideration is based on earlier results on averaging of SP control systems and on linear programming formulations of optimal control problems. The idea that we exploit is to first asymptotically approximate a given problem of optimal control of the SP system by a certain averaged optimal control problem, then reformulate this averaged problem as an infinite-dimensional linear programming (LP) problem, and then approximate the latter by semi-infinite LP problems. We show that the optimal solution of these semi-infinite LP problems and their duals (that can be found with the help of a modification of an available LP software) allow one to construct near optimal controls of the SP system. We demonstrate the construction with two numerical examples.

  3. NSGA-II Algorithm with a Local Search Strategy for Multiobjective Optimal Design of Dry-Type Air-Core Reactor

    Directory of Open Access Journals (Sweden)

    Chengfen Zhang

    2015-01-01

    Full Text Available Dry-type air-core reactor is now widely applied in electrical power distribution systems, for which the optimization design is a crucial issue. In the optimization design problem of dry-type air-core reactor, the objectives of minimizing the production cost and minimizing the operation cost are both important. In this paper, a multiobjective optimal model is established considering simultaneously the two objectives of minimizing the production cost and minimizing the operation cost. To solve the multi-objective optimization problem, a memetic evolutionary algorithm is proposed, which combines elitist nondominated sorting genetic algorithm version II (NSGA-II with a local search strategy based on the covariance matrix adaptation evolution strategy (CMA-ES. NSGA-II can provide decision maker with flexible choices among the different trade-off solutions, while the local-search strategy, which is applied to nondominated individuals randomly selected from the current population in a given generation and quantity, can accelerate the convergence speed. Furthermore, another modification is that an external archive is set in the proposed algorithm for increasing the evolutionary efficiency. The proposed algorithm is tested on a dry-type air-core reactor made of rectangular cross-section litz-wire. Simulation results show that the proposed algorithm has high efficiency and it converges to a better Pareto front.

  4. Optimizing Performance of Combustion Chemistry Solvers on Intel's Many Integrated Core (MIC) Architectures

    Energy Technology Data Exchange (ETDEWEB)

    Sitaraman, Hariswaran [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Grout, Ray W [National Renewable Energy Laboratory (NREL), Golden, CO (United States)

    2017-06-09

    This work investigates novel algorithm designs and optimization techniques for restructuring chemistry integrators in zero and multidimensional combustion solvers, which can then be effectively used on the emerging generation of Intel's Many Integrated Core/Xeon Phi processors. These processors offer increased computing performance via large number of lightweight cores at relatively lower clock speeds compared to traditional processors (e.g. Intel Sandybridge/Ivybridge) used in current supercomputers. This style of processor can be productively used for chemistry integrators that form a costly part of computational combustion codes, in spite of their relatively lower clock speeds. Performance commensurate with traditional processors is achieved here through the combination of careful memory layout, exposing multiple levels of fine grain parallelism and through extensive use of vendor supported libraries (Cilk Plus and Math Kernel Libraries). Important optimization techniques for efficient memory usage and vectorization have been identified and quantified. These optimizations resulted in a factor of ~ 3 speed-up using Intel 2013 compiler and ~ 1.5 using Intel 2017 compiler for large chemical mechanisms compared to the unoptimized version on the Intel Xeon Phi. The strategies, especially with respect to memory usage and vectorization, should also be beneficial for general purpose computational fluid dynamics codes.

  5. A Bandwidth-Optimized Multi-Core Architecture for Irregular Applications

    Energy Technology Data Exchange (ETDEWEB)

    Secchi, Simone; Tumeo, Antonino; Villa, Oreste

    2012-05-31

    This paper presents an architecture template for next-generation high performance computing systems specifically targeted to irregular applications. We start our work by considering that future generation interconnection and memory bandwidth full-system numbers are expected to grow by a factor of 10. In order to keep up with such a communication capacity, while still resorting to fine-grained multithreading as the main way to tolerate unpredictable memory access latencies of irregular applications, we show how overall performance scaling can benefit from the multi-core paradigm. At the same time, we also show how such an architecture template must be coupled with specific techniques in order to optimize bandwidth utilization and achieve the maximum scalability. We propose a technique based on memory references aggregation, together with the related hardware implementation, as one of such optimization techniques. We explore the proposed architecture template by focusing on the Cray XMT architecture and, using a dedicated simulation infrastructure, validate the performance of our template with two typical irregular applications. Our experimental results prove the benefits provided by both the multi-core approach and the bandwidth optimization reference aggregation technique.

  6. Demountable toroidal fusion core facility for physics optimization and fusion engineering

    International Nuclear Information System (INIS)

    Bogart, S.L.; Wagner, C.E.; Krall, N.A.; Dalessandro, J.A.; Weggel, C.F.; Lund, K.O.; Sedehi, S.

    1986-01-01

    Following a successful compact ignition tokamak (CIT) experiment, a fusion facility will be required for physics optimization (POF) and fusion engineering research (FERF). The POF will address issues such as high-beta operation, current drive, impurity control, and will test geometric and configurational variations such as the spherical torus or the reversed-field pinch (RFP). The FERF will be designed to accumulate rapidly a large neutron dose in prototypical fusion subsystems exposed to radiation. Both facilities will require low-cost replacement cores and rapid replacement times. The Demountable Toroidal Fusion Core (DTFC) facility is designed to fulfill these requirements. It would be a cost-effective stepping stone between the CIT and a demonstration fusion reactor

  7. Existence of the Optimal Control for Stochastic Boundary Control Problems Governed by Semilinear Parabolic Equations

    Directory of Open Access Journals (Sweden)

    Weifeng Wang

    2014-01-01

    Full Text Available We study an optimal control problem governed by a semilinear parabolic equation, whose control variable is contained only in the boundary condition. An existence theorem for the optimal control is obtained.

  8. Amodified probabilistic genetic algorithm for the solution of complex constrained optimization problems

    OpenAIRE

    Vorozheikin, A.; Gonchar, T.; Panfilov, I.; Sopov, E.; Sopov, S.

    2009-01-01

    A new algorithm for the solution of complex constrained optimization problems based on the probabilistic genetic algorithm with optimal solution prediction is proposed. The efficiency investigation results in comparison with standard genetic algorithm are presented.

  9. Preconditioners for state-constrained optimal control problems with Moreau-Yosida penalty function

    KAUST Repository

    Pearson, John W.; Stoll, Martin; Wathen, Andrew J.

    2012-01-01

    Optimal control problems with partial differential equations as constraints play an important role in many applications. The inclusion of bound constraints for the state variable poses a significant challenge for optimization methods. Our focus here

  10. Parameters optimization defined by statistical analysis for cysteine-dextran radiolabeling with technetium tricarbonyl core.

    Science.gov (United States)

    Núñez, Eutimio Gustavo Fernández; Faintuch, Bluma Linkowski; Teodoro, Rodrigo; Wiecek, Danielle Pereira; da Silva, Natanael Gomes; Papadopoulos, Minas; Pelecanou, Maria; Pirmettis, Ioannis; de Oliveira Filho, Renato Santos; Duatti, Adriano; Pasqualini, Roberto

    2011-04-01

    The objective of this study was the development of a statistical approach for radiolabeling optimization of cysteine-dextran conjugates with Tc-99m tricarbonyl core. This strategy has been applied to the labeling of 2-propylene-S-cysteine-dextran in the attempt to prepare a new class of tracers for sentinel lymph node detection, and can be extended to other radiopharmaceuticals for different targets. The statistical routine was based on three-level factorial design. Best labeling conditions were achieved. The specific activity reached was 5 MBq/μg. Crown Copyright © 2011. Published by Elsevier Ltd. All rights reserved.

  11. Parameters optimization defined by statistical analysis for cysteine-dextran radiolabeling with technetium tricarbonyl core

    Energy Technology Data Exchange (ETDEWEB)

    Fernandez Nunez, Eutimio Gustavo, E-mail: eutimiocu@yahoo.co [Radiopharmacy Center, Institute of Energetic and Nuclear Research, Sao Paulo, SP 05508-000 (Brazil); Linkowski Faintuch, Bluma; Teodoro, Rodrigo; Pereira Wiecek, Danielle; Gomes da Silva, Natanael [Radiopharmacy Center, Institute of Energetic and Nuclear Research, Sao Paulo, SP 05508-000 (Brazil); Papadopoulos, Minas [Institute of Radioisotopes, Radiodiagnostic Products, National Center for Scientific Research ' Demokritos' , Athens (Greece); Pelecanou, Maria [Institute of Biology, National Center for Scientific Research ' Demokritos' , Athens (Greece); Pirmettis, Ioannis [Institute of Radioisotopes, Radiodiagnostic Products, National Center for Scientific Research ' Demokritos' , Athens (Greece); Santos Oliveira Filho, Renato de [Faculty of Medicine, Federal University of Sao Paulo, SP (Brazil); Duatti, Adriano [Department of Radiological Sciences, University of Ferrara, Ferrara (Italy); Pasqualini, Roberto [CIS Bio International, Gif sur Yvette (France)

    2011-04-15

    The objective of this study was the development of a statistical approach for radiolabeling optimization of cysteine-dextran conjugates with Tc-99m tricarbonyl core. This strategy has been applied to the labeling of 2-propylene-S-cysteine-dextran in the attempt to prepare a new class of tracers for sentinel lymph node detection, and can be extended to other radiopharmaceuticals for different targets. The statistical routine was based on three-level factorial design. Best labeling conditions were achieved. The specific activity reached was 5 MBq/{mu}g.

  12. Cleaving of TOPAS and PMMA microstructured polymer optical fibers: Core-shift and statistical quality optimization

    DEFF Research Database (Denmark)

    Stefani, Alessio; Nielsen, Kristian; Rasmussen, Henrik K.

    2012-01-01

    We fabricated an electronically controlled polymer optical fiber cleaver, which uses a razor-blade guillotine and provides independent control of fiber temperature, blade temperature, and cleaving speed. To determine the optimum cleaving conditions of microstructured polymer optical fibers (m......POFs) with hexagonal hole structures we developed a program for cleaving quality optimization, which reads in a microscope image of the fiber end-facet and determines the core-shift and the statistics of the hole diameter, hole-to-hole pitch, hole ellipticity, and direction of major ellipse axis. For 125μm in diameter...

  13. Optimized surface-slab excited-state muffin-tin potential and surface core level shifts

    International Nuclear Information System (INIS)

    Rundgren, J.

    2003-01-01

    An optimized muffin-tin (MT) potential for surface slabs with preassigned surface core-level shifts (SCLS's) is presented. By using the MT radii as adjustable parameters the model is able to conserve the definition of the SCLS with respect to the bulk and concurrently to generate a potential that is continuous at the MT radii. The model is conceived for elastic electron scattering in a surface slab with exchange-correlation interaction described by the local density approximation. The model employs two data bases for the self-energy of the signal electron (after Hedin and Lundqvist or Sernelius). The potential model is discussed in detail with two surface structures Be(101-bar0), for which SCLS's are available, and Cu(111)p(2x2)Cs, in which the close-packed radii of the atoms are extremely different. It is considered plausible that tensor LEED based on an optimized MT potential can be used for determining SCLS's

  14. Out-of-core nuclear fuel cycle optimization utilizing an engineering workstation

    International Nuclear Information System (INIS)

    Turinsky, P.J.; Comes, S.A.

    1986-01-01

    Within the past several years, rapid advances in computer technology have resulted in substantial increases in their performance. The net effect is that problems that could previously only be executed on mainframe computers can now be executed on micro- and minicomputers. The authors are interested in developing an engineering workstation for nuclear fuel management applications. An engineering workstation is defined as a microcomputer with enhanced graphics and communication capabilities. Current fuel management applications range from using workstations as front-end/back-end processors for mainframe computers to completing fuel management scoping calculations. More recently, interest in using workstations for final in-core design calculations has appeared. The authors have used the VAX 11/750 minicomputer, which is not truly an engineering workstation but has comparable performance, to complete both in-core and out-of-core fuel management scoping studies. In this paper, the authors concentrate on our out-of-core research. While much previous work in this area has dealt with decisions concerned with equilibrium cycles, the current project addresses the more realistic situation of nonequilibrium cycles

  15. Core design optimization by integration of a fast 3-D nodal code in a heuristic search procedure

    Energy Technology Data Exchange (ETDEWEB)

    Geemert, R. van; Leege, P.F.A. de; Hoogenboom, J.E.; Quist, A.J. [Delft University of Technology, NL-2629 JB Delft (Netherlands)

    1998-07-01

    An automated design tool is being developed for the Hoger Onderwijs Reactor (HOR) in Delft, the Netherlands, which is a 2 MWth swimming-pool type research reactor. As a black box evaluator, the 3-D nodal code SILWER, which up to now has been used only for evaluation of predetermined core designs, is integrated in the core optimization procedure. SILWER is a part of PSl's ELCOS package and features optional additional thermal-hydraulic, control rods and xenon poisoning calculations. This allows for fast and accurate evaluation of different core designs during the optimization search. Special attention is paid to handling the in- and output files for SILWER such that no adjustment of the code itself is required for its integration in the optimization programme. The optimization objective, the safety and operation constraints, as well as the optimization procedure, are discussed. (author)

  16. Core design optimization by integration of a fast 3-D nodal code in a heuristic search procedure

    International Nuclear Information System (INIS)

    Geemert, R. van; Leege, P.F.A. de; Hoogenboom, J.E.; Quist, A.J.

    1998-01-01

    An automated design tool is being developed for the Hoger Onderwijs Reactor (HOR) in Delft, the Netherlands, which is a 2 MWth swimming-pool type research reactor. As a black box evaluator, the 3-D nodal code SILWER, which up to now has been used only for evaluation of predetermined core designs, is integrated in the core optimization procedure. SILWER is a part of PSl's ELCOS package and features optional additional thermal-hydraulic, control rods and xenon poisoning calculations. This allows for fast and accurate evaluation of different core designs during the optimization search. Special attention is paid to handling the in- and output files for SILWER such that no adjustment of the code itself is required for its integration in the optimization programme. The optimization objective, the safety and operation constraints, as well as the optimization procedure, are discussed. (author)

  17. A multilevel, level-set method for optimizing eigenvalues in shape design problems

    International Nuclear Information System (INIS)

    Haber, E.

    2004-01-01

    In this paper, we consider optimal design problems that involve shape optimization. The goal is to determine the shape of a certain structure such that it is either as rigid or as soft as possible. To achieve this goal we combine two new ideas for an efficient solution of the problem. First, we replace the eigenvalue problem with an approximation by using inverse iteration. Second, we use a level set method but rather than propagating the front we use constrained optimization methods combined with multilevel continuation techniques. Combining these two ideas we obtain a robust and rapid method for the solution of the optimal design problem

  18. Optimization of lift gas allocation in a gas lifted oil field as non-linear optimization problem

    Directory of Open Access Journals (Sweden)

    Roshan Sharma

    2012-01-01

    Full Text Available Proper allocation and distribution of lift gas is necessary for maximizing total oil production from a field with gas lifted oil wells. When the supply of the lift gas is limited, the total available gas should be optimally distributed among the oil wells of the field such that the total production of oil from the field is maximized. This paper describes a non-linear optimization problem with constraints associated with the optimal distribution of the lift gas. A non-linear objective function is developed using a simple dynamic model of the oil field where the decision variables represent the lift gas flow rate set points of each oil well of the field. The lift gas optimization problem is solved using the emph'fmincon' solver found in MATLAB. As an alternative and for verification, hill climbing method is utilized for solving the optimization problem. Using both of these methods, it has been shown that after optimization, the total oil production is increased by about 4. For multiple oil wells sharing lift gas from a common source, a cascade control strategy along with a nonlinear steady state optimizer behaves as a self-optimizing control structure when the total supply of lift gas is assumed to be the only input disturbance present in the process. Simulation results show that repeated optimization performed after the first time optimization under the presence of the input disturbance has no effect in the total oil production.

  19. Reduced order modeling in topology optimization of vibroacoustic problems

    DEFF Research Database (Denmark)

    Creixell Mediante, Ester; Jensen, Jakob Søndergaard; Brunskog, Jonas

    2017-01-01

    complex 3D parts. The optimization process can therefore become highly time consuming due to the need to solve a large system of equations at each iteration. Projection-based parametric Model Order Reduction (pMOR) methods have successfully been applied for reducing the computational cost of material......There is an interest in introducing topology optimization techniques in the design process of structural-acoustic systems. In topology optimization, the design space must be finely meshed in order to obtain an accurate design, which results in large numbers of degrees of freedom when designing...... or size optimization in large vibroacoustic models; however, new challenges are encountered when dealing with topology optimization. Since a design parameter per element is considered, the total number of design variables becomes very large; this poses a challenge to most existing pMOR techniques, which...

  20. An Enhanced Memetic Algorithm for Single-Objective Bilevel Optimization Problems.

    Science.gov (United States)

    Islam, Md Monjurul; Singh, Hemant Kumar; Ray, Tapabrata; Sinha, Ankur

    2017-01-01

    Bilevel optimization, as the name reflects, deals with optimization at two interconnected hierarchical levels. The aim is to identify the optimum of an upper-level  leader problem, subject to the optimality of a lower-level follower problem. Several problems from the domain of engineering, logistics, economics, and transportation have an inherent nested structure which requires them to be modeled as bilevel optimization problems. Increasing size and complexity of such problems has prompted active theoretical and practical interest in the design of efficient algorithms for bilevel optimization. Given the nested nature of bilevel problems, the computational effort (number of function evaluations) required to solve them is often quite high. In this article, we explore the use of a Memetic Algorithm (MA) to solve bilevel optimization problems. While MAs have been quite successful in solving single-level optimization problems, there have been relatively few studies exploring their potential for solving bilevel optimization problems. MAs essentially attempt to combine advantages of global and local search strategies to identify optimum solutions with low computational cost (function evaluations). The approach introduced in this article is a nested Bilevel Memetic Algorithm (BLMA). At both upper and lower levels, either a global or a local search method is used during different phases of the search. The performance of BLMA is presented on twenty-five standard test problems and two real-life applications. The results are compared with other established algorithms to demonstrate the efficacy of the proposed approach.

  1. Diagnostic criteria for idiopathic inflammatory myopathies. Problems of their optimization

    Directory of Open Access Journals (Sweden)

    O. A. Antelava

    2014-01-01

    Full Text Available The paper deals with the problems of optimizing the diagnostic criteria for idiopathic inflammatory myopathies (IIM, a group of heterogeneous rare autoimmune diseases characterized by inflammatory lesion in the skeletal muscles. The representatives of this group are traditionally considered to be polymyositis (PM, dermatomyositis (DM, and inclusion-body myositis. The authors detail the history of classification criteria for IIM from those proposed by T.A. Medsger et al. (1970 relying on its clinical picture, laboratory data and instrumental findings, as well as the criteria (including the first introduced exclusion ones elaborated by A. Bohan and J.B. Peter in 1975, which remain fundamental in both clinical practice and researches. The basis for the clinical and serological criteria proposed by Y. Troyanov et al. (2005 for IIM is the identification of myositis-overlap syndromes. The classificational (subtype identification and therapeutic value of the criteria based on clinical and serological characteristics was supported by the Hungarian investigators A. Vancsa et al. (2010 who investigated the relationship between the clinical and therapeutic characteristics of IIM and positivity for myositis-specific and myositis-associated antibodies. The criteria developed by M.C. Dalakas (1991, 2003 are based on the specific immunopathological features of a histological pattern, which allow the differentiation of DM, PM, and inclusion-body myositis from other myopathic syndromes. The 2004 European Neuromuscular Center (ENMC criteria first identify necrotizing autoimmune myopathy and nonspecific myositis as individual subtypes. The serological classification of IIM, which is based onthe assessment of autoantibodies that play an important role in the pathogenesis of the disease, is of indubitable interest. There is an obvious need for the correct and timely diagnosis of both IIM as a whole and its subtypes in particular, which is complicated by

  2. Design and fuel management of PWR cores to optimize the once-through fuel cycle

    International Nuclear Information System (INIS)

    Fujita, E.K.; Driscoll, M.J.; Lanning, D.D.

    1978-08-01

    The once-through fuel cycle has been analyzed to see if there are substantial prospects for improved uranium ore utilization in current light water reactors, with a specific focus on pressurized water reactors. The types of changes which have been examined are: (1) re-optimization of fuel pin diameter and lattice pitch, (2) axial power shaping by enrichment gradation in fresh fuel, (3) use of 6-batch cores with semi-annual refueling, (4) use of 6-batch cores with annual refueling, hence greater extended (approximately doubled) burnup, (5) use of radial reflector assemblies, (6) use of internally heterogeneous cores (simple seed/blanket configurations), (7) use of power/temperature coastdown at the end of life to extend burnup, (8) use of metal or diluted oxide fuel, (9) use of thorium, and (10) use of isotopically separated low sigma/sub a/ cladding material. State-of-the-art LWR computational methods, LEOPARD/PDQ-7/FLARE-G, were used to investigate these modifications

  3. The Accumulating Data to Optimally Predict Obesity Treatment (ADOPT) Core Measures Project: Rationale and Approach.

    Science.gov (United States)

    MacLean, Paul S; Rothman, Alexander J; Nicastro, Holly L; Czajkowski, Susan M; Agurs-Collins, Tanya; Rice, Elise L; Courcoulas, Anita P; Ryan, Donna H; Bessesen, Daniel H; Loria, Catherine M

    2018-04-01

    Individual variability in response to multiple modalities of obesity treatment is well documented, yet our understanding of why some individuals respond while others do not is limited. The etiology of this variability is multifactorial; however, at present, we lack a comprehensive evidence base to identify which factors or combination of factors influence treatment response. This paper provides an overview and rationale of the Accumulating Data to Optimally Predict obesity Treatment (ADOPT) Core Measures Project, which aims to advance the understanding of individual variability in response to adult obesity treatment. This project provides an integrated model for how factors in the behavioral, biological, environmental, and psychosocial domains may influence obesity treatment responses and identify a core set of measures to be used consistently across adult weight-loss trials. This paper provides the foundation for four companion papers that describe the core measures in detail. The accumulation of data on factors across the four ADOPT domains can inform the design and delivery of effective, tailored obesity treatments. ADOPT provides a framework for how obesity researchers can collectively generate this evidence base and is a first step in an ongoing process that can be refined as the science advances. © 2018 The Obesity Society.

  4. Simulation Based Optimization of Complex Monolithic Composite Structures Using Cellular Core Technology

    Science.gov (United States)

    Hickmott, Curtis W.

    Cellular core tooling is a new technology which has the capability to manufacture complex integrated monolithic composite structures. This novel tooling method utilizes thermoplastic cellular cores as inner tooling. The semi-rigid nature of the cellular cores makes them convenient for lay-up, and under autoclave temperature and pressure they soften and expand providing uniform compaction on all surfaces including internal features such as ribs and spar tubes. This process has the capability of developing fully optimized aerospace structures by reducing or eliminating assembly using fasteners or bonded joints. The technology is studied in the context of evaluating its capabilities, advantages, and limitations in developing high quality structures. The complex nature of these parts has led to development of a model using the Finite Element Analysis (FEA) software Abaqus and the plug-in COMPRO Common Component Architecture (CCA) provided by Convergent Manufacturing Technologies. This model utilizes a "virtual autoclave" technique to simulate temperature profiles, resin flow paths, and ultimately deformation from residual stress. A model has been developed simulating the temperature profile during curing of composite parts made with the cellular core technology. While modeling of composites has been performed in the past, this project will look to take this existing knowledge and apply it to this new manufacturing method capable of building more complex parts and develop a model designed specifically for building large, complex components with a high degree of accuracy. The model development has been carried out in conjunction with experimental validation. A double box beam structure was chosen for analysis to determine the effects of the technology on internal ribs and joints. Double box beams were manufactured and sectioned into T-joints for characterization. Mechanical behavior of T-joints was performed using the T-joint pull-off test and compared to traditional

  5. Optimization of constrained multiple-objective reliability problems using evolutionary algorithms

    International Nuclear Information System (INIS)

    Salazar, Daniel; Rocco, Claudio M.; Galvan, Blas J.

    2006-01-01

    This paper illustrates the use of multi-objective optimization to solve three types of reliability optimization problems: to find the optimal number of redundant components, find the reliability of components, and determine both their redundancy and reliability. In general, these problems have been formulated as single objective mixed-integer non-linear programming problems with one or several constraints and solved by using mathematical programming techniques or special heuristics. In this work, these problems are reformulated as multiple-objective problems (MOP) and then solved by using a second-generation Multiple-Objective Evolutionary Algorithm (MOEA) that allows handling constraints. The MOEA used in this paper (NSGA-II) demonstrates the ability to identify a set of optimal solutions (Pareto front), which provides the Decision Maker with a complete picture of the optimal solution space. Finally, the advantages of both MOP and MOEA approaches are illustrated by solving four redundancy problems taken from the literature

  6. Optimization of constrained multiple-objective reliability problems using evolutionary algorithms

    Energy Technology Data Exchange (ETDEWEB)

    Salazar, Daniel [Instituto de Sistemas Inteligentes y Aplicaciones Numericas en Ingenieria (IUSIANI), Division de Computacion Evolutiva y Aplicaciones (CEANI), Universidad de Las Palmas de Gran Canaria, Islas Canarias (Spain) and Facultad de Ingenieria, Universidad Central Venezuela, Caracas (Venezuela)]. E-mail: danielsalazaraponte@gmail.com; Rocco, Claudio M. [Facultad de Ingenieria, Universidad Central Venezuela, Caracas (Venezuela)]. E-mail: crocco@reacciun.ve; Galvan, Blas J. [Instituto de Sistemas Inteligentes y Aplicaciones Numericas en Ingenieria (IUSIANI), Division de Computacion Evolutiva y Aplicaciones (CEANI), Universidad de Las Palmas de Gran Canaria, Islas Canarias (Spain)]. E-mail: bgalvan@step.es

    2006-09-15

    This paper illustrates the use of multi-objective optimization to solve three types of reliability optimization problems: to find the optimal number of redundant components, find the reliability of components, and determine both their redundancy and reliability. In general, these problems have been formulated as single objective mixed-integer non-linear programming problems with one or several constraints and solved by using mathematical programming techniques or special heuristics. In this work, these problems are reformulated as multiple-objective problems (MOP) and then solved by using a second-generation Multiple-Objective Evolutionary Algorithm (MOEA) that allows handling constraints. The MOEA used in this paper (NSGA-II) demonstrates the ability to identify a set of optimal solutions (Pareto front), which provides the Decision Maker with a complete picture of the optimal solution space. Finally, the advantages of both MOP and MOEA approaches are illustrated by solving four redundancy problems taken from the literature.

  7. Optimal Experimental Design for Large-Scale Bayesian Inverse Problems

    KAUST Repository

    Ghattas, Omar

    2014-01-01

    We develop a Bayesian framework for the optimal experimental design of the shock tube experiments which are being carried out at the KAUST Clean Combustion Research Center. The unknown parameters are the pre-exponential parameters and the activation

  8. Filter Pattern Search Algorithms for Mixed Variable Constrained Optimization Problems

    National Research Council Canada - National Science Library

    Abramson, Mark A; Audet, Charles; Dennis, Jr, J. E

    2004-01-01

    .... This class combines and extends the Audet-Dennis Generalized Pattern Search (GPS) algorithms for bound constrained mixed variable optimization, and their GPS-filter algorithms for general nonlinear constraints...

  9. Sparse optimization for inverse problems in atmospheric modelling

    Czech Academy of Sciences Publication Activity Database

    Adam, Lukáš; Branda, Martin

    2016-01-01

    Roč. 79, č. 3 (2016), s. 256-266 ISSN 1364-8152 R&D Projects: GA MŠk(CZ) 7F14287 Institutional support: RVO:67985556 Keywords : Inverse modelling * Sparse optimization * Integer optimization * Least squares * European tracer experiment * Free Matlab codes Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 4.404, year: 2016 http://library.utia.cas.cz/separaty/2016/MTR/adam-0457037.pdf

  10. Optimization analysis of the nuclear fuel cycle transition to the last core

    International Nuclear Information System (INIS)

    Rebollo, L.; Blanco, J.

    2001-01-01

    The Zorita NPP was the first Spanish commercial nuclear reactor connected to the grid. It is a 160 MW one loop PWR, Westinghouse design, owned by UFG, in operation since 1968. The configuration of the reactor core is based on 69 fuel elements type 14 x 14, the standard reload of the present equilibrium cycle being based on 16 fuel elements with 3.6% enrichment in 235 U. In order to properly plan the nuclear fuel management of the transition cycles to its end of life, presently foreseen by 2008, an based on the non-reprocessing option required by the policy of the Spanish Administration, a technical-economical optimization analysis has been performed. As a result, a fuel management strategy has been defined looking for getting simultaneously the minimum integral fuel cost of the transition from the present equilibrium cycle to the last core, as well as the minimum residual worth of the fuel remaining in the core after the final outage. Based on the ''lessons learned'' derived from the study, the time margin for the decision making has been determined, and a planning of the nuclear fuel supply for the transition reloads, specifying both the number of fuel elements and their enrichment in 235 U, as been prepared. Finally, based on the calculated economical worth of the partially burned fuel of the last core, after the end of its operation cycle, a financial cover for yearly compensation from now on of the foreseen final lost has been elaborated. Most of the conceptual conclusions obtained are applicable to the other commercial nuclear reactors in operation owned by UFG, so that they are understood to be of general interest and broad application to commercial PWR. (author)

  11. OPTIM, Minimization of Band-Width of Finite Elements Problems

    International Nuclear Information System (INIS)

    Huart, M.

    1977-01-01

    1 - Nature of the physical problem solved: To minimize the band-width of finite element problems. 2 - Method of solution: A surface is constructed from the x-y-coordinates of each node using its node number as z-value. This surface consists of triangles. Nodes are renumbered in such a way as to minimize the surface area. 3 - Restrictions on the complexity of the problem: This program is applicable to 2-D problems. It is dimensioned for a maximum of 1000 elements

  12. Resolution and optimization methods for tour planning problems

    International Nuclear Information System (INIS)

    Vasserot, Jean-Pierre

    1976-12-01

    The aim of this study is to describe computerized methods for the resolution of the computer supported tour planning problem. After a presentation of this problem in operational research, the different existing methods of resolution are reviewed with the different approaches which have led to their elaboration. Different critics and comparisons are made on these methods and some improvements and new procedures are proposed, some of them allowing to solve more general problems. Finally, the structure of such a program, made at the CII to solve this kind of problem under multiple constraints is analysed [fr

  13. Optimal allocation of SVC and TCSC using quasi-oppositional chemical reaction optimization for solving multi-objective ORPD problem

    Directory of Open Access Journals (Sweden)

    Susanta Dutta

    2018-05-01

    Full Text Available This paper presents an efficient quasi-oppositional chemical reaction optimization (QOCRO technique to find the feasible optimal solution of the multi objective optimal reactive power dispatch (RPD problem with flexible AC transmission system (FACTS device. The quasi-oppositional based learning (QOBL is incorporated in conventional chemical reaction optimization (CRO, to improve the solution quality and the convergence speed. To check the superiority of the proposed method, it is applied on IEEE 14-bus and 30-bus systems and the simulation results of the proposed approach are compared to those reported in the literature. The computational results reveal that the proposed algorithm has excellent convergence characteristics and is superior to other multi objective optimization algorithms. Keywords: Quasi-oppositional chemical reaction optimization (QOCRO, Reactive power dispatch (RPD, TCSC, SVC, Multi-objective optimization

  14. Development of a fuzzy logic method to build objective functions in optimization problems: application to BWR fuel lattice design

    International Nuclear Information System (INIS)

    Martin-del-Campo, C.; Francois, J.L.; Barragan, A.M.; Palomera, M.A.

    2005-01-01

    In this paper we develop a methodology based on the use of the Fuzzy Logic technique to build multi-objective functions to be used in optimization processes applied to in-core nuclear fuel management. As an example, we selected the problem of determining optimal radial fuel enrichment and gadolinia distributions in a typical 'Boiling Water Reactor (BWR)' fuel lattice. The methodology is based on the use of the mathematical capability of Fuzzy Logic to model nonlinear functions of arbitrary complexity. The utility of Fuzzy Logic is to map an input space into an output space, and the primary mechanism for doing this is a list of if-then statements called rules. The rules refer to variables and adjectives that describe those variables and, the Fuzzy Logic technique interprets the values in the input vectors and, based on the set of rules assigns values to the output vector. The methodology was developed for the radial optimization of a BWR lattice where the optimization algorithm employed is Tabu Search. The global objective is to find the optimal distribution of enrichments and burnable poison concentrations in a 10*10 BWR lattice. In order to do that, a fuzzy control inference system was developed using the Fuzzy Logic Toolbox of Matlab and it has been linked to the Tabu Search optimization process. Results show that Tabu Search combined with Fuzzy Logic performs very well, obtaining lattices with optimal fuel utilization. (authors)

  15. Optimizing Green Computing Awareness for Environmental Sustainability and Economic Security as a Stochastic Optimization Problem

    Directory of Open Access Journals (Sweden)

    Emmanuel Okewu

    2017-10-01

    Full Text Available The role of automation in sustainable development is not in doubt. Computerization in particular has permeated every facet of human endeavour, enhancing the provision of information for decision-making that reduces cost of operation, promotes productivity and socioeconomic prosperity and cohesion. Hence, a new field called information and communication technology for development (ICT4D has emerged. Nonetheless, the need to ensure environmentally friendly computing has led to this research study with particular focus on green computing in Africa. This is against the backdrop that the continent is feared to suffer most from the vulnerability of climate change and the impact of environmental risk. Using Nigeria as a test case, this paper gauges the green computing awareness level of Africans via sample survey. It also attempts to institutionalize green computing maturity model with a view to optimizing the level of citizens awareness amid inherent uncertainties like low bandwidth, poor network and erratic power in an emerging African market. Consequently, we classified the problem as a stochastic optimization problem and applied metaheuristic search algorithm to determine the best sensitization strategy. Although there are alternative ways of promoting green computing education, the metaheuristic search we conducted indicated that an online real-time solution that not only drives but preserves timely conversations on electronic waste (e-waste management and energy saving techniques among the citizenry is cutting edge. The authors therefore reviewed literature, gathered requirements, modelled the proposed solution using Universal Modelling Language (UML and developed a prototype. The proposed solution is a web-based multi-tier e-Green computing system that educates computer users on innovative techniques of managing computers and accessories in an environmentally friendly way. We found out that such a real-time web-based interactive forum does not

  16. Few-Group Transport Analysis of the Core-Reflector Problem in Fast Reactor Cores via Equivalent Group Condensation and Local/Global Iteration

    International Nuclear Information System (INIS)

    Won, Jong Hyuck; Cho, Nam Zin

    2011-01-01

    In deterministic neutron transport methods, a process called fine-group to few-group condensation is used to reduce the computational burden. However, recent results on the core-reflector problem in fast reactor cores show that use of a small number of energy groups has limitation to describe neutron flux around core reflector interface. Therefore, researches are still ongoing to overcome this limitation. Recently, the authors proposed I) direct application of equivalently condensed angle-dependent total cross section to discrete ordinates method to overcome the limitation of conventional multi-group approximations, and II) local/global iteration framework in which fine-group discrete ordinates calculation is used in local problems while few-group transport calculation is used in the global problem iteratively. In this paper, an analysis of the core-reflector problem is performed in few-group structure using equivalent angle-dependent total cross section with local/global iteration. Numerical results are obtained under S 12 discrete ordinates-like transport method with scattering cross section up to P1 Legendre expansion

  17. Hidden conic quadratic representation of some nonconvex quadratic optimization problems

    NARCIS (Netherlands)

    Ben-Tal, A.; den Hertog, D.

    The problem of minimizing a quadratic objective function subject to one or two quadratic constraints is known to have a hidden convexity property, even when the quadratic forms are indefinite. The equivalent convex problem is a semidefinite one, and the equivalence is based on the celebrated

  18. The linear ordering problem: an algorithm for the optimal solution ...

    African Journals Online (AJOL)

    In this paper we describe and implement an algorithm for the exact solution of the Linear Ordering problem. Linear Ordering is the problem of finding a linear order of the nodes of a graph such that the sum of the weights which are consistent with this order is as large as possible. It is an NP - Hard combinatorial optimisation ...

  19. Features for Exploiting Black-Box Optimization Problem Structure

    DEFF Research Database (Denmark)

    Tierney, Kevin; Malitsky, Yuri; Abell, Tinus

    2013-01-01

    landscape of BBO problems and show how an algorithm portfolio approach can exploit these general, problem indepen- dent features and outperform the utilization of any single minimization search strategy. We test our methodology on data from the GECCO Workshop on BBO Benchmarking 2012, which contains 21...

  20. Robust optimization methods for chance constrained, simulation-based, and bilevel problems

    NARCIS (Netherlands)

    Yanikoglu, I.

    2014-01-01

    The objective of robust optimization is to find solutions that are immune to the uncertainty of the parameters in a mathematical optimization problem. It requires that the constraints of a given problem should be satisfied for all realizations of the uncertain parameters in a so-called uncertainty

  1. Relationship between Maximum Principle and Dynamic Programming for Stochastic Recursive Optimal Control Problems and Applications

    Directory of Open Access Journals (Sweden)

    Jingtao Shi

    2013-01-01

    Full Text Available This paper is concerned with the relationship between maximum principle and dynamic programming for stochastic recursive optimal control problems. Under certain differentiability conditions, relations among the adjoint processes, the generalized Hamiltonian function, and the value function are given. A linear quadratic recursive utility portfolio optimization problem in the financial engineering is discussed as an explicitly illustrated example of the main result.

  2. Topology optimization of bounded acoustic problems using the hybrid finite element-wave based method

    DEFF Research Database (Denmark)

    Goo, Seongyeol; Wang, Semyung; Kook, Junghwan

    2017-01-01

    This paper presents an alternative topology optimization method for bounded acoustic problems that uses the hybrid finite element-wave based method (FE-WBM). The conventional method for the topology optimization of bounded acoustic problems is based on the finite element method (FEM), which...

  3. Vector-valued measure and the necessary conditions for the optimal control problems of linear systems

    International Nuclear Information System (INIS)

    Xunjing, L.

    1981-12-01

    The vector-valued measure defined by the well-posed linear boundary value problems is discussed. The maximum principle of the optimal control problem with non-convex constraint is proved by using the vector-valued measure. Especially, the necessary conditions of the optimal control of elliptic systems is derived without the convexity of the control domain and the cost function. (author)

  4. Optimal Stopping Problems Driven by Lévy Processes and Pasting Principles

    NARCIS (Netherlands)

    Surya, B.A.

    2007-01-01

    Solving optimal stopping problems driven by Lévy processes has been a challenging task and has found many applications in modern theory of mathematical finance. For example situations in which optimal stopping typically arise include the problem of finding the arbitrage-free price of the American

  5. Optimization methods for the Train Unit Shunting Problem

    DEFF Research Database (Denmark)

    Haahr, Jørgen Thorlund; Lusby, Richard Martin; Wagenaar, Joris Camiel

    2017-01-01

    We consider the Train Unit Shunting Problem, an important planning problem for passenger railway operators. This problem entails assigning train units from shunting yards to scheduled train services in such a way that the resulting operations are without conflicts. The problem arises at every...... shunting yard in the railway network and involves matching train units to arriving and departing train services as well as assigning the selected matchings to appropriate shunting yard tracks. We present an extensive comparison benchmark of multiple solution approaches for this problem, some of which...... are novel. In particular, we develop a constraint programming formulation, a column generation approach, and a randomized greedy heuristic. We compare and benchmark these approaches with two existing methods, a mixed integer linear program and a two-stage heuristic. The benchmark contains multiple real...

  6. Convex optimization problem prototyping for image reconstruction in computed tomography with the Chambolle–Pock algorithm

    DEFF Research Database (Denmark)

    Sidky, Emil Y.; Jørgensen, Jakob Heide; Pan, Xiaochuan

    2012-01-01

    The primal–dual optimization algorithm developed in Chambolle and Pock (CP) (2011 J. Math. Imag. Vis. 40 1–26) is applied to various convex optimization problems of interest in computed tomography (CT) image reconstruction. This algorithm allows for rapid prototyping of optimization problems...... for the purpose of designing iterative image reconstruction algorithms for CT. The primal–dual algorithm is briefly summarized in this paper, and its potential for prototyping is demonstrated by explicitly deriving CP algorithm instances for many optimization problems relevant to CT. An example application...

  7. On the Lasserre hierarchy of semidefinite programming relaxations of convex polynomial optimization problems

    NARCIS (Netherlands)

    de Klerk, E.; Laurent, M.

    2011-01-01

    The Lasserre hierarchy of semidefinite programming approximations to convex polynomial optimization problems is known to converge finitely under some assumptions. [J. B. Lasserre, Convexity in semialgebraic geometry and polynomial optimization, SIAM J. Optim., 19 (2009), pp. 1995–2014]. We give a

  8. Newton-type method for the variational discretization of topology optimization problems

    DEFF Research Database (Denmark)

    Evgrafov, Anton

    2013-01-01

    We present a locally quadratically convergent optimization algorithm for solving topology optimization problems. The distinguishing feature of the algorithm is to treat the design as a smooth function of the state and not vice versa as in the traditional nested approach to topology optimization, ...

  9. An interpretation of the Gini coefficient in a Stiglitz two-type optimal tax problem

    DEFF Research Database (Denmark)

    Rasmussen, Bo Sandemann

    2015-01-01

    In a two-type Stiglitz (1982) model of optimal non-linear taxation it is shown that when the utility function relating to consumption is logaritmic the shadow price of the incentive constraint relating to the optimal tax problem exactly equals the Gini coefficient of the second-best optimal income...

  10. Performance comparison of genetic algorithms and particle swarm optimization for model integer programming bus timetabling problem

    Science.gov (United States)

    Wihartiko, F. D.; Wijayanti, H.; Virgantari, F.

    2018-03-01

    Genetic Algorithm (GA) is a common algorithm used to solve optimization problems with artificial intelligence approach. Similarly, the Particle Swarm Optimization (PSO) algorithm. Both algorithms have different advantages and disadvantages when applied to the case of optimization of the Model Integer Programming for Bus Timetabling Problem (MIPBTP), where in the case of MIPBTP will be found the optimal number of trips confronted with various constraints. The comparison results show that the PSO algorithm is superior in terms of complexity, accuracy, iteration and program simplicity in finding the optimal solution.

  11. Optimal improvement of graphs related to nuclear safeguards problems

    International Nuclear Information System (INIS)

    Jacobsen, S.E.

    1977-08-01

    This report develops the methodology for optimally improving graphs related to nuclear safeguards issues. In particular, given a fixed number of dollars, the report provides a method for optimally allocating such dollars over the arcs of a weighted graph (the weights vary as a function of dollars spent on arcs) so as to improve the system effectiveness measure which is the shortest of all shortest paths to several targets. Arc weights can be either clock times or detection probabilities and the algorithm does not explicitly consider all paths to the targets

  12. Optimal resampling for the noisy OneMax problem

    OpenAIRE

    Liu, Jialin; Fairbank, Michael; Pérez-Liébana, Diego; Lucas, Simon M.

    2016-01-01

    The OneMax problem is a standard benchmark optimisation problem for a binary search space. Recent work on applying a Bandit-Based Random Mutation Hill-Climbing algorithm to the noisy OneMax Problem showed that it is important to choose a good value for the resampling number to make a careful trade off between taking more samples in order to reduce noise, and taking fewer samples to reduce the total computational cost. This paper extends that observation, by deriving an analytical expression f...

  13. Particle Swarm Optimization applied to combinatorial problem aiming the fuel recharge problem solution in a nuclear reactor

    International Nuclear Information System (INIS)

    Meneses, Anderson Alvarenga de Moura; Schirru, Roberto

    2005-01-01

    This work focuses on the usage the Artificial Intelligence technique Particle Swarm Optimization (PSO) to optimize the fuel recharge at a nuclear reactor. This is a combinatorial problem, in which the search of the best feasible solution is done by minimizing a specific objective function. However, in this first moment it is possible to compare the fuel recharge problem with the Traveling Salesman Problem (TSP), since both of them are combinatorial, with one advantage: the evaluation of the TSP objective function is much more simple. Thus, the proposed methods have been applied to two TSPs: Oliver 30 and Rykel 48. In 1995, KENNEDY and EBERHART presented the PSO technique to optimize non-linear continued functions. Recently some PSO models for discrete search spaces have been developed for combinatorial optimization. Although all of them having different formulation from the ones presented here. In this paper, we use the PSO theory associated with to the Random Keys (RK)model, used in some optimizations with Genetic Algorithms. The Particle Swarm Optimization with Random Keys (PSORK) results from this association, which combines PSO and RK. The adaptations and changings in the PSO aim to allow the usage of the PSO at the nuclear fuel recharge. This work shows the PSORK being applied to the proposed combinatorial problem and the obtained results. (author)

  14. Efficient exact optimization of multi-objective redundancy allocation problems in series-parallel systems

    International Nuclear Information System (INIS)

    Cao, Dingzhou; Murat, Alper; Chinnam, Ratna Babu

    2013-01-01

    This paper proposes a decomposition-based approach to exactly solve the multi-objective Redundancy Allocation Problem for series-parallel systems. Redundancy allocation problem is a form of reliability optimization and has been the subject of many prior studies. The majority of these earlier studies treat redundancy allocation problem as a single objective problem maximizing the system reliability or minimizing the cost given certain constraints. The few studies that treated redundancy allocation problem as a multi-objective optimization problem relied on meta-heuristic solution approaches. However, meta-heuristic approaches have significant limitations: they do not guarantee that Pareto points are optimal and, more importantly, they may not identify all the Pareto-optimal points. In this paper, we treat redundancy allocation problem as a multi-objective problem, as is typical in practice. We decompose the original problem into several multi-objective sub-problems, efficiently and exactly solve sub-problems, and then systematically combine the solutions. The decomposition-based approach can efficiently generate all the Pareto-optimal solutions for redundancy allocation problems. Experimental results demonstrate the effectiveness and efficiency of the proposed method over meta-heuristic methods on a numerical example taken from the literature.

  15. Optimization of travel salesman problem using the ant colony system and Greedy search

    International Nuclear Information System (INIS)

    Esquivel E, J.; Ordonez A, A.; Ortiz S, J. J.

    2008-01-01

    In this paper we present some results obtained during the development of optimization systems that can be used to design refueling and patterns of control rods in a BWR. These systems use ant colonies and Greedy search. The first phase of this project is to be familiar with these optimization techniques applied to the problem of travel salesman problem (TSP). The utility of TSP study is that, like the refueling design and pattern design of control rods are problems of combinative optimization. Even, the similarity with the problem of the refueling design is remarkable. It is presented some results for the TSP with the 32 state capitals of Mexico country. (Author)

  16. Optimal Component Lumping: problem formulation and solution techniques

    DEFF Research Database (Denmark)

    Lin, Bao; Leibovici, Claude F.; Jørgensen, Sten Bay

    2008-01-01

    This paper presents a systematic method for optimal lumping of a large number of components in order to minimize the loss of information. In principle, a rigorous composition-based model is preferable to describe a system accurately. However, computational intensity and numerical issues restrict ...

  17. Optimization of the variational basis in the three body problem

    International Nuclear Information System (INIS)

    Simenog, I.V.; Pushkash, O.M.; Bestuzheva, A.B.

    1995-01-01

    The procedure of variational oscillator basis optimization is proposed to the calculation the energy spectra of three body systems. The hierarchy of basis functions is derived and energies of ground and excited states for three gravitating particles is obtained with high accuracy. 12 refs

  18. Isogeometric Shape Optimization for Quasi-static and Transient Problems

    NARCIS (Netherlands)

    Wang, Z.P.

    2016-01-01

    The recently developed isogeometric analysis (IGA) was aimed, from the start, at integrating computer aided design (CAD) and analysis. This synthesis of geometry and analysis has naturally led to renewed interest in developing structural shape optimization. The advantages of using isogeometric

  19. Optimal infrastructure maintenance scheduling problem under budget uncertainty.

    Science.gov (United States)

    2010-05-01

    This research addresses a general class of infrastructure asset management problems. Infrastructure : agencies usually face budget uncertainties that will eventually lead to suboptimal planning if : maintenance decisions are made without taking the u...

  20. Stability, pseudostability and quasistability of vector trajectorial lexicographic optimization problem

    Directory of Open Access Journals (Sweden)

    R. Berdysheva

    1998-03-01

    Full Text Available Lower bounds of stability, pseudostability and quasistability radii of lexicographic set in vector combinatorial problem on systems of subsets of finite set with partial criteria of more general kinds have been found.

  1. Optimization of radially heterogeneous 1000-MW(e) LMFBR core configurations. Design and performance of reference cores. Research project 620-25

    International Nuclear Information System (INIS)

    Barthold, W.P.; Orechwa, Y.; Su, S.F.; Hutter, E.; Batch, R.V.; Beitel, J.C.; Turski, R.B.; Lam, P.S.K.

    1979-11-01

    A parameter study was conducted to determine the interrelated effects of: loosely of tightly coupled fuel regions separated by internal blanket assemblies, number of fuel regions, core height, number and arrangement of internal blanket subassemblies, number and size of fuel pins in a subassembly, etc. The effects of these parameters on sodium void reactivity, Doppler, incoherence, breeding gain, and thermohydraulics were of prime interest. Trends were established and ground work laid for optimization of a large, radially-heterogeneous, LMFBR core that will have low energetics in an HCDA and will have good thermal and breeding performance

  2. Optimization Using Simulation of the Vehicle Routing Problem

    OpenAIRE

    Nayera E. El-Gharably; Khaled S. El-Kilany; Aziz E. El-Sayed

    2013-01-01

    A key element of many distribution systems is the routing and scheduling of vehicles servicing a set of customers. A wide variety of exact and approximate algorithms have been proposed for solving the vehicle routing problems (VRP). Exact algorithms can only solve relatively small problems of VRP, which is classified as NP-Hard. Several approximate algorithms have proven successful in finding a feasible solution not necessarily optimum. Although different parts of the pro...

  3. Application of Fuzzy Optimization to the Orienteering Problem

    Directory of Open Access Journals (Sweden)

    Madhushi Verma

    2015-01-01

    Full Text Available This paper deals with the orienteering problem (OP which is a combination of two well-known problems (i.e., travelling salesman problem and the knapsack problem. OP is an NP-hard problem and is useful in appropriately modeling several challenging applications. As the parameters involved in these applications cannot be measured precisely, depicting them using crisp numbers is unrealistic. Further, the decision maker may be satisfied with graded satisfaction levels of solutions, which cannot be formulated using a crisp program. To deal with the above-stated two issues, we formulate the fuzzy orienteering problem (FOP and provide a method to solve it. Here we state the two necessary conditions of OP of maximizing the total collected score and minimizing the time taken to traverse a path (within the specified time bound as fuzzy goals and the remaining necessary conditions as crisp constraints. Using the max-min formulation of the fuzzy sets obtained from the fuzzy goals, we calculate the fuzzy decision sets (Z and Z∗ that contain the feasible paths and the desirable paths, respectively, along with the degrees to which they are acceptable. To efficiently solve large instances of FOP, we also present a parallel algorithm on CREW PRAM model.

  4. Simple heuristics: A bridge between manual core design and automated optimization methods

    International Nuclear Information System (INIS)

    White, J.R.; Delmolino, P.M.

    1993-01-01

    The primary function of RESCUE is to serve as an aid in the analysis and identification of feasible loading patterns for LWR reload cores. The unique feature of RESCUE is that its physics model is based on some recent advances in generalized perturbation theory (GPT) methods. The high order GPT techniques offer the accuracy, computational efficiency, and flexibility needed for the implementation of a full range of capabilities within a set of compatible interactive (manual and semi-automated) and automated design tools. The basic design philosophy and current features within RESCUE are reviewed, and the new semi-automated capability is highlighted. The online advisor facility appears quite promising and it provides a natural bridge between the traditional trial-and-error manual process and the recent progress towards fully automated optimization sequences. (orig.)

  5. Optimization approaches for treating nuclear power plant problems

    International Nuclear Information System (INIS)

    Abdelgoad, A.S.A.

    2012-01-01

    Electricity generation is the process of generating electric energy from other forms of energy. There are many technologies that can be and are used to generate electricity. One of these technologies is the nuclear power. A nuclear power plant (NPP) is a thermal power station in which the heat source is one or more nuclear reactors. As in a conventional thermal power station the heat is used to generate steam which drives a steam turbine connected to a generator which produces electricity. As of February 2nd, 2012, there were 439 nuclear power plants in operation through the world. NPP are usually considered to be base load stations, which are best suited to constant power output. The thesis consists of five chapters: Chapter I presents a survey on some important concepts of the NPP problems. Chapter II introduces the economic future of nuclear power. It presents nuclear energy scenarios beyond 2015, market potential for electricity generation to 2030 and economics of new plant construction. Chapter III presents a reliability centered problem of power plant preventive maintenance scheduling. NPP preventive maintenance scheduling problem with fuzzy parameters in the constraints is solved. A case study is provided to demonstrate the efficiency of proposed model. A comparison study between the deterministic case and fuzzy case for the problem of concern is carried out. Chapter IV introduces a fuzzy approach to the generation expansion planning problem (GEP) in a multiobjective environment. The GEP problem as an integer programming model with fuzzy parameters in the constraints is formulated. A parametric study is carried out for the GEP problem. A case study is provided to demonstrate the efficiency of our proposed model. A comparison study between our approach and the deterministic one is made. Chapter V is concerned with the conclusions arrived in carrying out this thesis and gives some suggestions for further research.

  6. A note on fixed point optimality criteria for the location problem with arbitrary norms: Reply

    DEFF Research Database (Denmark)

    Juel, Henrik; Love, Robert F.

    1983-01-01

    The single-facility location problem in continuous space is considered, with distances given by arbitrary norms. When distances are Euclidean, for many practical problems the optimal location of the new facility coincides with one of the existing facilities. This property carries over to problems...... with generalized distances. In this paper a necessary and sufficient condition for the location of an existing facility to be the optimal location of the new facility is developed. Some computational examples using the condition are given....

  7. MULTI-CRITERIA PROGRAMMING METHODS AND PRODUCTION PLAN OPTIMIZATION PROBLEM SOLVING IN METAL INDUSTRY

    OpenAIRE

    Tunjo Perić; Željko Mandić

    2017-01-01

    This paper presents the production plan optimization in the metal industry considered as a multi-criteria programming problem. We first provided the definition of the multi-criteria programming problem and classification of the multicriteria programming methods. Then we applied two multi-criteria programming methods (the STEM method and the PROMETHEE method) in solving a problem of multi-criteria optimization production plan in a company from the metal industry. The obtained resul...

  8. Solving dominance and potential optimality in imprecise multi-attribute additive problems

    International Nuclear Information System (INIS)

    Mateos, Alfonso; Jimenez, Antonio; Rios-Insua, Sixto

    2003-01-01

    We consider the multicriteria decision-making problem where there is partial information on decision maker preferences, represented by means of an imprecise multiattribute additive utility function, and where the consequences of the alternatives or strategies are also possibly imprecise. Under these circumstances we consider how useful problem-solving concepts, namely nondominated, potentially optimal, adjacent potentially optimal alternatives, can be analytically computed. Thus, the problem can be solved much more efficiently using the classical methodology of linear programming

  9. Accumulating Data to Optimally Predict Obesity Treatment (ADOPT) Core Measures: Behavioral Domain.

    Science.gov (United States)

    Lytle, Leslie A; Nicastro, Holly L; Roberts, Susan B; Evans, Mary; Jakicic, John M; Laposky, Aaron D; Loria, Catherine M

    2018-04-01

    The ability to identify and measure behaviors that are related to weight loss and the prevention of weight regain is crucial to understanding the variability in response to obesity treatment and the development of tailored treatments. The overarching goal of the Accumulating Data to Optimally Predict obesity Treatment (ADOPT) Core Measures Project is to provide obesity researchers with guidance on a set of constructs and measures that are related to weight control and that span and integrate obesity-related behavioral, biological, environmental, and psychosocial domains. This article describes how the behavioral domain subgroup identified the initial list of high-priority constructs and measures to be included, and it describes practical considerations for assessing the following four behavioral areas: eating, activity, sleep, and self-monitoring of weight. Challenges and considerations for advancing the science related to weight loss and maintenance behaviors are also discussed. Assessing a set of core behavioral measures in combination with those from other ADOPT domains is critical to improve our understanding of individual variability in response to adult obesity treatment. The selection of behavioral measures is based on the current science, although there continues to be much work needed in this field. © 2018 The Obesity Society.

  10. Out-of-core nuclear fuel cycle economic optimization for nonequilibrium cycles

    International Nuclear Information System (INIS)

    Comes, S.A.

    1987-01-01

    A methodology and associated computer code was developed to determine near-optimum out-of-core fuel management strategies. The code, named OCEON (Out-of-Core Economic OptimizationN), identified feed-region sizes and enrichments, and partially burned fuel-reload strategies for each cycle of a multi-cycle planning horizon, subject to cycle-energy requirements and constraints on feed enrichments, discharge burnups, and the moderator temperature coefficient. A zero-dimensional reactor physics model, enhanced by a linear reactivity model to provide batch power shares, performs the initial feed enrichment, burnup and constraint evaluations, while a two-dimensional, nodal code is used to refine the calculations for the final solutions. The economic calculations are performed rapidly using an annuity-factor-based model. Use of Monte Carlo integer programming to select the optimum solutions allows for the determination of a family of near-optimum solutions, from which engineering judgment may be used to select an appropriate strategy. Results from various nonequilibrium cycle energy requirement cases typically show a large number of low-cost solutions near the optimum. This confirms that the Monte Carlo integer programming approach of generating a family of solutions will be most useful for selecting optimum strategies when other considerations, such as incore loading pattern concerns, must be addressed

  11. Optimal Experimental Design for Large-Scale Bayesian Inverse Problems

    KAUST Repository

    Ghattas, Omar

    2014-01-06

    We develop a Bayesian framework for the optimal experimental design of the shock tube experiments which are being carried out at the KAUST Clean Combustion Research Center. The unknown parameters are the pre-exponential parameters and the activation energies in the reaction rate expressions. The control parameters are the initial mixture composition and the temperature. The approach is based on first building a polynomial based surrogate model for the observables relevant to the shock tube experiments. Based on these surrogates, a novel MAP based approach is used to estimate the expected information gain in the proposed experiments, and to select the best experimental set-ups yielding the optimal expected information gains. The validity of the approach is tested using synthetic data generated by sampling the PC surrogate. We finally outline a methodology for validation using actual laboratory experiments, and extending experimental design methodology to the cases where the control parameters are noisy.

  12. Nonlinear Chance Constrained Problems: Optimality Conditions, Regularization and Solvers

    Czech Academy of Sciences Publication Activity Database

    Adam, Lukáš; Branda, Martin

    2016-01-01

    Roč. 170, č. 2 (2016), s. 419-436 ISSN 0022-3239 R&D Projects: GA ČR GA15-00735S Institutional support: RVO:67985556 Keywords : Chance constrained programming * Optimality conditions * Regularization * Algorithms * Free MATLAB codes Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 1.289, year: 2016 http://library.utia.cas.cz/separaty/2016/MTR/adam-0460909.pdf

  13. Problem statement for optimal design of steel structures

    OpenAIRE

    Ginzburg Aleksandr Vital'evich; Vasil'kin Andrey Aleksandrovich

    2014-01-01

    The presented article considers the following complex of tasks. The main stages of the life cycle of a building construction with the indication of process entrance and process exit are described. Requirements imposed on steel constructions are considered. The optimum range of application for steel designs is specified, as well as merits and demerits of a design material. The nomenclature of metal designs is listed - the block diagram is constructed. Possible optimality criteria of steel desi...

  14. A program package for solving linear optimization problems

    International Nuclear Information System (INIS)

    Horikami, Kunihiko; Fujimura, Toichiro; Nakahara, Yasuaki

    1980-09-01

    Seven computer programs for the solution of linear, integer and quadratic programming (four programs for linear programming, one for integer programming and two for quadratic programming) have been prepared and tested on FACOM M200 computer, and auxiliary programs have been written to make it easy to use the optimization program package. The characteristics of each program are explained and the detailed input/output descriptions are given in order to let users know how to use them. (author)

  15. Optimality Conditions for Nondifferentiable Multiobjective Semi-Infinite Programming Problems

    Directory of Open Access Journals (Sweden)

    D. Barilla

    2016-01-01

    Full Text Available We have considered a multiobjective semi-infinite programming problem with a feasible set defined by inequality constraints. First we studied a Fritz-John type necessary condition. Then, we introduced two constraint qualifications and derive the weak and strong Karush-Kuhn-Tucker (KKT in brief types necessary conditions for an efficient solution of the considered problem. Finally an extension of a Caristi-Ferrara-Stefanescu result for the (Φ,ρ-invexity is proved, and some sufficient conditions are presented under this weak assumption. All results are given in terms of Clark subdifferential.

  16. Heterogeneous quantum computing for satellite constellation optimization: solving the weighted k-clique problem

    Science.gov (United States)

    Bass, Gideon; Tomlin, Casey; Kumar, Vaibhaw; Rihaczek, Pete; Dulny, Joseph, III

    2018-04-01

    NP-hard optimization problems scale very rapidly with problem size, becoming unsolvable with brute force methods, even with supercomputing resources. Typically, such problems have been approximated with heuristics. However, these methods still take a long time and are not guaranteed to find an optimal solution. Quantum computing offers the possibility of producing significant speed-up and improved solution quality. Current quantum annealing (QA) devices are designed to solve difficult optimization problems, but they are limited by hardware size and qubit connectivity restrictions. We present a novel heterogeneous computing stack that combines QA and classical machine learning, allowing the use of QA on problems larger than the hardware limits of the quantum device. These results represent experiments on a real-world problem represented by the weighted k-clique problem. Through this experiment, we provide insight into the state of quantum machine learning.

  17. Discrete bat algorithm for optimal problem of permutation flow shop scheduling.

    Science.gov (United States)

    Luo, Qifang; Zhou, Yongquan; Xie, Jian; Ma, Mingzhi; Li, Liangliang

    2014-01-01

    A discrete bat algorithm (DBA) is proposed for optimal permutation flow shop scheduling problem (PFSP). Firstly, the discrete bat algorithm is constructed based on the idea of basic bat algorithm, which divide whole scheduling problem into many subscheduling problems and then NEH heuristic be introduced to solve subscheduling problem. Secondly, some subsequences are operated with certain probability in the pulse emission and loudness phases. An intensive virtual population neighborhood search is integrated into the discrete bat algorithm to further improve the performance. Finally, the experimental results show the suitability and efficiency of the present discrete bat algorithm for optimal permutation flow shop scheduling problem.

  18. Discrete Bat Algorithm for Optimal Problem of Permutation Flow Shop Scheduling

    Science.gov (United States)

    Luo, Qifang; Zhou, Yongquan; Xie, Jian; Ma, Mingzhi; Li, Liangliang

    2014-01-01

    A discrete bat algorithm (DBA) is proposed for optimal permutation flow shop scheduling problem (PFSP). Firstly, the discrete bat algorithm is constructed based on the idea of basic bat algorithm, which divide whole scheduling problem into many subscheduling problems and then NEH heuristic be introduced to solve subscheduling problem. Secondly, some subsequences are operated with certain probability in the pulse emission and loudness phases. An intensive virtual population neighborhood search is integrated into the discrete bat algorithm to further improve the performance. Finally, the experimental results show the suitability and efficiency of the present discrete bat algorithm for optimal permutation flow shop scheduling problem. PMID:25243220

  19. Multiphysics field analysis and multiobjective design optimization: a benchmark problem

    Czech Academy of Sciences Publication Activity Database

    di Barba, P.; Doležel, Ivo; Karban, P.; Kůs, P.; Mach, F.; Mognaschi, M. E.; Savini, A.

    2014-01-01

    Roč. 22, č. 7 (2014), s. 1214-1225 ISSN 1741-5977 R&D Projects: GA ČR(CZ) GAP102/11/0498 Institutional support: RVO:61388998 Keywords : coupled-field problems * finite-element analysis * hp-FEM adaptation Subject RIV: JA - Electronics ; Optoelectronics, Electrical Engineering Impact factor: 0.868, year: 2014

  20. Two-stage optimization in a transportation problem

    CSIR Research Space (South Africa)

    Stewart, TJ

    1979-01-01

    Full Text Available A study of the economic distribution of maize throughout South Africa is reported. Although the problem of minimizing total transportation costs in such a situation is a classical one, and its solution is well known, there was in this case a high...

  1. An inverse heat transfer problem for optimization of the thermal ...

    Indian Academy of Sciences (India)

    This paper takes a different approach towards identification of the thermal process in machining, using inverse heat transfer problem. Inverse heat transfer method allows the closest possible experimental and analytical approximation of thermal state for a machining process. Based on a temperature measured at any point ...

  2. An optimization algorithm for a capacitated vehicle routing problem ...

    Indian Academy of Sciences (India)

    In this paper, vehicle routing problem (VRP) with time windows and real world constraints are considered as a real-world application on google maps. Also, tabu search is used and Hopfield neural networks is utilized. Basic constraints consist of customer demands, time windows, vehicle speed, vehicle capacity andworking ...

  3. An inverse heat transfer problem for optimization of the thermal ...

    Indian Academy of Sciences (India)

    Department of Production Engineering, Faculty of Technical Science, ... ductivity of manufacturing and high levels of machining quality and accuracy, are the most ... inverse problems are today successfully applied in identification, design, control and optimiza- ...... of Machine Tools and Manufacture, 35(5): 751–760.

  4. A Bayesian look at the optimal track labelling problem

    NARCIS (Netherlands)

    Aoki, E.H.; Boers, Y.; Svensson, L.; Mandal, Pranab K.; Bagchi, Arunabha

    In multi-target tracking (MTT), the problem of assigning labels to tracks (track labelling) is vastly covered in literature, but its exact mathematical formulation, in terms of Bayesian statistics, has not been yet looked at in detail. Doing so, however, may help us to understand how (and when)

  5. A Generalized Orienteering Problem for Optimal Search and Interdiction Planning

    Science.gov (United States)

    2013-09-01

    proposed for the TOP. Boussier et al. (2007) presents a branch-and- price algorithm that relies on a pricing step within the column generation phase...dominates in all metric categories and B&B appears to be the least favorable. We use performance proles ( Dolan and Moré 2002) as a method for comparing...exceeded, with greater computing power it may be possible to obtain the optimal solution in a period of time that can support a 24-hour planning

  6. Optimization and Reliability Problems in Structural Design of Wind Turbines

    DEFF Research Database (Denmark)

    Sørensen, John Dalsgaard

    2007-01-01

    are discussed. Limit state equations are presented for fatigue limit states and for ultimate limit states with extreme wind load, and illustrated by bending failure. Illustrative examples are presented, and as a part of the results optimal reliability levels are obtained which corresponds to an annual...... reliability index equal to 3. An example with fatigue failure indicates that the reliability level is almost the same for single wind turbines and for wind turbines in wind farms if the wake effects are modeled equivalently in the design equation and the limit state equation....

  7. Free terminal time optimal control problem of an HIV model based on a conjugate gradient method.

    Science.gov (United States)

    Jang, Taesoo; Kwon, Hee-Dae; Lee, Jeehyun

    2011-10-01

    The minimum duration of treatment periods and the optimal multidrug therapy for human immunodeficiency virus (HIV) type 1 infection are considered. We formulate an optimal tracking problem, attempting to drive the states of the model to a "healthy" steady state in which the viral load is low and the immune response is strong. We study an optimal time frame as well as HIV therapeutic strategies by analyzing the free terminal time optimal tracking control problem. The minimum duration of treatment periods and the optimal multidrug therapy are found by solving the corresponding optimality systems with the additional transversality condition for the terminal time. We demonstrate by numerical simulations that the optimal dynamic multidrug therapy can lead to the long-term control of HIV by the strong immune response after discontinuation of therapy.

  8. Modeling of the Maximum Entropy Problem as an Optimal Control Problem and its Application to Pdf Estimation of Electricity Price

    Directory of Open Access Journals (Sweden)

    M. E. Haji Abadi

    2013-09-01

    Full Text Available In this paper, the continuous optimal control theory is used to model and solve the maximum entropy problem for a continuous random variable. The maximum entropy principle provides a method to obtain least-biased probability density function (Pdf estimation. In this paper, to find a closed form solution for the maximum entropy problem with any number of moment constraints, the entropy is considered as a functional measure and the moment constraints are considered as the state equations. Therefore, the Pdf estimation problem can be reformulated as the optimal control problem. Finally, the proposed method is applied to estimate the Pdf of the hourly electricity prices of New England and Ontario electricity markets. Obtained results show the efficiency of the proposed method.

  9. Optimal design for crosstalk analysis in 12-core 5-LP mode homogeneous multicore fiber for different lattice structure

    Science.gov (United States)

    Kumar, Dablu; Ranjan, Rakesh

    2018-03-01

    12-Core 5-LP mode homogeneous multicore fibers have been proposed for analysis of inter-core crosstalk and dispersion, with four different lattice structures (circular, 2-ring, square lattice, and triangular lattice) having cladding diameter of 200 μm and a fixed cladding thickness of 35 μm. The core-to-core crosstalk impact has been studied numerically with respect to bending radius, core pitch, transmission distance, wavelength, and core diameter for all 5-LP modes. In anticipation of further reduction in crosstalk levels, the trench-assisted cores have been incorporated for all respective designs. Ultra-low crosstalk (-138 dB/100 km) has been achieved through the triangular lattice arrangement, with trench depth Δ2 = -1.40% for fundamental (LP01) mode. It has been noted that the impact of mode polarization on crosstalk behavior is minor, with difference in crosstalk levels between two polarized spatial modes as ≤0.2 dB. Moreover, the optimized cladding diameter has been obtained for all 5-LP modes for a target value of crosstalk of -50 dB/100 km, with all the core arrangements. The dispersion characteristic has also been analyzed with respect to wavelength, which is nearly 2.5 ps/nm km at operating wavelength 1550 nm. The relative core multiplicity factor (RCMF) for the proposed design is obtained as 64.

  10. An Interpretation of the Gini Coefficient in a Stiglitz Two-Type Optimal Tax Problem

    DEFF Research Database (Denmark)

    Rasmussen, Bo Sandemann

    2014-01-01

    In a two-type Stiglitz (1982) model of optimal non-linear taxation it is shown that when the utility function relating to consumption is logaritmic the shadow price of the incentive constraint relating to the optimal tax problem exactly equals the Gini coefficient of the second-best optimal income...... distribution of a utilitarian government. In this sense the optimal degree of income redistribution is determined by the severity of the incentive problem facing the policy-maker. Extensions of the benchmark model to allow for more general functional forms of the utility function and for more than two types...

  11. Global optimization for overall HVAC systems - Part I problem formulation and analysis

    International Nuclear Information System (INIS)

    Lu Lu; Cai Wenjian; Chai, Y.S.; Xie Lihua

    2005-01-01

    This paper presents the global optimization technologies for overall heating, ventilating and air conditioning (HVAC) systems. The objective function of global optimization and constraints are formulated based on mathematical models of the major components. All these models are associated with power consumption components and heat exchangers for transferring cooling load. The characteristics of all the major components are briefly introduced by models, and the interactions between them are analyzed and discussed to show the complications of the problem. According to the characteristics of the operating components, the complicated original optimization problem for overall HVAC systems is transformed and simplified into a compact form ready for optimization

  12. Optimized Core Design and Fuel Management of a Pebble-Bed Type Nuclear Reactor

    International Nuclear Information System (INIS)

    Boer, Brian

    2007-01-01

    reactors, can also be applied to a commercial size reactor. The fuel temperatures of this design remain below the limits, both during nominal operation as well as during anticipated Depressurized Loss Of Forced Coolant (DLOFC) transients. However, it is shown that the fuel temperature during a DLOFC incident will reach the 1600 degrees C limit in a small part of the core after 22 hours without active intervention. Therefore, a further increase of the reactor power to raise the helium outlet temperature is unattractive. A one dimensional visco-elastic stress analysis code (PASTA) has been developed for analysis of mechanical stresses in the coatings of the particle fuel during irradiation. An analysis of the coating stresses in the PBMR design shows that there is sufficient room for an increase in operating temperature with regard to the SiC coating layer stress during nominal operation. An analysis of a VHTR design with increased helium outlet temperature shows that up to an outlet temperature of 1075 degrees C the SiC layer remains in compression during the entire lifetime of the coated particle. It was found that the graphite matrix in which the particles are embedded provides additional compressive stress to the SiC layer and delays the time point at which the compressive stress in this layers turns to tensile. This is beneficial for this main load barer of the particle, which is only expected to fail under high tensile stress. The total number of times that a certain pebble is (re)introduced in the core can be increased to flatten the axial power and the fuel temperature profile. The effect has been analyzed by linking the DALTON-THERMIX code system with fuel depletion analysis calculations using SCALE. For nominal operation a total of six pebble passes is optimal since the peak in the axial power profile in the top region of the core matches the cool helium temperatures in this region. For a DLOFC case, in which the maximum fuel temperature is determined largely by

  13. Optimization of multi-objective integrated process planning and scheduling problem using a priority based optimization algorithm

    Science.gov (United States)

    Ausaf, Muhammad Farhan; Gao, Liang; Li, Xinyu

    2015-12-01

    For increasing the overall performance of modern manufacturing systems, effective integration of process planning and scheduling functions has been an important area of consideration among researchers. Owing to the complexity of handling process planning and scheduling simultaneously, most of the research work has been limited to solving the integrated process planning and scheduling (IPPS) problem for a single objective function. As there are many conflicting objectives when dealing with process planning and scheduling, real world problems cannot be fully captured considering only a single objective for optimization. Therefore considering multi-objective IPPS (MOIPPS) problem is inevitable. Unfortunately, only a handful of research papers are available on solving MOIPPS problem. In this paper, an optimization algorithm for solving MOIPPS problem is presented. The proposed algorithm uses a set of dispatching rules coupled with priority assignment to optimize the IPPS problem for various objectives like makespan, total machine load, total tardiness, etc. A fixed sized external archive coupled with a crowding distance mechanism is used to store and maintain the non-dominated solutions. To compare the results with other algorithms, a C-matric based method has been used. Instances from four recent papers have been solved to demonstrate the effectiveness of the proposed algorithm. The experimental results show that the proposed method is an efficient approach for solving the MOIPPS problem.

  14. Asymptotic Method of Solution for a Problem of Construction of Optimal Gas-Lift Process Modes

    Directory of Open Access Journals (Sweden)

    Fikrat A. Aliev

    2010-01-01

    Full Text Available Mathematical model in oil extraction by gas-lift method for the case when the reciprocal value of well's depth represents a small parameter is considered. Problem of optimal mode construction (i.e., construction of optimal program trajectories and controls is reduced to the linear-quadratic optimal control problem with a small parameter. Analytic formulae for determining the solutions at the first-order approximation with respect to the small parameter are obtained. Comparison of the obtained results with known ones on a specific example is provided, which makes it, in particular, possible to use obtained results in realizations of oil extraction problems by gas-lift method.

  15. An L∞/L1-Constrained Quadratic Optimization Problem with Applications to Neural Networks

    International Nuclear Information System (INIS)

    Leizarowitz, Arie; Rubinstein, Jacob

    2003-01-01

    Pattern formation in associative neural networks is related to a quadratic optimization problem. Biological considerations imply that the functional is constrained in the L ∞ norm and in the L 1 norm. We consider such optimization problems. We derive the Euler-Lagrange equations, and construct basic properties of the maximizers. We study in some detail the case where the kernel of the quadratic functional is finite-dimensional. In this case the optimization problem can be fully characterized by the geometry of a certain convex and compact finite-dimensional set

  16. Problems of future energy market planning and optimization

    International Nuclear Information System (INIS)

    Lelek, V.; Jaluvka, D.

    2007-01-01

    Probable development of energy market is described in the article and special attention is devoted to the nuclear energy, which not only consume, but also produce raw material and how to proceed to avoid crises in supply. Problems of future energy supply of heat, liquid fuel, electricity are described. Expected effect will be jump in prices or regulated supply to equalize supply and use. It can completely change our standard consideration of profit

  17. Optimal calculational schemes for solving multigroup photon transport problem

    International Nuclear Information System (INIS)

    Dubinin, A.A.; Kurachenko, Yu.A.

    1987-01-01

    A scheme of complex algorithm for solving multigroup equation of radiation transport is suggested. The algorithm is based on using the method of successive collisions, the method of forward scattering and the spherical harmonics method, and is realized in the FORAP program (FORTRAN, BESM-6 computer). As an example the results of calculating reactor photon transport in water are presented. The considered algorithm being modified may be used for solving neutron transport problems

  18. Ant Colony Optimization ACO For The Traveling Salesman Problem TSP Using Partitioning

    Directory of Open Access Journals (Sweden)

    Alok Bajpai

    2015-08-01

    Full Text Available Abstract An ant colony optimization is a technique which was introduced in 1990s and which can be applied to a variety of discrete combinatorial optimization problem and to continuous optimization. The ACO algorithm is simulated with the foraging behavior of the real ants to find the incremental solution constructions and to realize a pheromone laying-and-following mechanism. This pheromone is the indirect communication among the ants. In this paper we introduces the partitioning technique based on the divide and conquer strategy for the traveling salesman problem which is one of the most important combinatorial problem in which the original problem is partitioned into the group of sub problems. And then we apply the ant colony algorithm using candidate list strategy for each smaller sub problems. After that by applying the local optimization and combining the sub problems to find the good solution for the original problem by improving the exploration efficiency of the ants. At the end of this paper we have also be presented the comparison of result with the normal ant colony system for finding the optimal solution to the traveling salesman problem.

  19. Heuristic rules embedded genetic algorithm to solve VVER loading pattern optimization problem

    International Nuclear Information System (INIS)

    Fatih, Alim; Kostandi, Ivanov

    2006-01-01

    Full text: Loading Pattern (LP) optimization is one of the most important aspects of the operation of nuclear reactors. A genetic algorithm (GA) code GARCO (Genetic Algorithm Reactor Optimization Code) has been developed with embedded heuristic techniques to perform optimization calculations for in-core fuel management tasks. GARCO is a practical tool that includes a unique methodology applicable for all types of Pressurized Water Reactor (PWR) cores having different geometries with an unlimited number of FA types in the inventory. GARCO was developed by modifying the classical representation of the genotype. Both the genotype representation and the basic algorithm have been modified to incorporate the in-core fuel management heuristics rules so as to obtain the best results in a shorter time. GARCO has three modes. Mode 1 optimizes the locations of the fuel assemblies (FAs) in the nuclear reactor core, Mode 2 optimizes the placement of the burnable poisons (BPs) in a selected LP, and Mode 3 optimizes simultaneously both the LP and the BP placement in the core. This study describes the basic algorithm for Mode 1. The GARCO code is applied to the VVER-1000 reactor hexagonal geometry core in this study. The M oby-Dick i s used as reactor physics code to deplete FAs in the core. It was developed to analyze the VVER reactors by SKODA Inc. To use these rules for creating the initial population with GA operators, the worth definition application is developed. Each FA has a worth value for each location. This worth is between 0 and 1. If worth of any FA for a location is larger than 0.5, this FA in this location is a good choice. When creating the initial population of LPs, a subroutine provides a percent of individuals, which have genes with higher than the 0.5 worth. The percentage of the population to be created without using worth definition is defined in the GARCO input. And also age concept has been developed to accelerate the GA calculation process in reaching the

  20. A genetic algorithm approach to optimization for the radiological worker allocation problem

    International Nuclear Information System (INIS)

    Yan Chen; Masakuni Narita; Masashi Tsuji; Sangduk Sa

    1996-01-01

    The worker allocation optimization problem in radiological facilities inevitably involves various types of requirements and constraints relevant to radiological protection and labor management. Some of these goals and constraints are not amenable to a rigorous mathematical formulation. Conventional methods for this problem rely heavily on sophisticated algebraic or numerical algorithms, which cause difficulties in the search for optimal solutions in the search space of worker allocation optimization problems. Genetic algorithms (GAB) are stochastic search algorithms introduced by J. Holland in the 1970s based on ideas and techniques from genetic and evolutionary theories. The most striking characteristic of GAs is the large flexibility allowed in the formulation of the optimal problem and the process of the search for the optimal solution. In the formulation, it is not necessary to define the optimal problem in rigorous mathematical terms, as required in the conventional methods. Furthermore, by designing a model of evolution for the optimal search problem, the optimal solution can be sought efficiently with computational simple manipulations without highly complex mathematical algorithms. We reported a GA approach to the worker allocation problem in radiological facilities in the previous study. In this study, two types of hard constraints were employed to reduce the huge search space, where the optimal solution is sought in such a way as to satisfy as many of soft constraints as possible. It was demonstrated that the proposed evolutionary method could provide the optimal solution efficiently compared with conventional methods. However, although the employed hard constraints could localize the search space into a very small region, it brought some complexities in the designed genetic operators and demanded additional computational burdens. In this paper, we propose a simplified evolutionary model with less restrictive hard constraints and make comparisons between

  1. Applications of genetic algorithms to optimization problems in the solvent extraction process for spent nuclear fuel

    International Nuclear Information System (INIS)

    Omori, Ryota, Sakakibara, Yasushi; Suzuki, Atsuyuki

    1997-01-01

    Applications of genetic algorithms (GAs) to optimization problems in the solvent extraction process for spent nuclear fuel are described. Genetic algorithms have been considered a promising tool for use in solving optimization problems in complicated and nonlinear systems because they require no derivatives of the objective function. In addition, they have the ability to treat a set of many possible solutions and consider multiple objectives simultaneously, so they can calculate many pareto optimal points on the trade-off curve between the competing objectives in a single iteration, which leads to small computing time. Genetic algorithms were applied to two optimization problems. First, process variables in the partitioning process were optimized using a weighted objective function. It was observed that the average fitness of a generation increased steadily as the generation proceeded and satisfactory solutions were obtained in all cases, which means that GAs are an appropriate method to obtain such an optimization. Secondly, GAs were applied to a multiobjective optimization problem in the co-decontamination process, and the trade-off curve between the loss of uranium and the solvent flow rate was successfully obtained. For both optimization problems, CPU time with the present method was estimated to be several tens of times smaller than with the random search method

  2. Implementation and verification of global optimization benchmark problems

    Science.gov (United States)

    Posypkin, Mikhail; Usov, Alexander

    2017-12-01

    The paper considers the implementation and verification of a test suite containing 150 benchmarks for global deterministic box-constrained optimization. A C++ library for describing standard mathematical expressions was developed for this purpose. The library automate the process of generating the value of a function and its' gradient at a given point and the interval estimates of a function and its' gradient on a given box using a single description. Based on this functionality, we have developed a collection of tests for an automatic verification of the proposed benchmarks. The verification has shown that literary sources contain mistakes in the benchmarks description. The library and the test suite are available for download and can be used freely.

  3. Implementation and verification of global optimization benchmark problems

    Directory of Open Access Journals (Sweden)

    Posypkin Mikhail

    2017-12-01

    Full Text Available The paper considers the implementation and verification of a test suite containing 150 benchmarks for global deterministic box-constrained optimization. A C++ library for describing standard mathematical expressions was developed for this purpose. The library automate the process of generating the value of a function and its’ gradient at a given point and the interval estimates of a function and its’ gradient on a given box using a single description. Based on this functionality, we have developed a collection of tests for an automatic verification of the proposed benchmarks. The verification has shown that literary sources contain mistakes in the benchmarks description. The library and the test suite are available for download and can be used freely.

  4. Airfoil optimization for noise emission problem on small scale turbines

    Energy Technology Data Exchange (ETDEWEB)

    Gocmen, Tuhfe; Ozerdem, Baris [Mechanical Engineering Department, Yzmir Institute of Technology (Turkey)

    2011-07-01

    Wind power is a preferred natural resource and has had benefits for the energy industry and for the environment all over the world. However, noise emission from wind turbines is becoming a major concern today. This study paid close attention to small scale wind turbines close to urban areas and proposes an optimum number of six airfoils to address noise emission concerns and performance criteria. The optimization process aimed to decrease the noise emission levels and enhance the aerodynamic performance of a small scale wind turbine. This study determined the sources and the operating conditions of broadband noise emissions. A new design is presented which enhances aerodynamic performance and at the same time reduces airfoil self noise. It used popular aerodynamic functions and codes based on aero-acoustic empirical models. Through numerical computations and analyses, it is possible to derive useful improvements that can be made to commercial airfoils for small scale wind turbines.

  5. Simulation optimization based ant colony algorithm for the uncertain quay crane scheduling problem

    Directory of Open Access Journals (Sweden)

    Naoufal Rouky

    2019-01-01

    Full Text Available This work is devoted to the study of the Uncertain Quay Crane Scheduling Problem (QCSP, where the loading /unloading times of containers and travel time of quay cranes are considered uncertain. The problem is solved with a Simulation Optimization approach which takes advantage of the great possibilities offered by the simulation to model the real details of the problem and the capacity of the optimization to find solutions with good quality. An Ant Colony Optimization (ACO meta-heuristic hybridized with a Variable Neighborhood Descent (VND local search is proposed to determine the assignments of tasks to quay cranes and the sequences of executions of tasks on each crane. Simulation is used inside the optimization algorithm to generate scenarios in agreement with the probabilities of the distributions of the uncertain parameters, thus, we carry out stochastic evaluations of the solutions found by each ant. The proposed optimization algorithm is tested first for the deterministic case on several well-known benchmark instances. Then, in the stochastic case, since no other work studied exactly the same problem with the same assumptions, the Simulation Optimization approach is compared with the deterministic version. The experimental results show that the optimization algorithm is competitive as compared to the existing methods and that the solutions found by the Simulation Optimization approach are more robust than those found by the optimization algorithm.

  6. Optimization problem and mean variance hedging on defaultable claims

    OpenAIRE

    Goutte, Stephane; Ngoupeyou, Armand

    2012-01-01

    We study the pricing and the hedging of claim {\\psi} which depends on the default times of two firms A and B. In fact, we assume that, in the market, we can not buy or sell any defaultable bond of the firm B but we can only trade defaultable bond of the firm A. Our aim is then to find the best price and hedging of {\\psi} using only bond of the firm A. Hence, we solve this problem in two cases: firstly in a Markov framework using indifference price and solving a system of Hamilton-Jacobi-Bellm...

  7. Optimization Approaches for the Traveling Salesman Problem with Drone

    OpenAIRE

    Agatz, N.A.H.; Bouman, P.C.; Schmidt, M.E.

    2016-01-01

    textabstractThe fast and cost-efficient home delivery of goods ordered online is logistically challenging. Many companies are looking for new ways to cross the last-mile to their customers. One technology-enabled opportunity that recently has received much at- tention is the use of a drone to support deliveries. An innovative last-mile delivery concept in which a truck collaborates with a drone to make deliveries gives rise to a new variant of the traveling salesman problem (TSP) that we call...

  8. On the formulation and numerical simulation of distributed-order fractional optimal control problems

    Science.gov (United States)

    Zaky, M. A.; Machado, J. A. Tenreiro

    2017-11-01

    In a fractional optimal control problem, the integer order derivative is replaced by a fractional order derivative. The fractional derivative embeds implicitly the time delays in an optimal control process. The order of the fractional derivative can be distributed over the unit interval, to capture delays of distinct sources. The purpose of this paper is twofold. Firstly, we derive the generalized necessary conditions for optimal control problems with dynamics described by ordinary distributed-order fractional differential equations (DFDEs). Secondly, we propose an efficient numerical scheme for solving an unconstrained convex distributed optimal control problem governed by the DFDE. We convert the problem under consideration into an optimal control problem governed by a system of DFDEs, using the pseudo-spectral method and the Jacobi-Gauss-Lobatto (J-G-L) integration formula. Next, we present the numerical solutions for a class of optimal control problems of systems governed by DFDEs. The convergence of the proposed method is graphically analyzed showing that the proposed scheme is a good tool for the simulation of distributed control problems governed by DFDEs.

  9. Experiences modeling ocean circulation problems on a 30 node commodity cluster with 3840 GPU processor cores.

    Science.gov (United States)

    Hill, C.

    2008-12-01

    Low cost graphic cards today use many, relatively simple, compute cores to deliver support for memory bandwidth of more than 100GB/s and theoretical floating point performance of more than 500 GFlop/s. Right now this performance is, however, only accessible to highly parallel algorithm implementations that, (i) can use a hundred or more, 32-bit floating point, concurrently executing cores, (ii) can work with graphics memory that resides on the graphics card side of the graphics bus and (iii) can be partially expressed in a language that can be compiled by a graphics programming tool. In this talk we describe our experiences implementing a complete, but relatively simple, time dependent shallow-water equations simulation targeting a cluster of 30 computers each hosting one graphics card. The implementation takes into account the considerations (i), (ii) and (iii) listed previously. We code our algorithm as a series of numerical kernels. Each kernel is designed to be executed by multiple threads of a single process. Kernels are passed memory blocks to compute over which can be persistent blocks of memory on a graphics card. Each kernel is individually implemented using the NVidia CUDA language but driven from a higher level supervisory code that is almost identical to a standard model driver. The supervisory code controls the overall simulation timestepping, but is written to minimize data transfer between main memory and graphics memory (a massive performance bottle-neck on current systems). Using the recipe outlined we can boost the performance of our cluster by nearly an order of magnitude, relative to the same algorithm executing only on the cluster CPU's. Achieving this performance boost requires that many threads are available to each graphics processor for execution within each numerical kernel and that the simulations working set of data can fit into the graphics card memory. As we describe, this puts interesting upper and lower bounds on the problem sizes

  10. Set-Based Discrete Particle Swarm Optimization Based on Decomposition for Permutation-Based Multiobjective Combinatorial Optimization Problems.

    Science.gov (United States)

    Yu, Xue; Chen, Wei-Neng; Gu, Tianlong; Zhang, Huaxiang; Yuan, Huaqiang; Kwong, Sam; Zhang, Jun

    2017-08-07

    This paper studies a specific class of multiobjective combinatorial optimization problems (MOCOPs), namely the permutation-based MOCOPs. Many commonly seen MOCOPs, e.g., multiobjective traveling salesman problem (MOTSP), multiobjective project scheduling problem (MOPSP), belong to this problem class and they can be very different. However, as the permutation-based MOCOPs share the inherent similarity that the structure of their search space is usually in the shape of a permutation tree, this paper proposes a generic multiobjective set-based particle swarm optimization methodology based on decomposition, termed MS-PSO/D. In order to coordinate with the property of permutation-based MOCOPs, MS-PSO/D utilizes an element-based representation and a constructive approach. Through this, feasible solutions under constraints can be generated step by step following the permutation-tree-shaped structure. And problem-related heuristic information is introduced in the constructive approach for efficiency. In order to address the multiobjective optimization issues, the decomposition strategy is employed, in which the problem is converted into multiple single-objective subproblems according to a set of weight vectors. Besides, a flexible mechanism for diversity control is provided in MS-PSO/D. Extensive experiments have been conducted to study MS-PSO/D on two permutation-based MOCOPs, namely the MOTSP and the MOPSP. Experimental results validate that the proposed methodology is promising.

  11. Optimization on fixed low latency implementation of the GBT core in FPGA

    Science.gov (United States)

    Chen, K.; Chen, H.; Wu, W.; Xu, H.; Yao, L.

    2017-07-01

    In the upgrade of ATLAS experiment [1], the front-end electronics components are subjected to a large radiation background. Meanwhile high speed optical links are required for the data transmission between the on-detector and off-detector electronics. The GBT architecture and the Versatile Link (VL) project are designed by CERN to support the 4.8 Gbps line rate bidirectional high-speed data transmission which is called GBT link [2]. In the ATLAS upgrade, besides the link with on-detector, the GBT link is also used between different off-detector systems. The GBTX ASIC is designed for the on-detector front-end, correspondingly for the off-detector electronics, the GBT architecture is implemented in Field Programmable Gate Arrays (FPGA). CERN launches the GBT-FPGA project to provide examples in different types of FPGA [3]. In the ATLAS upgrade framework, the Front-End LInk eXchange (FELIX) system [4, 5] is used to interface the front-end electronics of several ATLAS subsystems. The GBT link is used between them, to transfer the detector data and the timing, trigger, control and monitoring information. The trigger signal distributed in the down-link from FELIX to the front-end requires a fixed and low latency. In this paper, several optimizations on the GBT-FPGA IP core are introduced, to achieve a lower fixed latency. For FELIX, a common firmware will be used to interface different front-ends with support of both GBT modes: the forward error correction mode and the wide mode. The modified GBT-FPGA core has the ability to switch between the GBT modes without FPGA reprogramming. The system clock distribution of the multi-channel FELIX firmware is also discussed in this paper.

  12. Optimization on fixed low latency implementation of the GBT core in FPGA

    International Nuclear Information System (INIS)

    Chen, K.; Chen, H.; Wu, W.; Xu, H.; Yao, L.

    2017-01-01

    In the upgrade of ATLAS experiment [1], the front-end electronics components are subjected to a large radiation background. Meanwhile high speed optical links are required for the data transmission between the on-detector and off-detector electronics. The GBT architecture and the Versatile Link (VL) project are designed by CERN to support the 4.8 Gbps line rate bidirectional high-speed data transmission which is called GBT link [2]. In the ATLAS upgrade, besides the link with on-detector, the GBT link is also used between different off-detector systems. The GBTX ASIC is designed for the on-detector front-end, correspondingly for the off-detector electronics, the GBT architecture is implemented in Field Programmable Gate Arrays (FPGA). CERN launches the GBT-FPGA project to provide examples in different types of FPGA [3]. In the ATLAS upgrade framework, the Front-End LInk eXchange (FELIX) system [4, 5] is used to interface the front-end electronics of several ATLAS subsystems. The GBT link is used between them, to transfer the detector data and the timing, trigger, control and monitoring information. The trigger signal distributed in the down-link from FELIX to the front-end requires a fixed and low latency. In this paper, several optimizations on the GBT-FPGA IP core are introduced, to achieve a lower fixed latency. For FELIX, a common firmware will be used to interface different front-ends with support of both GBT modes: the forward error correction mode and the wide mode. The modified GBT-FPGA core has the ability to switch between the GBT modes without FPGA reprogramming. The system clock distribution of the multi-channel FELIX firmware is also discussed in this paper.

  13. A new evolutionary algorithm with LQV learning for combinatorial problems optimization

    International Nuclear Information System (INIS)

    Machado, Marcelo Dornellas; Schirru, Roberto

    2000-01-01

    Genetic algorithms are biologically motivated adaptive systems which have been used, with good results, for combinatorial problems optimization. In this work, a new learning mode, to be used by the population-based incremental learning algorithm, has the aim to build a new evolutionary algorithm to be used in optimization of numerical problems and combinatorial problems. This new learning mode uses a variable learning rate during the optimization process, constituting a process known as proportional reward. The development of this new algorithm aims its application in the optimization of reload problem of PWR nuclear reactors, in order to increase the useful life of the nuclear fuel. For the test, two classes of problems are used: numerical problems and combinatorial problems. Due to the fact that the reload problem is a combinatorial problem, the major interest relies on the last class. The results achieved with the tests indicate the applicability of the new learning mode, showing its potential as a developing tool in the solution of reload problem. (author)

  14. On a variational principle for shape optimization and elliptic free boundary problems

    Directory of Open Access Journals (Sweden)

    Raúl B. González De Paz

    2009-02-01

    Full Text Available A variational principle for several free boundary value problems using a relaxation approach is presented. The relaxed Energy functional is concave and it is defined on a convex set, so that the minimizing points are characteristic functions of sets. As a consequence of the first order optimality conditions, it is shown that the corresponding sets are domains bounded by free boundaries, so that the equivalence of the solution of the relaxed problem with the solution of several free boundary value problem is proved. Keywords: Calculus of variations, optimization, free boundary problems.

  15. MULTI-CRITERIA PROGRAMMING METHODS AND PRODUCTION PLAN OPTIMIZATION PROBLEM SOLVING IN METAL INDUSTRY

    Directory of Open Access Journals (Sweden)

    Tunjo Perić

    2017-09-01

    Full Text Available This paper presents the production plan optimization in the metal industry considered as a multi-criteria programming problem. We first provided the definition of the multi-criteria programming problem and classification of the multicriteria programming methods. Then we applied two multi-criteria programming methods (the STEM method and the PROMETHEE method in solving a problem of multi-criteria optimization production plan in a company from the metal industry. The obtained results indicate a high efficiency of the applied methods in solving the problem.

  16. Solving the pre-marshalling problem to optimality with A* and IDA*

    DEFF Research Database (Denmark)

    Tierney, Kevin; Pacino, Dario; Voß, Stefan

    2017-01-01

    We present a novel solution approach to the container pre-marshalling problem using the A* and IDA* algorithms combined with several novel branching and symmetry breaking rules that significantly increases the number of pre-marshalling instances that can be solved to optimality. A* and IDA......* are graph search algorithms that use heuristics combined with a complete graph search to find optimal solutions to problems. The container pre-marshalling problem is a key problem for container terminals seeking to reduce delays of inter-modal container transports. The goal of the container pre...

  17. Ant colony optimization techniques for the hamiltonian p-median problem

    Directory of Open Access Journals (Sweden)

    M. Zohrehbandian

    2010-12-01

    Full Text Available Location-Routing problems involve locating a number of facilitiesamong candidate sites and establishing delivery routes to a set of users in such a way that the total system cost is minimized. A special case of these problems is Hamiltonian p-Median problem (HpMP. This research applies the metaheuristic method of ant colony optimization (ACO to solve the HpMP. Modifications are made to the ACO algorithm used to solve the traditional vehicle routing problem (VRP in order to allow the search of the optimal solution of the HpMP. Regarding this metaheuristic algorithm a computational experiment is reported as well.

  18. A Distributed Particle Swarm Optimization Zlgorithmfor Flexible Job-hop Scheduling Problem

    Directory of Open Access Journals (Sweden)

    LIU Sheng--hui

    2017-06-01

    Full Text Available According to the characteristics of the Flexible job shop scheduling problem the minimum makespan as measures we proposed a distributed particle swarm optimization algorithm aiming to solve flexible job shop scheduling problem. The algorithm adopts the method of distributed ideas to solve problems and we are established for two multi agent particle swarm optimization model in this algorithm it can solve the traditional particle swarm optimization algorithm when making decisions in real time according to the emergencies. Finally some benthmark problems were experimented and the results are compared with the traditional algorithm. Experimental results proved that the developed distributed PSO is enough effective and efficient to solve the FJSP and it also verified the reasonableness of the multi}gent particle swarm optimization model.

  19. An A Posteriori Error Estimate for Symplectic Euler Approximation of Optimal Control Problems

    KAUST Repository

    Karlsson, Peer Jesper; Larsson, Stig; Sandberg, Mattias; Szepessy, Anders; Tempone, Raul

    2015-01-01

    This work focuses on numerical solutions of optimal control problems. A time discretization error representation is derived for the approximation of the associated value function. It concerns Symplectic Euler solutions of the Hamiltonian system

  20. An Improved Particle Swarm Optimization for Solving Bilevel Multiobjective Programming Problem

    Directory of Open Access Journals (Sweden)

    Tao Zhang

    2012-01-01

    Full Text Available An improved particle swarm optimization (PSO algorithm is proposed for solving bilevel multiobjective programming problem (BLMPP. For such problems, the proposed algorithm directly simulates the decision process of bilevel programming, which is different from most traditional algorithms designed for specific versions or based on specific assumptions. The BLMPP is transformed to solve multiobjective optimization problems in the upper level and the lower level interactively by an improved PSO. And a set of approximate Pareto optimal solutions for BLMPP is obtained using the elite strategy. This interactive procedure is repeated until the accurate Pareto optimal solutions of the original problem are found. Finally, some numerical examples are given to illustrate the feasibility of the proposed algorithm.