WorldWideScience

Sample records for solve combinatorial optimization

  1. Applications of combinatorial optimization

    CERN Document Server

    Paschos, Vangelis Th

    2013-01-01

    Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management. The three volumes of the Combinatorial Optimization series aims to cover a wide range of topics in this area. These topics also deal with fundamental notions and approaches as with several classical applications of combinatorial optimization. "Applications of Combinatorial Optimization" is presenting a certain number among the most common and well-known applications of Combinatorial Optimization.

  2. Concepts of combinatorial optimization

    CERN Document Server

    Paschos, Vangelis Th

    2014-01-01

    Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management.  The three volumes of the Combinatorial Optimization series aim to cover a wide range  of topics in this area. These topics also deal with fundamental notions and approaches as with several classical applications of combinatorial optimization.Concepts of Combinatorial Optimization, is divided into three parts:- On the complexity of combinatorial optimization problems, presenting basics about worst-case and randomi

  3. Integer and combinatorial optimization

    CERN Document Server

    Nemhauser, George L

    1999-01-01

    Rave reviews for INTEGER AND COMBINATORIAL OPTIMIZATION ""This book provides an excellent introduction and survey of traditional fields of combinatorial optimization . . . It is indeed one of the best and most complete texts on combinatorial optimization . . . available. [And] with more than 700 entries, [it] has quite an exhaustive reference list.""-Optima ""A unifying approach to optimization problems is to formulate them like linear programming problems, while restricting some or all of the variables to the integers. This book is an encyclopedic resource for such f

  4. An improved superconducting neural circuit and its application for a neural network solving a combinatorial optimization problem

    International Nuclear Information System (INIS)

    Onomi, T; Nakajima, K

    2014-01-01

    We have proposed a superconducting Hopfield-type neural network for solving the N-Queens problem which is one of combinatorial optimization problems. The sigmoid-shape function of a neuron output is represented by the output of coupled SQUIDs gate consisting of a single-junction and a double-junction SQUIDs. One of the important factors for an improvement of the network performance is an improvement of a threshold characteristic of a neuron circuit. In this paper, we report an improved design of coupled SQUID gates for a superconducting neural network. A step-like function with a steep threshold at a rising edge is desirable for a neuron circuit to solve a combinatorial optimization problem. A neuron circuit is composed of two coupled SQUIDs gates with a cascade connection in order to obtain such characteristics. The designed neuron circuit is fabricated by a 2.5 kA/cm 2 Nb/AlOx/Nb process. The operation of a fabricated neuron circuit is experimentally demonstrated. Moreover, we discuss about the performance of the neural network using the improved neuron circuits and delayed negative self-connections.

  5. Combinatorial optimization on a Boltzmann machine

    NARCIS (Netherlands)

    Korst, J.H.M.; Aarts, E.H.L.

    1989-01-01

    We discuss the problem of solving (approximately) combinatorial optimization problems on a Boltzmann machine. It is shown for a number of combinatorial optimization problems how they can be mapped directly onto a Boltzmann machine by choosing appropriate connection patterns and connection strengths.

  6. Exploiting Quantum Resonance to Solve Combinatorial Problems

    Science.gov (United States)

    Zak, Michail; Fijany, Amir

    2006-01-01

    Quantum resonance would be exploited in a proposed quantum-computing approach to the solution of combinatorial optimization problems. In quantum computing in general, one takes advantage of the fact that an algorithm cannot be decoupled from the physical effects available to implement it. Prior approaches to quantum computing have involved exploitation of only a subset of known quantum physical effects, notably including parallelism and entanglement, but not including resonance. In the proposed approach, one would utilize the combinatorial properties of tensor-product decomposability of unitary evolution of many-particle quantum systems for physically simulating solutions to NP-complete problems (a class of problems that are intractable with respect to classical methods of computation). In this approach, reinforcement and selection of a desired solution would be executed by means of quantum resonance. Classes of NP-complete problems that are important in practice and could be solved by the proposed approach include planning, scheduling, search, and optimal design.

  7. Combinatorial optimization games

    Energy Technology Data Exchange (ETDEWEB)

    Deng, X. [York Univ., North York, Ontario (Canada); Ibaraki, Toshihide; Nagamochi, Hiroshi [Kyoto Univ. (Japan)

    1997-06-01

    We introduce a general integer programming formulation for a class of combinatorial optimization games, which immediately allows us to improve the algorithmic result for finding amputations in the core (an important solution concept in cooperative game theory) of the network flow game on simple networks by Kalai and Zemel. An interesting result is a general theorem that the core for this class of games is nonempty if and only if a related linear program has an integer optimal solution. We study the properties for this mathematical condition to hold for several interesting problems, and apply them to resolve algorithmic and complexity issues for their cores along the line as put forward in: decide whether the core is empty; if the core is empty, find an imputation in the core; given an imputation x, test whether x is in the core. We also explore the properties of totally balanced games in this succinct formulation of cooperative games.

  8. Neural Meta-Memes Framework for Combinatorial Optimization

    Science.gov (United States)

    Song, Li Qin; Lim, Meng Hiot; Ong, Yew Soon

    In this paper, we present a Neural Meta-Memes Framework (NMMF) for combinatorial optimization. NMMF is a framework which models basic optimization algorithms as memes and manages them dynamically when solving combinatorial problems. NMMF encompasses neural networks which serve as the overall planner/coordinator to balance the workload between memes. We show the efficacy of the proposed NMMF through empirical study on a class of combinatorial problem, the quadratic assignment problem (QAP).

  9. Combinatorial optimization theory and algorithms

    CERN Document Server

    Korte, Bernhard

    2018-01-01

    This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references. This sixth edition has again been updated, revised, and significantly extended. Among other additions, there are new sections on shallow-light trees, submodular function maximization, smoothed analysis of the knapsack problem, the (ln 4+ɛ)-approximation for Steiner trees, and the VPN theorem. Thus, this book continues to represent the state of the art of combinatorial opti...

  10. Combinatorial optimization networks and matroids

    CERN Document Server

    Lawler, Eugene

    2011-01-01

    Perceptively written text examines optimization problems that can be formulated in terms of networks and algebraic structures called matroids. Chapters cover shortest paths, network flows, bipartite matching, nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. A suitable text or reference for courses in combinatorial computing and concrete computational complexity in departments of computer science and mathematics.

  11. Combinatorial optimization in foundry practice

    Science.gov (United States)

    Antamoshkin, A. N.; Masich, I. S.

    2016-04-01

    The multicriteria mathematical model of foundry production capacity planning is suggested in the paper. The model is produced in terms of pseudo-Boolean optimization theory. Different search optimization methods were used to solve the obtained problem.

  12. Design and Implementation of a Combinatorial Optimization Multi-population Meta-heuristic for Solving Vehicle Routing Problems

    Directory of Open Access Journals (Sweden)

    Eneko Osaba

    2016-12-01

    Full Text Available This paper aims to give a presentation of the PhD defended by Eneko Osaba on November 16th, 2015, at the University of Deusto. The thesis can be placed in the field of artificial intelligence. Specifically, it is related with multi- population meta-heuristics for solving vehicle routing problems. The dissertation was held in the main auditorium of the University, in a publicly open presentation. After the presentation, Eneko was awarded with the highest grade (cum laude. Additionally, Eneko obtained the PhD obtaining award granted by the Basque Government through.

  13. On some interconnections between combinatorial optimization and extremal graph theory

    Directory of Open Access Journals (Sweden)

    Cvetković Dragoš M.

    2004-01-01

    Full Text Available The uniting feature of combinatorial optimization and extremal graph theory is that in both areas one should find extrema of a function defined in most cases on a finite set. While in combinatorial optimization the point is in developing efficient algorithms and heuristics for solving specified types of problems, the extremal graph theory deals with finding bounds for various graph invariants under some constraints and with constructing extremal graphs. We analyze by examples some interconnections and interactions of the two theories and propose some conclusions.

  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. 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

  16. Quantum Resonance Approach to Combinatorial Optimization

    Science.gov (United States)

    Zak, Michail

    1997-01-01

    It is shown that quantum resonance can be used for combinatorial optimization. The advantage of the approach is in independence of the computing time upon the dimensionality of the problem. As an example, the solution to a constraint satisfaction problem of exponential complexity is demonstrated.

  17. Gems of combinatorial optimization and graph algorithms

    CERN Document Server

    Skutella, Martin; Stiller, Sebastian; Wagner, Dorothea

    2015-01-01

    Are you looking for new lectures for your course on algorithms, combinatorial optimization, or algorithmic game theory?  Maybe you need a convenient source of relevant, current topics for a graduate student or advanced undergraduate student seminar?  Or perhaps you just want an enjoyable look at some beautiful mathematical and algorithmic results, ideas, proofs, concepts, and techniques in discrete mathematics and theoretical computer science?   Gems of Combinatorial Optimization and Graph Algorithms is a handpicked collection of up-to-date articles, carefully prepared by a select group of international experts, who have contributed some of their most mathematically or algorithmically elegant ideas.  Topics include longest tours and Steiner trees in geometric spaces, cartograms, resource buying games, congestion games, selfish routing, revenue equivalence and shortest paths, scheduling, linear structures in graphs, contraction hierarchies, budgeted matching problems, and motifs in networks.   This ...

  18. Dynamical System Approaches to Combinatorial Optimization

    DEFF Research Database (Denmark)

    Starke, Jens

    2013-01-01

    of large times as an asymptotically stable point of the dynamics. The obtained solutions are often not globally optimal but good approximations of it. Dynamical system and neural network approaches are appropriate methods for distributed and parallel processing. Because of the parallelization......Several dynamical system approaches to combinatorial optimization problems are described and compared. These include dynamical systems derived from penalty methods; the approach of Hopfield and Tank; self-organizing maps, that is, Kohonen networks; coupled selection equations; and hybrid methods...... thereof can be used as models for many industrial problems like manufacturing planning and optimization of flexible manufacturing systems. This is illustrated for an example in distributed robotic systems....

  19. Asessing for Structural Understanding in Childrens' Combinatorial Problem Solving.

    Science.gov (United States)

    English, Lyn

    1999-01-01

    Assesses children's structural understanding of combinatorial problems when presented in a variety of task situations. Provides an explanatory model of students' combinatorial understandings that informs teaching and assessment. Addresses several components of children's structural understanding of elementary combinatorial problems. (Contains 50…

  20. 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.

  1. Distributing the computation in combinatorial optimization experiments over the cloud

    OpenAIRE

    Mario Brcic; Nikica Hlupic; Nenad Katanic

    2017-01-01

    Combinatorial optimization is an area of great importance since many of the real-world problems have discrete parameters which are part of the objective function to be optimized. Development of combinatorial optimization algorithms is guided by the empirical study of the candidate ideas and their performance over a wide range of settings or scenarios to infer general conclusions. Number of scenarios can be overwhelming, especially when modeling uncertainty in some of the problem’s parameters....

  2. Bifurcation-based approach reveals synergism and optimal combinatorial perturbation.

    Science.gov (United States)

    Liu, Yanwei; Li, Shanshan; Liu, Zengrong; Wang, Ruiqi

    2016-06-01

    Cells accomplish the process of fate decisions and form terminal lineages through a series of binary choices in which cells switch stable states from one branch to another as the interacting strengths of regulatory factors continuously vary. Various combinatorial effects may occur because almost all regulatory processes are managed in a combinatorial fashion. Combinatorial regulation is crucial for cell fate decisions because it may effectively integrate many different signaling pathways to meet the higher regulation demand during cell development. However, whether the contribution of combinatorial regulation to the state transition is better than that of a single one and if so, what the optimal combination strategy is, seem to be significant issue from the point of view of both biology and mathematics. Using the approaches of combinatorial perturbations and bifurcation analysis, we provide a general framework for the quantitative analysis of synergism in molecular networks. Different from the known methods, the bifurcation-based approach depends only on stable state responses to stimuli because the state transition induced by combinatorial perturbations occurs between stable states. More importantly, an optimal combinatorial perturbation strategy can be determined by investigating the relationship between the bifurcation curve of a synergistic perturbation pair and the level set of a specific objective function. The approach is applied to two models, i.e., a theoretical multistable decision model and a biologically realistic CREB model, to show its validity, although the approach holds for a general class of biological systems.

  3. Combinatorial Clustering Algorithm of Quantum-Behaved Particle Swarm Optimization and Cloud Model

    Directory of Open Access Journals (Sweden)

    Mi-Yuan Shan

    2013-01-01

    Full Text Available We propose a combinatorial clustering algorithm of cloud model and quantum-behaved particle swarm optimization (COCQPSO to solve the stochastic problem. The algorithm employs a novel probability model as well as a permutation-based local search method. We are setting the parameters of COCQPSO based on the design of experiment. In the comprehensive computational study, we scrutinize the performance of COCQPSO on a set of widely used benchmark instances. By benchmarking combinatorial clustering algorithm with state-of-the-art algorithms, we can show that its performance compares very favorably. The fuzzy combinatorial optimization algorithm of cloud model and quantum-behaved particle swarm optimization (FCOCQPSO in vague sets (IVSs is more expressive than the other fuzzy sets. Finally, numerical examples show the clustering effectiveness of COCQPSO and FCOCQPSO clustering algorithms which are extremely remarkable.

  4. Polyhedral and semidefinite programming methods in combinatorial optimization

    CERN Document Server

    Tunçel, Levent

    2010-01-01

    Since the early 1960s, polyhedral methods have played a central role in both the theory and practice of combinatorial optimization. Since the early 1990s, a new technique, semidefinite programming, has been increasingly applied to some combinatorial optimization problems. The semidefinite programming problem is the problem of optimizing a linear function of matrix variables, subject to finitely many linear inequalities and the positive semidefiniteness condition on some of the matrix variables. On certain problems, such as maximum cut, maximum satisfiability, maximum stable set and geometric r

  5. Solving the neutron diffusion equation on combinatorial geometry computational cells for reactor physics calculations

    International Nuclear Information System (INIS)

    Azmy, Y. Y.

    2004-01-01

    An approach is developed for solving the neutron diffusion equation on combinatorial geometry computational cells, that is computational cells composed by combinatorial operations involving simple-shaped component cells. The only constraint on the component cells from which the combinatorial cells are assembled is that they possess a legitimate discretization of the underlying diffusion equation. We use the Finite Difference (FD) approximation of the x, y-geometry diffusion equation in this work. Performing the same combinatorial operations involved in composing the combinatorial cell on these discrete-variable equations yields equations that employ new discrete variables defined only on the combinatorial cell's volume and faces. The only approximation involved in this process, beyond the truncation error committed in discretizing the diffusion equation over each component cell, is a consistent-order Legendre series expansion. Preliminary results for simple configurations establish the accuracy of the solution to the combinatorial geometry solution compared to straight FD as the system dimensions decrease. Furthermore numerical results validate the consistent Legendre-series expansion order by illustrating the second order accuracy of the combinatorial geometry solution, the same as standard FD. Nevertheless the magnitude of the error for the new approach is larger than FD's since it incorporates the additional truncated series approximation. (authors)

  6. From combinatorial optimization to real algebraic geometry and back

    Directory of Open Access Journals (Sweden)

    Janez Povh

    2014-12-01

    Full Text Available In this paper, we explain the relations between combinatorial optimization and real algebraic geometry with a special focus to the quadratic assignment problem. We demonstrate how to write a quadratic optimization problem over discrete feasible set as a linear optimization problem over the cone of completely positive matrices. The latter formulation enables a hierarchy of approximations which rely on results from polynomial optimization, a sub-eld of real algebraic geometry.

  7. Bioinspired computation in combinatorial optimization: algorithms and their computational complexity

    DEFF Research Database (Denmark)

    Neumann, Frank; Witt, Carsten

    2012-01-01

    Bioinspired computation methods, such as evolutionary algorithms and ant colony optimization, are being applied successfully to complex engineering and combinatorial optimization problems, and it is very important that we understand the computational complexity of these algorithms. This tutorials...... problems. Classical single objective optimization is examined first. They then investigate the computational complexity of bioinspired computation applied to multiobjective variants of the considered combinatorial optimization problems, and in particular they show how multiobjective optimization can help...... to speed up bioinspired computation for single-objective optimization problems. The tutorial is based on a book written by the authors with the same title. Further information about the book can be found at www.bioinspiredcomputation.com....

  8. Distributing the computation in combinatorial optimization experiments over the cloud

    Directory of Open Access Journals (Sweden)

    Mario Brcic

    2017-12-01

    Full Text Available Combinatorial optimization is an area of great importance since many of the real-world problems have discrete parameters which are part of the objective function to be optimized. Development of combinatorial optimization algorithms is guided by the empirical study of the candidate ideas and their performance over a wide range of settings or scenarios to infer general conclusions. Number of scenarios can be overwhelming, especially when modeling uncertainty in some of the problem’s parameters. Since the process is also iterative and many ideas and hypotheses may be tested, execution time of each experiment has an important role in the efficiency and successfulness. Structure of such experiments allows for significant execution time improvement by distributing the computation. We focus on the cloud computing as a cost-efficient solution in these circumstances. In this paper we present a system for validating and comparing stochastic combinatorial optimization algorithms. The system also deals with selection of the optimal settings for computational nodes and number of nodes in terms of performance-cost tradeoff. We present applications of the system on a new class of project scheduling problem. We show that we can optimize the selection over cloud service providers as one of the settings and, according to the model, it resulted in a substantial cost-savings while meeting the deadline.

  9. Combinatorial Optimization in Project Selection Using Genetic Algorithm

    Science.gov (United States)

    Dewi, Sari; Sawaluddin

    2018-01-01

    This paper discusses the problem of project selection in the presence of two objective functions that maximize profit and minimize cost and the existence of some limitations is limited resources availability and time available so that there is need allocation of resources in each project. These resources are human resources, machine resources, raw material resources. This is treated as a consideration to not exceed the budget that has been determined. So that can be formulated mathematics for objective function (multi-objective) with boundaries that fulfilled. To assist the project selection process, a multi-objective combinatorial optimization approach is used to obtain an optimal solution for the selection of the right project. It then described a multi-objective method of genetic algorithm as one method of multi-objective combinatorial optimization approach to simplify the project selection process in a large scope.

  10. View discovery in OLAP databases through statistical combinatorial optimization

    Energy Technology Data Exchange (ETDEWEB)

    Hengartner, Nick W [Los Alamos National Laboratory; Burke, John [PNNL; Critchlow, Terence [PNNL; Joslyn, Cliff [PNNL; Hogan, Emilie [PNNL

    2009-01-01

    OnLine Analytical Processing (OLAP) is a relational database technology providing users with rapid access to summary, aggregated views of a single large database, and is widely recognized for knowledge representation and discovery in high-dimensional relational databases. OLAP technologies provide intuitive and graphical access to the massively complex set of possible summary views available in large relational (SQL) structured data repositories. The capability of OLAP database software systems to handle data complexity comes at a high price for analysts, presenting them a combinatorially vast space of views of a relational database. We respond to the need to deploy technologies sufficient to allow users to guide themselves to areas of local structure by casting the space of 'views' of an OLAP database as a combinatorial object of all projections and subsets, and 'view discovery' as an search process over that lattice. We equip the view lattice with statistical information theoretical measures sufficient to support a combinatorial optimization process. We outline 'hop-chaining' as a particular view discovery algorithm over this object, wherein users are guided across a permutation of the dimensions by searching for successive two-dimensional views, pushing seen dimensions into an increasingly large background filter in a 'spiraling' search process. We illustrate this work in the context of data cubes recording summary statistics for radiation portal monitors at US ports.

  11. View Discovery in OLAP Databases through Statistical Combinatorial Optimization

    Energy Technology Data Exchange (ETDEWEB)

    Joslyn, Cliff A.; Burke, Edward J.; Critchlow, Terence J.

    2009-05-01

    The capability of OLAP database software systems to handle data complexity comes at a high price for analysts, presenting them a combinatorially vast space of views of a relational database. We respond to the need to deploy technologies sufficient to allow users to guide themselves to areas of local structure by casting the space of ``views'' of an OLAP database as a combinatorial object of all projections and subsets, and ``view discovery'' as an search process over that lattice. We equip the view lattice with statistical information theoretical measures sufficient to support a combinatorial optimization process. We outline ``hop-chaining'' as a particular view discovery algorithm over this object, wherein users are guided across a permutation of the dimensions by searching for successive two-dimensional views, pushing seen dimensions into an increasingly large background filter in a ``spiraling'' search process. We illustrate this work in the context of data cubes recording summary statistics for radiation portal monitors at US ports.

  12. First steps in combinatorial optimization on graphons: matchings

    Czech Academy of Sciences Publication Activity Database

    Doležal, Martin; Hladký, J.; Hu, P.; Piguet, Diana

    2017-01-01

    Roč. 61, August (2017), s. 359-365 ISSN 1571-0653 R&D Projects: GA ČR GA16-07378S; GA ČR GJ16-07822Y EU Projects: European Commission(XE) 628974 - PAECIDM Institutional support: RVO:67985840 ; RVO:67985807 Keywords : graphon * graph limits * matching * combinatorial optimization Subject RIV: BA - General Mathematics ; BA - General Mathematics (UIVT-O) OBOR OECD: Pure mathematics ; Pure mathematics (UIVT-O) http://www.sciencedirect.com/science/article/pii/S1571065317301452

  13. First steps in combinatorial optimization on graphons: matchings

    Czech Academy of Sciences Publication Activity Database

    Doležal, Martin; Hladký, J.; Hu, P.; Piguet, Diana

    2017-01-01

    Roč. 61, August (2017), s. 359-365 ISSN 1571-0653 R&D Projects: GA ČR GA16-07378S; GA ČR GJ16-07822Y EU Projects: European Commission(XE) 628974 - PAECIDM Institutional support: RVO:67985840 ; RVO:67985807 Keywords : graphon * graph limits * matching * combinatorial optimization Subject RIV: BA - General Mathematics; BA - General Mathematics (UIVT-O) OBOR OECD: Pure mathematics; Pure mathematics (UIVT-O) http://www.sciencedirect.com/science/article/pii/S1571065317301452

  14. 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.

  15. Rationally reduced libraries for combinatorial pathway optimization minimizing experimental effort.

    Science.gov (United States)

    Jeschek, Markus; Gerngross, Daniel; Panke, Sven

    2016-03-31

    Rational flux design in metabolic engineering approaches remains difficult since important pathway information is frequently not available. Therefore empirical methods are applied that randomly change absolute and relative pathway enzyme levels and subsequently screen for variants with improved performance. However, screening is often limited on the analytical side, generating a strong incentive to construct small but smart libraries. Here we introduce RedLibs (Reduced Libraries), an algorithm that allows for the rational design of smart combinatorial libraries for pathway optimization thereby minimizing the use of experimental resources. We demonstrate the utility of RedLibs for the design of ribosome-binding site libraries by in silico and in vivo screening with fluorescent proteins and perform a simple two-step optimization of the product selectivity in the branched multistep pathway for violacein biosynthesis, indicating a general applicability for the algorithm and the proposed heuristics. We expect that RedLibs will substantially simplify the refactoring of synthetic metabolic pathways.

  16. Development of Combinatorial Methods for Alloy Design and Optimization

    International Nuclear Information System (INIS)

    Pharr, George M.; George, Easo P.; Santella, Michael L

    2005-01-01

    The primary goal of this research was to develop a comprehensive methodology for designing and optimizing metallic alloys by combinatorial principles. Because conventional techniques for alloy preparation are unavoidably restrictive in the range of alloy composition that can be examined, combinatorial methods promise to significantly reduce the time, energy, and expense needed for alloy design. Combinatorial methods can be developed not only to optimize existing alloys, but to explore and develop new ones as well. The scientific approach involved fabricating an alloy specimen with a continuous distribution of binary and ternary alloy compositions across its surface--an ''alloy library''--and then using spatially resolved probing techniques to characterize its structure, composition, and relevant properties. The three specific objectives of the project were: (1) to devise means by which simple test specimens with a library of alloy compositions spanning the range interest can be produced; (2) to assess how well the properties of the combinatorial specimen reproduce those of the conventionally processed alloys; and (3) to devise screening tools which can be used to rapidly assess the important properties of the alloys. As proof of principle, the methodology was applied to the Fe-Ni-Cr ternary alloy system that constitutes many commercially important materials such as stainless steels and the H-series and C-series heat and corrosion resistant casting alloys. Three different techniques were developed for making alloy libraries: (1) vapor deposition of discrete thin films on an appropriate substrate and then alloying them together by solid-state diffusion; (2) co-deposition of the alloying elements from three separate magnetron sputtering sources onto an inert substrate; and (3) localized melting of thin films with a focused electron-beam welding system. Each of the techniques was found to have its own advantages and disadvantages. A new and very powerful technique for

  17. 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)

  18. Ranked solutions to a class of combinatorial optimizations - with applications in mass spectrometry based peptide sequencing

    Science.gov (United States)

    Doerr, Timothy; Alves, Gelio; Yu, Yi-Kuo

    2006-03-01

    Typical combinatorial optimizations are NP-hard; however, for a particular class of cost functions the corresponding combinatorial optimizations can be solved in polynomial time. This suggests a way to efficiently find approximate solutions - - find a transformation that makes the cost function as similar as possible to that of the solvable class. After keeping many high-ranking solutions using the approximate cost function, one may then re-assess these solutions with the full cost function to find the best approximate solution. Under this approach, it is important to be able to assess the quality of the solutions obtained, e.g., by finding the true ranking of kth best approximate solution when all possible solutions are considered exhaustively. To tackle this statistical issue, we provide a systematic method starting with a scaling function generated from the fininte number of high- ranking solutions followed by a convergent iterative mapping. This method, useful in a variant of the directed paths in random media problem proposed here, can also provide a statistical significance assessment for one of the most important proteomic tasks - - peptide sequencing using tandem mass spectrometry data.

  19. Combinatorial techniques to efficiently investigate and optimize organic thin film processing and properties.

    Science.gov (United States)

    Wieberger, Florian; Kolb, Tristan; Neuber, Christian; Ober, Christopher K; Schmidt, Hans-Werner

    2013-04-08

    In this article we present several developed and improved combinatorial techniques to optimize processing conditions and material properties of organic thin films. The combinatorial approach allows investigations of multi-variable dependencies and is the perfect tool to investigate organic thin films regarding their high performance purposes. In this context we develop and establish the reliable preparation of gradients of material composition, temperature, exposure, and immersion time. Furthermore we demonstrate the smart application of combinations of composition and processing gradients to create combinatorial libraries. First a binary combinatorial library is created by applying two gradients perpendicular to each other. A third gradient is carried out in very small areas and arranged matrix-like over the entire binary combinatorial library resulting in a ternary combinatorial library. Ternary combinatorial libraries allow identifying precise trends for the optimization of multi-variable dependent processes which is demonstrated on the lithographic patterning process. Here we verify conclusively the strong interaction and thus the interdependency of variables in the preparation and properties of complex organic thin film systems. The established gradient preparation techniques are not limited to lithographic patterning. It is possible to utilize and transfer the reported combinatorial techniques to other multi-variable dependent processes and to investigate and optimize thin film layers and devices for optical, electro-optical, and electronic applications.

  20. Combinatorial Techniques to Efficiently Investigate and Optimize Organic Thin Film Processing and Properties

    Directory of Open Access Journals (Sweden)

    Hans-Werner Schmidt

    2013-04-01

    Full Text Available In this article we present several developed and improved combinatorial techniques to optimize processing conditions and material properties of organic thin films. The combinatorial approach allows investigations of multi-variable dependencies and is the perfect tool to investigate organic thin films regarding their high performance purposes. In this context we develop and establish the reliable preparation of gradients of material composition, temperature, exposure, and immersion time. Furthermore we demonstrate the smart application of combinations of composition and processing gradients to create combinatorial libraries. First a binary combinatorial library is created by applying two gradients perpendicular to each other. A third gradient is carried out in very small areas and arranged matrix-like over the entire binary combinatorial library resulting in a ternary combinatorial library. Ternary combinatorial libraries allow identifying precise trends for the optimization of multi-variable dependent processes which is demonstrated on the lithographic patterning process. Here we verify conclusively the strong interaction and thus the interdependency of variables in the preparation and properties of complex organic thin film systems. The established gradient preparation techniques are not limited to lithographic patterning. It is possible to utilize and transfer the reported combinatorial techniques to other multi-variable dependent processes and to investigate and optimize thin film layers and devices for optical, electro-optical, and electronic applications.

  1. 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.

  2. Phase Transitions in Combinatorial Optimization Problems Basics, Algorithms and Statistical Mechanics

    CERN Document Server

    Hartmann, Alexander K

    2005-01-01

    A concise, comprehensive introduction to the topic of statistical physics of combinatorial optimization, bringing together theoretical concepts and algorithms from computer science with analytical methods from physics. The result bridges the gap between statistical physics and combinatorial optimization, investigating problems taken from theoretical computing, such as the vertex-cover problem, with the concepts and methods of theoretical physics. The authors cover rapid developments and analytical methods that are both extremely complex and spread by word-of-mouth, providing all the necessary

  3. 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.

  4. Crossover versus Mutation: A Comparative Analysis of the Evolutionary Strategy of Genetic Algorithms Applied to Combinatorial Optimization Problems

    Directory of Open Access Journals (Sweden)

    E. Osaba

    2014-01-01

    Full Text Available Since their first formulation, genetic algorithms (GAs have been one of the most widely used techniques to solve combinatorial optimization problems. The basic structure of the GAs is known by the scientific community, and thanks to their easy application and good performance, GAs are the focus of a lot of research works annually. Although throughout history there have been many studies analyzing various concepts of GAs, in the literature there are few studies that analyze objectively the influence of using blind crossover operators for combinatorial optimization problems. For this reason, in this paper a deep study on the influence of using them is conducted. The study is based on a comparison of nine techniques applied to four well-known combinatorial optimization problems. Six of the techniques are GAs with different configurations, and the remaining three are evolutionary algorithms that focus exclusively on the mutation process. Finally, to perform a reliable comparison of these results, a statistical study of them is made, performing the normal distribution z-test.

  5. Crossover versus Mutation: A Comparative Analysis of the Evolutionary Strategy of Genetic Algorithms Applied to Combinatorial Optimization Problems

    Science.gov (United States)

    Osaba, E.; Carballedo, R.; Diaz, F.; Onieva, E.; de la Iglesia, I.; Perallos, A.

    2014-01-01

    Since their first formulation, genetic algorithms (GAs) have been one of the most widely used techniques to solve combinatorial optimization problems. The basic structure of the GAs is known by the scientific community, and thanks to their easy application and good performance, GAs are the focus of a lot of research works annually. Although throughout history there have been many studies analyzing various concepts of GAs, in the literature there are few studies that analyze objectively the influence of using blind crossover operators for combinatorial optimization problems. For this reason, in this paper a deep study on the influence of using them is conducted. The study is based on a comparison of nine techniques applied to four well-known combinatorial optimization problems. Six of the techniques are GAs with different configurations, and the remaining three are evolutionary algorithms that focus exclusively on the mutation process. Finally, to perform a reliable comparison of these results, a statistical study of them is made, performing the normal distribution z-test. PMID:25165731

  6. Combinatorial thin film materials science: From alloy discovery and optimization to alloy design

    Energy Technology Data Exchange (ETDEWEB)

    Gebhardt, Thomas, E-mail: gebhardt@mch.rwth-aachen.de; Music, Denis; Takahashi, Tetsuya; Schneider, Jochen M.

    2012-06-30

    This paper provides an overview of modern alloy development, from discovery and optimization towards alloy design, based on combinatorial thin film materials science. The combinatorial approach, combining combinatorial materials synthesis of thin film composition-spreads with high-throughput property characterization has proven to be a powerful tool to delineate composition-structure-property relationships, and hence to efficiently identify composition windows with enhanced properties. Furthermore, and most importantly for alloy design, theoretical models and hypotheses can be critically appraised. Examples for alloy discovery, optimization, and alloy design of functional as well as structural materials are presented. Using Fe-Mn based alloys as an example, we show that the combination of modern electronic-structure calculations with the highly efficient combinatorial thin film composition-spread method constitutes an effective tool for knowledge-based alloy design.

  7. Combinatorial thin film materials science: From alloy discovery and optimization to alloy design

    International Nuclear Information System (INIS)

    Gebhardt, Thomas; Music, Denis; Takahashi, Tetsuya; Schneider, Jochen M.

    2012-01-01

    This paper provides an overview of modern alloy development, from discovery and optimization towards alloy design, based on combinatorial thin film materials science. The combinatorial approach, combining combinatorial materials synthesis of thin film composition-spreads with high-throughput property characterization has proven to be a powerful tool to delineate composition–structure–property relationships, and hence to efficiently identify composition windows with enhanced properties. Furthermore, and most importantly for alloy design, theoretical models and hypotheses can be critically appraised. Examples for alloy discovery, optimization, and alloy design of functional as well as structural materials are presented. Using Fe-Mn based alloys as an example, we show that the combination of modern electronic-structure calculations with the highly efficient combinatorial thin film composition-spread method constitutes an effective tool for knowledge-based alloy design.

  8. 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.

  9. A review of simheuristics: Extending metaheuristics to deal with stochastic combinatorial optimization problems

    Directory of Open Access Journals (Sweden)

    Angel A. Juan

    2015-12-01

    Full Text Available Many combinatorial optimization problems (COPs encountered in real-world logistics, transportation, production, healthcare, financial, telecommunication, and computing applications are NP-hard in nature. These real-life COPs are frequently characterized by their large-scale sizes and the need for obtaining high-quality solutions in short computing times, thus requiring the use of metaheuristic algorithms. Metaheuristics benefit from different random-search and parallelization paradigms, but they frequently assume that the problem inputs, the underlying objective function, and the set of optimization constraints are deterministic. However, uncertainty is all around us, which often makes deterministic models oversimplified versions of real-life systems. After completing an extensive review of related work, this paper describes a general methodology that allows for extending metaheuristics through simulation to solve stochastic COPs. ‘Simheuristics’ allow modelers for dealing with real-life uncertainty in a natural way by integrating simulation (in any of its variants into a metaheuristic-driven framework. These optimization-driven algorithms rely on the fact that efficient metaheuristics already exist for the deterministic version of the corresponding COP. Simheuristics also facilitate the introduction of risk and/or reliability analysis criteria during the assessment of alternative high-quality solutions to stochastic COPs. Several examples of applications in different fields illustrate the potential of the proposed methodology.

  10. A Hybrid Method for Modeling and Solving Supply Chain Optimization Problems with Soft and Logical Constraints

    Directory of Open Access Journals (Sweden)

    Paweł Sitek

    2016-01-01

    Full Text Available This paper presents a hybrid method for modeling and solving supply chain optimization problems with soft, hard, and logical constraints. Ability to implement soft and logical constraints is a very important functionality for supply chain optimization models. Such constraints are particularly useful for modeling problems resulting from commercial agreements, contracts, competition, technology, safety, and environmental conditions. Two programming and solving environments, mathematical programming (MP and constraint logic programming (CLP, were combined in the hybrid method. This integration, hybridization, and the adequate multidimensional transformation of the problem (as a presolving method helped to substantially reduce the search space of combinatorial models for supply chain optimization problems. The operation research MP and declarative CLP, where constraints are modeled in different ways and different solving procedures are implemented, were linked together to use the strengths of both. This approach is particularly important for the decision and combinatorial optimization models with the objective function and constraints, there are many decision variables, and these are summed (common in manufacturing, supply chain management, project management, and logistic problems. The ECLiPSe system with Eplex library was proposed to implement a hybrid method. Additionally, the proposed hybrid transformed model is compared with the MILP-Mixed Integer Linear Programming model on the same data instances. For illustrative models, its use allowed finding optimal solutions eight to one hundred times faster and reducing the size of the combinatorial problem to a significant extent.

  11. Theory of Randomized Search Heuristics in Combinatorial Optimization

    DEFF Research Database (Denmark)

    The rigorous mathematical analysis of randomized search heuristics(RSHs) with respect to their expected runtime is a growing research area where many results have been obtained in recent years. This class of heuristics includes well-known approaches such as Randomized Local Search (RLS), the Metr......The rigorous mathematical analysis of randomized search heuristics(RSHs) with respect to their expected runtime is a growing research area where many results have been obtained in recent years. This class of heuristics includes well-known approaches such as Randomized Local Search (RLS...... analysis of randomized algorithms to RSHs. Mostly, the expected runtime of RSHs on selected problems is analzyed. Thereby, we understand why and when RSHs are efficient optimizers and, conversely, when they cannot be efficient. The tutorial will give an overview on the analysis of RSHs for solving...

  12. 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)

  13. Editorial: Cologne/Twente workshop on graphs and combinatorial optimization CTW 2007

    NARCIS (Netherlands)

    Faigle, U.; Hurink, Johann L.

    2010-01-01

    The 6th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2007) was held at the University of Twente, The Netherlands, 29-31 May, 2007. The CTW started as a series of biennial meetings at the Universities of Cologne in Germany and Twente in the Netherlands. Ever increasing

  14. Two combinatorial optimization problems for SNP discovery using base-specific cleavage and mass spectrometry.

    Science.gov (United States)

    Chen, Xin; Wu, Qiong; Sun, Ruimin; Zhang, Louxin

    2012-01-01

    The discovery of single-nucleotide polymorphisms (SNPs) has important implications in a variety of genetic studies on human diseases and biological functions. One valuable approach proposed for SNP discovery is based on base-specific cleavage and mass spectrometry. However, it is still very challenging to achieve the full potential of this SNP discovery approach. In this study, we formulate two new combinatorial optimization problems. While both problems are aimed at reconstructing the sample sequence that would attain the minimum number of SNPs, they search over different candidate sequence spaces. The first problem, denoted as SNP - MSP, limits its search to sequences whose in silico predicted mass spectra have all their signals contained in the measured mass spectra. In contrast, the second problem, denoted as SNP - MSQ, limits its search to sequences whose in silico predicted mass spectra instead contain all the signals of the measured mass spectra. We present an exact dynamic programming algorithm for solving the SNP - MSP problem and also show that the SNP - MSQ problem is NP-hard by a reduction from a restricted variation of the 3-partition problem. We believe that an efficient solution to either problem above could offer a seamless integration of information in four complementary base-specific cleavage reactions, thereby improving the capability of the underlying biotechnology for sensitive and accurate SNP discovery.

  15. Dynamic Hierarchical Energy-Efficient Method Based on Combinatorial Optimization for Wireless Sensor Networks.

    Science.gov (United States)

    Chang, Yuchao; Tang, Hongying; Cheng, Yongbo; Zhao, Qin; Yuan, Baoqing Li andXiaobing

    2017-07-19

    Routing protocols based on topology control are significantly important for improving network longevity in wireless sensor networks (WSNs). Traditionally, some WSN routing protocols distribute uneven network traffic load to sensor nodes, which is not optimal for improving network longevity. Differently to conventional WSN routing protocols, we propose a dynamic hierarchical protocol based on combinatorial optimization (DHCO) to balance energy consumption of sensor nodes and to improve WSN longevity. For each sensor node, the DHCO algorithm obtains the optimal route by establishing a feasible routing set instead of selecting the cluster head or the next hop node. The process of obtaining the optimal route can be formulated as a combinatorial optimization problem. Specifically, the DHCO algorithm is carried out by the following procedures. It employs a hierarchy-based connection mechanism to construct a hierarchical network structure in which each sensor node is assigned to a special hierarchical subset; it utilizes the combinatorial optimization theory to establish the feasible routing set for each sensor node, and takes advantage of the maximum-minimum criterion to obtain their optimal routes to the base station. Various results of simulation experiments show effectiveness and superiority of the DHCO algorithm in comparison with state-of-the-art WSN routing algorithms, including low-energy adaptive clustering hierarchy (LEACH), hybrid energy-efficient distributed clustering (HEED), genetic protocol-based self-organizing network clustering (GASONeC), and double cost function-based routing (DCFR) algorithms.

  16. Models of resource allocation optimization when solving the control problems in organizational systems

    Science.gov (United States)

    Menshikh, V.; Samorokovskiy, A.; Avsentev, O.

    2018-03-01

    The mathematical model of optimizing the allocation of resources to reduce the time for management decisions and algorithms to solve the general problem of resource allocation. The optimization problem of choice of resources in organizational systems in order to reduce the total execution time of a job is solved. This problem is a complex three-level combinatorial problem, for the solving of which it is necessary to implement the solution to several specific problems: to estimate the duration of performing each action, depending on the number of performers within the group that performs this action; to estimate the total execution time of all actions depending on the quantitative composition of groups of performers; to find such a distribution of the existing resource of performers in groups to minimize the total execution time of all actions. In addition, algorithms to solve the general problem of resource allocation are proposed.

  17. Exponential lower bounds for polytopes in combinatorial optimization

    NARCIS (Netherlands)

    Fiorini, S. (Samuel); Massar, S. (Serge); Pokutta, S. (Sebastian); Tiwary, H.R. (Hans Raj); De Wolf, R. (Ronald)

    2015-01-01

    textabstractWe solve a 20-year old problem posed by Yannakakis and prove that no polynomial-size linear program (LP) exists whose associated polytope projects to the traveling salesman polytope, even if the LP is not required to be symmetric. Moreover, we prove that this holds also for the cut

  18. Exponential Lower Bounds for Polytopes in Combinatorial Optimization

    NARCIS (Netherlands)

    Fiorini, S.; Massar, S.; Pokutta, S.; Tiwary, H.R.; de Wolf, R.

    2015-01-01

    We solve a 20-year old problem posed by Yannakakis and prove that no polynomial-size linear program (LP) exists whose associated polytope projects to the traveling salesman polytope, even if the LP is not required to be symmetric. Moreover, we prove that this holds also for the cut polytope and the

  19. An Optimization Framework for Combining the Petroleum Replenishment Problem with the Optimal Bidding in Combinatorial Auctions

    Directory of Open Access Journals (Sweden)

    Chefi Triki

    2016-08-01

    Full Text Available We address in this paper a periodic petroleum station replenishment problem (PPSRP that aims to plan the delivery of petroleum products to a set of geographically dispatched stations. It is assumed that each station is characterized by its weekly demand and by its frequency of service. The main objective of the delivery process is to minimize the total travelled distance by the vailable trucks over an extended planning horizon. The problem configuration is described through a set of trucks with several compartments each and a set of stations with demands and prefixed delivery frequencies. Given such input data, the minimization of the total distance is subject to assignment and routing constraints that express the capacity limitations of each truck's compartment in terms of the frequency and the pathways' restrictions. In this paper, we develop and solve the full space mathematical formulation for the PPSRP with application to the Omani context. Our ultimate aim is to include such a model into an integrated framework having the objective of advising petroleum distribution companies on how to prepare bids in case of participation in combinatorial auctions of the transportation procurement.

  20. Combinatorial pretreatment and fermentation optimization enabled a record yield on lignin bioconversion.

    Science.gov (United States)

    Liu, Zhi-Hua; Xie, Shangxian; Lin, Furong; Jin, Mingjie; Yuan, Joshua S

    2018-01-01

    Lignin valorization has recently been considered to be an essential process for sustainable and cost-effective biorefineries. Lignin represents a potential new feedstock for value-added products. Oleaginous bacteria such as Rhodococcus opacus can produce intracellular lipids from biodegradation of aromatic substrates. These lipids can be used for biofuel production, which can potentially replace petroleum-derived chemicals. However, the low reactivity of lignin produced from pretreatment and the underdeveloped fermentation technology hindered lignin bioconversion to lipids. In this study, combinatorial pretreatment with an optimized fermentation strategy was evaluated to improve lignin valorization into lipids using R. opacus PD630. As opposed to single pretreatment, combinatorial pretreatment produced a 12.8-75.6% higher lipid concentration in fermentation using lignin as the carbon source. Gas chromatography-mass spectrometry analysis showed that combinatorial pretreatment released more aromatic monomers, which could be more readily utilized by lignin-degrading strains. Three detoxification strategies were used to remove potential inhibitors produced from pretreatment. After heating detoxification of the lignin stream, the lipid concentration further increased by 2.9-9.7%. Different fermentation strategies were evaluated in scale-up lipid fermentation using a 2.0-l fermenter. With laccase treatment of the lignin stream produced from combinatorial pretreatment, the highest cell dry weight and lipid concentration were 10.1 and 1.83 g/l, respectively, in fed-batch fermentation, with a total soluble substrate concentration of 40 g/l. The improvement of the lipid fermentation performance may have resulted from lignin depolymerization by the combinatorial pretreatment and laccase treatment, reduced inhibition effects by fed-batch fermentation, adequate oxygen supply, and an accurate pH control in the fermenter. Overall, these results demonstrate that combinatorial

  1. Phase Transitions in Combinatorial Optimization Problems: Basics, Algorithms and Statistical Mechanics

    Science.gov (United States)

    Hartmann, Alexander K.; Weigt, Martin

    2005-10-01

    A concise, comprehensive introduction to the topic of statistical physics of combinatorial optimization, bringing together theoretical concepts and algorithms from computer science with analytical methods from physics. The result bridges the gap between statistical physics and combinatorial optimization, investigating problems taken from theoretical computing, such as the vertex-cover problem, with the concepts and methods of theoretical physics. The authors cover rapid developments and analytical methods that are both extremely complex and spread by word-of-mouth, providing all the necessary basics in required detail. Throughout, the algorithms are shown with examples and calculations, while the proofs are given in a way suitable for graduate students, post-docs, and researchers. Ideal for newcomers to this young, multidisciplinary field.

  2. Machine learning meliorates computing and robustness in discrete combinatorial optimization problems.

    Directory of Open Access Journals (Sweden)

    Fushing Hsieh

    2016-11-01

    Full Text Available Discrete combinatorial optimization problems in real world are typically defined via an ensemble of potentially high dimensional measurements pertaining to all subjects of a system under study. We point out that such a data ensemble in fact embeds with system's information content that is not directly used in defining the combinatorial optimization problems. Can machine learning algorithms extract such information content and make combinatorial optimizing tasks more efficient? Would such algorithmic computations bring new perspectives into this classic topic of Applied Mathematics and Theoretical Computer Science? We show that answers to both questions are positive. One key reason is due to permutation invariance. That is, the data ensemble of subjects' measurement vectors is permutation invariant when it is represented through a subject-vs-measurement matrix. An unsupervised machine learning algorithm, called Data Mechanics (DM, is applied to find optimal permutations on row and column axes such that the permuted matrix reveals coupled deterministic and stochastic structures as the system's information content. The deterministic structures are shown to facilitate geometry-based divide-and-conquer scheme that helps optimizing task, while stochastic structures are used to generate an ensemble of mimicries retaining the deterministic structures, and then reveal the robustness pertaining to the original version of optimal solution. Two simulated systems, Assignment problem and Traveling Salesman problem, are considered. Beyond demonstrating computational advantages and intrinsic robustness in the two systems, we propose brand new robust optimal solutions. We believe such robust versions of optimal solutions are potentially more realistic and practical in real world settings.

  3. TARCMO: Theory and Algorithms for Robust, Combinatorial, Multicriteria Optimization

    Science.gov (United States)

    2016-11-28

    methods is presented in the book chapter [CG16d]. 4.4 Robust Timetable Information Problems. Timetable information is the process of determining a...Princeton and Oxford, 2009. [BTN98] A. Ben-Tal and A. Nemirovski. Robust convex optimization. Math - ematics of Operations Research, 23(4):769–805...Goerigk. A note on upper bounds to the robust knapsack problem with discrete scenarios. Annals of Operations Research, 223(1):461–469, 2014. [GS16] M

  4. Improved Monkey-King Genetic Algorithm for Solving Large Winner Determination in Combinatorial Auction

    Science.gov (United States)

    Li, Yuzhong

    Using GA solve the winner determination problem (WDP) with large bids and items, run under different distribution, because the search space is large, constraint complex and it may easy to produce infeasible solution, would affect the efficiency and quality of algorithm. This paper present improved MKGA, including three operator: preprocessing, insert bid and exchange recombination, and use Monkey-king elite preservation strategy. Experimental results show that improved MKGA is better than SGA in population size and computation. The problem that traditional branch and bound algorithm hard to solve, improved MKGA can solve and achieve better effect.

  5. Concept of combinatorial de novo design of drug-like molecules by particle swarm optimization.

    Science.gov (United States)

    Hartenfeller, Markus; Proschak, Ewgenij; Schüller, Andreas; Schneider, Gisbert

    2008-07-01

    We present a fast stochastic optimization algorithm for fragment-based molecular de novo design (COLIBREE, Combinatorial Library Breeding). The search strategy is based on a discrete version of particle swarm optimization. Molecules are represented by a scaffold, which remains constant during optimization, and variable linkers and side chains. Different linkers represent virtual chemical reactions. Side-chain building blocks were obtained from pseudo-retrosynthetic dissection of large compound databases. Here, ligand-based design was performed using chemically advanced template search (CATS) topological pharmacophore similarity to reference ligands as fitness function. A weighting scheme was included for particle swarm optimization-based molecular design, which permits the use of many reference ligands and allows for positive and negative design to be performed simultaneously. In a case study, the approach was applied to the de novo design of potential peroxisome proliferator-activated receptor subtype-selective agonists. The results demonstrate the ability of the technique to cope with large combinatorial chemistry spaces and its applicability to focused library design. The technique was able to perform exploitation of a known scheme and at the same time explorative search for novel ligands within the framework of a given molecular core structure. It thereby represents a practical solution for compound screening in the early hit and lead finding phase of a drug discovery project.

  6. Extensions of Dynamic Programming: Decision Trees, Combinatorial Optimization, and Data Mining

    KAUST Repository

    Hussain, Shahid

    2016-01-01

    This thesis is devoted to the development of extensions of dynamic programming to the study of decision trees. The considered extensions allow us to make multi-stage optimization of decision trees relative to a sequence of cost functions, to count the number of optimal trees, and to study relationships: cost vs cost and cost vs uncertainty for decision trees by construction of the set of Pareto-optimal points for the corresponding bi-criteria optimization problem. The applications include study of totally optimal (simultaneously optimal relative to a number of cost functions) decision trees for Boolean functions, improvement of bounds on complexity of decision trees for diagnosis of circuits, study of time and memory trade-off for corner point detection, study of decision rules derived from decision trees, creation of new procedure (multi-pruning) for construction of classifiers, and comparison of heuristics for decision tree construction. Part of these extensions (multi-stage optimization) was generalized to well-known combinatorial optimization problems: matrix chain multiplication, binary search trees, global sequence alignment, and optimal paths in directed graphs.

  7. Extensions of Dynamic Programming: Decision Trees, Combinatorial Optimization, and Data Mining

    KAUST Repository

    Hussain, Shahid

    2016-07-10

    This thesis is devoted to the development of extensions of dynamic programming to the study of decision trees. The considered extensions allow us to make multi-stage optimization of decision trees relative to a sequence of cost functions, to count the number of optimal trees, and to study relationships: cost vs cost and cost vs uncertainty for decision trees by construction of the set of Pareto-optimal points for the corresponding bi-criteria optimization problem. The applications include study of totally optimal (simultaneously optimal relative to a number of cost functions) decision trees for Boolean functions, improvement of bounds on complexity of decision trees for diagnosis of circuits, study of time and memory trade-off for corner point detection, study of decision rules derived from decision trees, creation of new procedure (multi-pruning) for construction of classifiers, and comparison of heuristics for decision tree construction. Part of these extensions (multi-stage optimization) was generalized to well-known combinatorial optimization problems: matrix chain multiplication, binary search trees, global sequence alignment, and optimal paths in directed graphs.

  8. Directed Bee Colony Optimization Algorithm to Solve the Nurse Rostering Problem.

    Science.gov (United States)

    Rajeswari, M; Amudhavel, J; Pothula, Sujatha; Dhavachelvan, P

    2017-01-01

    The Nurse Rostering Problem is an NP-hard combinatorial optimization, scheduling problem for assigning a set of nurses to shifts per day by considering both hard and soft constraints. A novel metaheuristic technique is required for solving Nurse Rostering Problem (NRP). This work proposes a metaheuristic technique called Directed Bee Colony Optimization Algorithm using the Modified Nelder-Mead Method for solving the NRP. To solve the NRP, the authors used a multiobjective mathematical programming model and proposed a methodology for the adaptation of a Multiobjective Directed Bee Colony Optimization (MODBCO). MODBCO is used successfully for solving the multiobjective problem of optimizing the scheduling problems. This MODBCO is an integration of deterministic local search, multiagent particle system environment, and honey bee decision-making process. The performance of the algorithm is assessed using the standard dataset INRC2010, and it reflects many real-world cases which vary in size and complexity. The experimental analysis uses statistical tools to show the uniqueness of the algorithm on assessment criteria.

  9. 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)

  10. Efficient high-precision matrix algebra on parallel architectures for nonlinear combinatorial optimization

    KAUST Repository

    Gunnels, John; Lee, Jon; Margulies, Susan

    2010-01-01

    We provide a first demonstration of the idea that matrix-based algorithms for nonlinear combinatorial optimization problems can be efficiently implemented. Such algorithms were mainly conceived by theoretical computer scientists for proving efficiency. We are able to demonstrate the practicality of our approach by developing an implementation on a massively parallel architecture, and exploiting scalable and efficient parallel implementations of algorithms for ultra high-precision linear algebra. Additionally, we have delineated and implemented the necessary algorithmic and coding changes required in order to address problems several orders of magnitude larger, dealing with the limits of scalability from memory footprint, computational efficiency, reliability, and interconnect perspectives. © Springer and Mathematical Programming Society 2010.

  11. Efficient high-precision matrix algebra on parallel architectures for nonlinear combinatorial optimization

    KAUST Repository

    Gunnels, John

    2010-06-01

    We provide a first demonstration of the idea that matrix-based algorithms for nonlinear combinatorial optimization problems can be efficiently implemented. Such algorithms were mainly conceived by theoretical computer scientists for proving efficiency. We are able to demonstrate the practicality of our approach by developing an implementation on a massively parallel architecture, and exploiting scalable and efficient parallel implementations of algorithms for ultra high-precision linear algebra. Additionally, we have delineated and implemented the necessary algorithmic and coding changes required in order to address problems several orders of magnitude larger, dealing with the limits of scalability from memory footprint, computational efficiency, reliability, and interconnect perspectives. © Springer and Mathematical Programming Society 2010.

  12. Solving the Container Stowage Problem (CSP) using Particle Swarm Optimization (PSO)

    Science.gov (United States)

    Matsaini; Santosa, Budi

    2018-04-01

    Container Stowage Problem (CSP) is a problem of containers arrangement into ships by considering rules such as: total weight, weight of one stack, destination, equilibrium, and placement of containers on vessel. Container stowage problem is combinatorial problem and hard to solve with enumeration technique. It is an NP-Hard Problem. Therefore, to find a solution, metaheuristics is preferred. The objective of solving the problem is to minimize the amount of shifting such that the unloading time is minimized. Particle Swarm Optimization (PSO) is proposed to solve the problem. The implementation of PSO is combined with some steps which are stack position change rules, stack changes based on destination, and stack changes based on the weight type of the stacks (light, medium, and heavy). The proposed method was applied on five different cases. The results were compared to Bee Swarm Optimization (BSO) and heuristics method. PSO provided mean of 0.87% gap and time gap of 60 second. While BSO provided mean of 2,98% gap and 459,6 second to the heuristcs.

  13. Combinatorial Algorithms for Portfolio Optimization Problems - Case of Risk Moderate Investor

    Science.gov (United States)

    Juarna, A.

    2017-03-01

    Portfolio optimization problem is a problem of finding optimal combination of n stocks from N ≥ n available stocks that gives maximal aggregate return and minimal aggregate risk. In this paper given N = 43 from the IDX (Indonesia Stock Exchange) group of the 45 most-traded stocks, known as the LQ45, with p = 24 data of monthly returns for each stock, spanned over interval 2013-2014. This problem actually is a combinatorial one where its algorithm is constructed based on two considerations: risk moderate type of investor and maximum allowed correlation coefficient between every two eligible stocks. The main outputs resulted from implementation of the algorithms is a multiple curve of three portfolio’s attributes, e.g. the size, the ratio of return to risk, and the percentage of negative correlation coefficient for every two chosen stocks, as function of maximum allowed correlation coefficient between each two stocks. The output curve shows that the portfolio contains three stocks with ratio of return to risk at 14.57 if the maximum allowed correlation coefficient between every two eligible stocks is negative and contains 19 stocks with maximum allowed correlation coefficient 0.17 to get maximum ratio of return to risk at 25.48.

  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. 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.

  16. 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. 

  17. 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.

  18. 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.

  19. 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.

  20. A convex optimization approach for solving large scale linear systems

    Directory of Open Access Journals (Sweden)

    Debora Cores

    2017-01-01

    Full Text Available The well-known Conjugate Gradient (CG method minimizes a strictly convex quadratic function for solving large-scale linear system of equations when the coefficient matrix is symmetric and positive definite. In this work we present and analyze a non-quadratic convex function for solving any large-scale linear system of equations regardless of the characteristics of the coefficient matrix. For finding the global minimizers, of this new convex function, any low-cost iterative optimization technique could be applied. In particular, we propose to use the low-cost globally convergent Spectral Projected Gradient (SPG method, which allow us to extend this optimization approach for solving consistent square and rectangular linear system, as well as linear feasibility problem, with and without convex constraints and with and without preconditioning strategies. Our numerical results indicate that the new scheme outperforms state-of-the-art iterative techniques for solving linear systems when the symmetric part of the coefficient matrix is indefinite, and also for solving linear feasibility problems.

  1. 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.

  2. 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.

  3. 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.

  4. A new evolutionary algorithm with LVQ learning for the optimization of combinatory problems as a reload of nuclear reactors

    International Nuclear Information System (INIS)

    Machado, Marcelo Dornellas

    1999-04-01

    Genetic algorithms are biologically motivated adaptive systems which have been used, with good results, for function optimization. In this work, a new learning mode, to be used by the Population-Based Incremental Learning (PBIL) algorithm, who combines mechanisms of standard genetic algorithm with simple competitive learning, 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 know as proportional reward. The development of this new algorithm aims its application in the optimization of reload problem of PWR nuclear reactors. This problem can be interpreted as search of a load pattern to be used in the nucleus of the reactor in order to increase the useful life of the nuclear fuel. For the test, two classes of problems are used: numerical problems and 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)

  5. Integer linear models with a polynomial number of variables and constraints for some classical combinatorial optimization problems

    Directory of Open Access Journals (Sweden)

    Nelson Maculan

    2003-01-01

    Full Text Available We present integer linear models with a polynomial number of variables and constraints for combinatorial optimization problems in graphs: optimum elementary cycles, optimum elementary paths and optimum tree problems.Apresentamos modelos lineares inteiros com um número polinomial de variáveis e restrições para problemas de otimização combinatória em grafos: ciclos elementares ótimos, caminhos elementares ótimos e problemas em árvores ótimas.

  6. Combinatorial chemistry

    DEFF Research Database (Denmark)

    Nielsen, John

    1994-01-01

    An overview of combinatorial chemistry is presented. Combinatorial chemistry, sometimes referred to as `irrational drug design,' involves the generation of molecular diversity. The resulting chemical library is then screened for biologically active compounds.......An overview of combinatorial chemistry is presented. Combinatorial chemistry, sometimes referred to as `irrational drug design,' involves the generation of molecular diversity. The resulting chemical library is then screened for biologically active compounds....

  7. Integer programming and combinatorial optimization : 15th international conference, IPCO 2011, New York NY, USA, June 15-17, 2011 : proceedings

    NARCIS (Netherlands)

    Günlük, O.; Woeginger, G.J.

    2011-01-01

    This volume contains the 33 papers presented at IPCO 2011, the 15th Conference on Integer Programming and Combinatorial Optimization, held during June 15–17, 2011 at the IBM T.J. Watson Research Center in New York, USA. IPCO conferences are sponsored by the Mathematical Optimization Society. The

  8. 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 .

  9. Combinatorial Optimization Algorithms for Dynamic Multiple Fault Diagnosis in Automotive and Aerospace Applications

    Science.gov (United States)

    Kodali, Anuradha

    In this thesis, we develop dynamic multiple fault diagnosis (DMFD) algorithms to diagnose faults that are sporadic and coupled. Firstly, we formulate a coupled factorial hidden Markov model-based (CFHMM) framework to diagnose dependent faults occurring over time (dynamic case). Here, we implement a mixed memory Markov coupling model to determine the most likely sequence of (dependent) fault states, the one that best explains the observed test outcomes over time. An iterative Gauss-Seidel coordinate ascent optimization method is proposed for solving the problem. A soft Viterbi algorithm is also implemented within the framework for decoding dependent fault states over time. We demonstrate the algorithm on simulated and real-world systems with coupled faults; the results show that this approach improves the correct isolation rate as compared to the formulation where independent fault states are assumed. Secondly, we formulate a generalization of set-covering, termed dynamic set-covering (DSC), which involves a series of coupled set-covering problems over time. The objective of the DSC problem is to infer the most probable time sequence of a parsimonious set of failure sources that explains the observed test outcomes over time. The DSC problem is NP-hard and intractable due to the fault-test dependency matrix that couples the failed tests and faults via the constraint matrix, and the temporal dependence of failure sources over time. Here, the DSC problem is motivated from the viewpoint of a dynamic multiple fault diagnosis problem, but it has wide applications in operations research, for e.g., facility location problem. Thus, we also formulated the DSC problem in the context of a dynamically evolving facility location problem. Here, a facility can be opened, closed, or can be temporarily unavailable at any time for a given requirement of demand points. These activities are associated with costs or penalties, viz., phase-in or phase-out for the opening or closing of a

  10. 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.

  11. Iterative optimization of xylose catabolism in Saccharomyces cerevisiae using combinatorial expression tuning.

    Science.gov (United States)

    Latimer, Luke N; Dueber, John E

    2017-06-01

    A common challenge in metabolic engineering is rapidly identifying rate-controlling enzymes in heterologous pathways for subsequent production improvement. We demonstrate a workflow to address this challenge and apply it to improving xylose utilization in Saccharomyces cerevisiae. For eight reactions required for conversion of xylose to ethanol, we screened enzymes for functional expression in S. cerevisiae, followed by a combinatorial expression analysis to achieve pathway flux balancing and identification of limiting enzymatic activities. In the next round of strain engineering, we increased the copy number of these limiting enzymes and again tested the eight-enzyme combinatorial expression library in this new background. This workflow yielded a strain that has a ∼70% increase in biomass yield and ∼240% increase in xylose utilization. Finally, we chromosomally integrated the expression library. This library enriched for strains with multiple integrations of the pathway, which likely were the result of tandem integrations mediated by promoter homology. Biotechnol. Bioeng. 2017;114: 1301-1309. © 2017 Wiley Periodicals, Inc. © 2017 Wiley Periodicals, Inc.

  12. Fragment Linking and Optimization of Inhibitors of the Aspartic Protease Endothiapepsin : Fragment-Based Drug Design Facilitated by Dynamic Combinatorial Chemistry

    NARCIS (Netherlands)

    Mondal, Milon; Radeva, Nedyalka; Fanlo-Virgos, Hugo; Otto, Sijbren; Klebe, Gerhard; Hirsch, Anna K. H.

    2016-01-01

    Fragment-based drug design (FBDD) affords active compounds for biological targets. While there are numerous reports on FBDD by fragment growing/optimization, fragment linking has rarely been reported. Dynamic combinatorial chemistry (DCC) has become a powerful hit-identification strategy for

  13. Solution of combinatorial optimization problems by an accelerated hopfield neural network. Kobai kasokugata poppu firudo nyuraru netto ni yoru kumiawase saitekika mondai no kaiho

    Energy Technology Data Exchange (ETDEWEB)

    Ohori, T.; Yamamoto, H.; Setsu, Nenso; Watanabe, K. (Hokkaido Inst. of Technology, Hokkaido (Japan))

    1994-04-20

    The accelerated approximate solution of combinatorial optimization problems by symmetry integrating hopfield neural network (NN) has been applied to many combinatorial problems such as the traveling salesman problem, the network planning problem, etc. However, the hopfield NN converges to local minimum solutions very slowly. In this paper, a general inclination model composed by introducing an accelerated parameter to the hopfield model is proposed, and it has been shown that the acceleration parameter can make the model converge to the local minima more quickly. Moreover, simulation experiments for random quadratic combinatorial problems with two and twenty-five variables were carried out. The results show that the acceleration of convergence makes the attraction region of the local minimum change and the accuracy of solution worse. If an initial point is selected around the center of unit hyper cube, solutions with high accuracy not affected by the acceleration parameter can be obtained. 9 refs., 8 figs., 3 tabs.

  14. Issues and Strategies in Solving Multidisciplinary Optimization Problems

    Science.gov (United States)

    Patnaik, Surya

    2013-01-01

    merit function with constraints imposed on failure modes and an optimization algorithm is used to generate the solution. Stochastic design concept accounts for uncertainties in loads, material properties, and other parameters and solution is obtained by solving a design optimization problem for a specified reliability. Acceptable solutions can be produced by all the three methods. The variation in the weight calculated by the methods was found to be modest. Some variation was noticed in designs calculated by the methods. The variation may be attributed to structural indeterminacy. It is prudent to develop design by all three methods prior to its fabrication. The traditional design method can be improved when the simplified sensitivities of the behavior constraint is used. Such sensitivity can reduce design calculations and may have a potential to unify the traditional and optimization methods. Weight versus reliability traced out an inverted-S-shaped graph. The center of the graph corresponded to mean valued design. A heavy design with weight approaching infinity could be produced for a near-zero rate of failure. Weight can be reduced to a small value for a most failure-prone design. Probabilistic modeling of load and material properties remained a challenge.

  15. 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.

  16. 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

  17. Combinatorial effect of mutagenesis and medium component optimization on Bacillus amyloliquefaciens antifungal activity and efficacy in eradicating Botrytis cinerea.

    Science.gov (United States)

    Masmoudi, Fatma; Ben Khedher, Saoussen; Kamoun, Amel; Zouari, Nabil; Tounsi, Slim; Trigui, Mohamed

    2017-04-01

    This work is directed towards Bacillus amyloliquefaciens strain BLB371 metabolite production for biocontrol of fungal phytopathogens. In order to maximise antifungal metabolite production by this strain, two approaches were combined: random mutagenesis and medium component optimization. After three rounds of mutagenesis, a hyper active mutant, named M3-7, was obtained. It produces 7 fold more antifungal metabolites (1800AU/mL) than the wild strain in MC medium. A hybrid design was applied to optimise a new medium to enhance antifungal metabolite production by M3-7. The new optimized medium (35g/L of peptone, 32.5g/L of sucrose, 10.5g/L of yeast extract, 2.4g/L of KH 2 PO 4 , 1.3g/L of MgSO 4 and 23mg/L of MnSO 4 ) achieved 1.62 fold enhancement in antifungal compound production (3000AU/mL) by this mutant, compared to that achieved in MC medium. Therefore, combinatory effect of these two approaches (mutagenesis and medium component optimization) allowed 12 fold improvement in antifungal activity (from 250UA/mL to 3000UA/mL). This improvement was confirmed against several phytopathogenic fungi with an increase of MIC and MFC over than 50%. More interestingly, a total eradication of gray mold was obtained on tomato fruits infected by Botrytis cinerea and treated by M3-7, compared to those treated by BLB371. From the practical point of view, combining random mutagenesis and medium optimization could be considered as an excellent tool for obtaining promising biological products useful against phytopathogenic fungi. Copyright © 2017 Elsevier GmbH. All rights reserved.

  18. 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

  19. 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.

  20. 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.

  1. Particle Swarm Optimization applied to combinatorial problem aiming the fuel recharge problem solution in a nuclear reactor; Particle swarm optimization aplicado ao problema combinatorio com vistas a solucao do problema de recarga em um reator nuclear

    Energy Technology Data Exchange (ETDEWEB)

    Meneses, Anderson Alvarenga de Moura; Schirru, Roberto [Universidade Federal, Rio de Janeiro, RJ (Brazil). Coordenacao dos Programas de Pos-graduacao de Engenharia. Programa de Engenharia Nuclear]. E-mail: ameneses@con.ufrj.br; schirru@lmp.ufrj.br

    2005-07-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)

  2. 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...

  3. 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...

  4. Combinatorial methods with computer applications

    CERN Document Server

    Gross, Jonathan L

    2007-01-01

    Combinatorial Methods with Computer Applications provides in-depth coverage of recurrences, generating functions, partitions, and permutations, along with some of the most interesting graph and network topics, design constructions, and finite geometries. Requiring only a foundation in discrete mathematics, it can serve as the textbook in a combinatorial methods course or in a combined graph theory and combinatorics course.After an introduction to combinatorics, the book explores six systematic approaches within a comprehensive framework: sequences, solving recurrences, evaluating summation exp

  5. Number systems and combinatorial problems

    OpenAIRE

    Yordzhev, Krasimir

    2014-01-01

    The present work has been designed for students in secondary school and their teachers in mathematics. We will show how with the help of our knowledge of number systems we can solve problems from other fields of mathematics for example in combinatorial analysis and most of all when proving some combinatorial identities. To demonstrate discussed in this article method we have chosen several suitable mathematical tasks.

  6. 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.

  7. Combinatorial Alanine Substitution Enables Rapid Optimization of Cytochrome P450BM3 for Selective Hydroxylation of Large Substrates

    KAUST Repository

    Lewis, Jared C.; Mantovani, Simone M.; Fu, Yu; Snow, Christopher D.; Komor, Russell S.; Wong , Chi-Huey; Arnold, Frances H.

    2010-01-01

    Made for each other: Combinatorial alanine substitution of active site residues in a thermostable cytochrome P450BM3 variant was used to generate an enzyme that is active with large substrates. Selective hydroxylation of methoxymethylated

  8. Ant colony optimization and constraint programming

    CERN Document Server

    Solnon, Christine

    2013-01-01

    Ant colony optimization is a metaheuristic which has been successfully applied to a wide range of combinatorial optimization problems. The author describes this metaheuristic and studies its efficiency for solving some hard combinatorial problems, with a specific focus on constraint programming. The text is organized into three parts. The first part introduces constraint programming, which provides high level features to declaratively model problems by means of constraints. It describes the main existing approaches for solving constraint satisfaction problems, including complete tree search

  9. Automatic generation of combinatorial test data

    CERN Document Server

    Zhang, Jian; Ma, Feifei

    2014-01-01

    This book reviews the state-of-the-art in combinatorial testing, with particular emphasis on the automatic generation of test data. It describes the most commonly used approaches in this area - including algebraic construction, greedy methods, evolutionary computation, constraint solving and optimization - and explains major algorithms with examples. In addition, the book lists a number of test generation tools, as well as benchmarks and applications. Addressing a multidisciplinary topic, it will be of particular interest to researchers and professionals in the areas of software testing, combi

  10. 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

  11. Statistical mechanical analysis of linear programming relaxation for combinatorial optimization problems.

    Science.gov (United States)

    Takabe, Satoshi; Hukushima, Koji

    2016-05-01

    Typical behavior of the linear programming (LP) problem is studied as a relaxation of the minimum vertex cover (min-VC), a type of integer programming (IP) problem. A lattice-gas model on the Erdös-Rényi random graphs of α-uniform hyperedges is proposed to express both the LP and IP problems of the min-VC in the common statistical mechanical model with a one-parameter family. Statistical mechanical analyses reveal for α=2 that the LP optimal solution is typically equal to that given by the IP below the critical average degree c=e in the thermodynamic limit. The critical threshold for good accuracy of the relaxation extends the mathematical result c=1 and coincides with the replica symmetry-breaking threshold of the IP. The LP relaxation for the minimum hitting sets with α≥3, minimum vertex covers on α-uniform random graphs, is also studied. Analytic and numerical results strongly suggest that the LP relaxation fails to estimate optimal values above the critical average degree c=e/(α-1) where the replica symmetry is broken.

  12. Statistical mechanical analysis of linear programming relaxation for combinatorial optimization problems

    Science.gov (United States)

    Takabe, Satoshi; Hukushima, Koji

    2016-05-01

    Typical behavior of the linear programming (LP) problem is studied as a relaxation of the minimum vertex cover (min-VC), a type of integer programming (IP) problem. A lattice-gas model on the Erdös-Rényi random graphs of α -uniform hyperedges is proposed to express both the LP and IP problems of the min-VC in the common statistical mechanical model with a one-parameter family. Statistical mechanical analyses reveal for α =2 that the LP optimal solution is typically equal to that given by the IP below the critical average degree c =e in the thermodynamic limit. The critical threshold for good accuracy of the relaxation extends the mathematical result c =1 and coincides with the replica symmetry-breaking threshold of the IP. The LP relaxation for the minimum hitting sets with α ≥3 , minimum vertex covers on α -uniform random graphs, is also studied. Analytic and numerical results strongly suggest that the LP relaxation fails to estimate optimal values above the critical average degree c =e /(α -1 ) where the replica symmetry is broken.

  13. Multiobjective Optimization in Combinatorial Wind Farms System Integration and Resistive SFCL Using Analytical Hierarchy Process

    DEFF Research Database (Denmark)

    Moghadasi, Amirhasan; Sarwat, Arif; Guerrero, Josep M.

    2016-01-01

    This paper presents a positive approach for low voltage ride-through (LVRT) improvement of the permanent magnet synchronous generator (PMSG) based on a large wind power plant (WPP) of 50MW. The proposed method utilizes the conventional current control strategy to provide a reactive power...... requirement and retain the active power production during and after the fault for the grid codes compliance. Besides that, a resistive superconducting fault current limiter (RSFCL) as an additional self-healing support is applied outside the WPP to further increase the rated active power of the installation...... on the extreme load reduction is effectively demonstrated. A large WPP has a complicated structure using several components, and the inclusion of RSFCL composes this layout more problematic for optimal performance of the system. Hence, the most-widely decision-making technique based on the analytic hierarchy...

  14. 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.

  15. MiYA, an efficient machine-learning workflow in conjunction with the YeastFab assembly strategy for combinatorial optimization of heterologous metabolic pathways in Saccharomyces cerevisiae.

    Science.gov (United States)

    Zhou, Yikang; Li, Gang; Dong, Junkai; Xing, Xin-Hui; Dai, Junbiao; Zhang, Chong

    2018-05-01

    Facing boosting ability to construct combinatorial metabolic pathways, how to search the metabolic sweet spot has become the rate-limiting step. We here reported an efficient Machine-learning workflow in conjunction with YeastFab Assembly strategy (MiYA) for combinatorial optimizing the large biosynthetic genotypic space of heterologous metabolic pathways in Saccharomyces cerevisiae. Using β-carotene biosynthetic pathway as example, we first demonstrated that MiYA has the power to search only a small fraction (2-5%) of combinatorial space to precisely tune the expression level of each gene with a machine-learning algorithm of an artificial neural network (ANN) ensemble to avoid over-fitting problem when dealing with a small number of training samples. We then applied MiYA to improve the biosynthesis of violacein. Feed with initial data from a colorimetric plate-based, pre-screened pool of 24 strains producing violacein, MiYA successfully predicted, and verified experimentally, the existence of a strain that showed a 2.42-fold titer improvement in violacein production among 3125 possible designs. Furthermore, MiYA was able to largely avoid the branch pathway of violacein biosynthesis that makes deoxyviolacein, and produces very pure violacein. Together, MiYA combines the advantages of standardized building blocks and machine learning to accelerate the Design-Build-Test-Learn (DBTL) cycle for combinatorial optimization of metabolic pathways, which could significantly accelerate the development of microbial cell factories. Copyright © 2018 International Metabolic Engineering Society. Published by Elsevier Inc. All rights reserved.

  16. Combinatorial Optimization for Energy Saving in Nickel Industry Non-Newtonian Fluid Pumping System

    International Nuclear Information System (INIS)

    Hernández Ramírez, Gabriel; Legra Lobaina, Aristides; Columbié Navarro, Angel; Marcos Aníbal León Segovia

    2017-01-01

    In the present work a study of the influence of the rheological parameters of the lateritic hydromixtures with the energetic ones of the pumping systems that guarantee the productivity of nickel company 'Commander Pedro Sotto Alba' is carried out. From an experimental study and through an estimator, the rheological parameters are modeled as a function of the factors: temperature, solids content, chemical and granulometric composition. From an appropriate discretization of the model of the lateritic hydrometer pumping system and the application of a Discrete Combination Optimization Double Sequencing procedure, the operating parameters of this system were obtained, in order to guarantee a flow rate of 1600 m3 / h and one Adequate solids concentration. It is concluded that the use of a mathematical model that relates the rheological parameters of the lateritic pulp and the energy parameters of the pumping system, guarantee the metallurgical and energy efficiency in the acid leaching process with an average increase in production between 1000-1500 T Ni + Co / y and an energy saving of 30 MWh /year. (author)

  17. The projection and optimization at solve engineering problems

    Directory of Open Access Journals (Sweden)

    A. Kulichenko

    2012-04-01

    Full Text Available The thesis studies of use position of the probability theory and statistics at solve of questions technology processes. The thesis represents the most prevailing methods and suggests methods of developing laws of function distribution of new random variables.

  18. Evolutionary Hybrid Particle Swarm Optimization Algorithm for Solving NP-Hard No-Wait Flow Shop Scheduling Problems

    Directory of Open Access Journals (Sweden)

    Laxmi A. Bewoor

    2017-10-01

    Full Text Available The no-wait flow shop is a flowshop in which the scheduling of jobs is continuous and simultaneous through all machines without waiting for any consecutive machines. The scheduling of a no-wait flow shop requires finding an appropriate sequence of jobs for scheduling, which in turn reduces total processing time. The classical brute force method for finding the probabilities of scheduling for improving the utilization of resources may become trapped in local optima, and this problem can hence be observed as a typical NP-hard combinatorial optimization problem that requires finding a near optimal solution with heuristic and metaheuristic techniques. This paper proposes an effective hybrid Particle Swarm Optimization (PSO metaheuristic algorithm for solving no-wait flow shop scheduling problems with the objective of minimizing the total flow time of jobs. This Proposed Hybrid Particle Swarm Optimization (PHPSO algorithm presents a solution by the random key representation rule for converting the continuous position information values of particles to a discrete job permutation. The proposed algorithm initializes population efficiently with the Nawaz-Enscore-Ham (NEH heuristic technique and uses an evolutionary search guided by the mechanism of PSO, as well as simulated annealing based on a local neighborhood search to avoid getting stuck in local optima and to provide the appropriate balance of global exploration and local exploitation. Extensive computational experiments are carried out based on Taillard’s benchmark suite. Computational results and comparisons with existing metaheuristics show that the PHPSO algorithm outperforms the existing methods in terms of quality search and robustness for the problem considered. The improvement in solution quality is confirmed by statistical tests of significance.

  19. LDRD final report : robust analysis of large-scale combinatorial applications.

    Energy Technology Data Exchange (ETDEWEB)

    Carr, Robert D.; Morrison, Todd (University of Colorado, Denver, CO); Hart, William Eugene; Benavides, Nicolas L. (Santa Clara University, Santa Clara, CA); Greenberg, Harvey J. (University of Colorado, Denver, CO); Watson, Jean-Paul; Phillips, Cynthia Ann

    2007-09-01

    Discrete models of large, complex systems like national infrastructures and complex logistics frameworks naturally incorporate many modeling uncertainties. Consequently, there is a clear need for optimization techniques that can robustly account for risks associated with modeling uncertainties. This report summarizes the progress of the Late-Start LDRD 'Robust Analysis of Largescale Combinatorial Applications'. This project developed new heuristics for solving robust optimization models, and developed new robust optimization models for describing uncertainty scenarios.

  20. 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

  1. 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)

  2. 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.

  3. Solving Bilevel Multiobjective Programming Problem by Elite Quantum Behaved Particle Swarm Optimization

    Directory of Open Access Journals (Sweden)

    Tao Zhang

    2012-01-01

    Full Text Available An elite quantum behaved particle swarm optimization (EQPSO algorithm is proposed, in which an elite strategy is exerted for the global best particle to prevent premature convergence of the swarm. The EQPSO algorithm is employed for solving bilevel multiobjective programming problem (BLMPP in this study, which has never been reported in other literatures. Finally, we use eight different test problems to measure and evaluate the proposed algorithm, including low dimension and high dimension BLMPPs, as well as attempt to solve the BLMPPs whose theoretical Pareto optimal front is not known. The experimental results show that the proposed algorithm is a feasible and efficient method for solving BLMPPs.

  4. Combinatorial Alanine Substitution Enables Rapid Optimization of Cytochrome P450BM3 for Selective Hydroxylation of Large Substrates

    KAUST Repository

    Lewis, Jared C.

    2010-11-24

    Made for each other: Combinatorial alanine substitution of active site residues in a thermostable cytochrome P450BM3 variant was used to generate an enzyme that is active with large substrates. Selective hydroxylation of methoxymethylated monosaccharides, alkaloids, and steroids was thus made possible (see Scheme). This approach could be useful for improving the activity of enzymes that show only limited activity with larger substrates. © 2010 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

  5. Optimal Homotopy Asymptotic Method for Solving System of Fredholm Integral Equations

    Directory of Open Access Journals (Sweden)

    Bahman Ghazanfari

    2013-08-01

    Full Text Available In this paper, optimal homotopy asymptotic method (OHAM is applied to solve system of Fredholm integral equations. The effectiveness of optimal homotopy asymptotic method is presented. This method provides easy tools to control the convergence region of approximating solution series wherever necessary. The results of OHAM are compared with homotopy perturbation method (HPM and Taylor series expansion method (TSEM.

  6. Systematization of Accurate Discrete Optimization Methods

    Directory of Open Access Journals (Sweden)

    V. A. Ovchinnikov

    2015-01-01

    Full Text Available The object of study of this paper is to define accurate methods for solving combinatorial optimization problems of structural synthesis. The aim of the work is to systemize the exact methods of discrete optimization and define their applicability to solve practical problems.The article presents the analysis, generalization and systematization of classical methods and algorithms described in the educational and scientific literature.As a result of research a systematic presentation of combinatorial methods for discrete optimization described in various sources is given, their capabilities are described and properties of the tasks to be solved using the appropriate methods are specified.

  7. Combinatorial materials synthesis and high-throughput screening: an integrated materials chip approach to mapping phase diagrams and discovery and optimization of functional materials.

    Science.gov (United States)

    Xiang, X D

    Combinatorial materials synthesis methods and high-throughput evaluation techniques have been developed to accelerate the process of materials discovery and optimization and phase-diagram mapping. Analogous to integrated circuit chips, integrated materials chips containing thousands of discrete different compositions or continuous phase diagrams, often in the form of high-quality epitaxial thin films, can be fabricated and screened for interesting properties. Microspot x-ray method, various optical measurement techniques, and a novel evanescent microwave microscope have been used to characterize the structural, optical, magnetic, and electrical properties of samples on the materials chips. These techniques are routinely used to discover/optimize and map phase diagrams of ferroelectric, dielectric, optical, magnetic, and superconducting materials.

  8. Optimal Homotopy Asymptotic Method for Solving the Linear Fredholm Integral Equations of the First Kind

    Directory of Open Access Journals (Sweden)

    Mohammad Almousa

    2013-01-01

    Full Text Available The aim of this study is to present the use of a semi analytical method called the optimal homotopy asymptotic method (OHAM for solving the linear Fredholm integral equations of the first kind. Three examples are discussed to show the ability of the method to solve the linear Fredholm integral equations of the first kind. The results indicated that the method is very effective and simple.

  9. Swarm based mean-variance mapping optimization (MVMOS) for solving economic dispatch

    Science.gov (United States)

    Khoa, T. H.; Vasant, P. M.; Singh, M. S. Balbir; Dieu, V. N.

    2014-10-01

    The economic dispatch (ED) is an essential optimization task in the power generation system. It is defined as the process of allocating the real power output of generation units to meet required load demand so as their total operating cost is minimized while satisfying all physical and operational constraints. This paper introduces a novel optimization which named as Swarm based Mean-variance mapping optimization (MVMOS). The technique is the extension of the original single particle mean-variance mapping optimization (MVMO). Its features make it potentially attractive algorithm for solving optimization problems. The proposed method is implemented for three test power systems, including 3, 13 and 20 thermal generation units with quadratic cost function and the obtained results are compared with many other methods available in the literature. Test results have indicated that the proposed method can efficiently implement for solving economic dispatch.

  10. Combinatorial process optimization for negative photo-imageable spin-on dielectrics and investigation of post-apply bake and post-exposure bake interactions

    Science.gov (United States)

    Kim, Jihoon; Zhang, Ruzhi M.; Wolfer, Elizabeth; Patel, Bharatkumar K.; Toukhy, Medhat; Bogusz, Zachary; Nagahara, Tatsuro

    2012-03-01

    Patternable dielectric materials were developed and introduced to reduce semiconductor manufacturing complexity and cost of ownership (CoO). However, the bestowed dual functionalities of photo-imageable spin-on dielectrics (PSOD) put great challenges on the material design and development. In this work, we investigated the combinatorial process optimization for the negative-tone PSOD lithography by employing the Temperature Gradient Plate (TGP) technique which significantly reduced the numbers of wafers processed and minimized the developmental time. We demonstrated that this TGP combinatorial is very efficient at evaluating the effects and interactions of several independent variables such as post-apply bake (PAB) and post-exposure bake (PEB). Unlike most of the conventional photoresists, PAB turned out to have a great effect on the PSOD pattern profiles. Based on our extensive investigation, we observed great correlation between PAB and PEB processes. In this paper, we will discuss the variation of pattern profiles as a matrix of PAB and PEB and propose two possible cross-linking mechanisms for the PSOD materials to explain the unusual experimental results.

  11. Multiobjective CVaR Optimization Model and Solving Method for Hydrothermal System Considering Uncertain Load Demand

    Directory of Open Access Journals (Sweden)

    Zhongfu Tan

    2015-01-01

    Full Text Available In order to solve the influence of load uncertainty on hydrothermal power system operation and achieve the optimal objectives of system power generation consumption, pollutant emissions, and first-stage hydropower station storage capacity, this paper introduced CVaR method and built a multiobjective optimization model and its solving method. In the optimization model, load demand’s actual values and deviation values are regarded as random variables, scheduling objective is redefined to meet confidence level requirement and system operation constraints and loss function constraints are taken into consideration. To solve the proposed model, this paper linearized nonlinear constraints, applied fuzzy satisfaction, fuzzy entropy, and weighted multiobjective function theories to build a fuzzy entropy multiobjective CVaR model. The model is a mixed integer linear programming problem. Then, six thermal power plants and three cascade hydropower stations are taken as the hydrothermal system for numerical simulation. The results verified that multiobjective CVaR method is applicable to solve hydrothermal scheduling problems. It can better reflect risk level of the scheduling result. The fuzzy entropy satisfaction degree solving algorithm can simplify solving difficulty and get the optimum operation scheduling scheme.

  12. 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.

  13. 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.

  14. A non-penalty recurrent neural network for solving a class of constrained optimization problems.

    Science.gov (United States)

    Hosseini, Alireza

    2016-01-01

    In this paper, we explain a methodology to analyze convergence of some differential inclusion-based neural networks for solving nonsmooth optimization problems. For a general differential inclusion, we show that if its right hand-side set valued map satisfies some conditions, then solution trajectory of the differential inclusion converges to optimal solution set of its corresponding in optimization problem. Based on the obtained methodology, we introduce a new recurrent neural network for solving nonsmooth optimization problems. Objective function does not need to be convex on R(n) nor does the new neural network model require any penalty parameter. We compare our new method with some penalty-based and non-penalty based models. Moreover for differentiable cases, we implement circuit diagram of the new neural network. Copyright © 2015 Elsevier Ltd. All rights reserved.

  15. 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...

  16. Solving Minimal Covering Location Problems with Single and Multiple Node Coverage

    Directory of Open Access Journals (Sweden)

    Darko DRAKULIĆ

    2016-12-01

    Full Text Available Location science represents a very attractiveresearch field in combinatorial optimization and it is in expansion in last five decades. The main objective of location problems is determining the best position for facilities in a given set of nodes.Location science includes techniques for modelling problemsand methods for solving them. This paper presents results of solving two types of minimal covering location problems, with single and multiple node coverage, by using CPLEX optimizer and Particle Swarm Optimization method.

  17. Solving complex maintenance planning optimization problems using stochastic simulation and multi-criteria fuzzy decision making

    International Nuclear Information System (INIS)

    Tahvili, Sahar; Österberg, Jonas; Silvestrov, Sergei; Biteus, Jonas

    2014-01-01

    One of the most important factors in the operations of many cooperations today is to maximize profit and one important tool to that effect is the optimization of maintenance activities. Maintenance activities is at the largest level divided into two major areas, corrective maintenance (CM) and preventive maintenance (PM). When optimizing maintenance activities, by a maintenance plan or policy, we seek to find the best activities to perform at each point in time, be it PM or CM. We explore the use of stochastic simulation, genetic algorithms and other tools for solving complex maintenance planning optimization problems in terms of a suggested framework model based on discrete event simulation

  18. TUTORIALS ON AFRICAN BUFFALO OPTIMIZATION FOR SOLVING THE TRAVELLING SALESMAN PROBLEM

    Directory of Open Access Journals (Sweden)

    Odili J.B

    2017-03-01

    Full Text Available The African Buffalo Optimization is a newly designed metaheuristic optimization algorithm inspired by the migration of African buffalos from place to place across the vast African forests, deserts and savannah in search of food. Being a new algorithm, several researchers from different parts of the research world have indicated huge interest in understanding the working of the novel algorithm. This paper presents a practical demonstration of the workings of the African Buffalo Optimization in solving the popular travelling salesman problem. It is our belief that this tutorial paper will be helpful in further introducing the new algorithm and making it user-friendly.

  19. Solving complex maintenance planning optimization problems using stochastic simulation and multi-criteria fuzzy decision making

    Energy Technology Data Exchange (ETDEWEB)

    Tahvili, Sahar [Mälardalen University (Sweden); Österberg, Jonas; Silvestrov, Sergei [Division of Applied Mathematics, Mälardalen University (Sweden); Biteus, Jonas [Scania CV (Sweden)

    2014-12-10

    One of the most important factors in the operations of many cooperations today is to maximize profit and one important tool to that effect is the optimization of maintenance activities. Maintenance activities is at the largest level divided into two major areas, corrective maintenance (CM) and preventive maintenance (PM). When optimizing maintenance activities, by a maintenance plan or policy, we seek to find the best activities to perform at each point in time, be it PM or CM. We explore the use of stochastic simulation, genetic algorithms and other tools for solving complex maintenance planning optimization problems in terms of a suggested framework model based on discrete event simulation.

  20. Fast Combinatorial Algorithm for the Solution of Linearly Constrained Least Squares Problems

    Science.gov (United States)

    Van Benthem, Mark H.; Keenan, Michael R.

    2008-11-11

    A fast combinatorial algorithm can significantly reduce the computational burden when solving general equality and inequality constrained least squares problems with large numbers of observation vectors. The combinatorial algorithm provides a mathematically rigorous solution and operates at great speed by reorganizing the calculations to take advantage of the combinatorial nature of the problems to be solved. The combinatorial algorithm exploits the structure that exists in large-scale problems in order to minimize the number of arithmetic operations required to obtain a solution.

  1. Multi-objective Optimization Algorithms with the Island Metaheuristic for Effective Project Management Problem Solving

    Directory of Open Access Journals (Sweden)

    Brester Christina

    2017-12-01

    Full Text Available Background and Purpose: In every organization, project management raises many different decision-making problems, a large proportion of which can be efficiently solved using specific decision-making support systems. Yet such kinds of problems are always a challenge since there is no time-efficient or computationally efficient algorithm to solve them as a result of their complexity. In this study, we consider the problem of optimal financial investment. In our solution, we take into account the following organizational resource and project characteristics: profits, costs and risks.

  2. Solving bi-level optimization problems in engineering design using kriging models

    Science.gov (United States)

    Xia, Yi; Liu, Xiaojie; Du, Gang

    2018-05-01

    Stackelberg game-theoretic approaches are applied extensively in engineering design to handle distributed collaboration decisions. Bi-level genetic algorithms (BLGAs) and response surfaces have been used to solve the corresponding bi-level programming models. However, the computational costs for BLGAs often increase rapidly with the complexity of lower-level programs, and optimal solution functions sometimes cannot be approximated by response surfaces. This article proposes a new method, namely the optimal solution function approximation by kriging model (OSFAKM), in which kriging models are used to approximate the optimal solution functions. A detailed example demonstrates that OSFAKM can obtain better solutions than BLGAs and response surface-based methods, and at the same time reduce the workload of computation remarkably. Five benchmark problems and a case study of the optimal design of a thin-walled pressure vessel are also presented to illustrate the feasibility and potential of the proposed method for bi-level optimization in engineering design.

  3. Combinatorial Discovery and Optimization of the Composition, Doping and Morphology of New Oxide Semiconductors for Efficient Photoelectrochemical Water Splitting

    Energy Technology Data Exchange (ETDEWEB)

    Parkinson, Bruce A. [Univ. of Wyoming, Laramie, WY (United States); Jianghua, He [Univ. of Wyoming, Laramie, WY (United States)

    2015-01-06

    The increasing need for carbon free energy has focused renewed attention on solar energy conversion. Although photovoltaic cells excel at directly converting of solar energy to electricity, they do not directly produce stored energy or fuels that account for more than 75% of current energy use. Direct photoelectrolysis of water has the advantage of converting solar energy directly to hydrogen, an ideal non-carbon and nonpolluting energy carrier, by replacing both a photovoltaic array and an electrolysis unit with one potentially inexpensive device. Unfortunately no materials are currently known to efficiently photoelectrolyze water that are, efficient, inexpensive and stable under illumination in electrolytes for many years. Nanostructured semiconducting metal oxides could potentially fulfill these requirements, making them the most promising materials for solar water photoelectrolysis, however no oxide semiconductor has yet been discovered with all the required properties. We have developed a simple, high-throughput combinatorial approach to prepare and screen many multi component metal oxides for water photoelectrolysis activity. The approach uses ink jet printing of overlapping patterns of soluble metal oxide precursors onto conductive glass substrates. Subsequent pyrolysis produces metal oxide phases that are screened for photoelectrolysis activity by measuring photocurrents produced by scanning a laser over the printed patterns in aqueous electrolytes. Several promising and unexpected compositions have been identified.

  4. Comparing genetic algorithm and particle swarm optimization for solving capacitated vehicle routing problem

    Science.gov (United States)

    Iswari, T.; Asih, A. M. S.

    2018-04-01

    In the logistics system, transportation plays an important role to connect every element in the supply chain, but it can produces the greatest cost. Therefore, it is important to make the transportation costs as minimum as possible. Reducing the transportation cost can be done in several ways. One of the ways to minimizing the transportation cost is by optimizing the routing of its vehicles. It refers to Vehicle Routing Problem (VRP). The most common type of VRP is Capacitated Vehicle Routing Problem (CVRP). In CVRP, the vehicles have their own capacity and the total demands from the customer should not exceed the capacity of the vehicle. CVRP belongs to the class of NP-hard problems. These NP-hard problems make it more complex to solve such that exact algorithms become highly time-consuming with the increases in problem sizes. Thus, for large-scale problem instances, as typically found in industrial applications, finding an optimal solution is not practicable. Therefore, this paper uses two kinds of metaheuristics approach to solving CVRP. Those are Genetic Algorithm and Particle Swarm Optimization. This paper compares the results of both algorithms and see the performance of each algorithm. The results show that both algorithms perform well in solving CVRP but still needs to be improved. From algorithm testing and numerical example, Genetic Algorithm yields a better solution than Particle Swarm Optimization in total distance travelled.

  5. 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

  6. The World of Combinatorial Fuzzy Problems and the Efficiency of Fuzzy Approximation Algorithms

    OpenAIRE

    Yamakami, Tomoyuki

    2015-01-01

    We re-examine a practical aspect of combinatorial fuzzy problems of various types, including search, counting, optimization, and decision problems. We are focused only on those fuzzy problems that take series of fuzzy input objects and produce fuzzy values. To solve such problems efficiently, we design fast fuzzy algorithms, which are modeled by polynomial-time deterministic fuzzy Turing machines equipped with read-only auxiliary tapes and write-only output tapes and also modeled by polynomia...

  7. Cryptographic Combinatorial Securities Exchanges

    Science.gov (United States)

    Thorpe, Christopher; Parkes, David C.

    We present a useful new mechanism that facilitates the atomic exchange of many large baskets of securities in a combinatorial exchange. Cryptography prevents information about the securities in the baskets from being exploited, enhancing trust. Our exchange offers institutions who wish to trade large positions a new alternative to existing methods of block trading: they can reduce transaction costs by taking advantage of other institutions’ available liquidity, while third party liquidity providers guarantee execution—preserving their desired portfolio composition at all times. In our exchange, institutions submit encrypted orders which are crossed, leaving a “remainder”. The exchange proves facts about the portfolio risk of this remainder to third party liquidity providers without revealing the securities in the remainder, the knowledge of which could also be exploited. The third parties learn either (depending on the setting) the portfolio risk parameters of the remainder itself, or how their own portfolio risk would change if they were to incorporate the remainder into a portfolio they submit. In one setting, these third parties submit bids on the commission, and the winner supplies necessary liquidity for the entire exchange to clear. This guaranteed clearing, coupled with external price discovery from the primary markets for the securities, sidesteps difficult combinatorial optimization problems. This latter method of proving how taking on the remainder would change risk parameters of one’s own portfolio, without revealing the remainder’s contents or its own risk parameters, is a useful protocol of independent interest.

  8. SOLVING OPTIMAL ASSEMBLY LINE CONFIGURATION TASK BY MULTIOBJECTIVE DECISION MAKING METHODS

    Directory of Open Access Journals (Sweden)

    Ján ČABALA

    2017-06-01

    Full Text Available This paper deals with looking for the optimal configuration of automated assembly line model placed within Department of Cybernetics and Artificial Intelligence (DCAI. In order to solve this problem, Stateflow model of each configuration was created to simulate the behaviour of particular assembly line configuration. Outputs from these models were used as inputs into the multiobjective decision making process. Multi-objective decision-making methods were subsequently used to find the optimal configuration of assembly line. Paper describes the whole process of solving this task, from building the models to choosing the best configuration. Specifically, the problem was resolved using the experts’ evaluation method for evaluating the weights of every decision-making criterion, while the ELECTRE III, TOPSIS and AGREPREF methods were used for ordering the possible solutions from the most to the least suitable alternative. Obtained results were compared and final solution of this multi-objective decisionmaking problem is chosen.

  9. Fragment Linking and Optimization of Inhibitors of the Aspartic Protease Endothiapepsin: Fragment-Based Drug Design Facilitated by Dynamic Combinatorial Chemistry.

    Science.gov (United States)

    Mondal, Milon; Radeva, Nedyalka; Fanlo-Virgós, Hugo; Otto, Sijbren; Klebe, Gerhard; Hirsch, Anna K H

    2016-08-01

    Fragment-based drug design (FBDD) affords active compounds for biological targets. While there are numerous reports on FBDD by fragment growing/optimization, fragment linking has rarely been reported. Dynamic combinatorial chemistry (DCC) has become a powerful hit-identification strategy for biological targets. We report the synergistic combination of fragment linking and DCC to identify inhibitors of the aspartic protease endothiapepsin. Based on X-ray crystal structures of endothiapepsin in complex with fragments, we designed a library of bis-acylhydrazones and used DCC to identify potent inhibitors. The most potent inhibitor exhibits an IC50 value of 54 nm, which represents a 240-fold improvement in potency compared to the parent hits. Subsequent X-ray crystallography validated the predicted binding mode, thus demonstrating the efficiency of the combination of fragment linking and DCC as a hit-identification strategy. This approach could be applied to a range of biological targets, and holds the potential to facilitate hit-to-lead optimization. © 2016 The Authors. Published by Wiley-VCH Verlag GmbH & Co. KGaA.

  10. Fragment Linking and Optimization of Inhibitors of the Aspartic Protease Endothiapepsin: Fragment‐Based Drug Design Facilitated by Dynamic Combinatorial Chemistry

    Science.gov (United States)

    Mondal, Milon; Radeva, Nedyalka; Fanlo‐Virgós, Hugo; Otto, Sijbren; Klebe, Gerhard

    2016-01-01

    Abstract Fragment‐based drug design (FBDD) affords active compounds for biological targets. While there are numerous reports on FBDD by fragment growing/optimization, fragment linking has rarely been reported. Dynamic combinatorial chemistry (DCC) has become a powerful hit‐identification strategy for biological targets. We report the synergistic combination of fragment linking and DCC to identify inhibitors of the aspartic protease endothiapepsin. Based on X‐ray crystal structures of endothiapepsin in complex with fragments, we designed a library of bis‐acylhydrazones and used DCC to identify potent inhibitors. The most potent inhibitor exhibits an IC50 value of 54 nm, which represents a 240‐fold improvement in potency compared to the parent hits. Subsequent X‐ray crystallography validated the predicted binding mode, thus demonstrating the efficiency of the combination of fragment linking and DCC as a hit‐identification strategy. This approach could be applied to a range of biological targets, and holds the potential to facilitate hit‐to‐lead optimization. PMID:27400756

  11. A Comparative Study of Fuzzy Logic, Genetic Algorithm, and Gradient-Genetic Algorithm Optimization Methods for Solving the Unit Commitment Problem

    Directory of Open Access Journals (Sweden)

    Sahbi Marrouchi

    2014-01-01

    Full Text Available Due to the continuous increase of the population and the perpetual progress of industry, the energy management presents nowadays a relevant topic that concerns researchers in electrical engineering. Indeed, in order to establish a good exploitation of the electrical grid, it is necessary to solve technical and economic problems. This can only be done through the resolution of the Unit Commitment Problem. Unit Commitment Problem allows optimizing the combination of the production units’ states and determining their production planning, in order to satisfy the expected consumption with minimal cost during a specified period which varies usually from 24 hours to one week. However, each production unit has some constraints that make this problem complex, combinatorial, and nonlinear. This paper presents a comparative study between a strategy based on hybrid gradient-genetic algorithm method and two strategies based on metaheuristic methods, fuzzy logic, and genetic algorithm, in order to predict the combinations and the unit commitment scheduling of each production unit in one side and to minimize the total production cost in the other side. To test the performance of the optimization proposed strategies, strategies have been applied to the IEEE electrical network 14 busses and the obtained results are very promising.

  12. Stress-constrained truss topology optimization problems that can be solved by linear programming

    DEFF Research Database (Denmark)

    Stolpe, Mathias; Svanberg, Krister

    2004-01-01

    We consider the problem of simultaneously selecting the material and determining the area of each bar in a truss structure in such a way that the cost of the structure is minimized subject to stress constraints under a single load condition. We show that such problems can be solved by linear...... programming to give the global optimum, and that two different materials are always sufficient in an optimal structure....

  13. A Hybrid Programming Framework for Modeling and Solving Constraint Satisfaction and Optimization Problems

    OpenAIRE

    Sitek, Paweł; Wikarek, Jarosław

    2016-01-01

    This paper proposes a hybrid programming framework for modeling and solving of constraint satisfaction problems (CSPs) and constraint optimization problems (COPs). Two paradigms, CLP (constraint logic programming) and MP (mathematical programming), are integrated in the framework. The integration is supplemented with the original method of problem transformation, used in the framework as a presolving method. The transformation substantially reduces the feasible solution space. The framework a...

  14. A Note on Using Partitioning Techniques for Solving Unconstrained Optimization Problems on Parallel Systems

    Directory of Open Access Journals (Sweden)

    Mehiddin Al-Baali

    2015-12-01

    Full Text Available We deal with the design of parallel algorithms by using variable partitioning techniques to solve nonlinear optimization problems. We propose an iterative solution method that is very efficient for separable functions, our scope being to discuss its performance for general functions. Experimental results on an illustrative example have suggested some useful modifications that, even though they improve the efficiency of our parallel method, leave some questions open for further investigation.

  15. Solving conic optimization problems via self-dual embedding and facial reduction: A unified approach

    DEFF Research Database (Denmark)

    Permenter, Frank; Friberg, Henrik A.; Andersen, Erling D.

    2017-01-01

    it fails to return a primal-dual optimal solution or a certificate of infeasibility. Using this observation, we give an algorithm based on facial reduction for solving the primal problem that, in principle, always succeeds. (An analogous algorithm is easily stated for the dual problem.) This algorithm has...... the appealing property that it only performs facial reduction when it is required, not when it is possible; e.g., if a primal-dual optimal solution exists, it will be found in lieu of a facial reduction certificate even if Slater's condition fails. For the case of linear, second-order, and semidefinite...

  16. An Efficient Approach for Solving Mesh Optimization Problems Using Newton’s Method

    Directory of Open Access Journals (Sweden)

    Jibum Kim

    2014-01-01

    Full Text Available We present an efficient approach for solving various mesh optimization problems. Our approach is based on Newton’s method, which uses both first-order (gradient and second-order (Hessian derivatives of the nonlinear objective function. The volume and surface mesh optimization algorithms are developed such that mesh validity and surface constraints are satisfied. We also propose several Hessian modification methods when the Hessian matrix is not positive definite. We demonstrate our approach by comparing our method with nonlinear conjugate gradient and steepest descent methods in terms of both efficiency and mesh quality.

  17. 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...

  18. Combinatorial techniques

    CERN Document Server

    Sane, Sharad S

    2013-01-01

    This is a basic text on combinatorics that deals with all the three aspects of the discipline: tricks, techniques and theory, and attempts to blend them. The book has several distinctive features. Probability and random variables with their interconnections to permutations are discussed. The theme of parity has been specially included and it covers applications ranging from solving the Nim game to the quadratic reciprocity law. Chapters related to geometry include triangulations and Sperner's theorem, classification of regular polytopes, tilings and an introduction to the Eulcidean Ramsey theory. Material on group actions covers Sylow theory, automorphism groups and a classification of finite subgroups of orthogonal groups. All chapters have a large number of exercises with varying degrees of difficulty, ranging from material suitable for Mathematical Olympiads to research.

  19. 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.

  20. A novel algorithm for solving optimal path planning problems based on parametrization method and fuzzy aggregation

    International Nuclear Information System (INIS)

    Zamirian, M.; Kamyad, A.V.; Farahi, M.H.

    2009-01-01

    In this Letter a new approach for solving optimal path planning problems for a single rigid and free moving object in a two and three dimensional space in the presence of stationary or moving obstacles is presented. In this approach the path planning problems have some incompatible objectives such as the length of path that must be minimized, the distance between the path and obstacles that must be maximized and etc., then a multi-objective dynamic optimization problem (MODOP) is achieved. Considering the imprecise nature of decision maker's (DM) judgment, these multiple objectives are viewed as fuzzy variables. By determining intervals for the values of these fuzzy variables, flexible monotonic decreasing or increasing membership functions are determined as the degrees of satisfaction of these fuzzy variables on their intervals. Then, the optimal path planning policy is searched by maximizing the aggregated fuzzy decision values, resulting in a fuzzy multi-objective dynamic optimization problem (FMODOP). Using a suitable t-norm, the FMODOP is converted into a non-linear dynamic optimization problem (NLDOP). By using parametrization method and some calculations, the NLDOP is converted into the sequence of conventional non-linear programming problems (NLPP). It is proved that the solution of this sequence of the NLPPs tends to a Pareto optimal solution which, among other Pareto optimal solutions, has the best satisfaction of DM for the MODOP. Finally, the above procedure as a novel algorithm integrating parametrization method and fuzzy aggregation to solve the MODOP is proposed. Efficiency of our approach is confirmed by some numerical examples.

  1. A Hybrid Optimization Method for Solving Bayesian Inverse Problems under Uncertainty.

    Directory of Open Access Journals (Sweden)

    Kai Zhang

    Full Text Available In this paper, we investigate the application of a new method, the Finite Difference and Stochastic Gradient (Hybrid method, for history matching in reservoir models. History matching is one of the processes of solving an inverse problem by calibrating reservoir models to dynamic behaviour of the reservoir in which an objective function is formulated based on a Bayesian approach for optimization. The goal of history matching is to identify the minimum value of an objective function that expresses the misfit between the predicted and measured data of a reservoir. To address the optimization problem, we present a novel application using a combination of the stochastic gradient and finite difference methods for solving inverse problems. The optimization is constrained by a linear equation that contains the reservoir parameters. We reformulate the reservoir model's parameters and dynamic data by operating the objective function, the approximate gradient of which can guarantee convergence. At each iteration step, we obtain the relatively 'important' elements of the gradient, which are subsequently substituted by the values from the Finite Difference method through comparing the magnitude of the components of the stochastic gradient, which forms a new gradient, and we subsequently iterate with the new gradient. Through the application of the Hybrid method, we efficiently and accurately optimize the objective function. We present a number numerical simulations in this paper that show that the method is accurate and computationally efficient.

  2. Characterizing the combinatorial beam angle selection problem

    Science.gov (United States)

    Bangert, Mark; Ziegenhein, Peter; Oelfke, Uwe

    2012-10-01

    The beam angle selection (BAS) problem in intensity-modulated radiation therapy is often interpreted as a combinatorial optimization problem, i.e. finding the best combination of η beams in a discrete set of candidate beams. It is well established that the combinatorial BAS problem may be solved efficiently with metaheuristics such as simulated annealing or genetic algorithms. However, the underlying parameters of the optimization process, such as the inclusion of non-coplanar candidate beams, the angular resolution in the space of candidate beams, and the number of evaluated beam ensembles as well as the relative performance of different metaheuristics have not yet been systematically investigated. We study these open questions in a meta-analysis of four strategies for combinatorial optimization in order to provide a reference for future research related to the BAS problem in intensity-modulated radiation therapy treatment planning. We introduce a high-performance inverse planning engine for BAS. It performs a full fluence optimization for ≈3600 treatment plans per hour while handling up to 50 GB of dose influence data (≈1400 candidate beams). For three head and neck patients, we compare the relative performance of a genetic, a cross-entropy, a simulated annealing and a naive iterative algorithm. The selection of ensembles with 5, 7, 9 and 11 beams considering either only coplanar or all feasible candidate beams is studied for an angular resolution of 5°, 10°, 15° and 20° in the space of candidate beams. The impact of different convergence criteria is investigated in comparison to a fixed termination after the evaluation of 10 000 beam ensembles. In total, our simulations comprise a full fluence optimization for about 3000 000 treatment plans. All four combinatorial BAS strategies yield significant improvements of the objective function value and of the corresponding dose distributions compared to standard beam configurations with equi

  3. Characterizing the combinatorial beam angle selection problem

    International Nuclear Information System (INIS)

    Bangert, Mark; Ziegenhein, Peter; Oelfke, Uwe

    2012-01-01

    The beam angle selection (BAS) problem in intensity-modulated radiation therapy is often interpreted as a combinatorial optimization problem, i.e. finding the best combination of η beams in a discrete set of candidate beams. It is well established that the combinatorial BAS problem may be solved efficiently with metaheuristics such as simulated annealing or genetic algorithms. However, the underlying parameters of the optimization process, such as the inclusion of non-coplanar candidate beams, the angular resolution in the space of candidate beams, and the number of evaluated beam ensembles as well as the relative performance of different metaheuristics have not yet been systematically investigated. We study these open questions in a meta-analysis of four strategies for combinatorial optimization in order to provide a reference for future research related to the BAS problem in intensity-modulated radiation therapy treatment planning. We introduce a high-performance inverse planning engine for BAS. It performs a full fluence optimization for ≈3600 treatment plans per hour while handling up to 50 GB of dose influence data (≈1400 candidate beams). For three head and neck patients, we compare the relative performance of a genetic, a cross-entropy, a simulated annealing and a naive iterative algorithm. The selection of ensembles with 5, 7, 9 and 11 beams considering either only coplanar or all feasible candidate beams is studied for an angular resolution of 5°, 10°, 15° and 20° in the space of candidate beams. The impact of different convergence criteria is investigated in comparison to a fixed termination after the evaluation of 10 000 beam ensembles. In total, our simulations comprise a full fluence optimization for about 3000 000 treatment plans. All four combinatorial BAS strategies yield significant improvements of the objective function value and of the corresponding dose distributions compared to standard beam configurations with equi

  4. 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.

  5. Solving Multi-Resource Constrained Project Scheduling Problem using Ant Colony Optimization

    Directory of Open Access Journals (Sweden)

    Hsiang-Hsi Huang

    2015-01-01

    Full Text Available This paper applied Ant Colony Optimization (ACO to develop a resource constraints scheduling model to achieve the resource allocation optimization and the shortest completion time of a project under resource constraints and the activities precedence requirement for projects. Resource leveling is also discussed and has to be achieved under the resource allocation optimization in this research. Testing cases and examples adopted from the international test bank were studied for verifying the effectiveness of the proposed model. The results showed that the solutions of different cases all have a better performance within a reasonable time. These can be obtained through ACO algorithm under the same constrained conditions. A program was written for the proposed model that is able to automatically produce the project resource requirement figure after the project duration is solved.

  6. Racing Sampling Based Microimmune Optimization Approach Solving Constrained Expected Value Programming

    Directory of Open Access Journals (Sweden)

    Kai Yang

    2016-01-01

    Full Text Available This work investigates a bioinspired microimmune optimization algorithm to solve a general kind of single-objective nonlinear constrained expected value programming without any prior distribution. In the study of algorithm, two lower bound sample estimates of random variables are theoretically developed to estimate the empirical values of individuals. Two adaptive racing sampling schemes are designed to identify those competitive individuals in a given population, by which high-quality individuals can obtain large sampling size. An immune evolutionary mechanism, along with a local search approach, is constructed to evolve the current population. The comparative experiments have showed that the proposed algorithm can effectively solve higher-dimensional benchmark problems and is of potential for further applications.

  7. Solving optimum operation of single pump unit problem with ant colony optimization (ACO) algorithm

    International Nuclear Information System (INIS)

    Yuan, Y; Liu, C

    2012-01-01

    For pumping stations, the effective scheduling of daily pump operations from solutions to the optimum design operation problem is one of the greatest potential areas for energy cost-savings, there are some difficulties in solving this problem with traditional optimization methods due to the multimodality of the solution region. In this case, an ACO model for optimum operation of pumping unit is proposed and the solution method by ants searching is presented by rationally setting the object function and constrained conditions. A weighted directed graph was constructed and feasible solutions may be found by iteratively searching of artificial ants, and then the optimal solution can be obtained by applying the rule of state transition and the pheromone updating. An example calculation was conducted and the minimum cost was found as 4.9979. The result of ant colony algorithm was compared with the result from dynamic programming or evolutionary solving method in commercial software under the same discrete condition. The result of ACO is better and the computing time is shorter which indicates that ACO algorithm can provide a high application value to the field of optimal operation of pumping stations and related fields.

  8. Efficient Parallel Sorting for Migrating Birds Optimization When Solving Machine-Part Cell Formation Problems

    Directory of Open Access Journals (Sweden)

    Ricardo Soto

    2016-01-01

    Full Text Available The Machine-Part Cell Formation Problem (MPCFP is a NP-Hard optimization problem that consists in grouping machines and parts in a set of cells, so that each cell can operate independently and the intercell movements are minimized. This problem has largely been tackled in the literature by using different techniques ranging from classic methods such as linear programming to more modern nature-inspired metaheuristics. In this paper, we present an efficient parallel version of the Migrating Birds Optimization metaheuristic for solving the MPCFP. Migrating Birds Optimization is a population metaheuristic based on the V-Flight formation of the migrating birds, which is proven to be an effective formation in energy saving. This approach is enhanced by the smart incorporation of parallel procedures that notably improve performance of the several sorting processes performed by the metaheuristic. We perform computational experiments on 1080 benchmarks resulting from the combination of 90 well-known MPCFP instances with 12 sorting configurations with and without threads. We illustrate promising results where the proposal is able to reach the global optimum in all instances, while the solving time with respect to a nonparallel approach is notably reduced.

  9. Solving the Traveling Salesman’s Problem Using the African Buffalo Optimization

    Directory of Open Access Journals (Sweden)

    Julius Beneoluchi Odili

    2016-01-01

    Full Text Available This paper proposes the African Buffalo Optimization (ABO which is a new metaheuristic algorithm that is derived from careful observation of the African buffalos, a species of wild cows, in the African forests and savannahs. This animal displays uncommon intelligence, strategic organizational skills, and exceptional navigational ingenuity in its traversal of the African landscape in search for food. The African Buffalo Optimization builds a mathematical model from the behavior of this animal and uses the model to solve 33 benchmark symmetric Traveling Salesman’s Problem and six difficult asymmetric instances from the TSPLIB. This study shows that buffalos are able to ensure excellent exploration and exploitation of the search space through regular communication, cooperation, and good memory of its previous personal exploits as well as tapping from the herd’s collective exploits. The results obtained by using the ABO to solve these TSP cases were benchmarked against the results obtained by using other popular algorithms. The results obtained using the African Buffalo Optimization algorithm are very competitive.

  10. Improved teaching-learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems

    Science.gov (United States)

    Buddala, Raviteja; Mahapatra, Siba Sankar

    2017-11-01

    Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having `g' operations is performed on `g' operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem becomes a flexible flow shop problem (FFSP). FFSP which contains all the complexities involved in a simple flow shop and parallel machine scheduling problems is a well-known NP-hard (Non-deterministic polynomial time) problem. Owing to high computational complexity involved in solving these problems, it is not always possible to obtain an optimal solution in a reasonable computation time. To obtain near-optimal solutions in a reasonable computation time, a large variety of meta-heuristics have been proposed in the past. However, tuning algorithm-specific parameters for solving FFSP is rather tricky and time consuming. To address this limitation, teaching-learning-based optimization (TLBO) and JAYA algorithm are chosen for the study because these are not only recent meta-heuristics but they do not require tuning of algorithm-specific parameters. Although these algorithms seem to be elegant, they lose solution diversity after few iterations and get trapped at the local optima. To alleviate such drawback, a new local search procedure is proposed in this paper to improve the solution quality. Further, mutation strategy (inspired from genetic algorithm) is incorporated in the basic algorithm to maintain solution diversity in the population. Computational experiments have been conducted on standard benchmark problems to calculate makespan and computational time. It is found that the rate of convergence of TLBO is superior to JAYA. From the results, it is found that TLBO and JAYA outperform many algorithms reported in the literature and can be treated as efficient methods for solving the FFSP.

  11. A Parallel Biological Optimization Algorithm to Solve the Unbalanced Assignment Problem Based on DNA Molecular Computing.

    Science.gov (United States)

    Wang, Zhaocai; Pu, Jun; Cao, Liling; Tan, Jian

    2015-10-23

    The unbalanced assignment problem (UAP) is to optimally resolve the problem of assigning n jobs to m individuals (m applied mathematics, having numerous real life applications. In this paper, we present a new parallel DNA algorithm for solving the unbalanced assignment problem using DNA molecular operations. We reasonably design flexible-length DNA strands representing different jobs and individuals, take appropriate steps, and get the solutions of the UAP in the proper length range and O(mn) time. We extend the application of DNA molecular operations and simultaneity to simplify the complexity of the computation.

  12. Electromagnetic Problems Solving by Conformal Mapping: A Mathematical Operator for Optimization

    Directory of Open Access Journals (Sweden)

    Wesley Pacheco Calixto

    2010-01-01

    Full Text Available Having the property to modify only the geometry of a polygonal structure, preserving its physical magnitudes, the Conformal Mapping is an exceptional tool to solve electromagnetism problems with known boundary conditions. This work aims to introduce a new developed mathematical operator, based on polynomial extrapolation. This operator has the capacity to accelerate an optimization method applied in conformal mappings, to determinate the equipotential lines, the field lines, the capacitance, and the permeance of some polygonal geometry electrical devices with an inner dielectric of permittivity ε. The results obtained in this work are compared with other simulations performed by the software of finite elements method, Flux 2D.

  13. A numerical technique for solving fractional optimal control problems and fractional Riccati differential equations

    Directory of Open Access Journals (Sweden)

    F. Ghomanjani

    2016-10-01

    Full Text Available In the present paper, we apply the Bezier curves method for solving fractional optimal control problems (OCPs and fractional Riccati differential equations. The main advantage of this method is that it can reduce the error of the approximate solutions. Hence, the solutions obtained using the Bezier curve method give good approximations. Some numerical examples are provided to confirm the accuracy of the proposed method. All of the numerical computations have been performed on a PC using several programs written in MAPLE 13.

  14. A novel meta-heuristic optimization methodology for solving various types of economic dispatch problem

    Energy Technology Data Exchange (ETDEWEB)

    Fesanghary, M. [Department of Mechanical Engineering, Louisiana State University, 2508 Patrick Taylor Hall, Baton Rouge, LA 70808 (United States); Ardehali, M.M. [Energy Research Center, Department of Electrical Engineering, Amirkabir University of Technology (Tehran Polytechnic), 424-Hafez Avenue, 15875-4413 Tehran (Iran)

    2009-06-15

    The increasing costs of fuel and operation of thermal power generating units warrant development of optimization methodologies for economic dispatch (ED) problems. Optimization methodologies that are based on meta-heuristic procedures could assist power generation policy analysts to achieve the goal of minimizing the generation costs. In this context, the objective of this study is to present a novel approach based on harmony search (HS) algorithm for solving ED problems, aiming to provide a practical alternative for conventional methods. To demonstrate the efficiency and applicability of the proposed method and for the purposes of comparison, various types of ED problems are examined. The results of this study show that the new proposed approach is able to find more economical loads than those determined by other methods. (author)

  15. An optimal iterative algorithm to solve Cauchy problem for Laplace equation

    KAUST Repository

    Majeed, Muhammad Usman

    2015-05-25

    An optimal mean square error minimizer algorithm is developed to solve severely ill-posed Cauchy problem for Laplace equation on an annulus domain. The mathematical problem is presented as a first order state space-like system and an optimal iterative algorithm is developed that minimizes the mean square error in states. Finite difference discretization schemes are used to discretize first order system. After numerical discretization algorithm equations are derived taking inspiration from Kalman filter however using one of the space variables as a time-like variable. Given Dirichlet and Neumann boundary conditions are used on the Cauchy data boundary and fictitious points are introduced on the unknown solution boundary. The algorithm is run for a number of iterations using the solution of previous iteration as a guess for the next one. The method developed happens to be highly robust to noise in Cauchy data and numerically efficient results are illustrated.

  16. A combination of genetic algorithm and particle swarm optimization method for solving traveling salesman problem

    Directory of Open Access Journals (Sweden)

    Keivan Borna

    2015-12-01

    Full Text Available Traveling salesman problem (TSP is a well-established NP-complete problem and many evolutionary techniques like particle swarm optimization (PSO are used to optimize existing solutions for that. PSO is a method inspired by the social behavior of birds. In PSO, each member will change its position in the search space, according to personal or social experience of the whole society. In this paper, we combine the principles of PSO and crossover operator of genetic algorithm to propose a heuristic algorithm for solving the TSP more efficiently. Finally, some experimental results on our algorithm are applied in some instances in TSPLIB to demonstrate the effectiveness of our methods which also show that our algorithm can achieve better results than other approaches.

  17. Collapsing of multigroup cross sections in optimization problems solved by means of the maximum principle of Pontryagin

    International Nuclear Information System (INIS)

    Anton, V.

    1979-05-01

    A new formulation of multigroup cross section collapsing based on the conservation of point or zone value of hamiltonian is presented. This attempt is proper to optimization problems solved by means of maximum principle of Pontryagin. (author)

  18. A Model of Students' Combinatorial Thinking

    Science.gov (United States)

    Lockwood, Elise

    2013-01-01

    Combinatorial topics have become increasingly prevalent in K-12 and undergraduate curricula, yet research on combinatorics education indicates that students face difficulties when solving counting problems. The research community has not yet addressed students' ways of thinking at a level that facilitates deeper understanding of how students…

  19. Solving the redundancy allocation problem with multiple strategy choices using a new simplified particle swarm optimization

    International Nuclear Information System (INIS)

    Kong, Xiangyong; Gao, Liqun; Ouyang, Haibin; Li, Steven

    2015-01-01

    In most research on redundancy allocation problem (RAP), the redundancy strategy for each subsystem is assumed to be predetermined and fixed. This paper focuses on a specific RAP with multiple strategy choices (RAP-MSC), in which both active redundancy and cold standby redundancy can be selected as an additional decision variable for individual subsystems. To do so, the component type, redundancy strategy and redundancy level for each subsystem should be chosen subject to the system constraints appropriately such that the system reliability is maximized. Meanwhile, imperfect switching for cold standby redundancy is considered and a k-Erlang distribution is introduced to model the time-to-failure component as well. Given the importance and complexity of RAP-MSC, we propose a new efficient simplified version of particle swarm optimization (SPSO) to solve such NP-hard problems. In this method, a new position updating scheme without velocity is presented with stochastic disturbance and a low probability. Moreover, it is compared with several well-known PSO variants and other state-of-the-art approaches in the literature to evaluate its performance. The experiment results demonstrate the superiority of SPSO as an alternative for solving the RAP-MSC. - Highlights: • A more realistic RAP form with multiple strategy choices is focused. • Redundancy strategies are to be selected rather than fixed in general RAP. • A new simplified particle swarm optimization is proposed. • Higher reliabilities are achieved than the state-of-the-art approaches.

  20. Probabilistic methods in combinatorial analysis

    CERN Document Server

    Sachkov, Vladimir N

    2014-01-01

    This 1997 work explores the role of probabilistic methods for solving combinatorial problems. These methods not only provide the means of efficiently using such notions as characteristic and generating functions, the moment method and so on but also let us use the powerful technique of limit theorems. The basic objects under investigation are nonnegative matrices, partitions and mappings of finite sets, with special emphasis on permutations and graphs, and equivalence classes specified on sequences of finite length consisting of elements of partially ordered sets; these specify the probabilist

  1. Using genetic algorithm to solve a new multi-period stochastic optimization model

    Science.gov (United States)

    Zhang, Xin-Li; Zhang, Ke-Cun

    2009-09-01

    This paper presents a new asset allocation model based on the CVaR risk measure and transaction costs. Institutional investors manage their strategic asset mix over time to achieve favorable returns subject to various uncertainties, policy and legal constraints, and other requirements. One may use a multi-period portfolio optimization model in order to determine an optimal asset mix. Recently, an alternative stochastic programming model with simulated paths was proposed by Hibiki [N. Hibiki, A hybrid simulation/tree multi-period stochastic programming model for optimal asset allocation, in: H. Takahashi, (Ed.) The Japanese Association of Financial Econometrics and Engineering, JAFFE Journal (2001) 89-119 (in Japanese); N. Hibiki A hybrid simulation/tree stochastic optimization model for dynamic asset allocation, in: B. Scherer (Ed.), Asset and Liability Management Tools: A Handbook for Best Practice, Risk Books, 2003, pp. 269-294], which was called a hybrid model. However, the transaction costs weren't considered in that paper. In this paper, we improve Hibiki's model in the following aspects: (1) The risk measure CVaR is introduced to control the wealth loss risk while maximizing the expected utility; (2) Typical market imperfections such as short sale constraints, proportional transaction costs are considered simultaneously. (3) Applying a genetic algorithm to solve the resulting model is discussed in detail. Numerical results show the suitability and feasibility of our methodology.

  2. Solving multiobjective optimal reactive power dispatch using modified NSGA-II

    Energy Technology Data Exchange (ETDEWEB)

    Jeyadevi, S.; Baskar, S.; Babulal, C.K.; Willjuice Iruthayarajan, M. [Department of Electrical and Electronics Engineering, Thiagarajar College of Engineering, Madurai, Tamilnadu 625 015 (India)

    2011-02-15

    This paper addresses an application of modified NSGA-II (MNSGA-II) by incorporating controlled elitism and dynamic crowding distance (DCD) strategies in NSGA-II to multiobjective optimal reactive power dispatch (ORPD) problem by minimizing real power loss and maximizing the system voltage stability. To validate the Pareto-front obtained using MNSGA-II, reference Pareto-front is generated using multiple runs of single objective optimization with weighted sum of objectives. For simulation purposes, IEEE 30 and IEEE 118 bus test systems are considered. The performance of MNSGA-II, NSGA-II and multiobjective particle swarm optimization (MOPSO) approaches are compared with respect to multiobjective performance measures. TOPSIS technique is applied on obtained non-dominated solutions to determine best compromise solution (BCS). Karush-Kuhn-Tucker (KKT) conditions are also applied on the obtained non-dominated solutions to substantiate a claim on optimality. Simulation results are quite promising and the MNSGA-II performs better than NSGA-II in maintaining diversity and authenticates its potential to solve multiobjective ORPD effectively. (author)

  3. Neurogenetic Algorithm for Solving Combinatorial Engineering Problems

    Directory of Open Access Journals (Sweden)

    M. Jalali Varnamkhasti

    2012-01-01

    Full Text Available Diversity of the population in a genetic algorithm plays an important role in impeding premature convergence. This paper proposes an adaptive neurofuzzy inference system genetic algorithm based on sexual selection. In this technique, for choosing the female chromosome during sexual selection, a bilinear allocation lifetime approach is used to label the chromosomes based on their fitness value which will then be used to characterize the diversity of the population. The motivation of this algorithm is to maintain the population diversity throughout the search procedure. To promote diversity, the proposed algorithm combines the concept of gender and age of individuals and the fuzzy logic during the selection of parents. In order to appraise the performance of the techniques used in this study, one of the chemistry problems and some nonlinear functions available in literature is used.

  4. Combinatorial commutative algebra

    CERN Document Server

    Miller, Ezra

    2005-01-01

    Offers an introduction to combinatorial commutative algebra, focusing on combinatorial techniques for multigraded polynomial rings, semigroup algebras, and determined rings. The chapters in this work cover topics ranging from homological invariants of monomial ideals and their polyhedral resolutions, to tools for studying algebraic varieties.

  5. Dynamic combinatorial chemistry

    NARCIS (Netherlands)

    Otto, Sijbren; Furlan, Ricardo L.E.; Sanders, Jeremy K.M.

    2002-01-01

    A combinatorial library that responds to its target by increasing the concentration of strong binders at the expense of weak binders sounds ideal. Dynamic combinatorial chemistry has the potential to achieve exactly this. In this review, we will highlight the unique features that distinguish dynamic

  6. Solving the economic dispatch problem with a modified quantum-behaved particle swarm optimization method

    International Nuclear Information System (INIS)

    Sun Jun; Fang Wei; Wang Daojun; Xu Wenbo

    2009-01-01

    In this paper, a modified quantum-behaved particle swarm optimization (QPSO) method is proposed to solve the economic dispatch (ED) problem in power systems, whose objective is to simultaneously minimize the generation cost rate while satisfying various equality and inequality constraints. The proposed method, denoted as QPSO-DM, combines the QPSO algorithm with differential mutation operation to enhance the global search ability of the algorithm. Many nonlinear characteristics of the generator, such as ramp rate limits, prohibited operating zones, and nonsmooth cost functions are considered when the proposed method is used in practical generator operation. The feasibility of the QPSO-DM method is demonstrated by three different power systems. It is compared with the QPSO, the differential evolution (DE), the particle swarm optimization (PSO), and the genetic algorithm (GA) in terms of the solution quality, robustness and convergence property. The simulation results show that the proposed QPSO-DM method is able to obtain higher quality solutions stably and efficiently in the ED problem than any other tested optimization algorithm.

  7. Solving iTOUGH2 simulation and optimization problems using the PEST protocol

    Energy Technology Data Exchange (ETDEWEB)

    Finsterle, S.A.; Zhang, Y.

    2011-02-01

    The PEST protocol has been implemented into the iTOUGH2 code, allowing the user to link any simulation program (with ASCII-based inputs and outputs) to iTOUGH2's sensitivity analysis, inverse modeling, and uncertainty quantification capabilities. These application models can be pre- or post-processors of the TOUGH2 non-isothermal multiphase flow and transport simulator, or programs that are unrelated to the TOUGH suite of codes. PEST-style template and instruction files are used, respectively, to pass input parameters updated by the iTOUGH2 optimization routines to the model, and to retrieve the model-calculated values that correspond to observable variables. We summarize the iTOUGH2 capabilities and demonstrate the flexibility added by the PEST protocol for the solution of a variety of simulation-optimization problems. In particular, the combination of loosely coupled and tightly integrated simulation and optimization routines provides both the flexibility and control needed to solve challenging inversion problems for the analysis of multiphase subsurface flow and transport systems.

  8. Solving the economic dispatch problem with a modified quantum-behaved particle swarm optimization method

    Energy Technology Data Exchange (ETDEWEB)

    Jun Sun; Wei Fang; Daojun Wang; Wenbo Xu [School of Information Technology, Jiangnan Univ., Wuxi, Jiangsu 214122 (China)

    2009-12-15

    In this paper, a modified quantum-behaved particle swarm optimization (QPSO) method is proposed to solve the economic dispatch (ED) problem in power systems, whose objective is to simultaneously minimize the generation cost rate while satisfying various equality and inequality constraints. The proposed method, denoted as QPSO-DM, combines the QPSO algorithm with differential mutation operation to enhance the global search ability of the algorithm. Many nonlinear characteristics of the generator, such as ramp rate limits, prohibited operating zones, and nonsmooth cost functions are considered when the proposed method is used in practical generator operation. The feasibility of the QPSO-DM method is demonstrated by three different power systems. It is compared with the QPSO, the differential evolution (DE), the particle swarm optimization (PSO), and the genetic algorithm (GA) in terms of the solution quality, robustness and convergence property. The simulation results show that the proposed QPSO-DM method is able to obtain higher quality solutions stably and efficiently in the ED problem than any other tested optimization algorithm. (author)

  9. A performance comparison of multi-objective optimization algorithms for solving nearly-zero-energy-building design problems

    NARCIS (Netherlands)

    Hamdy, M.; Nguyen, A.T. (Anh Tuan); Hensen, J.L.M.

    2016-01-01

    Integrated building design is inherently a multi-objective optimization problem where two or more conflicting objectives must be minimized and/or maximized concurrently. Many multi-objective optimization algorithms have been developed; however few of them are tested in solving building design

  10. 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...

  11. 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.

  12. Robustness of Operational Matrices of Differentiation for Solving State-Space Analysis and Optimal Control Problems

    Directory of Open Access Journals (Sweden)

    Emran Tohidi

    2013-01-01

    Full Text Available The idea of approximation by monomials together with the collocation technique over a uniform mesh for solving state-space analysis and optimal control problems (OCPs has been proposed in this paper. After imposing the Pontryagins maximum principle to the main OCPs, the problems reduce to a linear or nonlinear boundary value problem. In the linear case we propose a monomial collocation matrix approach, while in the nonlinear case, the general collocation method has been applied. We also show the efficiency of the operational matrices of differentiation with respect to the operational matrices of integration in our numerical examples. These matrices of integration are related to the Bessel, Walsh, Triangular, Laguerre, and Hermite functions.

  13. A Parallel Biological Optimization Algorithm to Solve the Unbalanced Assignment Problem Based on DNA Molecular Computing

    Directory of Open Access Journals (Sweden)

    Zhaocai Wang

    2015-10-01

    Full Text Available The unbalanced assignment problem (UAP is to optimally resolve the problem of assigning n jobs to m individuals (m < n, such that minimum cost or maximum profit obtained. It is a vitally important Non-deterministic Polynomial (NP complete problem in operation management and applied mathematics, having numerous real life applications. In this paper, we present a new parallel DNA algorithm for solving the unbalanced assignment problem using DNA molecular operations. We reasonably design flexible-length DNA strands representing different jobs and individuals, take appropriate steps, and get the solutions of the UAP in the proper length range and O(mn time. We extend the application of DNA molecular operations and simultaneity to simplify the complexity of the computation.

  14. Applying Particle Swarm Optimization for Solving Team Orienteering Problem with Time Windows

    Directory of Open Access Journals (Sweden)

    The Jin Ai

    2014-01-01

    Full Text Available The Team Orienteering Problem With Time Windows (TOPTW is a transportation problem case that have a set of vertices with a score, service time, and the time windows, start and final at a depot location. A number of paths are constructed to maximize the total collected score by the vertices which is visited. Each vertice can be visited only once and the visit can only start during the  time window of vertices. This paper proposes a Particle Swarm Optimization algorithm for solving the TOPTW, by defining a specific particle for representing the solution of TOPTW within the PSO algorithm and two alternatives, called PSO_TOPTW1 and PSO_TOPTW2, for translating the particle position to form the routes of the path. The performance of the proposed PSO algorithm is evaluated through some benchmark data problem available in the literature. The computational results show that the proposed PSO is able to produce sufficiently good TOPTW solutions that are comparable with corresponding solutions from other existing methods for solving the TOPTW.

  15. A Hybrid Programming Framework for Modeling and Solving Constraint Satisfaction and Optimization Problems

    Directory of Open Access Journals (Sweden)

    Paweł Sitek

    2016-01-01

    Full Text Available This paper proposes a hybrid programming framework for modeling and solving of constraint satisfaction problems (CSPs and constraint optimization problems (COPs. Two paradigms, CLP (constraint logic programming and MP (mathematical programming, are integrated in the framework. The integration is supplemented with the original method of problem transformation, used in the framework as a presolving method. The transformation substantially reduces the feasible solution space. The framework automatically generates CSP and COP models based on current values of data instances, questions asked by a user, and set of predicates and facts of the problem being modeled, which altogether constitute a knowledge database for the given problem. This dynamic generation of dedicated models, based on the knowledge base, together with the parameters changing externally, for example, the user’s questions, is the implementation of the autonomous search concept. The models are solved using the internal or external solvers integrated with the framework. The architecture of the framework as well as its implementation outline is also included in the paper. The effectiveness of the framework regarding the modeling and solution search is assessed through the illustrative examples relating to scheduling problems with additional constrained resources.

  16. Advanced Harmony Search with Ant Colony Optimization for Solving the Traveling Salesman Problem

    Directory of Open Access Journals (Sweden)

    Ho-Yoeng Yun

    2013-01-01

    Full Text Available We propose a novel heuristic algorithm based on the methods of advanced Harmony Search and Ant Colony Optimization (AHS-ACO to effectively solve the Traveling Salesman Problem (TSP. The TSP, in general, is well known as an NP-complete problem, whose computational complexity increases exponentially by increasing the number of cities. In our algorithm, Ant Colony Optimization (ACO is used to search the local optimum in the solution space, followed by the use of the Harmony Search to escape the local optimum determined by the ACO and to move towards a global optimum. Experiments were performed to validate the efficiency of our algorithm through a comparison with other algorithms and the optimum solutions presented in the TSPLIB. The results indicate that our algorithm is capable of generating the optimum solution for most instances in the TSPLIB; moreover, our algorithm found better solutions in two cases (kroB100 and pr144 when compared with the optimum solution presented in the TSPLIB.

  17. Hybrid particle swarm optimization with Cauchy distribution for solving reentrant flexible flow shop with blocking constraint

    Directory of Open Access Journals (Sweden)

    Chatnugrob Sangsawang

    2016-06-01

    Full Text Available This paper addresses a problem of the two-stage flexible flow shop with reentrant and blocking constraints in Hard Disk Drive Manufacturing. This problem can be formulated as a deterministic FFS|stage=2,rcrc, block|Cmax problem. In this study, adaptive Hybrid Particle Swarm Optimization with Cauchy distribution (HPSO was developed to solve the problem. The objective of this research is to find the sequences in order to minimize the makespan. To show their performances, computational experiments were performed on a number of test problems and the results are reported. Experimental results show that the proposed algorithms give better solutions than the classical Particle Swarm Optimization (PSO for all test problems. Additionally, the relative improvement (RI of the makespan solutions obtained by the proposed algorithms with respect to those of the current practice is performed in order to measure the quality of the makespan solutions generated by the proposed algorithms. The RI results show that the HPSO algorithm can improve the makespan solution by averages of 14.78%.

  18. Industrialised application of combinatorial optimization

    DEFF Research Database (Denmark)

    Hansen, Jesper

    2003-01-01

    This thesis is one of the results of CIAMM (Center for Industrialised Application of Mathematical Modelling). The center is composed of industrial companies e.g. Odense Steel Shipyard (OSS), Bang & Olufsen (B&O), Danish Technological Institute and 4 departments from 3 universities including...... Informatics and Mathematical Modelling at Technical University of Denmark....

  19. Combinatorial optimization algorithms and complexity

    CERN Document Server

    Papadimitriou, Christos H

    1998-01-01

    This clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NP-complete problems, more. All chapters are supplemented by thought-provoking problems. A useful work for graduate-level students with backgrounds in computer science, operations research, and electrical engineering.

  20. Nonparametric combinatorial sequence models.

    Science.gov (United States)

    Wauthier, Fabian L; Jordan, Michael I; Jojic, Nebojsa

    2011-11-01

    This work considers biological sequences that exhibit combinatorial structures in their composition: groups of positions of the aligned sequences are "linked" and covary as one unit across sequences. If multiple such groups exist, complex interactions can emerge between them. Sequences of this kind arise frequently in biology but methodologies for analyzing them are still being developed. This article presents a nonparametric prior on sequences which allows combinatorial structures to emerge and which induces a posterior distribution over factorized sequence representations. We carry out experiments on three biological sequence families which indicate that combinatorial structures are indeed present and that combinatorial sequence models can more succinctly describe them than simpler mixture models. We conclude with an application to MHC binding prediction which highlights the utility of the posterior distribution over sequence representations induced by the prior. By integrating out the posterior, our method compares favorably to leading binding predictors.

  1. Memetic Algorithms to Solve a Global Nonlinear Optimization Problem. A Review

    Directory of Open Access Journals (Sweden)

    M. K. Sakharov

    2015-01-01

    Full Text Available In recent decades, evolutionary algorithms have proven themselves as the powerful optimization techniques of search engine. Their popularity is due to the fact that they are easy to implement and can be used in all areas, since they are based on the idea of universal evolution. For example, in the problems of a large number of local optima, the traditional optimization methods, usually, fail in finding the global optimum. To solve such problems using a variety of stochastic methods, in particular, the so-called population-based algorithms, which are a kind of evolutionary methods. The main disadvantage of this class of methods is their slow convergence to the exact solution in the neighborhood of the global optimum, as these methods incapable to use the local information about the landscape of the function. This often limits their use in largescale real-world problems where the computation time is a critical factor.One of the promising directions in the field of modern evolutionary computation are memetic algorithms, which can be regarded as a combination of population search of the global optimum and local procedures for verifying solutions, which gives a synergistic effect. In the context of memetic algorithms, the meme is an implementation of the local optimization method to refine solution in the search.The concept of memetic algorithms provides ample opportunities for the development of various modifications of these algorithms, which can vary the frequency of the local search, the conditions of its end, and so on. The practically significant memetic algorithm modifications involve the simultaneous use of different memes. Such algorithms are called multi-memetic.The paper gives statement of the global problem of nonlinear unconstrained optimization, describes the most promising areas of AI modifications, including hybridization and metaoptimization. The main content of the work is the classification and review of existing varieties of

  2. Combinatorial Hybrid Systems

    DEFF Research Database (Denmark)

    Larsen, Jesper Abildgaard; Wisniewski, Rafal; Grunnet, Jacob Deleuran

    2008-01-01

    indicates for a given face the future simplex. In the suggested definition we allow nondeterminacy in form of splitting and merging of solution trajectories. The combinatorial vector field gives rise to combinatorial counterparts of most concepts from dynamical systems, such as duals to vector fields, flow......, flow lines, fixed points and Lyapunov functions. Finally it will be shown how this theory extends to switched dynamical systems and an algorithmic overview of how to do supervisory control will be shown towards the end....

  3. Artificial Immune Systems as a Modern Tool for Solving Multi-Purpose Optimization Tasks in the Field of Logistics

    Directory of Open Access Journals (Sweden)

    Skitsko Volodymyr I.

    2017-03-01

    Full Text Available The article investigates various aspects of the functioning of artificial immune systems and their using to solve different tasks. The analysis of the studied literature showed that nowadays there exist combinations of artificial immune systems, in particular with genetic algorithms, the particle swarm optimization method, artificial neural networks, etc., to solve different tasks. However, the solving of economic tasks is paid little attention. The article presents the basic terminology of artificial immune systems; the steps of the clonal selection algorithm are described, as well as a brief description of the negative selection algorithm, the immune network algorithm and the dendritic algorithm is given; conceptual aspects of the use of an artificial immune system for solving multi-purpose optimization problems are formulated, and an example of solving a problem in the field of logistics is described. Artificial immune systems as a means of solving various weakly structured, multi-criteria and multi-purpose economic tasks, in particular in the sphere of logistics, are a promising tool that requires further research. Therefore, it is advisable in the future to focus on the use of various existing immune algorithms for solving various economic problems.

  4. Discrete particle swarm optimization to solve multi-objective limited-wait hybrid flow shop scheduling problem

    Science.gov (United States)

    Santosa, B.; Siswanto, N.; Fiqihesa

    2018-04-01

    This paper proposes a discrete Particle Swam Optimization (PSO) to solve limited-wait hybrid flowshop scheduing problem with multi objectives. Flow shop schedulimg represents the condition when several machines are arranged in series and each job must be processed at each machine with same sequence. The objective functions are minimizing completion time (makespan), total tardiness time, and total machine idle time. Flow shop scheduling model always grows to cope with the real production system accurately. Since flow shop scheduling is a NP-Hard problem then the most suitable method to solve is metaheuristics. One of metaheuristics algorithm is Particle Swarm Optimization (PSO), an algorithm which is based on the behavior of a swarm. Originally, PSO was intended to solve continuous optimization problems. Since flow shop scheduling is a discrete optimization problem, then, we need to modify PSO to fit the problem. The modification is done by using probability transition matrix mechanism. While to handle multi objectives problem, we use Pareto Optimal (MPSO). The results of MPSO is better than the PSO because the MPSO solution set produced higher probability to find the optimal solution. Besides the MPSO solution set is closer to the optimal solution

  5. Distributed optimization using ant colony optimization in a concrete delivery supply chain

    NARCIS (Netherlands)

    Faria, J.M.; Silva, C.A.; Costa Sousa, da J.M.; Surico, M.; Kaymak, U.

    2006-01-01

    The timely production and distribution of rapidly perishable goods such as ready-mixed concrete is a complex combinatorial optimization problem in the context of supply chain management. The problem involves several tightly interrelated scheduling and routing problems that have to be solved

  6. A Variant of the Topkis-Veinott Method for Solving Inequality Constrained Optimization Problems

    International Nuclear Information System (INIS)

    Birge, J. R.; Qi, L.; Wei, Z.

    2000-01-01

    In this paper we give a variant of the Topkis-Veinott method for solving inequality constrained optimization problems. This method uses a linearly constrained positive semidefinite quadratic problem to generate a feasible descent direction at each iteration. Under mild assumptions, the algorithm is shown to be globally convergent in the sense that every accumulation point of the sequence generated by the algorithm is a Fritz-John point of the problem. We introduce a Fritz-John (FJ) function, an FJ1 strong second-order sufficiency condition (FJ1-SSOSC), and an FJ2 strong second-order sufficiency condition (FJ2-SSOSC), and then show, without any constraint qualification (CQ), that (i) if an FJ point z satisfies the FJ1-SSOSC, then there exists a neighborhood N(z) of z such that, for any FJ point y element of N(z) {z } , f 0 (y) ≠ f 0 (z) , where f 0 is the objective function of the problem; (ii) if an FJ point z satisfies the FJ2-SSOSC, then z is a strict local minimum of the problem. The result (i) implies that the entire iteration point sequence generated by the method converges to an FJ point. We also show that if the parameters are chosen large enough, a unit step length can be accepted by the proposed algorithm

  7. A note on “An alternative multiple attribute decision making methodology for solving optimal facility layout design selection problems”

    OpenAIRE

    R. Venkata Rao

    2012-01-01

    A paper published by Maniya and Bhatt (2011) (An alternative multiple attribute decision making methodology for solving optimal facility layout design selection problems, Computers & Industrial Engineering, 61, 542-549) proposed an alternative multiple attribute decision making method named as “Preference Selection Index (PSI) method” for selection of an optimal facility layout design. The authors had claimed that the method was logical and more appropriate and the method gives directly the o...

  8. Accessing Specific Peptide Recognition by Combinatorial Chemistry

    DEFF Research Database (Denmark)

    Li, Ming

    Molecular recognition is at the basis of all processes for life, and plays a central role in many biological processes, such as protein folding, the structural organization of cells and organelles, signal transduction, and the immune response. Hence, my PhD project is entitled “Accessing Specific...... Peptide Recognition by Combinatorial Chemistry”. Molecular recognition is a specific interaction between two or more molecules through noncovalent bonding, such as hydrogen bonding, metal coordination, van der Waals forces, π−π, hydrophobic, or electrostatic interactions. The association involves kinetic....... Combinatorial chemistry was invented in 1980s based on observation of functional aspects of the adaptive immune system. It was employed for drug development and optimization in conjunction with high-throughput synthesis and screening. (chapter 2) Combinatorial chemistry is able to rapidly produce many thousands...

  9. Solving a Higgs optimization problem with quantum annealing for machine learning.

    Science.gov (United States)

    Mott, Alex; Job, Joshua; Vlimant, Jean-Roch; Lidar, Daniel; Spiropulu, Maria

    2017-10-18

    The discovery of Higgs-boson decays in a background of standard-model processes was assisted by machine learning methods. The classifiers used to separate signals such as these from background are trained using highly unerring but not completely perfect simulations of the physical processes involved, often resulting in incorrect labelling of background processes or signals (label noise) and systematic errors. Here we use quantum and classical annealing (probabilistic techniques for approximating the global maximum or minimum of a given function) to solve a Higgs-signal-versus-background machine learning optimization problem, mapped to a problem of finding the ground state of a corresponding Ising spin model. We build a set of weak classifiers based on the kinematic observables of the Higgs decay photons, which we then use to construct a strong classifier. This strong classifier is highly resilient against overtraining and against errors in the correlations of the physical observables in the training data. We show that the resulting quantum and classical annealing-based classifier systems perform comparably to the state-of-the-art machine learning methods that are currently used in particle physics. However, in contrast to these methods, the annealing-based classifiers are simple functions of directly interpretable experimental parameters with clear physical meaning. The annealer-trained classifiers use the excited states in the vicinity of the ground state and demonstrate some advantage over traditional machine learning methods for small training datasets. Given the relative simplicity of the algorithm and its robustness to error, this technique may find application in other areas of experimental particle physics, such as real-time decision making in event-selection problems and classification in neutrino physics.

  10. Introduction to combinatorial designs

    CERN Document Server

    Wallis, WD

    2007-01-01

    Combinatorial theory is one of the fastest growing areas of modern mathematics. Focusing on a major part of this subject, Introduction to Combinatorial Designs, Second Edition provides a solid foundation in the classical areas of design theory as well as in more contemporary designs based on applications in a variety of fields. After an overview of basic concepts, the text introduces balanced designs and finite geometries. The author then delves into balanced incomplete block designs, covering difference methods, residual and derived designs, and resolvability. Following a chapter on the e

  11. The Role of the Goal in Solving Hard Computational Problems: Do People Really Optimize?

    Science.gov (United States)

    Carruthers, Sarah; Stege, Ulrike; Masson, Michael E. J.

    2018-01-01

    The role that the mental, or internal, representation plays when people are solving hard computational problems has largely been overlooked to date, despite the reality that this internal representation drives problem solving. In this work we investigate how performance on versions of two hard computational problems differs based on what internal…

  12. Infinitary Combinatory Reduction Systems

    DEFF Research Database (Denmark)

    Ketema, Jeroen; Simonsen, Jakob Grue

    2011-01-01

    We define infinitary Combinatory Reduction Systems (iCRSs), thus providing the first notion of infinitary higher-order rewriting. The systems defined are sufficiently general that ordinary infinitary term rewriting and infinitary ¿-calculus are special cases. Furthermore,we generalise a number...

  13. Manipulating Combinatorial Structures.

    Science.gov (United States)

    Labelle, Gilbert

    This set of transparencies shows how the manipulation of combinatorial structures in the context of modern combinatorics can easily lead to interesting teaching and learning activities at every level of education from elementary school to university. The transparencies describe: (1) the importance and relations of combinatorics to science and…

  14. Introduction to combinatorial geometry

    International Nuclear Information System (INIS)

    Gabriel, T.A.; Emmett, M.B.

    1985-01-01

    The combinatorial geometry package as used in many three-dimensional multimedia Monte Carlo radiation transport codes, such as HETC, MORSE, and EGS, is becoming the preferred way to describe simple and complicated systems. Just about any system can be modeled using the package with relatively few input statements. This can be contrasted against the older style geometry packages in which the required input statements could be large even for relatively simple systems. However, with advancements come some difficulties. The users of combinatorial geometry must be able to visualize more, and, in some instances, all of the system at a time. Errors can be introduced into the modeling which, though slight, and at times hard to detect, can have devastating effects on the calculated results. As with all modeling packages, the best way to learn the combinatorial geometry is to use it, first on a simple system then on more complicated systems. The basic technique for the description of the geometry consists of defining the location and shape of the various zones in terms of the intersections and unions of geometric bodies. The geometric bodies which are generally included in most combinatorial geometry packages are: (1) box, (2) right parallelepiped, (3) sphere, (4) right circular cylinder, (5) right elliptic cylinder, (6) ellipsoid, (7) truncated right cone, (8) right angle wedge, and (9) arbitrary polyhedron. The data necessary to describe each of these bodies are given. As can be easily noted, there are some subsets included for simplicity

  15. Solving Bi-Objective Optimal Power Flow using Hybrid method of Biogeography-Based Optimization and Differential Evolution Algorithm: A case study of the Algerian Electrical Network

    Directory of Open Access Journals (Sweden)

    Ouafa Herbadji

    2016-03-01

    Full Text Available This paper proposes a new hybrid metaheuristique algorithm based on the hybridization of Biogeography-based optimization with the Differential Evolution for solving the optimal power flow problem with emission control. The biogeography-based optimization (BBO algorithm is strongly influenced by equilibrium theory of island biogeography, mainly through two steps: Migration and Mutation. Differential Evolution (DE is one of the best Evolutionary Algorithms for global optimization. The hybridization of these two methods is used to overcome traps of local optimal solutions and problems of time consumption. The objective of this paper is to minimize the total fuel cost of generation, total emission, total real power loss and also maintain an acceptable system performance in terms of limits on generator real power, bus voltages and power flow of transmission lines. In the present work, BBO/DE has been applied to solve the optimal power flow problems on IEEE 30-bus test system and the Algerian electrical network 114 bus. The results obtained from this method show better performances compared with DE, BBO and other well known metaheuristique and evolutionary optimization methods.

  16. Network models for solving the problem of multicriterial adaptive optimization of investment projects control with several acceptable technologies

    Science.gov (United States)

    Shorikov, A. F.; Butsenko, E. V.

    2017-10-01

    This paper discusses the problem of multicriterial adaptive optimization the control of investment projects in the presence of several technologies. On the basis of network modeling proposed a new economic and mathematical model and a method for solving the problem of multicriterial adaptive optimization the control of investment projects in the presence of several technologies. Network economic and mathematical modeling allows you to determine the optimal time and calendar schedule for the implementation of the investment project and serves as an instrument to increase the economic potential and competitiveness of the enterprise. On a meaningful practical example, the processes of forming network models are shown, including the definition of the sequence of actions of a particular investment projecting process, the network-based work schedules are constructed. The calculation of the parameters of network models is carried out. Optimal (critical) paths have been formed and the optimal time for implementing the chosen technologies of the investment project has been calculated. It also shows the selection of the optimal technology from a set of possible technologies for project implementation, taking into account the time and cost of the work. The proposed model and method for solving the problem of managing investment projects can serve as a basis for the development, creation and application of appropriate computer information systems to support the adoption of managerial decisions by business people.

  17. 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

  18. Combinatorial reasoning an introduction to the art of counting

    CERN Document Server

    DeTemple, Duane

    2014-01-01

    Written by well-known scholars in the field, this book introduces combinatorics alongside modern techniques, showcases the interdisciplinary aspects of the topic, and illustrates how to problem solve with a multitude of exercises throughout. The authors' approach is very reader-friendly and avoids the ""scholarly tone"" found in many books on this topic. Combinatorial Reasoning: An Introduction to the Art of Counting: Focuses on enumeration and combinatorial thinking as a way to develop a variety of effective approaches to solving counting problemsIncludes brief summaries of basic concepts f

  19. SOME REMARKS ON THE RELATION OF FORMAL AND INFORMAL IN SOLVING OPTIMIZATION PROBLEMS IN THE FIELD OF AVIATION SECURITY

    Directory of Open Access Journals (Sweden)

    L. N. Elisov

    2015-01-01

    Full Text Available The paper presents the authors view and some remarks on the problem of solving optimization problems in the field of aviation security related to insurmountable difficulties of formalization and mathematical interpretation of the domain formulation of such problems. It is shown that the vast majority of these problems is related to the solution of conflicts. The theory of conflicts gives analytical solution only in the simplest cases. For the rest the use of a heuristic approach is suggested.

  20. Review of applications of TLBO algorithm and a tutorial for beginners to solve the unconstrained and constrained optimization problems

    Directory of Open Access Journals (Sweden)

    R. Venkata Rao

    2016-01-01

    Full Text Available The teaching-learning-based optimization (TLBO algorithm is finding a large number of applications in different fields of engineering and science since its introduction in 2011. The major applications are found in electrical engineering, mechanical design, thermal engineering, manufacturing engineering, civil engineering, structural engineering, computer engineering, electronics engineering, physics, chemistry, biotechnology and economics. This paper presents a review of applications of TLBO algorithm and a tutorial for solving the unconstrained and constrained optimization problems. The tutorial is expected to be useful to the beginners.

  1. Analysis and design of algorithms for combinatorial problems

    CERN Document Server

    Ausiello, G

    1985-01-01

    Combinatorial problems have been from the very beginning part of the history of mathematics. By the Sixties, the main classes of combinatorial problems had been defined. During that decade, a great number of research contributions in graph theory had been produced, which laid the foundations for most of the research in graph optimization in the following years. During the Seventies, a large number of special purpose models were developed. The impressive growth of this field since has been strongly determined by the demand of applications and influenced by the technological increases in computing power and the availability of data and software. The availability of such basic tools has led to the feasibility of the exact or well approximate solution of large scale realistic combinatorial optimization problems and has created a number of new combinatorial problems.

  2. Applying ant colony optimization metaheuristic to solve forest transportation planning problems with side constraints

    Science.gov (United States)

    Marco A. Contreras; Woodam Chung; Greg Jones

    2008-01-01

    Forest transportation planning problems (FTPP) have evolved from considering only the financial aspects of timber management to more holistic problems that also consider the environmental impacts of roads. These additional requirements have introduced side constraints, making FTPP larger and more complex. Mixed-integer programming (MIP) has been used to solve FTPP, but...

  3. On Solving Aircraft Conflict Avoidance Using Deterministic Global Optimization (sBB) Codes

    OpenAIRE

    Cafieri , Sonia; Messine , Frédéric; Touhami , Ahmed

    2016-01-01

    International audience; In this paper, some improvements of spatial Branch and Bound (sBB) algorithms are discussed to solve aircraft conflict avoidance problems formulated as MINLP. We propose a new quadratic convex relaxation technique based on affine arithmetic. Moreover, a branching strategy is also proposedfor the considered problem. Preliminary numerical results validates the proposed approach

  4. An Ant Colony Optimization and Hybrid Metaheuristics Algorithm to Solve the Split Delivery Vehicle Routing Problem

    Science.gov (United States)

    2015-01-01

    solution approach that combines heuristic search and integer programming. Boudia et al. (2007) solved an SDVRP instance using a memetic algorithm with...Boudia, M., Prins, C., Reghioui, M., 2007. An effective memetic algorithm with population management for the split delivery vehicle routing problem

  5. Solving the wind farm layout optimization problem using random search algorithm

    DEFF Research Database (Denmark)

    Feng, Ju; Shen, Wen Zhong

    2015-01-01

    , in which better results than the genetic algorithm (GA) and the old version of the RS algorithm are obtained. Second it is applied to the Horns Rev 1 WF, and the optimized layouts obtain a higher power production than its original layout, both for the real scenario and for two constructed scenarios......Wind farm (WF) layout optimization is to find the optimal positions of wind turbines (WTs) inside a WF, so as to maximize and/or minimize a single objective or multiple objectives, while satisfying certain constraints. In this work, a random search (RS) algorithm based on continuous formulation....... In this application, it is also found that in order to get consistent and reliable optimization results, up to 360 or more sectors for wind direction have to be used. Finally, considering the inevitable inter-annual variations in the wind conditions, the robustness of the optimized layouts against wind condition...

  6. Thickness optimization of fiber reinforced laminated composites using the discrete material optimization method

    DEFF Research Database (Denmark)

    Sørensen, Søren Nørgaard; Lund, Erik

    2012-01-01

    This work concerns a novel large-scale multi-material topology optimization method for simultaneous determination of the optimum variable integer thickness and fiber orientation throughout laminate structures with fixed outer geometries while adhering to certain manufacturing constraints....... The conceptual combinatorial/integer problem is relaxed to a continuous problem and solved on basis of the so-called Discrete Material Optimization method, explicitly including the manufacturing constraints as linear constraints....

  7. A Selection Approach for Optimized Problem-Solving Process by Grey Relational Utility Model and Multicriteria Decision Analysis

    Directory of Open Access Journals (Sweden)

    Chih-Kun Ke

    2012-01-01

    Full Text Available In business enterprises, especially the manufacturing industry, various problem situations may occur during the production process. A situation denotes an evaluation point to determine the status of a production process. A problem may occur if there is a discrepancy between the actual situation and the desired one. Thus, a problem-solving process is often initiated to achieve the desired situation. In the process, how to determine an action need to be taken to resolve the situation becomes an important issue. Therefore, this work uses a selection approach for optimized problem-solving process to assist workers in taking a reasonable action. A grey relational utility model and a multicriteria decision analysis are used to determine the optimal selection order of candidate actions. The selection order is presented to the worker as an adaptive recommended solution. The worker chooses a reasonable problem-solving action based on the selection order. This work uses a high-tech company’s knowledge base log as the analysis data. Experimental results demonstrate that the proposed selection approach is effective.

  8. PMU Placement Based on Heuristic Methods, when Solving the Problem of EPS State Estimation

    OpenAIRE

    I. N. Kolosok; E. S. Korkina; A. M. Glazunova

    2014-01-01

    Creation of satellite communication systems gave rise to a new generation of measurement equipment – Phasor Measurement Unit (PMU). Integrated into the measurement system WAMS, the PMU sensors provide a real picture of state of energy power system (EPS). The issues of PMU placement when solving the problem of EPS state estimation (SE) are discussed in many papers. PMU placement is a complex combinatorial problem, and there is not any analytical function to optimize its variables. Therefore,...

  9. Solving Assembly Sequence Planning using Angle Modulated Simulated Kalman Filter

    Science.gov (United States)

    Mustapa, Ainizar; Yusof, Zulkifli Md.; Adam, Asrul; Muhammad, Badaruddin; Ibrahim, Zuwairie

    2018-03-01

    This paper presents an implementation of Simulated Kalman Filter (SKF) algorithm for optimizing an Assembly Sequence Planning (ASP) problem. The SKF search strategy contains three simple steps; predict-measure-estimate. The main objective of the ASP is to determine the sequence of component installation to shorten assembly time or save assembly costs. Initially, permutation sequence is generated to represent each agent. Each agent is then subjected to a precedence matrix constraint to produce feasible assembly sequence. Next, the Angle Modulated SKF (AMSKF) is proposed for solving ASP problem. The main idea of the angle modulated approach in solving combinatorial optimization problem is to use a function, g(x), to create a continuous signal. The performance of the proposed AMSKF is compared against previous works in solving ASP by applying BGSA, BPSO, and MSPSO. Using a case study of ASP, the results show that AMSKF outperformed all the algorithms in obtaining the best solution.

  10. A practical approach for solving multi-objective reliability redundancy allocation problems using extended bare-bones particle swarm optimization

    International Nuclear Information System (INIS)

    Zhang, Enze; Wu, Yifei; Chen, Qingwei

    2014-01-01

    This paper proposes a practical approach, combining bare-bones particle swarm optimization and sensitivity-based clustering for solving multi-objective reliability redundancy allocation problems (RAPs). A two-stage process is performed to identify promising solutions. Specifically, a new bare-bones multi-objective particle swarm optimization algorithm (BBMOPSO) is developed and applied in the first stage to identify a Pareto-optimal set. This algorithm mainly differs from other multi-objective particle swarm optimization algorithms in the parameter-free particle updating strategy, which is especially suitable for handling the complexity and nonlinearity of RAPs. Moreover, by utilizing an approach based on the adaptive grid to update the global particle leaders, a mutation operator to improve the exploration ability and an effective constraint handling strategy, the integrated BBMOPSO algorithm can generate excellent approximation of the true Pareto-optimal front for RAPs. This is followed by a data clustering technique based on difference sensitivity in the second stage to prune the obtained Pareto-optimal set and obtain a small, workable sized set of promising solutions for system implementation. Two illustrative examples are presented to show the feasibility and effectiveness of the proposed approach

  11. Optimization of aerodynamic form of projectile for solving the problem of shooting range increasing

    Science.gov (United States)

    Lipanov, Alexey M.; Korolev, Stanislav A.; Rusyak, Ivan G.

    2017-10-01

    The article is devoted to the development of methods for solving the problem of external ballistics using a more complete system of motion equation taken into account the rotation and oscillation about the mass center and using aerodynamic coefficients of forces and moments which are calculated on the basis of modeling the hydrodynamics of flow around the projectile. Developed methods allows to study the basic ways of increasing the shooting range or artillery.

  12. Methods of solving of the optimal stabilization problem for stationary smooth control systems. Part I

    Directory of Open Access Journals (Sweden)

    G. Kondrat'ev

    1999-10-01

    Full Text Available In this article some ideas of Hamilton mechanics and differential-algebraic Geometry are used to exact definition of the potential function (Bellman-Lyapunov function in the optimal stabilization problem of smooth finite-dimensional systems.

  13. Solving Optimal Control Problem of Monodomain Model Using Hybrid Conjugate Gradient Methods

    Directory of Open Access Journals (Sweden)

    Kin Wei Ng

    2012-01-01

    Full Text Available We present the numerical solutions for the PDE-constrained optimization problem arising in cardiac electrophysiology, that is, the optimal control problem of monodomain model. The optimal control problem of monodomain model is a nonlinear optimization problem that is constrained by the monodomain model. The monodomain model consists of a parabolic partial differential equation coupled to a system of nonlinear ordinary differential equations, which has been widely used for simulating cardiac electrical activity. Our control objective is to dampen the excitation wavefront using optimal applied extracellular current. Two hybrid conjugate gradient methods are employed for computing the optimal applied extracellular current, namely, the Hestenes-Stiefel-Dai-Yuan (HS-DY method and the Liu-Storey-Conjugate-Descent (LS-CD method. Our experiment results show that the excitation wavefronts are successfully dampened out when these methods are used. Our experiment results also show that the hybrid conjugate gradient methods are superior to the classical conjugate gradient methods when Armijo line search is used.

  14. Confluence of an extension of combinatory logic by Boolean constants

    DEFF Research Database (Denmark)

    Czajka, Łukasz

    2017-01-01

    We show confluence of a conditional term rewriting system CL-pc1, which is an extension of Combinatory Logic by Boolean constants. This solves problem 15 from the RTA list of open problems. The proof has been fully formalized in the Coq proof assistant....

  15. Fast-Solving Quasi-Optimal LS-S3VM Based on an Extended Candidate Set.

    Science.gov (United States)

    Ma, Yuefeng; Liang, Xun; Kwok, James T; Li, Jianping; Zhou, Xiaoping; Zhang, Haiyan

    2018-04-01

    The semisupervised least squares support vector machine (LS-S 3 VM) is an important enhancement of least squares support vector machines in semisupervised learning. Given that most data collected from the real world are without labels, semisupervised approaches are more applicable than standard supervised approaches. Although a few training methods for LS-S 3 VM exist, the problem of deriving the optimal decision hyperplane efficiently and effectually has not been solved. In this paper, a fully weighted model of LS-S 3 VM is proposed, and a simple integer programming (IP) model is introduced through an equivalent transformation to solve the model. Based on the distances between the unlabeled data and the decision hyperplane, a new indicator is designed to represent the possibility that the label of an unlabeled datum should be reversed in each iteration during training. Using the indicator, we construct an extended candidate set consisting of the indices of unlabeled data with high possibilities, which integrates more information from unlabeled data. Our algorithm is degenerated into a special scenario of the previous algorithm when the extended candidate set is reduced into a set with only one element. Two strategies are utilized to determine the descent directions based on the extended candidate set. Furthermore, we developed a novel method for locating a good starting point based on the properties of the equivalent IP model. Combined with the extended candidate set and the carefully computed starting point, a fast algorithm to solve LS-S 3 VM quasi-optimally is proposed. The choice of quasi-optimal solutions results in low computational cost and avoidance of overfitting. Experiments show that our algorithm equipped with the two designed strategies is more effective than other algorithms in at least one of the following three aspects: 1) computational complexity; 2) generalization ability; and 3) flexibility. However, our algorithm and other algorithms have

  16. On the Optimization and Parallelizing Little Algorithm for Solving the Traveling Salesman Problem

    Directory of Open Access Journals (Sweden)

    V. V. Vasilchikov

    2016-01-01

    Full Text Available The paper describes some ways to accelerate solving the NP-complete Traveling Salesman Problem. The classic Little algorithm belonging to the category of ”branch and bound methods” can solve it both for directed and undirected graphs. However, for undirected graphs its operation can be accelerated by eliminating the consideration of branches examined earlier. The paper proposes changes to be made in the key operations of the algorithm to speed up its execution. It also describes the results of an experiment that demonstrated a significant acceleration of solving the problem by using an advanced algorithm. Another way to speed up the work is to parallelize the algorithm. For problems of this kind it is difficult to break the task into a sufficient number of subtasks having comparable complexity. Their parallelism arises dynamically during the execution. For such problems, it seems reasonable to use parallel-recursive algorithms. In our case the use of the library RPM ParLib developed by the author was a good choice. It allows us to develop effective applications for parallel computing on a local network using any .NET-compatible programming language. We used C# to develop the programs. Parallel applications were developed as for basic and modified algorithms, the comparing of their speed was made. Experiments were performed for the graphs with the number of vertexes up to 45 and with the number of network computers up to 16. We also investigated the acceleration that can be achieved by parallelizing the basic Little algorithm for directed graphs. The results of these experiments are also presented in the paper. 

  17. A Bi-Level Particle Swarm Optimization Algorithm for Solving Unit Commitment Problems with Wind-EVs Coordinated Dispatch

    Science.gov (United States)

    Song, Lei; Zhang, Bo

    2017-07-01

    Nowadays, the grid faces much more challenges caused by wind power and the accessing of electric vehicles (EVs). Based on the potentiality of coordinated dispatch, a model of wind-EVs coordinated dispatch was developed. Then, A bi-level particle swarm optimization algorithm for solving the model was proposed in this paper. The application of this algorithm to 10-unit test system carried out that coordinated dispatch can benefit the power system from the following aspects: (1) Reducing operating costs; (2) Improving the utilization of wind power; (3) Stabilizing the peak-valley difference.

  18. Recursive deconvolution of combinatorial chemical libraries.

    OpenAIRE

    Erb, E; Janda, K D; Brenner, S

    1994-01-01

    A recursive strategy that solves for the active members of a chemical library is presented. A pentapeptide library with an alphabet of Gly, Leu, Phe, and Tyr (1024 members) was constructed on a solid support by the method of split synthesis. One member of this library (NH2-Tyr-Gly-Gly-Phe-Leu) is a native binder to a beta-endorphin antibody. A variation of the split synthesis approach is used to build the combinatorial library. In four vials, a member of the library's alphabet is coupled to a...

  19. Quantum resonance for simulating combinatorial problems

    International Nuclear Information System (INIS)

    Zak, Michail; Fijany, Amir

    2005-01-01

    Quantum computing by simulations is based upon similarity between mathematical formalism of a quantum phenomenon and phenomena to be analyzed. In this Letter, the mathematical formalism of quantum resonance combined with tensor product decomposability of unitary evolutions is mapped onto a class of NP-complete combinatorial problems. It has been demonstrated that nature has polynomial resources for solving NP-complete problems and that will help to develop a new strategy for artificial intelligence, as well as to re-evaluate the role of natural selection in biological evolution

  20. The combinatorial derivation

    Directory of Open Access Journals (Sweden)

    Igor V. Protasov

    2013-09-01

    $\\Delta(A=\\{g\\in G:|gA\\cap A|=\\infty\\}$. The mapping $\\Delta:\\mathcal{P}_G\\rightarrow\\mathcal{P}_G$, $A\\mapsto\\Delta(A$, is called a combinatorial derivation and can be considered as an analogue of the topological derivation $d:\\mathcal{P}_X\\rightarrow\\mathcal{P}_X$, $A\\mapsto A^d$, where $X$ is a topological space and $A^d$ is the set of all limit points of $A$. Content: elementary properties, thin and almost thin subsets, partitions, inverse construction and $\\Delta$-trajectories,  $\\Delta$ and $d$.

  1. Dynamic Combinatorial Chemistry

    DEFF Research Database (Denmark)

    Lisbjerg, Micke

    This thesis is divided into seven chapters, which can all be read individually. The first chapter, however, contains a general introduction to the chemistry used in the remaining six chapters, and it is therefore recommended to read chapter one before reading the other chapters. Chapter 1...... is a general introductory chapter for the whole thesis. The history and concepts of dynamic combinatorial chemistry are described, as are some of the new and intriguing results recently obtained. Finally, the properties of a broad range of hexameric macrocycles are described in detail. Chapter 2 gives...

  2. Lexicographic goal programming and assessment tools for a combinatorial production problem.

    Science.gov (United States)

    2008-01-01

    NP-complete combinatorial problems often necessitate the use of near-optimal solution techniques including : heuristics and metaheuristics. The addition of multiple optimization criteria can further complicate : comparison of these solution technique...

  3. Method and codes for solving the optimization problem of initial material distribution and controlling of reactor during the run

    International Nuclear Information System (INIS)

    Isakova, L.Ya.; Rachkova, D.A.; Vtorova, O.Yu.; Matekin, M.P.; Sobol, I.M.

    1992-01-01

    The optimization problem of initial distribution of fuel composition and controlling of the reactor during the run is solved. The optimization problem is formulated as a multicriterial one with different types of constraints. The distinguished feature of the method proposed is the systematic scanning of multidimensional ares, where the trial points in the space of parameters are the points of uniformly distributed LP τ -sequences. The reactor computation is carried out by the four group diffusion method in two-dimensional cylindrical geometry. The burnup absorbers are taken into account as additional absorption cross-sections, represented by approximants. The tables of trials make possible the estimation of the values of global extrema. The coordinates of the points where the external values are attained can be estimated too

  4. The collapsing of multigroup cross sections in optimization problems solved by means of the Pontryagin maximum principle in nuclear reactor dynamics

    International Nuclear Information System (INIS)

    Anton, V.

    1979-12-01

    The collapsing formulae for the optimization problems solved by means of the Pontryagin maximum principle in nuclear reactor dynamics are presented. A comparison with the corresponding formulae of the static case is given too. (author)

  5. A Portfolio for Optimal Collaboration of Human and Cyber Physical Production Systems in Problem-Solving

    Science.gov (United States)

    Ansari, Fazel; Seidenberg, Ulrich

    2016-01-01

    This paper discusses the complementarity of human and cyber physical production systems (CPPS). The discourse of complementarity is elaborated by defining five criteria for comparing the characteristics of human and CPPS. Finally, a management portfolio matrix is proposed for examining the feasibility of optimal collaboration between them. The…

  6. Boltzmann Oracle for Combinatorial Systems

    OpenAIRE

    Pivoteau , Carine; Salvy , Bruno; Soria , Michèle

    2008-01-01

    International audience; Boltzmann random generation applies to well-defined systems of recursive combinatorial equations. It relies on oracles giving values of the enumeration generating series inside their disk of convergence. We show that the combinatorial systems translate into numerical iteration schemes that provide such oracles. In particular, we give a fast oracle based on Newton iteration.

  7. Combinatorial matrix theory

    CERN Document Server

    Mitjana, Margarida

    2018-01-01

    This book contains the notes of the lectures delivered at an Advanced Course on Combinatorial Matrix Theory held at Centre de Recerca Matemàtica (CRM) in Barcelona. These notes correspond to five series of lectures. The first series is dedicated to the study of several matrix classes defined combinatorially, and was delivered by Richard A. Brualdi. The second one, given by Pauline van den Driessche, is concerned with the study of spectral properties of matrices with a given sign pattern. Dragan Stevanović delivered the third one, devoted to describing the spectral radius of a graph as a tool to provide bounds of parameters related with properties of a graph. The fourth lecture was delivered by Stephen Kirkland and is dedicated to the applications of the Group Inverse of the Laplacian matrix. The last one, given by Ángeles Carmona, focuses on boundary value problems on finite networks with special in-depth on the M-matrix inverse problem.

  8. 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

  9. An Optimal Biparametric Multipoint Family and Its Self-Acceleration with Memory for Solving Nonlinear Equations

    Directory of Open Access Journals (Sweden)

    Quan Zheng

    2015-12-01

    Full Text Available In this paper, a family of Steffensen-type methods of optimal order of convergence with two parameters is constructed by direct Newtonian interpolation. It satisfies the conjecture proposed by Kung and Traub (J. Assoc. Comput. Math. 1974, 21, 634–651 that an iterative method based on m evaluations per iteration without memory would arrive at the optimal convergence of order 2m-1 . Furthermore, the family of Steffensen-type methods of super convergence is suggested by using arithmetic expressions for the parameters with memory but no additional new evaluation of the function. Their error equations, asymptotic convergence constants and convergence orders are obtained. Finally, they are compared with related root-finding methods in the numerical examples.

  10. Solving non-standard packing problems by global optimization and heuristics

    CERN Document Server

    Fasano, Giorgio

    2014-01-01

    This book results from a long-term research effort aimed at tackling complex non-standard packing issues which arise in space engineering. The main research objective is to optimize cargo loading and arrangement, in compliance with a set of stringent rules. Complicated geometrical aspects are also taken into account, in addition to balancing conditions based on attitude control specifications. Chapter 1 introduces the class of non-standard packing problems studied. Chapter 2 gives a detailed explanation of a general model for the orthogonal packing of tetris-like items in a convex domain. A number of additional conditions are looked at in depth, including the prefixed orientation of subsets of items, the presence of unusable holes, separation planes and structural elements, relative distance bounds as well as static and dynamic balancing requirements. The relative feasibility sub-problem which is a special case that does not have an optimization criterion is discussed in Chapter 3. This setting can be exploit...

  11. Optimization of internal migration as a mechanism for solving the problems of monotowns in Sverdlovsk region

    Directory of Open Access Journals (Sweden)

    Evgeniya Vladimirovna Nekrasova

    2012-06-01

    Full Text Available The problems of single-industry towns and their solutions are reviewed in this paper. The analysis of internal mobility of the population of Russia on the basis of sociological research and Gallup International Research Institute of the family is made. The necessity of optimization of commuting between the territories of the municipal level to address the one-company towns is underlined. A mathematical model for the optimization of the problem of migration flows between the territories of the municipal level for commuting by road was developed. Testing was conducted on a model example of the six type-representative singleindustry towns of Sverdlovsk region (Revdinskiy district, VerkhnyayaPyshma, towns of Krasnoturinsk, Krasnouralsk, Serov and Sukhoi Log. Taking into account the current situation on the labor market and future labor requirements, a division of municipalities in the territory of employment and departure of migrants was performed under consideration. An optimal plan was constructed in areas of employment in company towns of Sverdlovsk region, which is designed to implement the scheme of traffic from the north to the south of Sverdlovsk region with the organization of interchange hub in the city of Yekaterinburg.

  12. Solving quantum optimal control problems using Clebsch variables and Lin constraints

    Science.gov (United States)

    Delgado-Téllez, M.; Ibort, A.; Rodríguez de la Peña, T.

    2018-01-01

    Clebsch variables (and Lin constraints) are applied to the study of a class of optimal control problems for affine-controlled quantum systems. The optimal control problem will be modelled with controls defined on an auxiliary space where the dynamical group of the system acts freely. The reciprocity between both theories: the classical theory defined by the objective functional and the quantum system, is established by using a suitable version of Lagrange’s multipliers theorem and a geometrical interpretation of the constraints of the system as defining a subspace of horizontal curves in an associated bundle. It is shown how the solutions of the variational problem defined by the objective functional determine solutions of the quantum problem. Then a new way of obtaining explicit solutions for a family of optimal control problems for affine-controlled quantum systems (finite or infinite dimensional) is obtained. One of its main advantages, is the the use of Clebsch variables allows to compute such solutions from solutions of invariant problems that can often be computed explicitly. This procedure can be presented as an algorithm that can be applied to a large class of systems. Finally, some simple examples, spin control, a simple quantum Hamiltonian with an ‘Elroy beanie’ type classical model and a controlled one-dimensional quantum harmonic oscillator, illustrating the main features of the theory, will be discussed.

  13. Ropossum: An Authoring Tool for Designing, Optimizing and Solving Cut the Rope Levels

    DEFF Research Database (Denmark)

    Shaker, Mohammad; Shaker, Noor; Togelius, Julian

    2013-01-01

    We present a demonstration of Ropossum, an authoring tool for the generation and testing of levels of the physics-based game, Cut the Rope. Ropossum integrates many features: (1) automatic design of complete solvable content, (2) incorporation of designer’s input through the creation of complete...... or partial designs, (3) automatic check for playability and (4) optimization of a given design based on playability. The system includes a physics engine to simulate the game and an evolutionary framework to evolve content as well as an AI reasoning agent to check for playability. The system is optimised...

  14. Optimal homotopy asymptotic method for solving fractional relaxation-oscillation equation

    Directory of Open Access Journals (Sweden)

    Mohammad Hamarsheh

    2015-11-01

    Full Text Available In this paper, an approximate analytical solution of linear fractional relaxation-oscillation equations in which the fractional derivatives are given in the Caputo sense, is obtained by the optimal homotopy asymptotic method (OHAM. The studied OHAM is based on minimizing the residual error. The results given by OHAM are compared with the exact solutions and the solutions obtained by generalized Taylor matrix method. The reliability and efficiency of the proposed approach are demonstrated in three examples with the aid of the symbolic algebra program Maple.

  15. Optimizing Ship Classification in the Arctic Ocean: A Case Study of Multi-Disciplinary Problem Solving

    Directory of Open Access Journals (Sweden)

    Mark Rahmes

    2014-08-01

    Full Text Available We describe a multi-disciplinary system model for determining decision making strategies based upon the ability to perform data mining and pattern discovery utilizing open source actionable information to prepare for specific events or situations from multiple information sources. We focus on combining detection theory with game theory for classifying ships in Arctic Ocean to verify ship reporting. More specifically, detection theory is used to determine probability of deciding if a ship or certain ship class is present or not. We use game theory to fuse information for optimal decision making on ship classification. Hierarchy game theory framework enables complex modeling of data in probabilistic modeling. However, applicability to big data is complicated by the difficulties of inference in complex probabilistic models, and by computational constraints. We provide a framework for fusing sensor inputs to help compare if the information of a ship matches its AIS reporting requirements using mixed probabilities from game theory. Our method can be further applied to optimizing other choke point scenarios where a decision is needed for classification of ground assets or signals. We model impact on decision making on accuracy by adding more parameters or sensors to the decision making process as sensitivity analysis.

  16. Application of Multi-Objective Human Learning Optimization Method to Solve AC/DC Multi-Objective Optimal Power Flow Problem

    Science.gov (United States)

    Cao, Jia; Yan, Zheng; He, Guangyu

    2016-06-01

    This paper introduces an efficient algorithm, multi-objective human learning optimization method (MOHLO), to solve AC/DC multi-objective optimal power flow problem (MOPF). Firstly, the model of AC/DC MOPF including wind farms is constructed, where includes three objective functions, operating cost, power loss, and pollutant emission. Combining the non-dominated sorting technique and the crowding distance index, the MOHLO method can be derived, which involves individual learning operator, social learning operator, random exploration learning operator and adaptive strategies. Both the proposed MOHLO method and non-dominated sorting genetic algorithm II (NSGAII) are tested on an improved IEEE 30-bus AC/DC hybrid system. Simulation results show that MOHLO method has excellent search efficiency and the powerful ability of searching optimal. Above all, MOHLO method can obtain more complete pareto front than that by NSGAII method. However, how to choose the optimal solution from pareto front depends mainly on the decision makers who stand from the economic point of view or from the energy saving and emission reduction point of view.

  17. Combinatorial Testing for VDM

    DEFF Research Database (Denmark)

    Larsen, Peter Gorm; Lausdahl, Kenneth; Battle, Nick

    2010-01-01

    by forgotten preconditions as well as broken invariants and post-conditions. Trace definitions are defined as regular expressions describing possible sequences of operation calls, and are conceptually similar to UML sequence diagrams. In this paper we present a tool enabling test automation based on VDM traces......Abstract—Combinatorial testing in VDM involves the automatic generation and execution of a large collection of test cases derived from templates provided in the form of trace definitions added to a VDM specification. The main value of this is the rapid detection of run-time errors caused......, and explain how it is possible to reduce large collections of test cases in different ways. Its use is illustrated with a small case study....

  18. DATA MINING WORKSPACE AS AN OPTIMIZATION PREDICTION TECHNIQUE FOR SOLVING TRANSPORT PROBLEMS

    Directory of Open Access Journals (Sweden)

    Anastasiia KUPTCOVA

    2016-09-01

    Full Text Available This article addresses the study related to forecasting with an actual high-speed decision making under careful modelling of time series data. The study uses data-mining modelling for algorithmic optimization of transport goals. Our finding brings to the future adequate techniques for the fitting of a prediction model. This model is going to be used for analyses of the future transaction costs in the frontiers of the Czech Republic. Time series prediction methods for the performance of prediction models in the package of Statistics are Exponential, ARIMA and Neural Network approaches. The primary target for a predictive scenario in the data mining workspace is to provide modelling data faster and with more versatility than the other management techniques.

  19. On an extension of a combinatorial identity

    Indian Academy of Sciences (India)

    to an infinite family of 4-way combinatorial identities. In some particular cases we get even 5-way combinatorial identities which give us four new combinatorial versions of. Göllnitz–Gordon identities. Keywords. n-Color partitions; lattice paths; Frobenius partitions; Göllnitz–Gordon identities; combinatorial interpretations. 1.

  20. Combinatorial Nano-Bio Interfaces.

    Science.gov (United States)

    Cai, Pingqiang; Zhang, Xiaoqian; Wang, Ming; Wu, Yun-Long; Chen, Xiaodong

    2018-06-08

    Nano-bio interfaces are emerging from the convergence of engineered nanomaterials and biological entities. Despite rapid growth, clinical translation of biomedical nanomaterials is heavily compromised by the lack of comprehensive understanding of biophysicochemical interactions at nano-bio interfaces. In the past decade, a few investigations have adopted a combinatorial approach toward decoding nano-bio interfaces. Combinatorial nano-bio interfaces comprise the design of nanocombinatorial libraries and high-throughput bioevaluation. In this Perspective, we address challenges in combinatorial nano-bio interfaces and call for multiparametric nanocombinatorics (composition, morphology, mechanics, surface chemistry), multiscale bioevaluation (biomolecules, organelles, cells, tissues/organs), and the recruitment of computational modeling and artificial intelligence. Leveraging combinatorial nano-bio interfaces will shed light on precision nanomedicine and its potential applications.

  1. Combinatorial designs constructions and analysis

    CERN Document Server

    Stinson, Douglas R

    2004-01-01

    Created to teach students many of the most important techniques used for constructing combinatorial designs, this is an ideal textbook for advanced undergraduate and graduate courses in combinatorial design theory. The text features clear explanations of basic designs, such as Steiner and Kirkman triple systems, mutual orthogonal Latin squares, finite projective and affine planes, and Steiner quadruple systems. In these settings, the student will master various construction techniques, both classic and modern, and will be well-prepared to construct a vast array of combinatorial designs. Design theory offers a progressive approach to the subject, with carefully ordered results. It begins with simple constructions that gradually increase in complexity. Each design has a construction that contains new ideas or that reinforces and builds upon similar ideas previously introduced. A new text/reference covering all apsects of modern combinatorial design theory. Graduates and professionals in computer science, applie...

  2. Combinatorial Mathematics: Research into Practice

    Science.gov (United States)

    Sriraman, Bharath; English, Lyn D.

    2004-01-01

    Implications and suggestions for using combinatorial mathematics in the classroom through a survey and synthesis of numerous research studies are presented. The implications revolve around five major themes that emerge from analysis of these studies.

  3. AFRICAN BUFFALO OPTIMIZATION ico-pdf

    Directory of Open Access Journals (Sweden)

    Julius Beneoluchi Odili

    2016-02-01

    Full Text Available This is an introductory paper to the newly-designed African Buffalo Optimization (ABO algorithm for solving combinatorial and other optimization problems. The algorithm is inspired by the behavior of African buffalos, a species of wild cows known for their extensive migrant lifestyle. This paper presents an overview of major metaheuristic algorithms with the aim of providing a basis for the development of the African Buffalo Optimization algorithm which is a nature-inspired, population-based metaheuristic algorithm. Experimental results obtained from applying the novel ABO to solve a number of benchmark global optimization test functions as well as some symmetric and asymmetric Traveling Salesman’s Problems when compared to the results obtained from using other popular optimization methods show that the African Buffalo Optimization is a worthy addition to the growing number of swarm intelligence optimization techniques.

  4. The ESPAT tool: a general-purpose DSS shell for solving stochastic optimization problems in complex river-aquifer systems

    Science.gov (United States)

    Macian-Sorribes, Hector; Pulido-Velazquez, Manuel; Tilmant, Amaury

    2015-04-01

    Stochastic programming methods are better suited to deal with the inherent uncertainty of inflow time series in water resource management. However, one of the most important hurdles in their use in practical implementations is the lack of generalized Decision Support System (DSS) shells, usually based on a deterministic approach. The purpose of this contribution is to present a general-purpose DSS shell, named Explicit Stochastic Programming Advanced Tool (ESPAT), able to build and solve stochastic programming problems for most water resource systems. It implements a hydro-economic approach, optimizing the total system benefits as the sum of the benefits obtained by each user. It has been coded using GAMS, and implements a Microsoft Excel interface with a GAMS-Excel link that allows the user to introduce the required data and recover the results. Therefore, no GAMS skills are required to run the program. The tool is divided into four modules according to its capabilities: 1) the ESPATR module, which performs stochastic optimization procedures in surface water systems using a Stochastic Dual Dynamic Programming (SDDP) approach; 2) the ESPAT_RA module, which optimizes coupled surface-groundwater systems using a modified SDDP approach; 3) the ESPAT_SDP module, capable of performing stochastic optimization procedures in small-size surface systems using a standard SDP approach; and 4) the ESPAT_DET module, which implements a deterministic programming procedure using non-linear programming, able to solve deterministic optimization problems in complex surface-groundwater river basins. The case study of the Mijares river basin (Spain) is used to illustrate the method. It consists in two reservoirs in series, one aquifer and four agricultural demand sites currently managed using historical (XIV century) rights, which give priority to the most traditional irrigation district over the XX century agricultural developments. Its size makes it possible to use either the SDP or

  5. Relativity in Combinatorial Gravitational Fields

    Directory of Open Access Journals (Sweden)

    Mao Linfan

    2010-04-01

    Full Text Available A combinatorial spacetime $(mathscr{C}_G| uboverline{t}$ is a smoothly combinatorial manifold $mathscr{C}$ underlying a graph $G$ evolving on a time vector $overline{t}$. As we known, Einstein's general relativity is suitable for use only in one spacetime. What is its disguise in a combinatorial spacetime? Applying combinatorial Riemannian geometry enables us to present a combinatorial spacetime model for the Universe and suggest a generalized Einstein gravitational equation in such model. Forfinding its solutions, a generalized relativity principle, called projective principle is proposed, i.e., a physics law ina combinatorial spacetime is invariant under a projection on its a subspace and then a spherically symmetric multi-solutions ofgeneralized Einstein gravitational equations in vacuum or charged body are found. We also consider the geometrical structure in such solutions with physical formations, and conclude that an ultimate theory for the Universe maybe established if all such spacetimes in ${f R}^3$. Otherwise, our theory is only an approximate theory and endless forever.

  6. Recent developments of discrete material optimization of laminated composite structures

    DEFF Research Database (Denmark)

    Lund, Erik; Sørensen, Rene

    2015-01-01

    This work will give a quick summary of recent developments of the Discrete Material Optimization approach for structural optimization of laminated composite structures. This approach can be seen as a multi-material topology optimization approach for selecting the best ply material and number...... of plies in a laminated composite structure. The conceptual combinatorial design problem is relaxed to a continuous problem such that well-established gradient based optimization techniques can be applied, and the optimization problem is solved on basis of interpolation schemes with penalization...

  7. Erratum to ''Johnson's algorithm : A key to solve optimally or approximately flowshop scheduling problems with unavailability periods'' [International Journal of Production Economics 121 (2009) 81-87

    OpenAIRE

    Rapine , Christophe

    2013-01-01

    International audience; In Allaoui H., Artiba A, ''Johnson's algorithm : A key to solve optimally or approximately flowshop scheduling problems with unavailability periods'' [International Journal of Production Economics 121 (2009)] the authors propose optimality conditions for the Johnson sequence in presence of one unavailability period on the first machine and pretend for a performance guarantee of 2 when several unavailability periods may occur. We establish in this note that these condit...

  8. Combinatorial synthesis of natural products

    DEFF Research Database (Denmark)

    Nielsen, John

    2002-01-01

    Combinatorial syntheses allow production of compound libraries in an expeditious and organized manner immediately applicable for high-throughput screening. Natural products possess a pedigree to justify quality and appreciation in drug discovery and development. Currently, we are seeing a rapid...... increase in application of natural products in combinatorial chemistry and vice versa. The therapeutic areas of infectious disease and oncology still dominate but many new areas are emerging. Several complex natural products have now been synthesised by solid-phase methods and have created the foundation...... for preparation of combinatorial libraries. In other examples, natural products or intermediates have served as building blocks or scaffolds in the synthesis of complex natural products, bioactive analogues or designed hybrid molecules. Finally, structural motifs from the biologically active parent molecule have...

  9. Effect of the Implicit Combinatorial Model on Combinatorial Reasoning in Secondary School Pupils.

    Science.gov (United States)

    Batanero, Carmen; And Others

    1997-01-01

    Elementary combinatorial problems may be classified into three different combinatorial models: (1) selection; (2) partition; and (3) distribution. The main goal of this research was to determine the effect of the implicit combinatorial model on pupils' combinatorial reasoning before and after instruction. Gives an analysis of variance of the…

  10. Combinatorial problems and exercises

    CERN Document Server

    Lovász, László

    2007-01-01

    The main purpose of this book is to provide help in learning existing techniques in combinatorics. The most effective way of learning such techniques is to solve exercises and problems. This book presents all the material in the form of problems and series of problems (apart from some general comments at the beginning of each chapter). In the second part, a hint is given for each exercise, which contains the main idea necessary for the solution, but allows the reader to practice the techniques by completing the proof. In the third part, a full solution is provided for each problem. This book w

  11. Evaluation of the Optimum Composition of Low-Temperature Fuel Cell Electrocatalysts for Methanol Oxidation by Combinatorial Screening.

    Science.gov (United States)

    Antolini, Ermete

    2017-02-13

    Combinatorial chemistry and high-throughput screening represent an innovative and rapid tool to prepare and evaluate a large number of new materials, saving time and expense for research and development. Considering that the activity and selectivity of catalysts depend on complex kinetic phenomena, making their development largely empirical in practice, they are prime candidates for combinatorial discovery and optimization. This review presents an overview of recent results of combinatorial screening of low-temperature fuel cell electrocatalysts for methanol oxidation. Optimum catalyst compositions obtained by combinatorial screening were compared with those of bulk catalysts, and the effect of the library geometry on the screening of catalyst composition is highlighted.

  12. Algorithms in combinatorial design theory

    CERN Document Server

    Colbourn, CJ

    1985-01-01

    The scope of the volume includes all algorithmic and computational aspects of research on combinatorial designs. Algorithmic aspects include generation, isomorphism and analysis techniques - both heuristic methods used in practice, and the computational complexity of these operations. The scope within design theory includes all aspects of block designs, Latin squares and their variants, pairwise balanced designs and projective planes and related geometries.

  13. Computational Complexity of Combinatorial Surfaces

    NARCIS (Netherlands)

    Vegter, Gert; Yap, Chee K.

    1990-01-01

    We investigate the computational problems associated with combinatorial surfaces. Specifically, we present an algorithm (based on the Brahana-Dehn-Heegaard approach) for transforming the polygonal schema of a closed triangulated surface into its canonical form in O(n log n) time, where n is the

  14. Combinatorial synthesis of ceramic materials

    Science.gov (United States)

    Lauf, Robert J.; Walls, Claudia A.; Boatner, Lynn A.

    2006-11-14

    A combinatorial library includes a gelcast substrate defining a plurality of cavities in at least one surface thereof; and a plurality of gelcast test materials in the cavities, at least two of the test materials differing from the substrate in at least one compositional characteristic, the two test materials differing from each other in at least one compositional characteristic.

  15. Combinatorial auctions for electronic business

    Indian Academy of Sciences (India)

    R. Narasimhan (Krishtel eMaging) 1461 1996 Oct 15 13:05:22

    (6) Information feedback: An auction protocol may be a direct mechanism or an .... transparency of allocation decisions arise in resolving these ties. .... bidding, however more recently, combinatorial bids are allowed [50] making ...... Also, truth revelation and other game theoretic considerations are not taken into account.

  16. Combinatorial Proofs and Algebraic Proofs

    Indian Academy of Sciences (India)

    Permanent link: https://www.ias.ac.in/article/fulltext/reso/018/07/0630-0645. Keywords. Combinatorial proof; algebraic proof; binomial identity; recurrence relation; composition; Fibonacci number; Fibonacci identity; Pascal triangle. Author Affiliations. Shailesh A Shirali1. Sahyadri School Tiwai Hill, Rajgurunagar Pune 410 ...

  17. Quantum Adiabatic Optimization and Combinatorial Landscapes

    Science.gov (United States)

    Smelyanskiy, V. N.; Knysh, S.; Morris, R. D.

    2003-01-01

    In this paper we analyze the performance of the Quantum Adiabatic Evolution (QAE) algorithm on a variant of Satisfiability problem for an ensemble of random graphs parametrized by the ratio of clauses to variables, gamma = M / N. We introduce a set of macroscopic parameters (landscapes) and put forward an ansatz of universality for random bit flips. We then formulate the problem of finding the smallest eigenvalue and the excitation gap as a statistical mechanics problem. We use the so-called annealing approximation with a refinement that a finite set of macroscopic variables (verses only energy) is used, and are able to show the existence of a dynamic threshold gamma = gammad, beyond which QAE should take an exponentially long time to find a solution. We compare the results for extended and simplified sets of landscapes and provide numerical evidence in support of our universality ansatz.

  18. KENO-IV/CG, the combinatorial geometry version of the KENO Monte Carlo criticality safety program

    International Nuclear Information System (INIS)

    West, J.T.; Petrie, L.M.; Fraley, S.K.

    1979-09-01

    KENO-IV/CG was developed to merge the simple geometry input description utilized by combinatorial geometry with the repeating lattice feature of the original KENO geometry package. The result is a criticality code with the ability to model a complex system of repeating rectangular lattices inside a complicated three-dimensional geometry system. Furthermore, combinatorial geometry was modified to differentiate between combinatorial zones describing a particular KENO BOX to be repeated in a KENO array and those combinatorial zones describing geometry external to an array. This allows the user to maintain a simple coordinate system without any geometric conflict due to spatial overlap. Several difficult criticality design problems have been solved with the new geometry package in KENO-IV/CG, thus illustrating the power of the code to model difficult geometries with a minimum of effort

  19. USING GENETIC ALGORTIHM TO SOLVE STEINER MINIMUM SPANNING TREE PROBLEM

    Directory of Open Access Journals (Sweden)

    Öznur İŞÇİ

    2006-03-01

    Full Text Available Genetic algorithms (GA are a stochastic research methods, and they produce solutions that are close to optimum or near optimum. In addition to GA's successful application to traveling salesman problem, square designation, allocation, workshop table, preparation of lesson/examination schedules, planning of communication networks, assembling line balanced, minimum spanning tree type many combinatorial optimization problems it would be applicable to make the best comparison in optimization. In this study a Java program is developed to solve Steiner minimum spanning tree problem by genetic algorithm and its performance is examined. According to the tests carried out on the problems that were given before in the literature, results that are close to optimum are obtained in by GA approach that is recommended in this study. For the predetermined points in the study, length and gain are calculated for Steiner minimum spanning tree problem and minimum spanning tree problem.

  20. Combinatorial Speculations and the Combinatorial Conjecture for Mathematics

    OpenAIRE

    Mao, Linfan

    2006-01-01

    Combinatorics is a powerful tool for dealing with relations among objectives mushroomed in the past century. However, an more important work for mathematician is to apply combinatorics to other mathematics and other sciences not merely to find combinatorial behavior for objectives. Recently, such research works appeared on journals for mathematics and theoretical physics on cosmos. The main purpose of this paper is to survey these thinking and ideas for mathematics and cosmological physics, s...

  1. Combinatorial geometry domain decomposition strategies for Monte Carlo simulations

    Energy Technology Data Exchange (ETDEWEB)

    Li, G.; Zhang, B.; Deng, L.; Mo, Z.; Liu, Z.; Shangguan, D.; Ma, Y.; Li, S.; Hu, Z. [Institute of Applied Physics and Computational Mathematics, Beijing, 100094 (China)

    2013-07-01

    Analysis and modeling of nuclear reactors can lead to memory overload for a single core processor when it comes to refined modeling. A method to solve this problem is called 'domain decomposition'. In the current work, domain decomposition algorithms for a combinatorial geometry Monte Carlo transport code are developed on the JCOGIN (J Combinatorial Geometry Monte Carlo transport INfrastructure). Tree-based decomposition and asynchronous communication of particle information between domains are described in the paper. Combination of domain decomposition and domain replication (particle parallelism) is demonstrated and compared with that of MERCURY code. A full-core reactor model is simulated to verify the domain decomposition algorithms using the Monte Carlo particle transport code JMCT (J Monte Carlo Transport Code), which has being developed on the JCOGIN infrastructure. Besides, influences of the domain decomposition algorithms to tally variances are discussed. (authors)

  2. Combinatorial geometry domain decomposition strategies for Monte Carlo simulations

    International Nuclear Information System (INIS)

    Li, G.; Zhang, B.; Deng, L.; Mo, Z.; Liu, Z.; Shangguan, D.; Ma, Y.; Li, S.; Hu, Z.

    2013-01-01

    Analysis and modeling of nuclear reactors can lead to memory overload for a single core processor when it comes to refined modeling. A method to solve this problem is called 'domain decomposition'. In the current work, domain decomposition algorithms for a combinatorial geometry Monte Carlo transport code are developed on the JCOGIN (J Combinatorial Geometry Monte Carlo transport INfrastructure). Tree-based decomposition and asynchronous communication of particle information between domains are described in the paper. Combination of domain decomposition and domain replication (particle parallelism) is demonstrated and compared with that of MERCURY code. A full-core reactor model is simulated to verify the domain decomposition algorithms using the Monte Carlo particle transport code JMCT (J Monte Carlo Transport Code), which has being developed on the JCOGIN infrastructure. Besides, influences of the domain decomposition algorithms to tally variances are discussed. (authors)

  3. Combinatorial Auctions without Money

    Science.gov (United States)

    2014-05-01

    istence of thresholds (a.k.a., critical prices) (for every set). The result in Theorem 3.4 relates to the characterization of truthful CAs with money and no...with money and no verification, each bidder optimizes her valu- ation minus the critical price over all her demanded sets; in the setting without money...auctions. ICALP, pp. 90-101, 2010. [2] P. Briest, P. Krysta, and B. Vöcking. Approximation techniques for utilitarian mechanism design. STOC, pp. 39-48

  4. Combinatorial algebra syntax and semantics

    CERN Document Server

    Sapir, Mark V

    2014-01-01

    Combinatorial Algebra: Syntax and Semantics provides a comprehensive account of many areas of combinatorial algebra. It contains self-contained proofs of  more than 20 fundamental results, both classical and modern. This includes Golod–Shafarevich and Olshanskii's solutions of Burnside problems, Shirshov's solution of Kurosh's problem for PI rings, Belov's solution of Specht's problem for varieties of rings, Grigorchuk's solution of Milnor's problem, Bass–Guivarc'h theorem about the growth of nilpotent groups, Kleiman's solution of Hanna Neumann's problem for varieties of groups, Adian's solution of von Neumann-Day's problem, Trahtman's solution of the road coloring problem of Adler, Goodwyn and Weiss. The book emphasize several ``universal" tools, such as trees, subshifts, uniformly recurrent words, diagrams and automata.   With over 350 exercises at various levels of difficulty and with hints for the more difficult problems, this book can be used as a textbook, and aims to reach a wide and diversified...

  5. Solving a Closed-Loop Location-Inventory-Routing Problem with Mixed Quality Defects Returns in E-Commerce by Hybrid Ant Colony Optimization Algorithm

    Directory of Open Access Journals (Sweden)

    Shuai Deng

    2016-01-01

    Full Text Available This paper presents a closed-loop location-inventory-routing problem model considering both quality defect returns and nondefect returns in e-commerce supply chain system. The objective is to minimize the total cost produced in both forward and reverse logistics networks. We propose a combined optimization algorithm named hybrid ant colony optimization algorithm (HACO to address this model that is an NP-hard problem. Our experimental results show that the proposed HACO is considerably efficient and effective in solving this model.

  6. SOLVING FLOWSHOP SCHEDULING PROBLEMS USING A DISCRETE AFRICAN WILD DOG ALGORITHM

    Directory of Open Access Journals (Sweden)

    M. K. Marichelvam

    2013-04-01

    Full Text Available The problem of m-machine permutation flowshop scheduling is considered in this paper. The objective is to minimize the makespan. The flowshop scheduling problem is a typical combinatorial optimization problem and has been proved to be strongly NP-hard. Hence, several heuristics and meta-heuristics were addressed by the researchers. In this paper, a discrete African wild dog algorithm is applied for solving the flowshop scheduling problems. Computational results using benchmark problems show that the proposed algorithm outperforms many other algorithms addressed in the literature.

  7. Combinatorial aspects of covering arrays

    Directory of Open Access Journals (Sweden)

    Charles J. Colbourn

    2004-11-01

    Full Text Available Covering arrays generalize orthogonal arrays by requiring that t -tuples be covered, but not requiring that the appearance of t -tuples be balanced.Their uses in screening experiments has found application in software testing, hardware testing, and a variety of fields in which interactions among factors are to be identified. Here a combinatorial view of covering arrays is adopted, encompassing basic bounds, direct constructions, recursive constructions, algorithmic methods, and applications.

  8. Fast sequential Monte Carlo methods for counting and optimization

    CERN Document Server

    Rubinstein, Reuven Y; Vaisman, Radislav

    2013-01-01

    A comprehensive account of the theory and application of Monte Carlo methods Based on years of research in efficient Monte Carlo methods for estimation of rare-event probabilities, counting problems, and combinatorial optimization, Fast Sequential Monte Carlo Methods for Counting and Optimization is a complete illustration of fast sequential Monte Carlo techniques. The book provides an accessible overview of current work in the field of Monte Carlo methods, specifically sequential Monte Carlo techniques, for solving abstract counting and optimization problems. Written by authorities in the

  9. A Review On Job Shop Scheduling Using Non-Conventional Optimization Algorithm

    OpenAIRE

    K.Mallikarjuna; Venkatesh.G

    2014-01-01

    A great deal of research has been focused on solving job shop scheduling problem (∫J), over the last four decades, resulting in a wide variety of approaches. Recently much effort has been concentrated on hybrid methods to solve ∫J, as a single technique cannot solve this stubborn problem. As a result much effort has recently been concentrated on techniques that lead to combinatorial optimization methods and a meta-strategy which guides the search out of local optima. In this p...

  10. Solving optimization problems using hybrid architecture: a strategy for planning the electric power generation; Solucao de problemas de otimizacao utilizando arquitetura hibrida: uma estrategia para o planejamento da geracao de energia eletrica

    Energy Technology Data Exchange (ETDEWEB)

    Murakami, L.T. [Lechare Informatica Ltda., Sao Paulo, SP (Brazil)

    2009-07-01

    king of problem. Because of the importance and magnitude of this issue, every effort which contributes to the improvement of power planning is welcome and this corroborates with this thesis which has an objective to propose technical, viable and economic solutions to solve the optimization problems with a new approach and has potential to be applied in many others kind of similar problems.

  11. Solving Sparse Polynomial Optimization Problems with Chordal Structure Using the Sparse, Bounded-Degree Sum-of-Squares Hierarchy

    NARCIS (Netherlands)

    Marandi, Ahmadreza; de Klerk, Etienne; Dahl, Joachim

    The sparse bounded degree sum-of-squares (sparse-BSOS) hierarchy of Weisser, Lasserre and Toh [arXiv:1607.01151,2016] constructs a sequence of lower bounds for a sparse polynomial optimization problem. Under some assumptions, it is proven by the authors that the sequence converges to the optimal

  12. Dynamic combinatorial libraries : new opportunities in systems chemistry

    NARCIS (Netherlands)

    Hunt, Rosemary A. R.; Otto, Sijbren; Hunt, Rosemary A.R.

    2011-01-01

    Combinatorial chemistry is a tool for selecting molecules with special properties. Dynamic combinatorial chemistry started off aiming to be just that. However, unlike ordinary combinatorial chemistry, the interconnectedness of dynamic libraries gives them an extra dimension. An understanding of

  13. Solving multiconstraint assignment problems using learning automata.

    Science.gov (United States)

    Horn, Geir; Oommen, B John

    2010-02-01

    pioneering LA solutions to this problem, unequivocally demonstrates that LA can play an important role in solving complex combinatorial and integer optimization problems.

  14. Incorporating a modified uniform crossover and 2-exchange neighborhood mechanism in a discrete bat algorithm to solve the quadratic assignment problem

    Directory of Open Access Journals (Sweden)

    Mohammed Essaid Riffi

    2017-11-01

    Full Text Available The bat algorithm is one of the recent nature-inspired algorithms, which has been emerged as a powerful search method for solving continuous as well as discrete problems. The quadratic assignment problem is a well-known NP-hard problem in combinatorial optimization. The goal of this problem is to assign n facilities to n locations in such a way as to minimize the assignment cost. For that purpose, this paper introduces a novel discrete variant of bat algorithm to deal with this combinatorial optimization problem. The proposed algorithm was evaluated on a set of benchmark instances from the QAPLIB library and the performance was compared to other algorithms. The empirical results of exhaustive experiments were promising and illustrated the efficacy of the suggested approach.

  15. A non-linear branch and cut method for solving discrete minimum compliance problems to global optimality

    DEFF Research Database (Denmark)

    Stolpe, Mathias; Bendsøe, Martin P.

    2007-01-01

    This paper present some initial results pertaining to a search for globally optimal solutions to a challenging benchmark example proposed by Zhou and Rozvany. This means that we are dealing with global optimization of the classical single load minimum compliance topology design problem with a fixed...... finite element discretization and with discrete design variables. Global optimality is achieved by the implementation of some specially constructed convergent nonlinear branch and cut methods, based on the use of natural relaxations and by applying strengthening constraints (linear valid inequalities...

  16. A non-linear branch and cut method for solving discrete minimum compliance problems to global optimality

    DEFF Research Database (Denmark)

    Stolpe, Mathias; Bendsøe, Martin P.

    2007-01-01

    This paper present some initial results pertaining to a search for globally optimal solutions to a challenging benchmark example proposed by Zhou and Rozvany. This means that we are dealing with global optimization of the classical single load minimum compliance topology design problem with a fixed...... finite element discretization and with discrete design variables. Global optimality is achieved by the implementation of some specially constructed convergent nonlinear branch and cut methods, based on the use of natural relaxations and by applying strengthening constraints (linear valid inequalities......) and cuts....

  17. The Yoccoz Combinatorial Analytic Invariant

    DEFF Research Database (Denmark)

    Petersen, Carsten Lunde; Roesch, Pascale

    2008-01-01

    In this paper we develop a combinatorial analytic encoding of the Mandelbrot set M. The encoding is implicit in Yoccoz' proof of local connectivity of M at any Yoccoz parameter, i.e. any at most finitely renormalizable parameter for which all periodic orbits are repelling. Using this encoding we ...... to reprove that the dyadic veins of M are arcs and that more generally any two Yoccoz parameters are joined by a unique ruled (in the sense of Douady-Hubbard) arc in M....

  18. Log-balanced combinatorial sequences

    Directory of Open Access Journals (Sweden)

    Tomislav Došlic

    2005-01-01

    Full Text Available We consider log-convex sequences that satisfy an additional constraint imposed on their rate of growth. We call such sequences log-balanced. It is shown that all such sequences satisfy a pair of double inequalities. Sufficient conditions for log-balancedness are given for the case when the sequence satisfies a two- (or more- term linear recurrence. It is shown that many combinatorially interesting sequences belong to this class, and, as a consequence, that the above-mentioned double inequalities are valid for all of them.

  19. Optimizing perioperative decision making: improved information for clinical workflow planning.

    Science.gov (United States)

    Doebbeling, Bradley N; Burton, Matthew M; Wiebke, Eric A; Miller, Spencer; Baxter, Laurence; Miller, Donald; Alvarez, Jorge; Pekny, Joseph

    2012-01-01

    Perioperative care is complex and involves multiple interconnected subsystems. Delayed starts, prolonged cases and overtime are common. Surgical procedures account for 40-70% of hospital revenues and 30-40% of total costs. Most planning and scheduling in healthcare is done without modern planning tools, which have potential for improving access by assisting in operations planning support. We identified key planning scenarios of interest to perioperative leaders, in order to examine the feasibility of applying combinatorial optimization software solving some of those planning issues in the operative setting. Perioperative leaders desire a broad range of tools for planning and assessing alternate solutions. Our modeled solutions generated feasible solutions that varied as expected, based on resource and policy assumptions and found better utilization of scarce resources. Combinatorial optimization modeling can effectively evaluate alternatives to support key decisions for planning clinical workflow and improving care efficiency and satisfaction.

  20. Synthesizing optimal waste blends

    International Nuclear Information System (INIS)

    Narayan, V.; Diwekar, W.M.; Hoza, M.

    1996-01-01

    Vitrification of tank wastes to form glass is a technique that will be used for the disposal of high-level waste at Hanford. Process and storage economics show that minimizing the total number of glass logs produced is the key to keeping cost as low as possible. The amount of glass produced can be reduced by blending of the wastes. The optimal way to combine the tanks to minimize the vole of glass can be determined from a discrete blend calculation. However, this problem results in a combinatorial explosion as the number of tanks increases. Moreover, the property constraints make this problem highly nonconvex where many algorithms get trapped in local minima. In this paper the authors examine the use of different combinatorial optimization approaches to solve this problem. A two-stage approach using a combination of simulated annealing and nonlinear programming (NLP) is developed. The results of different methods such as the heuristics approach based on human knowledge and judgment, the mixed integer nonlinear programming (MINLP) approach with GAMS, and branch and bound with lower bound derived from the structure of the given blending problem are compared with this coupled simulated annealing and NLP approach

  1. Solve: a non linear least-squares code and its application to the optimal placement of torsatron vertical field coils

    International Nuclear Information System (INIS)

    Aspinall, J.

    1982-01-01

    A computational method was developed which alleviates the need for lengthy parametric scans as part of a design process. The method makes use of a least squares algorithm to find the optimal value of a parameter vector. Optimal is defined in terms of a utility function prescribed by the user. The placement of the vertical field coils of a torsatron is such a non linear problem

  2. Combination of Markov chain and optimal control solved by Pontryagin’s Minimum Principle for a fuel cell/supercapacitor vehicle

    International Nuclear Information System (INIS)

    Hemi, Hanane; Ghouili, Jamel; Cheriti, Ahmed

    2015-01-01

    Highlights: • A combination of Markov chain and an optimal control solved by Pontryagin’s Minimum Principle is presented. • This strategy is applied to hybrid electric vehicle dynamic model. • The hydrogen consumption is analyzed for two different vehicle mass and drive cycle. • The supercapacitor and fuel cell behavior is analyzed at high or sudden required power. - Abstract: In this article, a real time optimal control strategy based on Pontryagin’s Minimum Principle (PMP) combined with the Markov chain approach is used for a fuel cell/supercapacitor electrical vehicle. In real time, at high power and at high speed, two phenomena are observed. The first is obtained at higher required power, and the second is observed at sudden power demand. To avoid these situations, the Markov chain model is proposed to predict the future power demand during a driving cycle. The optimal control problem is formulated as an equivalent consumption minimization strategy (ECMS), that has to be solved by using the Pontryagin’s Minimum Principle. A Markov chain model is added as a separate block for a prediction of required power. This approach and the whole system are modeled and implemented using the MATLAB/Simulink. The model without Markov chain block and the model is with it are compared. The results presented demonstrate the importance of a Markov chain block added to a model

  3. Combinatorial Interpretation of General Eulerian Numbers

    OpenAIRE

    Tingyao Xiong; Jonathan I. Hall; Hung-Ping Tsao

    2014-01-01

    Since 1950s, mathematicians have successfully interpreted the traditional Eulerian numbers and $q-$Eulerian numbers combinatorially. In this paper, the authors give a combinatorial interpretation to the general Eulerian numbers defined on general arithmetic progressions { a, a+d, a+2d,...}.

  4. Fourier analysis in combinatorial number theory

    International Nuclear Information System (INIS)

    Shkredov, Il'ya D

    2010-01-01

    In this survey applications of harmonic analysis to combinatorial number theory are considered. Discussion topics include classical problems of additive combinatorics, colouring problems, higher-order Fourier analysis, theorems about sets of large trigonometric sums, results on estimates for trigonometric sums over subgroups, and the connection between combinatorial and analytic number theory. Bibliography: 162 titles.

  5. Fourier analysis in combinatorial number theory

    Energy Technology Data Exchange (ETDEWEB)

    Shkredov, Il' ya D [M. V. Lomonosov Moscow State University, Moscow (Russian Federation)

    2010-09-16

    In this survey applications of harmonic analysis to combinatorial number theory are considered. Discussion topics include classical problems of additive combinatorics, colouring problems, higher-order Fourier analysis, theorems about sets of large trigonometric sums, results on estimates for trigonometric sums over subgroups, and the connection between combinatorial and analytic number theory. Bibliography: 162 titles.

  6. Toward Chemical Implementation of Encoded Combinatorial Libraries

    DEFF Research Database (Denmark)

    Nielsen, John; Janda, Kim D.

    1994-01-01

    The recent application of "combinatorial libraries" to supplement existing drug screening processes might simplify and accelerate the search for new lead compounds or drugs. Recently, a scheme for encoded combinatorial chemistry was put forward to surmount a number of the limitations possessed...

  7. Solving the Examination Timetabling Problem in GPUs

    Directory of Open Access Journals (Sweden)

    Vasileios Kolonias

    2014-07-01

    Full Text Available The examination timetabling problem belongs to the class of combinatorial optimization problems and is of great importance for every University. In this paper, a hybrid evolutionary algorithm running on a GPU is employed to solve the examination timetabling problem. The hybrid evolutionary algorithm proposed has a genetic algorithm component and a greedy steepest descent component. The GPU computational capabilities allow the use of very large population sizes, leading to a more thorough exploration of the problem solution space. The GPU implementation, depending on the size of the problem, is up to twenty six times faster than the identical single-threaded CPU implementation of the algorithm. The algorithm is evaluated with the well known Toronto datasets and compares well with the best results found in the bibliography. Moreover, the selection of the encoding of the chromosomes and the tournament selection size as the population grows are examined and optimized. The compressed sparse row format is used for the conflict matrix and was proven essential to the process, since most of the datasets have a small conflict density, which translates into an extremely sparse matrix.

  8. Hybrid IP/CP Methods for Solving Sports Scheduling Problems

    DEFF Research Database (Denmark)

    Rasmussen, Rasmus Vinther

    2006-01-01

    The field of sports scheduling comprises a challenging research areawith a great variety of hard combinatorial optimization problems andchallenging practical applications. This dissertation gives acomprehensive survey of the area and a number of new contributionsare presented. First a general sol...

  9. MODLP program description: A program for solving linear optimal hydraulic control of groundwater contamination based on MODFLOW simulation. Version 1.0

    International Nuclear Information System (INIS)

    Ahlfeld, D.P.; Dougherty, D.E.

    1994-11-01

    MODLP is a computational tool that may help design capture zones for controlling the movement of contaminated groundwater. It creates and solves linear optimization programs that contain constraints on hydraulic head or head differences in a groundwater system. The groundwater domain is represented by USGS MODFLOW groundwater flow simulation model. This document describes the general structure of the computer program, MODLP, the types of constraints that may be imposed, detailed input instructions, interpretation of the output, and the interaction with the MODFLOW simulation kernel

  10. Solutions manual to accompany Combinatorial reasoning an introduction to the art of counting

    CERN Document Server

    DeTemple, Duane

    2014-01-01

    This is a solutions manual to accompany Combinatorial Reasoning: An Introduction to the Art of CountingWritten by well-known scholars in the field, Combinatorial Reasoning: An Introduction to the Art of Counting introduces combinatorics alongside modern techniques, showcases the interdisciplinary aspects of the topic, and illustrates how to problem solve with a multitude of exercises throughout. The authors'' approach is very reader-friendly and avoids the ""scholarly tone"" found in many books on this topic.  

  11. A new approach to the use of genetic algorithms to solve the pressurized water reactor's fuel management optimization problem

    Energy Technology Data Exchange (ETDEWEB)

    Chapot, Jorge Luiz C. [ELETRONUCLEAR, Rio de Janeiro, RJ (Brazil); Carvalho Da Silva, Fernando; Schirru, Roberto [COPPE/UFRJ-Nuclear, Rio de Janeiro, RJ (Brazil)

    1999-05-01

    A Genetic Algorithm (GA) based system, coupling the computer codes GENESIS 5.0 and ANC through the interface ALGER has been developed aiming at pressurized water reactor's (PWR) fuel management optimization. An innovative codification, the List Model (LM), has been incorporated into the system. LM avoids the use of heuristic crossover operators and only generates valid nonrepetitive loading patterns in the reactor core. The LM has been used to solve the Traveling Salesman Problem (TSP). The results got for a benchmark problem were very satisfactory, in terms of precision and computational costs. The GENESIS/ALGER/ANC system has been successfully tested in optimization studies for Angra 1 power plant reloads.

  12. Multi-objective optimization in computer networks using metaheuristics

    CERN Document Server

    Donoso, Yezid

    2007-01-01

    Metaheuristics are widely used to solve important practical combinatorial optimization problems. Many new multicast applications emerging from the Internet-such as TV over the Internet, radio over the Internet, and multipoint video streaming-require reduced bandwidth consumption, end-to-end delay, and packet loss ratio. It is necessary to design and to provide for these kinds of applications as well as for those resources necessary for functionality. Multi-Objective Optimization in Computer Networks Using Metaheuristics provides a solution to the multi-objective problem in routing computer networks. It analyzes layer 3 (IP), layer 2 (MPLS), and layer 1 (GMPLS and wireless functions). In particular, it assesses basic optimization concepts, as well as several techniques and algorithms for the search of minimals; examines the basic multi-objective optimization concepts and the way to solve them through traditional techniques and through several metaheuristics; and demonstrates how to analytically model the compu...

  13. An Approximate Method for Solving Optimal Control Problems for Discrete Systems Based on Local Approximation of an Attainability Set

    Directory of Open Access Journals (Sweden)

    V. A. Baturin

    2017-03-01

    Full Text Available An optimal control problem for discrete systems is considered. A method of successive improvements along with its modernization based on the expansion of the main structures of the core algorithm about the parameter is suggested. The idea of the method is based on local approximation of attainability set, which is described by the zeros of the Bellman function in the special problem of optimal control. The essence of the problem is as follows: from the end point of the phase is required to find a path that minimizes functional deviations of the norm from the initial state. If the initial point belongs to the attainability set of the original controlled system, the value of the Bellman function equal to zero, otherwise the value of the Bellman function is greater than zero. For this special task Bellman equation is considered. The support approximation and Bellman equation are selected. The Bellman function is approximated by quadratic terms. Along the allowable trajectory, this approximation gives nothing, because Bellman function and its expansion coefficients are zero. We used a special trick: an additional variable is introduced, which characterizes the degree of deviation of the system from the initial state, thus it is obtained expanded original chain. For the new variable initial nonzero conditions is selected, thus obtained trajectory is lying outside attainability set and relevant Bellman function is greater than zero, which allows it to hold a non-trivial approximation. As a result of these procedures algorithms of successive improvements is designed. Conditions for relaxation algorithms and conditions for the necessary conditions of optimality are also obtained.

  14. Ranked solutions to a class of combinatorial optimizations—with applications in mass spectrometry based peptide sequencing and a variant of directed paths in random media

    Science.gov (United States)

    Doerr, Timothy P.; Alves, Gelio; Yu, Yi-Kuo

    2005-08-01

    Typical combinatorial optimizations are NP-hard; however, for a particular class of cost functions the corresponding combinatorial optimizations can be solved in polynomial time using the transfer matrix technique or, equivalently, the dynamic programming approach. This suggests a way to efficiently find approximate solutions-find a transformation that makes the cost function as similar as possible to that of the solvable class. After keeping many high-ranking solutions using the approximate cost function, one may then re-assess these solutions with the full cost function to find the best approximate solution. Under this approach, it is important to be able to assess the quality of the solutions obtained, e.g., by finding the true ranking of the kth best approximate solution when all possible solutions are considered exhaustively. To tackle this statistical issue, we provide a systematic method starting with a scaling function generated from the finite number of high-ranking solutions followed by a convergent iterative mapping. This method, useful in a variant of the directed paths in random media problem proposed here, can also provide a statistical significance assessment for one of the most important proteomic tasks-peptide sequencing using tandem mass spectrometry data. For directed paths in random media, the scaling function depends on the particular realization of randomness; in the mass spectrometry case, the scaling function is spectrum-specific.

  15. Optimization of stochastic discrete systems and control on complex networks computational networks

    CERN Document Server

    Lozovanu, Dmitrii

    2014-01-01

    This book presents the latest findings on stochastic dynamic programming models and on solving optimal control problems in networks. It includes the authors' new findings on determining the optimal solution of discrete optimal control problems in networks and on solving game variants of Markov decision problems in the context of computational networks. First, the book studies the finite state space of Markov processes and reviews the existing methods and algorithms for determining the main characteristics in Markov chains, before proposing new approaches based on dynamic programming and combinatorial methods. Chapter two is dedicated to infinite horizon stochastic discrete optimal control models and Markov decision problems with average and expected total discounted optimization criteria, while Chapter three develops a special game-theoretical approach to Markov decision processes and stochastic discrete optimal control problems. In closing, the book's final chapter is devoted to finite horizon stochastic con...

  16. Tumor-targeting peptides from combinatorial libraries*

    Science.gov (United States)

    Liu, Ruiwu; Li, Xiaocen; Xiao, Wenwu; Lam, Kit S.

    2018-01-01

    Cancer is one of the major and leading causes of death worldwide. Two of the greatest challenges infighting cancer are early detection and effective treatments with no or minimum side effects. Widespread use of targeted therapies and molecular imaging in clinics requires high affinity, tumor-specific agents as effective targeting vehicles to deliver therapeutics and imaging probes to the primary or metastatic tumor sites. Combinatorial libraries such as phage-display and one-bead one-compound (OBOC) peptide libraries are powerful approaches in discovering tumor-targeting peptides. This review gives an overview of different combinatorial library technologies that have been used for the discovery of tumor-targeting peptides. Examples of tumor-targeting peptides identified from each combinatorial library method will be discussed. Published tumor-targeting peptide ligands and their applications will also be summarized by the combinatorial library methods and their corresponding binding receptors. PMID:27210583

  17. Combinatorial Micro-Macro Dynamical Systems

    OpenAIRE

    Diaz, Rafael; Villamarin, Sergio

    2015-01-01

    The second law of thermodynamics states that the entropy of an isolated system is almost always increasing. We propose combinatorial formalizations of the second law and explore their conditions of possibilities.

  18. 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)

  19. 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)

  20. Cubical version of combinatorial differential forms

    DEFF Research Database (Denmark)

    Kock, Anders

    2010-01-01

    The theory of combinatorial differential forms is usually presented in simplicial terms. We present here a cubical version; it depends on the possibility of forming affine combinations of mutual neighbour points in a manifold, in the context of synthetic differential geometry.......The theory of combinatorial differential forms is usually presented in simplicial terms. We present here a cubical version; it depends on the possibility of forming affine combinations of mutual neighbour points in a manifold, in the context of synthetic differential geometry....

  1. Conferences on Combinatorial and Additive Number Theory

    CERN Document Server

    2014-01-01

    This proceedings volume is based on papers presented at the Workshops on Combinatorial and Additive Number Theory (CANT), which were held at the Graduate Center of the City University of New York in 2011 and 2012. The goal of the workshops is to survey recent progress in combinatorial number theory and related parts of mathematics. The workshop attracts researchers and students who discuss the state-of-the-art, open problems, and future challenges in number theory.

  2. Jack superpolynomials: physical and combinatorial definitions

    International Nuclear Information System (INIS)

    Desrosiers, P.; Mathieu, P.; Lapointe, L.

    2004-01-01

    Jack superpolynomials are eigenfunctions of the supersymmetric extension of the quantum trigonometric Calogero-Moser-Sutherland Hamiltonian. They are orthogonal with respect to the scalar product, dubbed physical, that is naturally induced by this quantum-mechanical problem. But Jack superpolynomials can also be defined more combinatorially, starting from the multiplicative bases of symmetric superpolynomials, enforcing orthogonality with respect to a one-parameter deformation of the combinatorial scalar product. Both constructions turn out to be equivalent. (author)

  3. Combinatorial therapy discovery using mixed integer linear programming.

    Science.gov (United States)

    Pang, Kaifang; Wan, Ying-Wooi; Choi, William T; Donehower, Lawrence A; Sun, Jingchun; Pant, Dhruv; Liu, Zhandong

    2014-05-15

    Combinatorial therapies play increasingly important roles in combating complex diseases. Owing to the huge cost associated with experimental methods in identifying optimal drug combinations, computational approaches can provide a guide to limit the search space and reduce cost. However, few computational approaches have been developed for this purpose, and thus there is a great need of new algorithms for drug combination prediction. Here we proposed to formulate the optimal combinatorial therapy problem into two complementary mathematical algorithms, Balanced Target Set Cover (BTSC) and Minimum Off-Target Set Cover (MOTSC). Given a disease gene set, BTSC seeks a balanced solution that maximizes the coverage on the disease genes and minimizes the off-target hits at the same time. MOTSC seeks a full coverage on the disease gene set while minimizing the off-target set. Through simulation, both BTSC and MOTSC demonstrated a much faster running time over exhaustive search with the same accuracy. When applied to real disease gene sets, our algorithms not only identified known drug combinations, but also predicted novel drug combinations that are worth further testing. In addition, we developed a web-based tool to allow users to iteratively search for optimal drug combinations given a user-defined gene set. Our tool is freely available for noncommercial use at http://www.drug.liuzlab.org/. zhandong.liu@bcm.edu Supplementary data are available at Bioinformatics online.

  4. Combinatorial effects of arginine and fluoride on oral bacteria.

    Science.gov (United States)

    Zheng, X; Cheng, X; Wang, L; Qiu, W; Wang, S; Zhou, Y; Li, M; Li, Y; Cheng, L; Li, J; Zhou, X; Xu, X

    2015-02-01

    Dental caries is closely associated with the microbial disequilibrium between acidogenic/aciduric pathogens and alkali-generating commensal residents within the dental plaque. Fluoride is a widely used anticaries agent, which promotes tooth hard-tissue remineralization and suppresses bacterial activities. Recent clinical trials have shown that oral hygiene products containing both fluoride and arginine possess a greater anticaries effect compared with those containing fluoride alone, indicating synergy between fluoride and arginine in caries management. Here, we hypothesize that arginine may augment the ecological benefit of fluoride by enriching alkali-generating bacteria in the plaque biofilm and thus synergizes with fluoride in controlling dental caries. Specifically, we assessed the combinatory effects of NaF/arginine on planktonic and biofilm cultures of Streptococcus mutans, Streptococcus sanguinis, and Porphyromonas gingivalis with checkerboard microdilution assays. The optimal NaF/arginine combinations were selected, and their combinatory effects on microbial composition were further examined in single-, dual-, and 3-species biofilm using bacterial species-specific fluorescence in situ hybridization and quantitative polymerase chain reaction. We found that arginine synergized with fluoride in suppressing acidogenic S. mutans in both planktonic and biofilm cultures. In addition, the NaF/arginine combination synergistically reduced S. mutans but enriched S. sanguinis within the multispecies biofilms. More importantly, the optimal combination of NaF/arginine maintained a "streptococcal pressure" against the potential growth of oral anaerobe P. gingivalis within the alkalized biofilm. Taken together, we conclude that the combinatory application of fluoride and arginine has a potential synergistic effect in maintaining a healthy oral microbial equilibrium and thus represents a promising ecological approach to caries management. © International & American

  5. A combinatorial approach to the design of vaccines.

    Science.gov (United States)

    Martínez, Luis; Milanič, Martin; Legarreta, Leire; Medvedev, Paul; Malaina, Iker; de la Fuente, Ildefonso M

    2015-05-01

    We present two new problems of combinatorial optimization and discuss their applications to the computational design of vaccines. In the shortest λ-superstring problem, given a family S1,...,S(k) of strings over a finite alphabet, a set Τ of "target" strings over that alphabet, and an integer λ, the task is to find a string of minimum length containing, for each i, at least λ target strings as substrings of S(i). In the shortest λ-cover superstring problem, given a collection X1,...,X(n) of finite sets of strings over a finite alphabet and an integer λ, the task is to find a string of minimum length containing, for each i, at least λ elements of X(i) as substrings. The two problems are polynomially equivalent, and the shortest λ-cover superstring problem is a common generalization of two well known combinatorial optimization problems, the shortest common superstring problem and the set cover problem. We present two approaches to obtain exact or approximate solutions to the shortest λ-superstring and λ-cover superstring problems: one based on integer programming, and a hill-climbing algorithm. An application is given to the computational design of vaccines and the algorithms are applied to experimental data taken from patients infected by H5N1 and HIV-1.

  6. Combinatorial stresses kill pathogenic Candida species

    Science.gov (United States)

    Kaloriti, Despoina; Tillmann, Anna; Cook, Emily; Jacobsen, Mette; You, Tao; Lenardon, Megan; Ames, Lauren; Barahona, Mauricio; Chandrasekaran, Komelapriya; Coghill, George; Goodman, Daniel; Gow, Neil A. R.; Grebogi, Celso; Ho, Hsueh-Lui; Ingram, Piers; McDonagh, Andrew; De Moura, Alessandro P. S.; Pang, Wei; Puttnam, Melanie; Radmaneshfar, Elahe; Romano, Maria Carmen; Silk, Daniel; Stark, Jaroslav; Stumpf, Michael; Thiel, Marco; Thorne, Thomas; Usher, Jane; Yin, Zhikang; Haynes, Ken; Brown, Alistair J. P.

    2012-01-01

    Pathogenic microbes exist in dynamic niches and have evolved robust adaptive responses to promote survival in their hosts. The major fungal pathogens of humans, Candida albicans and Candida glabrata, are exposed to a range of environmental stresses in their hosts including osmotic, oxidative and nitrosative stresses. Significant efforts have been devoted to the characterization of the adaptive responses to each of these stresses. In the wild, cells are frequently exposed simultaneously to combinations of these stresses and yet the effects of such combinatorial stresses have not been explored. We have developed a common experimental platform to facilitate the comparison of combinatorial stress responses in C. glabrata and C. albicans. This platform is based on the growth of cells in buffered rich medium at 30°C, and was used to define relatively low, medium and high doses of osmotic (NaCl), oxidative (H 2O2) and nitrosative stresses (e.g., dipropylenetriamine (DPTA)-NONOate). The effects of combinatorial stresses were compared with the corresponding individual stresses under these growth conditions. We show for the first time that certain combinations of combinatorial stress are especially potent in terms of their ability to kill C. albicans and C. glabrata and/or inhibit their growth. This was the case for combinations of osmotic plus oxidative stress and for oxidative plus nitrosative stress. We predict that combinatorial stresses may be highly signif cant in host defences against these pathogenic yeasts. PMID:22463109

  7. A Hybrid Symbiotic Organisms Search Algorithm with Variable Neighbourhood Search for Solving Symmetric and Asymmetric Traveling Salesman Problem

    Science.gov (United States)

    Umam, M. I. H.; Santosa, B.

    2018-04-01

    Combinatorial optimization has been frequently used to solve both problems in science, engineering, and commercial applications. One combinatorial problems in the field of transportation is to find a shortest travel route that can be taken from the initial point of departure to point of destination, as well as minimizing travel costs and travel time. When the distance from one (initial) node to another (destination) node is the same with the distance to travel back from destination to initial, this problems known to the Traveling Salesman Problem (TSP), otherwise it call as an Asymmetric Traveling Salesman Problem (ATSP). The most recent optimization techniques is Symbiotic Organisms Search (SOS). This paper discuss how to hybrid the SOS algorithm with variable neighborhoods search (SOS-VNS) that can be applied to solve the ATSP problem. The proposed mechanism to add the variable neighborhoods search as a local search is to generate the better initial solution and then we modify the phase of parasites with adapting mechanism of mutation. After modification, the performance of the algorithm SOS-VNS is evaluated with several data sets and then the results is compared with the best known solution and some algorithm such PSO algorithm and SOS original algorithm. The SOS-VNS algorithm shows better results based on convergence, divergence and computing time.

  8. Theoretical Investigation of Combined Use of PSO, Tabu Search and Lagrangian Relaxation methods to solve the Unit Commitment Problem

    Directory of Open Access Journals (Sweden)

    Sahbi Marrouchi

    2018-02-01

    Full Text Available Solving the Unit Commitment problem (UCP optimizes the combination of production units operations and determines the appropriate operational scheduling of each production units to satisfy the expected consumption which varies from one day to one month. Besides, each production unit is conducted to constraints that render this problem complex, combinatorial and nonlinear. In this paper, we proposed a new strategy based on the combination three optimization methods: Tabu search, Particle swarm optimization and Lagrangian relaxation methods in order to develop a proper unit commitment scheduling of the production units while reducing the production cost during a definite period. The proposed strategy has been implemented on a the IEEE 9 bus test system containing 3 production unit and the results were promising compared to strategies based on meta-heuristic and deterministic methods.

  9. Local formulae for combinatorial Pontryagin classes

    International Nuclear Information System (INIS)

    Gaifullin, Alexander A

    2004-01-01

    Let p(|K|) be the characteristic class of a combinatorial manifold K given by a polynomial p in the rational Pontryagin classes of K. We prove that for any polynomial p there is a function taking each combinatorial manifold K to a cycle z p (K) in its rational simplicial chains such that: 1) the Poincare dual of z p (K) represents the cohomology class p(|K|); 2) the coefficient of each simplex Δ in the cycle z p (K) is determined solely by the combinatorial type of linkΔ. We explicitly describe all such functions for the first Pontryagin class. We obtain estimates for the denominators of the coefficients of the simplices in the cycles z p (K)

  10. Optimal placement of excitations and sensors for verification of large dynamical systems

    Science.gov (United States)

    Salama, M.; Rose, T.; Garba, J.

    1987-01-01

    The computationally difficult problem of the optimal placement of excitations and sensors to maximize the observed measurements is studied within the framework of combinatorial optimization, and is solved numerically using a variation of the simulated annealing heuristic algorithm. Results of numerical experiments including a square plate and a 960 degrees-of-freedom Control of Flexible Structure (COFS) truss structure, are presented. Though the algorithm produces suboptimal solutions, its generality and simplicity allow the treatment of complex dynamical systems which would otherwise be difficult to handle.

  11. Global optimization of discrete truss topology design problems using a parallel cut-and-branch method

    DEFF Research Database (Denmark)

    Rasmussen, Marie-Louise Højlund; Stolpe, Mathias

    2008-01-01

    the physics, and the cuts (Combinatorial Benders’ and projected Chvátal–Gomory) come from an understanding of the particular mathematical structure of the reformulation. The impact of a stronger representation is investigated on several truss topology optimization problems in two and three dimensions.......The subject of this article is solving discrete truss topology optimization problems with local stress and displacement constraints to global optimum. We consider a formulation based on the Simultaneous ANalysis and Design (SAND) approach. This intrinsically non-convex problem is reformulated...

  12. A quark interpretation of the combinatorial hierarchy

    International Nuclear Information System (INIS)

    Enqvist, Kari.

    1979-01-01

    We propose a physical interpretation of the second level of the combinatorial hierarchy in terms of three quarks, three antiquarks and the vacuum. This interpretation allows us to introduce a new quantum number, which measures electromagnetic mass splitting of the quarks. We extend our argument by analogue to baryons, and find some SU(3) and some new mass formulas for baryons. The generalization of our approach to other hierarchy levels is discussed. We present also an empirical mass formula for baryons, which seems to be loosely connected with the combinatorial hierarchy. (author)

  13. Combinatorial designs a tribute to Haim Hanani

    CERN Document Server

    Hartman, A

    1989-01-01

    Haim Hanani pioneered the techniques for constructing designs and the theory of pairwise balanced designs, leading directly to Wilson''s Existence Theorem. He also led the way in the study of resolvable designs, covering and packing problems, latin squares, 3-designs and other combinatorial configurations.The Hanani volume is a collection of research and survey papers at the forefront of research in combinatorial design theory, including Professor Hanani''s own latest work on Balanced Incomplete Block Designs. Other areas covered include Steiner systems, finite geometries, quasigroups, and t-designs.

  14. Dynamic combinatorial chemistry with diselenides and disulfides in water

    DEFF Research Database (Denmark)

    Rasmussen, Brian; Sørensen, Anne; Gotfredsen, Henrik

    2014-01-01

    Diselenide exchange is introduced as a reversible reaction in dynamic combinatorial chemistry in water. At neutral pH, diselenides are found to mix with disulfides and form dynamic combinatorial libraries of diselenides, disulfides, and selenenylsulfides. This journal is......Diselenide exchange is introduced as a reversible reaction in dynamic combinatorial chemistry in water. At neutral pH, diselenides are found to mix with disulfides and form dynamic combinatorial libraries of diselenides, disulfides, and selenenylsulfides. This journal is...

  15. An Optimized Grey Dynamic Model for Forecasting the Output of High-Tech Industry in China

    Directory of Open Access Journals (Sweden)

    Zheng-Xin Wang

    2014-01-01

    Full Text Available The grey dynamic model by convolution integral with the first-order derivative of the 1-AGO data and n series related, abbreviated as GDMC(1,n, performs well in modelling and forecasting of a grey system. To improve the modelling accuracy of GDMC(1,n, n interpolation coefficients (taken as unknown parameters are introduced into the background values of the n variables. The parameters optimization is formulated as a combinatorial optimization problem and is solved collectively using the particle swarm optimization algorithm. The optimized result has been verified by a case study of the economic output of high-tech industry in China. Comparisons of the obtained modelling results from the optimized GDMC(1,n model with the traditional one demonstrate that the optimal algorithm is a good alternative for parameters optimization of the GDMC(1,n model. The modelling results can assist the government in developing future policies regarding high-tech industry management.

  16. A New Approach for Proving or Generating Combinatorial Identities

    Science.gov (United States)

    Gonzalez, Luis

    2010-01-01

    A new method for proving, in an immediate way, many combinatorial identities is presented. The method is based on a simple recursive combinatorial formula involving n + 1 arbitrary real parameters. Moreover, this formula enables one not only to prove, but also generate many different combinatorial identities (not being required to know them "a…

  17. Hybrid Microgrid Configuration Optimization with Evolutionary Algorithms

    Science.gov (United States)

    Lopez, Nicolas

    This dissertation explores the Renewable Energy Integration Problem, and proposes a Genetic Algorithm embedded with a Monte Carlo simulation to solve large instances of the problem that are impractical to solve via full enumeration. The Renewable Energy Integration Problem is defined as finding the optimum set of components to supply the electric demand to a hybrid microgrid. The components considered are solar panels, wind turbines, diesel generators, electric batteries, connections to the power grid and converters, which can be inverters and/or rectifiers. The methodology developed is explained as well as the combinatorial formulation. In addition, 2 case studies of a single objective optimization version of the problem are presented, in order to minimize cost and to minimize global warming potential (GWP) followed by a multi-objective implementation of the offered methodology, by utilizing a non-sorting Genetic Algorithm embedded with a monte Carlo Simulation. The method is validated by solving a small instance of the problem with known solution via a full enumeration algorithm developed by NREL in their software HOMER. The dissertation concludes that the evolutionary algorithms embedded with Monte Carlo simulation namely modified Genetic Algorithms are an efficient form of solving the problem, by finding approximate solutions in the case of single objective optimization, and by approximating the true Pareto front in the case of multiple objective optimization of the Renewable Energy Integration Problem.

  18. An corrigendum on the paper : Solving the job-shop scheduling problem optimally by dynamic programming (Computers and Operations Research 39(12) (2968–2977) (S0305054812000500) (10.1016/j.cor.2012.02.024))

    NARCIS (Netherlands)

    van Hoorn, Jelke J.; Nogueira, Agustín; Ojea, Ignacio; Gromicho Dos Santos, Joaquim Antonio

    2017-01-01

    In [1] an algorithm is proposed for solving the job-shop scheduling problem optimally using a dynamic programming strategy. This is, according to our knowledge, the first exact algorithm for the Job Shop problem which is not based on integer linear programming and branch and bound. Despite the

  19. Causal gene identification using combinatorial V-structure search.

    Science.gov (United States)

    Cai, Ruichu; Zhang, Zhenjie; Hao, Zhifeng

    2013-07-01

    With the advances of biomedical techniques in the last decade, the costs of human genomic sequencing and genomic activity monitoring are coming down rapidly. To support the huge genome-based business in the near future, researchers are eager to find killer applications based on human genome information. Causal gene identification is one of the most promising applications, which may help the potential patients to estimate the risk of certain genetic diseases and locate the target gene for further genetic therapy. Unfortunately, existing pattern recognition techniques, such as Bayesian networks, cannot be directly applied to find the accurate causal relationship between genes and diseases. This is mainly due to the insufficient number of samples and the extremely high dimensionality of the gene space. In this paper, we present the first practical solution to causal gene identification, utilizing a new combinatorial formulation over V-Structures commonly used in conventional Bayesian networks, by exploring the combinations of significant V-Structures. We prove the NP-hardness of the combinatorial search problem under a general settings on the significance measure on the V-Structures, and present a greedy algorithm to find sub-optimal results. Extensive experiments show that our proposal is both scalable and effective, particularly with interesting findings on the causal genes over real human genome data. Copyright © 2013 Elsevier Ltd. All rights reserved.

  20. Combinatorial biosynthesis of medicinal plant secondary metabolites

    NARCIS (Netherlands)

    Julsing, Mattijs K.; Koulman, Albert; Woerdenbag, Herman J.; Quax, Wim J.; Kayser, Oliver

    2006-01-01

    Combinatorial biosynthesis is a new tool in the generation of novel natural products and for the production of rare and expensive natural products. The basic concept is combining metabolic pathways in different organisms on a genetic level. As a consequence heterologous organisms provide precursors

  1. Infinitary Combinatory Reduction Systems: Normalising Reduction Strategies

    NARCIS (Netherlands)

    Ketema, J.; Simonsen, Jakob Grue

    2010-01-01

    We study normalising reduction strategies for infinitary Combinatory Reduction Systems (iCRSs). We prove that all fair, outermost-fair, and needed-fair strategies are normalising for orthogonal, fully-extended iCRSs. These facts properly generalise a number of results on normalising strategies in

  2. PIPERIDINE OLIGOMERS AND COMBINATORIAL LIBRARIES THEREOF

    DEFF Research Database (Denmark)

    1999-01-01

    The present invention relates to piperidine oligomers, methods for the preparation of piperidine oligomers and compound libraries thereof, and the use of piperidine oligomers as drug substances. The present invention also relates to the use of combinatorial libraries of piperidine oligomers...... in libraries (arrays) of compounds especially suitable for screening purposes....

  3. Dendrimer-based dynamic combinatorial libraries

    NARCIS (Netherlands)

    Chang, T.; Meijer, E.W.

    2005-01-01

    The aim of this project is to create water-sol. dynamic combinatorial libraries based upon dendrimer-guest complexes. The guest mols. are designed to bind to dendrimers using multiple secondary interactions, such as electrostatics and hydrogen bonding. We have been able to incorporate various guest

  4. Gian-Carlos Rota and Combinatorial Math.

    Science.gov (United States)

    Kolata, Gina Bari

    1979-01-01

    Presents the first of a series of occasional articles about mathematics as seen through the eyes of its prominent scholars. In an interview with Gian-Carlos Rota of the Massachusetts Institute of Technology he discusses how combinatorial mathematics began as a field and its future. (HM)

  5. Torus actions, combinatorial topology, and homological algebra

    International Nuclear Information System (INIS)

    Bukhshtaber, V M; Panov, T E

    2000-01-01

    This paper is a survey of new results and open problems connected with fundamental combinatorial concepts, including polytopes, simplicial complexes, cubical complexes, and arrangements of subspaces. Attention is concentrated on simplicial and cubical subdivisions of manifolds, and especially on spheres. Important constructions are described that enable one to study these combinatorial objects by using commutative and homological algebra. The proposed approach to combinatorial problems is based on the theory of moment-angle complexes recently developed by the authors. The crucial construction assigns to each simplicial complex K with m vertices a T m -space Z K with special bigraded cellular decomposition. In the framework of this theory, well-known non-singular toric varieties arise as orbit spaces of maximally free actions of subtori on moment-angle complexes corresponding to simplicial spheres. It is shown that diverse invariants of simplicial complexes and related combinatorial-geometric objects can be expressed in terms of bigraded cohomology rings of the corresponding moment-angle complexes. Finally, it is shown that the new relationships between combinatorics, geometry, and topology lead to solutions of some well-known topological problems

  6. Combinatorial Aspects of the Generalized Euler's Totient

    Directory of Open Access Journals (Sweden)

    Nittiya Pabhapote

    2010-01-01

    Full Text Available A generalized Euler's totient is defined as a Dirichlet convolution of a power function and a product of the Souriau-Hsu-Möbius function with a completely multiplicative function. Two combinatorial aspects of the generalized Euler's totient, namely, its connections to other totients and its relations with counting formulae, are investigated.

  7. Logging to Facilitate Combinatorial System Testing

    NARCIS (Netherlands)

    Kruse, P.M.; Prasetya, I.S.W.B.; Hage, J; Elyasov, Alexander

    2014-01-01

    Testing a web application is typically very complicated. Imposing simple coverage criteria such as function or line coverage is often not sufficient to uncover bugs due to incorrect components integration. Combinatorial testing can enforce a stronger criterion, while still allowing the

  8. Combinatorial structures to modeling simple games and applications

    Science.gov (United States)

    Molinero, Xavier

    2017-09-01

    We connect three different topics: combinatorial structures, game theory and chemistry. In particular, we establish the bases to represent some simple games, defined as influence games, and molecules, defined from atoms, by using combinatorial structures. First, we characterize simple games as influence games using influence graphs. It let us to modeling simple games as combinatorial structures (from the viewpoint of structures or graphs). Second, we formally define molecules as combinations of atoms. It let us to modeling molecules as combinatorial structures (from the viewpoint of combinations). It is open to generate such combinatorial structures using some specific techniques as genetic algorithms, (meta-)heuristics algorithms and parallel programming, among others.

  9. Optimal Control Surface Layout for an Aeroservoelastic Wingbox

    Science.gov (United States)

    Stanford, Bret K.

    2017-01-01

    This paper demonstrates a technique for locating the optimal control surface layout of an aeroservoelastic Common Research Model wingbox, in the context of maneuver load alleviation and active utter suppression. The combinatorial actuator layout design is solved using ideas borrowed from topology optimization, where the effectiveness of a given control surface is tied to a layout design variable, which varies from zero (the actuator is removed) to one (the actuator is retained). These layout design variables are optimized concurrently with a large number of structural wingbox sizing variables and control surface actuation variables, in order to minimize the sum of structural weight and actuator weight. Results are presented that demonstrate interdependencies between structural sizing patterns and optimal control surface layouts, for both static and dynamic aeroelastic physics.

  10. A direct method to solve optimal knots of B-spline curves: An application for non-uniform B-spline curves fitting.

    Directory of Open Access Journals (Sweden)

    Van Than Dung

    Full Text Available B-spline functions are widely used in many industrial applications such as computer graphic representations, computer aided design, computer aided manufacturing, computer numerical control, etc. Recently, there exist some demands, e.g. in reverse engineering (RE area, to employ B-spline curves for non-trivial cases that include curves with discontinuous points, cusps or turning points from the sampled data. The most challenging task in these cases is in the identification of the number of knots and their respective locations in non-uniform space in the most efficient computational cost. This paper presents a new strategy for fitting any forms of curve by B-spline functions via local algorithm. A new two-step method for fast knot calculation is proposed. In the first step, the data is split using a bisecting method with predetermined allowable error to obtain coarse knots. Secondly, the knots are optimized, for both locations and continuity levels, by employing a non-linear least squares technique. The B-spline function is, therefore, obtained by solving the ordinary least squares problem. The performance of the proposed method is validated by using various numerical experimental data, with and without simulated noise, which were generated by a B-spline function and deterministic parametric functions. This paper also discusses the benchmarking of the proposed method to the existing methods in literature. The proposed method is shown to be able to reconstruct B-spline functions from sampled data within acceptable tolerance. It is also shown that, the proposed method can be applied for fitting any types of curves ranging from smooth ones to discontinuous ones. In addition, the method does not require excessive computational cost, which allows it to be used in automatic reverse engineering applications.

  11. A Simple Combinatorial Codon Mutagenesis Method for Targeted Protein Engineering.

    Science.gov (United States)

    Belsare, Ketaki D; Andorfer, Mary C; Cardenas, Frida S; Chael, Julia R; Park, Hyun June; Lewis, Jared C

    2017-03-17

    Directed evolution is a powerful tool for optimizing enzymes, and mutagenesis methods that improve enzyme library quality can significantly expedite the evolution process. Here, we report a simple method for targeted combinatorial codon mutagenesis (CCM). To demonstrate the utility of this method for protein engineering, CCM libraries were constructed for cytochrome P450 BM3 , pfu prolyl oligopeptidase, and the flavin-dependent halogenase RebH; 10-26 sites were targeted for codon mutagenesis in each of these enzymes, and libraries with a tunable average of 1-7 codon mutations per gene were generated. Each of these libraries provided improved enzymes for their respective transformations, which highlights the generality, simplicity, and tunability of CCM for targeted protein engineering.

  12. Design and spectroscopic reflectometry characterization of pulsed laser deposition combinatorial libraries

    International Nuclear Information System (INIS)

    Schenck, Peter K.; Bassim, Nabil D.; Otani, Makoto; Oguchi, Hiroyuki; Green, Martin L.

    2007-01-01

    The goal of the design of pulsed laser deposition (PLD) combinatorial library films is to optimize the compositional coverage of the films while maintaining a uniform thickness. The deposition pattern of excimer laser PLD films can be modeled with a bimodal cos n distribution. Deposited films were characterized using a spectroscopic reflectometer (250-1000 nm) to map the thickness of both single composition calibration films and combinatorial library films. These distribution functions were used to simulate the composition and thickness of multiple target combinatorial library films. The simulations were correlated with electron-probe microanalysis wavelength-dispersive spectroscopy (EPMA-WDS) composition maps. The composition and thickness of the library films can be fine-tuned by adjusting the laser spot size, fluence, background gas pressure, target geometry and other processing parameters which affect the deposition pattern. Results from compositionally graded combinatorial library films of the ternary system Al 2 O 3 -HfO 2 -Y 2 O 3 are discussed

  13. Automatic optimization of a nuclear reactor reload using the algorithm Ant-Q

    International Nuclear Information System (INIS)

    Machado, Liana; Schirru, Roberto

    2002-01-01

    The nuclear fuel reload optimization is a NP-Complete combinatorial optimization problem. For decades this problem was solved using an expert's knowledge. From the eighties, however there have been efforts to automatic fuel reload and the more recent ones show the Genetic Algorithm's (GA) efficiency on this problem. Following this trend, our aim is to optimization nuclear fuel reload using Ant-Q, artificial theory based algorithms. Ant-Q's results on the Traveling salesman Problem, which is conceptuality similar to fuel reload, are better than GA's. Ant-Q was tested in real application on the cycle 7 reload of Angra I. Comparing Ant-Q result with the GA's, it can be verified that, even without a local heuristics, the former algorithm, as it superiority comparing the GA in Angra I show. Is a valid technique to solve the nuclear fuel reload problem. (author)

  14. Two is better than one; toward a rational design of combinatorial therapy.

    Science.gov (United States)

    Chen, Sheng-Hong; Lahav, Galit

    2016-12-01

    Drug combination is an appealing strategy for combating the heterogeneity of tumors and evolution of drug resistance. However, the rationale underlying combinatorial therapy is often not well established due to lack of understandings of the specific pathways responding to the drugs, and their temporal dynamics following each treatment. Here we present several emerging trends in harnessing properties of biological systems for the optimal design of drug combinations, including the type of drugs, specific concentration, sequence of addition and the temporal schedule of treatments. We highlight recent studies showing different approaches for efficient design of drug combinations including single-cell signaling dynamics, adaption and pathway crosstalk. Finally, we discuss novel and feasible approaches that can facilitate the optimal design of combinatorial therapy. Copyright © 2016 Elsevier Ltd. All rights reserved.

  15. Quantum fields and processes a combinatorial approach

    CERN Document Server

    Gough, John

    2018-01-01

    Wick ordering of creation and annihilation operators is of fundamental importance for computing averages and correlations in quantum field theory and, by extension, in the Hudson-Parthasarathy theory of quantum stochastic processes, quantum mechanics, stochastic processes, and probability. This book develops the unified combinatorial framework behind these examples, starting with the simplest mathematically, and working up to the Fock space setting for quantum fields. Emphasizing ideas from combinatorics such as the role of lattice of partitions for multiple stochastic integrals by Wallstrom-Rota and combinatorial species by Joyal, it presents insights coming from quantum probability. It also introduces a 'field calculus' which acts as a succinct alternative to standard Feynman diagrams and formulates quantum field theory (cumulant moments, Dyson-Schwinger equation, tree expansions, 1-particle irreducibility) in this language. Featuring many worked examples, the book is aimed at mathematical physicists, quant...

  16. Quantum fields and processes a combinatorial approach

    CERN Document Server

    Gough, John

    2018-01-01

    Wick ordering of creation and annihilation operators is of fundamental importance for computing averages and correlations in quantum field theory and, by extension, in the Hudson–Parthasarathy theory of quantum stochastic processes, quantum mechanics, stochastic processes, and probability. This book develops the unified combinatorial framework behind these examples, starting with the simplest mathematically, and working up to the Fock space setting for quantum fields. Emphasizing ideas from combinatorics such as the role of lattice of partitions for multiple stochastic integrals by Wallstrom–Rota and combinatorial species by Joyal, it presents insights coming from quantum probability. It also introduces a 'field calculus' which acts as a succinct alternative to standard Feynman diagrams and formulates quantum field theory (cumulant moments, Dyson–Schwinger equation, tree expansions, 1-particle irreducibility) in this language. Featuring many worked examples, the book is aimed at mathematical physicists,...

  17. Three Syntactic Theories for Combinatory Graph Reduction

    DEFF Research Database (Denmark)

    Danvy, Olivier; Zerny, Ian

    2011-01-01

    in a third syntactic theory. The structure of the store-based abstract machine corresponding to this third syntactic theory oincides with that of Turner's original reduction machine. The three syntactic theories presented here The three syntactic heories presented here therefore have the following......We present a purely syntactic theory of graph reduction for the canonical combinators S, K, and I, where graph vertices are represented with evaluation contexts and let expressions. We express this syntactic theory as a reduction semantics, which we refocus into the first storeless abstract machine...... for combinatory graph reduction, which we refunctionalize into the first storeless natural semantics for combinatory graph reduction.We then factor out the introduction of let expressions to denote as many graph vertices as possible upfront instead of on demand, resulting in a second syntactic theory, this one...

  18. Three Syntactic Theories for Combinatory Graph Reduction

    DEFF Research Database (Denmark)

    Danvy, Olivier; Zerny, Ian

    2013-01-01

    , as a store-based reduction semantics of combinatory term graphs. We then refocus this store-based reduction semantics into a store-based abstract machine. The architecture of this store-based abstract machine coincides with that of Turner's original reduction machine. The three syntactic theories presented......We present a purely syntactic theory of graph reduction for the canonical combinators S, K, and I, where graph vertices are represented with evaluation contexts and let expressions. We express this rst syntactic theory as a storeless reduction semantics of combinatory terms. We then factor out...... the introduction of let expressions to denote as many graph vertices as possible upfront instead of on demand . The factored terms can be interpreted as term graphs in the sense of Barendregt et al. We express this second syntactic theory, which we prove equivalent to the rst, as a storeless reduction semantics...

  19. DNA-Encoded Dynamic Combinatorial Chemical Libraries.

    Science.gov (United States)

    Reddavide, Francesco V; Lin, Weilin; Lehnert, Sarah; Zhang, Yixin

    2015-06-26

    Dynamic combinatorial chemistry (DCC) explores the thermodynamic equilibrium of reversible reactions. Its application in the discovery of protein binders is largely limited by difficulties in the analysis of complex reaction mixtures. DNA-encoded chemical library (DECL) technology allows the selection of binders from a mixture of up to billions of different compounds; however, experimental results often show low a signal-to-noise ratio and poor correlation between enrichment factor and binding affinity. Herein we describe the design and application of DNA-encoded dynamic combinatorial chemical libraries (EDCCLs). Our experiments have shown that the EDCCL approach can be used not only to convert monovalent binders into high-affinity bivalent binders, but also to cause remarkably enhanced enrichment of potent bivalent binders by driving their in situ synthesis. We also demonstrate the application of EDCCLs in DNA-templated chemical reactions. © 2015 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

  20. Combinatorial Cis-regulation in Saccharomyces Species

    Directory of Open Access Journals (Sweden)

    Aaron T. Spivak

    2016-03-01

    Full Text Available Transcriptional control of gene expression requires interactions between the cis-regulatory elements (CREs controlling gene promoters. We developed a sensitive computational method to identify CRE combinations with conserved spacing that does not require genome alignments. When applied to seven sensu stricto and sensu lato Saccharomyces species, 80% of the predicted interactions displayed some evidence of combinatorial transcriptional behavior in several existing datasets including: (1 chromatin immunoprecipitation data for colocalization of transcription factors, (2 gene expression data for coexpression of predicted regulatory targets, and (3 gene ontology databases for common pathway membership of predicted regulatory targets. We tested several predicted CRE interactions with chromatin immunoprecipitation experiments in a wild-type strain and strains in which a predicted cofactor was deleted. Our experiments confirmed that transcription factor (TF occupancy at the promoters of the CRE combination target genes depends on the predicted cofactor while occupancy of other promoters is independent of the predicted cofactor. Our method has the additional advantage of identifying regulatory differences between species. By analyzing the S. cerevisiae and S. bayanus genomes, we identified differences in combinatorial cis-regulation between the species and showed that the predicted changes in gene regulation explain several of the species-specific differences seen in gene expression datasets. In some instances, the same CRE combinations appear to regulate genes involved in distinct biological processes in the two different species. The results of this research demonstrate that (1 combinatorial cis-regulation can be inferred by multi-genome analysis and (2 combinatorial cis-regulation can explain differences in gene expression between species.

  1. The Combinatorial Trace Method in Action

    Science.gov (United States)

    Krebs, Mike; Martinez, Natalie C.

    2013-01-01

    On any finite graph, the number of closed walks of length k is equal to the sum of the kth powers of the eigenvalues of any adjacency matrix. This simple observation is the basis for the combinatorial trace method, wherein we attempt to count (or bound) the number of closed walks of a given length so as to obtain information about the graph's…

  2. Quantum annealing for combinatorial clustering

    Science.gov (United States)

    Kumar, Vaibhaw; Bass, Gideon; Tomlin, Casey; Dulny, Joseph

    2018-02-01

    Clustering is a powerful machine learning technique that groups "similar" data points based on their characteristics. Many clustering algorithms work by approximating the minimization of an objective function, namely the sum of within-the-cluster distances between points. The straightforward approach involves examining all the possible assignments of points to each of the clusters. This approach guarantees the solution will be a global minimum; however, the number of possible assignments scales quickly with the number of data points and becomes computationally intractable even for very small datasets. In order to circumvent this issue, cost function minima are found using popular local search-based heuristic approaches such as k-means and hierarchical clustering. Due to their greedy nature, such techniques do not guarantee that a global minimum will be found and can lead to sub-optimal clustering assignments. Other classes of global search-based techniques, such as simulated annealing, tabu search, and genetic algorithms, may offer better quality results but can be too time-consuming to implement. In this work, we describe how quantum annealing can be used to carry out clustering. We map the clustering objective to a quadratic binary optimization problem and discuss two clustering algorithms which are then implemented on commercially available quantum annealing hardware, as well as on a purely classical solver "qbsolv." The first algorithm assigns N data points to K clusters, and the second one can be used to perform binary clustering in a hierarchical manner. We present our results in the form of benchmarks against well-known k-means clustering and discuss the advantages and disadvantages of the proposed techniques.

  3. Energetic optimization of the chilled water systems operation at hotels

    Directory of Open Access Journals (Sweden)

    Reineris Montero Laurencio

    2015-12-01

    Full Text Available The hotel exploitation, while continuing to satisfy the customers, needs to decrease the requests of electric power as the principal energy carrier. Solving issues regarding the occupation of a hotel integrally, taking the air conditioning as center of attention, which demands the bigger consumptions of electricity, results in a complex task. To solve this issue, a procedure was implemented to optimize the operation of the water-chilled systems. The procedure integrates an energy model with a strategy of low occupation following energetic criteria based on combinatorial-evolutionary criteria. To classify the information, the formulation of the tasks and the synthesis of the solutions, a methodology of analysis and synthesis of engineering is used. The energetic model considers the variability of the local climatology and the occupation of the selected rooms, and includes: the thermal model of the building obtained by means of artificial neural networks, the hydraulic model and the model of the compression work. These elements allow to find the variable of decision occupation, performing intermediate calculations to obtain the velocity of rotation in the centrifugal pump and the output temperature of the cooler water, minimizing the requirements of electric power in the water-chilled systems. To evaluate the states of the system, a combinatorial optimization is used through the following methods: simple exhaustive, stepped exhaustive or genetic algorithm depending on the quantity of variants of occupation. All calculation tasks and algorithms of the procedure were automated through a computer application.

  4. Solving rational expectations models using Excel

    DEFF Research Database (Denmark)

    Strulik, Holger

    2004-01-01

    Problems of discrete time optimal control can be solved using backward iteration and Microsoft Excel. The author explains the method in general and shows how the basic models of neoclassical growth and real business cycles are solved......Problems of discrete time optimal control can be solved using backward iteration and Microsoft Excel. The author explains the method in general and shows how the basic models of neoclassical growth and real business cycles are solved...

  5. Ant Colony Optimization for Markowitz Mean-Variance Portfolio Model

    Science.gov (United States)

    Deng, Guang-Feng; Lin, Woo-Tsong

    This work presents Ant Colony Optimization (ACO), which was initially developed to be a meta-heuristic for combinatorial optimization, for solving the cardinality constraints Markowitz mean-variance portfolio model (nonlinear mixed quadratic programming problem). To our knowledge, an efficient algorithmic solution for this problem has not been proposed until now. Using heuristic algorithms in this case is imperative. Numerical solutions are obtained for five analyses of weekly price data for the following indices for the period March, 1992 to September, 1997: Hang Seng 31 in Hong Kong, DAX 100 in Germany, FTSE 100 in UK, S&P 100 in USA and Nikkei 225 in Japan. The test results indicate that the ACO is much more robust and effective than Particle swarm optimization (PSO), especially for low-risk investment portfolios.

  6. MIFT: GIFT Combinatorial Geometry Input to VCS Code

    Science.gov (United States)

    1977-03-01

    r-w w-^ H ^ß0318is CQ BRL °RCUMr REPORT NO. 1967 —-S: ... MIFT: GIFT COMBINATORIAL GEOMETRY INPUT TO VCS CODE Albert E...TITLE (and Subtitle) MIFT: GIFT Combinatorial Geometry Input to VCS Code S. TYPE OF REPORT & PERIOD COVERED FINAL 6. PERFORMING ORG. REPORT NUMBER...Vehicle Code System (VCS) called MORSE was modified to accept the GIFT combinatorial geometry package. GIFT , as opposed to the geometry package

  7. Use of combinatorial chemistry to speed drug discovery.

    Science.gov (United States)

    Rádl, S

    1998-10-01

    IBC's International Conference on Integrating Combinatorial Chemistry into the Discovery Pipeline was held September 14-15, 1998. The program started with a pre-conference workshop on High-Throughput Compound Characterization and Purification. The agenda of the main conference was divided into sessions of Synthesis, Automation and Unique Chemistries; Integrating Combinatorial Chemistry, Medicinal Chemistry and Screening; Combinatorial Chemistry Applications for Drug Discovery; and Information and Data Management. This meeting was an excellent opportunity to see how big pharma, biotech and service companies are addressing the current bottlenecks in combinatorial chemistry to speed drug discovery. (c) 1998 Prous Science. All rights reserved.

  8. Advanced Aqueous Phase Catalyst Development using Combinatorial Methods, Phase II

    Data.gov (United States)

    National Aeronautics and Space Administration — Combinatorial methods are proposed to develop advanced Aqueous Oxidation Catalysts (AOCs) with the capability to mineralize organic contaminants present in effluents...

  9. Quantum particle swarm approaches applied to combinatorial problems

    Energy Technology Data Exchange (ETDEWEB)

    Nicolau, Andressa dos S.; Schirru, Roberto; Lima, Alan M.M. de, E-mail: andressa@lmp.ufrj.br [Universidade Federal do Rio de Janeiro (UFRJ), RJ (Brazil). Programa de Engenharia Nuclear

    2017-07-01

    Quantum Particle Swarm Optimization (QPSO) is a global convergence algorithm that combines the classical PSO philosophy and quantum mechanics to improve performance of PSO. Different from PSO it only has the 'measurement' of the position equation for all particles. The process of 'measurement' in quantum mechanics, obey classic laws while the particle itself follows the quantum rules. QPSO works like PSO in search ability but has fewer parameters control. In order to improve the QPSO performance, some strategies have been proposed in the literature. Weighted QPSO (WQPSO) is a version of QPSO, where weight parameter is insert in the calculation of the balance between the global and local searching of the algorithm. It has been shown to perform well in finding the optimal solutions for many optimization problems. In this article random confinement was introduced in WQPSO. The WQPSO with random confinement was tested in two combinatorial problems. First, we execute the model on Travelling Salesman Problem (TSP) to find the parameters' values resulting in good solutions in general. Finally, the model was tested on Nuclear Reactor Reload Problem, and the performance was compared with QPSO standard. (author)

  10. Quantum particle swarm approaches applied to combinatorial problems

    International Nuclear Information System (INIS)

    Nicolau, Andressa dos S.; Schirru, Roberto; Lima, Alan M.M. de

    2017-01-01

    Quantum Particle Swarm Optimization (QPSO) is a global convergence algorithm that combines the classical PSO philosophy and quantum mechanics to improve performance of PSO. Different from PSO it only has the 'measurement' of the position equation for all particles. The process of 'measurement' in quantum mechanics, obey classic laws while the particle itself follows the quantum rules. QPSO works like PSO in search ability but has fewer parameters control. In order to improve the QPSO performance, some strategies have been proposed in the literature. Weighted QPSO (WQPSO) is a version of QPSO, where weight parameter is insert in the calculation of the balance between the global and local searching of the algorithm. It has been shown to perform well in finding the optimal solutions for many optimization problems. In this article random confinement was introduced in WQPSO. The WQPSO with random confinement was tested in two combinatorial problems. First, we execute the model on Travelling Salesman Problem (TSP) to find the parameters' values resulting in good solutions in general. Finally, the model was tested on Nuclear Reactor Reload Problem, and the performance was compared with QPSO standard. (author)

  11. Synthesis of new water-soluble metal-binding polymers: Combinatorial chemistry approach. 1998 annual progress report

    International Nuclear Information System (INIS)

    Kurth, M.J.; Miller, R.B.; Sawan, S.; Smith, B.F.

    1998-01-01

    '(1) Develop rapid discovery and optimization approaches to new water-soluble chelating polymers for use in Polymer Filtration (PF) systems, and (2) evaluate the concept of using water and organic soluble polymers as new solid supports for combinatorial synthesis. Polymer Filtration (PF), which uses water-soluble metal-binding polymers to sequester metal ions in dilute solution with ultrafiltration (UF) to separate the polymers, is a new technology to selectively remove or recover hazardous and valuable metal ions. Future directions in PF must include rapid development, testing, and characterization of new metal-binding polymers. Thus, the authors are building upon and adapting the combinatorial chemistry approach developed for rapid molecule generation for the drug industry to the rapid development of new chelating polymers. The authors have focused on four areas including the development of: (1) synthetic procedures, (2) small ultrafiltration equipment compatible with organic- and aqueous-based combinatorial synthesis, (3) rapid assay techniques, and (4) polymer characterization techniques.'

  12. 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.

  13. 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.

  14. Effects of Suboptimal Bidding in Combinatorial Auctions

    Science.gov (United States)

    Schneider, Stefan; Shabalin, Pasha; Bichler, Martin

    Though the VCG auction assumes a central place in the mechanism design literature, there are a number of reasons for favoring iterative combinatorial auction designs. Several promising ascending auction formats have been developed throughout the past few years based on primal-dual and subgradient algorithms and linear programming theory. Prices are interpreted as a feasible dual solution and the provisional allocation is interpreted as a feasible primal solution. iBundle( 3) (Parkes and Ungar 2000), dVSV (de Vries et al. 2007) and the Ascending Proxy auction (Ausubel and Milgrom 2002) result in VCG payoffs when the coalitional value function satisfies the buyer submodularity condition and bidders bid straightforward, which is an expost Nash equilibrium in that case. iBEA and CreditDebit auctions (Mishra and Parkes 2007) do not even require the buyer submodularity condition and achieve the same properties for general valuations. In many situations, however, one cannot assume bidders to bid straightforward and it is not clear from the theory how these non-linear personalized price auctions (NLPPAs) perform in this case. Robustness of auctions with respect to different bidding behavior is therefore a critical issue for any application. We have conducted a large number of computational experiments to analyze the performance of NLPPA designs with respect to different bidding strategies and different valuation models. We compare the results of NLPPAs to those of the VCG auction and those of iterative combinatorial auctions with approximate linear prices, such as ALPS (Bichler et al. 2009) and the Combinatorial Clock auction (Porter et al. 2003).

  15. A Combinatorial Benders’ Cuts Algorithm for the Local Container Drayage Problem

    Directory of Open Access Journals (Sweden)

    Zhaojie Xue

    2015-01-01

    Full Text Available This paper examines the local container drayage problem under a special operation mode in which tractors and trailers can be separated; that is, tractors can be assigned to a new task at another location while trailers with containers are waiting for packing or unpacking. Meanwhile, the strategy of sharing empty containers between different customers is also considered to improve the efficiency and lower the operation cost. The problem is formulated as a vehicle routing and scheduling problem with temporal constraints. We adopt combinatorial benders’ cuts algorithm to solve this problem. Numerical experiments are performed on a group of randomly generated instances to test the performance of the proposed algorithm.

  16. Method and apparatus for combinatorial chemistry

    Science.gov (United States)

    Foote, Robert S [Oak Ridge, TN

    2012-06-05

    A method and apparatus are provided for performing light-directed reactions in spatially addressable channels within a plurality of channels. One aspect of the invention employs photoactivatable reagents in solutions disposed into spatially addressable flow streams to control the parallel synthesis of molecules immobilized within the channels. The reagents may be photoactivated within a subset of channels at the site of immobilized substrate molecules or at a light-addressable site upstream from the substrate molecules. The method and apparatus of the invention find particularly utility in the synthesis of biopolymer arrays, e.g., oligonucleotides, peptides and carbohydrates, and in the combinatorial synthesis of small molecule arrays for drug discovery.

  17. Development of automatic combinatorial system for synthesis of nanoparticles using microreactors

    Energy Technology Data Exchange (ETDEWEB)

    Watanabe, Kosuke; Maeda, Hideaki [Interdisciplinary Graduate School of Engineering Sciences, Kyushu University, 6-1 Kasuga-koen, Kasuga, Fukuoka, 816-8580 (Japan); Orimoto, Yuuichi; Yamashita, Kenichi; Uehara, Masato; Nakamura, Hiroyuki [Measurement Solution Research Center, National Institute of Advanced Industrial Science and Technology (AIST), 807-1, Shuku, Tosu, Saga, 841-0052 (Japan); Furuya, Takeshi, E-mail: maeda-h@aist.go.jp [Nanosystem Research Institute, National Institute of Advanced Industrial Science and Technology (AIST), Tsukuba, Ibaraki, 305-8565 (Japan)

    2011-10-29

    In this study, automatic system for combinatorial synthesis of nanoparticles (NPs) was developed and optimization of reaction parameter for NPs synthesis was performed. Microreactor was employed for kinetic control constantly. Programmable equipments were employed for additional speed up and used a microreactor. Six reaction condition parameters were systematically combined to produce CdSe synthesis condition sets. Reaction conditions of 3404 experimental sets were synthesized and characterized in 1 month. As a result of some multivariate analyses using the numerous and complicated data, we found as follows: 1) neural network is an effective method to analyze data from combinatorial synthesis, 2) weighting evaluation method was effective to find the condition for balanced NP properties.

  18. Evaluation of different initial solution algorithms to be used in the heuristics optimization to solve the energy resource scheduling in smart grids

    DEFF Research Database (Denmark)

    Sousa, Tiago; Morais, Hugo; Castro, Rui

    2016-01-01

    vehicles. The proposed algorithms proved to present results very close to the optimal with a small difference between 0.1%. A deterministic technique is used as comparison and it took around 26 h to obtain the optimal one. On the other hand, the simulated annealing was able of obtaining results around 1...

  19. On Definitions and Existence of Combinatorial Entropy of 2d Fields

    DEFF Research Database (Denmark)

    Forchhammer, Søren Otto; Shtarkov, Yuri; Justesen, Jørn

    1998-01-01

    Different definitions of combinatorial entropy is presented and conditions for their existence examined.......Different definitions of combinatorial entropy is presented and conditions for their existence examined....

  20. Combinatorial Quantum Field Theory and Gluing Formula for Determinants

    NARCIS (Netherlands)

    Reshetikhin, N.; Vertman, B.

    2015-01-01

    We define the combinatorial Dirichlet-to-Neumann operator and establish a gluing formula for determinants of discrete Laplacians using a combinatorial Gaussian quantum field theory. In case of a diagonal inner product on cochains we provide an explicit local expression for the discrete

  1. Combinatorial Libraries of Bis-Heterocyclic Compounds with Skeletal Diversity

    Science.gov (United States)

    Soural, Miroslav; Bouillon, Isabelle; Krchňák, Viktor

    2009-01-01

    Combinatorial solid-phase synthesis of bis-heterocyclic compounds, characterized by the presence of two heterocyclic cores connected by a spacer of variable length/structure, provided structurally heterogeneous libraries with skeletal diversity. Both heterocyclic rings were assembled on resin in a combinatorial fashion. PMID:18811208

  2. Combinatorial Libraries of Bis-Heterocyclic Compounds with Skeletal Diversity

    OpenAIRE

    Soural, Miroslav; Bouillon, Isabelle; Krchňák, Viktor

    2008-01-01

    Combinatorial solid-phase synthesis of bis-heterocyclic compounds, characterized by the presence of two heterocyclic cores connected by a spacer of variable length/structure, provided structurally heterogeneous libraries with skeletal diversity. Both heterocyclic rings were assembled on resin in a combinatorial fashion.

  3. Combinatorial identities for tenth order mock theta functions

    Indian Academy of Sciences (India)

    44

    which lead us to one 4-way and one 3-way combinatorial identity. ... mock theta functions, partition identities and different combinatorial parameters, see for ... 3. Example 1.1. There are twelve (n + 1)–color partitions of 2: 21, 21 + 01, 11 + 11, ...

  4. Design and Optimization of Capacitated Supply Chain Networks Including Quality Measures

    Directory of Open Access Journals (Sweden)

    Krystel K. Castillo-Villar

    2014-01-01

    Full Text Available This paper presents (1 a novel capacitated model for supply chain network design which considers manufacturing, distribution, and quality costs (named SCND-COQ model and (2 five combinatorial optimization methods, based on nonlinear optimization, heuristic, and metaheuristic approaches, which are used to solve realistic instances of practical size. The SCND-COQ model is a mixed-integer nonlinear problem which can be used at a strategic planning level to design a supply chain network that maximizes the total profit subject to meeting an overall quality level of the final product at minimum costs. The SCND-COQ model computes the quality-related costs for the whole supply chain network considering the interdependencies among business entities. The effectiveness of the proposed solution approaches is shown using numerical experiments. These methods allow solving more realistic (capacitated supply chain network design problems including quality-related costs (inspections, rework, opportunity costs, and others within a reasonable computational time.

  5. Automated Implanter Endstation for Combinatorial Materials Science with Ion Beams

    International Nuclear Information System (INIS)

    Grosshans, I.; Karl, H.; Stritzker, B.

    2003-01-01

    The discovery, understanding and optimization of new complex functional materials requires combinatorial synthesis techniques and fast screening instrumentation for the measurement of the samples. In this contribution the synthesis of buried II-VI compound semiconductor nanocrystals by ion-implantation in SiO2 on silicon will be presented. For that we constructed a computer controlled implanter target end station, in which a 4-inch wafer can be implanted with a lateral pattern of distinct dose, composition or energy combinations. The chemical reaction of the constituents is initiated either during the implantation process or ex-situ by a rapid thermal process, where a reactive atmosphere can be applied. The resulting optical photoluminescence properties of the individual fields of the pattern can then be screened in rapid succession in an optical cryostat into which the whole wafer is mounted and cooled down. In this way, complex interdependences of the physical parameters can be studied on a single wafer and the technically relevant properties optimized

  6. Exact model reduction of combinatorial reaction networks

    Directory of Open Access Journals (Sweden)

    Fey Dirk

    2008-08-01

    Full Text Available Abstract Background Receptors and scaffold proteins usually possess a high number of distinct binding domains inducing the formation of large multiprotein signaling complexes. Due to combinatorial reasons the number of distinguishable species grows exponentially with the number of binding domains and can easily reach several millions. Even by including only a limited number of components and binding domains the resulting models are very large and hardly manageable. A novel model reduction technique allows the significant reduction and modularization of these models. Results We introduce methods that extend and complete the already introduced approach. For instance, we provide techniques to handle the formation of multi-scaffold complexes as well as receptor dimerization. Furthermore, we discuss a new modeling approach that allows the direct generation of exactly reduced model structures. The developed methods are used to reduce a model of EGF and insulin receptor crosstalk comprising 5,182 ordinary differential equations (ODEs to a model with 87 ODEs. Conclusion The methods, presented in this contribution, significantly enhance the available methods to exactly reduce models of combinatorial reaction networks.

  7. Heterogenous phase as a mean in combinatorial chemistry

    International Nuclear Information System (INIS)

    Abdel-Hamid, S.G.

    2007-01-01

    Combinatorial chemistry is a rapid and inexpensive technique for the synthesis of hundreds of thousands of organic compounds of potential medicinal activity. In the past few decades a large number of combinatorial libraries have been constructed, and significantly supplement the chemical diversity of the traditional collections of the potentially active medicinal compounds. Solid phase synthesis was used to enrich the combinatorial chemistry libraries, through the use of solid supports (resins) and their modified forms. Most of the new libraries of compounds appeared recently, were synthesized by the use of solid-phase. Solid-phase combinatorial chemistry (SPCC) is now considered as an outstanding branch in pharmaceutical chemistry research and used extensively as a tool for drug discovery within the context of high-throughput chemical synthesis. The best pure libraries synthesized by the use of solid phase combinatorial chemistry (SPCC) may well be those of intermediate complexity that are free of artifact-causing nuisance compounds. (author)

  8. Fast globally optimal segmentation of 3D prostate MRI with axial symmetry prior.

    Science.gov (United States)

    Qiu, Wu; Yuan, Jing; Ukwatta, Eranga; Sun, Yue; Rajchl, Martin; Fenster, Aaron

    2013-01-01

    We propose a novel global optimization approach to segmenting a given 3D prostate T2w magnetic resonance (MR) image, which enforces the inherent axial symmetry of the prostate shape and simultaneously performs a sequence of 2D axial slice-wise segmentations with a global 3D coherence prior. We show that the proposed challenging combinatorial optimization problem can be solved globally and exactly by means of convex relaxation. With this regard, we introduce a novel coupled continuous max-flow model, which is dual to the studied convex relaxed optimization formulation and leads to an efficient multiplier augmented algorithm based on the modern convex optimization theory. Moreover, the new continuous max-flow based algorithm was implemented on GPUs to achieve a substantial improvement in computation. Experimental results using public and in-house datasets demonstrate great advantages of the proposed method in terms of both accuracy and efficiency.

  9. Group Elevator Peak Scheduling Based on Robust Optimization Model

    Directory of Open Access Journals (Sweden)

    ZHANG, J.

    2013-08-01

    Full Text Available Scheduling of Elevator Group Control System (EGCS is a typical combinatorial optimization problem. Uncertain group scheduling under peak traffic flows has become a research focus and difficulty recently. RO (Robust Optimization method is a novel and effective way to deal with uncertain scheduling problem. In this paper, a peak scheduling method based on RO model for multi-elevator system is proposed. The method is immune to the uncertainty of peak traffic flows, optimal scheduling is realized without getting exact numbers of each calling floor's waiting passengers. Specifically, energy-saving oriented multi-objective scheduling price is proposed, RO uncertain peak scheduling model is built to minimize the price. Because RO uncertain model could not be solved directly, RO uncertain model is transformed to RO certain model by elevator scheduling robust counterparts. Because solution space of elevator scheduling is enormous, to solve RO certain model in short time, ant colony solving algorithm for elevator scheduling is proposed. Based on the algorithm, optimal scheduling solutions are found quickly, and group elevators are scheduled according to the solutions. Simulation results show the method could improve scheduling performances effectively in peak pattern. Group elevators' efficient operation is realized by the RO scheduling method.

  10. Probabilistic Analysis of Combinatorial Optimization Problems on Hypergraph Matchings

    Science.gov (United States)

    2012-02-01

    cliques, !.G/ < k. Let B D f1; : : : ; kg be the index set of partites in G, V D S b2B Vb , and BS denote the set of partites that have a node in S : BS D...CS D [ b2BS CS;b; where BS D B n BS , and CS;b Vb is given by CS;b D [ s2S .Vb \\N.s//; with N.s/ being the set of nodes adjacent to node s. At the...to a partite Vb in G: Zt D [ b2B Zt;b; t D 1; : : : ; k: The sets Zt;b are represented by bitsets of size jVbj. Let Zt;b;i be the i -th bit in Zt;b

  11. Appreciative Problem Solving

    DEFF Research Database (Denmark)

    Hansen, David

    2012-01-01

    Many industrial production work systems have increased in complexity, and their new business model scompete on innovation, rather than low cost.At a medical device production facility committed to Lean Production, a research project was carried out to use Appreciative Inquiry to better engage...... employee strengths in continuou simprovements of the work system. The research question was: “How can Lean problem solving and Appreciative Inquiry be combined for optimized work system innovation?” The research project was carried out as a co-creation process with close cooperation between researcher...

  12. Simulated annealing algorithm for solving chambering student-case assignment problem

    Science.gov (United States)

    Ghazali, Saadiah; Abdul-Rahman, Syariza

    2015-12-01

    The problem related to project assignment problem is one of popular practical problem that appear nowadays. The challenge of solving the problem raise whenever the complexity related to preferences, the existence of real-world constraints and problem size increased. This study focuses on solving a chambering student-case assignment problem by using a simulated annealing algorithm where this problem is classified under project assignment problem. The project assignment problem is considered as hard combinatorial optimization problem and solving it using a metaheuristic approach is an advantage because it could return a good solution in a reasonable time. The problem of assigning chambering students to cases has never been addressed in the literature before. For the proposed problem, it is essential for law graduates to peruse in chambers before they are qualified to become legal counselor. Thus, assigning the chambering students to cases is a critically needed especially when involving many preferences. Hence, this study presents a preliminary study of the proposed project assignment problem. The objective of the study is to minimize the total completion time for all students in solving the given cases. This study employed a minimum cost greedy heuristic in order to construct a feasible initial solution. The search then is preceded with a simulated annealing algorithm for further improvement of solution quality. The analysis of the obtained result has shown that the proposed simulated annealing algorithm has greatly improved the solution constructed by the minimum cost greedy heuristic. Hence, this research has demonstrated the advantages of solving project assignment problem by using metaheuristic techniques.

  13. Asymmetric continuous-time neural networks without local traps for solving constraint satisfaction problems.

    Directory of Open Access Journals (Sweden)

    Botond Molnár

    Full Text Available There has been a long history of using neural networks for combinatorial optimization and constraint satisfaction problems. Symmetric Hopfield networks and similar approaches use steepest descent dynamics, and they always converge to the closest local minimum of the energy landscape. For finding global minima additional parameter-sensitive techniques are used, such as classical simulated annealing or the so-called chaotic simulated annealing, which induces chaotic dynamics by addition of extra terms to the energy landscape. Here we show that asymmetric continuous-time neural networks can solve constraint satisfaction problems without getting trapped in non-solution attractors. We concentrate on a model solving Boolean satisfiability (k-SAT, which is a quintessential NP-complete problem. There is a one-to-one correspondence between the stable fixed points of the neural network and the k-SAT solutions and we present numerical evidence that limit cycles may also be avoided by appropriately choosing the parameters of the model. This optimal parameter region is fairly independent of the size and hardness of instances, this way parameters can be chosen independently of the properties of problems and no tuning is required during the dynamical process. The model is similar to cellular neural networks already used in CNN computers. On an analog device solving a SAT problem would take a single operation: the connection weights are determined by the k-SAT instance and starting from any initial condition the system searches until finding a solution. In this new approach transient chaotic behavior appears as a natural consequence of optimization hardness and not as an externally induced effect.

  14. A Local and Global Search Combine Particle Swarm Optimization Algorithm for Job-Shop Scheduling to Minimize Makespan

    Directory of Open Access Journals (Sweden)

    Zhigang Lian

    2010-01-01

    Full Text Available The Job-shop scheduling problem (JSSP is a branch of production scheduling, which is among the hardest combinatorial optimization problems. Many different approaches have been applied to optimize JSSP, but for some JSSP even with moderate size cannot be solved to guarantee optimality. The original particle swarm optimization algorithm (OPSOA, generally, is used to solve continuous problems, and rarely to optimize discrete problems such as JSSP. In OPSOA, through research I find that it has a tendency to get stuck in a near optimal solution especially for middle and large size problems. The local and global search combine particle swarm optimization algorithm (LGSCPSOA is used to solve JSSP, where particle-updating mechanism benefits from the searching experience of one particle itself, the best of all particles in the swarm, and the best of particles in neighborhood population. The new coding method is used in LGSCPSOA to optimize JSSP, and it gets all sequences are feasible solutions. Three representative instances are made computational experiment, and simulation shows that the LGSCPSOA is efficacious for JSSP to minimize makespan.

  15. A Hybrid Genetic Algorithm with a Knowledge-Based Operator for Solving the Job Shop Scheduling Problems

    Directory of Open Access Journals (Sweden)

    Hamed Piroozfard

    2016-01-01

    Full Text Available Scheduling is considered as an important topic in production management and combinatorial optimization in which it ubiquitously exists in most of the real-world applications. The attempts of finding optimal or near optimal solutions for the job shop scheduling problems are deemed important, because they are characterized as highly complex and NP-hard problems. This paper describes the development of a hybrid genetic algorithm for solving the nonpreemptive job shop scheduling problems with the objective of minimizing makespan. In order to solve the presented problem more effectively, an operation-based representation was used to enable the construction of feasible schedules. In addition, a new knowledge-based operator was designed based on the problem’s characteristics in order to use machines’ idle times to improve the solution quality, and it was developed in the context of function evaluation. A machine based precedence preserving order-based crossover was proposed to generate the offspring. Furthermore, a simulated annealing based neighborhood search technique was used to improve the local exploitation ability of the algorithm and to increase its population diversity. In order to prove the efficiency and effectiveness of the proposed algorithm, numerous benchmarked instances were collected from the Operations Research Library. Computational results of the proposed hybrid genetic algorithm demonstrate its effectiveness.

  16. Combinatorial Pharmacophore-Based 3D-QSAR Analysis and Virtual Screening of FGFR1 Inhibitors

    Directory of Open Access Journals (Sweden)

    Nannan Zhou

    2015-06-01

    Full Text Available The fibroblast growth factor/fibroblast growth factor receptor (FGF/FGFR signaling pathway plays crucial roles in cell proliferation, angiogenesis, migration, and survival. Aberration in FGFRs correlates with several malignancies and disorders. FGFRs have proved to be attractive targets for therapeutic intervention in cancer, and it is of high interest to find FGFR inhibitors with novel scaffolds. In this study, a combinatorial three-dimensional quantitative structure-activity relationship (3D-QSAR model was developed based on previously reported FGFR1 inhibitors with diverse structural skeletons. This model was evaluated for its prediction performance on a diverse test set containing 232 FGFR inhibitors, and it yielded a SD value of 0.75 pIC50 units from measured inhibition affinities and a Pearson’s correlation coefficient R2 of 0.53. This result suggests that the combinatorial 3D-QSAR model could be used to search for new FGFR1 hit structures and predict their potential activity. To further evaluate the performance of the model, a decoy set validation was used to measure the efficiency of the model by calculating EF (enrichment factor. Based on the combinatorial pharmacophore model, a virtual screening against SPECS database was performed. Nineteen novel active compounds were successfully identified, which provide new chemical starting points for further structural optimization of FGFR1 inhibitors.

  17. Combinatorial programming of human neuronal progenitors using magnetically-guided stoichiometric mRNA delivery.

    Science.gov (United States)

    Azimi, Sayyed M; Sheridan, Steven D; Ghannad-Rezaie, Mostafa; Eimon, Peter M; Yanik, Mehmet Fatih

    2018-05-01

    Identification of optimal transcription-factor expression patterns to direct cellular differentiation along a desired pathway presents significant challenges. We demonstrate massively combinatorial screening of temporally-varying mRNA transcription factors to direct differentiation of neural progenitor cells using a dynamically-reconfigurable magnetically-guided spotting technology for localizing mRNA, enabling experiments on millimetre size spots. In addition, we present a time-interleaved delivery method that dramatically reduces fluctuations in the delivered transcription-factor copy-numbers per cell. We screened combinatorial and temporal delivery of a pool of midbrain-specific transcription factors to augment the generation of dopaminergic neurons. We show that the combinatorial delivery of LMX1A, FOXA2 and PITX3 is highly effective in generating dopaminergic neurons from midbrain progenitors. We show that LMX1A significantly increases TH -expression levels when delivered to neural progenitor cells either during proliferation or after induction of neural differentiation, while FOXA2 and PITX3 increase expression only when delivered prior to induction, demonstrating temporal dependence of factor addition. © 2018, Azimi et al.

  18. cDREM: inferring dynamic combinatorial gene regulation.

    Science.gov (United States)

    Wise, Aaron; Bar-Joseph, Ziv

    2015-04-01

    Genes are often combinatorially regulated by multiple transcription factors (TFs). Such combinatorial regulation plays an important role in development and facilitates the ability of cells to respond to different stresses. While a number of approaches have utilized sequence and ChIP-based datasets to study combinational regulation, these have often ignored the combinational logic and the dynamics associated with such regulation. Here we present cDREM, a new method for reconstructing dynamic models of combinatorial regulation. cDREM integrates time series gene expression data with (static) protein interaction data. The method is based on a hidden Markov model and utilizes the sparse group Lasso to identify small subsets of combinatorially active TFs, their time of activation, and the logical function they implement. We tested cDREM on yeast and human data sets. Using yeast we show that the predicted combinatorial sets agree with other high throughput genomic datasets and improve upon prior methods developed to infer combinatorial regulation. Applying cDREM to study human response to flu, we were able to identify several combinatorial TF sets, some of which were known to regulate immune response while others represent novel combinations of important TFs.

  19. Combinatorial nanomedicines for colon cancer therapy.

    Science.gov (United States)

    Anitha, A; Maya, S; Sivaram, Amal J; Mony, U; Jayakumar, R

    2016-01-01

    Colon cancer is one of the major causes of cancer deaths worldwide. Even after surgical resection and aggressive chemotherapy, 50% of colorectal carcinoma patients develop recurrent disease. Thus, the rationale of developing new therapeutic approaches to improve the current chemotherapeutic regimen would be highly recommended. There are reports on the effectiveness of combination chemotherapy in colon cancer and it has been practiced in clinics for long time. These approaches are associated with toxic side effects. Later, the drug delivery research had shown the potential of nanoencapsulation techniques and active targeting as an effective method to improve the effectiveness of chemotherapy with less toxicity. This current focus article provides a brief analysis of the ongoing research in the colon cancer area using the combinatorial nanomedicines and its outcome. © 2015 Wiley Periodicals, Inc.

  20. Identification and Interrogation of Combinatorial Histone Modifications

    Directory of Open Access Journals (Sweden)

    Kelly R Karch

    2013-12-01

    Full Text Available Histone proteins are dynamically modified to mediate a variety of cellular processes including gene transcription, DNA damage repair, and apoptosis. Regulation of these processes occurs through the recruitment of non-histone proteins to chromatin by specific combinations of histone post-translational modifications (PTMs. Mass spectrometry has emerged as an essential tool to discover and quantify histone PTMs both within and between samples in an unbiased manner. Developments in mass spectrometry that allow for characterization of large histone peptides or intact protein has made it possible to determine which modifications occur simultaneously on a single histone polypeptide. A variety of techniques from biochemistry, biophysics, and chemical biology have been employed to determine the biological relevance of discovered combinatorial codes. This review first describes advancements in the field of mass spectrometry that have facilitated histone PTM analysis and then covers notable approaches to probe the biological relevance of these modifications in their nucleosomal context.

  1. Combinatorial nuclear level-density model

    International Nuclear Information System (INIS)

    Uhrenholt, H.; Åberg, S.; Dobrowolski, A.; Døssing, Th.; Ichikawa, T.; Möller, P.

    2013-01-01

    A microscopic nuclear level-density model is presented. The model is a completely combinatorial (micro-canonical) model based on the folded-Yukawa single-particle potential and includes explicit treatment of pairing, rotational and vibrational states. The microscopic character of all states enables extraction of level-distribution functions with respect to pairing gaps, parity and angular momentum. The results of the model are compared to available experimental data: level spacings at neutron separation energy, data on total level-density functions from the Oslo method, cumulative level densities from low-lying discrete states, and data on parity ratios. Spherical and deformed nuclei follow basically different coupling schemes, and we focus on deformed nuclei

  2. Hospital daily outpatient visits forecasting using a combinatorial model based on ARIMA and SES models.

    Science.gov (United States)

    Luo, Li; Luo, Le; Zhang, Xinli; He, Xiaoli

    2017-07-10

    Accurate forecasting of hospital outpatient visits is beneficial for the reasonable planning and allocation of healthcare resource to meet the medical demands. In terms of the multiple attributes of daily outpatient visits, such as randomness, cyclicity and trend, time series methods, ARIMA, can be a good choice for outpatient visits forecasting. On the other hand, the hospital outpatient visits are also affected by the doctors' scheduling and the effects are not pure random. Thinking about the impure specialty, this paper presents a new forecasting model that takes cyclicity and the day of the week effect into consideration. We formulate a seasonal ARIMA (SARIMA) model on a daily time series and then a single exponential smoothing (SES) model on the day of the week time series, and finally establish a combinatorial model by modifying them. The models are applied to 1 year of daily visits data of urban outpatients in two internal medicine departments of a large hospital in Chengdu, for forecasting the daily outpatient visits about 1 week ahead. The proposed model is applied to forecast the cross-sectional data for 7 consecutive days of daily outpatient visits over an 8-weeks period based on 43 weeks of observation data during 1 year. The results show that the two single traditional models and the combinatorial model are simplicity of implementation and low computational intensiveness, whilst being appropriate for short-term forecast horizons. Furthermore, the combinatorial model can capture the comprehensive features of the time series data better. Combinatorial model can achieve better prediction performance than the single model, with lower residuals variance and small mean of residual errors which needs to be optimized deeply on the next research step.

  3. Automatic optimization of a nuclear reactor reload using the algorithm Ant-Q; A otimizacao automatica da recarga nuclear utilizando o algoritmo Ant-Q

    Energy Technology Data Exchange (ETDEWEB)

    Machado, Liana; Schirru, Roberto [Universidade Federal, Rio de Janeiro, RJ (Brazil). Coordenacao dos Programas de Pos-graduacao de Engenharia. Programa de Engenharia Nuclear

    2002-07-01

    The nuclear fuel reload optimization is a NP-Complete combinatorial optimization problem. For decades this problem was solved using an expert's knowledge. From the eighties, however there have been efforts to automatic fuel reload and the more recent ones show the Genetic Algorithm's (GA) efficiency on this problem. Following this trend, our aim is to optimization nuclear fuel reload using Ant-Q, artificial theory based algorithms. Ant-Q's results on the Traveling salesman Problem, which is conceptuality similar to fuel reload, are better than GA's. Ant-Q was tested in real application on the cycle 7 reload of Angra I. Comparing Ant-Q result with the GA's, it can be verified that, even without a local heuristics, the former algorithm, as it superiority comparing the GA in Angra I show. Is a valid technique to solve the nuclear fuel reload problem. (author)

  4. On the Cut-off Point for Combinatorial Group Testing

    DEFF Research Database (Denmark)

    Fischer, Paul; Klasner, N.; Wegener, I.

    1999-01-01

    is answered by 1 if Q contains at least one essential object and by 0 otherwise. In the statistical setting the objects are essential, independently of each other, with a given probability p combinatorial setting the number k ... group testing is equal to p* = 12(3 - 5), i.e., the strategy of testing each object individually minimizes the average number of queries iff p >= p* or n = 1. In the combinatorial setting the worst case number of queries is of interest. It has been conjectured that the cut-off point of combinatorial...

  5. Maximization of Tsallis entropy in the combinatorial formulation

    International Nuclear Information System (INIS)

    Suyari, Hiroki

    2010-01-01

    This paper presents the mathematical reformulation for maximization of Tsallis entropy S q in the combinatorial sense. More concretely, we generalize the original derivation of Maxwell-Boltzmann distribution law to Tsallis statistics by means of the corresponding generalized multinomial coefficient. Our results reveal that maximization of S 2-q under the usual expectation or S q under q-average using the escort expectation are naturally derived from the combinatorial formulations for Tsallis statistics with respective combinatorial dualities, that is, one for additive duality and the other for multiplicative duality.

  6. Combinatorial Approaches for the Identification of Brain Drug Delivery Targets

    Science.gov (United States)

    Stutz, Charles C.; Zhang, Xiaobin; Shusta, Eric V.

    2018-01-01

    The blood-brain barrier (BBB) represents a large obstacle for the treatment of central nervous system diseases. Targeting endogenous nutrient transporters that transcytose the BBB is one promising approach to selectively and noninvasively deliver a drug payload to the brain. The main limitations of the currently employed transcytosing receptors are their ubiquitous expression in the peripheral vasculature and the inherent low levels of transcytosis mediated by such systems. In this review, approaches designed to increase the repertoire of transcytosing receptors which can be targeted for the purpose of drug delivery are discussed. In particular, combinatorial protein libraries can be screened on BBB cells in vitro or in vivo to isolate targeting peptides or antibodies that can trigger transcytosis. Once these targeting reagents are discovered, the cognate BBB transcytosis system can be identified using techniques such as expression cloning or immunoprecipitation coupled with mass spectrometry. Continued technological advances in BBB genomics and proteomics, membrane protein manipulation, and in vitro BBB technology promise to further advance the capability to identify and optimize peptides and antibodies capable of mediating drug transport across the BBB. PMID:23789958

  7. Gradient-based optimization with B-splines on sparse grids for solving forward-dynamics simulations of three-dimensional, continuum-mechanical musculoskeletal system models.

    Science.gov (United States)

    Valentin, J; Sprenger, M; Pflüger, D; Röhrle, O

    2018-05-01

    Investigating the interplay between muscular activity and motion is the basis to improve our understanding of healthy or diseased musculoskeletal systems. To be able to analyze the musculoskeletal systems, computational models are used. Albeit some severe modeling assumptions, almost all existing musculoskeletal system simulations appeal to multibody simulation frameworks. Although continuum-mechanical musculoskeletal system models can compensate for some of these limitations, they are essentially not considered because of their computational complexity and cost. The proposed framework is the first activation-driven musculoskeletal system model, in which the exerted skeletal muscle forces are computed using 3-dimensional, continuum-mechanical skeletal muscle models and in which muscle activations are determined based on a constraint optimization problem. Numerical feasibility is achieved by computing sparse grid surrogates with hierarchical B-splines, and adaptive sparse grid refinement further reduces the computational effort. The choice of B-splines allows the use of all existing gradient-based optimization techniques without further numerical approximation. This paper demonstrates that the resulting surrogates have low relative errors (less than 0.76%) and can be used within forward simulations that are subject to constraint optimization. To demonstrate this, we set up several different test scenarios in which an upper limb model consisting of the elbow joint, the biceps and triceps brachii, and an external load is subjected to different optimization criteria. Even though this novel method has only been demonstrated for a 2-muscle system, it can easily be extended to musculoskeletal systems with 3 or more muscles. Copyright © 2018 John Wiley & Sons, Ltd.

  8. Material Mediation: Tools and Representations Supporting Collaborative Problem-Solving Discourse

    Science.gov (United States)

    Katic, Elvira K.; Hmelo-Silver, Cindy E.; Weber, Keith H.

    2009-01-01

    This study investigates how a variety of resources mediated collaborative problem solving for a group of preservice teachers. The participants in this study completed mathematical, combinatorial tasks and then watched a video of a sixth grader as he exhibited sophisticated reasoning to recognize the isomorphic structure of these problems. The…

  9. ACOustic: A Nature-Inspired Exploration Indicator for Ant Colony Optimization

    Directory of Open Access Journals (Sweden)

    Rafid Sagban

    2015-01-01

    Full Text Available A statistical machine learning indicator, ACOustic, is proposed to evaluate the exploration behavior in the iterations of ant colony optimization algorithms. This idea is inspired by the behavior of some parasites in their mimicry to the queens’ acoustics of their ant hosts. The parasites’ reaction results from their ability to indicate the state of penetration. The proposed indicator solves the problem of robustness that results from the difference of magnitudes in the distance’s matrix, especially when combinatorial optimization problems with rugged fitness landscape are applied. The performance of the proposed indicator is evaluated against the existing indicators in six variants of ant colony optimization algorithms. Instances for travelling salesman problem and quadratic assignment problem are used in the experimental evaluation. The analytical results showed that the proposed indicator is more informative and more robust.

  10. A Constraint Programming Model for Fast Optimal Stowage of Container Vessel Bays

    DEFF Research Database (Denmark)

    Delgado-Ortegon, Alberto; Jensen, Rune Møller; Janstrup, Kira

    2012-01-01

    Container vessel stowage planning is a hard combinatorial optimization problem with both high economic and environmental impact. We have developed an approach that often is able to generate near-optimal plans for large container vessels within a few minutes. It decomposes the problem into a master...... planning phase that distributes the containers to bay sections and a slot planning phase that assigns containers of each bay section to slots. In this paper, we focus on the slot planning phase of this approach and present a constraint programming and integer programming model for stowing a set...... of containers in a single bay section. This so-called slot planning problem is NP-hard and often involves stowing several hundred containers. Using state-of-the-art constraint solvers and modeling techniques, however, we were able to solve 90% of 236 real instances from our industrial collaborator to optimality...

  11. Implementation of a combinatorial cleavage and deprotection scheme

    DEFF Research Database (Denmark)

    Nielsen, John; Rasmussen, Palle H.

    1996-01-01

    Phthalhydrazide libraries are synthesized in solution from substituted hydrazines and phthalimides in several different library formats including single compounds, indexed sub-libraries and a full library. When carried out during solid-phase synthesis, this combinatorial cleavage and deprotection...

  12. ON 3-WAY COMBINATORIAL IDENTITIES A. K. AGARWAL MEGHA ...

    Indian Academy of Sciences (India)

    36

    ∗Corresponding author: Department of Basic and Applied Sciences, University College of Engineering,. Punjabi ... In this paper we provide combinatorial meanings to two generalized basic ... 2010 Mathematics Subject Classification. 05A15 ...

  13. Olefin Metathesis in Peptidomimetics, Dynamic Combinatorial Chemistry, and Molecular Imprinting

    National Research Council Canada - National Science Library

    Low, Tammy K

    2006-01-01

    .... Our research goals consisted of employing olefin metathesis in the synthesis of peptidomimetics, and studying the feasibility of this method in dynamic combinatorial chemistry and molecular imprinting of nerve agents...

  14. Dynamic combinatorial libraries: from exploring molecular recognition to systems chemistry.

    Science.gov (United States)

    Li, Jianwei; Nowak, Piotr; Otto, Sijbren

    2013-06-26

    Dynamic combinatorial chemistry (DCC) is a subset of combinatorial chemistry where the library members interconvert continuously by exchanging building blocks with each other. Dynamic combinatorial libraries (DCLs) are powerful tools for discovering the unexpected and have given rise to many fascinating molecules, ranging from interlocked structures to self-replicators. Furthermore, dynamic combinatorial molecular networks can produce emergent properties at systems level, which provide exciting new opportunities in systems chemistry. In this perspective we will highlight some new methodologies in this field and analyze selected examples of DCLs that are under thermodynamic control, leading to synthetic receptors, catalytic systems, and complex self-assembled supramolecular architectures. Also reviewed are extensions of the principles of DCC to systems that are not at equilibrium and may therefore harbor richer functional behavior. Examples include self-replication and molecular machines.

  15. Novel Combinatorial Chemistry-Derived Inhibitors of Oncogenic Phosphatases

    National Research Council Canada - National Science Library

    Lazo, John

    1999-01-01

    Our overall goal of this US Army Breast Cancer Grant entitled "Novel Combinatorial Chemistry-Derived Inhibitors of Oncogenic Phosphatases" is to identity and develop novel therapeutic agents for human breast cancer...

  16. High-throughput combinatorial chemical bath deposition: The case of doping Cu (In, Ga) Se film with antimony

    Science.gov (United States)

    Yan, Zongkai; Zhang, Xiaokun; Li, Guang; Cui, Yuxing; Jiang, Zhaolian; Liu, Wen; Peng, Zhi; Xiang, Yong

    2018-01-01

    The conventional methods for designing and preparing thin film based on wet process remain a challenge due to disadvantages such as time-consuming and ineffective, which hinders the development of novel materials. Herein, we present a high-throughput combinatorial technique for continuous thin film preparation relied on chemical bath deposition (CBD). The method is ideally used to prepare high-throughput combinatorial material library with low decomposition temperatures and high water- or oxygen-sensitivity at relatively high-temperature. To check this system, a Cu(In, Ga)Se (CIGS) thin films library doped with 0-19.04 at.% of antimony (Sb) was taken as an example to evaluate the regulation of varying Sb doping concentration on the grain growth, structure, morphology and electrical properties of CIGS thin film systemically. Combined with the Energy Dispersive Spectrometer (EDS), X-ray Photoelectron Spectroscopy (XPS), automated X-ray Diffraction (XRD) for rapid screening and Localized Electrochemical Impedance Spectroscopy (LEIS), it was confirmed that this combinatorial high-throughput system could be used to identify the composition with the optimal grain orientation growth, microstructure and electrical properties systematically, through accurately monitoring the doping content and material composition. According to the characterization results, a Sb2Se3 quasi-liquid phase promoted CIGS film-growth model has been put forward. In addition to CIGS thin film reported here, the combinatorial CBD also could be applied to the high-throughput screening of other sulfide thin film material systems.

  17. The Combinatorial Rigidity Conjecture is False for Cubic Polynomials

    DEFF Research Database (Denmark)

    Henriksen, Christian

    2003-01-01

    We show that there exist two cubic polynomials with connected Julia sets which are combinatorially equivalent but not topologically conjugate on their Julia sets. This disproves a conjecture by McMullen from 1995.......We show that there exist two cubic polynomials with connected Julia sets which are combinatorially equivalent but not topologically conjugate on their Julia sets. This disproves a conjecture by McMullen from 1995....

  18. Enabling high performance computational science through combinatorial algorithms

    International Nuclear Information System (INIS)

    Boman, Erik G; Bozdag, Doruk; Catalyurek, Umit V; Devine, Karen D; Gebremedhin, Assefaw H; Hovland, Paul D; Pothen, Alex; Strout, Michelle Mills

    2007-01-01

    The Combinatorial Scientific Computing and Petascale Simulations (CSCAPES) Institute is developing algorithms and software for combinatorial problems that play an enabling role in scientific and engineering computations. Discrete algorithms will be increasingly critical for achieving high performance for irregular problems on petascale architectures. This paper describes recent contributions by researchers at the CSCAPES Institute in the areas of load balancing, parallel graph coloring, performance improvement, and parallel automatic differentiation

  19. On the combinatorial foundations of Regge-calculus

    International Nuclear Information System (INIS)

    Budach, L.

    1989-01-01

    Lipschitz-Killing curvatures of piecewise flat spaces are combinatorial analogues of Lipschitz-Killing curvatures of Riemannian manifolds. In the following paper rigorous combinatorial representations and proofs of all basic results for Lipschitz-Killing curvatures not using analytic arguments are given. The principal tools for an elementary representation of Regge calculus can be developed by means of basic properties of dihedral angles. (author)

  20. Immune-Stimulating Combinatorial Therapy for Prostate Cancer

    Science.gov (United States)

    2016-10-01

    Overlap: None 20 90061946 (Drake) Title: Epigenetic Drugs and Immuno Therapy for Prostate Cancer (EDIT-PC) Effort: 1.2 calendar months (10% effort...AWARD NUMBER: W81XWH-15-1-0667 TITLE: Immune-Stimulating Combinatorial Therapy for Prostate Cancer PRINCIPAL INVESTIGATOR: Robert Ivkov...Stimulating Combinatorial Therapy for Prostate Cancer 5a. CONTRACT NUMBER 5b. GRANT NUMBER W81XWH-15-1-0667 5c. PROGRAM ELEMENT NUMBER 6. AUTHOR(S

  1. Enabling high performance computational science through combinatorial algorithms

    Energy Technology Data Exchange (ETDEWEB)

    Boman, Erik G [Discrete Algorithms and Math Department, Sandia National Laboratories (United States); Bozdag, Doruk [Biomedical Informatics, and Electrical and Computer Engineering, Ohio State University (United States); Catalyurek, Umit V [Biomedical Informatics, and Electrical and Computer Engineering, Ohio State University (United States); Devine, Karen D [Discrete Algorithms and Math Department, Sandia National Laboratories (United States); Gebremedhin, Assefaw H [Computer Science and Center for Computational Science, Old Dominion University (United States); Hovland, Paul D [Mathematics and Computer Science Division, Argonne National Laboratory (United States); Pothen, Alex [Computer Science and Center for Computational Science, Old Dominion University (United States); Strout, Michelle Mills [Computer Science, Colorado State University (United States)

    2007-07-15

    The Combinatorial Scientific Computing and Petascale Simulations (CSCAPES) Institute is developing algorithms and software for combinatorial problems that play an enabling role in scientific and engineering computations. Discrete algorithms will be increasingly critical for achieving high performance for irregular problems on petascale architectures. This paper describes recent contributions by researchers at the CSCAPES Institute in the areas of load balancing, parallel graph coloring, performance improvement, and parallel automatic differentiation.

  2. Combinatorial Dyson-Schwinger equations and inductive data types

    Science.gov (United States)

    Kock, Joachim

    2016-06-01

    The goal of this contribution is to explain the analogy between combinatorial Dyson-Schwinger equations and inductive data types to a readership of mathematical physicists. The connection relies on an interpretation of combinatorial Dyson-Schwinger equations as fixpoint equations for polynomial functors (established elsewhere by the author, and summarised here), combined with the now-classical fact that polynomial functors provide semantics for inductive types. The paper is expository, and comprises also a brief introduction to type theory.

  3. A fast combinatorial enhancement technique for earthquake damage identification based on remote sensing image

    Science.gov (United States)

    Dou, Aixia; Wang, Xiaoqing; Ding, Xiang; Du, Zecheng

    2010-11-01

    On the basis of the study on the enhancement methods of remote sensing images obtained after several earthquakes, the paper designed a new and optimized image enhancement model which was implemented by combining different single methods. The patterns of elementary model units and combined types of model were defined. Based on the enhancement model database, the algorithm of combinatorial model was brought out via C++ programming. The combined model was tested by processing the aerial remote sensing images obtained after 1976 Tangshan earthquake. It was proved that the definition and implementation of combined enhancement model can efficiently improve the ability and flexibility of image enhancement algorithm.

  4. Capacity Allocation and Revenue Sharing in Airline Alliances: A Combinatorial Auction-Based Modeling

    Directory of Open Access Journals (Sweden)

    Ying-jing Gu

    2017-01-01

    Full Text Available This paper attempts to establish a framework to help airline alliances effectively allocate their seat capacity with the purpose of maximizing alliances’ revenue. By assuming the airline alliance as the auctioneer and seat capacity in an itinerary as lots, the combinatorial auction model is constructed to optimize the allocation of the seat, and the revenue sharing method is established to share revenue between partners by Vickrey-Clarke-Groves (VCG mechanism. The result of the numerical study shows that the seat capacity allocation is effective even without information exchanging completely and the twofold revenue shares method shows more excitation for the airlines.

  5. Stochastic optimization: beyond mathematical programming

    CERN Multimedia

    CERN. Geneva

    2015-01-01

    Stochastic optimization, among which bio-inspired algorithms, is gaining momentum in areas where more classical optimization algorithms fail to deliver satisfactory results, or simply cannot be directly applied. This presentation will introduce baseline stochastic optimization algorithms, and illustrate their efficiency in different domains, from continuous non-convex problems to combinatorial optimization problem, to problems for which a non-parametric formulation can help exploring unforeseen possible solution spaces.

  6. Intrinsic information carriers in combinatorial dynamical systems

    Science.gov (United States)

    Harmer, Russ; Danos, Vincent; Feret, Jérôme; Krivine, Jean; Fontana, Walter

    2010-09-01

    Many proteins are composed of structural and chemical features—"sites" for short—characterized by definite interaction capabilities, such as noncovalent binding or covalent modification of other proteins. This modularity allows for varying degrees of independence, as the behavior of a site might be controlled by the state of some but not all sites of the ambient protein. Independence quickly generates a startling combinatorial complexity that shapes most biological networks, such as mammalian signaling systems, and effectively prevents their study in terms of kinetic equations—unless the complexity is radically trimmed. Yet, if combinatorial complexity is key to the system's behavior, eliminating it will prevent, not facilitate, understanding. A more adequate representation of a combinatorial system is provided by a graph-based framework of rewrite rules where each rule specifies only the information that an interaction mechanism depends on. Unlike reactions, which deal with molecular species, rules deal with patterns, i.e., multisets of molecular species. Although the stochastic dynamics induced by a collection of rules on a mixture of molecules can be simulated, it appears useful to capture the system's average or deterministic behavior by means of differential equations. However, expansion of the rules into kinetic equations at the level of molecular species is not only impractical, but conceptually indefensible. If rules describe bona fide patterns of interaction, molecular species are unlikely to constitute appropriate units of dynamics. Rather, we must seek aggregate variables reflective of the causal structure laid down by the rules. We call these variables "fragments" and the process of identifying them "fragmentation." Ideally, fragments are aspects of the system's microscopic population that the set of rules can actually distinguish on average; in practice, it may only be feasible to identify an approximation to this. Most importantly, fragments are

  7. Intrinsic information carriers in combinatorial dynamical systems.

    Science.gov (United States)

    Harmer, Russ; Danos, Vincent; Feret, Jérôme; Krivine, Jean; Fontana, Walter

    2010-09-01

    Many proteins are composed of structural and chemical features--"sites" for short--characterized by definite interaction capabilities, such as noncovalent binding or covalent modification of other proteins. This modularity allows for varying degrees of independence, as the behavior of a site might be controlled by the state of some but not all sites of the ambient protein. Independence quickly generates a startling combinatorial complexity that shapes most biological networks, such as mammalian signaling systems, and effectively prevents their study in terms of kinetic equations-unless the complexity is radically trimmed. Yet, if combinatorial complexity is key to the system's behavior, eliminating it will prevent, not facilitate, understanding. A more adequate representation of a combinatorial system is provided by a graph-based framework of rewrite rules where each rule specifies only the information that an interaction mechanism depends on. Unlike reactions, which deal with molecular species, rules deal with patterns, i.e., multisets of molecular species. Although the stochastic dynamics induced by a collection of rules on a mixture of molecules can be simulated, it appears useful to capture the system's average or deterministic behavior by means of differential equations. However, expansion of the rules into kinetic equations at the level of molecular species is not only impractical, but conceptually indefensible. If rules describe bona fide patterns of interaction, molecular species are unlikely to constitute appropriate units of dynamics. Rather, we must seek aggregate variables reflective of the causal structure laid down by the rules. We call these variables "fragments" and the process of identifying them "fragmentation." Ideally, fragments are aspects of the system's microscopic population that the set of rules can actually distinguish on average; in practice, it may only be feasible to identify an approximation to this. Most importantly, fragments are

  8. Novel power flow problem solutions method’s based on genetic algorithm optimization for banks capacitor compensation using an fuzzy logic rule bases for critical nodal detections

    OpenAIRE

    Abdelfatah, Nasri; Brahim, Gasbaoui

    2011-01-01

    The Reactive power flow’s is one of the most electrical distribution systems problem wich have great of interset of the electrical network researchers, it’s  cause’s active power transmission reduction, power losses decreasing, and  the drop voltage’s increase. In this research we described the efficiency of the FLC-GAO approach to solve the optimal power flow (OPF) combinatorial problem. The proposed approach employ tow algorithms, Fuzzy logic controller (FLC) algorithm for critical nodal de...

  9. Solving a Novel Inventory Location Model with Stochastic Constraints and (R,s,S Inventory Control Policy

    Directory of Open Access Journals (Sweden)

    Guillermo Cabrera

    2013-01-01

    Full Text Available We solve a novel inventory-location model with a stochastic capacity constraint based on a periodic inventory control (ILM-PR policy. The ILM-PR policy implies several changes with regard to other previous models proposed in the literature, which consider continuous review as their inventory policy. One of these changes is the inclusion of the undershoot concept, which has not been considered in previous ILM models in the literature. Based on our model, we are able to design a distribution network for a two-level supply chain, addressing both warehouse location and customer assignment decisions, whilst taking into consideration several aspects of inventory planning, in particular, evaluating the impact of the inventory control review period on the network configuration and system costs. Because the model is a very hard-to solve combinatorial nonlinear optimisation problem, we implemented two heuristics to solve it, namely, Tabu Search and Particle Swarm Optimisation. These approaches were tested over small instances in which they were able to find the optimal solution in just a few seconds. Because the model is a new one, a set of medium-size instances is provided that can be useful as a benchmark in future research. The heuristics showed a good convergence rate when applied to those instances. The results confirm that decision making over the inventory control policy has effects on the distribution network design.

  10. A combinatorial approach to angiosperm pollen morphology.

    Science.gov (United States)

    Mander, Luke

    2016-11-30

    Angiosperms (flowering plants) are strikingly diverse. This is clearly expressed in the morphology of their pollen grains, which are characterized by enormous variety in their shape and patterning. In this paper, I approach angiosperm pollen morphology from the perspective of enumerative combinatorics. This involves generating angiosperm pollen morphotypes by algorithmically combining character states and enumerating the results of these combinations. I use this approach to generate 3 643 200 pollen morphotypes, which I visualize using a parallel-coordinates plot. This represents a raw morphospace. To compare real-world and theoretical morphologies, I map the pollen of 1008 species of Neotropical angiosperms growing on Barro Colorado Island (BCI), Panama, onto this raw morphospace. This highlights that, in addition to their well-documented taxonomic diversity, Neotropical rainforests also represent an enormous reservoir of morphological diversity. Angiosperm pollen morphospace at BCI has been filled mostly by pollen morphotypes that are unique to single plant species. Repetition of pollen morphotypes among higher taxa at BCI reflects both constraint and convergence. This combinatorial approach to morphology addresses the complexity that results from large numbers of discrete character combinations and could be employed in any situation where organismal form can be captured by discrete morphological characters. © 2016 The Author(s).

  11. Exact combinatorial approach to finite coagulating systems

    Science.gov (United States)

    Fronczak, Agata; Chmiel, Anna; Fronczak, Piotr

    2018-02-01

    This paper outlines an exact combinatorial approach to finite coagulating systems. In this approach, cluster sizes and time are discrete and the binary aggregation alone governs the time evolution of the systems. By considering the growth histories of all possible clusters, an exact expression is derived for the probability of a coagulating system with an arbitrary kernel being found in a given cluster configuration when monodisperse initial conditions are applied. Then this probability is used to calculate the time-dependent distribution for the number of clusters of a given size, the average number of such clusters, and that average's standard deviation. The correctness of our general expressions is proved based on the (analytical and numerical) results obtained for systems with the constant kernel. In addition, the results obtained are compared with the results arising from the solutions to the mean-field Smoluchowski coagulation equation, indicating its weak points. The paper closes with a brief discussion on the extensibility to other systems of the approach presented herein, emphasizing the issue of arbitrary initial conditions.

  12. Scalable Combinatorial Tools for Health Disparities Research

    Directory of Open Access Journals (Sweden)

    Michael A. Langston

    2014-10-01

    Full Text Available Despite staggering investments made in unraveling the human genome, current estimates suggest that as much as 90% of the variance in cancer and chronic diseases can be attributed to factors outside an individual’s genetic endowment, particularly to environmental exposures experienced across his or her life course. New analytical approaches are clearly required as investigators turn to complicated systems theory and ecological, place-based and life-history perspectives in order to understand more clearly the relationships between social determinants, environmental exposures and health disparities. While traditional data analysis techniques remain foundational to health disparities research, they are easily overwhelmed by the ever-increasing size and heterogeneity of available data needed to illuminate latent gene x environment interactions. This has prompted the adaptation and application of scalable combinatorial methods, many from genome science research, to the study of population health. Most of these powerful tools are algorithmically sophisticated, highly automated and mathematically abstract. Their utility motivates the main theme of this paper, which is to describe real applications of innovative transdisciplinary models and analyses in an effort to help move the research community closer toward identifying the causal mechanisms and associated environmental contexts underlying health disparities. The public health exposome is used as a contemporary focus for addressing the complex nature of this subject.

  13. Combinatorial effects of odorants on mouse behavior

    Science.gov (United States)

    Saraiva, Luis R.; Kondoh, Kunio; Ye, Xiaolan; Yoon, Kyoung-hye; Hernandez, Marcus; Buck, Linda B.

    2016-01-01

    The mechanisms by which odors induce instinctive behaviors are largely unknown. Odor detection in the mouse nose is mediated by >1, 000 different odorant receptors (ORs) and trace amine-associated receptors (TAARs). Odor perceptions are encoded combinatorially by ORs and can be altered by slight changes in the combination of activated receptors. However, the stereotyped nature of instinctive odor responses suggests the involvement of specific receptors and genetically programmed neural circuits relatively immune to extraneous odor stimuli and receptor inputs. Here, we report that, contrary to expectation, innate odor-induced behaviors can be context-dependent. First, different ligands for a given TAAR can vary in behavioral effect. Second, when combined, some attractive and aversive odorants neutralize one another’s behavioral effects. Both a TAAR ligand and a common odorant block aversion to a predator odor, indicating that this ability is not unique to TAARs and can extend to an aversive response of potential importance to survival. In vitro testing of single receptors with binary odorant mixtures indicates that behavioral blocking can occur without receptor antagonism in the nose. Moreover, genetic ablation of a single receptor prevents its cognate ligand from blocking predator odor aversion, indicating that the blocking requires sensory input from the receptor. Together, these findings indicate that innate odor-induced behaviors can depend on context, that signals from a single receptor can block innate odor aversion, and that instinctive behavioral responses to odors can be modulated by interactions in the brain among signals derived from different receptors. PMID:27208093

  14. Beating Bias in the Directed Evolution of Proteins: Combining High-Fidelity on-Chip Solid-Phase Gene Synthesis with Efficient Gene Assembly for Combinatorial Library Construction.

    Science.gov (United States)

    Li, Aitao; Acevedo-Rocha, Carlos G; Sun, Zhoutong; Cox, Tony; Xu, Jia Lucy; Reetz, Manfred T

    2018-02-02

    Saturation mutagenesis (SM) constitutes a widely used technique in the directed evolution of selective enzymes as catalysts in organic chemistry and in the manipulation of metabolic paths and genomes, but the quality of the libraries is far from optimal due to the inherent amino acid bias. Herein, it is shown how this fundamental problem can be solved by applying high-fidelity solid-phase chemical gene synthesis on silicon chips followed by efficient gene assembly. Limonene epoxide hydrolase was chosen as the catalyst in the model desymmetrization of cyclohexene oxide with the stereoselective formation of (R,R)- and (S,S)-cyclohexane-1,2-diol. A traditional combinatorial PCR-based SM library, produced by simultaneous randomization at several residues by using a reduced amino acid alphabet, and the respective synthetic library were constructed and compared. Statistical analysis at the DNA level with massive sequencing demonstrates that, in the synthetic approach, 97 % of the theoretically possible DNA mutants are formed, whereas the traditional SM library contained only about 50 %. Screening at the protein level also showed the superiority of the synthetic library; many highly (R,R)- and (S,S)-selective variants being discovered are not found in the traditional SM library. With the prices of synthetic genes decreasing, this approach may point the way to future directed evolution. © 2018 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.

  15. The Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem

    Directory of Open Access Journals (Sweden)

    Denis Pinha

    2016-11-01

    Full Text Available This paper presents the formulation and solution of the Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem. The focus of the proposed method is not on finding a single optimal solution, instead on presenting multiple feasible solutions, with cost and duration information to the project manager. The motivation for developing such an approach is due in part to practical situations where the definition of optimal changes on a regular basis. The proposed approach empowers the project manager to determine what is optimal, on a given day, under the current constraints, such as, change of priorities, lack of skilled worker. The proposed method utilizes a simulation approach to determine feasible solutions, under the current constraints. Resources can be non-consumable, consumable, or doubly constrained. The paper also presents a real-life case study dealing with scheduling of ship repair activities.

  16. BWR fuel cycle optimization using neural networks

    International Nuclear Information System (INIS)

    Ortiz-Servin, Juan Jose; Castillo, Jose Alejandro; Pelta, David Alejandro

    2011-01-01

    Highlights: → OCONN a new system to optimize all nuclear fuel management steps in a coupled way. → OCON is based on an artificial recurrent neural network to find the best combination of partial solutions to each fuel management step. → OCONN works with a fuel lattices' stock, a fuel reloads' stock and a control rod patterns' stock, previously obtained with different heuristic techniques. → Results show OCONN is able to find good combinations according the global objective function. - Abstract: In nuclear fuel management activities for BWRs, four combinatorial optimization problems are solved: fuel lattice design, axial fuel bundle design, fuel reload design and control rod patterns design. Traditionally, these problems have been solved in separated ways due to their complexity and the required computational resources. In the specialized literature there are some attempts to solve fuel reloads and control rod patterns design or fuel lattice and axial fuel bundle design in a coupled way. In this paper, the system OCONN to solve all of these problems in a coupled way is shown. This system is based on an artificial recurrent neural network to find the best combination of partial solutions to each problem, in order to maximize a global objective function. The new system works with a fuel lattices' stock, a fuel reloads' stock and a control rod patterns' stock, previously obtained with different heuristic techniques. The system was tested to design an equilibrium cycle with a cycle length of 18 months. Results show that the new system is able to find good combinations. Cycle length is reached and safety parameters are fulfilled.

  17. Solving no-wait two-stage flexible flow shop scheduling problem with unrelated parallel machines and rework time by the adjusted discrete Multi Objective Invasive Weed Optimization and fuzzy dominance approach

    Energy Technology Data Exchange (ETDEWEB)

    Jafarzadeh, Hassan; Moradinasab, Nazanin; Gerami, Ali

    2017-07-01

    Adjusted discrete Multi-Objective Invasive Weed Optimization (DMOIWO) algorithm, which uses fuzzy dominant approach for ordering, has been proposed to solve No-wait two-stage flexible flow shop scheduling problem. Design/methodology/approach: No-wait two-stage flexible flow shop scheduling problem by considering sequence-dependent setup times and probable rework in both stations, different ready times for all jobs and rework times for both stations as well as unrelated parallel machines with regards to the simultaneous minimization of maximum job completion time and average latency functions have been investigated in a multi-objective manner. In this study, the parameter setting has been carried out using Taguchi Method based on the quality indicator for beater performance of the algorithm. Findings: The results of this algorithm have been compared with those of conventional, multi-objective algorithms to show the better performance of the proposed algorithm. The results clearly indicated the greater performance of the proposed algorithm. Originality/value: This study provides an efficient method for solving multi objective no-wait two-stage flexible flow shop scheduling problem by considering sequence-dependent setup times, probable rework in both stations, different ready times for all jobs, rework times for both stations and unrelated parallel machines which are the real constraints.

  18. Solving no-wait two-stage flexible flow shop scheduling problem with unrelated parallel machines and rework time by the adjusted discrete Multi Objective Invasive Weed Optimization and fuzzy dominance approach

    International Nuclear Information System (INIS)

    Jafarzadeh, Hassan; Moradinasab, Nazanin; Gerami, Ali

    2017-01-01

    Adjusted discrete Multi-Objective Invasive Weed Optimization (DMOIWO) algorithm, which uses fuzzy dominant approach for ordering, has been proposed to solve No-wait two-stage flexible flow shop scheduling problem. Design/methodology/approach: No-wait two-stage flexible flow shop scheduling problem by considering sequence-dependent setup times and probable rework in both stations, different ready times for all jobs and rework times for both stations as well as unrelated parallel machines with regards to the simultaneous minimization of maximum job completion time and average latency functions have been investigated in a multi-objective manner. In this study, the parameter setting has been carried out using Taguchi Method based on the quality indicator for beater performance of the algorithm. Findings: The results of this algorithm have been compared with those of conventional, multi-objective algorithms to show the better performance of the proposed algorithm. The results clearly indicated the greater performance of the proposed algorithm. Originality/value: This study provides an efficient method for solving multi objective no-wait two-stage flexible flow shop scheduling problem by considering sequence-dependent setup times, probable rework in both stations, different ready times for all jobs, rework times for both stations and unrelated parallel machines which are the real constraints.

  19. An Efficient Combined Meta-Heuristic Algorithm for Solving the Traveling Salesman Problem

    Directory of Open Access Journals (Sweden)

    Majid Yousefikhoshbakht

    2016-08-01

    Full Text Available The traveling salesman problem (TSP is one of the most important NP-hard Problems and probably the most famous and extensively studied problem in the field of combinatorial optimization. In this problem, a salesman is required to visit each of n given nodes once and only once, starting from any node and returning to the original place of departure. This paper presents an efficient evolutionary optimization algorithm developed through combining imperialist competitive algorithm and lin-kernighan algorithm called (MICALK in order to solve the TSP. The MICALK is tested on 44 TSP instances involving from 24 to 1655 nodes from the literature so that 26 best known solutions of the benchmark problem are also found by our algorithm. Furthermore, the performance of MICALK is compared with several metaheuristic algorithms, including GA, BA, IBA, ICA, GSAP, ABO, PSO and BCO on 32 instances from TSPLIB. The results indicate that the MICALK performs well and is quite competitive with the above algorithms.

  20. Submodular functions and optimization

    CERN Document Server

    Fujishige, Satoru

    2005-01-01

    It has widely been recognized that submodular functions play essential roles in efficiently solvable combinatorial optimization problems. Since the publication of the 1st edition of this book fifteen years ago, submodular functions have been showing further increasing importance in optimization, combinatorics, discrete mathematics, algorithmic computer science, and algorithmic economics, and there have been made remarkable developments of theory and algorithms in submodular functions. The 2nd edition of the book supplements the 1st edition with a lot of remarks and with new two chapters: "Submodular Function Minimization" and "Discrete Convex Analysis." The present 2nd edition is still a unique book on submodular functions, which is essential to students and researchers interested in combinatorial optimization, discrete mathematics, and discrete algorithms in the fields of mathematics, operations research, computer science, and economics. Key features: - Self-contained exposition of the theory of submodular ...

  1. Strategy for solving a coupled problem of the electromagnetic load analysis and design optimization for local conducting structures to support the ITER blanket development

    Energy Technology Data Exchange (ETDEWEB)

    Rozov, Vladimir, E-mail: vladimir.rozov@iter.org [ITER Organization, Route de Vinon sur Verdon, 13115 Saint Paul-lez-Durance (France); Belyakov, V.; Kukhtin, V.; Lamzin, E.; Mazul, I.; Sytchevsky, S. [D.V. Efremov Scientific Research Institute, 196641 St. Petersburg (Russian Federation)

    2014-11-15

    Highlights: • We present the way of modeling transient electro-magnetic loads on local conductive domains in the large magnetic system. • Simplification is achieved by decomposing of the problem, multi-scale integral-differential modeling and use of integral parameters. • The intrinsic scale of loads on a localized conductor with eddy is quantified through the load susceptibility tensor. • Solution is searched as response of a simple equivalent dynamic simulator, using control theory methods. • The concept is exemplified with multi-scenario assessment of EM eddy loads on ITER blanket modules. - Abstract: The complexity of the electromagnetic (EM) response of the tokamak structures is one of the key and design-driving issues for the ITER. We consider the specifics of the assessment of ponderomotive forces, acting on local components of a large electro-physical device during electromagnetic transients. A strategy and approach is proposed for the operative EM loads modeling and analysis that enables design optimization at early phases of development. The paper describes a method of principal simplification of the mathematical model, based on the analysis and exploiting specific features and peculiarities of the relevant technical problem, determined by the design and operation of the device and system under consideration. The application of the method for predictive EM loads analysis and corresponding numerical calculations are exemplified for the localized ITER blanket components — shield modules. The example demonstrates the efficiency of EM load analysis in complex electromagnetic systems via a set of simplified models with different scope, contents and level of detail.

  2. Strategy for solving a coupled problem of the electromagnetic load analysis and design optimization for local conducting structures to support the ITER blanket development

    International Nuclear Information System (INIS)

    Rozov, Vladimir; Belyakov, V.; Kukhtin, V.; Lamzin, E.; Mazul, I.; Sytchevsky, S.

    2014-01-01

    Highlights: • We present the way of modeling transient electro-magnetic loads on local conductive domains in the large magnetic system. • Simplification is achieved by decomposing of the problem, multi-scale integral-differential modeling and use of integral parameters. • The intrinsic scale of loads on a localized conductor with eddy is quantified through the load susceptibility tensor. • Solution is searched as response of a simple equivalent dynamic simulator, using control theory methods. • The concept is exemplified with multi-scenario assessment of EM eddy loads on ITER blanket modules. - Abstract: The complexity of the electromagnetic (EM) response of the tokamak structures is one of the key and design-driving issues for the ITER. We consider the specifics of the assessment of ponderomotive forces, acting on local components of a large electro-physical device during electromagnetic transients. A strategy and approach is proposed for the operative EM loads modeling and analysis that enables design optimization at early phases of development. The paper describes a method of principal simplification of the mathematical model, based on the analysis and exploiting specific features and peculiarities of the relevant technical problem, determined by the design and operation of the device and system under consideration. The application of the method for predictive EM loads analysis and corresponding numerical calculations are exemplified for the localized ITER blanket components — shield modules. The example demonstrates the efficiency of EM load analysis in complex electromagnetic systems via a set of simplified models with different scope, contents and level of detail

  3. Generating an Automated Test Suite by Variable Strength Combinatorial Testing for Web Services

    Directory of Open Access Journals (Sweden)

    Yin Li

    2016-09-01

    Full Text Available Testing Web Services has become the spotlight of software engineering as an important means to assure the quality of Web application. Due to lacking of graphic interface and source code, Web services need an automated testing method, which is an important part in efficiently designing and generating test suite. However, the existing testing methods may lead to the redundancy of test suite and the decrease of fault-detecting ability since it cannot handle scenarios where the strengths of the different interactions are not uniform. With the purpose of solving this problem, firstly the formal tree model based on WSDL is constructed and the actual interaction relationship of each node is made sufficient consideration into, then the combinatorial testing is proposed to generate variable strength combinatorial test suite based on One-test-at-a-time strategy. At last test cases are minimized according to constraint rules. The results show that compared with conventional random testing, the proposed approach can detect more errors with the same amount of test cases which turning out to be more ideal than existing ones in size.

  4. Solid-Phase Synthesis of Small Molecule Libraries using Double Combinatorial Chemistry

    DEFF Research Database (Denmark)

    Nielsen, John; Jensen, Flemming R.

    1997-01-01

    The first synthesis of a combinatorial library using double combinatorial chemistry is presented. Coupling of unprotected Fmoc-tyrosine to the solid support was followed by Mitsunobu O-alkylation. Introduction of a diacid linker yields a system in which the double combinatorial step can be demons......The first synthesis of a combinatorial library using double combinatorial chemistry is presented. Coupling of unprotected Fmoc-tyrosine to the solid support was followed by Mitsunobu O-alkylation. Introduction of a diacid linker yields a system in which the double combinatorial step can...

  5. 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.

  6. Physical interpretation of the combinatorial hierarchy

    International Nuclear Information System (INIS)

    Bastin, T.; Noyes, H.P.

    1978-01-01

    The combinatorial hierarchy model for base particle processes is compared and contrasted with the Ur-theory as developed at the Tutzing Conferences. It agrees with Ur-theory about a finite basis, the ''fixed past--uncertain future'' aspects of physics, and the necessity of dropping Bohr's requirement of reduction to the haptic language of commonsense and classical physics. However, it retains a constructive, hierarchial approach with can yield only an approximate and discrete ''space time'', and introduces the observation metaphysic at the start. Concrete interpretation of the four levels of the hierarchy (with cardinals 3, 7, 127, 2 127 -1 approx. =10 38 ) associates the three levels which map up and down with three absolute conservation laws (charge, baryon number, lepton number) and the spin dichotomy. The first level represents +, -, and +- unit charge. The second has the quantum nubmers of a baryon--antibaryon pair and associated charged meson (e.g., n anti n, p anti n, p anti p, n anti p, π + , π 0 , π - ). The third level associates this pair, now including four spin states as well as four charge states, with a neutral lepton--antilepton pair (e anti e or ν anti ν) in four spin states (total, 64 states): three charged spinless, three charged spin-1, and neutral spin-1 mesons (15 states), and a neutral vector boson associated with the leptons; this gives 3 + 15 + 3 x 15 = 63 possible boson states, so a total correct count of 63 + 64 = 127 states. Something like SU 2 X SU 3 and other indications of quark quantum numbers can occur as substructures at the fourth (unstable) level. A slight extension gives the usual static approximation to the building energy of the hydrogen atom, α 2 m/sub e/c 2 . Cosmological implications of the theory are in accord with current experience. A beginning in the physical interpretation of a theory which could eventually encompass all branches of physics was made. 3 figures, 6 tables

  7. Combinatorial explosion in model gene networks

    Science.gov (United States)

    Edwards, R.; Glass, L.

    2000-09-01

    The explosive growth in knowledge of the genome of humans and other organisms leaves open the question of how the functioning of genes in interacting networks is coordinated for orderly activity. One approach to this problem is to study mathematical properties of abstract network models that capture the logical structures of gene networks. The principal issue is to understand how particular patterns of activity can result from particular network structures, and what types of behavior are possible. We study idealized models in which the logical structure of the network is explicitly represented by Boolean functions that can be represented by directed graphs on n-cubes, but which are continuous in time and described by differential equations, rather than being updated synchronously via a discrete clock. The equations are piecewise linear, which allows significant analysis and facilitates rapid integration along trajectories. We first give a combinatorial solution to the question of how many distinct logical structures exist for n-dimensional networks, showing that the number increases very rapidly with n. We then outline analytic methods that can be used to establish the existence, stability and periods of periodic orbits corresponding to particular cycles on the n-cube. We use these methods to confirm the existence of limit cycles discovered in a sample of a million randomly generated structures of networks of 4 genes. Even with only 4 genes, at least several hundred different patterns of stable periodic behavior are possible, many of them surprisingly complex. We discuss ways of further classifying these periodic behaviors, showing that small mutations (reversal of one or a few edges on the n-cube) need not destroy the stability of a limit cycle. Although these networks are very simple as models of gene networks, their mathematical transparency reveals relationships between structure and behavior, they suggest that the possibilities for orderly dynamics in such

  8. Solving applied mathematical problems with Matlab

    CERN Document Server

    Xue, Dingyu

    2008-01-01

    Computer Mathematics Language-An Overview. Fundamentals of MATLAB Programming. Calculus Problems. MATLAB Computations of Linear Algebra Problems. Integral Transforms and Complex Variable Functions. Solutions to Nonlinear Equations and Optimization Problems. MATLAB Solutions to Differential Equation Problems. Solving Interpolations and Approximations Problems. Solving Probability and Mathematical Statistics Problems. Nontraditional Solution Methods for Mathematical Problems.

  9. Electricity price forecast using Combinatorial Neural Network trained by a new stochastic search method

    International Nuclear Information System (INIS)

    Abedinia, O.; Amjady, N.; Shafie-khah, M.; Catalão, J.P.S.

    2015-01-01

    Highlights: • Presenting a Combinatorial Neural Network. • Suggesting a new stochastic search method. • Adapting the suggested method as a training mechanism. • Proposing a new forecast strategy. • Testing the proposed strategy on real-world electricity markets. - Abstract: Electricity price forecast is key information for successful operation of electricity market participants. However, the time series of electricity price has nonlinear, non-stationary and volatile behaviour and so its forecast method should have high learning capability to extract the complex input/output mapping function of electricity price. In this paper, a Combinatorial Neural Network (CNN) based forecasting engine is proposed to predict the future values of price data. The CNN-based forecasting engine is equipped with a new training mechanism for optimizing the weights of the CNN. This training mechanism is based on an efficient stochastic search method, which is a modified version of chemical reaction optimization algorithm, giving high learning ability to the CNN. The proposed price forecast strategy is tested on the real-world electricity markets of Pennsylvania–New Jersey–Maryland (PJM) and mainland Spain and its obtained results are extensively compared with the results obtained from several other forecast methods. These comparisons illustrate effectiveness of the proposed strategy.

  10. Morphological Constraints on Cerebellar Granule Cell Combinatorial Diversity.

    Science.gov (United States)

    Gilmer, Jesse I; Person, Abigail L

    2017-12-13

    Combinatorial expansion by the cerebellar granule cell layer (GCL) is fundamental to theories of cerebellar contributions to motor control and learning. Granule cells (GrCs) sample approximately four mossy fiber inputs and are thought to form a combinatorial code useful for pattern separation and learning. We constructed a spatially realistic model of the cerebellar GCL and examined how GCL architecture contributes to GrC combinatorial diversity. We found that GrC combinatorial diversity saturates quickly as mossy fiber input diversity increases, and that this saturation is in part a consequence of short dendrites, which limit access to diverse inputs and favor dense sampling of local inputs. This local sampling also produced GrCs that were combinatorially redundant, even when input diversity was extremely high. In addition, we found that mossy fiber clustering, which is a common anatomical pattern, also led to increased redundancy of GrC input combinations. We related this redundancy to hypothesized roles of temporal expansion of GrC information encoding in service of learned timing, and we show that GCL architecture produces GrC populations that support both temporal and combinatorial expansion. Finally, we used novel anatomical measurements from mice of either sex to inform modeling of sparse and filopodia-bearing mossy fibers, finding that these circuit features uniquely contribute to enhancing GrC diversification and redundancy. Our results complement information theoretic studies of granule layer structure and provide insight into the contributions of granule layer anatomical features to afferent mixing. SIGNIFICANCE STATEMENT Cerebellar granule cells are among the simplest neurons, with tiny somata and, on average, just four dendrites. These characteristics, along with their dense organization, inspired influential theoretical work on the granule cell layer as a combinatorial expander, where each granule cell represents a unique combination of inputs

  11. The priming of basic combinatory responses in MEG.

    Science.gov (United States)

    Blanco-Elorrieta, Esti; Ferreira, Victor S; Del Prato, Paul; Pylkkänen, Liina

    2018-01-01

    Priming has been a powerful tool for the study of human memory and especially the memory representations relevant for language. However, although it is well established that lexical access can be primed, we do not know exactly what types of computations can be primed above the word level. This work took a neurobiological approach and assessed the ways in which the complex representation of a minimal combinatory phrase, such as red boat, can be primed, as evidenced by the spatiotemporal profiles of magnetoencephalography (MEG) signals. Specifically, we built upon recent progress on the neural signatures of phrasal composition and tested whether the brain activities implicated for the basic combination of two words could be primed. In two experiments, MEG was recorded during a picture naming task where the prime trials were designed to replicate previously reported combinatory effects and the target trials to test whether those combinatory effects could be primed. The manipulation of the primes was successful in eliciting larger activity for adjective-noun combinations than single nouns in left anterior temporal and ventromedial prefrontal cortices, replicating prior MEG studies on parallel contrasts. Priming of similarly timed activity was observed during target trials in anterior temporal cortex, but only when the prime and target shared an adjective. No priming in temporal cortex was observed for single word repetition and two control tasks showed that the priming effect was not elicited if the prime pictures were simply viewed but not named. In sum, this work provides evidence that very basic combinatory operations can be primed, with the necessity for some lexical overlap between prime and target suggesting combinatory conceptual, as opposed to syntactic processing. Both our combinatory and priming effects were early, onsetting between 100 and 150ms after picture onset and thus are likely to reflect the very earliest planning stages of a combinatory message

  12. Fuzzy multiobjective models for optimal operation of a hydropower system

    Science.gov (United States)

    Teegavarapu, Ramesh S. V.; Ferreira, André R.; Simonovic, Slobodan P.

    2013-06-01

    Optimal operation models for a hydropower system using new fuzzy multiobjective mathematical programming models are developed and evaluated in this study. The models use (i) mixed integer nonlinear programming (MINLP) with binary variables and (ii) integrate a new turbine unit commitment formulation along with water quality constraints used for evaluation of reservoir downstream impairment. Reardon method used in solution of genetic algorithm optimization problems forms the basis for development of a new fuzzy multiobjective hydropower system optimization model with creation of Reardon type fuzzy membership functions. The models are applied to a real-life hydropower reservoir system in Brazil. Genetic Algorithms (GAs) are used to (i) solve the optimization formulations to avoid computational intractability and combinatorial problems associated with binary variables in unit commitment, (ii) efficiently address Reardon method formulations, and (iii) deal with local optimal solutions obtained from the use of traditional gradient-based solvers. Decision maker's preferences are incorporated within fuzzy mathematical programming formulations to obtain compromise operating rules for a multiobjective reservoir operation problem dominated by conflicting goals of energy production, water quality and conservation releases. Results provide insight into compromise operation rules obtained using the new Reardon fuzzy multiobjective optimization framework and confirm its applicability to a variety of multiobjective water resources problems.

  13. Simulated annealing approach for solving economic load dispatch ...

    African Journals Online (AJOL)

    user

    thermodynamics to solve economic load dispatch (ELD) problems. ... evolutionary programming algorithm has been successfully applied for solving the ... concept behind the simulated annealing (SA) optimization is discussed in Section 3.

  14. Tangram solved? Prefrontal cortex activation analysis during geometric problem solving.

    Science.gov (United States)

    Ayaz, Hasan; Shewokis, Patricia A; Izzetoğlu, Meltem; Çakır, Murat P; Onaral, Banu

    2012-01-01

    Recent neuroimaging studies have implicated prefrontal and parietal cortices for mathematical problem solving. Mental arithmetic tasks have been used extensively to study neural correlates of mathematical reasoning. In the present study we used geometric problem sets (tangram tasks) that require executive planning and visuospatial reasoning without any linguistic representation interference. We used portable optical brain imaging (functional near infrared spectroscopy--fNIR) to monitor hemodynamic changes within anterior prefrontal cortex during tangram tasks. Twelve healthy subjects were asked to solve a series of computerized tangram puzzles and control tasks that required same geometric shape manipulation without problem solving. Total hemoglobin (HbT) concentration changes indicated a significant increase during tangram problem solving in the right hemisphere. Moreover, HbT changes during failed trials (when no solution found) were significantly higher compared to successful trials. These preliminary results suggest that fNIR can be used to assess cortical activation changes induced by geometric problem solving. Since fNIR is safe, wearable and can be used in ecologically valid environments such as classrooms, this neuroimaging tool may help to improve and optimize learning in educational settings.

  15. Combinatorial Algorithms for Computing Column Space Bases ThatHave Sparse Inverses

    Energy Technology Data Exchange (ETDEWEB)

    Pinar, Ali; Chow, Edmond; Pothen, Alex

    2005-03-18

    This paper presents a combinatorial study on the problem ofconstructing a sparse basis forthe null-space of a sparse, underdetermined, full rank matrix, A. Such a null-space is suitable forsolving solving many saddle point problems. Our approach is to form acolumn space basis of A that has a sparse inverse, by selecting suitablecolumns of A. This basis is then used to form a sparse null-space basisin fundamental form. We investigate three different algorithms forcomputing the column space basis: Two greedy approaches that rely onmatching, and a third employing a divide and conquer strategy implementedwith hypergraph partitioning followed by the greedy approach. We alsodiscuss the complexity of selecting a column basis when it is known thata block diagonal basis exists with a small given block size.

  16. Combinatorial expressions of the solutions to initial value problems of the discrete and ultradiscrete Toda molecules

    International Nuclear Information System (INIS)

    Kamioka, Shuhei; Takagaki, Tomoaki

    2013-01-01

    Combinatorial expressions are presented of the solutions to initial value problems of the discrete and ultradiscrete Toda molecules. For the discrete Toda molecule, a subtraction-free expression of the solution is derived in terms of non-intersecting paths, for which two results in combinatorics, Flajolet’s interpretation of continued fractions and Gessel–Viennot’s lemma on determinants, are applied. By ultradiscretizing the subtraction-free expression, the solution to the ultradiscrete Toda molecule is obtained. It is finally shown that the initial value problem of the ultradiscrete Toda molecule is exactly solved in terms of shortest paths on a specific graph. The behavior of the solution is also investigated in comparison with the box–ball system. (paper)

  17. Efficiency Intra-Cluster Device-to-Device Relay Selection for Multicast Services Based on Combinatorial Auction

    Directory of Open Access Journals (Sweden)

    Yong Zhang

    2015-12-01

    Full Text Available In Long Term Evolution-Advanced (LTE-A networks, Device-to-device (D2D communications can be utilized to enhance the performance of multicast services by leveraging D2D relays to serve nodes with worse channel conditions within a cluster. For traditional D2D relay schemes, D2D links with poor channel condition may be the bottleneck of system sum data rate. In this paper, to optimize the throughput of D2D communications, we introduce an iterative combinatorial auction algorithm for efficient D2D relay selection. In combinatorial auctions, the User Equipments (UEs that fails to correctly receive multicast data from eNodeB (eNB are viewed as bidders that compete for D2D relays, while the eNB is treated as the auctioneer. We also give properties of convergency and low-complexity and present numerical simulations to verify the efficiency of the proposed algorithm.

  18. Balancing focused combinatorial libraries based on multiple GPCR ligands

    Science.gov (United States)

    Soltanshahi, Farhad; Mansley, Tamsin E.; Choi, Sun; Clark, Robert D.

    2006-08-01

    G-Protein coupled receptors (GPCRs) are important targets for drug discovery, and combinatorial chemistry is an important tool for pharmaceutical development. The absence of detailed structural information, however, limits the kinds of combinatorial design techniques that can be applied to GPCR targets. This is particularly problematic given the current emphasis on focused combinatorial libraries. By linking an incremental construction method (OptDesign) to the very fast shape-matching capability of ChemSpace, we have created an efficient method for designing targeted sublibraries that are topomerically similar to known actives. Multi-objective scoring allows consideration of multiple queries (actives) simultaneously. This can lead to a distribution of products skewed towards one particular query structure, however, particularly when the ligands of interest are quite dissimilar to one another. A novel pivoting technique is described which makes it possible to generate promising designs even under those circumstances. The approach is illustrated by application to some serotonergic agonists and chemokine antagonists.

  19. Summation on the basis of combinatorial representation of equal powers

    Directory of Open Access Journals (Sweden)

    Alexander I. Nikonov

    2016-03-01

    Full Text Available In the paper the conclusion of combinatorial expressions for the sums of members of several sequences is considered. Conclusion is made on the basis of combinatorial representation of the sum of the weighted equal powers. The weighted members of a geometrical progression, the simple arithmetic-geometrical and combined progressions are subject to summation. One of principal places in the given conclusion occupies representation of members of each of the specified progressions in the form of matrix elements. The row of this matrix is formed with use of a gang of equal powers with the set weight factor. Besides, in work formulas of combinatorial identities with participation of free components of the sums of equal powers, and also separate power-member of sequence of equal powers or a geometrical progression are presented. All presented formulas have the general basis-components of the sums of equal powers.

  20. Combinatorial vector fields and the valley structure of fitness landscapes.

    Science.gov (United States)

    Stadler, Bärbel M R; Stadler, Peter F

    2010-12-01

    Adaptive (downhill) walks are a computationally convenient way of analyzing the geometric structure of fitness landscapes. Their inherently stochastic nature has limited their mathematical analysis, however. Here we develop a framework that interprets adaptive walks as deterministic trajectories in combinatorial vector fields and in return associate these combinatorial vector fields with weights that measure their steepness across the landscape. We show that the combinatorial vector fields and their weights have a product structure that is governed by the neutrality of the landscape. This product structure makes practical computations feasible. The framework presented here also provides an alternative, and mathematically more convenient, way of defining notions of valleys, saddle points, and barriers in landscape. As an application, we propose a refined approximation for transition rates between macrostates that are associated with the valleys of the landscape.

  1. Discrete Optimization Model for Vehicle Routing Problem with Scheduling Side Cosntraints

    Science.gov (United States)

    Juliandri, Dedy; Mawengkang, Herman; Bu'ulolo, F.

    2018-01-01

    Vehicle Routing Problem (VRP) is an important element of many logistic systems which involve routing and scheduling of vehicles from a depot to a set of customers node. This is a hard combinatorial optimization problem with the objective to find an optimal set of routes used by a fleet of vehicles to serve the demands a set of customers It is required that these vehicles return to the depot after serving customers’ demand. The problem incorporates time windows, fleet and driver scheduling, pick-up and delivery in the planning horizon. The goal is to determine the scheduling of fleet and driver and routing policies of the vehicles. The objective is to minimize the overall costs of all routes over the planning horizon. We model the problem as a linear mixed integer program. We develop a combination of heuristics and exact method for solving the model.

  2. 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.

  3. WORKSHOP ON NEW DEVELOPMENTS IN CHEMICAL SEPARATIONS FROM COMBINATORIAL CHEMISTRY AND RELATED SYNTHETIC STRATEGIES

    Energy Technology Data Exchange (ETDEWEB)

    Weber, Stephen G. [University of Pittsburgh, Pittsburgh, Pennsylvania

    1998-08-22

    The power of combinatorial chemistry and related high throughput synthetic strategies is currently being pursued as a fruitful way to develop molecules and materials with new properties. The strategy is motivated, for example in the pharmaceutical industry, by the difficulty of designing molecules to bind to specific sites on target biomolecules. By synthesizing a variety of similar structures, and then finding the one that has the most potent activity, new so-called lead structures will be found rapidly. Existing lead structures can be optimized. This relatively new approach has many implications for separation science. The most obvious is the call for more separations power: higher resolution, lower concentrations, higher speed. This pressure butresses the traditional directions of research into the development of more useful separations. The advent of chip-based, electroosmotically pumped systems1 will certainly accelerate progress in this traditional direction. The progress in combinatorial chemistry and related synthetic strategies gives rise to two other, broadly significant possibilities for large changes in separation science. One possibility results from the unique requirements of the synthesis of a huge number of products simultaneously. Can syntheses and separations be designed to work together to create strategies that lead to mixtures containing only desired products but without side products? The other possibility results from the need for molecular selectivity in separations. Can combinatorial syntheses and related strategies be used in the development of better separations media? A workshop in two parts was held. In one half-day session, pedagogical presentations educated across the barriers of discipline and scale. In the second half-day session, the participants broke into small groups to flesh out new ideas. A panel summarized the breakout discussions.

  4. Recent advances in combinatorial biosynthesis for drug discovery

    Directory of Open Access Journals (Sweden)

    Sun H

    2015-02-01

    Full Text Available Huihua Sun,1,* Zihe Liu,1,* Huimin Zhao,1,2 Ee Lui Ang1 1Metabolic Engineering Research Laboratory, Institute of Chemical and Engineering Sciences, Agency for Science, Technology and Research, Singapore; 2Department of Chemical and Biomolecular Engineering, University of Illinois at Urbana-Champaign, Urbana, IL, USA *These authors contributed equally to this work Abstract: Because of extraordinary structural diversity and broad biological activities, natural products have played a significant role in drug discovery. These therapeutically important secondary metabolites are assembled and modified by dedicated biosynthetic pathways in their host living organisms. Traditionally, chemists have attempted to synthesize natural product analogs that are important sources of new drugs. However, the extraordinary structural complexity of natural products sometimes makes it challenging for traditional chemical synthesis, which usually involves multiple steps, harsh conditions, toxic organic solvents, and byproduct wastes. In contrast, combinatorial biosynthesis exploits substrate promiscuity and employs engineered enzymes and pathways to produce novel “unnatural” natural products, substantially expanding the structural diversity of natural products with potential pharmaceutical value. Thus, combinatorial biosynthesis provides an environmentally friendly way to produce natural product analogs. Efficient expression of the combinatorial biosynthetic pathway in genetically tractable heterologous hosts can increase the titer of the compound, eventually resulting in less expensive drugs. In this review, we will discuss three major strategies for combinatorial biosynthesis: 1 precursor-directed biosynthesis; 2 enzyme-level modification, which includes swapping of the entire domains, modules and subunits, site-specific mutagenesis, and directed evolution; 3 pathway-level recombination. Recent examples of combinatorial biosynthesis employing these

  5. Combinatorial methods for advanced materials research and development

    Energy Technology Data Exchange (ETDEWEB)

    Cremer, R.; Dondorf, S.; Hauck, M.; Horbach, D.; Kaiser, M.; Krysta, S.; Kyrylov, O.; Muenstermann, E.; Philipps, M.; Reichert, K.; Strauch, G. [Rheinisch-Westfaelische Technische Hochschule Aachen (Germany). Lehrstuhl fuer Theoretische Huettenkunde

    2001-10-01

    The applicability of combinatorial methods in developing advanced materials is illustrated presenting four examples for the deposition and characterization of one- and two-dimensionally laterally graded coatings, which were deposited by means of (reactive) magnetron sputtering and plasma-enhanced chemical vapor deposition. To emphasize the advantages of combinatorial approaches, metastable hard coatings like (Ti,Al)N and (Ti,Al,Hf)N respectively, as well as Ge-Sb-Te based films for rewritable optical data storage were investigated with respect to the relations between structure, composition, and the desired materials properties. (orig.)

  6. Combinatorial algebraic geometry selected papers from the 2016 apprenticeship program

    CERN Document Server

    Sturmfels, Bernd

    2017-01-01

    This volume consolidates selected articles from the 2016 Apprenticeship Program at the Fields Institute, part of the larger program on Combinatorial Algebraic Geometry that ran from July through December of 2016. Written primarily by junior mathematicians, the articles cover a range of topics in combinatorial algebraic geometry including curves, surfaces, Grassmannians, convexity, abelian varieties, and moduli spaces. This book bridges the gap between graduate courses and cutting-edge research by connecting historical sources, computation, explicit examples, and new results.

  7. Mitigation of Control Channel Jamming via Combinatorial Key Distribution

    Science.gov (United States)

    Falahati, Abolfazl; Azarafrooz, Mahdi

    The problem of countering control channel jamming against internal adversaries in wireless ad hoc networks is addressed. Using combinatorial key distribution, a new method to secure the control channel access is introduced. This method, utilizes the established keys in the key establishment phase to hide the location of control channels without the need for a secure BS. This is in obtained by combination of a collision free one-way function and a combinatorial key establishment method. The proposed scheme can be considered as a special case of the ALOHA random access schemes which uses the common established keys as its seeds to generate the pattern of transmission.

  8. Some results from the combinatorial approach to quantum logic

    International Nuclear Information System (INIS)

    Greechie, R.J.

    1976-01-01

    The combinatorial approach to quantum logic focuses on certain interconnections between graphs, combinatorial designs, and convex sets as applied to a quantum logic. This article is concerned only with orthomodular lattices and associated structures. A class of complete atomic irreducible semimodular orthomodular lattices is derived which may not be represented as linear subspaces of a vector space over a division ring. Each of these lattices is a proposition system of dimension three. These proposition systems form orthocomplemented non-Desarguesian projective geometries. (B.R.H.)

  9. Markov's theorem and algorithmically non-recognizable combinatorial manifolds

    International Nuclear Information System (INIS)

    Shtan'ko, M A

    2004-01-01

    We prove the theorem of Markov on the existence of an algorithmically non-recognizable combinatorial n-dimensional manifold for every n≥4. We construct for the first time a concrete manifold which is algorithmically non-recognizable. A strengthened form of Markov's theorem is proved using the combinatorial methods of regular neighbourhoods and handle theory. The proofs coincide for all n≥4. We use Borisov's group with insoluble word problem. It has two generators and twelve relations. The use of this group forms the base for proving the strengthened form of Markov's theorem

  10. Optimization strategies in complex systems

    NARCIS (Netherlands)

    Bussolari, L.; Contucci, P.; Giardinà, C.; Giberti, C.; Unguendoli, F.; Vernia, C.

    2003-01-01

    We consider a class of combinatorial optimization problems that emerge in a variety of domains among which: condensed matter physics, theory of financial risks, error correcting codes in information transmissions, molecular and protein conformation, image restoration. We show the performances of two

  11. Solid-Phase Synthesis of Small Molecule Libraries using Double Combinatorial Chemistry

    DEFF Research Database (Denmark)

    Nielsen, John; Jensen, Flemming R.

    1997-01-01

    The first synthesis of a combinatorial library using double combinatorial chemistry is presented. Coupling of unprotected Fmoc-tyrosine to the solid support was followed by Mitsunobu O-alkylation. Introduction of a diacid linker yields a system in which the double combinatorial step can be demons...

  12. Joint optimization of maintenance, buffers and machines in manufacturing lines

    Science.gov (United States)

    Nahas, Nabil; Nourelfath, Mustapha

    2018-01-01

    This article considers a series manufacturing line composed of several machines separated by intermediate buffers of finite capacity. The goal is to find the optimal number of preventive maintenance actions performed on each machine, the optimal selection of machines and the optimal buffer allocation plan that minimize the total system cost, while providing the desired system throughput level. The mean times between failures of all machines are assumed to increase when applying periodic preventive maintenance. To estimate the production line throughput, a decomposition method is used. The decision variables in the formulated optimal design problem are buffer levels, types of machines and times between preventive maintenance actions. Three heuristic approaches are developed to solve the formulated combinatorial optimization problem. The first heuristic consists of a genetic algorithm, the second is based on the nonlinear threshold accepting metaheuristic and the third is an ant colony system. The proposed heuristics are compared and their efficiency is shown through several numerical examples. It is found that the nonlinear threshold accepting algorithm outperforms the genetic algorithm and ant colony system, while the genetic algorithm provides better results than the ant colony system for longer manufacturing lines.

  13. A stochastic discrete optimization model for designing container terminal facilities

    Science.gov (United States)

    Zukhruf, Febri; Frazila, Russ Bona; Burhani, Jzolanda Tsavalista

    2017-11-01

    As uncertainty essentially affect the total transportation cost, it remains important in the container terminal that incorporates several modes and transshipments process. This paper then presents a stochastic discrete optimization model for designing the container terminal, which involves the decision of facilities improvement action. The container terminal operation model is constructed by accounting the variation of demand and facilities performance. In addition, for illustrating the conflicting issue that practically raises in the terminal operation, the model also takes into account the possible increment delay of facilities due to the increasing number of equipment, especially the container truck. Those variations expectantly reflect the uncertainty issue in the container terminal operation. A Monte Carlo simulation is invoked to propagate the variations by following the observed distribution. The problem is constructed within the framework of the combinatorial optimization problem for investigating the optimal decision of facilities improvement. A new variant of glow-worm swarm optimization (GSO) is thus proposed for solving the optimization, which is rarely explored in the transportation field. The model applicability is tested by considering the actual characteristics of the container terminal.

  14. Solving Dynamic Battlespace Movement Problems Using Dynamic Distributed Computer Networks

    National Research Council Canada - National Science Library

    Bradford, Robert

    2000-01-01

    .... The thesis designs a system using this architecture that invokes operations research network optimization algorithms to solve problems involving movement of people and equipment over dynamic road networks...

  15. A Method for Solving Combinatoral Optimization Problems

    National Research Council Canada - National Science Library

    Ruffa, Anthony A

    2008-01-01

    .... The method discloses that when the boundaries create zones with boundary vertices confined to the adjacent zones, the sets of candidate HPs are found by advancing one zone at a time, considering...

  16. A Biogeography-Based Optimization Algorithm Hybridized with Tabu Search for the Quadratic Assignment Problem.

    Science.gov (United States)

    Lim, Wee Loon; Wibowo, Antoni; Desa, Mohammad Ishak; Haron, Habibollah

    2016-01-01

    The quadratic assignment problem (QAP) is an NP-hard combinatorial optimization problem with a wide variety of applications. Biogeography-based optimization (BBO), a relatively new optimization technique based on the biogeography concept, uses the idea of migration strategy of species to derive algorithm for solving optimization problems. It has been shown that BBO provides performance on a par with other optimization methods. A classical BBO algorithm employs the mutation operator as its diversification strategy. However, this process will often ruin the quality of solutions in QAP. In this paper, we propose a hybrid technique to overcome the weakness of classical BBO algorithm to solve QAP, by replacing the mutation operator with a tabu search procedure. Our experiments using the benchmark instances from QAPLIB show that the proposed hybrid method is able to find good solutions for them within reasonable computational times. Out of 61 benchmark instances tested, the proposed method is able to obtain the best known solutions for 57 of them.

  17. A Biogeography-Based Optimization Algorithm Hybridized with Tabu Search for the Quadratic Assignment Problem

    Science.gov (United States)

    Lim, Wee Loon; Wibowo, Antoni; Desa, Mohammad Ishak; Haron, Habibollah

    2016-01-01

    The quadratic assignment problem (QAP) is an NP-hard combinatorial optimization problem with a wide variety of applications. Biogeography-based optimization (BBO), a relatively new optimization technique based on the biogeography concept, uses the idea of migration strategy of species to derive algorithm for solving optimization problems. It has been shown that BBO provides performance on a par with other optimization methods. A classical BBO algorithm employs the mutation operator as its diversification strategy. However, this process will often ruin the quality of solutions in QAP. In this paper, we propose a hybrid technique to overcome the weakness of classical BBO algorithm to solve QAP, by replacing the mutation operator with a tabu search procedure. Our experiments using the benchmark instances from QAPLIB show that the proposed hybrid method is able to find good solutions for them within reasonable computational times. Out of 61 benchmark instances tested, the proposed method is able to obtain the best known solutions for 57 of them. PMID:26819585

  18. Solving the Traveling Salesman Problem Based on The Genetic Reactive Bone Route Algorithm whit Ant Colony System

    Directory of Open Access Journals (Sweden)

    Majid Yousefikhoshbakht

    2016-07-01

    Full Text Available The TSP is considered one of the most well-known combinatorial optimization tasks and researchers have paid so much attention to the TSP for many years. In this problem, a salesman starts to move from an arbitrary place called depot and after visits all of the nodes, finally comes back to the depot. The objective is to minimize the total distance traveled by the salesman.  Because this problem is a non-deterministic polynomial (NP-hard problem in nature, a hybrid meta-heuristic algorithm called REACSGA is used for solving the TSP. In REACSGA, a reactive bone route algorithm that uses the ant colony system (ACS for generating initial diversified solutions and the genetic algorithm (GA as an improved procedure are applied. Since the performance of the Metaheuristic algorithms is significantly influenced by their parameters, Taguchi Method is used to set the parameters of the proposed algorithm. The proposed algorithm is tested on several standard instances involving 24 to 318 nodes from the literature. The computational result shows that the results of the proposed algorithm are competitive with other metaheuristic algorithms for solving the TSP in terms of better quality of solution and computational time respectively. In addition, the proposed REACSGA is significantly efficient and finds closely the best known solutions for most of the instances in which thirteen best known solutions are also found.

  19. Combinatorial Screening for Transgenic Yeasts with High Cellulase Activities in Combination with a Tunable Expression System.

    Directory of Open Access Journals (Sweden)

    Yoichiro Ito

    Full Text Available Combinatorial screening used together with a broad library of gene expression cassettes is expected to produce a powerful tool for the optimization of the simultaneous expression of multiple enzymes. Recently, we proposed a highly tunable protein expression system that utilized multiple genome-integrated target genes to fine-tune enzyme expression in yeast cells. This tunable system included a library of expression cassettes each composed of three gene-expression control elements that in different combinations produced a wide range of protein expression levels. In this study, four gene expression cassettes with graded protein expression levels were applied to the expression of three cellulases: cellobiohydrolase 1, cellobiohydrolase 2, and endoglucanase 2. After combinatorial screening for transgenic yeasts simultaneously secreting these three cellulases, we obtained strains with higher cellulase expressions than a strain harboring three cellulase-expression constructs within one high-performance gene expression cassette. These results show that our method will be of broad use throughout the field of metabolic engineering.

  20. Secretory Overexpression of Bacillus thermocatenulatus Lipase in Saccharomyces cerevisiae Using Combinatorial Library Strategy.

    Science.gov (United States)

    Kajiwara, Shota; Yamada, Ryosuke; Ogino, Hiroyasu

    2018-04-10

    Simple and cost-effective lipase expression host microorganisms are highly desirable. A combinatorial library strategy is used to improve the secretory expression of lipase from Bacillus thermocatenulatus (BTL2) in the culture supernatant of Saccharomyces cerevisiae. A plasmid library including expression cassettes composed of sequences encoding one of each 15 promoters, 15 secretion signals, and 15 terminators derived from yeast species, S. cerevisiae, Pichia pastoris, and Hansenula polymorpha, is constructed. The S. cerevisiae transformant YPH499/D4, comprising H. polymorpha GAP promoter, S. cerevisiae SAG1 secretion signal, and P. pastoris AOX1 terminator, is selected by high-throughput screening. This transformant expresses BTL2 extra-cellularly with a 130-fold higher than the control strain, comprising S. cerevisiae PGK1 promoter, S. cerevisiae α-factor secretion signal, and S. cerevisiae PGK1 terminator, after cultivation for 72 h. This combinatorial library strategy holds promising potential for application in the optimization of the secretory expression of proteins in yeast. © 2018 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

  1. Combinatorial Screening for Transgenic Yeasts with High Cellulase Activities in Combination with a Tunable Expression System

    Science.gov (United States)

    Ito, Yoichiro; Yamanishi, Mamoru; Ikeuchi, Akinori; Imamura, Chie; Matsuyama, Takashi

    2015-01-01

    Combinatorial screening used together with a broad library of gene expression cassettes is expected to produce a powerful tool for the optimization of the simultaneous expression of multiple enzymes. Recently, we proposed a highly tunable protein expression system that utilized multiple genome-integrated target genes to fine-tune enzyme expression in yeast cells. This tunable system included a library of expression cassettes each composed of three gene-expression control elements that in different combinations produced a wide range of protein expression levels. In this study, four gene expression cassettes with graded protein expression levels were applied to the expression of three cellulases: cellobiohydrolase 1, cellobiohydrolase 2, and endoglucanase 2. After combinatorial screening for transgenic yeasts simultaneously secreting these three cellulases, we obtained strains with higher cellulase expressions than a strain harboring three cellulase-expression constructs within one high-performance gene expression cassette. These results show that our method will be of broad use throughout the field of metabolic engineering. PMID:26692026

  2. Optical tools for high-throughput screening of abrasion resistance of combinatorial libraries of organic coatings

    Science.gov (United States)

    Potyrailo, Radislav A.; Chisholm, Bret J.; Olson, Daniel R.; Brennan, Michael J.; Molaison, Chris A.

    2002-02-01

    Design, validation, and implementation of an optical spectroscopic system for high-throughput analysis of combinatorially developed protective organic coatings are reported. Our approach replaces labor-intensive coating evaluation steps with an automated system that rapidly analyzes 8x6 arrays of coating elements that are deposited on a plastic substrate. Each coating element of the library is 10 mm in diameter and 2 to 5 micrometers thick. Performance of coatings is evaluated with respect to their resistance to wear abrasion because this parameter is one of the primary considerations in end-use applications. Upon testing, the organic coatings undergo changes that are impossible to quantitatively predict using existing knowledge. Coatings are abraded using industry-accepted abrasion test methods at single-or multiple-abrasion conditions, followed by high- throughput analysis of abrasion-induced light scatter. The developed automated system is optimized for the analysis of diffusively scattered light that corresponds to 0 to 30% haze. System precision of 0.1 to 2.5% relative standard deviation provides capability for the reliable ranking of coatings performance. While the system was implemented for high-throughput screening of combinatorially developed organic protective coatings for automotive applications, it can be applied to a variety of other applications where materials ranking can be achieved using optical spectroscopic tools.

  3. Isocyanide based multi component reactions in combinatorial chemistry.

    NARCIS (Netherlands)

    Dömling, A.

    1998-01-01

    Although usually regarded as a recent development, the combinatorial approach to the synthesis of libraries of new drug candidates was first described as early as 1961 using the isocyanide-based one-pot multicomponent Ugi reaction. Isocyanide-based multi component reactions (MCR's) markedly differ

  4. Dynamic Combinatorial Chemistry with Diselenides, Disulfides, Imines and Metal Coordination

    DEFF Research Database (Denmark)

    Sørensen, Anne

    combinatorial chemistry, namely the reversible diselenide exchange reaction. The first part of the thesis describes the development of a thermally induced OAr → SeAr migration reaction. Here, it was proven possible to rearrange a variety of substituted O-aryl selenocarbamates into the corresponding Se...

  5. Dynamic combinatorial chemistry at the phospholipid bilayer interface

    NARCIS (Netherlands)

    Mansfeld, Friederike M.; Au-Yeung, Ho Yu; Sanders, Jeremy K.M.; Otto, Sijbren

    2010-01-01

    Background: Molecular recognition at the environment provided by the phospholipid bilayer interface plays an important role in biology and is subject of intense investigation. Dynamic combinatorial chemistry is a powerful approach for exploring molecular recognition, but has thus far not been

  6. Combinatorial Solid-Phase Synthesis of Balanol Analogues

    DEFF Research Database (Denmark)

    Nielsen, John; Lyngsø, Lars Ole

    1996-01-01

    The natural product balanol has served as a template for the design and synthesis of a combinatorial library using solid-phase chemistry. Using a retrosynthetic analysis, the structural analogues have been assembled from three relatively accessible building blocks. The solid-phase chemistry inclu...

  7. Combinatorial algorithms enabling computational science: tales from the front

    International Nuclear Information System (INIS)

    Bhowmick, Sanjukta; Boman, Erik G; Devine, Karen; Gebremedhin, Assefaw; Hendrickson, Bruce; Hovland, Paul; Munson, Todd; Pothen, Alex

    2006-01-01

    Combinatorial algorithms have long played a crucial enabling role in scientific and engineering computations. The importance of discrete algorithms continues to grow with the demands of new applications and advanced architectures. This paper surveys some recent developments in this rapidly changing and highly interdisciplinary field

  8. Combinatorial structures and processing in neural blackboard architectures

    NARCIS (Netherlands)

    van der Velde, Frank; van der Velde, Frank; de Kamps, Marc; Besold, Tarek R.; d'Avila Garcez, Artur; Marcus, Gary F.; Miikkulainen, Risto

    2015-01-01

    We discuss and illustrate Neural Blackboard Architectures (NBAs) as the basis for variable binding and combinatorial processing the brain. We focus on the NBA for sentence structure. NBAs are based on the notion that conceptual representations are in situ, hence cannot be copied or transported.

  9. Combinatorial chemistry approach to development of molecular plastic solar cells

    NARCIS (Netherlands)

    Godovsky, Dmitri; Inganäs, Olle; Brabec, Christoph J.; Sariciftci, N. Serdar; Hummelen, Jan C.; Janssen, Rene A.J.; Prato, M.; Maggini, M.; Segura, Jose; Martin, Nazario

    1999-01-01

    We used a combinatorial chemistry approach to develop the molecular plastic solar cells based on soluble fullerene derivatives or solubilized TCNQ molecules in combination with conjugated polymers. Profiles, formed by the diffusion of low molecular weight component in the spin-cast polymer host were

  10. Introducing Dynamic Combinatorial Chemistry: Probing the Substrate Selectivity of Acetylcholinesterase

    Science.gov (United States)

    Angelin, Marcus; Larsson, Rikard; Vongvilai, Pornrapee; Ramstrom, Olof

    2010-01-01

    In this laboratory experiment, college students are introduced to dynamic combinatorial chemistry (DCC) and apply it to determine the substrate selectivity of acetylcholinesterase (AChE). Initially, the students construct a chemical library of dynamically interchanging thioesters and thiols. Then, AChE is added and allowed to select and hydrolyze…

  11. Dynamic combinatorial libraries based on hydrogen-bonde molecular boxes

    NARCIS (Netherlands)

    Kerckhoffs, J.M.C.A.; Mateos timoneda, Miguel; Reinhoudt, David; Crego Calama, Mercedes

    2007-01-01

    This article describes two different types of dynamic combinatorial libraries of host and guest molecules. The first part of this article describes the encapsulation of alizarin trimer 2 a3 by dynamic mixtures of up to twenty different self-assembled molecular receptors together with the

  12. Anti-termite efficacy of Capparis decidua and its combinatorial ...

    African Journals Online (AJOL)

    Michael Horsfall

    ABSTRACT: Capparis deciduas and its combinatorial mixtures were evaluated to observe the anti-termite efficacy against Indian white termite Odontotermes obesus. These have shown very high termiticidal activity and wood protection in the soil. It is proved by very low LD50 values i.e. 0.0218mg/g and 0.021mg/g obtained ...

  13. Combinatorial algorithms enabling computational science: tales from the front

    Energy Technology Data Exchange (ETDEWEB)

    Bhowmick, Sanjukta [Mathematics and Computer Science Division, Argonne National Laboratory (United States); Boman, Erik G [Discrete Algorithms and Math Department, Sandia National Laboratories (United States); Devine, Karen [Discrete Algorithms and Math Department, Sandia National Laboratories (United States); Gebremedhin, Assefaw [Computer Science Department, Old Dominion University (United States); Hendrickson, Bruce [Discrete Algorithms and Math Department, Sandia National Laboratories (United States); Hovland, Paul [Mathematics and Computer Science Division, Argonne National Laboratory (United States); Munson, Todd [Mathematics and Computer Science Division, Argonne National Laboratory (United States); Pothen, Alex [Computer Science Department, Old Dominion University (United States)

    2006-09-15

    Combinatorial algorithms have long played a crucial enabling role in scientific and engineering computations. The importance of discrete algorithms continues to grow with the demands of new applications and advanced architectures. This paper surveys some recent developments in this rapidly changing and highly interdisciplinary field.

  14. Some Combinatorial Interpretations and Applications of Fuss-Catalan Numbers

    OpenAIRE

    Lin, Chin-Hung

    2011-01-01

    Fuss-Catalan number is a family of generalized Catalan numbers. We begin by two definitions of Fuss-Catalan numbers and some basic properties. And we give some combinatorial interpretations different from original Catalan numbers. Finally we generalize the Jonah's theorem as its applications.

  15. A Combinatorial Proof of a Result on Generalized Lucas Polynomials

    Directory of Open Access Journals (Sweden)

    Laugier Alexandre

    2016-09-01

    Full Text Available We give a combinatorial proof of an elementary property of generalized Lucas polynomials, inspired by [1]. These polynomials in s and t are defined by the recurrence relation 〈n〉 = s〈n-1〉+t〈n-2〉 for n ≥ 2. The initial values are 〈0〉 = 2; 〈1〉= s, respectively.

  16. Some experience of shielding calculations by combinatorial method

    International Nuclear Information System (INIS)

    Korobejnikov, V.V.; Oussanov, V.I.

    1996-01-01

    Some aspects of the compound systems shielding calculations by a combinatorial approach are discussed. The effectiveness of such an approach is based on the fundamental characteristic of a compound system: if some element of the system have in itself mathematical or physical properties favorable for calculation, these properties may be used in a combinatorial approach and are lost when the system is being calculated in the whole by a direct approach. The combinatorial technique applied is well known. A compound system are being splitting for two or more auxiliary subsystems (so that calculation each of them is a more simple problem than calculation of the original problem (or at last is a soluble problem if original one is not). Calculation of every subsystem are carried out by suitable method and code, the coupling being made through boundary conditions or boundary source. The special consideration in the paper is given to a fast reactor shielding combinatorial analysis and to the testing of the results received. (author)

  17. A combinatorial approximation algorithm for CDMA downlink rate allocation

    NARCIS (Netherlands)

    Boucherie, Richardus J.; Bumb, A.F.; Endrayanto, A.I.; Woeginger, Gerhard; Raghavan, S.; Anandalingam, G.

    2006-01-01

    This paper presents a combinatorial algorithm for downlink rate allocation in Code Division Multiple Access (CDMA) mobile networks. By discretizing the coverage area into small segments, the transmit power requirements are characterized via a matrix representation that separates user and system

  18. A combinatorial approximation algorithm for CDMA downlink rate allocation

    NARCIS (Netherlands)

    Boucherie, Richardus J.; Bumb, A.F.; Endrayanto, A.I.; Woeginger, Gerhard

    2004-01-01

    This paper presents a combinatorial algorithm for downlink rate allocation in Code Division Multiple Access (CDMA) mobile networks. By discretizing the coverage area into small segments, the transmit power requirements are characterized via a matrix representation that separates user and system

  19. A combinatorial enumeration problem of RNA secondary structures

    African Journals Online (AJOL)

    use

    2011-12-21

    Dec 21, 2011 ... interesting combinatorial questions (Chen et al., 2005;. Liu, 2006; Schmitt and Waterman 1994; Stein and. Waterman 1978). The research on the enumeration of. RNA secondary structures becomes one of the hot topics in Computational Molecular Biology. An RNA molecule is described by its sequences of.

  20. A Game Theoretical Approach for Solving Winner Determination Problems

    Directory of Open Access Journals (Sweden)

    Chen-Kun Tsung

    2014-01-01

    Full Text Available Determining the winners in combinatorial auctions to maximize the auctioneer's revenue is an NP-complete problem. Computing an optimal solution requires huge computation time in some instances. In this paper, we apply three concepts of the game theory to design an approximation algorithm: the stability of the Nash equilibrium, the self-learning of the evolutionary game, and the mistake making of the trembling hand assumption. According to our simulation results, the proposed algorithm produces near-optimal solutions in terms of the auctioneer's revenue. Moreover, reasonable computation time is another advantage of applying the proposed algorithm to the real-world services.