Solving Mixed Integer Nonlinear Chemical Engineering Problems via Simulated Annealing Approach
|
|
- Dale Bradford
- 7 years ago
- Views:
Transcription
1 Y. ÖZÇELIK and Z. ÖZÇELIK, Solving Mied Integer Nonlinear Chemical, Chem. Biochem. Eng. Q. 8 (4) 9 5 (004) 9 Solving Mied Integer Nonlinear Chemical Engineering Problems via Simulated Annealing Approach Y. Özçelik and Z. Özçelik Ege Universit, Engineering Facult, Chemical Engineering Department, Bornova Izmir, urke, el: / 488; Fa: ; E mail: ozcelik@eng.ege.edu.tr; zozcelik@bornova.ege.edu.tr Original scientific paper Received: September 5, 00 Accepted: Ma 4, 004 he optimization models of chemical engineering processes are generall nonlinear and mied integer, nonlinear in structure, and contain several equalit and inequalit constraints and bounds on variables. Mied Integer Nonlinear programming problems (MINLP) can be solved using either gradient methods or stochastic methods. Gradient methods need to separate the problem to Mied Integer Linear Programming (MILP) and Nonlinear Programming (NLP) problems and some special formulations where the continuit or conveit has to be imposed. In this work, an algorithm (SARAN) that was based on a simulated annealing algorithm of Corana was developed to solve MINLP problems. hen the algorithm and some alternatives for the basic steps of a simulated annealing were tested for 00 sequences of pseudo random numbers using MINLP test problems. Finall the results were compared with the results of the M SIMPSA for small and medium scaled problems. Ke words: Mied Integer Nonlinear Programming, Nonlinear Optimization, Simulated Annealing Introduction here are two main approaches to solve NLP and MINLP problems. Gradient Approach Stochastic Approach Various gradient algorithms have been described in the literature. he common propert of deterministic algorithms,4 is to separate the original MINLP problems into sub problems. On the other hand stochastic methods do not necessaril separate the problem into sub problems. However, various problem independent heuristics related to search interval compression and epansion and to shifting strategies are required for their effectiveness. Also these methods require the application of successive relaations, which ma substantiall increase the effort in identifing feasible regions and obtaining the global optimum. he simulated annealing algorithm is also a stochastic method based on stochastic generation of solution vectors and emplo similarities between the phsical processes of annealing and the optimisation problems. he phsical process of annealing he aim of the process is to find the atomic configuration that minimizes internal energ. For a given configuration, a random move is carried out b randoml picking a molecule and moving it in a random direction for a random distance. he new configuration is then accepted or rejected according to an acceptance criterion, based on the Boltzman function, (): p E k e B () where E is the change in the energ of the configurations, k B is the Boltzman constant, and is the temperature of the sstem. he acceptance of a new configuration depends on E and temperature. is reduced to reach a lower energ state. he low temperature is not a sufficient condition to find ground states of matter. he cooling process should be accomplished slowl, otherwise the resulting crstal will have man defects or the substance ma form a glass with no crstalline order. Optimisation b simulated annealing In simulated annealing, the value of the objective function is analogous to the energ of the sstem and the aim is to minimize the value of the objective function, where the values of the continuous and discrete variables represent a particular configuration of the sstem. he behaviour of the sstem,
2 0 Y. ÖZÇELIK and Z. ÖZÇELIK, Solving Mied Integer Nonlinear Chemical, Chem. Biochem. Eng. Q. 8 (4) 9 5 (004) subject to such a neighbourhood move is determined from the value of the two successive values of the objective function. here are two important approaches in the application of the simulated annealing to the continuous variables. he hbrid of random search and acceptance rejection criteria of simulated annealing algorithms. he hbrid of simulated annealing algorithm and nonlinear simple algorithm Both of these two approaches have the following critical steps. Estimation of the initial temperature of the sstem. Acceptance of points generated. Cooling Schedule ermination of the constant temperature process and termination of the cooling process Dealing with constraints Simulated annealing algorithms can be developed using alternative schemes for these critical steps. Initial value of temperature An initial value of the annealing temperature for a phsical process of annealing and optimization algorithms are based on annealing as an effective parameter for the optimisation path. he value of the initial temperature for a phsical process depends on the properties of the sstem and can be estimated eperimentall. Analogousl, the initial value of the temperature for an optimisation problem is estimated b the observation of the behaviour of the problem using a specified time, determined eperimentall. he alternative schemes are available to estimate the initial temperature. Some of them were used in this work. Prosenjit and Diwekar 5 proposed an temperature value that satisfies the following inequalit () as the initial temperature: F k e B 08. () he vector F is obtained b evaluating the change in the objective function value for a large number (e.g., 00) of neighbourhood moves. his procedure has been applied to the optimal design problem of heat echangers. Aarst and Korst 6 and Aarst and Van Laarhoven 7 proposed an temperature value that satisfies the following equalit () as the initial temperature. f i m 095. m e m m () m and m are the number of successful and unsuccessful moves, respectivel. f + is the average increase in the objective function value for m. he total number of moves to determine an initial temperature is proposed as 00 N. For eample, (0 5 ) ma be proposed as a starting point of the temperature to determine the initial temperature. Acceptance criteria wo tpes of acceptance criteria have been proposed in literature. Metropolis algorithm accepts all downhill moves. It accepts uphill moves with a probabilit p which depends on temperature and the change of the objective function values evaluated in successive iterations (4). Metropolis accepts all the moves with a probabilit of at high temperatures. F 0 F 0 p F (4) pe he method of a nonequilibrium Metropolis accepts uphill moves with a probabilit p which depends on temperature and the change of the objective function values evaluated in successive iterations similar to the Metropolis algorithm. Additionall, the inner loop of the annealing algorithm is terminated and cooling is applied when a downhill move occurs in the objective function. he Glauber algorithm accepts all moves at a high temperature with 0.5 probabilities (5). If the temperature is reduced, the probabilit acceptance of downhill moves remains constant at in the Metropolis algorithm. he value of probabilit increases from 0.5 to in the Glauber algorithm. On the other hand, the acceptance probabilit of an uphill move decreases from 0.5 to 0 in the Glauber algorithm, Annealing schedule e p e F F (5) wo tpes of annealing schedules have been proposed. he eponential tpe cooling schedule, 8 where a constant multiplicative factor is emploed, can be used to obtain a new temperature (6).
3 Y. ÖZÇELIK and Z. ÖZÇELIK, Solving Mied Integer Nonlinear Chemical, Chem. Biochem. Eng. Q. 8 (4) 9 5 (004) k k (6) is a temperature decrement factor which lies in the range of 0. Aarst and Van Laarhoven 7 proposed an alternating cooling schedule. (7) k k ln( ) k ( ) k (7) ( k ) is the standard deviation of the objective function at k. is the speed parameter ling on the range of 0. he value of varies depending on the equilibrium or the nonequilibrium application of Simulated Annealing with an order of 0 (0.0, 0). ermination criteria for constant temperature step and cooling step he constant number of moves or nonequilibrium comes together when constant number of moving approach can be used for the constant temperature step. In this approach, if the new function value is lower than the previous one, temperature is reduced without reaching equilibrium; otherwise the approach of constant number of moves is applied. he process of cooling can be terminated using the following criteria he constant number of temperature levels k (8) df ( ) (9) d F ( ) C can t be improved for several temperature levels. Dealing with constraints he Cardosa Approach. All infeasible points are penalized assuming a ver large positive value for a minimization problem or a ver large negative value, otherwise. 9 he method is an infeasible path method. his means that infeasible points ma be replaced b the new infeasible points, ecept that the are now centred on the best verte and obe all bound constraints. A feasible path method ma be used. his means, that feasible points ma be replaced b feasible points, and the objective function is evaluated onl for the feasible points. his approach ma lead to inaccurate results. Procedure and results In this work, an algorithm based on the algorithm of Corona, was developed. he algorithm of Corona was used to solve unconstrained problems. his algorithm was modified to solve constrained MINLP problems, and MINLP problems were used to test the criteria that were used in the basic steps of the algorithm. hen these problems were utilised to compare the performance of the algorithm with the algorithm of M SIMPSA for MINLP problems. he 9 test problems of Cardosa et al and test problems of Duran 4 and the initial values for these problems, are given below.. (M. F. Cardosa et al. and is also given in Kocis and Grossmann, Floudas et al. 0 and Roo and Sahinidis ). here is a local optimum at {,, Z} = {0,.8,.6} and nonconveities arise in the first constraint. he global optimum is at (,, Z} = {,0.5,} Minimize Z L0 LU { 0,}. (M. F. Cardosa et al. and is also given in Kocis and Grossmann and Salcedo et al. ). he global optimum is at (,,, Z} = {,.75, 0.75,.4}. Minimize Z e ( ) 0 0 L (., 05 0) U (. 40, ) LU { 0,}. (M. F. Cardosa et al. and is also given in Floudas et al. 0 ). here are nonconveities because of the first constraint. he global optimum is at (,,, Z} = {, ,.,.07654}. Minimize Z07. 5( 05. ) 08. e ( 0. ) L (., ) U (, ) LU { 0,} 4.(M. F. Cardosa et al. and is also given in Kocis and Grossmann, Floudas et al. 0, Salcedo and Roo and Sahinidis ). here are nonconveities because of the equalit constraints. he global optimum is at (,,, Z} = {0,,, }
4 Y. ÖZÇELIK and Z. ÖZÇELIK, Solving Mied Integer Nonlinear Chemical, Chem. Biochem. Eng. Q. 8 (4) 9 5 (004) Minimize Z L {, 00) L { 0,} 5. (M. F. Cardosa et al. and is also given in Kocis and Grossmann, Diwekar et al. and Diwekar and Rubin 4 ). It is related to the selection among two candidate reactors for minimizing the cost of producing a desired product. he global optimum is at (,,,, Z} = {0,,, } Minimize Z e ) e ) L ( ; ; ; ; ; ; ) U ( 0; 0; 40; 0; 0; 0; 0) LU { 0,} 6. (M. F. Cardosa et al. and is also given in Salcedo ). his represents a quadratic capital budgeting problem. It has four binar variables and features bilinear terms in the objective function. he global optimum is at (,,, 4, Z} = {0, 0,,, 6} Minimize Z( 4 )( 564 ) 4 0 { 0,} (M. F. Cardosa et al. and was also given in Yuan et al. 5, Floudas et al. 0, Salcedo and Roo and Sahinidis ). It has nonlinearities in, both, the continuous and binar variables. he global optimum is at (,,, 4,,,, Z} = {,, 0,, 0., 0.8, , } Minimize Z( ) ( ) ( ) log( 4) ( ) ( ) ( ) L ( 000, ; ) U (.;., 8 5.) LU { 0,} 4 8. (M. F. Cardosa et al. and is also given in Berman and Ashrafi 6 ). he global optimum is at (,,, 4, 5, 6, 7, 8, Z} = {0,,,, 0,,, 0, 0.964} Minimize Z L ( 000, ; ) U (;; ) LU { 0,} 8 9. (M. F. Cardosa et al. and is also given in Wong 7 ). he global optimum is at (,,, Z} = {78, 7, 7, 7.4} Maimize Z aaaa4 5a5a6a7a8 90
5 Y. ÖZÇELIK and Z. ÖZÇELIK, Solving Mied Integer Nonlinear Chemical, Chem. Biochem. Eng. Q. 8 (4) 9 5 (004) 6 a9 a0 a a 0 L ( 7, 7, 7) U ( ,, ) L,, U L ( 78, 78) U ( 0, 0) L U 0. (Marco A. Duran and Ignacio E. Grossmann 4 ). It is related to a snthesizing process. It is the one of simultaneousl determining the optimal structure and operating parameters for a chemical process. Minimize Z ln( ) 9. ln( ) ln( ) 096. ln( ) ln( ). ln( ) L ( 000,, ) U ( 000,, ) LU 0 ( 0,,) properties of simulated annealing. aking this risk into account the proposed algorithm can be handled as an alternative approach to solve constrained MINLP problems. he basic steps of the algorithm that was shown schematicall in figure are eplained below:. (Marco A. Duran and Ignacio E. Grossmann 4 ). his is related to a snthesizing process. Minimaze Z e e ( /. ) 65log( 4 ) 90log( 5) 80log( ) e e / (. 5 ) ( 5. ) (/.) L ( ; ; ; ; ; ; ; ; ) 5 U ( ; ; ; ; ; ; ; ; ) LU Fig. he flowsheet of the proposed algorithm Discussion M SIMPSA is a hbrid of the simulated annealing and nonlinear simple and has a potential risk to reach the global optimum. For, the simple moves ma actuall destro the global convergence. he initial value of the pseudo temperature: he initial value was determined b using the method of Aarst and Korst. 6 he performance of this method was compared with the method of Prosenjit and Diwekar, 5 and the calculated ratios between the initial pseudo temperatures, the number of functions evaluated, and the error % com-
6 4 Y. ÖZÇELIK and Z. ÖZÇELIK, Solving Mied Integer Nonlinear Chemical, Chem. Biochem. Eng. Q. 8 (4) 9 5 (004) pared with the values of the objective function in global minimum, are given in table. he initial values of the pseudo temperatures calculated b the method of Aarst and Korst 6 were greater than the others. herefore, this method causes the evaluations of more functions. If onl these parameters are considered, the method of Prosenjit and Diwekar 5 has an advantage over the method of Aarst and Korst. 6 But the low initial values of pseudo temperatures caused to converge to a local minimum (Problem 6). able he ratios for initial temperatures and number of functions evaluated and errors compared with the values of the objective function in global minimum Error Problem ia / ip N A /N P e A /% Error e P /% ferred to decide the acceptance of the new point generated. he nonequilibrium Metropolis algorithm prevented the computational burden of the algorithm for test problems. Although the nonequilibrium Metropolis algorithm can lead to local optima this effect has not been observed for the test problems in this work. 4. Dealing with constraints: he constrained problems are transformed into the unconstrained ones using the following penalizing scheme, 8 F(, M) f ( ) m n M [ma( 0, g,( ))] h j ( ) i j () M is a positive penalt parameter. he value of the penalt parameter can ideall affect the convergence. M = 00 gave good results for the test problems. he algorithm is an infeasible path method and uses all of the perturbed function values. 5. ermination criteria: he constant number of moves and constant number of step adjustment approaches, that were used, depend on the number of variables used for constant temperature search. he number of moves = 5 * the number of variables he number of step adjustment = 5 * the number of variables Otherwise, the relation (9) was used to terminate the cooling process. he method of Corona was used to adjust the value of the step reduction at the end of inner loop. 6. Annealing scheduling: he method of Aarst and Van Laarhoven 6 (7) was used to reduce the pseudo temperature of the problem.. Generation of a new point: In the second step of the algorithm, the test points were generated using the following relations. r e i i v mh h i LB IN( usr v) (0) i is the current optimum for the continuous variables, r and u are random numbers in the intervals05.,. 05and 0,, respectivel. e h is the vector of the h th coordinate direction and v mh is the component of the step vector (v m ) along the same direction. LB and sr is the vector of the lower bounds and search region for discrete variables.. he acceptance of the point generated: he method of nonequilibrium Metropolis was pre- Conclusions An algorithm was proposed for MINLP problems. It was based on the algorithm of Corona that can solve onl unconstrained continuous problems. he nonequilibrium Metropolis method 9 and a penalizing scheme were also adapted to prevent computational burden and to improve the reliabilit of the algorithm, respectivel. he proposed algorithm was applied to solve several MINLP test functions published in literature. he performance of the algorithm is comparable with the performance of the M SIMPSA for all ill conditioned problems. he average number of function evaluations for 00 runs, and success percentages for eleven ill-conditioned MINLP test problems, are given in table.
7 Y. ÖZÇELIK and Z. ÖZÇELIK, Solving Mied Integer Nonlinear Chemical, Chem. Biochem. Eng. Q. 8 (4) 9 5 (004) 5 able he fraction of successes and the average number of function evolutions (he success fractions (%) were given for feasible path and infeasible path alternatives of M SIMPSA) Problem he value for speed parameter was a constant of 0.0 for all problems. his speed value provides convergence to problems 5, 7, 9 to a local minimum in 0, 0 and 6 times respectivel per 00 runs. he convergence times were increased to 9, 00, 00 for these problems reducing the value of speed parameter to , 0.00 and , respectivel. he computer program developed in this work, besides running the proposed algorithm based on mentioned criteria, is open in the user interface to tr different criteria for the basic steps and compare with the structure given in this paper. Nomenclature M Simpsa Saran N F success N F success e A Accurac of convergence to the global minimum for Aarst and Korst 5 criteria, % e D Accurac of convergence to the global minimum for Diwekar method, % e NEM Accurac of convergence to the global minimum for nonequilibrium method, % MINLP Mied Integer NonLinear Programming N Number of variables N A he number of function evaluations in Aarst and Korst 5 procedure in determining initial annealing temperature N Aarst he number of function evaluations in Aarst and Korst 5 procedure in reducing annealing temperature. N CR he number of function evaluations in constant region reduction method N D he number of function evaluations in the method of Diwekar to determine initial values of annealing temperatures N F N Feasible N Infeasible he number of function evaluations he number of function evaluations in the feasible path procedure he number of function evaluations in the infeasible path a procedure N KirkPatrick he number of function evaluations in the method of Kirkpatrick in reducing annealing temperatures N M he number of function evaluations in the method of Metropolis in accepting the points generated N NEM he number of function evaluations in the method of nonequilibrium Metropolis in accepting the points generated NESA Nonequilibrium Simulated Annealing NLP Nonlinear Programming i A he initial value of Pseudo annealing temperature when the method of Aarst and Korst 6 was applied i D he initial value of Pseudo annealing temperature when the method of Diwekar was applied E he change in the energ of the sstem F he change in the value of objective function References. Corona, A. et al., ACM ransactions on Mathematical Software, () (987) 6.. Margarida F. Cardosa et al., Computers and Chem. Engng., () (997) 49.. Kocis, G. R., Grossmann, I. E., Ind. Engng. Chem. Res., 7 (988) Marco A. Duran, Ignacio E. Grossmann, Mathematical Programming 6 (986) Prosenjit D. Chaudhuri, Urmila M. Diwekar, Ind. Engng. Chem. Res., 6 (997) Aarst E., Korst, Simulated Annealing and Boltzmann Machines-a Stochastic Approach to Combinatorial Optimisation and Neural Computers. Wile, New York, Aarst E. H. L., Van Laarhoven P. J. M., (985), Philips J. Res., 40 (985) S. Kirkpatrick et al., Science, 0 (4598) Margarida F. Cardosa et al., Optimisation Computers Chem. Engng. 0 (9) (996) Floudas et al., Computers and. Chem. Engng. (0) (989) 7.. Roo, H. S., Sahinidis. N. V., Computers and Chemical. Engineering, 9 (5) 55.. Salcedo, R. L., Ind. Engng. Chem. Res., () 6.. Diwekar, U. M. et al., Ind. Engng. Chem. Res. (99). 4. Diwekar, U. M., Rubin, E. S., Ind. Engng. Chem. Res. (9) (99) Yuan, X. et al., Une Methode D optimization Nonlineaire en Variables Mites Pour la Conception de ProcPdes, RAIRO oper. Res Berman, O., Ashrafi, N., IEEE rans. Soft. Eng. 9 (99) Wong, J., COED J. 0 (990) Yiping W., Luke E.K., Computers and. Chem. Engng. 6 (00) 45.
Generator Maintenance Scheduling Of Power System Using Hybrid Technique
Generator Maintenance Scheduling Of Power Sstem Using Hbrid Technique Suraj Kumhar 1, Mantosh Kumar 2 1M.Tech Scholar, Mewar Universit, Chittorgarh, Rajasthan, India 2Assistant Professor, Mewar Universit,
More informationInteger Programming: Algorithms - 3
Week 9 Integer Programming: Algorithms - 3 OPR 992 Applied Mathematical Programming OPR 992 - Applied Mathematical Programming - p. 1/12 Dantzig-Wolfe Reformulation Example Strength of the Linear Programming
More informationPerformance Optimization of I-4 I 4 Gasoline Engine with Variable Valve Timing Using WAVE/iSIGHT
Performance Optimization of I-4 I 4 Gasoline Engine with Variable Valve Timing Using WAVE/iSIGHT Sean Li, DaimlerChrysler (sl60@dcx dcx.com) Charles Yuan, Engineous Software, Inc (yuan@engineous.com) Background!
More informationSpin-lattice and spin-spin relaxation
Spin-lattice and spin-spin relaation Sequence of events in the NMR eperiment: (i) application of a 90 pulse alters the population ratios, and creates transverse magnetic field components (M () ); (ii)
More informationThe QOOL Algorithm for fast Online Optimization of Multiple Degree of Freedom Robot Locomotion
The QOOL Algorithm for fast Online Optimization of Multiple Degree of Freedom Robot Locomotion Daniel Marbach January 31th, 2005 Swiss Federal Institute of Technology at Lausanne Daniel.Marbach@epfl.ch
More informationOPTIMIZATION TECHNIQUES AND AN INTRODUCTION TO GENETIC ALGORITHMS AND SIMULATED ANNEALING Dr. T. Ghose Dept. of EEE BIT, Mesra
OPTIMIZATION TECHNIQUES AND AN INTRODUCTION TO GENETIC ALGORITHMS AND SIMULATED ANNEALING Dr. T. Ghose Dept. of EEE BIT, Mesra INTRODUCTION:: Almost any problem in the design, operation, and analysis of
More informationLESSON EIII.E EXPONENTS AND LOGARITHMS
LESSON EIII.E EXPONENTS AND LOGARITHMS LESSON EIII.E EXPONENTS AND LOGARITHMS OVERVIEW Here s what ou ll learn in this lesson: Eponential Functions a. Graphing eponential functions b. Applications of eponential
More informationSolving convex MINLP problems with AIMMS
Solving convex MINLP problems with AIMMS By Marcel Hunting Paragon Decision Technology BV An AIMMS White Paper August, 2012 Abstract This document describes the Quesada and Grossman algorithm that is implemented
More informationCHAPTER 1 INTRODUCTION
CHAPTER 1 INTRODUCTION Power systems form the largest man made complex system. It basically consists of generating sources, transmission network and distribution centers. Secure and economic operation
More information1. a. standard form of a parabola with. 2 b 1 2 horizontal axis of symmetry 2. x 2 y 2 r 2 o. standard form of an ellipse centered
Conic Sections. Distance Formula and Circles. More on the Parabola. The Ellipse and Hperbola. Nonlinear Sstems of Equations in Two Variables. Nonlinear Inequalities and Sstems of Inequalities In Chapter,
More informationSection 7.2 Linear Programming: The Graphical Method
Section 7.2 Linear Programming: The Graphical Method Man problems in business, science, and economics involve finding the optimal value of a function (for instance, the maimum value of the profit function
More informationNonlinear Optimization: Algorithms 3: Interior-point methods
Nonlinear Optimization: Algorithms 3: Interior-point methods INSEAD, Spring 2006 Jean-Philippe Vert Ecole des Mines de Paris Jean-Philippe.Vert@mines.org Nonlinear optimization c 2006 Jean-Philippe Vert,
More information1.6. Piecewise Functions. LEARN ABOUT the Math. Representing the problem using a graphical model
. Piecewise Functions YOU WILL NEED graph paper graphing calculator GOAL Understand, interpret, and graph situations that are described b piecewise functions. LEARN ABOUT the Math A cit parking lot uses
More informationIndex Terms- Batch Scheduling, Evolutionary Algorithms, Multiobjective Optimization, NSGA-II.
Batch Scheduling By Evolutionary Algorithms for Multiobjective Optimization Charmi B. Desai, Narendra M. Patel L.D. College of Engineering, Ahmedabad Abstract - Multi-objective optimization problems are
More informationWater networks security: A two-stage mixed-integer stochastic program for sensor placement under uncertainty
Computers and Chemical Engineering 31 (2007) 565 573 Water networks security: A two-stage mixed-integer stochastic program for sensor placement under uncertainty Vicente Rico-Ramirez a,, Sergio Frausto-Hernandez
More informationINVESTIGATIONS AND FUNCTIONS 1.1.1 1.1.4. Example 1
Chapter 1 INVESTIGATIONS AND FUNCTIONS 1.1.1 1.1.4 This opening section introduces the students to man of the big ideas of Algebra 2, as well as different was of thinking and various problem solving strategies.
More informationSimulation of Electromagnetic Leakage from a Microwave Oven
Simulation of Electromagnetic Leakage from a Microwave Oven Ana Maria Rocha (1), Margarida Facão (), João Pedro Sousa (3), António Viegas (4) (1) Departamento de Física, Universidade de Aveiro, Teka Portugal
More informationFunctions and Graphs CHAPTER INTRODUCTION. The function concept is one of the most important ideas in mathematics. The study
Functions and Graphs CHAPTER 2 INTRODUCTION The function concept is one of the most important ideas in mathematics. The stud 2-1 Functions 2-2 Elementar Functions: Graphs and Transformations 2-3 Quadratic
More informationLinear Inequality in Two Variables
90 (7-) Chapter 7 Sstems of Linear Equations and Inequalities In this section 7.4 GRAPHING LINEAR INEQUALITIES IN TWO VARIABLES You studied linear equations and inequalities in one variable in Chapter.
More informationInternational Journal of Emerging Technologies in Computational and Applied Sciences (IJETCAS) www.iasir.net
International Association of Scientific Innovation and Research (IASIR) (An Association Unifying the Sciences, Engineering, and Applied Research) International Journal of Emerging Technologies in Computational
More informationGaussian Probability Density Functions: Properties and Error Characterization
Gaussian Probabilit Densit Functions: Properties and Error Characterization Maria Isabel Ribeiro Institute for Sstems and Robotics Instituto Superior Tcnico Av. Rovisco Pais, 1 149-1 Lisboa PORTUGAL {mir@isr.ist.utl.pt}
More informationOverview of Mixed-integer Nonlinear Programming
Overview of Mied-integer Nonlinear Programming Ignacio E. Grossmann Center for Advanced Process Decision-maing Department of Chemical Engineering Carnegie Mellon Universit Pittsburgh PA 15213 Outline MINLP
More informationMore Equations and Inequalities
Section. Sets of Numbers and Interval Notation 9 More Equations and Inequalities 9 9. Compound Inequalities 9. Polnomial and Rational Inequalities 9. Absolute Value Equations 9. Absolute Value Inequalities
More informationLecture 3. Linear Programming. 3B1B Optimization Michaelmas 2015 A. Zisserman. Extreme solutions. Simplex method. Interior point method
Lecture 3 3B1B Optimization Michaelmas 2015 A. Zisserman Linear Programming Extreme solutions Simplex method Interior point method Integer programming and relaxation The Optimization Tree Linear Programming
More informationAPPLICATION OF MODIFIED (PSO) AND SIMULATED ANNEALING ALGORITHM (SAA) IN ECONOMIC LOAD DISPATCH PROBLEM OF THERMAL GENERATING UNIT
International Journal of Electrical Engineering & Technology (IJEET) Volume 7, Issue 2, March-April, 2016, pp.69 78, Article ID: IJEET_07_02_008 Available online at http:// http://www.iaeme.com/ijeet/issues.asp?jtype=ijeet&vtype=7&itype=2
More informationOverview of Industrial Batch Process Scheduling
CHEMICAL ENGINEERING TRANSACTIONS Volume 21, 2010 Editor J. J. Klemeš, H. L. Lam, P. S. Varbanov Copyright 2010, AIDIC Servizi S.r.l., ISBN 978-88-95608-05-1 ISSN 1974-9791 DOI: 10.3303/CET1021150 895
More informationAnnealing Techniques for Data Integration
Reservoir Modeling with GSLIB Annealing Techniques for Data Integration Discuss the Problem of Permeability Prediction Present Annealing Cosimulation More Details on Simulated Annealing Examples SASIM
More informationTutorial: Operations Research in Constraint Programming
Tutorial: Operations Research in Constraint Programming John Hooker Carnegie Mellon University May 2009 Revised June 2009 May 2009 Slide 1 Motivation Benders decomposition allows us to apply CP and OR
More informationThe Multi-Item Capacitated Lot-Sizing Problem With Safety Stocks In Closed-Loop Supply Chain
International Journal of Mining Metallurgy & Mechanical Engineering (IJMMME) Volume 1 Issue 5 (2013) ISSN 2320-4052; EISSN 2320-4060 The Multi-Item Capacated Lot-Sizing Problem Wh Safety Stocks In Closed-Loop
More informationChemical Processes Optimization. Prof. Cesar de Prada Dpt. of Systems Engineering and Automatic Control (ISA) UVA prada@autom.uva.
Chemical Processes Optimization Prof. Cesar de Prada Dpt. of Systems Engineering and Automatic Control (ISA) UVA prada@autom.uva.es Chemical Processes Optimization Compulsory, 5th year Chemical Eng. Code
More informationCross-validation for detecting and preventing overfitting
Cross-validation for detecting and preventing overfitting Note to other teachers and users of these slides. Andrew would be delighted if ou found this source material useful in giving our own lectures.
More informationOptimization Modeling for Mining Engineers
Optimization Modeling for Mining Engineers Alexandra M. Newman Division of Economics and Business Slide 1 Colorado School of Mines Seminar Outline Linear Programming Integer Linear Programming Slide 2
More informationIntroduction to Process Optimization
Chapter 1 Introduction to Process Optimization Most things can be improved, so engineers and scientists optimize. While designing systems and products requires a deep understanding of influences that achieve
More informationVariable Neighbourhood Search for the Global Optimization of Constrained NLPs
ProceedingsofGO2005,pp.1 5. Variable Neighbourhood Search for the Global Optimization of Constrained NLPs LeoLiberti, 1 andmilandražić 2 1 DEI,PolitecnicodiMilano,P.zzaL.daVinci32,20133Milano,Italy, liberti@elet.polimi.it
More informationSimulation-based Optimization Approach to Clinical Trial Supply Chain Management
20 th European Symposium on Computer Aided Process Engineering ESCAPE20 S. Pierucci and G. Buzzi Ferraris (Editors) 2010 Elsevier B.V. All rights reserved. Simulation-based Optimization Approach to Clinical
More information2014-2015 The Master s Degree with Thesis Course Descriptions in Industrial Engineering
2014-2015 The Master s Degree with Thesis Course Descriptions in Industrial Engineering Compulsory Courses IENG540 Optimization Models and Algorithms In the course important deterministic optimization
More information5.2 Inverse Functions
78 Further Topics in Functions. Inverse Functions Thinking of a function as a process like we did in Section., in this section we seek another function which might reverse that process. As in real life,
More informationOptimization of Preventive Maintenance Scheduling in Processing Plants
18 th European Symposium on Computer Aided Process Engineering ESCAPE 18 Bertrand Braunschweig and Xavier Joulia (Editors) 2008 Elsevier B.V./Ltd. All rights reserved. Optimization of Preventive Maintenance
More informationIntroduction: Models, Model Building and Mathematical Optimization The Importance of Modeling Langauges for Solving Real World Problems
Introduction: Models, Model Building and Mathematical Optimization The Importance of Modeling Langauges for Solving Real World Problems Josef Kallrath Structure of the Lecture: the Modeling Process survey
More information[1a] Bienstock D., Computational study of a family of mixed integer quadratic programming problems, Math. Programming 74 (1996), 121 140
6. Bibliografia 6.1. Riferimenti bibliografici [1a] Bienstock D., Computational study of a family of mixed integer quadratic programming problems, Math. Programming 74 (1996), 121 140 [2a] Chang T.J.,
More informationSpeech at IFAC2014 BACKGROUND
Speech at IFAC2014 Thank you Professor Craig for the introduction. IFAC President, distinguished guests, conference organizers, sponsors, colleagues, friends; Good evening It is indeed fitting to start
More informationsin(θ) = opp hyp cos(θ) = adj hyp tan(θ) = opp adj
Math, Trigonometr and Vectors Geometr 33º What is the angle equal to? a) α = 7 b) α = 57 c) α = 33 d) α = 90 e) α cannot be determined α Trig Definitions Here's a familiar image. To make predictive models
More informationSo, using the new notation, P X,Y (0,1) =.08 This is the value which the joint probability function for X and Y takes when X=0 and Y=1.
Joint probabilit is the probabilit that the RVs & Y take values &. like the PDF of the two events, and. We will denote a joint probabilit function as P,Y (,) = P(= Y=) Marginal probabilit of is the probabilit
More informationFINAL EXAM REVIEW MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.
FINAL EXAM REVIEW MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. Determine whether or not the relationship shown in the table is a function. 1) -
More informationInternational Journal of Advanced Research in Electrical, Electronics and Instrumentation Engineering
DOI: 10.15662/ijareeie.2014.0307061 Economic Dispatch of Power System Optimization with Power Generation Schedule Using Evolutionary Technique Girish Kumar 1, Rameshwar singh 2 PG Student [Control system],
More information7.3 Solving Systems by Elimination
7. Solving Sstems b Elimination In the last section we saw the Substitution Method. It turns out there is another method for solving a sstem of linear equations that is also ver good. First, we will need
More informationPATTERN RECOGNITION AND MACHINE LEARNING CHAPTER 4: LINEAR MODELS FOR CLASSIFICATION
PATTERN RECOGNITION AND MACHINE LEARNING CHAPTER 4: LINEAR MODELS FOR CLASSIFICATION Introduction In the previous chapter, we explored a class of regression models having particularly simple analytical
More informationA joint control framework for supply chain planning
17 th European Symposium on Computer Aided Process Engineering ESCAPE17 V. Plesu and P.S. Agachi (Editors) 2007 Elsevier B.V. All rights reserved. 1 A joint control framework for supply chain planning
More informationResearch on the Performance Optimization of Hadoop in Big Data Environment
Vol.8, No.5 (015), pp.93-304 http://dx.doi.org/10.1457/idta.015.8.5.6 Research on the Performance Optimization of Hadoop in Big Data Environment Jia Min-Zheng Department of Information Engineering, Beiing
More informationSolving Absolute Value Equations and Inequalities Graphically
4.5 Solving Absolute Value Equations and Inequalities Graphicall 4.5 OBJECTIVES 1. Draw the graph of an absolute value function 2. Solve an absolute value equation graphicall 3. Solve an absolute value
More informationA New Approach for Efficient Rescheduling of Multiproduct Batch Plants
4228 Ind. Eng. Chem. Res. 2000, 39, 4228-4238 A New Approach for Efficient Rescheduling of Multiproduct Batch Plants Jeetmanyu P. Vin and Marianthi G. Ierapetritou* Department of Chemical and Biochemical
More informationOptimized Software Component Allocation On Clustered Application Servers. by Hsiauh-Tsyr Clara Chang, B.B., M.S., M.S.
Optimized Software Component Allocation On Clustered Application Servers by Hsiauh-Tsyr Clara Chang, B.B., M.S., M.S. Submitted in partial fulfillment of the requirements for the degree of Doctor of Professional
More informationTOMLAB - For fast and robust largescale optimization in MATLAB
The TOMLAB Optimization Environment is a powerful optimization and modeling package for solving applied optimization problems in MATLAB. TOMLAB provides a wide range of features, tools and services for
More informationSTIFFNESS OF THE HUMAN ARM
SIFFNESS OF HE HUMAN ARM his web resource combines the passive properties of muscles with the neural feedback sstem of the short-loop (spinal) and long-loop (transcortical) reflees and eamine how the whole
More informationKing Fahd University of Petroleum and Minerals Systems Engineering Department. Industrial and Systems Engineering (ISE) Student Guide
201 King Fahd University of Petroleum and Minerals Systems Engineering Department Industrial and Systems Engineering (ISE) Student Guide SYSTEMS ENGINEERING DEPARTMENT The Systems Engineering department
More informationFleet Assignment Using Collective Intelligence
Fleet Assignment Using Collective Intelligence Nicolas E Antoine, Stefan R Bieniawski, and Ilan M Kroo Stanford University, Stanford, CA 94305 David H Wolpert NASA Ames Research Center, Moffett Field,
More informationAssessment of robust capacity utilisation in railway networks
Assessment of robust capacity utilisation in railway networks Lars Wittrup Jensen 2015 Agenda 1) Introduction to WP 3.1 and PhD project 2) Model for measuring capacity consumption in railway networks a)
More informationMath, Trigonometry and Vectors. Geometry. Trig Definitions. sin(θ) = opp hyp. cos(θ) = adj hyp. tan(θ) = opp adj. Here's a familiar image.
Math, Trigonometr and Vectors Geometr Trig Definitions Here's a familiar image. To make predictive models of the phsical world, we'll need to make visualizations, which we can then turn into analtical
More informationOptimization of PID parameters with an improved simplex PSO
Li et al. Journal of Inequalities and Applications (2015) 2015:325 DOI 10.1186/s13660-015-0785-2 R E S E A R C H Open Access Optimization of PID parameters with an improved simplex PSO Ji-min Li 1, Yeong-Cheng
More informationNETWORK RECONFIGURATION FOR LOSS REDUCTION IN THREE-PHASE POWER DISTRIBUTION SYSTEMS
NETWORK RECONFIGURATION FOR LOSS REDUCTION IN THREE-PHASE POWER DISTRIBUTION SYSTEMS A Thesis Presented to the Faculty of the Graduate School of Cornell University in Partial Fulfillment of the Requirements
More informationShort-term scheduling and recipe optimization of blending processes
Computers and Chemical Engineering 25 (2001) 627 634 www.elsevier.com/locate/compchemeng Short-term scheduling and recipe optimization of blending processes Klaus Glismann, Günter Gruhn * Department of
More informationAn Integrated Robust Optimization Model of Capacity Planning under Demand Uncertainty in Electronic Industry
International Journal of Mechanical & Mechatronics Engineering IJMME-IJES Vol:15 o:03 88 An Integrated Robust Optimization Model of apacit Planning under emand Uncertaint in Electronic Industr hong Kuan
More informationStochastic Gradient Method: Applications
Stochastic Gradient Method: Applications February 03, 2015 P. Carpentier Master MMMEF Cours MNOS 2014-2015 114 / 267 Lecture Outline 1 Two Elementary Exercices on the Stochastic Gradient Two-Stage Recourse
More informationc 2006 Society for Industrial and Applied Mathematics
SIAM J. OPTIM. Vol. 17, No. 4, pp. 943 968 c 2006 Society for Industrial and Applied Mathematics STATIONARITY RESULTS FOR GENERATING SET SEARCH FOR LINEARLY CONSTRAINED OPTIMIZATION TAMARA G. KOLDA, ROBERT
More informationDesign, synthesis and scheduling of multipurpose batch plants via an effective continuous-time formulation
Computers and Chemical Engineering 25 (2001) 665 674 www.elsevier.com/locate/compchemeng Design, synthesis and scheduling of multipurpose batch plants via an effective continuous-time formulation X. Lin,
More informationChemical Process Simulation
Chemical Process Simulation The objective of this course is to provide the background needed by the chemical engineers to carry out computer-aided analyses of large-scale chemical processes. Major concern
More informationChapter 13: Binary and Mixed-Integer Programming
Chapter 3: Binary and Mixed-Integer Programming The general branch and bound approach described in the previous chapter can be customized for special situations. This chapter addresses two special situations:
More informationRecurrent Neural Networks
Recurrent Neural Networks Neural Computation : Lecture 12 John A. Bullinaria, 2015 1. Recurrent Neural Network Architectures 2. State Space Models and Dynamical Systems 3. Backpropagation Through Time
More informationAn optimisation framework for determination of capacity in railway networks
CASPT 2015 An optimisation framework for determination of capacity in railway networks Lars Wittrup Jensen Abstract Within the railway industry, high quality estimates on railway capacity is crucial information,
More informationIncremental Reduction of Binary Decision Diagrams
Abstract Incremental Reduction of Binar Decision Diagrams R. Jacobi, N. Calazans, C. Trullemans. Université de Louvain Laboratoire de Microélectronique - Place du Levant, 3 B1348 Louvain-la-Neuve Belgium
More informationAn Energy Efficient Location Service for Mobile Ad Hoc Networks
An Energ Efficient Location Service for Mobile Ad Hoc Networks Zijian Wang 1, Euphan Bulut 1 and Boleslaw K. Szmanski 1, 1 Department of Computer Science, Rensselaer Poltechnic Institute, Tro, NY 12180
More informationOn SDP- and CP-relaxations and on connections between SDP-, CP and SIP
On SDP- and CP-relaations and on connections between SDP-, CP and SIP Georg Still and Faizan Ahmed University of Twente p 1/12 1. IP and SDP-, CP-relaations Integer program: IP) : min T Q s.t. a T j =
More informationTest Problem Construction for Single-Objective Bilevel Optimization
Test Problem Construction for Single-Objective Bilevel Optimization Ankur Sinha, Pekka Malo Department of Information and Service Economy Aalto University School of Business, Finland {Firstname.Lastname}@aalto.fi
More informationThe Problem of Scheduling Technicians and Interventions in a Telecommunications Company
The Problem of Scheduling Technicians and Interventions in a Telecommunications Company Sérgio Garcia Panzo Dongala November 2008 Abstract In 2007 the challenge organized by the French Society of Operational
More informationSAMPLE. Polynomial functions
Objectives C H A P T E R 4 Polnomial functions To be able to use the technique of equating coefficients. To introduce the functions of the form f () = a( + h) n + k and to sketch graphs of this form through
More informationAdaptive Search with Stochastic Acceptance Probabilities for Global Optimization
Adaptive Search with Stochastic Acceptance Probabilities for Global Optimization Archis Ghate a and Robert L. Smith b a Industrial Engineering, University of Washington, Box 352650, Seattle, Washington,
More informationEuler: A System for Numerical Optimization of Programs
Euler: A System for Numerical Optimization of Programs Swarat Chaudhuri 1 and Armando Solar-Lezama 2 1 Rice University 2 MIT Abstract. We give a tutorial introduction to Euler, a system for solving difficult
More informationGenetic Algorithm. Based on Darwinian Paradigm. Intrinsically a robust search and optimization mechanism. Conceptual Algorithm
24 Genetic Algorithm Based on Darwinian Paradigm Reproduction Competition Survive Selection Intrinsically a robust search and optimization mechanism Slide -47 - Conceptual Algorithm Slide -48 - 25 Genetic
More information15.1. Exact Differential Equations. Exact First-Order Equations. Exact Differential Equations Integrating Factors
SECTION 5. Eact First-Order Equations 09 SECTION 5. Eact First-Order Equations Eact Differential Equations Integrating Factors Eact Differential Equations In Section 5.6, ou studied applications of differential
More information5.1. A Formula for Slope. Investigation: Points and Slope CONDENSED
CONDENSED L E S S O N 5.1 A Formula for Slope In this lesson ou will learn how to calculate the slope of a line given two points on the line determine whether a point lies on the same line as two given
More informationClustering and scheduling maintenance tasks over time
Clustering and scheduling maintenance tasks over time Per Kreuger 2008-04-29 SICS Technical Report T2008:09 Abstract We report results on a maintenance scheduling problem. The problem consists of allocating
More informationDesign, Synthesis and Scheduling of Multipurpose Batch Plants via an Effective Continuous-Time Formulation
Design, Synthesis and Scheduling of Multipurpose Batch Plants via an Effective Continuous-Time Formulation X. Lin and C. A. Floudas 1 Department of Chemical Engineering, Princeton University, Princeton,
More informationHigh-performance local search for planning maintenance of EDF nuclear park
High-performance local search for planning maintenance of EDF nuclear park Frédéric Gardi Karim Nouioua Bouygues e-lab, Paris fgardi@bouygues.com Laboratoire d'informatique Fondamentale - CNRS UMR 6166,
More informationCh 8 Potential energy and Conservation of Energy. Question: 2, 3, 8, 9 Problems: 3, 9, 15, 21, 24, 25, 31, 32, 35, 41, 43, 47, 49, 53, 55, 63
Ch 8 Potential energ and Conservation of Energ Question: 2, 3, 8, 9 Problems: 3, 9, 15, 21, 24, 25, 31, 32, 35, 41, 43, 47, 49, 53, 55, 63 Potential energ Kinetic energ energ due to motion Potential energ
More informationComparing Algorithms for Search-Based Test Data Generation of Matlab R Simulink R Models
Comparing Algorithms for Search-Based Test Data Generation of Matlab R Simulink R Models Kamran Ghani, John A. Clark and Yuan Zhan Abstract Search Based Software Engineering (SBSE) is an evolving field
More informationMachine Learning and Pattern Recognition Logistic Regression
Machine Learning and Pattern Recognition Logistic Regression Course Lecturer:Amos J Storkey Institute for Adaptive and Neural Computation School of Informatics University of Edinburgh Crichton Street,
More informationIntroduction To Genetic Algorithms
1 Introduction To Genetic Algorithms Dr. Rajib Kumar Bhattacharjya Department of Civil Engineering IIT Guwahati Email: rkbc@iitg.ernet.in References 2 D. E. Goldberg, Genetic Algorithm In Search, Optimization
More informationImproved Particle Swarm Optimization in Constrained Numerical Search Spaces
Improved Particle Swarm Optimization in Constrained Numerical Search Spaces Efrén Mezura-Montes and Jorge Isacc Flores-Mendoza Abstract This chapter presents a study about the behavior of Particle Swarm
More informationCore Maths C3. Revision Notes
Core Maths C Revision Notes October 0 Core Maths C Algebraic fractions... Cancelling common factors... Multipling and dividing fractions... Adding and subtracting fractions... Equations... 4 Functions...
More informationGenetic algorithms for solving portfolio allocation models based on relative-entropy, mean and variance
Journal of Scientific Research and Development 2 (12): 7-12, 2015 Available online at www.jsrad.org ISSN 1115-7569 2015 JSRAD Genetic algorithms for solving portfolio allocation models based on relative-entropy,
More informationDimensioning an inbound call center using constraint programming
Dimensioning an inbound call center using constraint programming Cyril Canon 1,2, Jean-Charles Billaut 2, and Jean-Louis Bouquard 2 1 Vitalicom, 643 avenue du grain d or, 41350 Vineuil, France ccanon@fr.snt.com
More informationProject Scheduling in Software Development
Project Scheduling in Software Development Eric Newby, Raymond Phillips, Dario Fanucchi, Byron Jacobs, Asha Tailor, Lady Kokela, Jesal Kika, Nadine Padiyachi University of the Witwatersrand January 13,
More informationThe Bees Algorithm A Novel Tool for Complex Optimisation Problems
The Bees Algorithm A Novel Tool for Comple Optimisation Problems D.T. Pham, A. Ghanbarzadeh, E. Koç, S. Otri, S. Rahim, M. Zaidi Manufacturing Engineering Centre, Cardiff University, Cardiff CF4 3AA, UK
More informationExample 1: Model A Model B Total Available. Gizmos. Dodads. System:
Lesson : Sstems of Equations and Matrices Outline Objectives: I can solve sstems of three linear equations in three variables. I can solve sstems of linear inequalities I can model and solve real-world
More informationXOR-based artificial bee colony algorithm for binary optimization
Turkish Journal of Electrical Engineering & Computer Sciences http:// journals. tubitak. gov. tr/ elektrik/ Research Article Turk J Elec Eng & Comp Sci (2013) 21: 2307 2328 c TÜBİTAK doi:10.3906/elk-1203-104
More informationTrading Networks with Price-Setting Agents
Trading Networks with Price-Setting Agents Larr Blume Dept. of Economics Cornell Universit, Ithaca NY lb9@cs.cornell.edu David Easle Dept. of Economics Cornell Universit, Ithaca NY dae3@cs.cornell.edu
More informationEstimation of the COCOMO Model Parameters Using Genetic Algorithms for NASA Software Projects
Journal of Computer Science 2 (2): 118-123, 2006 ISSN 1549-3636 2006 Science Publications Estimation of the COCOMO Model Parameters Using Genetic Algorithms for NASA Software Projects Alaa F. Sheta Computers
More informationEmpirical Study of Tabu Search, Simulated Annealing and Multi-Start in Fieldbus Scheduling
Empirical Study of Tabu Search, Simulated Annealing and Multi-Start in Fieldbus Scheduling Lucy María Franco Vargas Universidade Federal de Santa Catarina Caixa Postal 476 88.040-900 Florianópolis SC Brasil
More informationCloud Storage and Online Bin Packing
Cloud Storage and Online Bin Packing Doina Bein, Wolfgang Bein, and Swathi Venigella Abstract We study the problem of allocating memory of servers in a data center based on online requests for storage.
More information