#### Sample records for based optimization program

1. Optimization Research of Generation Investment Based on Linear Programming Model

Science.gov (United States)

Wu, Juan; Ge, Xueqian

Linear programming is an important branch of operational research and it is a mathematical method to assist the people to carry out scientific management. GAMS is an advanced simulation and optimization modeling language and it will combine a large number of complex mathematical programming, such as linear programming LP, nonlinear programming NLP, MIP and other mixed-integer programming with the system simulation. In this paper, based on the linear programming model, the optimized investment decision-making of generation is simulated and analyzed. At last, the optimal installed capacity of power plants and the final total cost are got, which provides the rational decision-making basis for optimized investments.

2. Portfolio optimization by using linear programing models based on genetic algorithm

Science.gov (United States)

Sukono; Hidayat, Y.; Lesmana, E.; Putra, A. S.; Napitupulu, H.; Supian, S.

2018-01-01

In this paper, we discussed the investment portfolio optimization using linear programming model based on genetic algorithms. It is assumed that the portfolio risk is measured by absolute standard deviation, and each investor has a risk tolerance on the investment portfolio. To complete the investment portfolio optimization problem, the issue is arranged into a linear programming model. Furthermore, determination of the optimum solution for linear programming is done by using a genetic algorithm. As a numerical illustration, we analyze some of the stocks traded on the capital market in Indonesia. Based on the analysis, it is shown that the portfolio optimization performed by genetic algorithm approach produces more optimal efficient portfolio, compared to the portfolio optimization performed by a linear programming algorithm approach. Therefore, genetic algorithms can be considered as an alternative on determining the investment portfolio optimization, particularly using linear programming models.

Science.gov (United States)

Luo, Biao; Liu, Derong; Wu, Huai-Ning; Wang, Ding; Lewis, Frank L

2017-10-01

4. Signal Timing Optimization Based on Fuzzy Compromise Programming for Isolated Signalized Intersection

Directory of Open Access Journals (Sweden)

Dexin Yu

2016-01-01

Full Text Available In order to optimize the signal timing for isolated intersection, a new method based on fuzzy programming approach is proposed in this paper. Considering the whole operation efficiency of the intersection comprehensively, traffic capacity, vehicle cycle delay, cycle stops, and exhaust emission are chosen as optimization goals to establish a multiobjective function first. Then fuzzy compromise programming approach is employed to give different weight coefficients to various optimization objectives for different traffic flow ratios states. And then the multiobjective function is converted to a single objective function. By using genetic algorithm, the optimized signal cycle and effective green time can be obtained. Finally, the performance of the traditional method and new method proposed in this paper is compared and analyzed through VISSIM software. It can be concluded that the signal timing optimized in this paper can effectively reduce vehicle delays and stops, which can improve traffic capacity of the intersection as well.

5. Fuzzy preference based interactive fuzzy physical programming and its application in multi-objective optimization

International Nuclear Information System (INIS)

Zhang, Xu; Huang, Hong Zhong; Yu, Lanfeng

2006-01-01

Interactive Fuzzy Physical Programming (IFPP) developed in this paper is a new efficient multi-objective optimization method, which retains the advantages of physical programming while considering the fuzziness of the designer's preferences. The fuzzy preference function is introduced based on the model of linear physical programming, which is used to guide the search for improved solutions by interactive decision analysis. The example of multi-objective optimization design of the spindle of internal grinder demonstrates that the improved preference conforms to the subjective desires of the designer

6. Power Grid Construction Project Portfolio Optimization Based on Bi-level programming model

Science.gov (United States)

Zhao, Erdong; Li, Shangqi

2017-08-01

As the main body of power grid operation, county-level power supply enterprises undertake an important emission to guarantee the security of power grid operation and safeguard social power using order. The optimization of grid construction projects has been a key issue of power supply capacity and service level of grid enterprises. According to the actual situation of power grid construction project optimization of county-level power enterprises, on the basis of qualitative analysis of the projects, this paper builds a Bi-level programming model based on quantitative analysis. The upper layer of the model is the target restriction of the optimal portfolio; the lower layer of the model is enterprises’ financial restrictions on the size of the enterprise project portfolio. Finally, using a real example to illustrate operation proceeding and the optimization result of the model. Through qualitative analysis and quantitative analysis, the bi-level programming model improves the accuracy and normative standardization of power grid enterprises projects.

7. Mass Optimization of Battery/Supercapacitors Hybrid Systems Based on a Linear Programming Approach

Science.gov (United States)

Fleury, Benoit; Labbe, Julien

2014-08-01

The objective of this paper is to show that, on a specific launcher-type mission profile, a 40% gain of mass is expected using a battery/supercapacitors active hybridization instead of a single battery solution. This result is based on the use of a linear programming optimization approach to perform the mass optimization of the hybrid power supply solution.

8. A Constraint programming-based genetic algorithm for capacity output optimization

Directory of Open Access Journals (Sweden)

Kate Ean Nee Goh

2014-10-01

Full Text Available Purpose: The manuscript presents an investigation into a constraint programming-based genetic algorithm for capacity output optimization in a back-end semiconductor manufacturing company.Design/methodology/approach: In the first stage, constraint programming defining the relationships between variables was formulated into the objective function. A genetic algorithm model was created in the second stage to optimize capacity output. Three demand scenarios were applied to test the robustness of the proposed algorithm.Findings: CPGA improved both the machine utilization and capacity output once the minimum requirements of a demand scenario were fulfilled. Capacity outputs of the three scenarios were improved by 157%, 7%, and 69%, respectively.Research limitations/implications: The work relates to aggregate planning of machine capacity in a single case study. The constraints and constructed scenarios were therefore industry-specific.Practical implications: Capacity planning in a semiconductor manufacturing facility need to consider multiple mutually influenced constraints in resource availability, process flow and product demand. The findings prove that CPGA is a practical and an efficient alternative to optimize the capacity output and to allow the company to review its capacity with quick feedback.Originality/value: The work integrates two contemporary computational methods for a real industry application conventionally reliant on human judgement.

9. Optimization of fuel-cell tram operation based on two dimension dynamic programming

Science.gov (United States)

Zhang, Wenbin; Lu, Xuecheng; Zhao, Jingsong; Li, Jianqiu

2018-02-01

This paper proposes an optimal control strategy based on the two-dimension dynamic programming (2DDP) algorithm targeting at minimizing operation energy consumption for a fuel-cell tram. The energy consumption model with the tram dynamics is firstly deduced. Optimal control problem are analyzed and the 2DDP strategy is applied to solve the problem. The optimal tram speed profiles are obtained for each interstation which consist of three stages: accelerate to the set speed with the maximum traction power, dynamically adjust to maintain a uniform speed and decelerate to zero speed with the maximum braking power at a suitable timing. The optimal control curves of all the interstations are connected with the parking time to form the optimal control method of the whole line. The optimized speed profiles are also simplified for drivers to follow.

10. Risk-Based Two-Stage Stochastic Optimization Problem of Micro-Grid Operation with Renewables and Incentive-Based Demand Response Programs

Directory of Open Access Journals (Sweden)

2018-03-01

Full Text Available The operation problem of a micro-grid (MG in grid-connected mode is an optimization one in which the main objective of the MG operator (MGO is to minimize the operation cost with optimal scheduling of resources and optimal trading energy with the main grid. The MGO can use incentive-based demand response programs (DRPs to pay an incentive to the consumers to change their demands in the peak hours. Moreover, the MGO forecasts the output power of renewable energy resources (RERs and models their uncertainties in its problem. In this paper, the operation problem of an MGO is modeled as a risk-based two-stage stochastic optimization problem. To model the uncertainties of RERs, two-stage stochastic programming is considered and conditional value at risk (CVaR index is used to manage the MGO’s risk-level. Moreover, the non-linear economic models of incentive-based DRPs are used by the MGO to change the peak load. The numerical studies are done to investigate the effect of incentive-based DRPs on the operation problem of the MGO. Moreover, to show the effect of the risk-averse parameter on MGO decisions, a sensitivity analysis is carried out.

11. Optimal decisions principles of programming

CERN Document Server

Lange, Oskar

1971-01-01

Optimal Decisions: Principles of Programming deals with all important problems related to programming.This book provides a general interpretation of the theory of programming based on the application of the Lagrange multipliers, followed by a presentation of the marginal and linear programming as special cases of this general theory. The praxeological interpretation of the method of Lagrange multipliers is also discussed.This text covers the Koopmans' model of transportation, geometric interpretation of the programming problem, and nature of activity analysis. The solution of t

12. A singular value decomposition linear programming (SVDLP) optimization technique for circular cone based robotic radiotherapy

Science.gov (United States)

Liang, Bin; Li, Yongbao; Wei, Ran; Guo, Bin; Xu, Xuang; Liu, Bo; Li, Jiafeng; Wu, Qiuwen; Zhou, Fugen

2018-01-01

With robot-controlled linac positioning, robotic radiotherapy systems such as CyberKnife significantly increase freedom of radiation beam placement, but also impose more challenges on treatment plan optimization. The resampling mechanism in the vendor-supplied treatment planning system (MultiPlan) cannot fully explore the increased beam direction search space. Besides, a sparse treatment plan (using fewer beams) is desired to improve treatment efficiency. This study proposes a singular value decomposition linear programming (SVDLP) optimization technique for circular collimator based robotic radiotherapy. The SVDLP approach initializes the input beams by simulating the process of covering the entire target volume with equivalent beam tapers. The requirements on dosimetry distribution are modeled as hard and soft constraints, and the sparsity of the treatment plan is achieved by compressive sensing. The proposed linear programming (LP) model optimizes beam weights by minimizing the deviation of soft constraints subject to hard constraints, with a constraint on the l 1 norm of the beam weight. A singular value decomposition (SVD) based acceleration technique was developed for the LP model. Based on the degeneracy of the influence matrix, the model is first compressed into lower dimension for optimization, and then back-projected to reconstruct the beam weight. After beam weight optimization, the number of beams is reduced by removing the beams with low weight, and optimizing the weights of the remaining beams using the same model. This beam reduction technique is further validated by a mixed integer programming (MIP) model. The SVDLP approach was tested on a lung case. The results demonstrate that the SVD acceleration technique speeds up the optimization by a factor of 4.8. Furthermore, the beam reduction achieves a similar plan quality to the globally optimal plan obtained by the MIP model, but is one to two orders of magnitude faster. Furthermore, the SVDLP

13. A singular value decomposition linear programming (SVDLP) optimization technique for circular cone based robotic radiotherapy.

Science.gov (United States)

Liang, Bin; Li, Yongbao; Wei, Ran; Guo, Bin; Xu, Xuang; Liu, Bo; Li, Jiafeng; Wu, Qiuwen; Zhou, Fugen

2018-01-05

With robot-controlled linac positioning, robotic radiotherapy systems such as CyberKnife significantly increase freedom of radiation beam placement, but also impose more challenges on treatment plan optimization. The resampling mechanism in the vendor-supplied treatment planning system (MultiPlan) cannot fully explore the increased beam direction search space. Besides, a sparse treatment plan (using fewer beams) is desired to improve treatment efficiency. This study proposes a singular value decomposition linear programming (SVDLP) optimization technique for circular collimator based robotic radiotherapy. The SVDLP approach initializes the input beams by simulating the process of covering the entire target volume with equivalent beam tapers. The requirements on dosimetry distribution are modeled as hard and soft constraints, and the sparsity of the treatment plan is achieved by compressive sensing. The proposed linear programming (LP) model optimizes beam weights by minimizing the deviation of soft constraints subject to hard constraints, with a constraint on the l 1 norm of the beam weight. A singular value decomposition (SVD) based acceleration technique was developed for the LP model. Based on the degeneracy of the influence matrix, the model is first compressed into lower dimension for optimization, and then back-projected to reconstruct the beam weight. After beam weight optimization, the number of beams is reduced by removing the beams with low weight, and optimizing the weights of the remaining beams using the same model. This beam reduction technique is further validated by a mixed integer programming (MIP) model. The SVDLP approach was tested on a lung case. The results demonstrate that the SVD acceleration technique speeds up the optimization by a factor of 4.8. Furthermore, the beam reduction achieves a similar plan quality to the globally optimal plan obtained by the MIP model, but is one to two orders of magnitude faster. Furthermore, the SVDLP

14. Optimal Operation of Radial Distribution Systems Using Extended Dynamic Programming

DEFF Research Database (Denmark)

Lopez, Juan Camilo; Vergara, Pedro P.; Lyra, Christiano

2018-01-01

An extended dynamic programming (EDP) approach is developed to optimize the ac steady-state operation of radial electrical distribution systems (EDS). Based on the optimality principle of the recursive Hamilton-Jacobi-Bellman equations, the proposed EDP approach determines the optimal operation o...... approach is illustrated using real-scale systems and comparisons with commercial programming solvers. Finally, generalizations to consider other EDS operation problems are also discussed.......An extended dynamic programming (EDP) approach is developed to optimize the ac steady-state operation of radial electrical distribution systems (EDS). Based on the optimality principle of the recursive Hamilton-Jacobi-Bellman equations, the proposed EDP approach determines the optimal operation...... of the EDS by setting the values of the controllable variables at each time period. A suitable definition for the stages of the problem makes it possible to represent the optimal ac power flow of radial EDS as a dynamic programming problem, wherein the 'curse of dimensionality' is a minor concern, since...

15. GPAW optimized for Blue Gene/P using hybrid programming

DEFF Research Database (Denmark)

Kristensen, Mads Ruben Burgdorff; Happe, Hans Henrik; Vinter, Brian

2009-01-01

In this work we present optimizations of a Grid-based projector-augmented wave method software, GPAW for the Blue Gene/P architecture. The improvements are achieved by exploring the advantage of shared and distributed memory programming also known as hybrid programming. The work focuses on optimi......In this work we present optimizations of a Grid-based projector-augmented wave method software, GPAW for the Blue Gene/P architecture. The improvements are achieved by exploring the advantage of shared and distributed memory programming also known as hybrid programming. The work focuses...... on optimizing a very time consuming operation in GPAW, the finite-different stencil operation, and different hybrid programming approaches are evaluated. The work succeeds in demonstrating a hybrid programming model which is clearly beneficial compared to the original flat programming model. In total...... an improvement of 1.94 compared to the original implementation is obtained. The results we demonstrate here are reasonably general and may be applied to other finite difference codes....

16. Dynamic programming for QFD in PES optimization

Energy Technology Data Exchange (ETDEWEB)

Sorrentino, R. [Mediterranean Univ. of Reggio Calabria, Reggio Calabria (Italy). Dept. of Computer Science and Electrical Technology

2008-07-01

Quality function deployment (QFD) is a method for linking the needs of the customer with design, development, engineering, manufacturing, and service functions. In the electric power industry, QFD is used to help designers concentrate on the most important technical attributes to develop better electrical services. Most optimization approaches used in QFD analysis have been based on integer or linear programming. These approaches perform well in certain circumstances, but there are problems that hinder their practical use. This paper proposed an approach to optimize Power and Energy Systems (PES). A dynamic programming approach was used along with an extended House of Quality to gather information. Dynamic programming was used to allocate the limited resources to the technical attributes. The approach integrated dynamic programming into the electrical service design process. The dynamic programming approach did not require the full relationship curve between technical attributes and customer satisfaction, or the relationship between technical attributes and cost. It only used a group of discrete points containing information about customer satisfaction, technical attributes, and the cost to find the optimal product design. Therefore, it required less time and resources than other approaches. At the end of the optimization process, the value of each technical attribute, the related cost, and the overall customer satisfaction were obtained at the same time. It was concluded that compared with other optimization methods, the dynamic programming method requires less information and the optimal results are more relevant. 21 refs., 2 tabs., 2 figs.

17. Programming for Sparse Minimax Optimization

DEFF Research Database (Denmark)

1994-01-01

We present an algorithm for nonlinear minimax optimization which is well suited for large and sparse problems. The method is based on trust regions and sequential linear programming. On each iteration, a linear minimax problem is solved for a basic step. If necessary, this is followed...... by the determination of a minimum norm corrective step based on a first-order Taylor approximation. No Hessian information needs to be stored. Global convergence is proved. This new method has been extensively tested and compared with other methods, including two well known codes for nonlinear programming...

18. Second Order Cone Programming (SOCP) Relaxation Based Optimal Power Flow with Hybrid VSC-HVDC Transmission and Active Distribution Networks

DEFF Research Database (Denmark)

Ding, Tao; Li, Cheng; Yang, Yongheng

2017-01-01

The detailed topology of renewable resource bases may have the impact on the optimal power flow of the VSC-HVDC transmission network. To address this issue, this paper develops an optimal power flow with the hybrid VSC-HVDC transmission and active distribution networks to optimally schedule...... the generation output and voltage regulation of both networks, which leads to a non-convex programming model. Furthermore, the non-convex power flow equations are based on the Second Order Cone Programming (SOCP) relaxation approach. Thus, the proposed model can be relaxed to a SOCP that can be tractably solved...

19. Constrained Quadratic Programming and Neurodynamics-Based Solver for Energy Optimization of Biped Walking Robots

Directory of Open Access Journals (Sweden)

Liyang Wang

2017-01-01

Full Text Available The application of biped robots is always trapped by their high energy consumption. This paper makes a contribution by optimizing the joint torques to decrease the energy consumption without changing the biped gaits. In this work, a constrained quadratic programming (QP problem for energy optimization is formulated. A neurodynamics-based solver is presented to solve the QP problem. Differing from the existing literatures, the proposed neurodynamics-based energy optimization (NEO strategy minimizes the energy consumption and guarantees the following three important constraints simultaneously: (i the force-moment equilibrium equation of biped robots, (ii frictions applied by each leg on the ground to hold the biped robot without slippage and tipping over, and (iii physical limits of the motors. Simulations demonstrate that the proposed strategy is effective for energy-efficient biped walking.

20. Learning Based Approach for Optimal Clustering of Distributed Program's Call Flow Graph

Science.gov (United States)

Abofathi, Yousef; Zarei, Bager; Parsa, Saeed

Optimal clustering of call flow graph for reaching maximum concurrency in execution of distributable components is one of the NP-Complete problems. Learning automatas (LAs) are search tools which are used for solving many NP-Complete problems. In this paper a learning based algorithm is proposed to optimal clustering of call flow graph and appropriate distributing of programs in network level. The algorithm uses learning feature of LAs to search in state space. It has been shown that the speed of reaching to solution increases remarkably using LA in search process, and it also prevents algorithm from being trapped in local minimums. Experimental results show the superiority of proposed algorithm over others.

1. Optimization of biotechnological systems through geometric programming

Directory of Open Access Journals (Sweden)

Torres Nestor V

2007-09-01

Full Text Available Abstract Background In the past, tasks of model based yield optimization in metabolic engineering were either approached with stoichiometric models or with structured nonlinear models such as S-systems or linear-logarithmic representations. These models stand out among most others, because they allow the optimization task to be converted into a linear program, for which efficient solution methods are widely available. For pathway models not in one of these formats, an Indirect Optimization Method (IOM was developed where the original model is sequentially represented as an S-system model, optimized in this format with linear programming methods, reinterpreted in the initial model form, and further optimized as necessary. Results A new method is proposed for this task. We show here that the model format of a Generalized Mass Action (GMA system may be optimized very efficiently with techniques of geometric programming. We briefly review the basics of GMA systems and of geometric programming, demonstrate how the latter may be applied to the former, and illustrate the combined method with a didactic problem and two examples based on models of real systems. The first is a relatively small yet representative model of the anaerobic fermentation pathway in S. cerevisiae, while the second describes the dynamics of the tryptophan operon in E. coli. Both models have previously been used for benchmarking purposes, thus facilitating comparisons with the proposed new method. In these comparisons, the geometric programming method was found to be equal or better than the earlier methods in terms of successful identification of optima and efficiency. Conclusion GMA systems are of importance, because they contain stoichiometric, mass action and S-systems as special cases, along with many other models. Furthermore, it was previously shown that algebraic equivalence transformations of variables are sufficient to convert virtually any types of dynamical models into

2. An efficient scenario-based stochastic programming framework for multi-objective optimal micro-grid operation

International Nuclear Information System (INIS)

Niknam, Taher; Azizipanah-Abarghooee, Rasoul; Narimani, Mohammad Rasoul

2012-01-01

Highlights: ► Proposes a stochastic model for optimal energy management. ► Consider uncertainties related to the forecasted values for load demand. ► Consider uncertainties of forecasted values of output power of wind and photovoltaic units. ► Consider uncertainties of forecasted values of market price. ► Present an improved multi-objective teaching–learning-based optimization. -- Abstract: This paper proposes a stochastic model for optimal energy management with the goal of cost and emission minimization. In this model, the uncertainties related to the forecasted values for load demand, available output power of wind and photovoltaic units and market price are modeled by a scenario-based stochastic programming. In the presented method, scenarios are generated by a roulette wheel mechanism based on probability distribution functions of the input random variables. Through this method, the inherent stochastic nature of the proposed problem is released and the problem is decomposed into a deterministic problem. An improved multi-objective teaching–learning-based optimization is implemented to yield the best expected Pareto optimal front. In the proposed stochastic optimization method, a novel self adaptive probabilistic modification strategy is offered to improve the performance of the presented algorithm. Also, a set of non-dominated solutions are stored in a repository during the simulation process. Meanwhile, the size of the repository is controlled by usage of a fuzzy-based clustering technique. The best expected compromise solution stored in the repository is selected via the niching mechanism in a way that solutions are encouraged to seek the lesser explored regions. The proposed framework is applied in a typical grid-connected micro grid in order to verify its efficiency and feasibility.

3. Optimal blood glucose control in diabetes mellitus treatment using dynamic programming based on Ackerman’s linear model

Science.gov (United States)

2018-03-01

Determination of insulin injection dose in diabetes mellitus treatment can be considered as an optimal control problem. This article is aimed to simulate optimal blood glucose control for patient with diabetes mellitus. The blood glucose regulation of diabetic patient is represented by Ackerman’s Linear Model. This problem is then solved using dynamic programming method. The desired blood glucose level is obtained by minimizing the performance index in Lagrange form. The results show that dynamic programming based on Ackerman’s Linear Model is quite good to solve the problem.

4. Optimal Control of Complex Systems Based on Improved Dual Heuristic Dynamic Programming Algorithm

Directory of Open Access Journals (Sweden)

Hui Li

2017-01-01

Full Text Available When applied to solving the data modeling and optimal control problems of complex systems, the dual heuristic dynamic programming (DHP technique, which is based on the BP neural network algorithm (BP-DHP, has difficulty in prediction accuracy, slow convergence speed, poor stability, and so forth. In this paper, a dual DHP technique based on Extreme Learning Machine (ELM algorithm (ELM-DHP was proposed. Through constructing three kinds of network structures, the paper gives the detailed realization process of the DHP technique in the ELM. The controller designed upon the ELM-DHP algorithm controlled a molecular distillation system with complex features, such as multivariability, strong coupling, and nonlinearity. Finally, the effectiveness of the algorithm is verified by the simulation that compares DHP and HDP algorithms based on ELM and BP neural network. The algorithm can also be applied to solve the data modeling and optimal control problems of similar complex systems.

5. Dose optimization based on linear programming implemented in a system for treatment planning in Monte Carlo

International Nuclear Information System (INIS)

Ureba, A.; Palma, B. A.; Leal, A.

2011-01-01

Develop a more efficient method of optimization in relation to time, based on linear programming designed to implement a multi objective penalty function which also permits a simultaneous solution integrated boost situations considering two white volumes simultaneously.

6. Classifiers based on optimal decision rules

KAUST Repository

Amin, Talha

2013-11-25

Based on dynamic programming approach we design algorithms for sequential optimization of exact and approximate decision rules relative to the length and coverage [3, 4]. In this paper, we use optimal rules to construct classifiers, and study two questions: (i) which rules are better from the point of view of classification-exact or approximate; and (ii) which order of optimization gives better results of classifier work: length, length+coverage, coverage, or coverage+length. Experimental results show that, on average, classifiers based on exact rules are better than classifiers based on approximate rules, and sequential optimization (length+coverage or coverage+length) is better than the ordinary optimization (length or coverage).

7. Classifiers based on optimal decision rules

KAUST Repository

Amin, Talha M.; Chikalov, Igor; Moshkov, Mikhail; Zielosko, Beata

2013-01-01

Based on dynamic programming approach we design algorithms for sequential optimization of exact and approximate decision rules relative to the length and coverage [3, 4]. In this paper, we use optimal rules to construct classifiers, and study two questions: (i) which rules are better from the point of view of classification-exact or approximate; and (ii) which order of optimization gives better results of classifier work: length, length+coverage, coverage, or coverage+length. Experimental results show that, on average, classifiers based on exact rules are better than classifiers based on approximate rules, and sequential optimization (length+coverage or coverage+length) is better than the ordinary optimization (length or coverage).

8. Neural-network-observer-based optimal control for unknown nonlinear systems using adaptive dynamic programming

Science.gov (United States)

Liu, Derong; Huang, Yuzhu; Wang, Ding; Wei, Qinglai

2013-09-01

In this paper, an observer-based optimal control scheme is developed for unknown nonlinear systems using adaptive dynamic programming (ADP) algorithm. First, a neural-network (NN) observer is designed to estimate system states. Then, based on the observed states, a neuro-controller is constructed via ADP method to obtain the optimal control. In this design, two NN structures are used: a three-layer NN is used to construct the observer which can be applied to systems with higher degrees of nonlinearity and without a priori knowledge of system dynamics, and a critic NN is employed to approximate the value function. The optimal control law is computed using the critic NN and the observer NN. Uniform ultimate boundedness of the closed-loop system is guaranteed. The actor, critic, and observer structures are all implemented in real-time, continuously and simultaneously. Finally, simulation results are presented to demonstrate the effectiveness of the proposed control scheme.

9. SMART Optimization of a Parenting Program for Active Duty Families

Science.gov (United States)

2017-10-01

child and caregiver outcomes over time, based on a sample of 200 military personnel and their co- parents who have recently or will soon separate from...AWARD NUMBER: W81XWH-16-1-0407 TITLE: SMART Optimization of a Parenting Program for Active Duty Families PRINCIPAL INVESTIGATOR: Abigail...Optimization of a Parenting Program for Active Duty 5a. CONTRACT NUMBER Families 5b. GRANT NUMBER 5c. PROGRAM ELEMENT NUMBER 6. AUTHOR(S) Abigail

10. Probabilistic methods for maintenance program optimization

International Nuclear Information System (INIS)

Liming, J.K.; Smith, M.J.; Gekler, W.C.

1989-01-01

In today's regulatory and economic environments, it is more important than ever that managers, engineers, and plant staff join together in developing and implementing effective management plans for safety and economic risk. This need applied to both power generating stations and other process facilities. One of the most critical parts of these management plans is the development and continuous enhancement of a maintenance program that optimizes plant or facility safety and profitability. The ultimate objective is to maximize the potential for station or facility success, usually measured in terms of projected financial profitability, while meeting or exceeding meaningful and reasonable safety goals, usually measured in terms of projected damage or consequence frequencies. This paper describes the use of the latest concepts in developing and evaluating maintenance programs to achieve maintenance program optimization (MPO). These concepts are based on significant field experience gained through the integration and application of fundamentals developed for industry and Electric Power Research Institute (EPRI)-sponsored projects on preventive maintenance (PM) program development and reliability-centered maintenance (RCM)

11. Optimal blood glucose level control using dynamic programming based on minimal Bergman model

Science.gov (United States)

Rettian Anggita Sari, Maria; Hartono

2018-03-01

The purpose of this article is to simulate the glucose dynamic and the insulin kinetic of diabetic patient. The model used in this research is a non-linear Minimal Bergman model. Optimal control theory is then applied to formulate the problem in order to determine the optimal dose of insulin in the treatment of diabetes mellitus such that the glucose level is in the normal range for some specific time range. The optimization problem is solved using dynamic programming. The result shows that dynamic programming is quite reliable to represent the interaction between glucose and insulin levels in diabetes mellitus patient.

12. Efficient dynamic optimization of logic programs

Science.gov (United States)

Laird, Phil

1992-01-01

A summary is given of the dynamic optimization approach to speed up learning for logic programs. The problem is to restructure a recursive program into an equivalent program whose expected performance is optimal for an unknown but fixed population of problem instances. We define the term 'optimal' relative to the source of input instances and sketch an algorithm that can come within a logarithmic factor of optimal with high probability. Finally, we show that finding high-utility unfolding operations (such as EBG) can be reduced to clause reordering.

13. Optimal planning of gas turbine cogeneration system based on linear programming. Paper no. IGEC-1-ID09

International Nuclear Information System (INIS)

Oh, S.-D.; Kwak, H.-Y.

2005-01-01

An optimal planning for gas turbine cogeneration system has been studied. The planning problem considered in this study is to determine the optimal configuration of the system equipments and optimal operational policy of the system when the annual energy demands of electric power, heat and cooling are given a priori. The main benefit of the optimal planning is to minimize operational costs and to save energy by efficient energy utilization. A mixed-integer linear programming and the branch and bound algorithm have been adopted to obtain the optimal solution. Both the optimal configuration of the system equipments and the optimal operation policy has been obtained based on annual cost method. The planning method employed here may be applied to the planning problem of the cogeneration plant to any specific building or hotel. (author)

14. Lean and Efficient Software: Whole Program Optimization of Executables

Science.gov (United States)

2016-12-31

19b. TELEPHONE NUMBER (Include area code) 12/31/2016 Final Technical Report (Phase I - Base Period) 30-06-2014 - 31-12-2016 Lean and Efficient...Software: Whole-Program Optimization of Executables Final Report Evan Driscoll Tom Johnson GrammaTech, Inc. 531 Esty Street Ithaca, NY 14850 Office of...hardening U U U UU 30 Tom Johnson (607) 273-7340 x.134 Page 1 of 30 “ Lean and Efficient Software: Whole-Program Optimization of Executables

15. An integrated reliability-based design optimization of offshore towers

International Nuclear Information System (INIS)

Karadeniz, Halil; Togan, Vedat; Vrouwenvelder, Ton

2009-01-01

After recognizing the uncertainty in the parameters such as material, loading, geometry and so on in contrast with the conventional optimization, the reliability-based design optimization (RBDO) concept has become more meaningful to perform an economical design implementation, which includes a reliability analysis and an optimization algorithm. RBDO procedures include structural analysis, reliability analysis and sensitivity analysis both for optimization and for reliability. The efficiency of the RBDO system depends on the mentioned numerical algorithms. In this work, an integrated algorithms system is proposed to implement the RBDO of the offshore towers, which are subjected to the extreme wave loading. The numerical strategies interacting with each other to fulfill the RBDO of towers are as follows: (a) a structural analysis program, SAPOS, (b) an optimization program, SQP and (c) a reliability analysis program based on FORM. A demonstration of an example tripod tower under the reliability constraints based on limit states of the critical stress, buckling and the natural frequency is presented.

16. An integrated reliability-based design optimization of offshore towers

Energy Technology Data Exchange (ETDEWEB)

Karadeniz, Halil [Faculty of Civil Engineering and Geosciences, Delft University of Technology, Delft (Netherlands)], E-mail: h.karadeniz@tudelft.nl; Togan, Vedat [Department of Civil Engineering, Karadeniz Technical University, Trabzon (Turkey); Vrouwenvelder, Ton [Faculty of Civil Engineering and Geosciences, Delft University of Technology, Delft (Netherlands)

2009-10-15

After recognizing the uncertainty in the parameters such as material, loading, geometry and so on in contrast with the conventional optimization, the reliability-based design optimization (RBDO) concept has become more meaningful to perform an economical design implementation, which includes a reliability analysis and an optimization algorithm. RBDO procedures include structural analysis, reliability analysis and sensitivity analysis both for optimization and for reliability. The efficiency of the RBDO system depends on the mentioned numerical algorithms. In this work, an integrated algorithms system is proposed to implement the RBDO of the offshore towers, which are subjected to the extreme wave loading. The numerical strategies interacting with each other to fulfill the RBDO of towers are as follows: (a) a structural analysis program, SAPOS, (b) an optimization program, SQP and (c) a reliability analysis program based on FORM. A demonstration of an example tripod tower under the reliability constraints based on limit states of the critical stress, buckling and the natural frequency is presented.

17. Computer program for optimal BWR congtrol rod programming

International Nuclear Information System (INIS)

Taner, M.S.; Levine, S.H.; Carmody, J.M.

1995-01-01

A fully automated computer program has been developed for designing optimal control rod (CR) patterns for boiling water reactors (BWRs). The new program, called OCTOPUS-3, is based on the OCTOPUS code and employs SIMULATE-3 (Ref. 2) for the analysis. There are three aspects of OCTOPUS-3 that make it successful for use at PECO Energy. It incorporates a new feasibility algorithm that makes the CR design meet all constraints, it has been coupled to a Bourne Shell program 3 to allow the user to run the code interactively without the need for a manual, and it develops a low axial peak to extend the cycle. For PECO Energy Co.'s limericks it increased the energy output by 1 to 2% over the traditional PECO Energy design. The objective of the optimization in OCTOPUS-3 is to approximate a very low axial peaked target power distribution while maintaining criticality, keeping the nodal and assembly peaks below the allowed maximum, and meeting the other constraints. The user-specified input for each exposure point includes: CR groups allowed-to-move, target k eff , and amount of core flow. The OCTOPUS-3 code uses the CR pattern from the previous step as the initial guess unless indicated otherwise

18. AUTOMATA PROGRAMS CONSTRUCTION FROM SPECIFICATION WITH AN ANT COLONY OPTIMIZATION ALGORITHM BASED ON MUTATION GRAPH

Directory of Open Access Journals (Sweden)

Daniil S. Chivilikhin

2014-11-01

Full Text Available The procedure of testing traditionally used in software engineering cannot guarantee program correctness; therefore verification is used at the excess requirements to programs reliability. Verification makes it possible to check certain properties of programs in all possible computational states; however, this process is very complex. In the model checking method a model of the program is built (often, manually and requirements in terms of temporal logic are formulated. Such temporal properties of the model can be checked automatically. The main issue in this framework is the gap between the program and its model. Automata-based programming paradigm gives the possibility to overcome this limitation. In this paradigm, program logic is represented using finite-state machines. The advantage of finite-state machines is that their models can be constructed automatically. The paper deals with the application of mutation-based ant colony optimization algorithm to the problem of finite-state machine construction from their specification, defined by test scenarios and temporal properties. The presented approach has been tested on the elevator doors control problem as well as on randomly generated data. Obtained results show the ant colony algorithm is two-three times faster than the previously used genetic algorithm. The proposed approach can be recommended for inferring control programs for critical systems.

19. CAN-DO, CFD-based Aerodynamic Nozzle Design and Optimization program for supersonic/hypersonic wind tunnels

Science.gov (United States)

Korte, John J.; Kumar, Ajay; Singh, D. J.; White, J. A.

1992-01-01

A design program is developed which incorporates a modern approach to the design of supersonic/hypersonic wind-tunnel nozzles. The approach is obtained by the coupling of computational fluid dynamics (CFD) with design optimization. The program can be used to design a 2D or axisymmetric, supersonic or hypersonic, wind-tunnel nozzles that can be modeled with a calorically perfect gas. The nozzle design is obtained by solving a nonlinear least-squares optimization problem (LSOP). The LSOP is solved using an iterative procedure which requires intermediate flowfield solutions. The nozzle flowfield is simulated by solving the Navier-Stokes equations for the subsonic and transonic flow regions and the parabolized Navier-Stokes equations for the supersonic flow regions. The advantages of this method are that the design is based on the solution of the viscous equations eliminating the need to make separate corrections to a design contour, and the flexibility of applying the procedure to different types of nozzle design problems.

20. Resource Allocation Optimization Model of Collaborative Logistics Network Based on Bilevel Programming

Directory of Open Access Journals (Sweden)

Xiao-feng Xu

2017-01-01

Full Text Available Collaborative logistics network resource allocation can effectively meet the needs of customers. It can realize the overall benefit maximization of the logistics network and ensure that collaborative logistics network runs orderly at the time of creating value. Therefore, this article is based on the relationship of collaborative logistics network supplier, the transit warehouse, and sellers, and we consider the uncertainty of time to establish a bilevel programming model with random constraints and propose a genetic simulated annealing hybrid intelligent algorithm to solve it. Numerical example shows that the method has stronger robustness and convergence; it can achieve collaborative logistics network resource allocation rationalization and optimization.

1. Conjugate gradient optimization programs for shuttle reentry

Science.gov (United States)

Powers, W. F.; Jacobson, R. A.; Leonard, D. A.

1972-01-01

Two computer programs for shuttle reentry trajectory optimization are listed and described. Both programs use the conjugate gradient method as the optimization procedure. The Phase 1 Program is developed in cartesian coordinates for a rotating spherical earth, and crossrange, downrange, maximum deceleration, total heating, and terminal speed, altitude, and flight path angle are included in the performance index. The programs make extensive use of subroutines so that they may be easily adapted to other atmospheric trajectory optimization problems.

2. Energy Consumption Forecasting Using Semantic-Based Genetic Programming with Local Search Optimizer

Directory of Open Access Journals (Sweden)

Mauro Castelli

2015-01-01

Full Text Available Energy consumption forecasting (ECF is an important policy issue in today’s economies. An accurate ECF has great benefits for electric utilities and both negative and positive errors lead to increased operating costs. The paper proposes a semantic based genetic programming framework to address the ECF problem. In particular, we propose a system that finds (quasi-perfect solutions with high probability and that generates models able to produce near optimal predictions also on unseen data. The framework blends a recently developed version of genetic programming that integrates semantic genetic operators with a local search method. The main idea in combining semantic genetic programming and a local searcher is to couple the exploration ability of the former with the exploitation ability of the latter. Experimental results confirm the suitability of the proposed method in predicting the energy consumption. In particular, the system produces a lower error with respect to the existing state-of-the art techniques used on the same dataset. More importantly, this case study has shown that including a local searcher in the geometric semantic genetic programming system can speed up the search process and can result in fitter models that are able to produce an accurate forecasting also on unseen data.

3. A risk explicit interval linear programming model for uncertainty-based environmental economic optimization in the Lake Fuxian watershed, China.

Science.gov (United States)

Zhang, Xiaoling; Huang, Kai; Zou, Rui; Liu, Yong; Yu, Yajuan

2013-01-01

The conflict of water environment protection and economic development has brought severe water pollution and restricted the sustainable development in the watershed. A risk explicit interval linear programming (REILP) method was used to solve integrated watershed environmental-economic optimization problem. Interval linear programming (ILP) and REILP models for uncertainty-based environmental economic optimization at the watershed scale were developed for the management of Lake Fuxian watershed, China. Scenario analysis was introduced into model solution process to ensure the practicality and operability of optimization schemes. Decision makers' preferences for risk levels can be expressed through inputting different discrete aspiration level values into the REILP model in three periods under two scenarios. Through balancing the optimal system returns and corresponding system risks, decision makers can develop an efficient industrial restructuring scheme based directly on the window of "low risk and high return efficiency" in the trade-off curve. The representative schemes at the turning points of two scenarios were interpreted and compared to identify a preferable planning alternative, which has the relatively low risks and nearly maximum benefits. This study provides new insights and proposes a tool, which was REILP, for decision makers to develop an effectively environmental economic optimization scheme in integrated watershed management.

4. A Risk Explicit Interval Linear Programming Model for Uncertainty-Based Environmental Economic Optimization in the Lake Fuxian Watershed, China

Directory of Open Access Journals (Sweden)

Xiaoling Zhang

2013-01-01

Full Text Available The conflict of water environment protection and economic development has brought severe water pollution and restricted the sustainable development in the watershed. A risk explicit interval linear programming (REILP method was used to solve integrated watershed environmental-economic optimization problem. Interval linear programming (ILP and REILP models for uncertainty-based environmental economic optimization at the watershed scale were developed for the management of Lake Fuxian watershed, China. Scenario analysis was introduced into model solution process to ensure the practicality and operability of optimization schemes. Decision makers’ preferences for risk levels can be expressed through inputting different discrete aspiration level values into the REILP model in three periods under two scenarios. Through balancing the optimal system returns and corresponding system risks, decision makers can develop an efficient industrial restructuring scheme based directly on the window of “low risk and high return efficiency” in the trade-off curve. The representative schemes at the turning points of two scenarios were interpreted and compared to identify a preferable planning alternative, which has the relatively low risks and nearly maximum benefits. This study provides new insights and proposes a tool, which was REILP, for decision makers to develop an effectively environmental economic optimization scheme in integrated watershed management.

5. A hybrid bird mating optimizer algorithm with teaching-learning-based optimization for global numerical optimization

Directory of Open Access Journals (Sweden)

Qingyang Zhang

2015-02-01

Full Text Available Bird Mating Optimizer (BMO is a novel meta-heuristic optimization algorithm inspired by intelligent mating behavior of birds. However, it is still insufficient in convergence of speed and quality of solution. To overcome these drawbacks, this paper proposes a hybrid algorithm (TLBMO, which is established by combining the advantages of Teaching-learning-based optimization (TLBO and Bird Mating Optimizer (BMO. The performance of TLBMO is evaluated on 23 benchmark functions, and compared with seven state-of-the-art approaches, namely BMO, TLBO, Artificial Bee Bolony (ABC, Particle Swarm Optimization (PSO, Fast Evolution Programming (FEP, Differential Evolution (DE, Group Search Optimization (GSO. Experimental results indicate that the proposed method performs better than other existing algorithms for global numerical optimization.

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

Directory of Open Access Journals (Sweden)

Yan Sun

2015-09-01

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

CERN Document Server

Dostal, Zdenek

2009-01-01

Quadratic programming (QP) is one technique that allows for the optimization of a quadratic function in several variables in the presence of linear constraints. This title presents various algorithms for solving large QP problems. It is suitable as an introductory text on quadratic programming for graduate students and researchers

Energy Technology Data Exchange (ETDEWEB)

Djukanovic, M.; Babic, B.; Milosevic, B. [Electrical Engineering Inst. Nikola Tesla, Belgrade (Yugoslavia); Sobajic, D.J. [EPRI, Palo Alto, CA (United States). Power System Control; Pao, Y.H. [Case Western Reserve Univ., Cleveland, OH (United States)]|[AI WARE, Inc., Cleveland, OH (United States)

1996-05-01

In this paper the blending/transloading facilities are modeled using an interactive fuzzy linear programming (FLP), in order to allow the decision-maker to solve the problem of uncertainty of input information within the fuel scheduling optimization. An interactive decision-making process is formulated in which decision-maker can learn to recognize good solutions by considering all possibilities of fuzziness. The application of the fuzzy formulation is accompanied by a careful examination of the definition of fuzziness, appropriateness of the membership function and interpretation of results. The proposed concept provides a decision support system with integration-oriented features, whereby the decision-maker can learn to recognize the relative importance of factors in the specific domain of optimal fuel scheduling (OFS) problem. The formulation of a fuzzy linear programming problem to obtain a reasonable nonfuzzy solution under consideration of the ambiguity of parameters, represented by fuzzy numbers, is introduced. An additional advantage of the FLP formulation is its ability to deal with multi-objective problems.

9. Optimizing the creation of base populations for aquaculture breeding programs using phenotypic and genomic data and its consequences on genetic progress.

Science.gov (United States)

Fernández, Jesús; Toro, Miguel Á; Sonesson, Anna K; Villanueva, Beatriz

2014-01-01

The success of an aquaculture breeding program critically depends on the way in which the base population of breeders is constructed since all the genetic variability for the traits included originally in the breeding goal as well as those to be included in the future is contained in the initial founders. Traditionally, base populations were created from a number of wild strains by sampling equal numbers from each strain. However, for some aquaculture species improved strains are already available and, therefore, mean phenotypic values for economically important traits can be used as a criterion to optimize the sampling when creating base populations. Also, the increasing availability of genome-wide genotype information in aquaculture species could help to refine the estimation of relationships within and between candidate strains and, thus, to optimize the percentage of individuals to be sampled from each strain. This study explores the advantages of using phenotypic and genome-wide information when constructing base populations for aquaculture breeding programs in terms of initial and subsequent trait performance and genetic diversity level. Results show that a compromise solution between diversity and performance can be found when creating base populations. Up to 6% higher levels of phenotypic performance can be achieved at the same level of global diversity in the base population by optimizing the selection of breeders instead of sampling equal numbers from each strain. The higher performance observed in the base population persisted during 10 generations of phenotypic selection applied in the subsequent breeding program.

10. Exploration of automatic optimization for CUDA programming

KAUST Repository

Al-Mouhamed, Mayez; Khan, Ayaz ul Hassan

2012-01-01

Graphic processing Units (GPUs) are gaining ground in high-performance computing. CUDA (an extension to C) is most widely used parallel programming framework for general purpose GPU computations. However, the task of writing optimized CUDA program is complex even for experts. We present a method for restructuring loops into an optimized CUDA kernels based on a 3-step algorithm which are loop tiling, coalesced memory access, and resource optimization. We also establish the relationships between the influencing parameters and propose a method for finding possible tiling solutions with coalesced memory access that best meets the identified constraints. We also present a simplified algorithm for restructuring loops and rewrite them as an efficient CUDA Kernel. The execution model of synthesized kernel consists of uniformly distributing the kernel threads to keep all cores busy while transferring a tailored data locality which is accessed using coalesced pattern to amortize the long latency of the secondary memory. In the evaluation, we implement some simple applications using the proposed restructuring strategy and evaluate the performance in terms of execution time and GPU throughput. © 2012 IEEE.

11. Exploration of automatic optimization for CUDA programming

KAUST Repository

Al-Mouhamed, Mayez

2012-12-01

Graphic processing Units (GPUs) are gaining ground in high-performance computing. CUDA (an extension to C) is most widely used parallel programming framework for general purpose GPU computations. However, the task of writing optimized CUDA program is complex even for experts. We present a method for restructuring loops into an optimized CUDA kernels based on a 3-step algorithm which are loop tiling, coalesced memory access, and resource optimization. We also establish the relationships between the influencing parameters and propose a method for finding possible tiling solutions with coalesced memory access that best meets the identified constraints. We also present a simplified algorithm for restructuring loops and rewrite them as an efficient CUDA Kernel. The execution model of synthesized kernel consists of uniformly distributing the kernel threads to keep all cores busy while transferring a tailored data locality which is accessed using coalesced pattern to amortize the long latency of the secondary memory. In the evaluation, we implement some simple applications using the proposed restructuring strategy and evaluate the performance in terms of execution time and GPU throughput. © 2012 IEEE.

12. Optimal installation program for reprocessing plants

International Nuclear Information System (INIS)

Kubokawa, Toshihiko; Kiyose, Ryohei

1976-01-01

Optimization of the program of installation of reprocessing plants is mathematically formulated as problem of mixed integer programming, which is numerically solved by the branch-and-bound method. A new concept of quasi-penalty is used to obviate the difficulties associated with dual degeneracy. The finiteness of the useful life of the plant is also taken into consideration. It is shown that an analogous formulation is possible for the cases in which the demand forecasts and expected plant lives cannot be predicted with certainty. The scale of the problem is found to have kN binary variables, (k+2)N continuous variables, and (k+3)N constraint conditions, where k is the number of intervals used in the piece-wise linear approximation of a nonlinear objective function, and N the overall duration of the period covered by the installation program. Calculations are made for N=24 yr and k=3, with the assumption that the plant life is 15 yr, the plant scale factor 0.5, and the maximum plant capacity 900 (t/yr). The results are calculated and discussed for four different demand forecasts. The difference of net profit between optimal and non-optimal installation programs is found to be in the range of 50 -- 100 M$. The pay-off matrix is calculated, and the optimal choice of action when the demand cannot be forecast with certainty is determined by applying Bayes' theory. The optimal installation program under such conditions of uncertainty is obtained also with a stochastic mixed integer programming model. (auth.) 13. Worst-Case Execution Time Based Optimization of Real-Time Java Programs DEFF Research Database (Denmark) Hepp, Stefan; Schoeberl, Martin 2012-01-01 optimization is method in lining. It is especially important for languages, like Java, where small setter and getter methods are considered good programming style. In this paper we present and explore WCET driven in lining of Java methods. We use the WCET analysis tool for the Java processor JOP to guide... 14. PAPR reduction in FBMC using an ACE-based linear programming optimization Science.gov (United States) van der Neut, Nuan; Maharaj, Bodhaswar TJ; de Lange, Frederick; González, Gustavo J.; Gregorio, Fernando; Cousseau, Juan 2014-12-01 This paper presents four novel techniques for peak-to-average power ratio (PAPR) reduction in filter bank multicarrier (FBMC) modulation systems. The approach extends on current PAPR reduction active constellation extension (ACE) methods, as used in orthogonal frequency division multiplexing (OFDM), to an FBMC implementation as the main contribution. The four techniques introduced can be split up into two: linear programming optimization ACE-based techniques and smart gradient-project (SGP) ACE techniques. The linear programming (LP)-based techniques compensate for the symbol overlaps by utilizing a frame-based approach and provide a theoretical upper bound on achievable performance for the overlapping ACE techniques. The overlapping ACE techniques on the other hand can handle symbol by symbol processing. Furthermore, as a result of FBMC properties, the proposed techniques do not require side information transmission. The PAPR performance of the techniques is shown to match, or in some cases improve, on current PAPR techniques for FBMC. Initial analysis of the computational complexity of the SGP techniques indicates that the complexity issues with PAPR reduction in FBMC implementations can be addressed. The out-of-band interference introduced by the techniques is investigated. As a result, it is shown that the interference can be compensated for, whilst still maintaining decent PAPR performance. Additional results are also provided by means of a study of the PAPR reduction of the proposed techniques at a fixed clipping probability. The bit error rate (BER) degradation is investigated to ensure that the trade-off in terms of BER degradation is not too severe. As illustrated by exhaustive simulations, the SGP ACE-based technique proposed are ideal candidates for practical implementation in systems employing the low-complexity polyphase implementation of FBMC modulators. The methods are shown to offer significant PAPR reduction and increase the feasibility of FBMC as 15. 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. 16. Methods for optimizing over the efficient and weakly efficient sets of an affine fractional vector optimization program DEFF Research Database (Denmark) Le, T.H.A.; Pham, D. T.; Canh, Nam Nguyen 2010-01-01 Both the efficient and weakly efficient sets of an affine fractional vector optimization problem, in general, are neither convex nor given explicitly. Optimization problems over one of these sets are thus nonconvex. We propose two methods for optimizing a real-valued function over the efficient...... and weakly efficient sets of an affine fractional vector optimization problem. The first method is a local one. By using a regularization function, we reformulate the problem into a standard smooth mathematical programming problem that allows applying available methods for smooth programming. In case...... the objective function is linear, we have investigated a global algorithm based upon a branch-and-bound procedure. The algorithm uses Lagrangian bound coupling with a simplicial bisection in the criteria space. Preliminary computational results show that the global algorithm is promising.... 17. Development of a VVER-1000 core loading pattern optimization program based on perturbation theory International Nuclear Information System (INIS) Hosseini, Mohammad; Vosoughi, Naser 2012-01-01 Highlights: ► We use perturbation theory to find an optimum fuel loading pattern in a VVER-1000. ► We provide a software for in-core fuel management optimization. ► We consider two objectives for our method (perturbation theory). ► We show that perturbation theory method is very fast and accurate for optimization. - Abstract: In-core nuclear fuel management is one of the most important concerns in the design of nuclear reactors. Two main goals in core fuel loading pattern design optimization are maximizing the core effective multiplication factor in order to extract the maximum energy, and keeping the local power peaking factor lower than a predetermined value to maintain the fuel integrity. Because of the numerous possible patterns of fuel assemblies in the reactor core, finding the best configuration is so important and challenging. Different techniques for optimization of fuel loading pattern in the reactor core have been introduced by now. In this study, a software is programmed in C language to find an order of the fuel loading pattern of a VVER-1000 reactor core using the perturbation theory. Our optimization method is based on minimizing the radial power peaking factor. The optimization process launches by considering an initial loading pattern and the specifications of the fuel assemblies which are given as the input of the software. The results on a typical VVER-1000 reactor reveal that the method could reach to a pattern with an allowed radial power peaking factor and increases the cycle length 1.1 days, as well. 18. Optimization of Algorithms Using Extensions of Dynamic Programming KAUST Repository AbouEisha, Hassan M. 2017-04-09 We study and answer questions related to the complexity of various important problems such as: multi-frontal solvers of hp-adaptive finite element method, sorting and majority. We advocate the use of dynamic programming as a viable tool to study optimal algorithms for these problems. The main approach used to attack these problems is modeling classes of algorithms that may solve this problem using a discrete model of computation then defining cost functions on this discrete structure that reflect different complexity measures of the represented algorithms. As a last step, dynamic programming algorithms are designed and used to optimize those models (algorithms) and to obtain exact results on the complexity of the studied problems. The first part of the thesis presents a novel model of computation (element partition tree) that represents a class of algorithms for multi-frontal solvers along with cost functions reflecting various complexity measures such as: time and space. It then introduces dynamic programming algorithms for multi-stage and bi-criteria optimization of element partition trees. In addition, it presents results based on optimal element partition trees for famous benchmark meshes such as: meshes with point and edge singularities. New improved heuristics for those benchmark meshes were ob- tained based on insights of the optimal results found by our algorithms. The second part of the thesis starts by introducing a general problem where different problems can be reduced to and show how to use a decision table to model such problem. We describe how decision trees and decision tests for this table correspond to adaptive and non-adaptive algorithms for the original problem. We present exact bounds on the average time complexity of adaptive algorithms for the eight elements sorting problem. Then bounds on adaptive and non-adaptive algorithms for a variant of the majority problem are introduced. Adaptive algorithms are modeled as decision trees whose depth 19. A model based on stochastic dynamic programming for determining China's optimal strategic petroleum reserve policy International Nuclear Information System (INIS) Zhang Xiaobing; Fan Ying; Wei Yiming 2009-01-01 China's Strategic Petroleum Reserve (SPR) is currently being prepared. But how large the optimal stockpile size for China should be, what the best acquisition strategies are, how to release the reserve if a disruption occurs, and other related issues still need to be studied in detail. In this paper, we develop a stochastic dynamic programming model based on a total potential cost function of establishing SPRs to evaluate the optimal SPR policy for China. Using this model, empirical results are presented for the optimal size of China's SPR and the best acquisition and drawdown strategies for a few specific cases. The results show that with comprehensive consideration, the optimal SPR size for China is around 320 million barrels. This size is equivalent to about 90 days of net oil import amount in 2006 and should be reached in the year 2017, three years earlier than the national goal, which implies that the need for China to fill the SPR is probably more pressing; the best stockpile release action in a disruption is related to the disruption levels and expected continuation probabilities. The information provided by the results will be useful for decision makers. 20. Robust optimization-based DC optimal power flow for managing wind generation uncertainty Science.gov (United States) Boonchuay, Chanwit; Tomsovic, Kevin; Li, Fangxing; Ongsakul, Weerakorn 2012-11-01 Integrating wind generation into the wider grid causes a number of challenges to traditional power system operation. Given the relatively large wind forecast errors, congestion management tools based on optimal power flow (OPF) need to be improved. In this paper, a robust optimization (RO)-based DCOPF is proposed to determine the optimal generation dispatch and locational marginal prices (LMPs) for a day-ahead competitive electricity market considering the risk of dispatch cost variation. The basic concept is to use the dispatch to hedge against the possibility of reduced or increased wind generation. The proposed RO-based DCOPF is compared with a stochastic non-linear programming (SNP) approach on a modified PJM 5-bus system. Primary test results show that the proposed DCOPF model can provide lower dispatch cost than the SNP approach. 1. Optimal Design of Measurement Programs for the Parameter Identification of Dynamic Systems DEFF Research Database (Denmark) Kirkegaard, Poul Henning; Sørensen, John Dalsgaard; Brincker, Rune The design of measurement programs devoted to parameter identification of structural dynamic systems is considered. The design problem is formulated as an optimization problem to minimize the total expected cost that is the cost of failure and the cost of the measurement program. All...... the calculations are based on a priori knowledge and engineering judgement. One of the contribution of the approach is that the optimal number of sensors can be estimated. This is shown in a numerical example where the proposed approach is demonstrated. The example is concerned with design of a measurement program... 2. Optimal Design of Measurement Programs for the Parameter Identification of Dynamic Systems DEFF Research Database (Denmark) Kirkegaard, Poul Henning; Sørensen, John Dalsgaard; Brincker, Rune The design of a measured program devoted to parameter identification of structural dynamic systems is considered, the design problem is formulated as an optimization problem due to minimize the total expected cost of the measurement program. All the calculations are based on a priori knowledge...... and engineering judgement. One of the contribution of the approach is that the optimal nmber of sensors can be estimated. This is sown in an numerical example where the proposed approach is demonstrated. The example is concerned with design of a measurement program for estimating the modal damping parameters... 3. Optimizing the Regional Industrial Structure Based on the Environmental Carrying Capacity: An Inexact Fuzzy Multi-Objective Programming Model Directory of Open Access Journals (Sweden) Wenyi Wang 2013-12-01 Full Text Available An inexact fuzzy multi-objective programming model (IFMOP based on the environmental carrying capacity is provided for industrial structure optimization problems. In the IFMOP model, both fuzzy linear programming (FLP and inexact linear programming (ILP methods are introduced into a multi-objective programming framework. It allows uncertainties to be directly communicated into the problem solving processing, and it can effectively reflect the complexity and uncertainty of an industrial system without impractical simplification. The two objective functions utilized in the optimization study are the maximum total output value and population size, and the constraints include water environmental capacity, water resource supply, atmospheric environmental capacity and energy supply. The model is subsequently employed in a realistic case for industrial development in the Tongzhou district, Beijing, China. The results demonstrate that the model can help to analyze whether the environmental carrying capacity of Tongzhou can meet the needs of the social economic objectives in the new town plan in the two scenarios and can assist decision makers in generating stable and balanced industrial structure patterns with consideration of the resources, energy and environmental constraints to meet the maximum social economic efficiency. 4. Graphic Interface for LCP2 Optimization Program DEFF Research Database (Denmark) Nicolae, Taropa Laurentiu; Gaunholt, Hans 1998-01-01 This report provides information about the software interface that is programmed for the Optimization Program LCP2. The first part is about the general description of the program followed by a guide for using the interface. The last chapters contain a discussion about problems or futute extension...... of the project. The program is written in Visual C++5.0 on a Windows NT4.0 operating system.......This report provides information about the software interface that is programmed for the Optimization Program LCP2. The first part is about the general description of the program followed by a guide for using the interface. The last chapters contain a discussion about problems or futute extensions... 5. Uncertain and multi-objective programming models for crop planting structure optimization Directory of Open Access Journals (Sweden) Mo LI,Ping GUO,Liudong ZHANG,Chenglong ZHANG 2016-03-01 Full Text Available Crop planting structure optimization is a significant way to increase agricultural economic benefits and improve agricultural water management. The complexities of fluctuating stream conditions, varying economic profits, and uncertainties and errors in estimated modeling parameters, as well as the complexities among economic, social, natural resources and environmental aspects, have led to the necessity of developing optimization models for crop planting structure which consider uncertainty and multi-objectives elements. In this study, three single-objective programming models under uncertainty for crop planting structure optimization were developed, including an interval linear programming model, an inexact fuzzy chance-constrained programming (IFCCP model and an inexact fuzzy linear programming (IFLP model. Each of the three models takes grayness into account. Moreover, the IFCCP model considers fuzzy uncertainty of parameters/variables and stochastic characteristics of constraints, while the IFLP model takes into account the fuzzy uncertainty of both constraints and objective functions. To satisfy the sustainable development of crop planting structure planning, a fuzzy-optimization-theory-based fuzzy linear multi-objective programming model was developed, which is capable of reflecting both uncertainties and multi-objective. In addition, a multi-objective fractional programming model for crop structure optimization was also developed to quantitatively express the multi-objective in one optimization model with the numerator representing maximum economic benefits and the denominator representing minimum crop planting area allocation. These models better reflect actual situations, considering the uncertainties and multi-objectives of crop planting structure optimization systems. The five models developed were then applied to a real case study in Minqin County, north-west China. The advantages, the applicable conditions and the solution methods 6. Optimal design of distributed energy resource systems based on two-stage stochastic programming International Nuclear Information System (INIS) Yang, Yun; Zhang, Shijie; Xiao, Yunhan 2017-01-01 Highlights: • A two-stage stochastic programming model is built to design DER systems under uncertainties. • Uncertain energy demands have a significant effect on the optimal design. • Uncertain energy prices and renewable energy intensity have little effect on the optimal design. • The economy is overestimated if the system is designed without considering the uncertainties. • The uncertainty in energy prices has the significant and greatest effect on the economy. - Abstract: Multiple uncertainties exist in the optimal design of distributed energy resource (DER) systems. The expected energy, economic, and environmental benefits may not be achieved and a deficit in energy supply may occur if the uncertainties are not handled properly. This study focuses on the optimal design of DER systems with consideration of the uncertainties. A two-stage stochastic programming model is built in consideration of the discreteness of equipment capacities, equipment partial load operation and output bounds as well as of the influence of ambient temperature on gas turbine performance. The stochastic model is then transformed into its deterministic equivalent and solved. For an illustrative example, the model is applied to a hospital in Lianyungang, China. Comparative studies are performed to evaluate the effect of the uncertainties in load demands, energy prices, and renewable energy intensity separately and simultaneously on the system’s economy and optimal design. Results show that the uncertainties in load demands have a significant effect on the optimal system design, whereas the uncertainties in energy prices and renewable energy intensity have almost no effect. Results regarding economy show that it is obviously overestimated if the system is designed without considering the uncertainties. 7. An optimal maintenance policy for machine replacement problem using dynamic programming Directory of Open Access Journals (Sweden) Mohsen Sadegh Amalnik 2017-06-01 Full Text Available In this article, we present an acceptance sampling plan for machine replacement problem based on the backward dynamic programming model. Discount dynamic programming is used to solve a two-state machine replacement problem. We plan to design a model for maintenance by consid-ering the quality of the item produced. The purpose of the proposed model is to determine the optimal threshold policy for maintenance in a finite time horizon. We create a decision tree based on a sequential sampling including renew, repair and do nothing and wish to achieve an optimal threshold for making decisions including renew, repair and continue the production in order to minimize the expected cost. Results show that the optimal policy is sensitive to the data, for the probability of defective machines and parameters defined in the model. This can be clearly demonstrated by a sensitivity analysis technique. 8. Optimizing the hydraulic program of cementing casing strings Energy Technology Data Exchange (ETDEWEB) Novakovic, M 1984-01-01 A technique is described for calculating the optimal parameters of the flow of plugging mud which takes into consideration the geometry of the annular space and the rheological characteristics of the muds. The optimization algorithm was illustrated by a block diagram. Examples are given for practical application of the optimization programs in production conditions. It is stressed that optimizing the hydraulic cementing program is effective if other technical-technological problems in cementing casing strings have been resolved. 9. 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 10. Portfolio optimization using fuzzy linear programming Science.gov (United States) Pandit, Purnima K. 2013-09-01 Portfolio Optimization (PO) is a problem in Finance, in which investor tries to maximize return and minimize risk by carefully choosing different assets. Expected return and risk are the most important parameters with regard to optimal portfolios. In the simple form PO can be modeled as quadratic programming problem which can be put into equivalent linear form. PO problems with the fuzzy parameters can be solved as multi-objective fuzzy linear programming problem. In this paper we give the solution to such problems with an illustrative example. 11. Optimization strategies based on sequential quadratic programming applied for a fermentation process for butanol production. Science.gov (United States) Pinto Mariano, Adriano; Bastos Borba Costa, Caliane; de Franceschi de Angelis, Dejanira; Maugeri Filho, Francisco; Pires Atala, Daniel Ibraim; Wolf Maciel, Maria Regina; Maciel Filho, Rubens 2009-11-01 In this work, the mathematical optimization of a continuous flash fermentation process for the production of biobutanol was studied. The process consists of three interconnected units, as follows: fermentor, cell-retention system (tangential microfiltration), and vacuum flash vessel (responsible for the continuous recovery of butanol from the broth). The objective of the optimization was to maximize butanol productivity for a desired substrate conversion. Two strategies were compared for the optimization of the process. In one of them, the process was represented by a deterministic model with kinetic parameters determined experimentally and, in the other, by a statistical model obtained using the factorial design technique combined with simulation. For both strategies, the problem was written as a nonlinear programming problem and was solved with the sequential quadratic programming technique. The results showed that despite the very similar solutions obtained with both strategies, the problems found with the strategy using the deterministic model, such as lack of convergence and high computational time, make the use of the optimization strategy with the statistical model, which showed to be robust and fast, more suitable for the flash fermentation process, being recommended for real-time applications coupling optimization and control. 12. APPLYING ROBUST RANKING METHOD IN TWO PHASE FUZZY OPTIMIZATION LINEAR PROGRAMMING PROBLEMS (FOLPP Directory of Open Access Journals (Sweden) Monalisha Pattnaik 2014-12-01 Full Text Available Background: This paper explores the solutions to the fuzzy optimization linear program problems (FOLPP where some parameters are fuzzy numbers. In practice, there are many problems in which all decision parameters are fuzzy numbers, and such problems are usually solved by either probabilistic programming or multi-objective programming methods. Methods: In this paper, using the concept of comparison of fuzzy numbers, a very effective method is introduced for solving these problems. This paper extends linear programming based problem in fuzzy environment. With the problem assumptions, the optimal solution can still be theoretically solved using the two phase simplex based method in fuzzy environment. To handle the fuzzy decision variables can be initially generated and then solved and improved sequentially using the fuzzy decision approach by introducing robust ranking technique. Results and conclusions: The model is illustrated with an application and a post optimal analysis approach is obtained. The proposed procedure was programmed with MATLAB (R2009a version software for plotting the four dimensional slice diagram to the application. Finally, numerical example is presented to illustrate the effectiveness of the theoretical results, and to gain additional managerial insights. 13. Topology optimization of induction heating model using sequential linear programming based on move limit with adaptive relaxation Science.gov (United States) Masuda, Hiroshi; Kanda, Yutaro; Okamoto, Yoshifumi; Hirono, Kazuki; Hoshino, Reona; Wakao, Shinji; Tsuburaya, Tomonori 2017-12-01 It is very important to design electrical machineries with high efficiency from the point of view of saving energy. Therefore, topology optimization (TO) is occasionally used as a design method for improving the performance of electrical machinery under the reasonable constraints. Because TO can achieve a design with much higher degree of freedom in terms of structure, there is a possibility for deriving the novel structure which would be quite different from the conventional structure. In this paper, topology optimization using sequential linear programming using move limit based on adaptive relaxation is applied to two models. The magnetic shielding, in which there are many local minima, is firstly employed as firstly benchmarking for the performance evaluation among several mathematical programming methods. Secondly, induction heating model is defined in 2-D axisymmetric field. In this model, the magnetic energy stored in the magnetic body is maximized under the constraint on the volume of magnetic body. Furthermore, the influence of the location of the design domain on the solutions is investigated. 14. Near-Optimal Tracking Control of Mobile Robots Via Receding-Horizon Dual Heuristic Programming. Science.gov (United States) Lian, Chuanqiang; Xu, Xin; Chen, Hong; He, Haibo 2016-11-01 Trajectory tracking control of wheeled mobile robots (WMRs) has been an important research topic in control theory and robotics. Although various tracking control methods with stability have been developed for WMRs, it is still difficult to design optimal or near-optimal tracking controller under uncertainties and disturbances. In this paper, a near-optimal tracking control method is presented for WMRs based on receding-horizon dual heuristic programming (RHDHP). In the proposed method, a backstepping kinematic controller is designed to generate desired velocity profiles and the receding horizon strategy is used to decompose the infinite-horizon optimal control problem into a series of finite-horizon optimal control problems. In each horizon, a closed-loop tracking control policy is successively updated using a class of approximate dynamic programming algorithms called finite-horizon dual heuristic programming (DHP). The convergence property of the proposed method is analyzed and it is shown that the tracking control system based on RHDHP is asymptotically stable by using the Lyapunov approach. Simulation results on three tracking control problems demonstrate that the proposed method has improved control performance when compared with conventional model predictive control (MPC) and DHP. It is also illustrated that the proposed method has lower computational burden than conventional MPC, which is very beneficial for real-time tracking control. 15. Networked Timetable Stability Improvement Based on a Bilevel Optimization Programming Model Directory of Open Access Journals (Sweden) Xuelei Meng 2014-01-01 Full Text Available Train timetable stability is the possibility to recover the status of the trains to serve as arranged according to the original timetable when the trains are disturbed. To improve the train timetable stability from the network perspective, the bilevel programming model is constructed, in which the upper level programming is to optimize the timetable stability on the network level and the lower is to improve the timetable stability on the dispatching railway segments. Timetable stability on the network level is defined with the variances of the utilization coefficients of the section capacity and station capacity. Weights of stations and sections are decided by the capacity index number and the degrees. The lower level programming focuses on the buffer time distribution plan of the trains operating on the sections and stations, taking the operating rules of the trains as constraints. A novel particle swarm algorithm is proposed and designed for the bilevel programming model. The computing case proves the feasibility of the model and the efficiency of the algorithm. The method outlined in this paper can be embedded in the networked train operation dispatching system. 16. Adaptive dynamic programming with applications in optimal control CERN Document Server Liu, Derong; Wang, Ding; Yang, Xiong; Li, Hongliang 2017-01-01 This book covers the most recent developments in adaptive dynamic programming (ADP). The text begins with a thorough background review of ADP making sure that readers are sufficiently familiar with the fundamentals. In the core of the book, the authors address first discrete- and then continuous-time systems. Coverage of discrete-time systems starts with a more general form of value iteration to demonstrate its convergence, optimality, and stability with complete and thorough theoretical analysis. A more realistic form of value iteration is studied where value function approximations are assumed to have finite errors. Adaptive Dynamic Programming also details another avenue of the ADP approach: policy iteration. Both basic and generalized forms of policy-iteration-based ADP are studied with complete and thorough theoretical analysis in terms of convergence, optimality, stability, and error bounds. Among continuous-time systems, the control of affine and nonaffine nonlinear systems is studied using the ADP app... 17. Impact of Demand Response Programs on Optimal Operation of Multi-Microgrid System Directory of Open Access Journals (Sweden) Anh-Duc Nguyen 2018-06-01 Full Text Available The increased penetration of renewables is beneficial for power systems but it poses several challenges, i.e., uncertainty in power supply, power quality issues, and other technical problems. Backup generators or storage system have been proposed to solve this problem but there are limitations remaining due to high installation and maintenance cost. Furthermore, peak load is also an issue in the power distribution system. Due to the adjustable characteristics of loads, strategies on demand side such as demand response (DR are more appropriate in order to deal with these challenges. Therefore, this paper studies how DR programs influence the operation of the multi-microgrid (MMG. The implementation is executed based on a hierarchical energy management system (HiEMS including microgrid EMSs (MG-EMSs responsible for local optimization in each MG and community EMS (C-EMS responsible for community optimization in the MMG. Mixed integer linear programming (MILP-based mathematical models are built for MMG optimal operation. Five scenarios consisting of single DR programs and DR groups are tested in an MMG test system to evaluate their impact on MMG operation. Among the five scenarios, some DR programs apply curtailing strategies, resulting in a study about the influence of base load value and curtailable load percentage on the amount of curtailed load and shifted load as well as the operation cost of the MMG. Furthermore, the impact of DR programs on the amount of external and internal trading power in the MMG is also examined. In summary, each individual DR program or group could be handy in certain situations depending on the interest of the MMG such as external trading, self-sufficiency or operation cost minimization. 18. Optimal Design of Measurement Programs for the Parameter Identification of Dynamic Systems DEFF Research Database (Denmark) Kirkegaard, Poul Henning; Sørensen, John Dalsgaard; Brincker, Rune 1993-01-01 The design of a measurement program devoted to parameter identification of structural dynamic systems is considered. The design problem is formulated as an optimization problem to minimize the total expected cost that is the cost of failure and the cost of the measurement program. All...... the calculations are based on a priori knowledge and engineering judgement. One of the contribution of the approach is that the optimal number of sensory can be estimated. This is shown in an numerical example where the proposed approach is demonstrated. The example is concerned with design of a measurement... 19. Optimal Design of Measurement Programs for the Parameter Identification of Dynamic Systems DEFF Research Database (Denmark) Kirkegaard, Poul Henning; Sørensen, John Dalsgaard; Brincker, Rune 1991-01-01 The design of a measurement program devoted to parameter identification of structural dynamic systems is considered. The design problem is formulated as an optimization problem to minimize the total expected cost, i.e. the cost of failure and the cost of the measurement program. All...... the calculations are based on a priori knowledge and engineering judgement. One of the contributions of the approach is that the optimal number of sensors can be estimated. This is shown in a numerical example where the proposed approach is demonstrated. The example is concerned with design of a measurement... 20. The optimization of demand response programs in smart grids International Nuclear Information System (INIS) Derakhshan, Ghasem; Shayanfar, Heidar Ali; Kazemi, Ahad 2016-01-01 The potential to schedule portion of the electricity demand in smart energy systems is clear as a significant opportunity to enhance the efficiency of the grids. Demand response is one of the new developments in the field of electricity which is meant to engage consumers in improving the energy consumption pattern. We used Teaching & Learning based Optimization (TLBO) and Shuffled Frog Leaping (SFL) algorithms to propose an optimization model for consumption scheduling in smart grid when payment costs of different periods are reduced. This study conducted on four types residential consumers obtained in the summer for some residential houses located in the centre of Tehran city in Iran: first with time of use pricing, second with real-time pricing, third one with critical peak pricing, and the last consumer had no tariff for pricing. The results demonstrate that the adoption of demand response programs can reduce total payment costs and determine a more efficient use of optimization techniques. - Highlights: •An optimization model for the demand response program is made. •TLBO and SFL algorithms are applied to reduce payment costs in smart grid. •The optimal condition is provided for the maximization of the social welfare problem. •An application to some residential houses located in the centre of Tehran city in Iran is demonstrated. 1. Averaging and Linear Programming in Some Singularly Perturbed Problems of Optimal Control Energy Technology Data Exchange (ETDEWEB) Gaitsgory, Vladimir, E-mail: vladimir.gaitsgory@mq.edu.au [Macquarie University, Department of Mathematics (Australia); Rossomakhine, Sergey, E-mail: serguei.rossomakhine@flinders.edu.au [Flinders University, Flinders Mathematical Sciences Laboratory, School of Computer Science, Engineering and Mathematics (Australia) 2015-04-15 The paper aims at the development of an apparatus for analysis and construction of near optimal solutions of singularly perturbed (SP) optimal controls problems (that is, problems of optimal control of SP systems) considered on the infinite time horizon. We mostly focus on problems with time discounting criteria but a possibility of the extension of results to periodic optimization problems is discussed as well. Our consideration is based on earlier results on averaging of SP control systems and on linear programming formulations of optimal control problems. The idea that we exploit is to first asymptotically approximate a given problem of optimal control of the SP system by a certain averaged optimal control problem, then reformulate this averaged problem as an infinite-dimensional linear programming (LP) problem, and then approximate the latter by semi-infinite LP problems. We show that the optimal solution of these semi-infinite LP problems and their duals (that can be found with the help of a modification of an available LP software) allow one to construct near optimal controls of the SP system. We demonstrate the construction with two numerical examples. 2. A METHOD FOR SOLVING LINEAR PROGRAMMING PROBLEMS WITH FUZZY PARAMETERS BASED ON MULTIOBJECTIVE LINEAR PROGRAMMING TECHNIQUE OpenAIRE M. ZANGIABADI; H. R. MALEKI 2007-01-01 In the real-world optimization problems, coefficients of the objective function are not known precisely and can be interpreted as fuzzy numbers. In this paper we define the concepts of optimality for linear programming problems with fuzzy parameters based on those for multiobjective linear programming problems. Then by using the concept of comparison of fuzzy numbers, we transform a linear programming problem with fuzzy parameters to a multiobjective linear programming problem. To this end, w... 3. An optimal maintenance policy for machine replacement problem using dynamic programming OpenAIRE Mohsen Sadegh Amalnik; Morteza Pourgharibshahi 2017-01-01 In this article, we present an acceptance sampling plan for machine replacement problem based on the backward dynamic programming model. Discount dynamic programming is used to solve a two-state machine replacement problem. We plan to design a model for maintenance by consid-ering the quality of the item produced. The purpose of the proposed model is to determine the optimal threshold policy for maintenance in a finite time horizon. We create a decision tree based on a sequential sampling inc... 4. Optimal Implantable Cardioverter Defibrillator Programming. Science.gov (United States) Shah, Bindi K Optimal programming of implantable cardioverter defibrillators (ICDs) is essential to appropriately treat ventricular tachyarrhythmias and to avoid unnecessary and inappropriate shocks. There have been a series of large clinical trials evaluating tailored programming of ICDs. We reviewed the clinical trials evaluating ICD therapies and detection, and the consensus statement on ICD programming. In doing so, we found that prolonged ICD detection times, higher rate cutoffs, and antitachycardia pacing (ATP) programming decreases inappropriate and painful therapies in a primary prevention population. The use of supraventricular tachyarrhythmia discriminators can also decrease inappropriate shocks. Tailored ICD programming using the knowledge gained from recent ICD trials can decrease inappropriate and unnecessary ICD therapies and decrease mortality. 5. The established mega watt linear programming-based optimal power flow model applied to the real power 56-bus system in eastern province of Saudi Arabia International Nuclear Information System (INIS) Al-Muhawesh, Tareq A.; Qamber, Isa S. 2008-01-01 A current trend in electric power industries is the deregulation around the world. One of the questions arise during any deregulation process is: where will be the future generation expansion? In the present paper, the study is concentrated on the wheeling computational method as a part of mega watt (MW) linear programming-based optimal power flow (LP-based OPF) method. To observe the effects of power wheeling on the power system operations, the paper uses linear interactive and discrete optimizer (LINDO) optimizer software as a powerful tool for solving linear programming problems to evaluate the influence of the power wheeling. As well, the paper uses the optimization tool to solve the economic generation dispatch and transmission management problems. The transmission line flow was taken in consideration with some constraints discussed in this paper. The complete linear model of the MW LP-based OPF, which is used to know the future generation potential areas in any utility is proposed. The paper also explains the available economic load dispatch (ELD) as the basic optimization tool to dispatch the power system. It can be concluded in the present study that accuracy is expensive in terms of money and time and in the competitive market enough accuracy is needed without paying much 6. 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 7. Optimal investment in a portfolio of HIV prevention programs. Science.gov (United States) Zaric, G S; Brandeau, M L 2001-01-01 In this article, the authors determine the optimal allocation of HIV prevention funds and investigate the impact of different allocation methods on health outcomes. The authors present a resource allocation model that can be used to determine the allocation of HIV prevention funds that maximizes quality-adjusted life years (or life years) gained or HIV infections averted in a population over a specified time horizon. They apply the model to determine the allocation of a limited budget among 3 types of HIV prevention programs in a population of injection drug users and nonusers: needle exchange programs, methadone maintenance treatment, and condom availability programs. For each prevention program, the authors estimate a production function that relates the amount invested to the associated change in risky behavior. The authors determine the optimal allocation of funds for both objective functions for a high-prevalence population and a low-prevalence population. They also consider the allocation of funds under several common rules of thumb that are used to allocate HIV prevention resources. It is shown that simpler allocation methods (e.g., allocation based on HIV incidence or notions of equity among population groups) may lead to alloctions that do not yield the maximum health benefit. The optimal allocation of HIV prevention funds in a population depends on HIV prevalence and incidence, the objective function, the production functions for the prevention programs, and other factors. Consideration of cost, equity, and social and political norms may be important when allocating HIV prevention funds. The model presented in this article can help decision makers determine the health consequences of different allocations of funds. 8. OPF-Based Optimal Location of Two Systems Two Terminal HVDC to Power System Optimal Operation Directory of Open Access Journals (Sweden) Mehdi Abolfazli 2013-04-01 Full Text Available In this paper a suitable mathematical model of the two terminal HVDC system is provided for optimal power flow (OPF and optimal location based on OPF such power injection model. The ability of voltage source converter (VSC-based HVDC to independently control active and reactive power is well represented by the model. The model is used to develop an OPF-based optimal location algorithm of two systems two terminal HVDC to minimize the total fuel cost and active power losses as objective function. The optimization framework is modeled as non-linear programming (NLP and solved by Matlab and GAMS softwares. The proposed algorithm is implemented on the IEEE 14- and 30-bus test systems. The simulation results show ability of two systems two terminal HVDC in improving the power system operation. Furthermore, two systems two terminal HVDC is compared by PST and OUPFC in the power system operation from economical and technical aspects. 9. Risk-Constrained Dynamic Programming for Optimal Mars Entry, Descent, and Landing Science.gov (United States) Ono, Masahiro; Kuwata, Yoshiaki 2013-01-01 A chance-constrained dynamic programming algorithm was developed that is capable of making optimal sequential decisions within a user-specified risk bound. This work handles stochastic uncertainties over multiple stages in the CEMAT (Combined EDL-Mobility Analyses Tool) framework. It was demonstrated by a simulation of Mars entry, descent, and landing (EDL) using real landscape data obtained from the Mars Reconnaissance Orbiter. Although standard dynamic programming (DP) provides a general framework for optimal sequential decisionmaking under uncertainty, it typically achieves risk aversion by imposing an arbitrary penalty on failure states. Such a penalty-based approach cannot explicitly bound the probability of mission failure. A key idea behind the new approach is called risk allocation, which decomposes a joint chance constraint into a set of individual chance constraints and distributes risk over them. The joint chance constraint was reformulated into a constraint on an expectation over a sum of an indicator function, which can be incorporated into the cost function by dualizing the optimization problem. As a result, the chance-constraint optimization problem can be turned into an unconstrained optimization over a Lagrangian, which can be solved efficiently using a standard DP approach. 10. Optimization of axial enrichment and gadolinia distributions for BWR fuel under control rod programming, (2) International Nuclear Information System (INIS) Hida, Kazuki; Yoshioka, Ritsuo 1992-01-01 A method has been developed for optimizing the axial enrichment and gadolinia distributions for the reload BWR fuel under control rod programming. The problem was to minimize the enrichment requirement subject to the criticality and axial power peaking constraints. The optimization technique was based on the successive linear programming method, each linear programming problem being solved by a goal programming algorithm. A rapid and practically accurate core neutronics model, named the modified one-dimensional core model, was developed to describe the batch-averaged burnup behavior of the reload fuel. A core burnup simulation algorithm, employing a burnup-power-void iteration, was also developed to calculate the rigorous equilibrium cycle performance. This method was applied to the optimization of axial two- and 24-region fuels for demonstrative purposes. The optimal solutions for both fuels have proved the optimality of what is called burnup shape optimization spectral shift. For the two-region fuel with a practical power peaking of 1.4, the enrichment distribution was nearly uniform, because a bottom-peaked burnup shape flattens the axial power shape. Optimization of the 24-region fuel has shown a potential improvement in BWR fuel cycle economics, which will guide future advancement in BWR fuel designs. (author) 11. Lean and Efficient Software: Whole-Program Optimization of Executables Science.gov (United States) 2015-09-30 Lean and Efficient Software: Whole-Program Optimization of Executables” Project Summary Report #5 (Report Period: 7/1/2015 to 9/30/2015...TYPE 3. DATES COVERED 00-00-2015 to 00-00-2015 4. TITLE AND SUBTITLE Lean and Efficient Software: Whole-Program Optimization of Executables 5a...unclassified c. THIS PAGE unclassified Standard Form 298 (Rev. 8-98) Prescribed by ANSI Std Z39-18 Lean and Efficient Software: Whole-Program 12. Mathematical programming methods for large-scale topology optimization problems DEFF Research Database (Denmark) Rojas Labanda, Susana for mechanical problems, but has rapidly extended to many other disciplines, such as fluid dynamics and biomechanical problems. However, the novelty and improvements of optimization methods has been very limited. It is, indeed, necessary to develop of new optimization methods to improve the final designs......, and at the same time, reduce the number of function evaluations. Nonlinear optimization methods, such as sequential quadratic programming and interior point solvers, have almost not been embraced by the topology optimization community. Thus, this work is focused on the introduction of this kind of second...... for the classical minimum compliance problem. Two of the state-of-the-art optimization algorithms are investigated and implemented for this structural topology optimization problem. A Sequential Quadratic Programming (TopSQP) and an interior point method (TopIP) are developed exploiting the specific mathematical... 13. APPROACH ON INTELLIGENT OPTIMIZATION DESIGN BASED ON COMPOUND KNOWLEDGE Institute of Scientific and Technical Information of China (English) Yao Jianchu; Zhou Ji; Yu Jun 2003-01-01 A concept of an intelligent optimal design approach is proposed, which is organized by a kind of compound knowledge model. The compound knowledge consists of modularized quantitative knowledge, inclusive experience knowledge and case-based sample knowledge. By using this compound knowledge model, the abundant quantity information of mathematical programming and the symbolic knowledge of artificial intelligence can be united together in this model. The intelligent optimal design model based on such a compound knowledge and the automatically generated decomposition principles based on it are also presented. Practically, it is applied to the production planning, process schedule and optimization of production process of a refining & chemical work and a great profit is achieved. Specially, the methods and principles are adaptable not only to continuous process industry, but also to discrete manufacturing one. 14. TRU Waste Management Program. Cost/schedule optimization analysis International Nuclear Information System (INIS) Detamore, J.A.; Raudenbush, M.H.; Wolaver, R.W.; Hastings, G.A. 1985-10-01 This Current Year Work Plan presents in detail a description of the activities to be performed by the Joint Integration Office Rockwell International (JIO/RI) during FY86. It breaks down the activities into two major work areas: Program Management and Program Analysis. Program Management is performed by the JIO/RI by providing technical planning and guidance for the development of advanced TRU waste management capabilities. This includes equipment/facility design, engineering, construction, and operations. These functions are integrated to allow transition from interim storage to final disposition. JIO/RI tasks include program requirements identification, long-range technical planning, budget development, program planning document preparation, task guidance development, task monitoring, task progress information gathering and reporting to DOE, interfacing with other agencies and DOE lead programs, integrating public involvement with program efforts, and preparation of reports for DOE detailing program status. Program Analysis is performed by the JIO/RI to support identification and assessment of alternatives, and development of long-term TRU waste program capabilities. These analyses include short-term analyses in response to DOE information requests, along with performing an RH Cost/Schedule Optimization report. Systems models will be developed, updated, and upgraded as needed to enhance JIO/RI's capability to evaluate the adequacy of program efforts in various fields. A TRU program data base will be maintained and updated to provide DOE with timely responses to inventory related questions 15. Model-Based Speech Signal Coding Using Optimized Temporal Decomposition for Storage and Broadcasting Applications Science.gov (United States) Athaudage, Chandranath R. N.; Bradley, Alan B.; Lech, Margaret 2003-12-01 A dynamic programming-based optimization strategy for a temporal decomposition (TD) model of speech and its application to low-rate speech coding in storage and broadcasting is presented. In previous work with the spectral stability-based event localizing (SBEL) TD algorithm, the event localization was performed based on a spectral stability criterion. Although this approach gave reasonably good results, there was no assurance on the optimality of the event locations. In the present work, we have optimized the event localizing task using a dynamic programming-based optimization strategy. Simulation results show that an improved TD model accuracy can be achieved. A methodology of incorporating the optimized TD algorithm within the standard MELP speech coder for the efficient compression of speech spectral information is also presented. The performance evaluation results revealed that the proposed speech coding scheme achieves 50%-60% compression of speech spectral information with negligible degradation in the decoded speech quality. 16. Optimization of decision rules based on dynamic programming approach KAUST Repository Zielosko, Beata 2014-01-14 This chapter is devoted to the study of an extension of dynamic programming approach which allows optimization of approximate decision rules relative to the length and coverage. We introduce an uncertainty measure that is the difference between number of rows in a given decision table and the number of rows labeled with the most common decision for this table divided by the number of rows in the decision table. We fix a threshold γ, such that 0 ≤ γ < 1, and study so-called γ-decision rules (approximate decision rules) that localize rows in subtables which uncertainty is at most γ. Presented algorithm constructs a directed acyclic graph Δ γ T which nodes are subtables of the decision table T given by pairs "attribute = value". The algorithm finishes the partitioning of a subtable when its uncertainty is at most γ. The chapter contains also results of experiments with decision tables from UCI Machine Learning Repository. © 2014 Springer International Publishing Switzerland. 17. Pareto optimization in algebraic dynamic programming. Science.gov (United States) Saule, Cédric; Giegerich, Robert 2015-01-01 Pareto optimization combines independent objectives by computing the Pareto front of its search space, defined as the set of all solutions for which no other candidate solution scores better under all objectives. This gives, in a precise sense, better information than an artificial amalgamation of different scores into a single objective, but is more costly to compute. Pareto optimization naturally occurs with genetic algorithms, albeit in a heuristic fashion. Non-heuristic Pareto optimization so far has been used only with a few applications in bioinformatics. We study exact Pareto optimization for two objectives in a dynamic programming framework. We define a binary Pareto product operator [Formula: see text] on arbitrary scoring schemes. Independent of a particular algorithm, we prove that for two scoring schemes A and B used in dynamic programming, the scoring scheme [Formula: see text] correctly performs Pareto optimization over the same search space. We study different implementations of the Pareto operator with respect to their asymptotic and empirical efficiency. Without artificial amalgamation of objectives, and with no heuristics involved, Pareto optimization is faster than computing the same number of answers separately for each objective. For RNA structure prediction under the minimum free energy versus the maximum expected accuracy model, we show that the empirical size of the Pareto front remains within reasonable bounds. Pareto optimization lends itself to the comparative investigation of the behavior of two alternative scoring schemes for the same purpose. For the above scoring schemes, we observe that the Pareto front can be seen as a composition of a few macrostates, each consisting of several microstates that differ in the same limited way. We also study the relationship between abstract shape analysis and the Pareto front, and find that they extract information of a different nature from the folding space and can be meaningfully combined. 18. Fuzzy chance constrained linear programming model for scrap charge optimization in steel production DEFF Research Database (Denmark) Rong, Aiying; Lahdelma, Risto 2008-01-01 the uncertainty based on fuzzy set theory and constrain the failure risk based on a possibility measure. Consequently, the scrap charge optimization problem is modeled as a fuzzy chance constrained linear programming problem. Since the constraints of the model mainly address the specification of the product... 19. 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) 20. Generic Optimization Program User Manual Version 3.0.0 International Nuclear Information System (INIS) Wetter, Michael 2009-01-01 GenOpt is an optimization program for the minimization of a cost function that is evaluated by an external simulation program. It has been developed for optimization problems where the cost function is computationally expensive and its derivatives are not available or may not even exist. GenOpt can be coupled to any simulation program that reads its input from text files and writes its output to text files. The independent variables can be continuous variables (possibly with lower and upper bounds), discrete variables, or both, continuous and discrete variables. Constraints on dependent variables can be implemented using penalty or barrier functions. GenOpt uses parallel computing to evaluate the simulations. GenOpt has a library with local and global multi-dimensional and one-dimensional optimization algorithms, and algorithms for doing parametric runs. An algorithm interface allows adding new minimization algorithms without knowing the details of the program structure. GenOpt is written in Java so that it is platform independent. The platform independence and the general interface make GenOpt applicable to a wide range of optimization problems. GenOpt has not been designed for linear programming problems, quadratic programming problems, and problems where the gradient of the cost function is available. For such problems, as well as for other problems, special tailored software exists that is more efficient 1. Generic Optimization Program User Manual Version 3.0.0 Energy Technology Data Exchange (ETDEWEB) Wetter, Michael 2009-05-11 GenOpt is an optimization program for the minimization of a cost function that is evaluated by an external simulation program. It has been developed for optimization problems where the cost function is computationally expensive and its derivatives are not available or may not even exist. GenOpt can be coupled to any simulation program that reads its input from text files and writes its output to text files. The independent variables can be continuous variables (possibly with lower and upper bounds), discrete variables, or both, continuous and discrete variables. Constraints on dependent variables can be implemented using penalty or barrier functions. GenOpt uses parallel computing to evaluate the simulations. GenOpt has a library with local and global multi-dimensional and one-dimensional optimization algorithms, and algorithms for doing parametric runs. An algorithm interface allows adding new minimization algorithms without knowing the details of the program structure. GenOpt is written in Java so that it is platform independent. The platform independence and the general interface make GenOpt applicable to a wide range of optimization problems. GenOpt has not been designed for linear programming problems, quadratic programming problems, and problems where the gradient of the cost function is available. For such problems, as well as for other problems, special tailored software exists that is more efficient. 2. Joint optimization of condition-based maintenance and production lot-sizing NARCIS (Netherlands) Peng, H.; van Houtum, G.J.J.A.N. 2016-01-01 Due to the development of sensor technologies nowadays, condition-based maintenance (CBM) programs can be established and optimized based on the data collected through condition monitoring. The CBM activities can significantly increase the uptime of a machine. However, they should be conducted in a 3. Optimization of Preparation Program for Biomass Based Porous Active Carbon by Response Surface Methodology Based on Adsorptive Property Directory of Open Access Journals (Sweden) ZHANG Hao 2017-06-01 Full Text Available With waste walnut shell as raw material, biomass based porous active carbon was made by microwave oven method. The effects of microwave power, activation time and mass fraction of phosphoric acid on adsorptive property of biomass based porous active carbon in the process of physical activation of active carbon precursor were studied by response surface method and numerical simulation method, the preparation plan of biomass based porous active carbon was optimized, and the optimal biomass based porous active carbon property was characterized. The results show that three factors affect the adsorptive property of biomass based porous active carbon, but the effect of microwave power is obviously more significant than that of mass fraction of phosphoric acid, and the effect of mass fraction of phosphoric acid is more significant than that of activation time. The optimized preparation conditions are:microwave power is 746W, activation time is 11.2min and mass fraction of phosphoric acid is 85.9% in the process of physical activation of activated carbon precursor by microwave heating method. For the optimal biomass based porous active carbon, the adsorption value of iodine is 1074.57mg/g, adsorption value of methylene blue is 294.4mL/g and gain rate is 52.1%. 4. Optimal Power Allocation Algorithm for Radar Network Systems Based on Low Probability of Intercept Optimization(in English Directory of Open Access Journals (Sweden) Shi Chen-guang 2014-08-01 Full Text Available A novel optimal power allocation algorithm for radar network systems is proposed for Low Probability of Intercept (LPI technology in modern electronic warfare. The algorithm is based on the LPI optimization. First, the Schleher intercept factor for a radar network is derived, and then the Schleher intercept factor is minimized by optimizing the transmission power allocation among netted radars in the network to guarantee target-tracking performance. Furthermore, the Nonlinear Programming Genetic Algorithm (NPGA is used to solve the resulting nonconvex, nonlinear, and constrained optimization problem. Numerical simulation results show the effectiveness of the proposed algorithm. 5. Optimal timing of joint replacement using mathematical programming and stochastic programming models. Science.gov (United States) Keren, Baruch; Pliskin, Joseph S 2011-12-01 The optimal timing for performing radical medical procedures as joint (e.g., hip) replacement must be seriously considered. In this paper we show that under deterministic assumptions the optimal timing for joint replacement is a solution of a mathematical programming problem, and under stochastic assumptions the optimal timing can be formulated as a stochastic programming problem. We formulate deterministic and stochastic models that can serve as decision support tools. The results show that the benefit from joint replacement surgery is heavily dependent on timing. Moreover, for a special case where the patient's remaining life is normally distributed along with a normally distributed survival of the new joint, the expected benefit function from surgery is completely solved. This enables practitioners to draw the expected benefit graph, to find the optimal timing, to evaluate the benefit for each patient, to set priorities among patients and to decide if joint replacement should be performed and when. 6. A Bilevel Programming Model to Optimize Train Operation Based on Satisfaction for an Intercity Rail Line Directory of Open Access Journals (Sweden) Zhipeng Huang 2014-01-01 Full Text Available The passenger travel demands for intercity rail lines fluctuate obviously during different time periods, which makes the rail departments unable to establish an even train operation scheme. This paper considers an optimization problem for train operations which respond to passenger travel demands of different periods in intercity rail lines. A satisfactory function of passenger travelling is proposed by means of analyzing the passengers’ travel choice behavior and correlative influencing factors. On this basis, the paper formulates a bilevel programming model which maximizes interests of railway enterprises and travelling satisfaction of each passenger. The trains operation in different periods can be optimized through upper layer planning of the model, while considering the passenger flow distribution problem based on the Wardrop user equilibrium principle in the lower layer planning. Then, a genetic algorithm is designed according to model features for solving the upper laying. The Frank-Wolfe algorithm is used for solving the lower layer planning. Finally, a numerical example is provided to demonstrate the application of the method proposed in this paper. 7. Optimizing Biorefinery Design and Operations via Linear Programming Models Energy Technology Data Exchange (ETDEWEB) Talmadge, Michael; Batan, Liaw; Lamers, Patrick; Hartley, Damon; Biddy, Mary; Tao, Ling; Tan, Eric 2017-03-28 The ability to assess and optimize economics of biomass resource utilization for the production of fuels, chemicals and power is essential for the ultimate success of a bioenergy industry. The team of authors, consisting of members from the National Renewable Energy Laboratory (NREL) and the Idaho National Laboratory (INL), has developed simple biorefinery linear programming (LP) models to enable the optimization of theoretical or existing biorefineries. The goal of this analysis is to demonstrate how such models can benefit the developing biorefining industry. It focuses on a theoretical multi-pathway, thermochemical biorefinery configuration and demonstrates how the biorefinery can use LP models for operations planning and optimization in comparable ways to the petroleum refining industry. Using LP modeling tools developed under U.S. Department of Energy's Bioenergy Technologies Office (DOE-BETO) funded efforts, the authors investigate optimization challenges for the theoretical biorefineries such as (1) optimal feedstock slate based on available biomass and prices, (2) breakeven price analysis for available feedstocks, (3) impact analysis for changes in feedstock costs and product prices, (4) optimal biorefinery operations during unit shutdowns / turnarounds, and (5) incentives for increased processing capacity. These biorefinery examples are comparable to crude oil purchasing and operational optimization studies that petroleum refiners perform routinely using LPs and other optimization models. It is important to note that the analyses presented in this article are strictly theoretical and they are not based on current energy market prices. The pricing structure assigned for this demonstrative analysis is consistent with$4 per gallon gasoline, which clearly assumes an economic environment that would favor the construction and operation of biorefineries. The analysis approach and examples provide valuable insights into the usefulness of analysis tools for

8. Simulation-based optimization parametric optimization techniques and reinforcement learning

CERN Document Server

Gosavi, Abhijit

2003-01-01

Simulation-Based Optimization: Parametric Optimization Techniques and Reinforcement Learning introduces the evolving area of simulation-based optimization. The book's objective is two-fold: (1) It examines the mathematical governing principles of simulation-based optimization, thereby providing the reader with the ability to model relevant real-life problems using these techniques. (2) It outlines the computational technology underlying these methods. Taken together these two aspects demonstrate that the mathematical and computational methods discussed in this book do work. Broadly speaking, the book has two parts: (1) parametric (static) optimization and (2) control (dynamic) optimization. Some of the book's special features are: *An accessible introduction to reinforcement learning and parametric-optimization techniques. *A step-by-step description of several algorithms of simulation-based optimization. *A clear and simple introduction to the methodology of neural networks. *A gentle introduction to converg...

9. The Programming Optimization of Capacitorless 1T DRAM Based on the Dual-Gate TFET.

Science.gov (United States)

Li, Wei; Liu, Hongxia; Wang, Shulong; Chen, Shupeng; Wang, Qianqiong

2017-09-06

The larger volume of capacitor and higher leakage current of transistor have become the inherent disadvantages for the traditional one transistor (1T)-one capacitor (1C) dynamic random access memory (DRAM). Recently, the tunneling FET (TFET) is applied in DRAM cell due to the low off-state current and high switching ratio. The dual-gate TFET (DG-TFET) DRAM cell with the capacitorless structure has the superior performance-higher retention time (RT) and weak temperature dependence. But the performance of TFET DRAM cell is sensitive to programming condition. In this paper, the guideline of programming optimization is discussed in detail by using simulation tool-Silvaco Atlas. Both the writing and reading operations of DG-TFET DRAM depend on the band-to-band tunneling (BTBT). During the writing operation, the holes coming from BTBT governed by Gate2 are stored in potential well under Gate2. A small negative voltage is applied at Gate2 to retain holes for a long time during holding "1". The BTBT governed by Gate1 mainly influences the reading current. Using the optimized programming condition, the DG-TFET DRAM obtains the higher current ratio of reading "1" to reading "0" (10 7 ) and RT of more than 2 s. The higher RT reduces the refresh rate and dynamic power consumption of DRAM.

10. The Programming Optimization of Capacitorless 1T DRAM Based on the Dual-Gate TFET

Science.gov (United States)

Li, Wei; Liu, Hongxia; Wang, Shulong; Chen, Shupeng; Wang, Qianqiong

2017-09-01

The larger volume of capacitor and higher leakage current of transistor have become the inherent disadvantages for the traditional one transistor (1T)-one capacitor (1C) dynamic random access memory (DRAM). Recently, the tunneling FET (TFET) is applied in DRAM cell due to the low off-state current and high switching ratio. The dual-gate TFET (DG-TFET) DRAM cell with the capacitorless structure has the superior performance-higher retention time (RT) and weak temperature dependence. But the performance of TFET DRAM cell is sensitive to programming condition. In this paper, the guideline of programming optimization is discussed in detail by using simulation tool—Silvaco Atlas. Both the writing and reading operations of DG-TFET DRAM depend on the band-to-band tunneling (BTBT). During the writing operation, the holes coming from BTBT governed by Gate2 are stored in potential well under Gate2. A small negative voltage is applied at Gate2 to retain holes for a long time during holding "1". The BTBT governed by Gate1 mainly influences the reading current. Using the optimized programming condition, the DG-TFET DRAM obtains the higher current ratio of reading "1" to reading "0" (107) and RT of more than 2 s. The higher RT reduces the refresh rate and dynamic power consumption of DRAM.

11. Optimal Allocation of Static Var Compensator via Mixed Integer Conic Programming

Energy Technology Data Exchange (ETDEWEB)

Zhang, Xiaohu [ORNL; Shi, Di [Global Energy Interconnection Research Institute North America (GEIRI North America), California; Wang, Zhiwei [Global Energy Interconnection Research Institute North America (GEIRI North America), California; Huang, Junhui [Global Energy Interconnection Research Institute North America (GEIRI North America), California; Wang, Xu [Global Energy Interconnection Research Institute North America (GEIRI North America), California; Liu, Guodong [ORNL; Tomsovic, Kevin [University of Tennessee, Knoxville (UTK)

2017-01-01

Shunt FACTS devices, such as, a Static Var Compensator (SVC), are capable of providing local reactive power compensation. They are widely used in the network to reduce the real power loss and improve the voltage profile. This paper proposes a planning model based on mixed integer conic programming (MICP) to optimally allocate SVCs in the transmission network considering load uncertainty. The load uncertainties are represented by a number of scenarios. Reformulation and linearization techniques are utilized to transform the original non-convex model into a convex second order cone programming (SOCP) model. Numerical case studies based on the IEEE 30-bus system demonstrate the effectiveness of the proposed planning model.

12. Numerical methods of mathematical optimization with Algol and Fortran programs

CERN Document Server

Künzi, Hans P; Zehnder, C A; Rheinboldt, Werner

1971-01-01

Numerical Methods of Mathematical Optimization: With ALGOL and FORTRAN Programs reviews the theory and the practical application of the numerical methods of mathematical optimization. An ALGOL and a FORTRAN program was developed for each one of the algorithms described in the theoretical section. This should result in easy access to the application of the different optimization methods.Comprised of four chapters, this volume begins with a discussion on the theory of linear and nonlinear optimization, with the main stress on an easily understood, mathematically precise presentation. In addition

13. Topics in Semantics-based Program Manipulation

DEFF Research Database (Denmark)

Grobauer, Bernt

four articles in the field of semantics-based techniques for program manipulation: three articles are about partial evaluation, a method for program specialization; the fourth article treats an approach to automatic cost analysis. Partial evaluation optimizes programs by specializing them with respect...... article in this dissertation describes how the second Futamura projection can be achieved for type-directed partial evaluation (TDPE), a relatively recent approach to partial evaluation: We derive an ML implementation of the second Futamura projection for TDPE. Due to the differences between ‘traditional...... denotational semantics—allows us to relate various possible semantics to each other both conceptually and formally. We thus are able to explain goal-directed evaluation using an intuitive list-based semantics, while using a continuation semantics for semantics-based compilation through partial evaluation...

14. MCTP system model based on linear programming optimization of apertures obtained from sequencing patient image data maps

Energy Technology Data Exchange (ETDEWEB)

Ureba, A. [Dpto. Fisiología Médica y Biofísica. Facultad de Medicina, Universidad de Sevilla, E-41009 Sevilla (Spain); Salguero, F. J. [Nederlands Kanker Instituut, Antoni van Leeuwenhoek Ziekenhuis, 1066 CX Ámsterdam, The Nederlands (Netherlands); Barbeiro, A. R.; Jimenez-Ortega, E.; Baeza, J. A.; Leal, A., E-mail: alplaza@us.es [Dpto. Fisiología Médica y Biofísica, Facultad de Medicina, Universidad de Sevilla, E-41009 Sevilla (Spain); Miras, H. [Servicio de Radiofísica, Hospital Universitario Virgen Macarena, E-41009 Sevilla (Spain); Linares, R.; Perucha, M. [Servicio de Radiofísica, Hospital Infanta Luisa, E-41010 Sevilla (Spain)

2014-08-15

Purpose: The authors present a hybrid direct multileaf collimator (MLC) aperture optimization model exclusively based on sequencing of patient imaging data to be implemented on a Monte Carlo treatment planning system (MC-TPS) to allow the explicit radiation transport simulation of advanced radiotherapy treatments with optimal results in efficient times for clinical practice. Methods: The planning system (called CARMEN) is a full MC-TPS, controlled through aMATLAB interface, which is based on the sequencing of a novel map, called “biophysical” map, which is generated from enhanced image data of patients to achieve a set of segments actually deliverable. In order to reduce the required computation time, the conventional fluence map has been replaced by the biophysical map which is sequenced to provide direct apertures that will later be weighted by means of an optimization algorithm based on linear programming. A ray-casting algorithm throughout the patient CT assembles information about the found structures, the mass thickness crossed, as well as PET values. Data are recorded to generate a biophysical map for each gantry angle. These maps are the input files for a home-made sequencer developed to take into account the interactions of photons and electrons with the MLC. For each linac (Axesse of Elekta and Primus of Siemens) and energy beam studied (6, 9, 12, 15 MeV and 6 MV), phase space files were simulated with the EGSnrc/BEAMnrc code. The dose calculation in patient was carried out with the BEAMDOSE code. This code is a modified version of EGSnrc/DOSXYZnrc able to calculate the beamlet dose in order to combine them with different weights during the optimization process. Results: Three complex radiotherapy treatments were selected to check the reliability of CARMEN in situations where the MC calculation can offer an added value: A head-and-neck case (Case I) with three targets delineated on PET/CT images and a demanding dose-escalation; a partial breast

15. MCTP system model based on linear programming optimization of apertures obtained from sequencing patient image data maps

International Nuclear Information System (INIS)

Ureba, A.; Salguero, F. J.; Barbeiro, A. R.; Jimenez-Ortega, E.; Baeza, J. A.; Leal, A.; Miras, H.; Linares, R.; Perucha, M.

2014-01-01

Purpose: The authors present a hybrid direct multileaf collimator (MLC) aperture optimization model exclusively based on sequencing of patient imaging data to be implemented on a Monte Carlo treatment planning system (MC-TPS) to allow the explicit radiation transport simulation of advanced radiotherapy treatments with optimal results in efficient times for clinical practice. Methods: The planning system (called CARMEN) is a full MC-TPS, controlled through aMATLAB interface, which is based on the sequencing of a novel map, called “biophysical” map, which is generated from enhanced image data of patients to achieve a set of segments actually deliverable. In order to reduce the required computation time, the conventional fluence map has been replaced by the biophysical map which is sequenced to provide direct apertures that will later be weighted by means of an optimization algorithm based on linear programming. A ray-casting algorithm throughout the patient CT assembles information about the found structures, the mass thickness crossed, as well as PET values. Data are recorded to generate a biophysical map for each gantry angle. These maps are the input files for a home-made sequencer developed to take into account the interactions of photons and electrons with the MLC. For each linac (Axesse of Elekta and Primus of Siemens) and energy beam studied (6, 9, 12, 15 MeV and 6 MV), phase space files were simulated with the EGSnrc/BEAMnrc code. The dose calculation in patient was carried out with the BEAMDOSE code. This code is a modified version of EGSnrc/DOSXYZnrc able to calculate the beamlet dose in order to combine them with different weights during the optimization process. Results: Three complex radiotherapy treatments were selected to check the reliability of CARMEN in situations where the MC calculation can offer an added value: A head-and-neck case (Case I) with three targets delineated on PET/CT images and a demanding dose-escalation; a partial breast

16. MCTP system model based on linear programming optimization of apertures obtained from sequencing patient image data maps.

Science.gov (United States)

Ureba, A; Salguero, F J; Barbeiro, A R; Jimenez-Ortega, E; Baeza, J A; Miras, H; Linares, R; Perucha, M; Leal, A

2014-08-01

The authors present a hybrid direct multileaf collimator (MLC) aperture optimization model exclusively based on sequencing of patient imaging data to be implemented on a Monte Carlo treatment planning system (MC-TPS) to allow the explicit radiation transport simulation of advanced radiotherapy treatments with optimal results in efficient times for clinical practice. The planning system (called CARMEN) is a full MC-TPS, controlled through aMATLAB interface, which is based on the sequencing of a novel map, called "biophysical" map, which is generated from enhanced image data of patients to achieve a set of segments actually deliverable. In order to reduce the required computation time, the conventional fluence map has been replaced by the biophysical map which is sequenced to provide direct apertures that will later be weighted by means of an optimization algorithm based on linear programming. A ray-casting algorithm throughout the patient CT assembles information about the found structures, the mass thickness crossed, as well as PET values. Data are recorded to generate a biophysical map for each gantry angle. These maps are the input files for a home-made sequencer developed to take into account the interactions of photons and electrons with the MLC. For each linac (Axesse of Elekta and Primus of Siemens) and energy beam studied (6, 9, 12, 15 MeV and 6 MV), phase space files were simulated with the EGSnrc/BEAMnrc code. The dose calculation in patient was carried out with the BEAMDOSE code. This code is a modified version of EGSnrc/DOSXYZnrc able to calculate the beamlet dose in order to combine them with different weights during the optimization process. Three complex radiotherapy treatments were selected to check the reliability of CARMEN in situations where the MC calculation can offer an added value: A head-and-neck case (Case I) with three targets delineated on PET/CT images and a demanding dose-escalation; a partial breast irradiation case (Case II) solved

17. Robust Optimization-Based Generation Self-Scheduling under Uncertain Price

Directory of Open Access Journals (Sweden)

Xiao Luo

2011-01-01

Full Text Available This paper considers generation self-scheduling in electricity markets under uncertain price. Based on the robust optimization (denoted as RO methodology, a new self-scheduling model, which has a complicated max-min optimization structure, is set up. By using optimal dual theory, the proposed model is reformulated to an ordinary quadratic and quadratic cone programming problems in the cases of box and ellipsoidal uncertainty, respectively. IEEE 30-bus system is used to test the new model. Some comparisons with other methods are done, and the sensitivity with respect to the uncertain set is analyzed. Comparing with the existed uncertain self-scheduling approaches, the new method has twofold characteristics. First, it does not need a prediction of distribution of random variables and just requires an estimated value and the uncertain set of power price. Second, the counterpart of RO corresponding to the self-scheduling is a simple quadratic or quadratic cone programming. This indicates that the reformulated problem can be solved by many ordinary optimization algorithms.

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

19. Mathematical programming model for heat exchanger design through optimization of partial objectives

International Nuclear Information System (INIS)

Onishi, Viviani C.; Ravagnani, Mauro A.S.S.; Caballero, José A.

2013-01-01

Highlights: • Rigorous design of shell-and-tube heat exchangers according to TEMA standards. • Division of the problem into sets of equations that are easier to solve. • Selected heuristic objective functions based on the physical behavior of the problem. • Sequential optimization approach to avoid solutions stuck in local minimum. • The results obtained with this model improved the values reported in the literature. - Abstract: Mathematical programming can be used for the optimal design of shell-and-tube heat exchangers (STHEs). This paper proposes a mixed integer non-linear programming (MINLP) model for the design of STHEs, following rigorously the standards of the Tubular Exchanger Manufacturers Association (TEMA). Bell–Delaware Method is used for the shell-side calculations. This approach produces a large and non-convex model that cannot be solved to global optimality with the current state of the art solvers. Notwithstanding, it is proposed to perform a sequential optimization approach of partial objective targets through the division of the problem into sets of related equations that are easier to solve. For each one of these problems a heuristic objective function is selected based on the physical behavior of the problem. The global optimal solution of the original problem cannot be ensured even in the case in which each of the sub-problems is solved to global optimality, but at least a very good solution is always guaranteed. Three cases extracted from the literature were studied. The results showed that in all cases the values obtained using the proposed MINLP model containing multiple objective functions improved the values presented in the literature

20. Optimality Conditions for Fuzzy Number Quadratic Programming with Fuzzy Coefficients

Directory of Open Access Journals (Sweden)

Xue-Gang Zhou

2014-01-01

Full Text Available The purpose of the present paper is to investigate optimality conditions and duality theory in fuzzy number quadratic programming (FNQP in which the objective function is fuzzy quadratic function with fuzzy number coefficients and the constraint set is fuzzy linear functions with fuzzy number coefficients. Firstly, the equivalent quadratic programming of FNQP is presented by utilizing a linear ranking function and the dual of fuzzy number quadratic programming primal problems is introduced. Secondly, we present optimality conditions for fuzzy number quadratic programming. We then prove several duality results for fuzzy number quadratic programming problems with fuzzy coefficients.

1. Complex fluid network optimization and control integrative design based on nonlinear dynamic model

International Nuclear Information System (INIS)

Sui, Jinxue; Yang, Li; Hu, Yunan

2016-01-01

In view of distribution according to complex fluid network’s needs, this paper proposed one optimization computation method of the nonlinear programming mathematical model based on genetic algorithm. The simulation result shows that the overall energy consumption of the optimized fluid network has a decrease obviously. The control model of the fluid network is established based on nonlinear dynamics. We design the control law based on feedback linearization, take the optimal value by genetic algorithm as the simulation data, can also solve the branch resistance under the optimal value. These resistances can provide technical support and reference for fluid network design and construction, so can realize complex fluid network optimization and control integration design.

2. Cost-optimal power system extension under flow-based market coupling

Energy Technology Data Exchange (ETDEWEB)

Hagspiel, Simeon; Jaegemann, Cosima; Lindenberger, Dietmar [Koeln Univ. (Germany). Energiewirtschaftliches Inst.; Brown, Tom; Cherevatskiy, Stanislav; Troester, Eckehard [Energynautics GmbH, Langen (Germany)

2013-05-15

Electricity market models, implemented as dynamic programming problems, have been applied widely to identify possible pathways towards a cost-optimal and low carbon electricity system. However, the joint optimization of generation and transmission remains challenging, mainly due to the fact that different characteristics and rules apply to commercial and physical exchanges of electricity in meshed networks. This paper presents a methodology that allows to optimize power generation and transmission infrastructures jointly through an iterative approach based on power transfer distribution factors (PTDFs). As PTDFs are linear representations of the physical load flow equations, they can be implemented in a linear programming environment suitable for large scale problems. The algorithm iteratively updates PTDFs when grid infrastructures are modified due to cost-optimal extension and thus yields an optimal solution with a consistent representation of physical load flows. The method is first demonstrated on a simplified three-node model where it is found to be robust and convergent. It is then applied to the European power system in order to find its cost-optimal development under the prescription of strongly decreasing CO{sub 2} emissions until 2050.

3. Optimizing an estuarine water quality monitoring program through an entropy-based hierarchical spatiotemporal Bayesian framework

Science.gov (United States)

Alameddine, Ibrahim; Karmakar, Subhankar; Qian, Song S.; Paerl, Hans W.; Reckhow, Kenneth H.

2013-10-01

The total maximum daily load program aims to monitor more than 40,000 standard violations in around 20,000 impaired water bodies across the United States. Given resource limitations, future monitoring efforts have to be hedged against the uncertainties in the monitored system, while taking into account existing knowledge. In that respect, we have developed a hierarchical spatiotemporal Bayesian model that can be used to optimize an existing monitoring network by retaining stations that provide the maximum amount of information, while identifying locations that would benefit from the addition of new stations. The model assumes the water quality parameters are adequately described by a joint matrix normal distribution. The adopted approach allows for a reduction in redundancies, while emphasizing information richness rather than data richness. The developed approach incorporates the concept of entropy to account for the associated uncertainties. Three different entropy-based criteria are adopted: total system entropy, chlorophyll-a standard violation entropy, and dissolved oxygen standard violation entropy. A multiple attribute decision making framework is adopted to integrate the competing design criteria and to generate a single optimal design. The approach is implemented on the water quality monitoring system of the Neuse River Estuary in North Carolina, USA. The model results indicate that the high priority monitoring areas identified by the total system entropy and the dissolved oxygen violation entropy criteria are largely coincident. The monitoring design based on the chlorophyll-a standard violation entropy proved to be less informative, given the low probabilities of violating the water quality standard in the estuary.

4. Programmed evolution for optimization of orthogonal metabolic output in bacteria.

Directory of Open Access Journals (Sweden)

Todd T Eckdahl

Full Text Available Current use of microbes for metabolic engineering suffers from loss of metabolic output due to natural selection. Rather than combat the evolution of bacterial populations, we chose to embrace what makes biological engineering unique among engineering fields - evolving materials. We harnessed bacteria to compute solutions to the biological problem of metabolic pathway optimization. Our approach is called Programmed Evolution to capture two concepts. First, a population of cells is programmed with DNA code to enable it to compute solutions to a chosen optimization problem. As analog computers, bacteria process known and unknown inputs and direct the output of their biochemical hardware. Second, the system employs the evolution of bacteria toward an optimal metabolic solution by imposing fitness defined by metabolic output. The current study is a proof-of-concept for Programmed Evolution applied to the optimization of a metabolic pathway for the conversion of caffeine to theophylline in E. coli. Introduced genotype variations included strength of the promoter and ribosome binding site, plasmid copy number, and chaperone proteins. We constructed 24 strains using all combinations of the genetic variables. We used a theophylline riboswitch and a tetracycline resistance gene to link theophylline production to fitness. After subjecting the mixed population to selection, we measured a change in the distribution of genotypes in the population and an increased conversion of caffeine to theophylline among the most fit strains, demonstrating Programmed Evolution. Programmed Evolution inverts the standard paradigm in metabolic engineering by harnessing evolution instead of fighting it. Our modular system enables researchers to program bacteria and use evolution to determine the combination of genetic control elements that optimizes catabolic or anabolic output and to maintain it in a population of cells. Programmed Evolution could be used for applications in

5. Programmed Evolution for Optimization of Orthogonal Metabolic Output in Bacteria

Science.gov (United States)

Eckdahl, Todd T.; Campbell, A. Malcolm; Heyer, Laurie J.; Poet, Jeffrey L.; Blauch, David N.; Snyder, Nicole L.; Atchley, Dustin T.; Baker, Erich J.; Brown, Micah; Brunner, Elizabeth C.; Callen, Sean A.; Campbell, Jesse S.; Carr, Caleb J.; Carr, David R.; Chadinha, Spencer A.; Chester, Grace I.; Chester, Josh; Clarkson, Ben R.; Cochran, Kelly E.; Doherty, Shannon E.; Doyle, Catherine; Dwyer, Sarah; Edlin, Linnea M.; Evans, Rebecca A.; Fluharty, Taylor; Frederick, Janna; Galeota-Sprung, Jonah; Gammon, Betsy L.; Grieshaber, Brandon; Gronniger, Jessica; Gutteridge, Katelyn; Henningsen, Joel; Isom, Bradley; Itell, Hannah L.; Keffeler, Erica C.; Lantz, Andrew J.; Lim, Jonathan N.; McGuire, Erin P.; Moore, Alexander K.; Morton, Jerrad; Nakano, Meredith; Pearson, Sara A.; Perkins, Virginia; Parrish, Phoebe; Pierson, Claire E.; Polpityaarachchige, Sachith; Quaney, Michael J.; Slattery, Abagael; Smith, Kathryn E.; Spell, Jackson; Spencer, Morgan; Taye, Telavive; Trueblood, Kamay; Vrana, Caroline J.; Whitesides, E. Tucker

2015-01-01

Current use of microbes for metabolic engineering suffers from loss of metabolic output due to natural selection. Rather than combat the evolution of bacterial populations, we chose to embrace what makes biological engineering unique among engineering fields – evolving materials. We harnessed bacteria to compute solutions to the biological problem of metabolic pathway optimization. Our approach is called Programmed Evolution to capture two concepts. First, a population of cells is programmed with DNA code to enable it to compute solutions to a chosen optimization problem. As analog computers, bacteria process known and unknown inputs and direct the output of their biochemical hardware. Second, the system employs the evolution of bacteria toward an optimal metabolic solution by imposing fitness defined by metabolic output. The current study is a proof-of-concept for Programmed Evolution applied to the optimization of a metabolic pathway for the conversion of caffeine to theophylline in E. coli. Introduced genotype variations included strength of the promoter and ribosome binding site, plasmid copy number, and chaperone proteins. We constructed 24 strains using all combinations of the genetic variables. We used a theophylline riboswitch and a tetracycline resistance gene to link theophylline production to fitness. After subjecting the mixed population to selection, we measured a change in the distribution of genotypes in the population and an increased conversion of caffeine to theophylline among the most fit strains, demonstrating Programmed Evolution. Programmed Evolution inverts the standard paradigm in metabolic engineering by harnessing evolution instead of fighting it. Our modular system enables researchers to program bacteria and use evolution to determine the combination of genetic control elements that optimizes catabolic or anabolic output and to maintain it in a population of cells. Programmed Evolution could be used for applications in energy

6. Mathematical programming solver based on local search

CERN Document Server

Gardi, Frédéric; Darlay, Julien; Estellon, Bertrand; Megel, Romain

2014-01-01

This book covers local search for combinatorial optimization and its extension to mixed-variable optimization. Although not yet understood from the theoretical point of view, local search is the paradigm of choice for tackling large-scale real-life optimization problems. Today's end-users demand interactivity with decision support systems. For optimization software, this means obtaining good-quality solutions quickly. Fast iterative improvement methods, like local search, are suited to satisfying such needs. Here the authors show local search in a new light, in particular presenting a new kind of mathematical programming solver, namely LocalSolver, based on neighborhood search. First, an iconoclast methodology is presented to design and engineer local search algorithms. The authors' concern about industrializing local search approaches is of particular interest for practitioners. This methodology is applied to solve two industrial problems with high economic stakes. Software based on local search induces ex...

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

8. GENETIC ALGORITHM BASED CONCEPT DESIGN TO OPTIMIZE NETWORK LOAD BALANCE

Directory of Open Access Journals (Sweden)

Ashish Jain

2012-07-01

Full Text Available Multiconstraints optimal network load balancing is an NP-hard problem and it is an important part of traffic engineering. In this research we balance the network load using classical method (brute force approach and dynamic programming is used but result shows the limitation of this method but at a certain level we recognized that the optimization of balanced network load with increased number of nodes and demands is intractable using the classical method because the solution set increases exponentially. In such case the optimization techniques like evolutionary techniques can employ for optimizing network load balance. In this paper we analyzed proposed classical algorithm and evolutionary based genetic approach is devise as well as proposed in this paper for optimizing the balance network load.

9. Optimal traffic control in highway transportation networks using linear programming

KAUST Repository

Li, Yanning

2014-06-01

This article presents a framework for the optimal control of boundary flows on transportation networks. The state of the system is modeled by a first order scalar conservation law (Lighthill-Whitham-Richards PDE). Based on an equivalent formulation of the Hamilton-Jacobi PDE, the problem of controlling the state of the system on a network link in a finite horizon can be posed as a Linear Program. Assuming all intersections in the network are controllable, we show that the optimization approach can be extended to an arbitrary transportation network, preserving linear constraints. Unlike previously investigated transportation network control schemes, this framework leverages the intrinsic properties of the Halmilton-Jacobi equation, and does not require any discretization or boolean variables on the link. Hence this framework is very computational efficient and provides the globally optimal solution. The feasibility of this framework is illustrated by an on-ramp metering control example.

10. Optimal design and planning of glycerol-based biorefinery supply chains under uncertainty

DEFF Research Database (Denmark)

Loureiro da Costa Lira Gargalo, Carina; Carvalho, Ana; Gernaey, Krist V.

2017-01-01

-echelon mixed integer linear programming problem is proposed based upon a previous model, GlyThink. In the new formulation, market uncertainties are taken into account at the strategic planning level. The robustness of the supply chain structures is analyzed based on statistical data provided...... by the implementation of the Monte Carlo method, where a deterministic optimization problem is solved for each scenario. Furthermore, the solution of the stochastic multi-objective optimization model, points to the Pareto set of trade-off solutions obtained when maximizing the NPV and minimizing environmental......The optimal design and planning of glycerol-based biorefinery supply chains is critical for the development and implementation of this concept in a sustainable manner. To achieve this, a decision-making framework is proposed in this work, to holistically optimize the design and planning...

11. Optimal placement of capacitors in a radial network using conic and mixed integer linear programming

Energy Technology Data Exchange (ETDEWEB)

Jabr, R.A. [Electrical, Computer and Communication Engineering Department, Notre Dame University, P.O. Box: 72, Zouk Mikhael, Zouk Mosbeh (Lebanon)

2008-06-15

This paper considers the problem of optimally placing fixed and switched type capacitors in a radial distribution network. The aim of this problem is to minimize the costs associated with capacitor banks, peak power, and energy losses whilst satisfying a pre-specified set of physical and technical constraints. The proposed solution is obtained using a two-phase approach. In phase-I, the problem is formulated as a conic program in which all nodes are candidates for placement of capacitor banks whose sizes are considered as continuous variables. A global solution of the phase-I problem is obtained using an interior-point based conic programming solver. Phase-II seeks a practical optimal solution by considering capacitor sizes as discrete variables. The problem in this phase is formulated as a mixed integer linear program based on minimizing the L1-norm of deviations from the phase-I state variable values. The solution to the phase-II problem is obtained using a mixed integer linear programming solver. The proposed method is validated via extensive comparisons with previously published results. (author)

12. Post optimization paradigm in maximum 3-satisfiability logic programming

Science.gov (United States)

Mansor, Mohd. Asyraf; Sathasivam, Saratha; Kasihmuddin, Mohd Shareduwan Mohd

2017-08-01

Maximum 3-Satisfiability (MAX-3SAT) is a counterpart of the Boolean satisfiability problem that can be treated as a constraint optimization problem. It deals with a conundrum of searching the maximum number of satisfied clauses in a particular 3-SAT formula. This paper presents the implementation of enhanced Hopfield network in hastening the Maximum 3-Satisfiability (MAX-3SAT) logic programming. Four post optimization techniques are investigated, including the Elliot symmetric activation function, Gaussian activation function, Wavelet activation function and Hyperbolic tangent activation function. The performances of these post optimization techniques in accelerating MAX-3SAT logic programming will be discussed in terms of the ratio of maximum satisfied clauses, Hamming distance and the computation time. Dev-C++ was used as the platform for training, testing and validating our proposed techniques. The results depict the Hyperbolic tangent activation function and Elliot symmetric activation function can be used in doing MAX-3SAT logic programming.

13. EABOT - Energetic analysis as a basis for robust optimization of trigeneration systems by linear programming

International Nuclear Information System (INIS)

Piacentino, A.; Cardona, F.

2008-01-01

The optimization of synthesis, design and operation in trigeneration systems for building applications is a quite complex task, due to the high number of decision variables, the presence of irregular heat, cooling and electric load profiles and the variable electricity price. Consequently, computer-aided techniques are usually adopted to achieve the optimal solution, based either on iterative techniques, linear or non-linear programming or evolutionary search. Large efforts have been made in improving algorithm efficiency, which have resulted in an increasingly rapid convergence to the optimal solution and in reduced calculation time; robust algorithm have also been formulated, assuming stochastic behaviour for energy loads and prices. This paper is based on the assumption that margins for improvements in the optimization of trigeneration systems still exist, which require an in-depth understanding of plant's energetic behaviour. Robustness in the optimization of trigeneration systems has more to do with a 'correct and comprehensive' than with an 'efficient' modelling, being larger efforts required to energy specialists rather than to experts in efficient algorithms. With reference to a mixed integer linear programming model implemented in MatLab for a trigeneration system including a pressurized (medium temperature) heat storage, the relevant contribute of thermoeconomics and energo-environmental analysis in the phase of mathematical modelling and code testing are shown

14. Optimal selection for shielding materials by fuzzy linear programming

International Nuclear Information System (INIS)

Kanai, Y.; Miura, N.; Sugasawa, S.

1996-01-01

An application of fuzzy linear programming methods to optimization of a radiation shield is presented. The main purpose of the present study is the choice of materials and the search of the ratio of mixture-component as the first stage of the methodology on optimum shielding design according to individual requirements of nuclear reactor, reprocessing facility, shipping cask installing spent fuel, ect. The characteristic values for the shield optimization may be considered their cost, spatial space, weight and some shielding qualities such as activation rate and total dose rate for neutron and gamma ray (includes secondary gamma ray). This new approach can reduce huge combination calculations for conventional two-valued logic approaches to representative single shielding calculation by group-wised optimization parameters determined in advance. Using the fuzzy linear programming method, possibilities for reducing radiation effects attainable in optimal compositions hydrated, lead- and boron-contained materials are investigated

15. Local beam angle optimization with linear programming and gradient search

International Nuclear Information System (INIS)

Craft, David

2007-01-01

The optimization of beam angles in IMRT planning is still an open problem, with literature focusing on heuristic strategies and exhaustive searches on discrete angle grids. We show how a beam angle set can be locally refined in a continuous manner using gradient-based optimization in the beam angle space. The gradient is derived using linear programming duality theory. Applying this local search to 100 random initial angle sets of a phantom pancreatic case demonstrates the method, and highlights the many-local-minima aspect of the BAO problem. Due to this function structure, we recommend a search strategy of a thorough global search followed by local refinement at promising beam angle sets. Extensions to nonlinear IMRT formulations are discussed. (note)

16. An efficient particle swarm approach for mixed-integer programming in reliability-redundancy optimization applications

International Nuclear Information System (INIS)

Santos Coelho, Leandro dos

2009-01-01

The reliability-redundancy optimization problems can involve the selection of components with multiple choices and redundancy levels that produce maximum benefits, and are subject to the cost, weight, and volume constraints. Many classical mathematical methods have failed in handling nonconvexities and nonsmoothness in reliability-redundancy optimization problems. As an alternative to the classical optimization approaches, the meta-heuristics have been given much attention by many researchers due to their ability to find an almost global optimal solutions. One of these meta-heuristics is the particle swarm optimization (PSO). PSO is a population-based heuristic optimization technique inspired by social behavior of bird flocking and fish schooling. This paper presents an efficient PSO algorithm based on Gaussian distribution and chaotic sequence (PSO-GC) to solve the reliability-redundancy optimization problems. In this context, two examples in reliability-redundancy design problems are evaluated. Simulation results demonstrate that the proposed PSO-GC is a promising optimization technique. PSO-GC performs well for the two examples of mixed-integer programming in reliability-redundancy applications considered in this paper. The solutions obtained by the PSO-GC are better than the previously best-known solutions available in the recent literature

17. An efficient particle swarm approach for mixed-integer programming in reliability-redundancy optimization applications

Energy Technology Data Exchange (ETDEWEB)

Santos Coelho, Leandro dos [Industrial and Systems Engineering Graduate Program, LAS/PPGEPS, Pontifical Catholic University of Parana, PUCPR, Imaculada Conceicao, 1155, 80215-901 Curitiba, Parana (Brazil)], E-mail: leandro.coelho@pucpr.br

2009-04-15

The reliability-redundancy optimization problems can involve the selection of components with multiple choices and redundancy levels that produce maximum benefits, and are subject to the cost, weight, and volume constraints. Many classical mathematical methods have failed in handling nonconvexities and nonsmoothness in reliability-redundancy optimization problems. As an alternative to the classical optimization approaches, the meta-heuristics have been given much attention by many researchers due to their ability to find an almost global optimal solutions. One of these meta-heuristics is the particle swarm optimization (PSO). PSO is a population-based heuristic optimization technique inspired by social behavior of bird flocking and fish schooling. This paper presents an efficient PSO algorithm based on Gaussian distribution and chaotic sequence (PSO-GC) to solve the reliability-redundancy optimization problems. In this context, two examples in reliability-redundancy design problems are evaluated. Simulation results demonstrate that the proposed PSO-GC is a promising optimization technique. PSO-GC performs well for the two examples of mixed-integer programming in reliability-redundancy applications considered in this paper. The solutions obtained by the PSO-GC are better than the previously best-known solutions available in the recent literature.

18. Optimization Model for Web Based Multimodal Interactive Simulations.

Science.gov (United States)

Halic, Tansel; Ahn, Woojin; De, Suvranu

2015-07-15

This paper presents a technique for optimizing the performance of web based multimodal interactive simulations. For such applications where visual quality and the performance of simulations directly influence user experience, overloading of hardware resources may result in unsatisfactory reduction in the quality of the simulation and user satisfaction. However, optimization of simulation performance on individual hardware platforms is not practical. Hence, we present a mixed integer programming model to optimize the performance of graphical rendering and simulation performance while satisfying application specific constraints. Our approach includes three distinct phases: identification, optimization and update . In the identification phase, the computing and rendering capabilities of the client device are evaluated using an exploratory proxy code. This data is utilized in conjunction with user specified design requirements in the optimization phase to ensure best possible computational resource allocation. The optimum solution is used for rendering (e.g. texture size, canvas resolution) and simulation parameters (e.g. simulation domain) in the update phase. Test results are presented on multiple hardware platforms with diverse computing and graphics capabilities to demonstrate the effectiveness of our approach.

19. A New Method Based on Simulation-Optimization Approach to Find Optimal Solution in Dynamic Job-shop Scheduling Problem with Breakdown and Rework

Directory of Open Access Journals (Sweden)

2017-03-01

The proposed method is implemented on classical job-shop problems with objective of makespan and results are compared with mixed integer programming model. Moreover, the appropriate dispatching priorities are achieved for dynamic job-shop problem minimizing a multi-objective criteria. The results show that simulation-based optimization are highly capable to capture the main characteristics of the shop and produce optimal/near-optimal solutions with highly credibility degree.

20. A combined stochastic programming and optimal control approach to personal finance and pensions

DEFF Research Database (Denmark)

Konicz, Agnieszka Karolina; Pisinger, David; Rasmussen, Kourosh Marjani

2015-01-01

The paper presents a model that combines a dynamic programming (stochastic optimal control) approach and a multi-stage stochastic linear programming approach (SLP), integrated into one SLP formulation. Stochastic optimal control produces an optimal policy that is easy to understand and implement....

1. Optimization of the annual construction program solutions

Directory of Open Access Journals (Sweden)

Oleinik Pavel

2017-01-01

Full Text Available The article considers potentially possible optimization solutions in scheduling while forming the annual production programs of the construction complex organizations. The optimization instrument is represented as a two-component system. As a fundamentally new approach in the first block of the annual program solutions, the authors propose to use a scientifically grounded methodology for determining the scope of work permissible for the transfer to a subcontractor without risk of General Contractor’s management control losing over the construction site. For this purpose, a special indicator is introduced that characterizes the activity of the general construction organization - the coefficient of construction production management. In the second block, the principal methods for the formation of calendar plans for the fulfillment of the critical work effort by the leading stream are proposed, depending on the intensity characteristic.

2. Multi-Objective Stochastic Optimization Programs for a Non-Life Insurance Company under Solvency Constraints

Directory of Open Access Journals (Sweden)

Massimiliano Kaucic

2015-09-01

Full Text Available In the paper, we introduce a multi-objective scenario-based optimization approach for chance-constrained portfolio selection problems. More specifically, a modified version of the normal constraint method is implemented with a global solver in order to generate a dotted approximation of the Pareto frontier for bi- and tri-objective programming problems. Numerical experiments are carried out on a set of portfolios to be optimized for an EU-based non-life insurance company. Both performance indicators and risk measures are managed as objectives. Results show that this procedure is effective and readily applicable to achieve suitable risk-reward tradeoff analysis.

3. A Study of Joint Cost Inclusion in Linear Programming Optimization

Directory of Open Access Journals (Sweden)

P. Armaos

2013-08-01

Full Text Available The concept of Structural Optimization has been a topic or research over the past century. Linear Programming Optimization has proved being the most reliable method of structural optimization. Global advances in linear programming optimization have been recently powered by University of Sheffield researchers, to include joint cost, self-weight and buckling considerations. A joint cost inclusion scopes to reduce the number of joints existing in an optimized structural solution, transforming it to a practically viable solution. The topic of the current paper is to investigate the effects of joint cost inclusion, as this is currently implemented in the optimization code. An extended literature review on this subject was conducted prior to familiarization with small scale optimization software. Using IntelliFORM software, a structured series of problems were set and analyzed. The joint cost tests examined benchmark problems and their consequent changes in the member topology, as the design domain was expanding. The findings of the analyses were remarkable and are being commented further on. The distinct topologies of solutions created by optimization processes are also recognized. Finally an alternative strategy of penalizing joints is presented.

4. Analytical Model-Based Design Optimization of a Transverse Flux Machine

Energy Technology Data Exchange (ETDEWEB)

Hasan, Iftekhar; Husain, Tausif; Sozer, Yilmaz; Husain, Iqbal; Muljadi, Eduard

2017-02-16

This paper proposes an analytical machine design tool using magnetic equivalent circuit (MEC)-based particle swarm optimization (PSO) for a double-sided, flux-concentrating transverse flux machine (TFM). The magnetic equivalent circuit method is applied to analytically establish the relationship between the design objective and the input variables of prospective TFM designs. This is computationally less intensive and more time efficient than finite element solvers. A PSO algorithm is then used to design a machine with the highest torque density within the specified power range along with some geometric design constraints. The stator pole length, magnet length, and rotor thickness are the variables that define the optimization search space. Finite element analysis (FEA) was carried out to verify the performance of the MEC-PSO optimized machine. The proposed analytical design tool helps save computation time by at least 50% when compared to commercial FEA-based optimization programs, with results found to be in agreement with less than 5% error.

5. Designing optimal food intake patterns to achieve nutritional goals for Japanese adults through the use of linear programming optimization models.

Science.gov (United States)

Okubo, Hitomi; Sasaki, Satoshi; Murakami, Kentaro; Yokoyama, Tetsuji; Hirota, Naoko; Notsu, Akiko; Fukui, Mitsuru; Date, Chigusa

2015-06-06

Simultaneous dietary achievement of a full set of nutritional recommendations is difficult. Diet optimization model using linear programming is a useful mathematical means of translating nutrient-based recommendations into realistic nutritionally-optimal food combinations incorporating local and culture-specific foods. We used this approach to explore optimal food intake patterns that meet the nutrient recommendations of the Dietary Reference Intakes (DRIs) while incorporating typical Japanese food selections. As observed intake values, we used the food and nutrient intake data of 92 women aged 31-69 years and 82 men aged 32-69 years living in three regions of Japan. Dietary data were collected with semi-weighed dietary record on four non-consecutive days in each season of the year (16 days total). The linear programming models were constructed to minimize the differences between observed and optimized food intake patterns while also meeting the DRIs for a set of 28 nutrients, setting energy equal to estimated requirements, and not exceeding typical quantities of each food consumed by each age (30-49 or 50-69 years) and gender group. We successfully developed mathematically optimized food intake patterns that met the DRIs for all 28 nutrients studied in each sex and age group. Achieving nutritional goals required minor modifications of existing diets in older groups, particularly women, while major modifications were required to increase intake of fruit and vegetables in younger groups of both sexes. Across all sex and age groups, optimized food intake patterns demanded greatly increased intake of whole grains and reduced-fat dairy products in place of intake of refined grains and full-fat dairy products. Salt intake goals were the most difficult to achieve, requiring marked reduction of salt-containing seasoning (65-80%) in all sex and age groups. Using a linear programming model, we identified optimal food intake patterns providing practical food choices and

6. Propositional Optimal Trajectory Programming for Improving Stability ...

African Journals Online (AJOL)

Propositional Optimal Trajectory Programming for Improving Stability of Hermite Definite Control System. ... PROMOTING ACCESS TO AFRICAN RESEARCH. AFRICAN JOURNALS ONLINE (AJOL) ... Knowledge of systems operation subjected to heat diffusion constraints is required of systems analysts. In an instance that ...

7. Demand-Based Optimal Design of Storage Tank with Inerter System

Directory of Open Access Journals (Sweden)

Shiming Zhang

2017-01-01

Full Text Available A parameter optimal design method for a tank with an inerter system is proposed in this study based on the requirements of tank vibration control to improve the effectiveness and efficiency of vibration control. Moreover, a response indicator and a cost control indicator are selected based on the control targets for liquid storage tanks for simultaneously minimizing the dynamic response and controlling costs. These indicators are reformulated through a random vibration analysis under virtual excitation. The problem is then transformed from a multiobjective optimization problem to a single-objective nonlinear problem using the ε-constraint method, which is consistent with the demand-based method. White noise excitation can be used to design the tank with the inerter system under seismic excitation to simplify the calculation. Subsequently, a MATLAB-based calculation program is compiled, and several optimization cases are examined under different excitation conditions. The effectiveness of the demand-based method is proven through a time history analysis. The results show that specific vibration control requirements can be met at the lowest cost with a simultaneous reduction in base shears and overturning base moments.

8. Optimization of radioactive waste management system by application of multiobjective linear programming

International Nuclear Information System (INIS)

Shimizu, Yoshiaki

1981-01-01

A mathematical procedure is proposed to make a radioactive waste management plan comprehensively. Since such planning is relevant to some different goals in management, decision making has to be formulated as a multiobjective optimization problem. A mathematical programming method was introduced to make a decision through an interactive manner which enables us to assess the preference of decision maker step by step among the conflicting objectives. The reference system taken as an example is the radioactive waste management system at the Research Reactor Institute of Kyoto University (KUR). Its linear model was built based on the experience in the actual management at KUR. The best-compromise model was then formulated as a multiobjective linear programming by the aid of the computational analysis through a conventional optimization. It was shown from the numerical results that the proposed approach could provide some useful informations to make an actual management plan. (author)

9. Synthesis of Optimal Processing Pathway for Microalgae-based Biorefinery under Uncertainty

DEFF Research Database (Denmark)

Rizwan, Muhammad; Lee, Jay H.; Gani, Rafiqul

2015-01-01

decision making, we propose a systematic framework for the synthesis and optimal design of microalgae-based processing network under uncertainty. By incorporating major uncertainties into the biorefinery superstructure model we developed previously, a stochastic mixed integer nonlinear programming (s......The research in the field of microalgae-based biofuels and chemicals is in early phase of the development, and therefore a wide range of uncertainties exist due to inconsistencies among and shortage of technical information. In order to handle and address these uncertainties to ensure robust......MINLP) problem is formulated for determining the optimal biorefinery structure under given parameter uncertainties modelled as sampled scenarios. The solution to the sMINLP problem determines the optimal decisions with respect to processing technologies, material flows, and product portfolio in the presence...

10. Derivative Trade Optimizing Model Utilizing GP Based on Behavioral Finance Theory

Science.gov (United States)

Matsumura, Koki; Kawamoto, Masaru

This paper proposed a new technique which makes the strategy trees for the derivative (option) trading investment decision based on the behavioral finance theory and optimizes it using evolutionary computation, in order to achieve high profitability. The strategy tree uses a technical analysis based on a statistical, experienced technique for the investment decision. The trading model is represented by various technical indexes, and the strategy tree is optimized by the genetic programming(GP) which is one of the evolutionary computations. Moreover, this paper proposed a method using the prospect theory based on the behavioral finance theory to set psychological bias for profit and deficit and attempted to select the appropriate strike price of option for the higher investment efficiency. As a result, this technique produced a good result and found the effectiveness of this trading model by the optimized dealings strategy.

11. Optimized remedial groundwater extraction using linear programming

International Nuclear Information System (INIS)

Quinn, J.J.

1995-01-01

Groundwater extraction systems are typically installed to remediate contaminant plumes or prevent further spread of contamination. These systems are expensive to install and maintain. A traditional approach to designing such a wellfield uses a series of trial-and-error simulations to test the effects of various well locations and pump rates. However, the optimal locations and pump rates of extraction wells are difficult to determine when objectives related to the site hydrogeology and potential pumping scheme are considered. This paper describes a case study of an application of linear programming theory to determine optimal well placement and pump rates. The objectives of the pumping scheme were to contain contaminant migration and reduce contaminant concentrations while minimizing the total amount of water pumped and treated. Past site activities at the area under study included disposal of contaminants in pits. Several groundwater plumes have been identified, and others may be present. The area of concern is bordered on three sides by a wetland, which receives a portion of its input budget as groundwater discharge from the pits. Optimization of the containment pumping scheme was intended to meet three goals: (1) prevent discharge of contaminated groundwater to the wetland, (2) minimize the total water pumped and treated (cost benefit), and (3) avoid dewatering of the wetland (cost and ecological benefits). Possible well locations were placed at known source areas. To constrain the problem, the optimization program was instructed to prevent any flow toward the wetland along a user-specified border. In this manner, the optimization routine selects well locations and pump rates so that a groundwater divide is produced along this boundary

12. BILGO: Bilateral greedy optimization for large scale semidefinite programming

KAUST Repository

Hao, Zhifeng; Yuan, Ganzhao; Ghanem, Bernard

2013-01-01

Many machine learning tasks (e.g. metric and manifold learning problems) can be formulated as convex semidefinite programs. To enable the application of these tasks on a large-scale, scalability and computational efficiency are considered as desirable properties for a practical semidefinite programming algorithm. In this paper, we theoretically analyze a new bilateral greedy optimization (denoted BILGO) strategy in solving general semidefinite programs on large-scale datasets. As compared to existing methods, BILGO employs a bilateral search strategy during each optimization iteration. In such an iteration, the current semidefinite matrix solution is updated as a bilateral linear combination of the previous solution and a suitable rank-1 matrix, which can be efficiently computed from the leading eigenvector of the descent direction at this iteration. By optimizing for the coefficients of the bilateral combination, BILGO reduces the cost function in every iteration until the KKT conditions are fully satisfied, thus, it tends to converge to a global optimum. In fact, we prove that BILGO converges to the global optimal solution at a rate of O(1/k), where k is the iteration counter. The algorithm thus successfully combines the efficiency of conventional rank-1 update algorithms and the effectiveness of gradient descent. Moreover, BILGO can be easily extended to handle low rank constraints. To validate the effectiveness and efficiency of BILGO, we apply it to two important machine learning tasks, namely Mahalanobis metric learning and maximum variance unfolding. Extensive experimental results clearly demonstrate that BILGO can solve large-scale semidefinite programs efficiently.

13. BILGO: Bilateral greedy optimization for large scale semidefinite programming

KAUST Repository

Hao, Zhifeng

2013-10-03

Many machine learning tasks (e.g. metric and manifold learning problems) can be formulated as convex semidefinite programs. To enable the application of these tasks on a large-scale, scalability and computational efficiency are considered as desirable properties for a practical semidefinite programming algorithm. In this paper, we theoretically analyze a new bilateral greedy optimization (denoted BILGO) strategy in solving general semidefinite programs on large-scale datasets. As compared to existing methods, BILGO employs a bilateral search strategy during each optimization iteration. In such an iteration, the current semidefinite matrix solution is updated as a bilateral linear combination of the previous solution and a suitable rank-1 matrix, which can be efficiently computed from the leading eigenvector of the descent direction at this iteration. By optimizing for the coefficients of the bilateral combination, BILGO reduces the cost function in every iteration until the KKT conditions are fully satisfied, thus, it tends to converge to a global optimum. In fact, we prove that BILGO converges to the global optimal solution at a rate of O(1/k), where k is the iteration counter. The algorithm thus successfully combines the efficiency of conventional rank-1 update algorithms and the effectiveness of gradient descent. Moreover, BILGO can be easily extended to handle low rank constraints. To validate the effectiveness and efficiency of BILGO, we apply it to two important machine learning tasks, namely Mahalanobis metric learning and maximum variance unfolding. Extensive experimental results clearly demonstrate that BILGO can solve large-scale semidefinite programs efficiently.

14. Generalized Second-Order Parametric Optimality Conditions in Semiinfinite Discrete Minmax Fractional Programming and Second-Order Univexity

Directory of Open Access Journals (Sweden)

Ram Verma

2016-02-01

Full Text Available This paper deals with mainly establishing numerous sets of generalized second order paramertic sufficient optimality conditions for a semiinfinite discrete minmax fractional programming problem, while the results on semiinfinite discrete minmax fractional programming problem achieved based on some partitioning schemes under various types of generalized second order univexity assumptions.

15. Industrial cogeneration optimization program. Final report, September 1979

Energy Technology Data Exchange (ETDEWEB)

Davis, Jerry; McWhinney, Jr., Robert T.

1980-01-01

This study program is part of the DOE Integrated Industry Cogeneration Program to optimize, evaluate, and demonstrate cogeneration systems, with direct participation of the industries most affected. One objective is to characterize five major energy-intensive industries with respect to their energy-use profiles. The industries are: petroleum refining and related industries, textile mill products, paper and allied products, chemicals and allied products, and food and kindred products. Another objective is to select optimum cogeneration systems for site-specific reference case plants in terms of maximum energy savings subject to given return on investment hurdle rates. Analyses were made that define the range of optimal cogeneration systems for each reference-case plant considering technology applicability, economic factors, and energy savings by type of fuel. This study also provides guidance to other parts of the program through information developed with regard to component development requirements, institutional and regulatory barriers, as well as fuel use and environmental considerations. (MCW)

16. Grid-Optimization Program for Photovoltaic Cells

Science.gov (United States)

Daniel, R. E.; Lee, T. S.

1986-01-01

CELLOPT program developed to assist in designing grid pattern of current-conducting material on photovoltaic cell. Analyzes parasitic resistance losses and shadow loss associated with metallized grid pattern on both round and rectangular solar cells. Though performs sensitivity studies, used primarily to optimize grid design in terms of bus bar and grid lines by minimizing power loss. CELLOPT written in APL.

17. Life cycle cost optimization of biofuel supply chains under uncertainties based on interval linear programming.

Science.gov (United States)

Ren, Jingzheng; Dong, Liang; Sun, Lu; Goodsite, Michael Evan; Tan, Shiyu; Dong, Lichun

2015-01-01

The aim of this work was to develop a model for optimizing the life cycle cost of biofuel supply chain under uncertainties. Multiple agriculture zones, multiple transportation modes for the transport of grain and biofuel, multiple biofuel plants, and multiple market centers were considered in this model, and the price of the resources, the yield of grain and the market demands were regarded as interval numbers instead of constants. An interval linear programming was developed, and a method for solving interval linear programming was presented. An illustrative case was studied by the proposed model, and the results showed that the proposed model is feasible for designing biofuel supply chain under uncertainties. Copyright © 2015 Elsevier Ltd. All rights reserved.

18. Optimization of basic parameters in temperature-programmed gas chromatographic separations of multi-component samples within a given time

NARCIS (Netherlands)

Repka, D.; Krupcik, J.; Brunovska, A.; Leclercq, P.A.; Rijks, J.A.

1989-01-01

A new procedure is introduced for the optimization of column peak capacity in a given time. The opitmization focuses on temperature-programmed operating conditions, notably the initial temperature and hold time, and the programming rate. Based conceptually upon Lagrange functions, experiments were

19. ROTAX: a nonlinear optimization program by axes rotation method

International Nuclear Information System (INIS)

1977-09-01

A nonlinear optimization program employing the axes rotation method has been developed for solving nonlinear problems subject to nonlinear inequality constraints and its stability and convergence efficiency were examined. The axes rotation method is a direct search of the optimum point by rotating the orthogonal coordinate system in a direction giving the minimum objective. The searching direction is rotated freely in multi-dimensional space, so the method is effective for the problems represented with the contours having deep curved valleys. In application of the axes rotation method to the optimization problems subject to nonlinear inequality constraints, an improved version of R.R. Allran and S.E.J. Johnsen's method is used, which deals with a new objective function composed of the original objective and a penalty term to consider the inequality constraints. The program is incorporated in optimization code system SCOOP. (auth.)

20. A man in the loop trajectory optimization program (MILTOP)

Science.gov (United States)

Reinfields, J.

1974-01-01

An interactive trajectory optimization program is developed for use in initial fixing of launch configurations. The program is called MILTOP for Man-In-the-Loop-Trajectory Optimization-Program. The program is designed to facilitate quick look studies using man-machine decision combinations to reduce the time required to solve a given problem. MILTOP integrates the equations of motion of a point-mass in 3-Dimensions with drag as the only aerodynamic force present. Any point in time at which an integration step terminates, may be used as a decision-break-point, with complete user control over all variables and routines at this point. Automatic phases are provided for different modes of control: vertical rise, pitch-over, gravity turn, chi-freeze and control turn. Stage parameters are initialized from a separate routine so the user may fly as many stages as his problem demands. The MILTOP system uses both interactively on storage scope consoles, or in batch mode with numerical output on the live printer.

1. A knowledge-based system for optimization of fuel reload configurations

International Nuclear Information System (INIS)

Galperin, A.; Kimhi, S.; Segev, M.

1989-01-01

The authors discuss a knowledge-based production system developed for generating optimal fuel reload configurations. The system was based on a heuristic search method and implemented in Common Lisp programming language. The knowledge base embodied the reactor physics, reactor operations, and a general approach to fuel management strategy. The data base included a description of the physical system involved, i.e., the core geometry and fuel storage. The fifth cycle of the Three Mile Island Unit 1 pressurized water reactor was chosen as a test case. Application of the system to the test case revealed a self-learning process by which a relatively large number of near-optimal configurations were discovered. Several selected solutions were subjected to detailed analysis and demonstrated excellent performance. To summarize, applicability of the proposed heuristic search method in the domain of nuclear fuel management was proved unequivocally

2. Optimization of environmental management strategies through a dynamic stochastic possibilistic multiobjective program

Energy Technology Data Exchange (ETDEWEB)

Zhang, Xiaodong, E-mail: xiaodong.zhang@beg.utexas.edu [Bureau of Economic Geology, Jackson School of Geosciences, The University of Texas at Austin, Austin, TX 78713 (United States); Huang, Gordon [Institute of Energy, Environment and Sustainable Communities, University of Regina, Regina, Saskatchewan S4S 0A2 (Canada)

2013-02-15

Highlights: ► A dynamic stochastic possibilistic multiobjective programming model is developed. ► Greenhouse gas emission control is considered. ► Three planning scenarios are analyzed and compared. ► Optimal decision schemes under three scenarios and different p{sub i} levels are obtained. ► Tradeoffs between economics and environment are reflected. -- Abstract: Greenhouse gas (GHG) emissions from municipal solid waste (MSW) management facilities have become a serious environmental issue. In MSW management, not only economic objectives but also environmental objectives should be considered simultaneously. In this study, a dynamic stochastic possibilistic multiobjective programming (DSPMP) model is developed for supporting MSW management and associated GHG emission control. The DSPMP model improves upon the existing waste management optimization methods through incorporation of fuzzy possibilistic programming and chance-constrained programming into a general mixed-integer multiobjective linear programming (MOP) framework where various uncertainties expressed as fuzzy possibility distributions and probability distributions can be effectively reflected. Two conflicting objectives are integrally considered, including minimization of total system cost and minimization of total GHG emissions from waste management facilities. Three planning scenarios are analyzed and compared, representing different preferences of the decision makers for economic development and environmental-impact (i.e. GHG-emission) issues in integrated MSW management. Optimal decision schemes under three scenarios and different p{sub i} levels (representing the probability that the constraints would be violated) are generated for planning waste flow allocation and facility capacity expansions as well as GHG emission control. The results indicate that economic and environmental tradeoffs can be effectively reflected through the proposed DSPMP model. The generated decision variables can help

3. Modification of species-based differential evolution for multimodal optimization

Science.gov (United States)

Idrus, Said Iskandar Al; Syahputra, Hermawan; Firdaus, Muliawan

2015-12-01

At this time optimization has an important role in various fields as well as between other operational research, industry, finance and management. Optimization problem is the problem of maximizing or minimizing a function of one variable or many variables, which include unimodal and multimodal functions. Differential Evolution (DE), is a random search technique using vectors as an alternative solution in the search for the optimum. To localize all local maximum and minimum on multimodal function, this function can be divided into several domain of fitness using niching method. Species-based niching method is one of method that build sub-populations or species in the domain functions. This paper describes the modification of species-based previously to reduce the computational complexity and run more efficiently. The results of the test functions show species-based modifications able to locate all the local optima in once run the program.

4. Optimal truss and frame design from projected homogenization-based topology optimization

DEFF Research Database (Denmark)

Larsen, S. D.; Sigmund, O.; Groen, J. P.

2018-01-01

In this article, we propose a novel method to obtain a near-optimal frame structure, based on the solution of a homogenization-based topology optimization model. The presented approach exploits the equivalence between Michell’s problem of least-weight trusses and a compliance minimization problem...... using optimal rank-2 laminates in the low volume fraction limit. In a fully automated procedure, a discrete structure is extracted from the homogenization-based continuum model. This near-optimal structure is post-optimized as a frame, where the bending stiffness is continuously decreased, to allow...

5. IPTV program recommendation based on combination strategies

Directory of Open Access Journals (Sweden)

Li Hao

2018-01-01

Full Text Available As a new interactive service technology, IPTV has been extensively studying in the field of TV pro-gram recommendation, but the sparse of the user-program rating matrix and the cold-start problem is a bottleneck that the program recommended accurately. In this paper, a flexible combination of two recommendation strategies proposed, which explored the sparse and cold-start problem as well as the issue of user interest change over time. This paper achieved content-based filtering section and collaborative filtering section according to the two combination strategies, which effectively solved the cold-start program and over the sparse problem and the problem of users interest change over time. The experimental results showed that this combinational recommendation system in optimal parameters compared by using any one of two combination strategies or not using any combination strategy at all, and the reducing range of MAE is [2.7%,3%].The increasing range of precision and recall is [13.8%95.5%] and [0,97.8%], respectively. The experiment showed better results when using combinational recommendation system in optimal parameters than using each combination strategies individually or not using any combination strategy.

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

7. The use of linear programming in optimization of HDR implant dose distributions

International Nuclear Information System (INIS)

Jozsef, Gabor; Streeter, Oscar E.; Astrahan, Melvin A.

2003-01-01

The introduction of high dose rate brachytherapy enabled optimization of dose distributions to be used on a routine basis. The objective of optimization is to homogenize the dose distribution within the implant while simultaneously satisfying dose constraints on certain points. This is accomplished by varying the time the source dwells at different locations. As the dose at any point is a linear function of the dwell times, a linear programming approach seems to be a natural choice. The dose constraints are inherently linear inequalities. Homogeneity requirements are linearized by minimizing the maximum deviation of the doses at points inside the implant from a prescribed dose. The revised simplex method was applied for the solution of this linear programming problem. In the homogenization process the possible source locations were chosen as optimization points. To avoid the problem of the singular value of the dose at a source location from the source itself we define the 'self-contribution' as the dose at a small distance from the source. The effect of varying this distance is discussed. Test cases were optimized for planar, biplanar and cylindrical implants. A semi-irregular, fan-like implant with diverging needles was also investigated. Mean central dose calculation based on 3D Delaunay-triangulation of the source locations was used to evaluate the dose distributions. The optimization method resulted in homogeneous distributions (for brachytherapy). Additional dose constraints--when applied--were satisfied. The method is flexible enough to include other linear constraints such as the inclusion of the centroids of the Delaunay-triangulation for homogenization, or limiting the maximum allowable dwell time

8. Optimal scheduling of micro grids based on single objective programming

Science.gov (United States)

Chen, Yue

2018-04-01

Faced with the growing demand for electricity and the shortage of fossil fuels, how to optimally optimize the micro-grid has become an important research topic to maximize the economic, technological and environmental benefits of the micro-grid. This paper considers the role of the battery and the micro-grid and power grid to allow the exchange of power not exceeding 150kW preconditions, the main study of the economy to load for the goal is to minimize the electricity cost (abandonment of wind), to establish an optimization model, and to solve the problem by genetic algorithm. The optimal scheduling scheme is obtained and the utilization of renewable energy and the impact of the battery involved in regulation are analyzed.

9. A Genetic-Algorithms-Based Approach for Programming Linear and Quadratic Optimization Problems with Uncertainty

Directory of Open Access Journals (Sweden)

Weihua Jin

2013-01-01

Full Text Available This paper proposes a genetic-algorithms-based approach as an all-purpose problem-solving method for operation programming problems under uncertainty. The proposed method was applied for management of a municipal solid waste treatment system. Compared to the traditional interactive binary analysis, this approach has fewer limitations and is able to reduce the complexity in solving the inexact linear programming problems and inexact quadratic programming problems. The implementation of this approach was performed using the Genetic Algorithm Solver of MATLAB (trademark of MathWorks. The paper explains the genetic-algorithms-based method and presents details on the computation procedures for each type of inexact operation programming problems. A comparison of the results generated by the proposed method based on genetic algorithms with those produced by the traditional interactive binary analysis method is also presented.

10. Multiparametric programming based algorithms for pure integer and mixed-integer bilevel programming problems

KAUST Repository

Domínguez, Luis F.

2010-12-01

This work introduces two algorithms for the solution of pure integer and mixed-integer bilevel programming problems by multiparametric programming techniques. The first algorithm addresses the integer case of the bilevel programming problem where integer variables of the outer optimization problem appear in linear or polynomial form in the inner problem. The algorithm employs global optimization techniques to convexify nonlinear terms generated by a reformulation linearization technique (RLT). A continuous multiparametric programming algorithm is then used to solve the reformulated convex inner problem. The second algorithm addresses the mixed-integer case of the bilevel programming problem where integer and continuous variables of the outer problem appear in linear or polynomial forms in the inner problem. The algorithm relies on the use of global multiparametric mixed-integer programming techniques at the inner optimization level. In both algorithms, the multiparametric solutions obtained are embedded in the outer problem to form a set of single-level (M)(I)(N)LP problems - which are then solved to global optimality using standard fixed-point (global) optimization methods. Numerical examples drawn from the open literature are presented to illustrate the proposed algorithms. © 2010 Elsevier Ltd.

11. Non-linear programming method in optimization of fast reactors

International Nuclear Information System (INIS)

Pavelesku, M.; Dumitresku, Kh.; Adam, S.

1975-01-01

Application of the non-linear programming methods on optimization of nuclear materials distribution in fast reactor is discussed. The programming task composition is made on the basis of the reactor calculation dependent on the fuel distribution strategy. As an illustration of this method application the solution of simple example is given. Solution of the non-linear program is done on the basis of the numerical method SUMT. (I.T.)

12. Optimization of Product Instantiation using Integer Programming

NARCIS (Netherlands)

van den Broek, P.M.; Botterweck, Goetz; Jarzabek, Stan; Kishi, Tomoji

2010-01-01

We show that Integer Programming (IP) can be used as an optimization technique for the instantiation of products of feature models. This is done by showing that the constraints of feature models can be written in linear form. As particular IP technique, we use Gomory cutting planes. We have applied

13. Aerodynamic Optimization Based on Continuous Adjoint Method for a Flexible Wing

Directory of Open Access Journals (Sweden)

Zhaoke Xu

2016-01-01

Full Text Available Aerodynamic optimization based on continuous adjoint method for a flexible wing is developed using FORTRAN 90 in the present work. Aerostructural analysis is performed on the basis of high-fidelity models with Euler equations on the aerodynamic side and a linear quadrilateral shell element model on the structure side. This shell element can deal with both thin and thick shell problems with intersections, so this shell element is suitable for the wing structural model which consists of two spars, 20 ribs, and skin. The continuous adjoint formulations based on Euler equations and unstructured mesh are derived and used in the work. Sequential quadratic programming method is adopted to search for the optimal solution using the gradients from continuous adjoint method. The flow charts of rigid and flexible optimization are presented and compared. The objective is to minimize drag coefficient meanwhile maintaining lift coefficient for a rigid and flexible wing. A comparison between the results from aerostructural analysis of rigid optimization and flexible optimization is shown here to demonstrate that it is necessary to include the effect of aeroelasticity in the optimization design of a wing.

14. Integrated Data Base Program: a status report

International Nuclear Information System (INIS)

Notz, K.J.; Klein, J.A.

1984-06-01

The Integrated Data Base (IDB) Program provides official Department of Energy (DOE) data on spent fuel and radioactive waste inventories, projections, and characteristics. The accomplishments of FY 1983 are summarized for three broad areas: (1) upgrading and issuing of the annual report on spent fuel and radioactive waste inventories, projections, and characteristics, including ORIGEN2 applications and a quality assurance plan; (2) creation of a summary data file in user-friendly format for use on a personal computer and enhancing user access to program data; and (3) optimizing and documentation of the data handling methodology used by the IDB Program and providing direct support to other DOE programs and sites in data handling. Plans for future work in these three areas are outlined. 23 references, 11 figures

15. Multi-Objective Optimization of a Hybrid ESS Based on Optimal Energy Management Strategy for LHDs

Directory of Open Access Journals (Sweden)

Jiajun Liu

2017-10-01

Full Text Available Energy storage systems (ESS play an important role in the performance of mining vehicles. A hybrid ESS combining both batteries (BTs and supercapacitors (SCs is one of the most promising solutions. As a case study, this paper discusses the optimal hybrid ESS sizing and energy management strategy (EMS of 14-ton underground load-haul-dump vehicles (LHDs. Three novel contributions are added to the relevant literature. First, a multi-objective optimization is formulated regarding energy consumption and the total cost of a hybrid ESS, which are the key factors of LHDs, and a battery capacity degradation model is used. During the process, dynamic programming (DP-based EMS is employed to obtain the optimal energy consumption and hybrid ESS power profiles. Second, a 10-year life cycle cost model of a hybrid ESS for LHDs is established to calculate the total cost, including capital cost, operating cost, and replacement cost. According to the optimization results, three solutions chosen from the Pareto front are compared comprehensively, and the optimal one is selected. Finally, the optimal and battery-only options are compared quantitatively using the same objectives, and the hybrid ESS is found to be a more economical and efficient option.

16. Genetic Algorithm (GA)-Based Inclinometer Layout Optimization.

Science.gov (United States)

Liang, Weijie; Zhang, Ping; Chen, Xianping; Cai, Miao; Yang, Daoguo

2015-04-17

This paper presents numerical simulation results of an airflow inclinometer with sensitivity studies and thermal optimization of the printed circuit board (PCB) layout for an airflow inclinometer based on a genetic algorithm (GA). Due to the working principle of the gas sensor, the changes of the ambient temperature may cause dramatic voltage drifts of sensors. Therefore, eliminating the influence of the external environment for the airflow is essential for the performance and reliability of an airflow inclinometer. In this paper, the mechanism of an airflow inclinometer and the influence of different ambient temperatures on the sensitivity of the inclinometer will be examined by the ANSYS-FLOTRAN CFD program. The results show that with changes of the ambient temperature on the sensing element, the sensitivity of the airflow inclinometer is inversely proportional to the ambient temperature and decreases when the ambient temperature increases. GA is used to optimize the PCB thermal layout of the inclinometer. The finite-element simulation method (ANSYS) is introduced to simulate and verify the results of our optimal thermal layout, and the results indicate that the optimal PCB layout greatly improves (by more than 50%) the sensitivity of the inclinometer. The study may be useful in the design of PCB layouts that are related to sensitivity improvement of gas sensors.

17. An efficient inverse radiotherapy planning method for VMAT using quadratic programming optimization.

Science.gov (United States)

Hoegele, W; Loeschel, R; Merkle, N; Zygmanski, P

2012-01-01

The purpose of this study is to investigate the feasibility of an inverse planning optimization approach for the Volumetric Modulated Arc Therapy (VMAT) based on quadratic programming and the projection method. The performance of this method is evaluated against a reference commercial planning system (eclipse(TM) for rapidarc(TM)) for clinically relevant cases. The inverse problem is posed in terms of a linear combination of basis functions representing arclet dose contributions and their respective linear coefficients as degrees of freedom. MLC motion is decomposed into basic motion patterns in an intuitive manner leading to a system of equations with a relatively small number of equations and unknowns. These equations are solved using quadratic programming under certain limiting physical conditions for the solution, such as the avoidance of negative dose during optimization and Monitor Unit reduction. The modeling by the projection method assures a unique treatment plan with beneficial properties, such as the explicit relation between organ weightings and the final dose distribution. Clinical cases studied include prostate and spine treatments. The optimized plans are evaluated by comparing isodose lines, DVH profiles for target and normal organs, and Monitor Units to those obtained by the clinical treatment planning system eclipse(TM). The resulting dose distributions for a prostate (with rectum and bladder as organs at risk), and for a spine case (with kidneys, liver, lung and heart as organs at risk) are presented. Overall, the results indicate that similar plan qualities for quadratic programming (QP) and rapidarc(TM) could be achieved at significantly more efficient computational and planning effort using QP. Additionally, results for the quasimodo phantom [Bohsung et al., "IMRT treatment planning: A comparative inter-system and inter-centre planning exercise of the estro quasimodo group," Radiother. Oncol. 76(3), 354-361 (2005)] are presented as an example

18. Reliability-based optimization of engineering structures

DEFF Research Database (Denmark)

Sørensen, John Dalsgaard

2008-01-01

The theoretical basis for reliability-based structural optimization within the framework of Bayesian statistical decision theory is briefly described. Reliability-based cost benefit problems are formulated and exemplitied with structural optimization. The basic reliability-based optimization...... problems are generalized to the following extensions: interactive optimization, inspection and repair costs, systematic reconstruction, re-assessment of existing structures. Illustrative examples are presented including a simple introductory example, a decision problem related to bridge re...

19. Mutually unbiased bases and semi-definite programming

Energy Technology Data Exchange (ETDEWEB)

Brierley, Stephen; Weigert, Stefan, E-mail: steve.brierley@ulb.ac.be, E-mail: stefan.weigert@york.ac.uk

2010-11-01

A complex Hilbert space of dimension six supports at least three but not more than seven mutually unbiased bases. Two computer-aided analytical methods to tighten these bounds are reviewed, based on a discretization of parameter space and on Groebner bases. A third algorithmic approach is presented: the non-existence of more than three mutually unbiased bases in composite dimensions can be decided by a global optimization method known as semidefinite programming. The method is used to confirm that the spectral matrix cannot be part of a complete set of seven mutually unbiased bases in dimension six.

20. Mutually unbiased bases and semi-definite programming

International Nuclear Information System (INIS)

Brierley, Stephen; Weigert, Stefan

2010-01-01

A complex Hilbert space of dimension six supports at least three but not more than seven mutually unbiased bases. Two computer-aided analytical methods to tighten these bounds are reviewed, based on a discretization of parameter space and on Groebner bases. A third algorithmic approach is presented: the non-existence of more than three mutually unbiased bases in composite dimensions can be decided by a global optimization method known as semidefinite programming. The method is used to confirm that the spectral matrix cannot be part of a complete set of seven mutually unbiased bases in dimension six.

1. Sequential ensemble-based optimal design for parameter estimation: SEQUENTIAL ENSEMBLE-BASED OPTIMAL DESIGN

Energy Technology Data Exchange (ETDEWEB)

Man, Jun [Zhejiang Provincial Key Laboratory of Agricultural Resources and Environment, Institute of Soil and Water Resources and Environmental Science, College of Environmental and Resource Sciences, Zhejiang University, Hangzhou China; Zhang, Jiangjiang [Zhejiang Provincial Key Laboratory of Agricultural Resources and Environment, Institute of Soil and Water Resources and Environmental Science, College of Environmental and Resource Sciences, Zhejiang University, Hangzhou China; Li, Weixuan [Pacific Northwest National Laboratory, Richland Washington USA; Zeng, Lingzao [Zhejiang Provincial Key Laboratory of Agricultural Resources and Environment, Institute of Soil and Water Resources and Environmental Science, College of Environmental and Resource Sciences, Zhejiang University, Hangzhou China; Wu, Laosheng [Department of Environmental Sciences, University of California, Riverside California USA

2016-10-01

The ensemble Kalman filter (EnKF) has been widely used in parameter estimation for hydrological models. The focus of most previous studies was to develop more efficient analysis (estimation) algorithms. On the other hand, it is intuitively understandable that a well-designed sampling (data-collection) strategy should provide more informative measurements and subsequently improve the parameter estimation. In this work, a Sequential Ensemble-based Optimal Design (SEOD) method, coupled with EnKF, information theory and sequential optimal design, is proposed to improve the performance of parameter estimation. Based on the first-order and second-order statistics, different information metrics including the Shannon entropy difference (SD), degrees of freedom for signal (DFS) and relative entropy (RE) are used to design the optimal sampling strategy, respectively. The effectiveness of the proposed method is illustrated by synthetic one-dimensional and two-dimensional unsaturated flow case studies. It is shown that the designed sampling strategies can provide more accurate parameter estimation and state prediction compared with conventional sampling strategies. Optimal sampling designs based on various information metrics perform similarly in our cases. The effect of ensemble size on the optimal design is also investigated. Overall, larger ensemble size improves the parameter estimation and convergence of optimal sampling strategy. Although the proposed method is applied to unsaturated flow problems in this study, it can be equally applied in any other hydrological problems.

2. Application of genetic programming in shape optimization of concrete gravity dams by metaheuristics

Directory of Open Access Journals (Sweden)

Abdolhossein Baghlani

2014-12-01

Full Text Available A gravity dam maintains its stability against the external loads by its massive size. Hence, minimization of the weight of the dam can remarkably reduce the construction costs. In this paper, a procedure for finding optimal shape of concrete gravity dams with a computationally efficient approach is introduced. Genetic programming (GP in conjunction with metaheuristics is used for this purpose. As a case study, shape optimization of the Bluestone dam is presented. Pseudo-dynamic analysis is carried out on a total number of 322 models in order to establish a database of the results. This database is then used to find appropriate relations based on GP for design criteria of the dam. This procedure eliminates the necessity of the time-consuming process of structural analyses in evolutionary optimization methods. The method is hybridized with three different metaheuristics, including particle swarm optimization, firefly algorithm (FA, and teaching–learning-based optimization, and a comparison is made. The results show that although all algorithms are very suitable, FA is slightly superior to other two algorithms in finding a lighter structure in less number of iterations. The proposed method reduces the weight of dam up to 14.6% with very low computational effort.

3. Dynamic Programming Approach for Exact Decision Rule Optimization

KAUST Repository

Amin, Talha M.; Chikalov, Igor; Moshkov, Mikhail; Zielosko, Beata

2013-01-01

This chapter is devoted to the study of an extension of dynamic programming approach that allows sequential optimization of exact decision rules relative to the length and coverage. It contains also results of experiments with decision tables from

4. A Sequential Convex Semidefinite Programming Algorithm for Multiple-Load Free Material Optimization

Czech Academy of Sciences Publication Activity Database

Stingl, M.; Kočvara, Michal; Leugering, G.

2009-01-01

Roč. 20, č. 1 (2009), s. 130-155 ISSN 1052-6234 R&D Projects: GA AV ČR IAA1075402 Grant - others:commision EU(XE) EU-FP6-30717 Institutional research plan: CEZ:AV0Z10750506 Keywords : structural optimization * material optimization * semidefinite programming * sequential convex programming Subject RIV: BA - General Mathematics Impact factor: 1.429, year: 2009

5. Optimal control of stretching process of flexible solar arrays on spacecraft based on a hybrid optimization strategy

Directory of Open Access Journals (Sweden)

Qijia Yao

2017-07-01

Full Text Available The optimal control of multibody spacecraft during the stretching process of solar arrays is investigated, and a hybrid optimization strategy based on Gauss pseudospectral method (GPM and direct shooting method (DSM is presented. First, the elastic deformation of flexible solar arrays was described approximately by the assumed mode method, and a dynamic model was established by the second Lagrangian equation. Then, the nonholonomic motion planning problem is transformed into a nonlinear programming problem by using GPM. By giving fewer LG points, initial values of the state variables and control variables were obtained. A serial optimization framework was adopted to obtain the approximate optimal solution from a feasible solution. Finally, the control variables were discretized at LG points, and the precise optimal control inputs were obtained by DSM. The optimal trajectory of the system can be obtained through numerical integration. Through numerical simulation, the stretching process of solar arrays is stable with no detours, and the control inputs match the various constraints of actual conditions. The results indicate that the method is effective with good robustness. Keywords: Motion planning, Multibody spacecraft, Optimal control, Gauss pseudospectral method, Direct shooting method

6. Optimal processing pathway selection for microalgae-based biorefinery under uncertainty

DEFF Research Database (Denmark)

2015-01-01

We propose a systematic framework for the selection of optimal processing pathways for a microalgaebased biorefinery under techno-economic uncertainty. The proposed framework promotes robust decision making by taking into account the uncertainties that arise due to inconsistencies among...... and shortage in the available technical information. A stochastic mixed integer nonlinear programming (sMINLP) problem is formulated for determining the optimal biorefinery configurations based on a superstructure model where parameter uncertainties are modeled and included as sampled scenarios. The solution...... the accounting of uncertainty are compared with respect to different objectives. (C) 2015 Elsevier Ltd. All rights reserved....

7. Penempatan Optimal Phasor Measurement Unit (PMU) Dengan Integer Programming

OpenAIRE

Amrulloh, Yunan Helmy

2013-01-01

Phasor Measurement Unit (PMU) merupakan peralatan yang mampu memberikan pengukuran fasor tegangan dan arus secara real-time. PMU dapat digunakan untuk monitoring, proteksi dan kontrol pada sistem tenaga listrik. Tugas akhir ini membahas penempatan PMU secara optimal berdasarkan topologi jaringan sehingga sistem tenaga listrik dapat diobservasi. Penempatan optimal PMU dirumuskan sebagai masalah Binary Integer Programming (BIP) yang akan memberikan variabel dengan pilihan nilai (0,1) yang menu...

8. Portfolio optimization in enhanced index tracking with goal programming approach

Science.gov (United States)

Siew, Lam Weng; Jaaman, Saiful Hafizah Hj.; Ismail, Hamizun bin

2014-09-01

Enhanced index tracking is a popular form of passive fund management in stock market. Enhanced index tracking aims to generate excess return over the return achieved by the market index without purchasing all of the stocks that make up the index. This can be done by establishing an optimal portfolio to maximize the mean return and minimize the risk. The objective of this paper is to determine the portfolio composition and performance using goal programming approach in enhanced index tracking and comparing it to the market index. Goal programming is a branch of multi-objective optimization which can handle decision problems that involve two different goals in enhanced index tracking, a trade-off between maximizing the mean return and minimizing the risk. The results of this study show that the optimal portfolio with goal programming approach is able to outperform the Malaysia market index which is FTSE Bursa Malaysia Kuala Lumpur Composite Index because of higher mean return and lower risk without purchasing all the stocks in the market index.

9. Lifecycle-Based Swarm Optimization Method for Numerical Optimization

Directory of Open Access Journals (Sweden)

Hai Shen

2014-01-01

Full Text Available Bioinspired optimization algorithms have been widely used to solve various scientific and engineering problems. Inspired by biological lifecycle, this paper presents a novel optimization algorithm called lifecycle-based swarm optimization (LSO. Biological lifecycle includes four stages: birth, growth, reproduction, and death. With this process, even though individual organism died, the species will not perish. Furthermore, species will have stronger ability of adaptation to the environment and achieve perfect evolution. LSO simulates Biological lifecycle process through six optimization operators: chemotactic, assimilation, transposition, crossover, selection, and mutation. In addition, the spatial distribution of initialization population meets clumped distribution. Experiments were conducted on unconstrained benchmark optimization problems and mechanical design optimization problems. Unconstrained benchmark problems include both unimodal and multimodal cases the demonstration of the optimal performance and stability, and the mechanical design problem was tested for algorithm practicability. The results demonstrate remarkable performance of the LSO algorithm on all chosen benchmark functions when compared to several successful optimization techniques.

10. Optimal control of a programmed motion of a rigid spacecraft using redundant kinematics parameterizations

International Nuclear Information System (INIS)

2005-01-01

This paper considers the problem of optimal controlling of a programmed motion of a rigid spacecraft. Given a cost of the spacecraft as a quadratic function of state and control variables we seek for optimal control laws as functions of the state variables and the angle of programmed rotation that minimize this cost and asymptotically stabilize the required programmed motion. The stabilizing properties of the proposed controllers are proved using the optimal Liapunov techniques. Numerical simulation study is presented

11. Optimization of control poison management by dynamic programming

International Nuclear Information System (INIS)

Ponzoni Filho, P.

1974-01-01

A dynamic programming approach was used to optimize the poison distribution in the core of a nuclear power plant between reloading. This method was applied to a 500 M We PWR subject to two different fuel management policies. The beginning of a stage is marked by a fuel management decision. The state vector of the system is defined by the burnups in the three fuel zones of the core. The change of the state vector is computed in several time steps. A criticality conserving poison management pattern is chosen at the beginning of each step. The burnups at the end of a step are obtained by means of depletion calculations, assuming constant neutron distribution during the step. The violation of burnup and power peaking constraints during the step eliminates the corresponding end states. In the case of identical end states, all except that which produced the largest amount of energy, are eliminated. Among the several end states one is selected for the subsequent stage, when it is subjected to a fuel management decision. This selection is based on an optimally criterion previously chosen, such as: discharged fuel burnup maximization, energy generation cost minimization, etc. (author)

12. Artificial intelligence programming with LabVIEW: genetic algorithms for instrumentation control and optimization.

Science.gov (United States)

Moore, J H

1995-06-01

A genetic algorithm for instrumentation control and optimization was developed using the LabVIEW graphical programming environment. The usefulness of this methodology for the optimization of a closed loop control instrument is demonstrated with minimal complexity and the programming is presented in detail to facilitate its adaptation to other LabVIEW applications. Closed loop control instruments have variety of applications in the biomedical sciences including the regulation of physiological processes such as blood pressure. The program presented here should provide a useful starting point for those wishing to incorporate genetic algorithm approaches to LabVIEW mediated optimization of closed loop control instruments.

13. Optimal Control of Scalar Conservation Laws Using Linear/Quadratic Programming: Application to Transportation Networks

KAUST Repository

Li, Yanning

2014-03-01

This article presents a new optimal control framework for transportation networks in which the state is modeled by a first order scalar conservation law. Using an equivalent formulation based on a Hamilton-Jacobi (H-J) equation and the commonly used triangular fundamental diagram, we pose the problem of controlling the state of the system on a network link, in a finite horizon, as a Linear Program (LP). We then show that this framework can be extended to an arbitrary transportation network, resulting in an LP or a Quadratic Program. Unlike many previously investigated transportation network control schemes, this method yields a globally optimal solution and is capable of handling shocks (i.e., discontinuities in the state of the system). As it leverages the intrinsic properties of the H-J equation used to model the state of the system, it does not require any approximation, unlike classical methods that are based on discretizations of the model. The computational efficiency of the method is illustrated on a transportation network. © 2014 IEEE.

14. Optimal Control of Scalar Conservation Laws Using Linear/Quadratic Programming: Application to Transportation Networks

KAUST Repository

Li, Yanning; Canepa, Edward S.; Claudel, Christian

2014-01-01

This article presents a new optimal control framework for transportation networks in which the state is modeled by a first order scalar conservation law. Using an equivalent formulation based on a Hamilton-Jacobi (H-J) equation and the commonly used triangular fundamental diagram, we pose the problem of controlling the state of the system on a network link, in a finite horizon, as a Linear Program (LP). We then show that this framework can be extended to an arbitrary transportation network, resulting in an LP or a Quadratic Program. Unlike many previously investigated transportation network control schemes, this method yields a globally optimal solution and is capable of handling shocks (i.e., discontinuities in the state of the system). As it leverages the intrinsic properties of the H-J equation used to model the state of the system, it does not require any approximation, unlike classical methods that are based on discretizations of the model. The computational efficiency of the method is illustrated on a transportation network. © 2014 IEEE.

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

Directory of Open Access Journals (Sweden)

Firat Evirgen

2016-04-01

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

16. Optimizing suicide prevention programs and their implementation in Europe (OSPI Europe): an evidence-based multi-level approach.

LENUS (Irish Health Repository)

Hegerl, Ulrich

2009-01-01

BACKGROUND: Suicide and non-fatal suicidal behaviour are significant public health issues in Europe requiring effective preventive interventions. However, the evidence for effective preventive strategies is scarce. The protocol of a European research project to develop an optimized evidence based program for suicide prevention is presented. METHOD: The groundwork for this research has been established by a regional community based intervention for suicide prevention that focuses on improving awareness and care for depression performed within the European Alliance Against Depression (EAAD). The EAAD intervention consists of (1) training sessions and practice support for primary care physicians,(2) public relations activities and mass media campaigns, (3) training sessions for community facilitators who serve as gatekeepers for depressed and suicidal persons in the community and treatment and (4) outreach and support for high risk and self-help groups (e.g. helplines). The intervention has been shown to be effective in reducing suicidal behaviour in an earlier study, the Nuremberg Alliance Against Depression. In the context of the current research project described in this paper (OSPI-Europe) the EAAD model is enhanced by other evidence based interventions and implemented simultaneously and in standardised way in four regions in Ireland, Portugal, Hungary and Germany. The enhanced intervention will be evaluated using a prospective controlled design with the primary outcomes being composite suicidal acts (fatal and non-fatal), and with intermediate outcomes being the effect of training programs, changes in public attitudes, guideline-consistent media reporting. In addition an analysis of the economic costs and consequences will be undertaken, while a process evaluation will monitor implementation of the interventions within the different regions with varying organisational and healthcare contexts. DISCUSSION: This multi-centre research seeks to overcome major

17. Optimizing suicide prevention programs and their implementation in Europe (OSPI-Europe): An evidence-based multi-level approach

LENUS (Irish Health Repository)

Hegerl, Ulrich

2009-11-23

Abstract Background Suicide and non-fatal suicidal behaviour are significant public health issues in Europe requiring effective preventive interventions. However, the evidence for effective preventive strategies is scarce. The protocol of a European research project to develop an optimized evidence based program for suicide prevention is presented. Method The groundwork for this research has been established by a regional community based intervention for suicide prevention that focuses on improving awareness and care for depression performed within the European Alliance Against Depression (EAAD). The EAAD intervention consists of (1) training sessions and practice support for primary care physicians,(2) public relations activities and mass media campaigns, (3) training sessions for community facilitators who serve as gatekeepers for depressed and suicidal persons in the community and treatment and (4) outreach and support for high risk and self-help groups (e.g. helplines). The intervention has been shown to be effective in reducing suicidal behaviour in an earlier study, the Nuremberg Alliance Against Depression. In the context of the current research project described in this paper (OSPI-Europe) the EAAD model is enhanced by other evidence based interventions and implemented simultaneously and in standardised way in four regions in Ireland, Portugal, Hungary and Germany. The enhanced intervention will be evaluated using a prospective controlled design with the primary outcomes being composite suicidal acts (fatal and non-fatal), and with intermediate outcomes being the effect of training programs, changes in public attitudes, guideline-consistent media reporting. In addition an analysis of the economic costs and consequences will be undertaken, while a process evaluation will monitor implementation of the interventions within the different regions with varying organisational and healthcare contexts. Discussion This multi-centre research seeks to overcome major

18. DETERMINATION OF OPTIMAL CONTOURS OF OPEN PIT MINE DURING OIL SHALE EXPLOITATION, BY MINEX 5.2.3. PROGRAM

Directory of Open Access Journals (Sweden)

Miroslav Ignjatović

2013-04-01

Full Text Available By examination and determination of optimal solution of technological processes of exploitation and oil shale processing from Aleksinac site and with adopted technical solution and exploitation of oil shale, derived a technical solution that optimize contour of the newly defined open pit mine. In the world, this problem is solved by using a computer program that has become the established standard for quick and efficient solution for this problem. One of the computer’s program, which can be used for determination of the optimal contours of open pit mines is Minex 5.2.3. program, produced in Australia in the Surpac Minex Group Pty Ltd Company, which is applied at the Mining and Metallurgy Institute Bor (no. of licenses are SSI - 24765 and SSI - 24766. In this study, authors performed 11 optimization of deposit geo - models in Minex 5.2.3. based on the tests results, performed in a laboratory for soil mechanics of Mining and Metallurgy Institute, Bor, on samples from the site of Aleksinac deposits.

19. Agent-Based Optimization

CERN Document Server

Jędrzejowicz, Piotr; Kacprzyk, Janusz

2013-01-01

This volume presents a collection of original research works by leading specialists focusing on novel and promising approaches in which the multi-agent system paradigm is used to support, enhance or replace traditional approaches to solving difficult optimization problems. The editors have invited several well-known specialists to present their solutions, tools, and models falling under the common denominator of the agent-based optimization. The book consists of eight chapters covering examples of application of the multi-agent paradigm and respective customized tools to solve  difficult optimization problems arising in different areas such as machine learning, scheduling, transportation and, more generally, distributed and cooperative problem solving.

20. Performance-based shape optimization of continuum structures

International Nuclear Information System (INIS)

Liang Qingquan

2010-01-01

This paper presents a performance-based optimization (PBO) method for optimal shape design of continuum structures with stiffness constraints. Performance-based design concepts are incorporated in the shape optimization theory to achieve optimal designs. In the PBO method, the traditional shape optimization problem of minimizing the weight of a continuum structure with displacement or mean compliance constraints is transformed to the problem of maximizing the performance of the structure. The optimal shape of a continuum structure is obtained by gradually eliminating inefficient finite elements from the structure until its performance is maximized. Performance indices are employed to monitor the performance of optimized shapes in an optimization process. Performance-based optimality criteria are incorporated in the PBO method to identify the optimum from the optimization process. The PBO method is used to produce optimal shapes of plane stress continuum structures and plates in bending. Benchmark numerical results are provided to demonstrate the effectiveness of the PBO method for generating the maximum stiffness shape design of continuum structures. It is shown that the PBO method developed overcomes the limitations of traditional shape optimization methods in optimal design of continuum structures. Performance-based optimality criteria presented can be incorporated in any shape and topology optimization methods to obtain optimal designs of continuum structures.

1. Optimization of a pump-pipe system by dynamic programming

DEFF Research Database (Denmark)

Vidal, Rene Victor Valqui; Ferreira, Jose S.

1984-01-01

In this paper the problem of minimizing the total cost of a pump-pipe system in series is considered. The route of the pipeline and the number of pumping stations are known. The optimization will then consist in determining the control variables, diameter and thickness of the pipe and the size of...... of the pumps. A general mathematical model is formulated and Dynamic Programming is used to find an optimal solution....

2. Practical mathematical optimization basic optimization theory and gradient-based algorithms

CERN Document Server

Snyman, Jan A

2018-01-01

This textbook presents a wide range of tools for a course in mathematical optimization for upper undergraduate and graduate students in mathematics, engineering, computer science, and other applied sciences. Basic optimization principles are presented with emphasis on gradient-based numerical optimization strategies and algorithms for solving both smooth and noisy discontinuous optimization problems. Attention is also paid to the difficulties of expense of function evaluations and the existence of multiple minima that often unnecessarily inhibit the use of gradient-based methods. This second edition addresses further advancements of gradient-only optimization strategies to handle discontinuities in objective functions. New chapters discuss the construction of surrogate models as well as new gradient-only solution strategies and numerical optimization using Python. A special Python module is electronically available (via springerlink) that makes the new algorithms featured in the text easily accessible and dir...

3. Memory-Optimized Software Synthesis from Dataflow Program Graphs with Large Size Data Samples

Directory of Open Access Journals (Sweden)

Hyunok Oh

2003-05-01

Full Text Available In multimedia and graphics applications, data samples of nonprimitive type require significant amount of buffer memory. This paper addresses the problem of minimizing the buffer memory requirement for such applications in embedded software synthesis from graphical dataflow programs based on the synchronous dataflow (SDF model with the given execution order of nodes. We propose a memory minimization technique that separates global memory buffers from local pointer buffers: the global buffers store live data samples and the local buffers store the pointers to the global buffer entries. The proposed algorithm reduces 67% memory for a JPEG encoder, 40% for an H.263 encoder compared with unshared versions, and 22% compared with the previous sharing algorithm for the H.263 encoder. Through extensive buffer sharing optimization, we believe that automatic software synthesis from dataflow program graphs achieves the comparable code quality with the manually optimized code in terms of memory requirement.

4. DUKSUP: A Computer Program for High Thrust Launch Vehicle Trajectory Design and Optimization

Science.gov (United States)

Spurlock, O. Frank; Williams, Craig H.

2015-01-01

From the late 1960s through 1997, the leadership of NASAs Intermediate and Large class unmanned expendable launch vehicle projects resided at the NASA Lewis (now Glenn) Research Center (LeRC). One of LeRCs primary responsibilities --- trajectory design and performance analysis --- was accomplished by an internally-developed analytic three dimensional computer program called DUKSUP. Because of its Calculus of Variations-based optimization routine, this code was generally more capable of finding optimal solutions than its contemporaries. A derivation of optimal control using the Calculus of Variations is summarized including transversality, intermediate, and final conditions. The two point boundary value problem is explained. A brief summary of the codes operation is provided, including iteration via the Newton-Raphson scheme and integration of variational and motion equations via a 4th order Runge-Kutta scheme. Main subroutines are discussed. The history of the LeRC trajectory design efforts in the early 1960s is explained within the context of supporting the Centaur upper stage program. How the code was constructed based on the operation of the AtlasCentaur launch vehicle, the limits of the computers of that era, the limits of the computer programming languages, and the missions it supported are discussed. The vehicles DUKSUP supported (AtlasCentaur, TitanCentaur, and ShuttleCentaur) are briefly described. The types of missions, including Earth orbital and interplanetary, are described. The roles of flight constraints and their impact on launch operations are detailed (such as jettisoning hardware on heating, Range Safety, ground station tracking, and elliptical parking orbits). The computer main frames on which the code was hosted are described. The applications of the code are detailed, including independent check of contractor analysis, benchmarking, leading edge analysis, and vehicle performance improvement assessments. Several of DUKSUPs many major impacts on

5. A Linear Programming Model to Optimize Various Objective Functions of a Foundation Type State Support Program.

Science.gov (United States)

Matzke, Orville R.

The purpose of this study was to formulate a linear programming model to simulate a foundation type support program and to apply this model to a state support program for the public elementary and secondary school districts in the State of Iowa. The model was successful in producing optimal solutions to five objective functions proposed for…

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

7. Leakage characterization of top select transistor for program disturbance optimization in 3D NAND flash

Science.gov (United States)

Zhang, Yu; Jin, Lei; Jiang, Dandan; Zou, Xingqi; Zhao, Zhiguo; Gao, Jing; Zeng, Ming; Zhou, Wenbin; Tang, Zhaoyun; Huo, Zongliang

2018-03-01

In order to optimize program disturbance characteristics effectively, a characterization approach that measures top select transistor (TSG) leakage from bit-line is proposed to quantify TSG leakage under program inhibit condition in 3D NAND flash memory. Based on this approach, the effect of Vth modulation of two-cell TSG on leakage is evaluated. By checking the dependence of leakage and corresponding program disturbance on upper and lower TSG Vth, this approach is validated. The optimal Vth pattern with high upper TSG Vth and low lower TSG Vth has been suggested for low leakage current and high boosted channel potential. It is found that upper TSG plays dominant role in preventing drain induced barrier lowering (DIBL) leakage from boosted channel to bit-line, while lower TSG assists to further suppress TSG leakage by providing smooth potential drop from dummy WL to edge of TSG, consequently suppressing trap assisted band-to-band tunneling current (BTBT) between dummy WL and TSG.

8. Nozzle Mounting Method Optimization Based on Robot Kinematic Analysis

Science.gov (United States)

Chen, Chaoyue; Liao, Hanlin; Montavon, Ghislain; Deng, Sihao

2016-08-01

Nowadays, the application of industrial robots in thermal spray is gaining more and more importance. A desired coating quality depends on factors such as a balanced robot performance, a uniform scanning trajectory and stable parameters (e.g. nozzle speed, scanning step, spray angle, standoff distance). These factors also affect the mass and heat transfer as well as the coating formation. Thus, the kinematic optimization of all these aspects plays a key role in order to obtain an optimal coating quality. In this study, the robot performance was optimized from the aspect of nozzle mounting on the robot. An optimized nozzle mounting for a type F4 nozzle was designed, based on the conventional mounting method from the point of view of robot kinematics validated on a virtual robot. Robot kinematic parameters were obtained from the simulation by offline programming software and analyzed by statistical methods. The energy consumptions of different nozzle mounting methods were also compared. The results showed that it was possible to reasonably assign the amount of robot motion to each axis during the process, so achieving a constant nozzle speed. Thus, it is possible optimize robot performance and to economize robot energy.

9. Simulation-based optimization of sustainable national energy systems

International Nuclear Information System (INIS)

Batas Bjelić, Ilija; Rajaković, Nikola

2015-01-01

The goals of the EU2030 energy policy should be achieved cost-effectively by employing the optimal mix of supply and demand side technical measures, including energy efficiency, renewable energy and structural measures. In this paper, the achievement of these goals is modeled by introducing an innovative method of soft-linking of EnergyPLAN with the generic optimization program (GenOpt). This soft-link enables simulation-based optimization, guided with the chosen optimization algorithm, rather than manual adjustments of the decision vectors. In order to obtain EnergyPLAN simulations within the optimization loop of GenOpt, the decision vectors should be chosen and explained in GenOpt for scenarios created in EnergyPLAN. The result of the optimization loop is an optimal national energy master plan (as a case study, energy policy in Serbia was taken), followed with sensitivity analysis of the exogenous assumptions and with focus on the contribution of the smart electricity grid to the achievement of EU2030 goals. It is shown that the increase in the policy-induced total costs of less than 3% is not significant. This general method could be further improved and used worldwide in the optimal planning of sustainable national energy systems. - Highlights: • Innovative method of soft-linking of EnergyPLAN with GenOpt has been introduced. • Optimal national energy master plan has been developed (the case study for Serbia). • Sensitivity analysis on the exogenous world energy and emission price development outlook. • Focus on the contribution of smart energy systems to the EU2030 goals. • Innovative soft-linking methodology could be further improved and used worldwide.

10. Risk Based Optimal Fatigue Testing

DEFF Research Database (Denmark)

Sørensen, John Dalsgaard; Faber, M.H.; Kroon, I.B.

1992-01-01

Optimal fatigue life testing of materials is considered. Based on minimization of the total expected costs of a mechanical component a strategy is suggested to determine the optimal stress range levels for which additional experiments are to be performed together with an optimal value...

11. Two example applications of optimization techniques to US Department of Energy contractor radiation protection programs

International Nuclear Information System (INIS)

Merwin, S.E.; Martin, J.B.; Selby, J.M.; Vallario, E.J.

1986-01-01

Six numerical examples of optimization of radiation protection are provided in the appendices of ICRP Publication 37. In each case, the calculations are based on fairly well defined parameters and assumptions that were well understood. In this paper, we have examined two numerical examples that are based on empirical data and less certain assumptions. These examples may represent typical applications of optimization principles to the evaluation of specific elements of a radiation protection program. In the first example, the optimum bioassay frequency for tritium workers was found to be once every 95 days, which compared well with ICRP Publication 10 recommendations. However, this result depended heavily on the assumption that the value of a potential undetected rem was US 1000. The second example showed that the optimum frequency for recalibrating Cutie Pie (CP) type ionization chamber survey instruments was once every 102 days, which compared well with the Hanford standard frequency of once every 90 days. This result depended largely on the assumption that an improperly operating CP instrument could lead to a serious overexposure. These examples have led us to conclude that optimization of radiation protection programs must be a very dynamic process. Examples must be recalculated as empirical data expand and improve and as the uncertainties surrounding assumptions are reduced 12. Optimization of environmental management strategies through a dynamic stochastic possibilistic multiobjective program. Science.gov (United States) Zhang, Xiaodong; Huang, Gordon 2013-02-15 Greenhouse gas (GHG) emissions from municipal solid waste (MSW) management facilities have become a serious environmental issue. In MSW management, not only economic objectives but also environmental objectives should be considered simultaneously. In this study, a dynamic stochastic possibilistic multiobjective programming (DSPMP) model is developed for supporting MSW management and associated GHG emission control. The DSPMP model improves upon the existing waste management optimization methods through incorporation of fuzzy possibilistic programming and chance-constrained programming into a general mixed-integer multiobjective linear programming (MOP) framework where various uncertainties expressed as fuzzy possibility distributions and probability distributions can be effectively reflected. Two conflicting objectives are integrally considered, including minimization of total system cost and minimization of total GHG emissions from waste management facilities. Three planning scenarios are analyzed and compared, representing different preferences of the decision makers for economic development and environmental-impact (i.e. GHG-emission) issues in integrated MSW management. Optimal decision schemes under three scenarios and different p(i) levels (representing the probability that the constraints would be violated) are generated for planning waste flow allocation and facility capacity expansions as well as GHG emission control. The results indicate that economic and environmental tradeoffs can be effectively reflected through the proposed DSPMP model. The generated decision variables can help the decision makers justify and/or adjust their waste management strategies based on their implicit knowledge and preferences. Copyright © 2012 Elsevier B.V. All rights reserved. 13. Logic-based methods for optimization combining optimization and constraint satisfaction CERN Document Server Hooker, John 2011-01-01 A pioneering look at the fundamental role of logic in optimization and constraint satisfaction While recent efforts to combine optimization and constraint satisfaction have received considerable attention, little has been said about using logic in optimization as the key to unifying the two fields. Logic-Based Methods for Optimization develops for the first time a comprehensive conceptual framework for integrating optimization and constraint satisfaction, then goes a step further and shows how extending logical inference to optimization allows for more powerful as well as flexible 14. Artificial Intelligence-Based Models for the Optimal and Sustainable Use of Groundwater in Coastal Aquifers Science.gov (United States) Sreekanth, J.; Datta, Bithin 2011-07-01 Overexploitation of the coastal aquifers results in saltwater intrusion. Once saltwater intrusion occurs, it involves huge cost and long-term remediation measures to remediate these contaminated aquifers. Hence, it is important to have strategies for the sustainable use of coastal aquifers. This study develops a methodology for the optimal management of saltwater intrusion prone aquifers. A linked simulation-optimization-based management strategy is developed. The methodology uses genetic-programming-based models for simulating the aquifer processes, which is then linked to a multi-objective genetic algorithm to obtain optimal management strategies in terms of groundwater extraction from potential well locations in the aquifer. 15. Optimal Risk Reduction in the Railway Industry by Using Dynamic Programming OpenAIRE Michael Todinov; Eberechi Weli 2013-01-01 The paper suggests for the first time the use of dynamic programming techniques for optimal risk reduction in the railway industry. It is shown that by using the concept ‘amount of removed risk by a risk reduction option’, the problem related to optimal allocation of a fixed budget to achieve a maximum risk reduction in the railway industry can be reduced to an optimisation problem from dynamic programming. For n risk reduction options and size of the available risk reduction budget B (expres... 16. Markdown Optimization via Approximate Dynamic Programming Directory of Open Access Journals (Sweden) Cos?gun 2013-02-01 Full Text Available We consider the markdown optimization problem faced by the leading apparel retail chain. Because of substitution among products the markdown policy of one product affects the sales of other products. Therefore, markdown policies for product groups having a significant crossprice elasticity among each other should be jointly determined. Since the state space of the problem is very huge, we use Approximate Dynamic Programming. Finally, we provide insights on the behavior of how each product price affects the markdown policy. 17. Optimization of land use of agricultural farms in Sumedang regency by using linear programming models Science.gov (United States) Zenis, F. M.; Supian, S.; Lesmana, E. 2018-03-01 Land is one of the most important assets for farmers in Sumedang Regency. Therefore, agricultural land should be used optimally. This study aims to obtain the optimal land use composition in order to obtain maximum income. The optimization method used in this research is Linear Programming Models. Based on the results of the analysis, the composition of land use for rice area of 135.314 hectares, corn area of 11.798 hectares, soy area of 2.290 hectares, and peanuts of 2.818 hectares with the value of farmers income of IDR 2.682.020.000.000,-/year. The results of this analysis can be used as a consideration in decisions making about cropping patterns by farmers. 18. Project STOP (Spectral Thermal Optimization Program) Science.gov (United States) Goldhammer, L. J.; Opjorden, R. W.; Goodelle, G. S.; Powe, J. S. 1977-01-01 The spectral thermal optimization of solar cell configurations for various solar panel applications is considered. The method of optimization depends upon varying the solar cell configuration's optical characteristics to minimize panel temperatures, maximize power output and decrease the power delta from beginning of life to end of life. Four areas of primary investigation are: (1) testing and evaluation of ultraviolet resistant coverslide adhesives, primarily FEP as an adhesive; (2) examination of solar cell absolute spectral response and corresponding cell manufacturing processes that affect it; (3) experimental work with solar cell manufacturing processes that vary cell reflectance (solar absorptance); and (4) experimental and theoretical studies with various coverslide filter designs, mainly a red rejection filter. The Hughes' solar array prediction program has been modified to aid in evaluating the effect of each of the above four areas on the output of a solar panel in orbit. 19. Research on crude oil storage and transportation based on optimization algorithm Science.gov (United States) Yuan, Xuhua 2018-04-01 At present, the optimization theory and method have been widely used in the optimization scheduling and optimal operation scheme of complex production systems. Based on C++Builder 6 program development platform, the theoretical research results are implemented by computer. The simulation and intelligent decision system of crude oil storage and transportation inventory scheduling are designed. The system includes modules of project management, data management, graphics processing, simulation of oil depot operation scheme. It can realize the optimization of the scheduling scheme of crude oil storage and transportation system. A multi-point temperature measuring system for monitoring the temperature field of floating roof oil storage tank is developed. The results show that by optimizing operating parameters such as tank operating mode and temperature, the total transportation scheduling costs of the storage and transportation system can be reduced by 9.1%. Therefore, this method can realize safe and stable operation of crude oil storage and transportation system. 20. Optimization programs for reactor core fuel loading exhibiting reduced neutron leakage International Nuclear Information System (INIS) Darilek, P. 1991-01-01 The program MAXIM was developed for the optimization of the fuel loading of WWER-440 reactors. It enables the reactor core reactivity to be maximized by modifying the arrangement of the fuel assemblies. The procedure is divided into three steps. The first step includes the passage from the three-dimensional model of the reactor core to the two-dimensional model. In the second step, the solution to the problem is sought assuming that the multiplying properties, or the reactivity in the zones of the core, vary continuously. In the third step, parameters of actual fuel assemblies are inserted in the ''continuous'' solution obtained. Combined with the program PROPAL for a detailed refinement of the loading, the program MAXIM forms a basis for the development of programs for the optimization of fuel loading with burnable poisons. (Z.M.). 16 refs 1. Dynamic Programming Approach for Exact Decision Rule Optimization KAUST Repository Amin, Talha 2013-01-01 This chapter is devoted to the study of an extension of dynamic programming approach that allows sequential optimization of exact decision rules relative to the length and coverage. It contains also results of experiments with decision tables from UCI Machine Learning Repository. © Springer-Verlag Berlin Heidelberg 2013. 2. Optimization of temperature-programmed GC separations. II. Off-line simplex optimization and column selection NARCIS (Netherlands) Snijders, H.M.J.; Janssen, J.G.M.; Cramers, C.A.M.G.; Sandra, P; Bertsch, W.; Sandra, P.; Devos, G. 1996-01-01 In this work a method is described which allows off-line optimization of temperature programmed GC separations. Recently, we described a new numerical method to predict off-line retention times and peak widths of a mixture containing components with known identities in capillary GC. In the present 3. Preventive maintenance: optimization of time - based discard decisions at the bruce nuclear generating station International Nuclear Information System (INIS) Doyle, E.K.; Jardine, A.K.S. 2001-01-01 The use of various maintenance optimization techniques at Bruce has lead to cost effective preventive maintenance applications for complex systems. As previously reported at ICONE 6 in New Orleans, 1996, several innovative practices reduced Reliability Centered Maintenance costs while maintaining the accuracy of the analysis. The optimization strategy has undergone further evolution and at the present an Integrated Maintenance Program (IMP) is in place where an Expert Panel consisting of all players/experts proceed through each system in a disciplined fashion and reach agreement on all items under a rigorous time frame. It is well known that there are essentially 3 maintenance based actions that can flow from a Maintenance Optimization Analysis: condition based maintenance, time based maintenance and time based discard. The present effort deals with time based discard decisions. Maintenance data from the Remote On-Power Fuel Changing System was used. (author) 4. Asymptotic Normality of the Optimal Solution in Multiresponse Surface Mathematical Programming OpenAIRE Díaz-García, José A.; Caro-Lopera, Francisco J. 2015-01-01 An explicit form for the perturbation effect on the matrix of regression coeffi- cients on the optimal solution in multiresponse surface methodology is obtained in this paper. Then, the sensitivity analysis of the optimal solution is studied and the critical point characterisation of the convex program, associated with the optimum of a multiresponse surface, is also analysed. Finally, the asymptotic normality of the optimal solution is derived by the standard methods. 5. Programming scheme based optimization of hybrid 4T-2R OxRAM NVSRAM Science.gov (United States) Majumdar, Swatilekha; Kingra, Sandeep Kaur; Suri, Manan 2017-09-01 In this paper, we present a novel single-cycle programming scheme for 4T-2R NVSRAM, exploiting pulse engineered input signals. OxRAM devices based on 3 nm thick bi-layer active switching oxide and 90 nm CMOS technology node were used for all simulations. The cell design is implemented for real-time non-volatility rather than last-bit, or power-down non-volatility. Detailed analysis of the proposed single-cycle, parallel RRAM device programming scheme is presented in comparison to the two-cycle sequential RRAM programming used for similar 4T-2R NVSRAM bit-cells. The proposed single-cycle programming scheme coupled with the 4T-2R architecture leads to several benefits such as- possibility of unconventional transistor sizing, 50% lower latency, 20% improvement in SNM and ∼20× reduced energy requirements, when compared against two-cycle programming approach. 6. 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. 7. Nuclear Power Reactor simulator - based training program International Nuclear Information System (INIS) Abdelwahab, S.A.S. 2009-01-01 nuclear power stations will continue playing a major role as an energy source for electric generation and heat production in the world. in this paper, a nuclear power reactor simulator- based training program will be presented . this program is designed to aid in training of the reactor operators about the principles of operation of the plant. also it could help the researchers and the designers to analyze and to estimate the performance of the nuclear reactors and facilitate further studies for selection of the proper controller and its optimization process as it is difficult and time consuming to do all experiments in the real nuclear environment.this program is written in MATLAB code as MATLAB software provides sophisticated tools comparable to those in other software such as visual basic for the creation of graphical user interface (GUI). moreover MATLAB is available for all major operating systems. the used SIMULINK reactor model for the nuclear reactor can be used to model different types by adopting appropriate parameters. the model of each component of the reactor is based on physical laws rather than the use of look up tables or curve fitting.this simulation based training program will improve acquisition and retention knowledge also trainee will learn faster and will have better attitude 8. POBE: A Computer Program for Optimal Design of Multi-Subject Blocked fMRI Experiments Directory of Open Access Journals (Sweden) Bärbel Maus 2014-01-01 Full Text Available For functional magnetic resonance imaging (fMRI studies, researchers can use multi-subject blocked designs to identify active brain regions for a certain stimulus type of interest. Before performing such an experiment, careful planning is necessary to obtain efficient stimulus effect estimators within the available financial resources. The optimal number of subjects and the optimal scanning time for a multi-subject blocked design with fixed experimental costs can be determined using optimal design methods. In this paper, the user-friendly computer program POBE 1.2 (program for optimal design of blocked experiments, version 1.2 is presented. POBE provides a graphical user interface for fMRI researchers to easily and efficiently design their experiments. The computer program POBE calculates the optimal number of subjects and the optimal scanning time for user specified experimental factors and model parameters so that the statistical efficiency is maximised for a given study budget. POBE can also be used to determine the minimum budget for a given power. Furthermore, a maximin design can be determined as efficient design for a possible range of values for the unknown model parameters. In this paper, the computer program is described and illustrated with typical experimental factors for a blocked fMRI experiment. 9. Real-time process optimization based on grey-box neural models Directory of Open Access Journals (Sweden) F. A. Cubillos 2007-09-01 Full Text Available This paper investigates the feasibility of using grey-box neural models (GNM in Real Time Optimization (RTO. These models are based on a suitable combination of fundamental conservation laws and neural networks, being used in at least two different ways: to complement available phenomenological knowledge with empirical information, or to reduce dimensionality of complex rigorous physical models. We have observed that the benefits of using these simple adaptable models are counteracted by some difficulties associated with the solution of the optimization problem. Nonlinear Programming (NLP algorithms failed in finding the global optimum due to the fact that neural networks can introduce multimodal objective functions. One alternative considered to solve this problem was the use of some kind of evolutionary algorithms, like Genetic Algorithms (GA. Although these algorithms produced better results in terms of finding the appropriate region, they took long periods of time to reach the global optimum. It was found that a combination of genetic and nonlinear programming algorithms can be use to fast obtain the optimum solution. The proposed approach was applied to the Williams-Otto reactor, considering three different GNM models of increasing complexity. Results demonstrated that the use of GNM models and mixed GA/NLP optimization algorithms is a promissory approach for solving dynamic RTO problems. 10. On the Lasserre hierarchy of semidefinite programming relaxations of convex polynomial optimization problems NARCIS (Netherlands) de Klerk, E.; Laurent, M. 2011-01-01 The Lasserre hierarchy of semidefinite programming approximations to convex polynomial optimization problems is known to converge finitely under some assumptions. [J. B. Lasserre, Convexity in semialgebraic geometry and polynomial optimization, SIAM J. Optim., 19 (2009), pp. 1995–2014]. We give a 11. The Social Construction of "Evidence-Based" Drug Prevention Programs: A Reanalysis of Data from the Drug Abuse Resistance Education (DARE) Program Science.gov (United States) Gorman, Dennis M.; Huber, J. Charles, Jr. 2009-01-01 This study explores the possibility that any drug prevention program might be considered "evidence-based" given the use of data analysis procedures that optimize the chance of producing statistically significant results by reanalyzing data from a Drug Abuse Resistance Education (DARE) program evaluation. The analysis produced a number of… 12. An Optimization Model for Expired Drug Recycling Logistics Networks and Government Subsidy Policy Design Based on Tri-level Programming. Science.gov (United States) Huang, Hui; Li, Yuyu; Huang, Bo; Pi, Xing 2015-07-09 In order to recycle and dispose of all people's expired drugs, the government should design a subsidy policy to stimulate users to return their expired drugs, and drug-stores should take the responsibility of recycling expired drugs, in other words, to be recycling stations. For this purpose it is necessary for the government to select the right recycling stations and treatment stations to optimize the expired drug recycling logistics network and minimize the total costs of recycling and disposal. This paper establishes a tri-level programming model to study how the government can optimize an expired drug recycling logistics network and the appropriate subsidy policies. Furthermore, a Hybrid Genetic Simulated Annealing Algorithm (HGSAA) is proposed to search for the optimal solution of the model. An experiment is discussed to illustrate the good quality of the recycling logistics network and government subsides obtained by the HGSAA. The HGSAA is proven to have the ability to converge on the global optimal solution, and to act as an effective algorithm for solving the optimization problem of expired drug recycling logistics network and government subsidies. 13. Structural Optimization based on the Concept of First Order Analysis International Nuclear Information System (INIS) Shinji, Nishiwaki; Hidekazu, Nishigaki; Yasuaki, Tsurumi; Yoshio, Kojima; Noboru, Kikuchi 2002-01-01 Computer Aided Engineering (CAE) has been successfully utilized in mechanical industries such as the automotive industry. It is, however, difficult for most mechanical design engineers to directly use CAE due to the sophisticated nature of the operations involved. In order to mitigate this problem, a new type of CAE, First Order Analysis (FOA) has been proposed. This paper presents the outcome of research concerning the development of a structural topology optimization methodology within FOA. This optimization method is constructed based on discrete and function-oriented elements such as beam and panel elements, and sequential convex programming. In addition, examples are provided to show the utility of the methodology presented here for mechanical design engineers 14. Flood Catastrophe Model for Designing Optimal Flood Insurance Program: Estimating Location-Specific Premiums in the Netherlands. Science.gov (United States) Ermolieva, T; Filatova, T; Ermoliev, Y; Obersteiner, M; de Bruijn, K M; Jeuken, A 2017-01-01 As flood risks grow worldwide, a well-designed insurance program engaging various stakeholders becomes a vital instrument in flood risk management. The main challenge concerns the applicability of standard approaches for calculating insurance premiums of rare catastrophic losses. This article focuses on the design of a flood-loss-sharing program involving private insurance based on location-specific exposures. The analysis is guided by a developed integrated catastrophe risk management (ICRM) model consisting of a GIS-based flood model and a stochastic optimization procedure with respect to location-specific risk exposures. To achieve the stability and robustness of the program towards floods with various recurrences, the ICRM uses stochastic optimization procedure, which relies on quantile-related risk functions of a systemic insolvency involving overpayments and underpayments of the stakeholders. Two alternative ways of calculating insurance premiums are compared: the robust derived with the ICRM and the traditional average annual loss approach. The applicability of the proposed model is illustrated in a case study of a Rotterdam area outside the main flood protection system in the Netherlands. Our numerical experiments demonstrate essential advantages of the robust premiums, namely, that they: (1) guarantee the program's solvency under all relevant flood scenarios rather than one average event; (2) establish a tradeoff between the security of the program and the welfare of locations; and (3) decrease the need for other risk transfer and risk reduction measures. © 2016 Society for Risk Analysis. 15. Dynamic programming approach to optimization of approximate decision rules KAUST Repository Amin, Talha M.; Chikalov, Igor; Moshkov, Mikhail; Zielosko, Beata 2013-01-01 This paper is devoted to the study of an extension of dynamic programming approach which allows sequential optimization of approximate decision rules relative to the length and coverage. We introduce an uncertainty measure R(T) which is the number 16. Cost versus life cycle assessment-based environmental impact optimization of drinking water production plants. Science.gov (United States) Capitanescu, F; Rege, S; Marvuglia, A; Benetto, E; Ahmadi, A; Gutiérrez, T Navarrete; Tiruta-Barna, L 2016-07-15 Empowering decision makers with cost-effective solutions for reducing industrial processes environmental burden, at both design and operation stages, is nowadays a major worldwide concern. The paper addresses this issue for the sector of drinking water production plants (DWPPs), seeking for optimal solutions trading-off operation cost and life cycle assessment (LCA)-based environmental impact while satisfying outlet water quality criteria. This leads to a challenging bi-objective constrained optimization problem, which relies on a computationally expensive intricate process-modelling simulator of the DWPP and has to be solved with limited computational budget. Since mathematical programming methods are unusable in this case, the paper examines the performances in tackling these challenges of six off-the-shelf state-of-the-art global meta-heuristic optimization algorithms, suitable for such simulation-based optimization, namely Strength Pareto Evolutionary Algorithm (SPEA2), Non-dominated Sorting Genetic Algorithm (NSGA-II), Indicator-based Evolutionary Algorithm (IBEA), Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D), Differential Evolution (DE), and Particle Swarm Optimization (PSO). The results of optimization reveal that good reduction in both operating cost and environmental impact of the DWPP can be obtained. Furthermore, NSGA-II outperforms the other competing algorithms while MOEA/D and DE perform unexpectedly poorly. Copyright © 2016 Elsevier Ltd. All rights reserved. 17. Genetic algorithm based separation cascade optimization International Nuclear Information System (INIS) Mahendra, A.K.; Sanyal, A.; Gouthaman, G.; Bera, T.K. 2008-01-01 The conventional separation cascade design procedure does not give an optimum design because of squaring-off, variation of flow rates and separation factor of the element with respect to stage location. Multi-component isotope separation further complicates the design procedure. Cascade design can be stated as a constrained multi-objective optimization. Cascade's expectation from the separating element is multi-objective i.e. overall separation factor, cut, optimum feed and separative power. Decision maker may aspire for more comprehensive multi-objective goals where optimization of cascade is coupled with the exploration of separating element optimization vector space. In real life there are many issues which make it important to understand the decision maker's perception of cost-quality-speed trade-off and consistency of preferences. Genetic algorithm (GA) is one such evolutionary technique that can be used for cascade design optimization. This paper addresses various issues involved in the GA based multi-objective optimization of the separation cascade. Reference point based optimization methodology with GA based Pareto optimality concept for separation cascade was found pragmatic and promising. This method should be explored, tested, examined and further developed for binary as well as multi-component separations. (author) 18. Damping layout optimization for ship's cabin noise reduction based on statistical energy analysis Directory of Open Access Journals (Sweden) WU Weiguo 2017-08-01 Full Text Available An optimization analysis study concerning the damping control of ship's cabin noise was carried out in order to improve the effect and reduce the weight of damping. Based on the Statistical Energy Analysis (SEA method, a theoretical deduction and numerical analysis of the first-order sensitivity analysis of the A-weighted sound pressure level concerning the damping loss factor of the subsystem were carried out. On this basis, a mathematical optimization model was proposed and an optimization program developed. Next, the secondary development of VA One software was implemented through the use of MATLAB, while the cabin noise damping control layout optimization system was established. Finally, the optimization model of the ship was constructed and numerical experiments of damping control optimization conducted. The damping installation region was divided into five parts with different damping thicknesses. The total weight of damping was set as an objective function and the A-weighted sound pressure level of the target cabin was set as a constraint condition. The best damping thickness was obtained through the optimization program, and the total damping weight was reduced by 60.4%. The results show that the damping noise reduction effect of unit weight is significantly improved through the optimization method. This research successfully solves the installation position and thickness selection problems in the acoustic design of damping control, providing a reliable analysis method and guidance for the design. 19. Reliability-Based Optimization in Structural Engineering DEFF Research Database (Denmark) Enevoldsen, I.; Sørensen, John Dalsgaard 1994-01-01 In this paper reliability-based optimization problems in structural engineering are formulated on the basis of the classical decision theory. Several formulations are presented: Reliability-based optimal design of structural systems with component or systems reliability constraints, reliability... 20. Spur gears: Optimal geometry, methods for generation and Tooth Contact Analysis (TCA) program Science.gov (United States) Litvin, Faydor L.; Zhang, Jiao 1988-01-01 The contents of this report include the following: (1) development of optimal geometry for crowned spur gears; (2) methods for their generation; and (3) tooth contact analysis (TCA) computer programs for the analysis of meshing and bearing contact on the crowned spur gears. The method developed for synthesis is used for the determination of the optimal geometry for crowned pinion surface and is directed to reduce the sensitivity of the gears to misalignment, localize the bearing contact, and guarantee the favorable shape and low level of the transmission errors. A new method for the generation of the crowned pinion surface has been proposed. This method is based on application of the tool with a surface of revolution that slightly deviates from a regular cone surface. The tool can be used as a grinding wheel or as a shaver. The crowned pinion surface can also be generated by a generating plane whose motion is provided by an automatic grinding machine controlled by a computer. The TCA program simulates the meshing and bearing contact of the misaligned gears. The transmission errors are also determined. 1. A Kind of Nonlinear Programming Problem Based on Mixed Fuzzy Relation Equations Constraints Science.gov (United States) Li, Jinquan; Feng, Shuang; Mi, Honghai In this work, a kind of nonlinear programming problem with non-differential objective function and under the constraints expressed by a system of mixed fuzzy relation equations is investigated. First, some properties of this kind of optimization problem are obtained. Then, a polynomial-time algorithm for this kind of optimization problem is proposed based on these properties. Furthermore, we show that this algorithm is optimal for the considered optimization problem in this paper. Finally, numerical examples are provided to illustrate our algorithms. 2. Topology optimization for elastic base under rectangular plate subjected to moving load Directory of Open Access Journals (Sweden) Jilavyan Samvel H. 2015-09-01 Full Text Available Distribution optimization of elastic material under elastic isotropic rectangular thin plate subjected to concentrated moving load is investigated in the present paper. The aim of optimization is to damp its vibrations in finite (fixed time. Accepting Kirchhoff hypothesis with respect to the plate and Winkler hypothesis with respect to the base, the mathematical model of the problem is constructed as two-dimensional bilinear equation, i.e. linear in state and control function. The maximal quantity of the base material is taken as optimality criterion to be minimized. The Fourier distributional transform and the Bubnov-Galerkin procedures are used to reduce the problem to integral equality type constraints. The explicit solution in terms of two- dimensional Heaviside‘s function is obtained, describing piecewise-continuous distribution of the material. The determination of the switching points is reduced to a problem of nonlinear programming. Data from numerical analysis are presented. 3. A particle-based simplified swarm optimization algorithm for reliability redundancy allocation problems International Nuclear Information System (INIS) Huang, Chia-Ling 2015-01-01 This paper proposes a new swarm intelligence method known as the Particle-based Simplified Swarm Optimization (PSSO) algorithm while undertaking a modification of the Updating Mechanism (UM), called N-UM and R-UM, and simultaneously applying an Orthogonal Array Test (OA) to solve reliability–redundancy allocation problems (RRAPs) successfully. One difficulty of RRAP is the need to maximize system reliability in cases where the number of redundant components and the reliability of corresponding components in each subsystem are simultaneously decided with nonlinear constraints. In this paper, four RRAP benchmarks are used to display the applicability of the proposed PSSO that advances the strengths of both PSO and SSO to enable optimizing the RRAP that belongs to mixed-integer nonlinear programming. When the computational results are compared with those of previously developed algorithms in existing literature, the findings indicate that the proposed PSSO is highly competitive and performs well. - Highlights: • This paper proposes a particle-based simplified swarm optimization algorithm (PSSO) to optimize RRAP. • Furthermore, the UM and an OA are adapted to advance in optimizing RRAP. • Four systems are introduced and the results demonstrate the PSSO performs particularly well 4. Multiphase Return Trajectory Optimization Based on Hybrid Algorithm Directory of Open Access Journals (Sweden) Yi Yang 2016-01-01 Full Text Available A hybrid trajectory optimization method consisting of Gauss pseudospectral method (GPM and natural computation algorithm has been developed and utilized to solve multiphase return trajectory optimization problem, where a phase is defined as a subinterval in which the right-hand side of the differential equation is continuous. GPM converts the optimal control problem to a nonlinear programming problem (NLP, which helps to improve calculation accuracy and speed of natural computation algorithm. Through numerical simulations, it is found that the multiphase optimal control problem could be solved perfectly. 5. 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. 6. Large-scale hydropower system optimization using dynamic programming and object-oriented programming: the case of the Northeast China Power Grid. Science.gov (United States) Li, Ji-Qing; Zhang, Yu-Shan; Ji, Chang-Ming; Wang, Ai-Jing; Lund, Jay R 2013-01-01 This paper examines long-term optimal operation using dynamic programming for a large hydropower system of 10 reservoirs in Northeast China. Besides considering flow and hydraulic head, the optimization explicitly includes time-varying electricity market prices to maximize benefit. Two techniques are used to reduce the 'curse of dimensionality' of dynamic programming with many reservoirs. Discrete differential dynamic programming (DDDP) reduces the search space and computer memory needed. Object-oriented programming (OOP) and the ability to dynamically allocate and release memory with the C++ language greatly reduces the cumulative effect of computer memory for solving multi-dimensional dynamic programming models. The case study shows that the model can reduce the 'curse of dimensionality' and achieve satisfactory results. 7. Nonlinear Time Series Prediction Using LS-SVM with Chaotic Mutation Evolutionary Programming for Parameter Optimization International Nuclear Information System (INIS) Xu Ruirui; Chen Tianlun; Gao Chengfeng 2006-01-01 Nonlinear time series prediction is studied by using an improved least squares support vector machine (LS-SVM) regression based on chaotic mutation evolutionary programming (CMEP) approach for parameter optimization. We analyze how the prediction error varies with different parameters (σ, γ) in LS-SVM. In order to select appropriate parameters for the prediction model, we employ CMEP algorithm. Finally, Nasdaq stock data are predicted by using this LS-SVM regression based on CMEP, and satisfactory results are obtained. 8. The Ontology of Knowledge Based Optimization OpenAIRE Nasution, Mahyuddin K. M. 2012-01-01 Optimization has been becoming a central of studies in mathematic and has many areas with different applications. However, many themes of optimization came from different area have not ties closing to origin concepts. This paper is to address some variants of optimization problems using ontology in order to building basic of knowledge about optimization, and then using it to enhance strategy to achieve knowledge based optimization. 9. Optimization of planting pattern plan in Logung irrigation area using linear program Science.gov (United States) Wardoyo, Wasis; Setyono 2018-03-01 Logung irrigation area is located in Kudus Regency, Central Java Province, Indonesia. Irrigation area with 2810 Ha of extent is getting water supply from Logung dam. Yet, the utilization of water at Logung dam is not optimal and the distribution of water is still not evenly distributed. Therefore, this study will discuss about the optimization of irrigation water utilization based on the beginning of plant season. This optimization begins with the analysis of hydrology, climatology and river discharge in order to determine the irrigation water needs. After determining irrigation water needs, six alternatives of planting patterns with the different early planting periods, i.e. 1st November, 2nd November, 3rd November, 1st December, 2nd December, and 3rd December with the planting pattern of rice-secondary crop-sugarcane is introduced. It is continued by the analysis of water distribution conducted using linear program assisted by POM-Quantity method for Windows 3 with the reliable discharge limit and the available land area. Output of this calculation are to determine the land area that can be planted based on the type of plant and growing season, and to obtaine the profits of harvest yields. Based on the optimum area of each plant species with 6 alternatives, the most optimum area was obtained at the early planting periods on 3rd December with the production profit of Rp 113.397.338.854,- with the planting pattern of rice / beans / sugarcane-rice / beans / sugarcane-beans / sugarcane. 10. Comparison of linear and nonlinear programming approaches for "worst case dose" and "minmax" robust optimization of intensity-modulated proton therapy dose distributions. Science.gov (United States) Zaghian, Maryam; Cao, Wenhua; Liu, Wei; Kardar, Laleh; Randeniya, Sharmalee; Mohan, Radhe; Lim, Gino 2017-03-01 Robust optimization of intensity-modulated proton therapy (IMPT) takes uncertainties into account during spot weight optimization and leads to dose distributions that are resilient to uncertainties. Previous studies demonstrated benefits of linear programming (LP) for IMPT in terms of delivery efficiency by considerably reducing the number of spots required for the same quality of plans. However, a reduction in the number of spots may lead to loss of robustness. The purpose of this study was to evaluate and compare the performance in terms of plan quality and robustness of two robust optimization approaches using LP and nonlinear programming (NLP) models. The so-called "worst case dose" and "minmax" robust optimization approaches and conventional planning target volume (PTV)-based optimization approach were applied to designing IMPT plans for five patients: two with prostate cancer, one with skull-based cancer, and two with head and neck cancer. For each approach, both LP and NLP models were used. Thus, for each case, six sets of IMPT plans were generated and assessed: LP-PTV-based, NLP-PTV-based, LP-worst case dose, NLP-worst case dose, LP-minmax, and NLP-minmax. The four robust optimization methods behaved differently from patient to patient, and no method emerged as superior to the others in terms of nominal plan quality and robustness against uncertainties. The plans generated using LP-based robust optimization were more robust regarding patient setup and range uncertainties than were those generated using NLP-based robust optimization for the prostate cancer patients. However, the robustness of plans generated using NLP-based methods was superior for the skull-based and head and neck cancer patients. Overall, LP-based methods were suitable for the less challenging cancer cases in which all uncertainty scenarios were able to satisfy tight dose constraints, while NLP performed better in more difficult cases in which most uncertainty scenarios were hard to meet 11. PRODUCT OPTIMIZATION METHOD BASED ON ANALYSIS OF OPTIMAL VALUES OF THEIR CHARACTERISTICS Directory of Open Access Journals (Sweden) Constantin D. STANESCU 2016-05-01 Full Text Available The paper presents an original method of optimizing products based on the analysis of optimal values of their characteristics . Optimization method comprises statistical model and analytical model . With this original method can easily and quickly obtain optimal product or material . 12. Application of goal programming to decision problem on optimal allocation of radiation workers International Nuclear Information System (INIS) Sa, Sangduk; Narita, Masakuni 1993-01-01 This paper is concerned with an optimal planning in a multiple objective decision-making problem of allocating radiation workers to workplaces associated with occupational exposure. The model problem is formulated with the application of goal programming which effectively followed up diverse and conflicting factors influencing the optimal decision. The formulation is based on the data simulating the typical situations encountered at the operating facilities such as nuclear power plants where exposure control is critical to the management. Multiple goals set by the decision-maker/manager who has the operational responsibilities for radiological protection are illustrated in terms of work requirements, exposure constraints of the places, desired allocation of specific personnel and so on. Test results of the model are considered to indicate that the model structure and its solution process can provide the manager with a good set of analysis of his problems in implementing the optimization review of radiation protection during normal operation. (author) 13. Optimizing DNA assembly based on statistical language modelling. Science.gov (United States) Fang, Gang; Zhang, Shemin; Dong, Yafei 2017-12-15 By successively assembling genetic parts such as BioBrick according to grammatical models, complex genetic constructs composed of dozens of functional blocks can be built. However, usually every category of genetic parts includes a few or many parts. With increasing quantity of genetic parts, the process of assembling more than a few sets of these parts can be expensive, time consuming and error prone. At the last step of assembling it is somewhat difficult to decide which part should be selected. Based on statistical language model, which is a probability distribution P(s) over strings S that attempts to reflect how frequently a string S occurs as a sentence, the most commonly used parts will be selected. Then, a dynamic programming algorithm was designed to figure out the solution of maximum probability. The algorithm optimizes the results of a genetic design based on a grammatical model and finds an optimal solution. In this way, redundant operations can be reduced and the time and cost required for conducting biological experiments can be minimized. © The Author(s) 2017. Published by Oxford University Press on behalf of Nucleic Acids Research. 14. Reliability-based design optimization using a generalized subset simulation method and posterior approximation Science.gov (United States) Ma, Yuan-Zhuo; Li, Hong-Shuang; Yao, Wei-Xing 2018-05-01 The evaluation of the probabilistic constraints in reliability-based design optimization (RBDO) problems has always been significant and challenging work, which strongly affects the performance of RBDO methods. This article deals with RBDO problems using a recently developed generalized subset simulation (GSS) method and a posterior approximation approach. The posterior approximation approach is used to transform all the probabilistic constraints into ordinary constraints as in deterministic optimization. The assessment of multiple failure probabilities required by the posterior approximation approach is achieved by GSS in a single run at all supporting points, which are selected by a proper experimental design scheme combining Sobol' sequences and Bucher's design. Sequentially, the transformed deterministic design optimization problem can be solved by optimization algorithms, for example, the sequential quadratic programming method. Three optimization problems are used to demonstrate the efficiency and accuracy of the proposed method. 15. Model Based Optimal Sensor Network Design for Condition Monitoring in an IGCC Plant Energy Technology Data Exchange (ETDEWEB) Kumar, Rajeeva; Kumar, Aditya; Dai, Dan; Seenumani, Gayathri; Down, John; Lopez, Rodrigo 2012-12-31 This report summarizes the achievements and final results of this program. The objective of this program is to develop a general model-based sensor network design methodology and tools to address key issues in the design of an optimal sensor network configuration: the type, location and number of sensors used in a network, for online condition monitoring. In particular, the focus in this work is to develop software tools for optimal sensor placement (OSP) and use these tools to design optimal sensor network configuration for online condition monitoring of gasifier refractory wear and radiant syngas cooler (RSC) fouling. The methodology developed will be applicable to sensing system design for online condition monitoring for broad range of applications. The overall approach consists of (i) defining condition monitoring requirement in terms of OSP and mapping these requirements in mathematical terms for OSP algorithm, (ii) analyzing trade-off of alternate OSP algorithms, down selecting the most relevant ones and developing them for IGCC applications (iii) enhancing the gasifier and RSC models as required by OSP algorithms, (iv) applying the developed OSP algorithm to design the optimal sensor network required for the condition monitoring of an IGCC gasifier refractory and RSC fouling. Two key requirements for OSP for condition monitoring are desired precision for the monitoring variables (e.g. refractory wear) and reliability of the proposed sensor network in the presence of expected sensor failures. The OSP problem is naturally posed within a Kalman filtering approach as an integer programming problem where the key requirements of precision and reliability are imposed as constraints. The optimization is performed over the overall network cost. Based on extensive literature survey two formulations were identified as being relevant to OSP for condition monitoring; one based on LMI formulation and the other being standard INLP formulation. Various algorithms to solve 16. A novel approach based on preference-based index for interval bilevel linear programming problem. Science.gov (United States) Ren, Aihong; Wang, Yuping; Xue, Xingsi 2017-01-01 This paper proposes a new methodology for solving the interval bilevel linear programming problem in which all coefficients of both objective functions and constraints are considered as interval numbers. In order to keep as much uncertainty of the original constraint region as possible, the original problem is first converted into an interval bilevel programming problem with interval coefficients in both objective functions only through normal variation of interval number and chance-constrained programming. With the consideration of different preferences of different decision makers, the concept of the preference level that the interval objective function is preferred to a target interval is defined based on the preference-based index. Then a preference-based deterministic bilevel programming problem is constructed in terms of the preference level and the order relation [Formula: see text]. Furthermore, the concept of a preference δ -optimal solution is given. Subsequently, the constructed deterministic nonlinear bilevel problem is solved with the help of estimation of distribution algorithm. Finally, several numerical examples are provided to demonstrate the effectiveness of the proposed approach. 17. A novel approach based on preference-based index for interval bilevel linear programming problem Directory of Open Access Journals (Sweden) Aihong Ren 2017-05-01 Full Text Available Abstract This paper proposes a new methodology for solving the interval bilevel linear programming problem in which all coefficients of both objective functions and constraints are considered as interval numbers. In order to keep as much uncertainty of the original constraint region as possible, the original problem is first converted into an interval bilevel programming problem with interval coefficients in both objective functions only through normal variation of interval number and chance-constrained programming. With the consideration of different preferences of different decision makers, the concept of the preference level that the interval objective function is preferred to a target interval is defined based on the preference-based index. Then a preference-based deterministic bilevel programming problem is constructed in terms of the preference level and the order relation ⪯ m w\\preceq_{mw}. Furthermore, the concept of a preference δ-optimal solution is given. Subsequently, the constructed deterministic nonlinear bilevel problem is solved with the help of estimation of distribution algorithm. Finally, several numerical examples are provided to demonstrate the effectiveness of the proposed approach. 18. Computer Program for Analysis, Design and Optimization of Propulsion, Dynamics, and Kinematics of Multistage Rockets Science.gov (United States) Lali, Mehdi 2009-03-01 A comprehensive computer program is designed in MATLAB to analyze, design and optimize the propulsion, dynamics, thermodynamics, and kinematics of any serial multi-staging rocket for a set of given data. The program is quite user-friendly. It comprises two main sections: "analysis and design" and "optimization." Each section has a GUI (Graphical User Interface) in which the rocket's data are entered by the user and by which the program is run. The first section analyzes the performance of the rocket that is previously devised by the user. Numerous plots and subplots are provided to display the performance of the rocket. The second section of the program finds the "optimum trajectory" via billions of iterations and computations which are done through sophisticated algorithms using numerical methods and incremental integrations. Innovative techniques are applied to calculate the optimal parameters for the engine and designing the "optimal pitch program." This computer program is stand-alone in such a way that it calculates almost every design parameter in regards to rocket propulsion and dynamics. It is meant to be used for actual launch operations as well as educational and research purposes. 19. An Optimization Model for Expired Drug Recycling Logistics Networks and Government Subsidy Policy Design Based on Tri-level Programming Directory of Open Access Journals (Sweden) Hui Huang 2015-07-01 Full Text Available In order to recycle and dispose of all people’s expired drugs, the government should design a subsidy policy to stimulate users to return their expired drugs, and drug-stores should take the responsibility of recycling expired drugs, in other words, to be recycling stations. For this purpose it is necessary for the government to select the right recycling stations and treatment stations to optimize the expired drug recycling logistics network and minimize the total costs of recycling and disposal. This paper establishes a tri-level programming model to study how the government can optimize an expired drug recycling logistics network and the appropriate subsidy policies. Furthermore, a Hybrid Genetic Simulated Annealing Algorithm (HGSAA is proposed to search for the optimal solution of the model. An experiment is discussed to illustrate the good quality of the recycling logistics network and government subsides obtained by the HGSAA. The HGSAA is proven to have the ability to converge on the global optimal solution, and to act as an effective algorithm for solving the optimization problem of expired drug recycling logistics network and government subsidies. 20. LQR-Based Optimal Distributed Cooperative Design for Linear Discrete-Time Multiagent Systems. Science.gov (United States) Zhang, Huaguang; Feng, Tao; Liang, Hongjing; Luo, Yanhong 2017-03-01 In this paper, a novel linear quadratic regulator (LQR)-based optimal distributed cooperative design method is developed for synchronization control of general linear discrete-time multiagent systems on a fixed, directed graph. Sufficient conditions are derived for synchronization, which restrict the graph eigenvalues into a bounded circular region in the complex plane. The synchronizing speed issue is also considered, and it turns out that the synchronizing region reduces as the synchronizing speed becomes faster. To obtain more desirable synchronizing capacity, the weighting matrices are selected by sufficiently utilizing the guaranteed gain margin of the optimal regulators. Based on the developed LQR-based cooperative design framework, an approximate dynamic programming technique is successfully introduced to overcome the (partially or completely) model-free cooperative design for linear multiagent systems. Finally, two numerical examples are given to illustrate the effectiveness of the proposed design methods. 1. Using linear programming to analyze and optimize stochastic flow lines DEFF Research Database (Denmark) Helber, Stefan; Schimmelpfeng, Katja; Stolletz, Raik 2011-01-01 This paper presents a linear programming approach to analyze and optimize flow lines with limited buffer capacities and stochastic processing times. The basic idea is to solve a huge but simple linear program that models an entire simulation run of a multi-stage production process in discrete time...... programming and hence allows us to solve buffer allocation problems. We show under which conditions our method works well by comparing its results to exact values for two-machine models and approximate simulation results for longer lines.... 2. Systematic Optimization-Based Integrated Chemical Product–Process Design Framework DEFF Research Database (Denmark) Cignitti, Stefano; Mansouri, Seyed Soheil; Woodley, John M. 2018-01-01 An integrated optimization-based framework for product and process design is proposed. The framework uses a set of methods and tools to obtain the optimal product–process design solution given a set of economic and environmental sustainability targets. The methods and tools required are property...... of the framework is demonstrated through three case studies: (i) refrigeration cycle unit for R134a replacement, (ii) a mixed working fluid design problem for R134a replacement, and (iii) pure solvent design for water-acetic acid LLE extraction. Through the application of the framework it is demonstrated that all...... prediction through group contributions, unless supported with a database, computer-aided molecular and mixture/blend design for generation of novel as well as existing products and mathematical programming for formulating and solving multiscale integrated process–product design problems. The application... 3. Optimal Search Strategy of Robotic Assembly Based on Neural Vibration Learning Directory of Open Access Journals (Sweden) Lejla Banjanovic-Mehmedovic 2011-01-01 Full Text Available This paper presents implementation of optimal search strategy (OSS in verification of assembly process based on neural vibration learning. The application problem is the complex robot assembly of miniature parts in the example of mating the gears of one multistage planetary speed reducer. Assembly of tube over the planetary gears was noticed as the most difficult problem of overall assembly. The favourable influence of vibration and rotation movement on compensation of tolerance was also observed. With the proposed neural-network-based learning algorithm, it is possible to find extended scope of vibration state parameter. Using optimal search strategy based on minimal distance path between vibration parameter stage sets (amplitude and frequencies of robots gripe vibration and recovery parameter algorithm, we can improve the robot assembly behaviour, that is, allow the fastest possible way of mating. We have verified by using simulation programs that search strategy is suitable for the situation of unexpected events due to uncertainties. 4. Online Adaptive Optimal Control of Vehicle Active Suspension Systems Using Single-Network Approximate Dynamic Programming Directory of Open Access Journals (Sweden) Zhi-Jun Fu 2017-01-01 Full Text Available In view of the performance requirements (e.g., ride comfort, road holding, and suspension space limitation for vehicle suspension systems, this paper proposes an adaptive optimal control method for quarter-car active suspension system by using the approximate dynamic programming approach (ADP. Online optimal control law is obtained by using a single adaptive critic NN to approximate the solution of the Hamilton-Jacobi-Bellman (HJB equation. Stability of the closed-loop system is proved by Lyapunov theory. Compared with the classic linear quadratic regulator (LQR approach, the proposed ADP-based adaptive optimal control method demonstrates improved performance in the presence of parametric uncertainties (e.g., sprung mass and unknown road displacement. Numerical simulation results of a sedan suspension system are presented to verify the effectiveness of the proposed control strategy. 5. Towards optimizing server performance in an educational MMORPG for teaching computer programming Science.gov (United States) Malliarakis, Christos; Satratzemi, Maya; Xinogalos, Stelios 2013-10-01 Web-based games have become significantly popular during the last few years. This is due to the gradual increase of internet speed, which has led to the ongoing multiplayer games development and more importantly the emergence of the Massive Multiplayer Online Role Playing Games (MMORPG) field. In parallel, similar technologies called educational games have started to be developed in order to be put into practice in various educational contexts, resulting in the field of Game Based Learning. However, these technologies require significant amounts of resources, such as bandwidth, RAM and CPU capacity etc. These amounts may be even larger in an educational MMORPG game that supports computer programming education, due to the usual inclusion of a compiler and the constant client/server data transmissions that occur during program coding, possibly leading to technical issues that could cause malfunctions during learning. Thus, the determination of the elements that affect the overall games resources' load is essential so that server administrators can configure them and ensure educational games' proper operation during computer programming education. In this paper, we propose a new methodology with which we can achieve monitoring and optimization of the load balancing, so that the essential resources for the creation and proper execution of an educational MMORPG for computer programming can be foreseen and bestowed without overloading the system. 6. Coverage-based constraints for IMRT optimization Science.gov (United States) Mescher, H.; Ulrich, S.; Bangert, M. 2017-09-01 Radiation therapy treatment planning requires an incorporation of uncertainties in order to guarantee an adequate irradiation of the tumor volumes. In current clinical practice, uncertainties are accounted for implicitly with an expansion of the target volume according to generic margin recipes. Alternatively, it is possible to account for uncertainties by explicit minimization of objectives that describe worst-case treatment scenarios, the expectation value of the treatment or the coverage probability of the target volumes during treatment planning. In this note we show that approaches relying on objectives to induce a specific coverage of the clinical target volumes are inevitably sensitive to variation of the relative weighting of the objectives. To address this issue, we introduce coverage-based constraints for intensity-modulated radiation therapy (IMRT) treatment planning. Our implementation follows the concept of coverage-optimized planning that considers explicit error scenarios to calculate and optimize patient-specific probabilities q(\\hat{d}, \\hat{v}) of covering a specific target volume fraction \\hat{v} with a certain dose \\hat{d} . Using a constraint-based reformulation of coverage-based objectives we eliminate the trade-off between coverage and competing objectives during treatment planning. In-depth convergence tests including 324 treatment plan optimizations demonstrate the reliability of coverage-based constraints for varying levels of probability, dose and volume. General clinical applicability of coverage-based constraints is demonstrated for two cases. A sensitivity analysis regarding penalty variations within this planing study based on IMRT treatment planning using (1) coverage-based constraints, (2) coverage-based objectives, (3) probabilistic optimization, (4) robust optimization and (5) conventional margins illustrates the potential benefit of coverage-based constraints that do not require tedious adjustment of target volume objectives. 7. Exploiting variability for energy optimization of parallel programs Energy Technology Data Exchange (ETDEWEB) Lavrijsen, Wim [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Iancu, Costin [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); de Jong, Wibe [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Chen, Xin [Georgia Inst. of Technology, Atlanta, GA (United States); Schwan, Karsten [Georgia Inst. of Technology, Atlanta, GA (United States) 2016-04-18 Here in this paper we present optimizations that use DVFS mechanisms to reduce the total energy usage in scientific applications. Our main insight is that noise is intrinsic to large scale parallel executions and it appears whenever shared resources are contended. The presence of noise allows us to identify and manipulate any program regions amenable to DVFS. When compared to previous energy optimizations that make per core decisions using predictions of the running time, our scheme uses a qualitative approach to recognize the signature of executions amenable to DVFS. By recognizing the "shape of variability" we can optimize codes with highly dynamic behavior, which pose challenges to all existing DVFS techniques. We validate our approach using offline and online analyses for one-sided and two-sided communication paradigms. We have applied our methods to NWChem, and we show best case improvements in energy use of 12% at no loss in performance when using online optimizations running on 720 Haswell cores with one-sided communication. With NWChem on MPI two-sided and offline analysis, capturing the initialization, we find energy savings of up to 20%, with less than 1% performance cost. 8. Performance comparison of genetic algorithms and particle swarm optimization for model integer programming bus timetabling problem Science.gov (United States) Wihartiko, F. D.; Wijayanti, H.; Virgantari, F. 2018-03-01 Genetic Algorithm (GA) is a common algorithm used to solve optimization problems with artificial intelligence approach. Similarly, the Particle Swarm Optimization (PSO) algorithm. Both algorithms have different advantages and disadvantages when applied to the case of optimization of the Model Integer Programming for Bus Timetabling Problem (MIPBTP), where in the case of MIPBTP will be found the optimal number of trips confronted with various constraints. The comparison results show that the PSO algorithm is superior in terms of complexity, accuracy, iteration and program simplicity in finding the optimal solution. 9. Optimization and Control of Agent-Based Models in Biology: A Perspective. Science.gov (United States) An, G; Fitzpatrick, B G; Christley, S; Federico, P; Kanarek, A; Neilan, R Miller; Oremland, M; Salinas, R; Laubenbacher, R; Lenhart, S 2017-01-01 Agent-based models (ABMs) have become an increasingly important mode of inquiry for the life sciences. They are particularly valuable for systems that are not understood well enough to build an equation-based model. These advantages, however, are counterbalanced by the difficulty of analyzing and using ABMs, due to the lack of the type of mathematical tools available for more traditional models, which leaves simulation as the primary approach. As models become large, simulation becomes challenging. This paper proposes a novel approach to two mathematical aspects of ABMs, optimization and control, and it presents a few first steps outlining how one might carry out this approach. Rather than viewing the ABM as a model, it is to be viewed as a surrogate for the actual system. For a given optimization or control problem (which may change over time), the surrogate system is modeled instead, using data from the ABM and a modeling framework for which ready-made mathematical tools exist, such as differential equations, or for which control strategies can explored more easily. Once the optimization problem is solved for the model of the surrogate, it is then lifted to the surrogate and tested. The final step is to lift the optimization solution from the surrogate system to the actual system. This program is illustrated with published work, using two relatively simple ABMs as a demonstration, Sugarscape and a consumer-resource ABM. Specific techniques discussed include dimension reduction and approximation of an ABM by difference equations as well systems of PDEs, related to certain specific control objectives. This demonstration illustrates the very challenging mathematical problems that need to be solved before this approach can be realistically applied to complex and large ABMs, current and future. The paper outlines a research program to address them. 10. Robust Nearfield Wideband Beamforming Design Based on Adaptive-Weighted Convex Optimization Directory of Open Access Journals (Sweden) Guo Ye-Cai 2017-01-01 Full Text Available Nearfield wideband beamformers for microphone arrays have wide applications in multichannel speech enhancement. The nearfield wideband beamformer design based on convex optimization is one of the typical representatives of robust approaches. However, in this approach, the coefficient of convex optimization is a constant, which has not used all the freedom provided by the weighting coefficient efficiently. Therefore, it is still necessary to further improve the performance. To solve this problem, we developed a robust nearfield wideband beamformer design approach based on adaptive-weighted convex optimization. The proposed approach defines an adaptive-weighted function by the adaptive array signal processing theory and adjusts its value flexibly, which has improved the beamforming performance. During each process of the adaptive updating of the weighting function, the convex optimization problem can be formulated as a SOCP (Second-Order Cone Program problem, which could be solved efficiently using the well-established interior-point methods. This method is suitable for the case where the sound source is in the nearfield range, can work well in the presence of microphone mismatches, and is applicable to arbitrary array geometries. Several design examples are presented to verify the effectiveness of the proposed approach and the correctness of the theoretical analysis. 11. Penempatan Optimal Phasor Measurement Unit (PMU dengan Integer Programming Directory of Open Access Journals (Sweden) Yunan Helmy Amrulloh 2013-09-01 Full Text Available Phasor Measurement Unit (PMU merupakan peralatan yang mampu memberikan pengukuran fasor tegangan dan arus secara real-time. PMU dapat digunakan untuk monitoring, proteksi dan kontrol pada sistem tenaga listrik. Tugas akhir ini membahas penempatan PMU secara optimal berdasarkan topologi jaringan sehingga sistem tenaga listrik dapat diobservasi. Penempatan optimal PMU dirumuskan sebagai masalah Binary Integer Programming (BIP yang akan memberikan variabel dengan pilihan nilai (0,1 yang menunjukkan tempat yang harus dipasang PMU. Dalam tugas akhir ini, BIP diterapkan untuk menyelesaikan masalah penempatan PMU secara optimal pada sistem tenaga listrik Jawa-Bali 500 KV yang selanjutnya diterapkan dengan penambahan konsep incomplete observability. Hasil simulasi menunjukkan bahwa penerapan BIP pada sistem dengan incomplete observability memberikan jumlah PMU yang lebih sedikit dibandingkan dengan sistem tanpa konsep incomplete observability. 12. Optimization-Based Approaches to Control of Probabilistic Boolean Networks Directory of Open Access Journals (Sweden) Koichi Kobayashi 2017-02-01 Full Text Available Control of gene regulatory networks is one of the fundamental topics in systems biology. In the last decade, control theory of Boolean networks (BNs, which is well known as a model of gene regulatory networks, has been widely studied. In this review paper, our previously proposed methods on optimal control of probabilistic Boolean networks (PBNs are introduced. First, the outline of PBNs is explained. Next, an optimal control method using polynomial optimization is explained. The finite-time optimal control problem is reduced to a polynomial optimization problem. Furthermore, another finite-time optimal control problem, which can be reduced to an integer programming problem, is also explained. 13. Using Agent Base Models to Optimize Large Scale Network for Large System Inventories Science.gov (United States) Shameldin, Ramez Ahmed; Bowling, Shannon R. 2010-01-01 The aim of this paper is to use Agent Base Models (ABM) to optimize large scale network handling capabilities for large system inventories and to implement strategies for the purpose of reducing capital expenses. The models used in this paper either use computational algorithms or procedure implementations developed by Matlab to simulate agent based models in a principal programming language and mathematical theory using clusters, these clusters work as a high performance computational performance to run the program in parallel computational. In both cases, a model is defined as compilation of a set of structures and processes assumed to underlie the behavior of a network system. 14. Optimization and analysis of decision trees and rules: Dynamic programming approach KAUST Repository Alkhalid, Abdulaziz 2013-08-01 This paper is devoted to the consideration of software system Dagger created in KAUST. This system is based on extensions of dynamic programming. It allows sequential optimization of decision trees and rules relative to different cost functions, derivation of relationships between two cost functions (in particular, between number of misclassifications and depth of decision trees), and between cost and uncertainty of decision trees. We describe features of Dagger and consider examples of this systems work on decision tables from UCI Machine Learning Repository. We also use Dagger to compare 16 different greedy algorithms for decision tree construction. © 2013 Taylor and Francis Group, LLC. 15. Optimization and analysis of decision trees and rules: Dynamic programming approach KAUST Repository Alkhalid, Abdulaziz; Amin, Talha M.; Chikalov, Igor; Hussain, Shahid; Moshkov, Mikhail; Zielosko, Beata 2013-01-01 This paper is devoted to the consideration of software system Dagger created in KAUST. This system is based on extensions of dynamic programming. It allows sequential optimization of decision trees and rules relative to different cost functions, derivation of relationships between two cost functions (in particular, between number of misclassifications and depth of decision trees), and between cost and uncertainty of decision trees. We describe features of Dagger and consider examples of this systems work on decision tables from UCI Machine Learning Repository. We also use Dagger to compare 16 different greedy algorithms for decision tree construction. © 2013 Taylor and Francis Group, LLC. 16. Fire-tube immersion heater optimization program and field heater audit program Energy Technology Data Exchange (ETDEWEB) Croteau, P. [Petro-Canada, Calgary, AB (Canada) 2007-07-01 This presentation provided an overview of the top 5 priorities for emission reduction and eco-efficiency by the Petroleum Technology Alliance of Canada (PTAC). These included venting of methane emissions; fuel consumption in reciprocating engines; fuel consumption in fired heaters; flaring and incineration; and fugitive emissions. It described the common concern for many upstream operating companies as being energy consumption associated with immersion heaters. PTAC fire-tube heater and line heater studies were presented. Combustion efficiency was discussed in terms of excess air, fire-tube selection, heat flux rate, and reliability guidelines. Other topics included heat transfer and fire-tube design; burner selection; burner duty cycle; heater tune up inspection procedure; and insulation. Two other programs were also discussed, notably a Petro-Canada fire-tube immersion heater optimization program and the field audit program run by Natural Resources Canada. It was concluded that improved efficiency involves training; managing excess air in combustion; managing the burner duty cycle; striving for 82 per cent combustion efficiency; and providing adequate insulation to reduce energy demand. tabs., figs. 17. How to Use Linear Programming for Information System Performances Optimization Directory of Open Access Journals (Sweden) Hell Marko 2014-09-01 Full Text Available Background: Organisations nowadays operate in a very dynamic environment, and therefore, their ability of continuously adjusting the strategic plan to the new conditions is a must for achieving their strategic objectives. BSC is a well-known methodology for measuring performances enabling organizations to learn how well they are doing. In this paper, “BSC for IS” will be proposed in order to measure the IS impact on the achievement of organizations’ business goals. Objectives: The objective of this paper is to present the original procedure which is used to enhance the BSC methodology in planning the optimal targets of IS performances value in order to maximize the organization's effectiveness. Methods/Approach: The method used in this paper is the quantitative methodology - linear programming. In the case study, linear programming is used for optimizing organization’s strategic performance. Results: Results are shown on the example of a case study national park. An optimal performance value for the strategic objective has been calculated, as well as an optimal performance value for each DO (derived objective. Results are calculated in Excel, using Solver Add-in. Conclusions: The presentation of methodology through the case study of a national park shows that this methodology, though it requires a high level of formalisation, provides a very transparent performance calculation. 18. Optimizing Implementation of Obesity Prevention Programs: A Qualitative Investigation Within a Large-Scale Randomized Controlled Trial. Science.gov (United States) Kozica, Samantha L; Teede, Helena J; Harrison, Cheryce L; Klein, Ruth; Lombard, Catherine B 2016-01-01 The prevalence of obesity in rural and remote areas is elevated in comparison to urban populations, highlighting the need for interventions targeting obesity prevention in these settings. Implementing evidence-based obesity prevention programs is challenging. This study aimed to investigate factors influencing the implementation of obesity prevention programs, including adoption, program delivery, community uptake, and continuation, specifically within rural settings. Nested within a large-scale randomized controlled trial, a qualitative exploratory approach was adopted, with purposive sampling techniques utilized, to recruit stakeholders from 41 small rural towns in Australia. In-depth semistructured interviews were conducted with clinical health professionals, health service managers, and local government employees. Open coding was completed independently by 2 investigators and thematic analysis undertaken. In-depth interviews revealed that obesity prevention programs were valued by the rural workforce. Program implementation is influenced by interrelated factors across: (1) contextual factors and (2) organizational capacity. Key recommendations to manage the challenges of implementing evidence-based programs focused on reducing program delivery costs, aided by the provision of a suite of implementation and evaluation resources. Informing the scale-up of future prevention programs, stakeholders highlighted the need to build local rural capacity through developing supportive university partnerships, generating local program ownership and promoting active feedback to all program partners. We demonstrate that the rural workforce places a high value on obesity prevention programs. Our results inform the future scale-up of obesity prevention programs, providing an improved understanding of strategies to optimize implementation of evidence-based prevention programs. © 2015 National Rural Health Association. 19. 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. 20. 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. 1. Optimizing diffusion of an online computer tailored lifestyle program: a study protocol Directory of Open Access Journals (Sweden) Schulz Daniela N 2011-06-01 Full Text Available Abstract Background Although the Internet is a promising medium to offer lifestyle interventions to large amounts of people at relatively low costs and effort, actual exposure rates of these interventions fail to meet the high expectations. Since public health impact of interventions is determined by intervention efficacy and level of exposure to the intervention, it is imperative to put effort in optimal dissemination. The present project attempts to optimize the dissemination process of a new online computer tailored generic lifestyle program by carefully studying the adoption process and developing a strategy to achieve sustained use of the program. Methods/Design A prospective study will be conducted to yield relevant information concerning the adoption process by studying the level of adoption of the program, determinants involved in adoption and characteristics of adopters and non-adopters as well as satisfied and unsatisfied users. Furthermore, a randomized control trial will be conducted to the test the effectiveness of a proactive strategy using periodic e-mail prompts in optimizing sustained use of the new program. Discussion Closely mapping the adoption process will gain insight in characteristics of adopters and non-adopters and satisfied and unsatisfied users. This insight can be used to further optimize the program by making it more suitable for a wider range of users, or to develop adjusted interventions to attract subgroups of users that are not reached or satisfied with the initial intervention. Furthermore, by studying the effect of a proactive strategy using period prompts compared to a reactive strategy to stimulate sustained use of the intervention and, possibly, behaviour change, specific recommendations on the use and the application of prompts in online lifestyle interventions can be developed. Trial registration Dutch Trial Register NTR1786 and Medical Ethics Committee of Maastricht University and the University Hospital 2. Pixel-based OPC optimization based on conjugate gradients. Science.gov (United States) Ma, Xu; Arce, Gonzalo R 2011-01-31 Optical proximity correction (OPC) methods are resolution enhancement techniques (RET) used extensively in the semiconductor industry to improve the resolution and pattern fidelity of optical lithography. In pixel-based OPC (PBOPC), the mask is divided into small pixels, each of which is modified during the optimization process. Two critical issues in PBOPC are the required computational complexity of the optimization process, and the manufacturability of the optimized mask. Most current OPC optimization methods apply the steepest descent (SD) algorithm to improve image fidelity augmented by regularization penalties to reduce the complexity of the mask. Although simple to implement, the SD algorithm converges slowly. The existing regularization penalties, however, fall short in meeting the mask rule check (MRC) requirements often used in semiconductor manufacturing. This paper focuses on developing OPC optimization algorithms based on the conjugate gradient (CG) method which exhibits much faster convergence than the SD algorithm. The imaging formation process is represented by the Fourier series expansion model which approximates the partially coherent system as a sum of coherent systems. In order to obtain more desirable manufacturability properties of the mask pattern, a MRC penalty is proposed to enlarge the linear size of the sub-resolution assistant features (SRAFs), as well as the distances between the SRAFs and the main body of the mask. Finally, a projection method is developed to further reduce the complexity of the optimized mask pattern. 3. Development of GPT-based optimization algorithm International Nuclear Information System (INIS) White, J.R.; Chapman, D.M.; Biswas, D. 1985-01-01 The University of Lowell and Westinghouse Electric Corporation are involved in a joint effort to evaluate the potential benefits of generalized/depletion perturbation theory (GPT/DTP) methods for a variety of light water reactor (LWR) physics applications. One part of that work has focused on the development of a GPT-based optimization algorithm for the overall design, analysis, and optimization of LWR reload cores. The use of GPT sensitivity data in formulating the fuel management optimization problem is conceptually straightforward; it is the actual execution of the concept that is challenging. Thus, the purpose of this paper is to address some of the major difficulties, to outline our approach to these problems, and to present some illustrative examples of an efficient GTP-based optimization scheme 4. Research on numerical method for multiple pollution source discharge and optimal reduction program Science.gov (United States) Li, Mingchang; Dai, Mingxin; Zhou, Bin; Zou, Bin 2018-03-01 In this paper, the optimal method for reduction program is proposed by the nonlinear optimal algorithms named that genetic algorithm. The four main rivers in Jiangsu province, China are selected for reducing the environmental pollution in nearshore district. Dissolved inorganic nitrogen (DIN) is studied as the only pollutant. The environmental status and standard in the nearshore district is used to reduce the discharge of multiple river pollutant. The research results of reduction program are the basis of marine environmental management. 5. Optimization of the representativeness and transposition approach, for the neutronic design of experimental programs in critical mock-up International Nuclear Information System (INIS) Dos-Santos, N. 2013-01-01 The work performed during this thesis focused on uncertainty propagation (nuclear data, technological uncertainties, calculation biases,...) on integral parameters, and the development of a novel approach enabling to reduce this uncertainty a priori directly from the design phase of a new experimental program. This approach is based on a multi-parameter multi-criteria extension of representativeness and transposition theories. The first part of this PhD work covers an optimization study of sensitivity and uncertainty calculation schemes to different modeling scales (cell, assembly and whole core) for LWRs and FBRs. A degraded scheme, based on standard and generalized perturbation theories, has been validated for the calculation of uncertainty propagation to various integral quantities of interest. It demonstrated the good a posteriori representativeness of the EPICURE experiment for the validation of mixed UOX-MOX loadings, as the importance of some nuclear data in the power tilt phenomenon in large LWR cores. The second part of this work was devoted to methods and tools development for the optimized design of experimental programs in ZPRs. Those methods are based on multi-parameters representativeness using simultaneously various quantities of interest. Finally, an original study has been conducted on the rigorous estimation of correlations between experimental programs in the transposition process. The coupling of experimental correlations and multi-parametric representativeness approach enables to efficiently design new programs, able to answer additional qualification requirements on calculation tools. (author) [fr 6. Bare-Bones Teaching-Learning-Based Optimization Directory of Open Access Journals (Sweden) Feng Zou 2014-01-01 Full Text Available Teaching-learning-based optimization (TLBO algorithm which simulates the teaching-learning process of the class room is one of the recently proposed swarm intelligent (SI algorithms. In this paper, a new TLBO variant called bare-bones teaching-learning-based optimization (BBTLBO is presented to solve the global optimization problems. In this method, each learner of teacher phase employs an interactive learning strategy, which is the hybridization of the learning strategy of teacher phase in the standard TLBO and Gaussian sampling learning based on neighborhood search, and each learner of learner phase employs the learning strategy of learner phase in the standard TLBO or the new neighborhood search strategy. To verify the performance of our approaches, 20 benchmark functions and two real-world problems are utilized. Conducted experiments can been observed that the BBTLBO performs significantly better than, or at least comparable to, TLBO and some existing bare-bones algorithms. The results indicate that the proposed algorithm is competitive to some other optimization algorithms. 7. Optimal Cropping Pattern Based on Multiple Economic, Regional, and Agricultural Sustainability Criteria in Sari, Iran: Application of a Consolidated Model of AHP and Linear Programming Directory of Open Access Journals (Sweden) E. Fallahi 2016-10-01 Full Text Available Introduction: Determining a suitable cropping pattern is an important task for planners and requires an exact and realistic decision-making process based on several goals and criteria corresponding to secure the interest of agricultural beneficiaries in long-term. Accordingly, this study reviews the current pattern operated by farmers in Sari, Iran, and intends to provide a cropping pattern that considers the multifold regional and agricultural sustainability criteria along with economic considerations. Materials and Methods: In order to achieve the study goals, a consolidated model of AHP and Linear Programming was applied. For this purpose, we constructed a three-level AHP, including a goal (determining the weight of each crop, seven criteria, and seven alternatives. Profitability, compatibility with regional and geographical conditions, water consumption, environmental effects of cropping, job creation opportunities, skill and proficiency required for producing a crop, and risk taken to cultivate a crop were considered as the criteria in the model. Seven alternative crops including rice, wheat, rapeseed, barley, soybean, clover, and vegetables were considered too. The next step is determining the weight of each criterion with regard to the goal and the weight of each alternative with regard to each criteria. By multiplying these weights, final weights for various crops were obtained from the model. Derived weights for each crop were then applied as objective function coefficients in the Linear Programming model and the model was solved subject to the constraints. Results and Discussion: Optimal cropping pattern determined based on the consolidated model of AHP and Linear Programming and the results compared to a scenario that only looks forward to maximizing the economic interests. Due to the low profitability of rapeseed and barley, these crops eliminated from the pattern in the profit-maximizing scenario. According to the results, the 8. Optimal Airport Surface Traffic Planning Using Mixed-Integer Linear Programming Directory of Open Access Journals (Sweden) P. C. Roling 2008-01-01 Full Text Available We describe an ongoing research effort pertaining to the development of a surface traffic automation system that will help controllers to better coordinate surface traffic movements related to arrival and departure traffic. More specifically, we describe the concept for a taxi-planning support tool that aims to optimize the routing and scheduling of airport surface traffic in such a way as to deconflict the taxi plans while optimizing delay, total taxi-time, or some other airport efficiency metric. Certain input parameters related to resource demand, such as the expected landing times and the expected pushback times, are rather difficult to predict accurately. Due to uncertainty in the input data driving the taxi-planning process, the taxi-planning tool is designed such that it produces solutions that are robust to uncertainty. The taxi-planning concept presented herein, which is based on mixed-integer linear programming, is designed such that it is able to adapt to perturbations in these input conditions, as well as to account for failure in the actual execution of surface trajectories. The capabilities of the tool are illustrated in a simple hypothetical airport. 9. Interactive Reliability-Based Optimal Design DEFF Research Database (Denmark) Sørensen, John Dalsgaard; Thoft-Christensen, Palle; Siemaszko, A. 1994-01-01 Interactive design/optimization of large, complex structural systems is considered. The objective function is assumed to model the expected costs. The constraints are reliability-based and/or related to deterministic code requirements. Solution of this optimization problem is divided in four main...... tasks, namely finite element analyses, sensitivity analyses, reliability analyses and application of an optimization algorithm. In the paper it is shown how these four tasks can be linked effectively and how existing information on design variables, Lagrange multipliers and the Hessian matrix can... 10. Design of Underwater Robot Lines Based on a Hybrid Automatic Optimization Strategy Institute of Scientific and Technical Information of China (English) Wenjing Lyu; Weilin Luo 2014-01-01 In this paper, a hybrid automatic optimization strategy is proposed for the design of underwater robot lines. Isight is introduced as an integration platform. The construction of this platform is based on the user programming and several commercial software including UG6.0, GAMBIT2.4.6 and FLUENT12.0. An intelligent parameter optimization method, the particle swarm optimization, is incorporated into the platform. To verify the strategy proposed, a simulation is conducted on the underwater robot model 5470, which originates from the DTRC SUBOFF project. With the automatic optimization platform, the minimal resistance is taken as the optimization goal;the wet surface area as the constraint condition; the length of the fore-body, maximum body radius and after-body’s minimum radius as the design variables. With the CFD calculation, the RANS equations and the standard turbulence model are used for direct numerical simulation. By analyses of the simulation results, it is concluded that the platform is of high efficiency and feasibility. Through the platform, a variety of schemes for the design of the lines are generated and the optimal solution is achieved. The combination of the intelligent optimization algorithm and the numerical simulation ensures a global optimal solution and improves the efficiency of the searching solutions. 11. Cost-optimal power system extension under flow-based market coupling and high shares of photovoltaics Energy Technology Data Exchange (ETDEWEB) Hagspiel, Simeon; Jaegemann, Cosima; Lindenberger, Dietmar [Koeln Univ. (Germany). Inst. of Energy Economics; Cherevatskiy, Stanislav; Troester, Eckehard; Brown, Tom [Energynautics GmbH, Langen (Germany) 2012-07-01 Electricity market models, implemented as dynamic programming problems, have been applied widely to identify possible pathways towards a cost-optimal and low carbon electricity system. However, the joint optimization of generation and transmission remains challenging, mainly due to the fact that different characteristics and rules apply to commercial and physical exchanges of electricity in meshed networks. This paper presents a methodology that allows to optimize power generation and transmission infrastructures jointly through an iterative approach based on power transfer distribution factors (PTDFs). As PTDFs are linear representations of the physical load flow equations, they can be implemented in a linear programming environment suitable for large scale problems such as the European power system. The algorithm iteratively updates PTDFs when grid infrastructures are modified due to cost-optimal extension and thus yields an optimal solution with a consistent representation of physical load flows. The method is demonstrated on a simplified three-node model where it is found to be stable and convergent. It is then scaled to the European level in order to find the optimal power system infrastructure development under the prescription of strongly decreasing CO{sub 2} emissions in Europe until 2050 with a specific focus on photovoltaic (PV) power. (orig.) 12. Optimization of production planning in Czech agricultural co-operative via linear programming Directory of Open Access Journals (Sweden) Jitka Janová 2009-01-01 Full Text Available The production planning is one of the key managerial decisions in agricultural business, which must be done periodically every year. Correct decision must cover the agriculture demands of planting the crops such as crop rotation restrictions or water resource scarcity, while the decision maker aims to plan the crop design in most profitable way in sense of maximizing the total profit from the crop yield. This decision problem represents the optimization of crop design and can be treated by the me­thods of linear programming which begun to be extensively used in agriculture production planning in USA during 50’s. There is ongoing research of mathematical programming applications in agriculture worldwide, but the results are not easily transferable to other localities due to the specific local restrictions in each country. In Czech Republic the farmers use for production planning mainly their expert knowledge and past experience. However, the mathematical programming approach enables find the true optimal solution of the problem, which especially in the problems with a great number of constraints is not easy to find intuitively. One of the possible barriers for using the general decision support systems (which are based on mathematical programming methods for agriculture production planning in Czech Republic is its expensiveness. The small farmer can not afford to buy the expensive software or to employ a mathematical programming specialist. The aim of this paper is to present a user friendly linear programming model of the typical agricultural production planning problem in Czech Republic which can be solved via software tools commonly available in any farm (e.g. EXCEL. The linear programming model covering the restrictions on total costs, crop rotation, thresholds for the total area sowed by particular crops, total amount of manure and the need of feed crops is developed. The model is applied in real-world problem of Czech agriculture 13. SEWER NETWORK DISCHARGE OPTIMIZATION USING THE DYNAMIC PROGRAMMING Directory of Open Access Journals (Sweden) Viorel MINZU 2015-12-01 Full Text Available It is necessary to adopt an optimal control that allows an efficient usage of the existing sewer networks, in order to avoid the building of new retention facilities. The main objective of the control action is to minimize the overflow volume of a sewer network. This paper proposes a method to apply a solution obtained by discrete dynamic programming through a realistic closed loop system. 14. Topics in computational linear optimization DEFF Research Database (Denmark) Hultberg, Tim Helge 2000-01-01 Linear optimization has been an active area of research ever since the pioneering work of G. Dantzig more than 50 years ago. This research has produced a long sequence of practical as well as theoretical improvements of the solution techniques avilable for solving linear optimization problems...... of high quality solvers and the use of algebraic modelling systems to handle the communication between the modeller and the solver. This dissertation features four topics in computational linear optimization: A) automatic reformulation of mixed 0/1 linear programs, B) direct solution of sparse unsymmetric...... systems of linear equations, C) reduction of linear programs and D) integration of algebraic modelling of linear optimization problems in C++. Each of these topics is treated in a separate paper included in this dissertation. The efficiency of solving mixed 0-1 linear programs by linear programming based... 15. Conservative strategy-based ensemble surrogate model for optimal groundwater remediation design at DNAPLs-contaminated sites Science.gov (United States) Ouyang, Qi; Lu, Wenxi; Lin, Jin; Deng, Wenbing; Cheng, Weiguo 2017-08-01 The surrogate-based simulation-optimization techniques are frequently used for optimal groundwater remediation design. When this technique is used, surrogate errors caused by surrogate-modeling uncertainty may lead to generation of infeasible designs. In this paper, a conservative strategy that pushes the optimal design into the feasible region was used to address surrogate-modeling uncertainty. In addition, chance-constrained programming (CCP) was adopted to compare with the conservative strategy in addressing this uncertainty. Three methods, multi-gene genetic programming (MGGP), Kriging (KRG) and support vector regression (SVR), were used to construct surrogate models for a time-consuming multi-phase flow model. To improve the performance of the surrogate model, ensemble surrogates were constructed based on combinations of different stand-alone surrogate models. The results show that: (1) the surrogate-modeling uncertainty was successfully addressed by the conservative strategy, which means that this method is promising for addressing surrogate-modeling uncertainty. (2) The ensemble surrogate model that combines MGGP with KRG showed the most favorable performance, which indicates that this ensemble surrogate can utilize both stand-alone surrogate models to improve the performance of the surrogate model. 16. Improved decomposition–coordination and discrete differential dynamic programming for optimization of large-scale hydropower system International Nuclear Information System (INIS) Li, Chunlong; Zhou, Jianzhong; Ouyang, Shuo; Ding, Xiaoling; Chen, Lu 2014-01-01 Highlights: • Optimization of large-scale hydropower system in the Yangtze River basin. • Improved decomposition–coordination and discrete differential dynamic programming. • Generating initial solution randomly to reduce generation time. • Proposing relative coefficient for more power generation. • Proposing adaptive bias corridor technology to enhance convergence speed. - Abstract: With the construction of major hydro plants, more and more large-scale hydropower systems are taking shape gradually, which brings up a challenge to optimize these systems. Optimization of large-scale hydropower system (OLHS), which is to determine water discharges or water levels of overall hydro plants for maximizing total power generation when subjecting to lots of constrains, is a high dimensional, nonlinear and coupling complex problem. In order to solve the OLHS problem effectively, an improved decomposition–coordination and discrete differential dynamic programming (IDC–DDDP) method is proposed in this paper. A strategy that initial solution is generated randomly is adopted to reduce generation time. Meanwhile, a relative coefficient based on maximum output capacity is proposed for more power generation. Moreover, an adaptive bias corridor technology is proposed to enhance convergence speed. The proposed method is applied to long-term optimal dispatches of large-scale hydropower system (LHS) in the Yangtze River basin. Compared to other methods, IDC–DDDP has competitive performances in not only total power generation but also convergence speed, which provides a new method to solve the OLHS problem 17. Investigating the Optimal Management Strategy for a Healthcare Facility Maintenance Program National Research Council Canada - National Science Library Gaillard, Daria 2004-01-01 ...: strategic partnering with an equipment management firm. The objective of this study is to create a decision-model for selecting the optimal management strategy for a healthcare organization's facility maintenance program... 18. Dynamic programming for optimization of timber production and grazing in ponderosa pine Science.gov (United States) Kurt H. Riitters; J. Douglas Brodie; David W. Hann 1982-01-01 Dynamic programming procedures are presented for optimizing thinning and rotation of even-aged ponderosa pine by using the four descriptors: age, basal area, number of trees, and time since thinning. Because both timber yield and grazing yield are functions of stand density, the two outputs-forage and timber-can both be optimized. The soil expectation values for single... 19. Optimal Diet Planning for Eczema Patient Using Integer Programming Science.gov (United States) Zhen Sheng, Low; Sufahani, Suliadi 2018-04-01 Human diet planning is conducted by choosing appropriate food items that fulfill the nutritional requirements into the diet formulation. This paper discusses the application of integer programming to build the mathematical model of diet planning for eczema patients. The model developed is used to solve the diet problem of eczema patients from young age group. The integer programming is a scientific approach to select suitable food items, which seeks to minimize the costs, under conditions of meeting desired nutrient quantities, avoiding food allergens and getting certain foods into the diet that brings relief to the eczema conditions. This paper illustrates that the integer programming approach able to produce the optimal and feasible solution to deal with the diet problem of eczema patient. 20. Two-dimensional core calculation research for fuel management optimization based on CPACT code International Nuclear Information System (INIS) Chen Xiaosong; Peng Lianghui; Gang Zhi 2013-01-01 Fuel management optimization process requires rapid assessment for the core layout program, and the commonly used methods include two-dimensional diffusion nodal method, perturbation method, neural network method and etc. A two-dimensional loading patterns evaluation code was developed based on the three-dimensional LWR diffusion calculation program CPACT. Axial buckling introduced to simulate the axial leakage was searched in sub-burnup sections to correct the two-dimensional core diffusion calculation results. Meanwhile, in order to get better accuracy, the weight equivalent volume method of the control rod assembly cross-section was improved. (authors) 1. Optimization of maintenance programme at Daya Bay Nuclear Power Station based on RCM analysis results International Nuclear Information System (INIS) Liu Min 2003-01-01 This paper begins with an introduction to Guangdong Daya Bay Nuclear Power Station (GNPS) and gives a simple introduction to the operations and maintenance documentation system at GNPS. It then will review the maintenance program guidelines base and the associated problems prior to the application of reliability centered maintenance (RCM). How RCM was implemented at GNPS, how the results of RCM analysis were used to optimize the maintenance program and test program, and what is the interface between RCM and the existing maintenance program will be shown. Next, it will show the successful implementation of RCM at GNPS resulted in the following changes: A new understanding of equipment failure challenges operations and maintenance beliefs, maintenance concepts undergo a large change, maintenance program and periodic testing program are continuously modified and optimized, new on-condition maintenance technologies are introduced, non-productive scheduled overhauls are discarded, maintenance costs are effectively controlled, maintenance appropriateness has improved, management of hidden failures is more effective and timely. It will show the benefit of greater equipment reliability brought about by all of these changes, which in turn increases the reliability and safety of the entire power station. (author) 2. MATLAB-based program for optimization of quantum cascade laser active region parameters and calculation of output characteristics in magnetic field Science.gov (United States) Smiljanić, J.; Žeželj, M.; Milanović, V.; Radovanović, J.; Stanković, I. 2014-03-01 A strong magnetic field applied along the growth direction of a quantum cascade laser (QCL) active region gives rise to a spectrum of discrete energy states, the Landau levels. By combining quantum engineering of a QCL with a static magnetic field, we can selectively inhibit/enhance non-radiative electron relaxation process between the relevant Landau levels of a triple quantum well and realize a tunable surface emitting device. An efficient numerical algorithm implementation is presented of optimization of GaAs/AlGaAs QCL region parameters and calculation of output properties in the magnetic field. Both theoretical analysis and MATLAB implementation are given for LO-phonon and interface roughness scattering mechanisms on the operation of QCL. At elevated temperatures, electrons in the relevant laser states absorb/emit more LO-phonons which results in reduction of the optical gain. The decrease in the optical gain is moderated by the occurrence of interface roughness scattering, which remains unchanged with increasing temperature. Using the calculated scattering rates as input data, rate equations can be solved and population inversion and the optical gain obtained. Incorporation of the interface roughness scattering mechanism into the model did not create new resonant peaks of the optical gain. However, it resulted in shifting the existing peaks positions and overall reduction of the optical gain. Catalogue identifier: AERL_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AERL_v1_0.html Program obtainable from: CPC Program Library, Queen’s University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 37763 No. of bytes in distributed program, including test data, etc.: 2757956 Distribution format: tar.gz Programming language: MATLAB. Computer: Any capable of running MATLAB version R2010a or higher. Operating system: Any platform 3. portfolio optimization based on nonparametric estimation methods Directory of Open Access Journals (Sweden) mahsa ghandehari 2017-03-01 Full Text Available One of the major issues investors are facing with in capital markets is decision making about select an appropriate stock exchange for investing and selecting an optimal portfolio. This process is done through the risk and expected return assessment. On the other hand in portfolio selection problem if the assets expected returns are normally distributed, variance and standard deviation are used as a risk measure. But, the expected returns on assets are not necessarily normal and sometimes have dramatic differences from normal distribution. This paper with the introduction of conditional value at risk ( CVaR, as a measure of risk in a nonparametric framework, for a given expected return, offers the optimal portfolio and this method is compared with the linear programming method. The data used in this study consists of monthly returns of 15 companies selected from the top 50 companies in Tehran Stock Exchange during the winter of 1392 which is considered from April of 1388 to June of 1393. The results of this study show the superiority of nonparametric method over the linear programming method and the nonparametric method is much faster than the linear programming method. 4. Ckmeans.1d.dp: Optimal k-means Clustering in One Dimension by Dynamic Programming. Science.gov (United States) Wang, Haizhou; Song, Mingzhou 2011-12-01 The heuristic k -means algorithm, widely used for cluster analysis, does not guarantee optimality. We developed a dynamic programming algorithm for optimal one-dimensional clustering. The algorithm is implemented as an R package called Ckmeans.1d.dp . We demonstrate its advantage in optimality and runtime over the standard iterative k -means algorithm. 5. A two-stage stochastic programming model for the optimal design of distributed energy systems International Nuclear Information System (INIS) Zhou, Zhe; Zhang, Jianyun; Liu, Pei; Li, Zheng; Georgiadis, Michael C.; Pistikopoulos, Efstratios N. 2013-01-01 Highlights: ► The optimal design of distributed energy systems under uncertainty is studied. ► A stochastic model is developed using genetic algorithm and Monte Carlo method. ► The proposed system possesses inherent robustness under uncertainty. ► The inherent robustness is due to energy storage facilities and grid connection. -- Abstract: A distributed energy system is a multi-input and multi-output energy system with substantial energy, economic and environmental benefits. The optimal design of such a complex system under energy demand and supply uncertainty poses significant challenges in terms of both modelling and corresponding solution strategies. This paper proposes a two-stage stochastic programming model for the optimal design of distributed energy systems. A two-stage decomposition based solution strategy is used to solve the optimization problem with genetic algorithm performing the search on the first stage variables and a Monte Carlo method dealing with uncertainty in the second stage. The model is applied to the planning of a distributed energy system in a hotel. Detailed computational results are presented and compared with those generated by a deterministic model. The impacts of demand and supply uncertainty on the optimal design of distributed energy systems are systematically investigated using proposed modelling framework and solution approach. 6. CFD-based optimization in plastics extrusion Science.gov (United States) Eusterholz, Sebastian; Elgeti, Stefanie 2018-05-01 This paper presents novel ideas in numerical design of mixing elements in single-screw extruders. The actual design process is reformulated as a shape optimization problem, given some functional, but possibly inefficient initial design. Thereby automatic optimization can be incorporated and the design process is advanced, beyond the simulation-supported, but still experience-based approach. This paper proposes concepts to extend a method which has been developed and validated for die design to the design of mixing-elements. For simplicity, it focuses on single-phase flows only. The developed method conducts forward-simulations to predict the quasi-steady melt behavior in the relevant part of the extruder. The result of each simulation is used in a black-box optimization procedure based on an efficient low-order parameterization of the geometry. To minimize user interaction, an objective function is formulated that quantifies the products' quality based on the forward simulation. This paper covers two aspects: (1) It reviews the set-up of the optimization framework as discussed in [1], and (2) it details the necessary extensions for the optimization of mixing elements in single-screw extruders. It concludes with a presentation of first advances in the unsteady flow simulation of a metering and mixing section with the SSMUM [2] using the Carreau material model. 7. Topology Optimization in Electric Car Body Frame Based on Optistruct Directory of Open Access Journals (Sweden) Ge Dongdong 2017-01-01 Full Text Available In order to optimize the structure of the electric car body frame, the static analysis of the car frame were carried on. For the goal of the frame’s weight minimum, OptiStruct software was used to topology optimization design. And the optimal material distribution program of the frame structure was got. Static strength before and after optimization was comprehensive compared through the stress, deformation. The results showed that the weight of frame after optimization was reduced by 18.96%, and the requirements of the strength and stiffness were ensured. 8. 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... 9. Knowledge based system for control rod programming of BWRs International Nuclear Information System (INIS) Fukuzaki, Takaharu; Yoshida, Ken-ichi; Kobayashi, Yasuhiro 1988-01-01 A knowledge based system has been developed to support designers in control rod programming of BWRs. The programming searches through optimal control rod patterns to realize safe and effective burning of nuclear fuel. Knowledge of experienced designers plays the main role in minimizing the number of calculations by the core performance evaluation code. This code predicts power distibution and thermal margins of the nuclear fuel. This knowledge is transformed into 'if-then' type rules and subroutines, and is stored in a knowledge base of the knowledge based system. The system consists of working area, an inference engine and the knowledge base. The inference engine can detect those data which have to be regenerated, call those subroutine which control the user's interface and numerical computations, and store competitive sets of data in different parts of the working area. Using this system, control rod programming of a BWR plant was traced with about 500 rules and 150 subroutines. Both the generation of control rod patterns for the first calculation of the code and the modification of a control rod pattern to reflect the calculation were completed more effectively than in a conventional method. (author) 10. Reliability Based Optimization of Fire Protection DEFF Research Database (Denmark) Thoft-Christensen, Palle fire protection (PFP) of firewalls and structural members. The paper is partly based on research performed within the EU supported research project B/E-4359 "Optimized Fire Safety of Offshore Structures" and partly on research supported by the Danish Technical Research Council (see Thoft-Christensen [1......]). Special emphasis is put on the optimization software developed within the project.......It is well known that fire is one of the major risks of serious damage or total loss of several types of structures such as nuclear installations, buildings, offshore platforms/topsides etc. This paper presents a methodology and software for reliability based optimization of the layout of passive... 11. A dynamic regrouping based sequential dynamic programming algorithm for unit commitment of combined heat and power systems DEFF Research Database (Denmark) Rong, Aiying; Hakonen, Henri; Lahdelma, Risto 2009-01-01 efficiency of the plants. We introduce in this paper the DRDP-RSC algorithm, which is a dynamic regrouping based dynamic programming (DP) algorithm based on linear relaxation of the ON/OFF states of the units, sequential commitment of units in small groups. Relaxed states of the plants are used to reduce...... the dimension of the UC problem and dynamic regrouping is used to improve the solution quality. Numerical results based on real-life data sets show that this algorithm is efficient and optimal or near-optimal solutions with very small optimality gap are obtained.... 12. Optimal traffic control in highway transportation networks using linear programming KAUST Repository Li, Yanning; Canepa, Edward S.; Claudel, Christian G. 2014-01-01 of the Hamilton-Jacobi PDE, the problem of controlling the state of the system on a network link in a finite horizon can be posed as a Linear Program. Assuming all intersections in the network are controllable, we show that the optimization approach can 13. A Quantitative Optimization Framework for Market-Driven Academic Program Portfolios NARCIS (Netherlands) Burgher, Joshua; Hamers, Herbert 2017-01-01 We introduce a quantitative model that can be used for decision support for planning and optimizing the composition of portfolios of market-driven academic programs within the context of higher education. This model is intended to enable leaders in colleges and universities to maximize financial 14. Exergetic optimization of shell and tube heat exchangers using a genetic based algorithm Energy Technology Data Exchange (ETDEWEB) Oezcelik, Yavuz [Ege University, Bornova, Izmir (Turkey). Engineering Faculty, Chemical Engineering Department 2007-08-15 In the computer-based optimization, many thousands of alternative shell and tube heat exchangers may be examined by varying the high number of exchanger parameters such as tube length, tube outer diameter, pitch size, layout angle, baffle space ratio, number of tube side passes. In the present study, a genetic based algorithm was developed, programmed, and applied to estimate the optimum values of discrete and continuous variables of the MINLP (mixed integer nonlinear programming) test problems. The results of the test problems show that the genetic based algorithm programmed can estimate the acceptable values of continuous variables and optimum values of integer variables. Finally the genetic based algorithm was extended to make parametric studies and to find optimum configuration of heat exchangers by minimizing the sum of the annual capital cost and exergetic cost of the shell and tube heat exchangers. The results of the example problems show that the proposed algorithm is applicable to find optimum and near optimum alternatives of the shell and tube heat exchanger configurations. (author) 15. Optimal design of RTCs in digital circuit fault self-repair based on global signal optimization Institute of Scientific and Technical Information of China (English) Zhang Junbin; Cai Jinyan; Meng Yafeng 2016-01-01 Since digital circuits have been widely and thoroughly applied in various fields, electronic systems are increasingly more complicated and require greater reliability. Faults may occur in elec-tronic systems in complicated environments. If immediate field repairs are not made on the faults, elec-tronic systems will not run normally, and this will lead to serious losses. The traditional method for improving system reliability based on redundant fault-tolerant technique has been unable to meet the requirements. Therefore, on the basis of (evolvable hardware)-based and (reparation balance technology)-based electronic circuit fault self-repair strategy proposed in our preliminary work, the optimal design of rectification circuits (RTCs) in electronic circuit fault self-repair based on global sig-nal optimization is deeply researched in this paper. First of all, the basic theory of RTC optimal design based on global signal optimization is proposed. Secondly, relevant considerations and suitable ranges are analyzed. Then, the basic flow of RTC optimal design is researched. Eventually, a typical circuit is selected for simulation verification, and detailed simulated analysis is made on five circumstances that occur during RTC evolution. The simulation results prove that compared with the conventional design method based RTC, the global signal optimization design method based RTC is lower in hardware cost, faster in circuit evolution, higher in convergent precision, and higher in circuit evolution success rate. Therefore, the global signal optimization based RTC optimal design method applied in the elec-tronic circuit fault self-repair technology is proven to be feasible, effective, and advantageous. 16. Applied Research of Enterprise Cost Control Based on Linear Programming Directory of Open Access Journals (Sweden) Yu Shuo 2015-01-01 This paper researches the enterprise cost control through the linear programming model, and analyzes the restriction factors of the labor of enterprise production, raw materials, processing equipment, sales price, and other factors affecting the enterprise income, so as to obtain an enterprise cost control model based on the linear programming. This model can calculate rational production mode in the case of limited resources, and acquire optimal enterprise income. The production guiding program and scheduling arrangement of the enterprise can be obtained through calculation results, so as to provide scientific and effective guidance for the enterprise production. This paper adds the sensitivity analysis in the linear programming model, so as to learn about the stability of the enterprise cost control model based on linear programming through the sensitivity analysis, and verify the rationality of the model, and indicate the direction for the enterprise cost control. The calculation results of the model can provide a certain reference for the enterprise planning in the market economy environment, which have strong reference and practical significance in terms of the enterprise cost control. 17. Regulation of Dynamical Systems to Optimal Solutions of Semidefinite Programs: Algorithms and Applications to AC Optimal Power Flow Energy Technology Data Exchange (ETDEWEB) Dall' Anese, Emiliano; Dhople, Sairaj V.; Giannakis, Georgios B. 2015-07-01 This paper considers a collection of networked nonlinear dynamical systems, and addresses the synthesis of feedback controllers that seek optimal operating points corresponding to the solution of pertinent network-wide optimization problems. Particular emphasis is placed on the solution of semidefinite programs (SDPs). The design of the feedback controller is grounded on a dual e-subgradient approach, with the dual iterates utilized to dynamically update the dynamical-system reference signals. Global convergence is guaranteed for diminishing stepsize rules, even when the reference inputs are updated at a faster rate than the dynamical-system settling time. The application of the proposed framework to the control of power-electronic inverters in AC distribution systems is discussed. The objective is to bridge the time-scale separation between real-time inverter control and network-wide optimization. Optimization objectives assume the form of SDP relaxations of prototypical AC optimal power flow problems. 18. A Novel Consensus-Based Particle Swarm Optimization-Assisted Trust-Tech Methodology for Large-Scale Global Optimization. Science.gov (United States) Zhang, Yong-Feng; Chiang, Hsiao-Dong 2017-09-01 A novel three-stage methodology, termed the "consensus-based particle swarm optimization (PSO)-assisted Trust-Tech methodology," to find global optimal solutions for nonlinear optimization problems is presented. It is composed of Trust-Tech methods, consensus-based PSO, and local optimization methods that are integrated to compute a set of high-quality local optimal solutions that can contain the global optimal solution. The proposed methodology compares very favorably with several recently developed PSO algorithms based on a set of small-dimension benchmark optimization problems and 20 large-dimension test functions from the CEC 2010 competition. The analytical basis for the proposed methodology is also provided. Experimental results demonstrate that the proposed methodology can rapidly obtain high-quality optimal solutions that can contain the global optimal solution. The scalability of the proposed methodology is promising. 19. C-program LINOP for the evaluation of film dosemeters by linear optimization. User manual International Nuclear Information System (INIS) Kragh, P. 1995-11-01 Linear programming results in an optimal measuring value for film dosemeters. The Linop program was developed to be used for linear programming. The program permits the evaluation and control of film dosemeters and of all other multi-component dosemeters. This user manual for the Linop program contains the source program, a description of the program and installation and use instructions. The data sets with programs and examples are available upon request. (orig.) [de 20. Particle swarm optimization for programming deep brain stimulation arrays. Science.gov (United States) Peña, Edgar; Zhang, Simeng; Deyo, Steve; Xiao, YiZi; Johnson, Matthew D 2017-02-01 Deep brain stimulation (DBS) therapy relies on both precise neurosurgical targeting and systematic optimization of stimulation settings to achieve beneficial clinical outcomes. One recent advance to improve targeting is the development of DBS arrays (DBSAs) with electrodes segmented both along and around the DBS lead. However, increasing the number of independent electrodes creates the logistical challenge of optimizing stimulation parameters efficiently. Solving such complex problems with multiple solutions and objectives is well known to occur in biology, in which complex collective behaviors emerge out of swarms of individual organisms engaged in learning through social interactions. Here, we developed a particle swarm optimization (PSO) algorithm to program DBSAs using a swarm of individual particles representing electrode configurations and stimulation amplitudes. Using a finite element model of motor thalamic DBS, we demonstrate how the PSO algorithm can efficiently optimize a multi-objective function that maximizes predictions of axonal activation in regions of interest (ROI, cerebellar-receiving area of motor thalamus), minimizes predictions of axonal activation in regions of avoidance (ROA, somatosensory thalamus), and minimizes power consumption. The algorithm solved the multi-objective problem by producing a Pareto front. ROI and ROA activation predictions were consistent across swarms (<1% median discrepancy in axon activation). The algorithm was able to accommodate for (1) lead displacement (1 mm) with relatively small ROI (⩽9.2%) and ROA (⩽1%) activation changes, irrespective of shift direction; (2) reduction in maximum per-electrode current (by 50% and 80%) with ROI activation decreasing by 5.6% and 16%, respectively; and (3) disabling electrodes (n = 3 and 12) with ROI activation reduction by 1.8% and 14%, respectively. Additionally, comparison between PSO predictions and multi-compartment axon model simulations showed discrepancies 1. Particle Swarm Optimization for Programming Deep Brain Stimulation Arrays Science.gov (United States) Peña, Edgar; Zhang, Simeng; Deyo, Steve; Xiao, YiZi; Johnson, Matthew D. 2017-01-01 Objective Deep brain stimulation (DBS) therapy relies on both precise neurosurgical targeting and systematic optimization of stimulation settings to achieve beneficial clinical outcomes. One recent advance to improve targeting is the development of DBS arrays (DBSAs) with electrodes segmented both along and around the DBS lead. However, increasing the number of independent electrodes creates the logistical challenge of optimizing stimulation parameters efficiently. Approach Solving such complex problems with multiple solutions and objectives is well known to occur in biology, in which complex collective behaviors emerge out of swarms of individual organisms engaged in learning through social interactions. Here, we developed a particle swarm optimization (PSO) algorithm to program DBSAs using a swarm of individual particles representing electrode configurations and stimulation amplitudes. Using a finite element model of motor thalamic DBS, we demonstrate how the PSO algorithm can efficiently optimize a multi-objective function that maximizes predictions of axonal activation in regions of interest (ROI, cerebellar-receiving area of motor thalamus), minimizes predictions of axonal activation in regions of avoidance (ROA, somatosensory thalamus), and minimizes power consumption. Main Results The algorithm solved the multi-objective problem by producing a Pareto front. ROI and ROA activation predictions were consistent across swarms (<1% median discrepancy in axon activation). The algorithm was able to accommodate for (1) lead displacement (1 mm) with relatively small ROI (≤9.2%) and ROA (≤1%) activation changes, irrespective of shift direction; (2) reduction in maximum per-electrode current (by 50% and 80%) with ROI activation decreasing by 5.6% and 16%, respectively; and (3) disabling electrodes (n=3 and 12) with ROI activation reduction by 1.8% and 14%, respectively. Additionally, comparison between PSO predictions and multi-compartment axon model simulations 2. An overview of the Douglas Aircraft Company Aeroelastic Design Optimization Program (ADOP) Science.gov (United States) Dodd, Alan J. 1989-01-01 From a program manager's viewpoint, the history, scope and architecture of a major structural design program at Douglas Aircraft Company called Aeroelastic Design Optimization Program (ADOP) are described. ADOP was originally intended for the rapid, accurate, cost-effective evaluation of relatively small structural models at the advanced design level, resulting in improved proposal competitiveness and avoiding many costly changes later in the design cycle. Before release of the initial version in November 1987, however, the program was expanded to handle very large production-type analyses. 3. OPTIMIZING ANTIMICROBIAL PHARMACODYNAMICS: A GUIDE FOR YOUR STEWARDSHIP PROGRAM Directory of Open Access Journals (Sweden) Joseph L. Kuti, PharmD 2016-09-01 Full Text Available Pharmacodynamic concepts should be applied to optimize antibiotic dosing regimens, particularly in the face of some multidrug resistant bacterial infections. Although the pharmacodynamics of most antibiotic classes used in the hospital setting are well described, guidance on how to select regimens and implement them into an antimicrobial stewardship program in one's institution are more limited. The role of the antibiotic MIC is paramount in understanding which regimens might benefit from implementation as a protocol or use in individual patients. This review article outlines the pharmacodynamics of aminoglycosides, beta-lactams, fluoroquinolones, tigecycline, vancomycin, and polymyxins with the goal of providing a basis for strategy to select an optimized antibiotic regimen in your hospital setting. 4. Optimal stochastic energy management of retailer based on selling price determination under smart grid environment in the presence of demand response program International Nuclear Information System (INIS) Nojavan, Sayyad; Zare, Kazem; Mohammadi-Ivatloo, Behnam 2017-01-01 Highlights: • Stochastic energy management of retailer under smart grid environment is proposed. • Optimal selling price is determined in the smart grid environment. • Fixed, time-of-use and real-time pricing are determined for selling to customers. • Charge/discharge of ESS is determined to increase the expected profit of retailer. • Demand response program is proposed to increase the expected profit of retailer. - Abstract: In this paper, bilateral contracting and selling price determination problems for an electricity retailer in the smart grid environment under uncertainties have been considered. Multiple energy procurement sources containing pool market (PM), bilateral contracts (BCs), distributed generation (DG) units, renewable energy sources (photovoltaic (PV) system and wind turbine (WT)) and energy storage system (ESS) as well as demand response program (DRP) as virtual generation unit are considered. The scenario-based stochastic framework is used for uncertainty modeling of pool market prices, client group demand and variable climate condition containing temperature, irradiation and wind speed. In the proposed model, the selling price is determined and compared by the retailer in the smart grid in three cases containing fixed pricing, time-of-use (TOU) pricing and real-time pricing (RTP). It is shown that the selling price determination based on RTP by the retailer leads to higher expected profit. Furthermore, demand response program (DRP) has been implemented to flatten the load profile to minimize the cost for end-user customers as well as increasing the retailer profit. To validate the proposed model, three case studies are used and the results are compared. 5. Dose optimization based on linear programming implemented in a system for treatment planning in Monte Carlo; Optimizacion de dosis basada en programacion lineal implemenetada en un un sistema para la planificacion de tratamiento en Monte Carlo Energy Technology Data Exchange (ETDEWEB) Ureba, A.; Palma, B. A.; Leal, A. 2011-07-01 Develop a more efficient method of optimization in relation to time, based on linear programming designed to implement a multi objective penalty function which also permits a simultaneous solution integrated boost situations considering two white volumes simultaneously. 6. Expected value based fuzzy programming approach to solve integrated supplier selection and inventory control problem with fuzzy demand Science.gov (United States) Sutrisno; Widowati; Sunarsih; Kartono 2018-01-01 In this paper, a mathematical model in quadratic programming with fuzzy parameter is proposed to determine the optimal strategy for integrated inventory control and supplier selection problem with fuzzy demand. To solve the corresponding optimization problem, we use the expected value based fuzzy programming. Numerical examples are performed to evaluate the model. From the results, the optimal amount of each product that have to be purchased from each supplier for each time period and the optimal amount of each product that have to be stored in the inventory for each time period were determined with minimum total cost and the inventory level was sufficiently closed to the reference level. 7. Factors influencing law enforcement decisions to adopt an evidence-based robbery prevention program. Science.gov (United States) Cabell, A; Casteel, C; Chronister, T; Nocera, M; Vladutiu, C J; Peek-Asa, C 2013-12-01 Homicide is the leading cause of workplace death among small retail and service businesses in the United States. Evidence-based programs have been shown to reduce robbery and robbery-related crimes in small retail businesses; however, reaching small businesses with programs has been difficult. As small businesses typically have no corporate backing or trade affiliation, police departments have been identified as potential vehicles for program dissemination. A national sample of 300 law enforcement agencies was surveyed to identify facilitators and barriers to adoption and sustainability of an evidence-based program. The questionnaire was developed using behavioral theory concepts and administered via telephone. Preliminary findings suggest the primary facilitators to program adoption included organizational capacity factors such as staff buy-in, dedicated personnel and financial support. Competing responsibilities was the primary barrier identified by agencies. Agency size and program complexity were identified as potential predictors of program adoption. Identifying agency and program-specific characteristics that influence program adoption by law enforcement agencies will be valuable for marketing programs to agencies that have the infrastructure to support and sustain program dissemination. Understanding these factors will optimize the reach of evidence-based strategies to small businesses. 8. Optimization design of wind turbine drive train based on Matlab genetic algorithm toolbox Science.gov (United States) Li, R. N.; Liu, X.; Liu, S. J. 2013-12-01 In order to ensure the high efficiency of the whole flexible drive train of the front-end speed adjusting wind turbine, the working principle of the main part of the drive train is analyzed. As critical parameters, rotating speed ratios of three planetary gear trains are selected as the research subject. The mathematical model of the torque converter speed ratio is established based on these three critical variable quantity, and the effect of key parameters on the efficiency of hydraulic mechanical transmission is analyzed. Based on the torque balance and the energy balance, refer to hydraulic mechanical transmission characteristics, the transmission efficiency expression of the whole drive train is established. The fitness function and constraint functions are established respectively based on the drive train transmission efficiency and the torque converter rotating speed ratio range. And the optimization calculation is carried out by using MATLAB genetic algorithm toolbox. The optimization method and results provide an optimization program for exact match of wind turbine rotor, gearbox, hydraulic mechanical transmission, hydraulic torque converter and synchronous generator, ensure that the drive train work with a high efficiency, and give a reference for the selection of the torque converter and hydraulic mechanical transmission. 9. Optimization design of wind turbine drive train based on Matlab genetic algorithm toolbox International Nuclear Information System (INIS) Li, R N; Liu, X; Liu, S J 2013-01-01 In order to ensure the high efficiency of the whole flexible drive train of the front-end speed adjusting wind turbine, the working principle of the main part of the drive train is analyzed. As critical parameters, rotating speed ratios of three planetary gear trains are selected as the research subject. The mathematical model of the torque converter speed ratio is established based on these three critical variable quantity, and the effect of key parameters on the efficiency of hydraulic mechanical transmission is analyzed. Based on the torque balance and the energy balance, refer to hydraulic mechanical transmission characteristics, the transmission efficiency expression of the whole drive train is established. The fitness function and constraint functions are established respectively based on the drive train transmission efficiency and the torque converter rotating speed ratio range. And the optimization calculation is carried out by using MATLAB genetic algorithm toolbox. The optimization method and results provide an optimization program for exact match of wind turbine rotor, gearbox, hydraulic mechanical transmission, hydraulic torque converter and synchronous generator, ensure that the drive train work with a high efficiency, and give a reference for the selection of the torque converter and hydraulic mechanical transmission 10. Reliability Based Optimization of Structural Systems DEFF Research Database (Denmark) Sørensen, John Dalsgaard 1987-01-01 The optimization problem to design structural systems such that the reliability is satisfactory during the whole lifetime of the structure is considered in this paper. Some of the quantities modelling the loads and the strength of the structure are modelled as random variables. The reliability...... is estimated using first. order reliability methods ( FORM ). The design problem is formulated as the optimization problem to minimize a given cost function such that the reliability of the single elements satisfies given requirements or such that the systems reliability satisfies a given requirement....... For these optimization problems it is described how a sensitivity analysis can be performed. Next, new optimization procedures to solve the optimization problems are presented. Two of these procedures solve the system reliability based optimization problem sequentially using quasi-analytical derivatives. Finally... 11. Study on Web-Based Tool for Regional Agriculture Industry Structure Optimization Using Ajax Science.gov (United States) Huang, Xiaodong; Zhu, Yeping According to the research status of regional agriculture industry structure adjustment information system and the current development of information technology, this paper takes web-based regional agriculture industry structure optimization tool as research target. This paper introduces Ajax technology and related application frameworks to build an auxiliary toolkit of decision support system for agricultural policy maker and economy researcher. The toolkit includes a “one page” style component of regional agriculture industry structure optimization which provides agile arguments setting method that enables applying sensitivity analysis and usage of data and comparative advantage analysis result, and a component that can solve the linear programming model and its dual problem by simplex method. 12. Optimization of fuel cells for BWR based in Tabu modified search International Nuclear Information System (INIS) Martin del Campo M, C.; Francois L, J.L.; Palomera P, M.A. 2004-01-01 The advances in the development of a computational system for the design and optimization of cells for assemble of fuel of Boiling Water Reactors (BWR) are presented. The method of optimization is based on the technique of Tabu Search (Tabu Search, TS) implemented in progressive stages designed to accelerate the search and to reduce the time used in the process of optimization. It was programed an algorithm to create the first solution. Also for to diversify the generation of random numbers, required by the technical TS, it was used the Makoto Matsumoto function obtaining excellent results. The objective function has been coded in such a way that can adapt to optimize different parameters like they can be the enrichment average or the peak factor of radial power. The neutronic evaluation of the cells is carried out in a fine way by means of the HELIOS simulator. In the work the main characteristics of the system are described and an application example is presented to the design of a cell of 10x10 bars of fuel with 10 different enrichment compositions and gadolinium content. (Author) 13. Application of linear programming and perturbation theory in optimization of fuel utilization in a nuclear reactor International Nuclear Information System (INIS) Zavaljevski, N. 1985-01-01 Proposed optimization procedure is fast due to application of linear programming. Non-linear constraints which demand iterative application of linear programming are slowing down the calculation. Linearization can be done by different procedures starting from simple empirical rules for fuel in-core management to complicated general perturbation theory with higher order of corrections. A mathematical model was formulated for optimization of improved fuel cycle. A detailed algorithm for determining minimum of fresh fuel at the beginning of each fuel cycle is shown and the problem is linearized by first order perturbation theory and it is optimized by linear programming. Numerical illustration of the proposed method was done for the experimental reactor mostly for saving computer time 14. Integrated Reliability-Based Optimal Design of Structures DEFF Research Database (Denmark) Sørensen, John Dalsgaard; Thoft-Christensen, Palle 1987-01-01 In conventional optimal design of structural systems the weight or the initial cost of the structure is usually used as objective function. Further, the constraints require that the stresses and/or strains at some critical points have to be less than some given values. Finally, all variables......-based optimal design is discussed. Next, an optimal inspection and repair strategy for existing structural systems is presented. An optimization problem is formulated , where the objective is to minimize the expected total future cost of inspection and repair subject to the constraint that the reliability...... value. The reliability can be measured from an element and/or a systems point of view. A number of methods to solve reliability-based optimization problems has been suggested, see e.g. Frangopol [I]. Murotsu et al. (2], Thoft-Christensen & Sørensen (3] and Sørensen (4). For structures where... 15. Three example applications of optimization techniques to Department of Energy contractor radiation protection programs International Nuclear Information System (INIS) Merwin, S.E.; Martin, J.B.; Tawil, J.J.; Selby, J.M. 1986-06-01 Six numerical examples of optimization of radiation protection are provided in the appendices of International Commission on Radiological Protection (ICRP) Publication 37 (ICRP83). In each case, the calculations are based on fairly well-defined parameters and assumptions that were well understood. In this paper, we have examined three different numerical examples that are based on empirical data and less certain assumptions. These examples are intended to represent typical applications of optimization principles to the evaluation of specific elements of a radiation protection program. In the first example, the optimum bioassay frequency for certain tritium workers was found to be once every 95 days, which compared well with the recommendations of ICRP Publication 10 (ICRP67). The second example showed that the optimum frequency for recalibrating a group of ''Cutie-Pie'' (CP)-type ionization chamber survey instruments was once every 102 days. In the third example, one continuous air monitor (CAM) was determined to be the optimum number in a workplace of a Department of Energy (DOE) plutonium facility. The optimum location of the CAM was determined from past glovebox release studies 16. A novel linear programming approach to fluence map optimization for intensity modulated radiation therapy treatment planning International Nuclear Information System (INIS) Romeijn, H Edwin; Ahuja, Ravindra K; Dempsey, James F; Kumar, Arvind; Li, Jonathan G 2003-01-01 We present a novel linear programming (LP) based approach for efficiently solving the intensity modulated radiation therapy (IMRT) fluence-map optimization (FMO) problem to global optimality. Our model overcomes the apparent limitations of a linear-programming approach by approximating any convex objective function by a piecewise linear convex function. This approach allows us to retain the flexibility offered by general convex objective functions, while allowing us to formulate the FMO problem as a LP problem. In addition, a novel type of partial-volume constraint that bounds the tail averages of the differential dose-volume histograms of structures is imposed while retaining linearity as an alternative approach to improve dose homogeneity in the target volumes, and to attempt to spare as many critical structures as possible. The goal of this work is to develop a very rapid global optimization approach that finds high quality dose distributions. Implementation of this model has demonstrated excellent results. We found globally optimal solutions for eight 7-beam head-and-neck cases in less than 3 min of computational time on a single processor personal computer without the use of partial-volume constraints. Adding such constraints increased the running times by a factor of 2-3, but improved the sparing of critical structures. All cases demonstrated excellent target coverage (>95%), target homogeneity (<10% overdosing and <7% underdosing) and organ sparing using at least one of the two models 17. An Improved Real-Coded Population-Based Extremal Optimization Method for Continuous Unconstrained Optimization Problems Directory of Open Access Journals (Sweden) Guo-Qiang Zeng 2014-01-01 Full Text Available As a novel evolutionary optimization method, extremal optimization (EO has been successfully applied to a variety of combinatorial optimization problems. However, the applications of EO in continuous optimization problems are relatively rare. This paper proposes an improved real-coded population-based EO method (IRPEO for continuous unconstrained optimization problems. The key operations of IRPEO include generation of real-coded random initial population, evaluation of individual and population fitness, selection of bad elements according to power-law probability distribution, generation of new population based on uniform random mutation, and updating the population by accepting the new population unconditionally. The experimental results on 10 benchmark test functions with the dimension N=30 have shown that IRPEO is competitive or even better than the recently reported various genetic algorithm (GA versions with different mutation operations in terms of simplicity, effectiveness, and efficiency. Furthermore, the superiority of IRPEO to other evolutionary algorithms such as original population-based EO, particle swarm optimization (PSO, and the hybrid PSO-EO is also demonstrated by the experimental results on some benchmark functions. 18. Deterministic global optimization algorithm based on outer approximation for the parameter estimation of nonlinear dynamic biological systems. Science.gov (United States) Miró, Anton; Pozo, Carlos; Guillén-Gosálbez, Gonzalo; Egea, Jose A; Jiménez, Laureano 2012-05-10 The estimation of parameter values for mathematical models of biological systems is an optimization problem that is particularly challenging due to the nonlinearities involved. One major difficulty is the existence of multiple minima in which standard optimization methods may fall during the search. Deterministic global optimization methods overcome this limitation, ensuring convergence to the global optimum within a desired tolerance. Global optimization techniques are usually classified into stochastic and deterministic. The former typically lead to lower CPU times but offer no guarantee of convergence to the global minimum in a finite number of iterations. In contrast, deterministic methods provide solutions of a given quality (i.e., optimality gap), but tend to lead to large computational burdens. This work presents a deterministic outer approximation-based algorithm for the global optimization of dynamic problems arising in the parameter estimation of models of biological systems. Our approach, which offers a theoretical guarantee of convergence to global minimum, is based on reformulating the set of ordinary differential equations into an equivalent set of algebraic equations through the use of orthogonal collocation methods, giving rise to a nonconvex nonlinear programming (NLP) problem. This nonconvex NLP is decomposed into two hierarchical levels: a master mixed-integer linear programming problem (MILP) that provides a rigorous lower bound on the optimal solution, and a reduced-space slave NLP that yields an upper bound. The algorithm iterates between these two levels until a termination criterion is satisfied. The capabilities of our approach were tested in two benchmark problems, in which the performance of our algorithm was compared with that of the commercial global optimization package BARON. The proposed strategy produced near optimal solutions (i.e., within a desired tolerance) in a fraction of the CPU time required by BARON. 19. Optimal perturbations for nonlinear systems using graph-based optimal transport Science.gov (United States) Grover, Piyush; Elamvazhuthi, Karthik 2018-06-01 We formulate and solve a class of finite-time transport and mixing problems in the set-oriented framework. The aim is to obtain optimal discrete-time perturbations in nonlinear dynamical systems to transport a specified initial measure on the phase space to a final measure in finite time. The measure is propagated under system dynamics in between the perturbations via the associated transfer operator. Each perturbation is described by a deterministic map in the measure space that implements a version of Monge-Kantorovich optimal transport with quadratic cost. Hence, the optimal solution minimizes a sum of quadratic costs on phase space transport due to the perturbations applied at specified times. The action of the transport map is approximated by a continuous pseudo-time flow on a graph, resulting in a tractable convex optimization problem. This problem is solved via state-of-the-art solvers to global optimality. We apply this algorithm to a problem of transport between measures supported on two disjoint almost-invariant sets in a chaotic fluid system, and to a finite-time optimal mixing problem by choosing the final measure to be uniform. In both cases, the optimal perturbations are found to exploit the phase space structures, such as lobe dynamics, leading to efficient global transport. As the time-horizon of the problem is increased, the optimal perturbations become increasingly localized. Hence, by combining the transfer operator approach with ideas from the theory of optimal mass transportation, we obtain a discrete-time graph-based algorithm for optimal transport and mixing in nonlinear systems. 20. The Optimal Wavelengths for Light Absorption Spectroscopy Measurements Based on Genetic Algorithm-Particle Swarm Optimization Science.gov (United States) Tang, Ge; Wei, Biao; Wu, Decao; Feng, Peng; Liu, Juan; Tang, Yuan; Xiong, Shuangfei; Zhang, Zheng 2018-03-01 To select the optimal wavelengths in the light extinction spectroscopy measurement, genetic algorithm-particle swarm optimization (GAPSO) based on genetic algorithm (GA) and particle swarm optimization (PSO) is adopted. The change of the optimal wavelength positions in different feature size parameters and distribution parameters is evaluated. Moreover, the Monte Carlo method based on random probability is used to identify the number of optimal wavelengths, and good inversion effects of the particle size distribution are obtained. The method proved to have the advantage of resisting noise. In order to verify the feasibility of the algorithm, spectra with bands ranging from 200 to 1000 nm are computed. Based on this, the measured data of standard particles are used to verify the algorithm. 1. Optimal transport of particle beams International Nuclear Information System (INIS) Allen, C.K.; Reiser, M. 1997-01-01 The transport and matching problem for a low energy transport system is approached from a control theoretical viewpoint. We develop a model for a beam transport and matching section based on a multistage control network. To this model we apply the principles of optimal control to formulate techniques aiding in the design of the transport and matching section. Both nonlinear programming and dynamic programming techniques are used in the optimization. These techniques are implemented in a computer-aided design program called SPOT. Examples are presented to demonstrate the procedure and outline the results. (orig.) 2. Modeling and Optimal Control of a Class of Warfare Hybrid Dynamic Systems Based on Lanchester (n,1 Attrition Model Directory of Open Access Journals (Sweden) Xiangyong Chen 2014-01-01 hybrid dynamic systems is established based on Lanchester equation in a (n,1 battle, where a heterogeneous force of n different troop types faces a homogeneous force. This model can be characterized by the interaction of continuous-time models (governed by Lanchester equation, and discrete event systems (described by variable tactics. Furthermore, an expository discussion is presented on an optimal variable tactics control problem for warfare hybrid dynamic system. The optimal control strategies are designed based on dynamic programming and differential game theory. As an example of the consequences of this optimal control problem, we take the (2, 1 case and solve the optimal strategies in a (2, 1 case. Simulation results show the feasibility of warfare hybrid system model and the effectiveness of the optimal control strategies designed. 3. 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... 4. Optimization of in-vivo monitoring program for radiation emergency response Energy Technology Data Exchange (ETDEWEB) Ha, Wi Ho; Kim, Jong Kyung [Dept. of Nuclear Engineering, Hanyang University, Seoul (Korea, Republic of) 2016-12-15 In case of radiation emergencies, internal exposure monitoring for the members of public will be required to confirm internal contamination of each individual. In-vivo monitoring technique using portable gamma spectrometer can be easily applied for internal exposure monitoring in the vicinity of the on-site area. In this study, minimum detectable doses (MDDs) for '1'3'4Cs, {sup 137}Cs, and {sup 131}I were calculated adjusting minimum detectable activities (MDAs) from 50 to 1,000 Bq to find out the optimal in-vivo counting condition. DCAL software was used to derive retention fraction of Cs and I isotopes in the whole body and thyroid, respectively. A minimum detectable level was determined to set committed effective dose of 0.1 mSv for emergency response. We found that MDDs at each MDA increased along with the elapsed time. 1,000 Bq for {sup 134}Cs and {sup 137}Cs, and 100 Bq for {sup 131}I were suggested as optimal MDAs to provide in-vivo monitoring service in case of radiation emergencies. In-vivo monitoring program for emergency response should be designed to achieve the optimal MDA suggested from the present work. We expect that a reduction of counting time compared with routine monitoring program can achieve the high throughput system in case of radiation emergencies. 5. ANN-GA based optimization of a high ash coal-fired supercritical power plant International Nuclear Information System (INIS) Suresh, M.V.J.J.; Reddy, K.S.; Kolar, Ajit Kumar 2011-01-01 Highlights: → Neuro-genetic power plant optimization is found to be an efficient methodology. → Advantage of neuro-genetic algorithm is the possibility of on-line optimization. → Exergy loss in combustor indicates the effect of coal composition on efficiency. -- Abstract: The efficiency of coal-fired power plant depends on various operating parameters such as main steam/reheat steam pressures and temperatures, turbine extraction pressures, and excess air ratio for a given fuel. However, simultaneous optimization of all these operating parameters to achieve the maximum plant efficiency is a challenging task. This study deals with the coupled ANN and GA based (neuro-genetic) optimization of a high ash coal-fired supercritical power plant in Indian climatic condition to determine the maximum possible plant efficiency. The power plant simulation data obtained from a flow-sheet program, 'Cycle-Tempo' is used to train the artificial neural network (ANN) to predict the energy input through fuel (coal). The optimum set of various operating parameters that result in the minimum energy input to the power plant is then determined by coupling the trained ANN model as a fitness function with the genetic algorithm (GA). A unit size of 800 MWe currently under development in India is considered to carry out the thermodynamic analysis based on energy and exergy. Apart from optimizing the design parameters, the developed model can also be used for on-line optimization when quick response is required. Furthermore, the effect of various coals on the thermodynamic performance of the optimized power plant is also determined. 6. Optimization-Based Selection of Influential Agents in a Rural Afghan Social Network Science.gov (United States) 2010-06-01 nonlethal targeting model, a nonlinear programming ( NLP ) optimization formulation that identifies the k US agent assignment strategy producing the greatest...leader social network, and 3) the nonlethal targeting model, a nonlinear programming ( NLP ) optimization formulation that identifies the k US agent...NATO Coalition in Afghanistan. 55 for Afghanistan ( [54], [31], [48], [55], [30]). While Arab tribes tend to be more hierarchical, Pashtun tribes are 7. Seca Coal-Based Systems Program International Nuclear Information System (INIS) Alinger, Matthew 2008-01-01 This report summarizes the progress made during the August 1, 2006 - May 31, 2008 award period under Cooperative Agreement DE-FC26-05NT42614 for the U. S. Department of Energy/National Energy Technology Laboratory (USDOE/NETL) entitled 'SECA Coal Based Systems'. The initial overall objective of this program was to design, develop, and demonstrate multi-MW integrated gasification fuel cell (IGFC) power plants with >50% overall efficiency from coal (HHV) to AC power. The focus of the program was to develop low-cost, high performance, modular solid oxide fuel cell (SOFC) technology to support coal gas IGFC power systems. After a detailed GE internal review of the SOFC technology, the program was de-scoped at GE's request. The primary objective of this program was then focused on developing a performance degradation mitigation path for high performing, cost-effective solid oxide fuel cells (SOFCs). There were two initial major objectives in this program. These were: (1) Develop and optimize a design of a >100 MWe integrated gasification fuel cell (IGFC) power plant; (2) Resolve identified barrier issues concerning the long-term economic performance of SOFC. The program focused on designing and cost estimating the IGFC system and resolving technical and economic barrier issues relating to SOFC. In doing so, manufacturing options for SOFC cells were evaluated, options for constructing stacks based upon various cell configurations identified, and key performance characteristics were identified. Key factors affecting SOFC performance degradation for cells in contact with metallic interconnects were be studied and a fundamental understanding of associated mechanisms was developed using a fixed materials set. Experiments and modeling were carried out to identify key processes/steps affecting cell performance degradation under SOFC operating conditions. Interfacial microstructural and elemental changes were characterized, and their relationships to observed degradation 8. Optimal policy for value-based decision-making. Science.gov (United States) Tajima, Satohiro; Drugowitsch, Jan; Pouget, Alexandre 2016-08-18 For decades now, normative theories of perceptual decisions, and their implementation as drift diffusion models, have driven and significantly improved our understanding of human and animal behaviour and the underlying neural processes. While similar processes seem to govern value-based decisions, we still lack the theoretical understanding of why this ought to be the case. Here, we show that, similar to perceptual decisions, drift diffusion models implement the optimal strategy for value-based decisions. Such optimal decisions require the models' decision boundaries to collapse over time, and to depend on the a priori knowledge about reward contingencies. Diffusion models only implement the optimal strategy under specific task assumptions, and cease to be optimal once we start relaxing these assumptions, by, for example, using non-linear utility functions. Our findings thus provide the much-needed theory for value-based decisions, explain the apparent similarity to perceptual decisions, and predict conditions under which this similarity should break down. 9. Applications of sub-optimality in dynamic programming to location and construction of nuclear fuel processing plant International Nuclear Information System (INIS) Thiriet, L.; Deledicq, A. 1968-09-01 First, the point of applying Dynamic Programming to optimization and Operational Research problems in chemical industries are recalled, as well as the conditions in which a dynamic program is illustrated by a sequential graph. A new algorithm for the determination of sub-optimal politics in a sequential graph is then developed. Finally, the applications of sub-optimality concept is shown when taking into account the indirect effects related to possible strategies, or in the case of stochastic choices and of problems of the siting of plants... application examples are given. (authors) [fr 10. Conditions for characterizing the structure of optimal strategies in infinite-horizon dynamic programs International Nuclear Information System (INIS) Porteus, E. 1982-01-01 The study of infinite-horizon nonstationary dynamic programs using the operator approach is continued. The point of view here differs slightly from that taken by others, in that Denardo's local income function is not used as a starting point. Infinite-horizon values are defined as limits of finite-horizon values, as the horizons get long. Two important conditions of an earlier paper are weakened, yet the optimality equations, the optimality criterion, and the existence of optimal ''structured'' strategies are still obtained 11. JuPOETs: a constrained multiobjective optimization approach to estimate biochemical model ensembles in the Julia programming language. Science.gov (United States) Bassen, David M; Vilkhovoy, Michael; Minot, Mason; Butcher, Jonathan T; Varner, Jeffrey D 2017-01-25 Ensemble modeling is a promising approach for obtaining robust predictions and coarse grained population behavior in deterministic mathematical models. Ensemble approaches address model uncertainty by using parameter or model families instead of single best-fit parameters or fixed model structures. Parameter ensembles can be selected based upon simulation error, along with other criteria such as diversity or steady-state performance. Simulations using parameter ensembles can estimate confidence intervals on model variables, and robustly constrain model predictions, despite having many poorly constrained parameters. In this software note, we present a multiobjective based technique to estimate parameter or models ensembles, the Pareto Optimal Ensemble Technique in the Julia programming language (JuPOETs). JuPOETs integrates simulated annealing with Pareto optimality to estimate ensembles on or near the optimal tradeoff surface between competing training objectives. We demonstrate JuPOETs on a suite of multiobjective problems, including test functions with parameter bounds and system constraints as well as for the identification of a proof-of-concept biochemical model with four conflicting training objectives. JuPOETs identified optimal or near optimal solutions approximately six-fold faster than a corresponding implementation in Octave for the suite of test functions. For the proof-of-concept biochemical model, JuPOETs produced an ensemble of parameters that gave both the mean of the training data for conflicting data sets, while simultaneously estimating parameter sets that performed well on each of the individual objective functions. JuPOETs is a promising approach for the estimation of parameter and model ensembles using multiobjective optimization. JuPOETs can be adapted to solve many problem types, including mixed binary and continuous variable types, bilevel optimization problems and constrained problems without altering the base algorithm. JuPOETs is open 12. GPU-Monte Carlo based fast IMRT plan optimization Directory of Open Access Journals (Sweden) Yongbao Li 2014-03-01 Full Text Available Purpose: Intensity-modulated radiation treatment (IMRT plan optimization needs pre-calculated beamlet dose distribution. Pencil-beam or superposition/convolution type algorithms are typically used because of high computation speed. However, inaccurate beamlet dose distributions, particularly in cases with high levels of inhomogeneity, may mislead optimization, hindering the resulting plan quality. It is desire to use Monte Carlo (MC methods for beamlet dose calculations. Yet, the long computational time from repeated dose calculations for a number of beamlets prevents this application. It is our objective to integrate a GPU-based MC dose engine in lung IMRT optimization using a novel two-steps workflow.Methods: A GPU-based MC code gDPM is used. Each particle is tagged with an index of a beamlet where the source particle is from. Deposit dose are stored separately for beamlets based on the index. Due to limited GPU memory size, a pyramid space is allocated for each beamlet, and dose outside the space is neglected. A two-steps optimization workflow is proposed for fast MC-based optimization. At first step, a rough dose calculation is conducted with only a few number of particle per beamlet. Plan optimization is followed to get an approximated fluence map. In the second step, more accurate beamlet doses are calculated, where sampled number of particles for a beamlet is proportional to the intensity determined previously. A second-round optimization is conducted, yielding the final result.Results: For a lung case with 5317 beamlets, 105 particles per beamlet in the first round, and 108 particles per beam in the second round are enough to get a good plan quality. The total simulation time is 96.4 sec.Conclusion: A fast GPU-based MC dose calculation method along with a novel two-step optimization workflow are developed. The high efficiency allows the use of MC for IMRT optimizations.--------------------------------Cite this article as: Li Y, Tian Z 13. Model-based dynamic control and optimization of gas networks Energy Technology Data Exchange (ETDEWEB) Hofsten, Kai 2001-07-01 by a structured sequential quadratic programming algorithm of Newton type. Each open loop problem is specified using a nonlinear prediction model. For each iteration of the quadratic programming procedure, a linear time variant prediction model is formulated. The suggested controller also handles time varying source capacity. Potential problems such as infeasibility and the security of the supply when facing a change in the status of the infrastructure of the transmission system under a transient customer load are treated. Comments on the infeasibility due to errors such as load forecast error, model error and state estimation error are also discussed. A simplified nonlinear model called the creep flow model is used to describe the fluid dynamics inside a natural gas transmission line. Different assumptions and reformulations of this model yield the different control, simulation and optimization models used in this thesis. The control of a single gas transmission line is investigated using linear model predictive control based on instant linearization of the nonlinear model. Model predictive control using a bi quadratic optimization model formulated from the creep flow model is also investigated. A distributed parameter control model of the gas dynamics for a transmission line is formulated. An analytic solution of this model is given with both Neuman boundary conditions and distributed supplies and loads. A transfer function model is developed expressing the dynamics between the defined output and the control and disturbance inputs of the transmission line. Based on the qualitative behaviour observed from the step responses of the solutions of the distributed parameter model formulated in this thesis, simplified transfer function models were developed. These control models expresses the dynamics of a natural gas transmission line with Neuman boundary control and load. Further, these models were used to design a control law, which is a combination of a Smith 14. Location based Network Optimizations for Mobile Wireless Networks DEFF Research Database (Denmark) Nielsen, Jimmy Jessen selection in Wi-Fi networks and predictive handover optimization in heterogeneous wireless networks. The investigations in this work have indicated that location based network optimizations are beneficial compared to typical link measurement based approaches. Especially the knowledge of geographical... 15. EUD-based biological optimization for carbon ion therapy International Nuclear Information System (INIS) Brüningk, Sarah C.; Kamp, Florian; Wilkens, Jan J. 2015-01-01 Purpose: Treatment planning for carbon ion therapy requires an accurate modeling of the biological response of each tissue to estimate the clinical outcome of a treatment. The relative biological effectiveness (RBE) accounts for this biological response on a cellular level but does not refer to the actual impact on the organ as a whole. For photon therapy, the concept of equivalent uniform dose (EUD) represents a simple model to take the organ response into account, yet so far no formulation of EUD has been reported that is suitable to carbon ion therapy. The authors introduce the concept of an equivalent uniform effect (EUE) that is directly applicable to both ion and photon therapies and exemplarily implemented it as a basis for biological treatment plan optimization for carbon ion therapy. Methods: In addition to a classical EUD concept, which calculates a generalized mean over the RBE-weighted dose distribution, the authors propose the EUE to simplify the optimization process of carbon ion therapy plans. The EUE is defined as the biologically equivalent uniform effect that yields the same probability of injury as the inhomogeneous effect distribution in an organ. Its mathematical formulation is based on the generalized mean effect using an effect-volume parameter to account for different organ architectures and is thus independent of a reference radiation. For both EUD concepts, quadratic and logistic objective functions are implemented into a research treatment planning system. A flexible implementation allows choosing for each structure between biological effect constraints per voxel and EUD constraints per structure. Exemplary treatment plans are calculated for a head-and-neck patient for multiple combinations of objective functions and optimization parameters. Results: Treatment plans optimized using an EUE-based objective function were comparable to those optimized with an RBE-weighted EUD-based approach. In agreement with previous results from photon 16. Optimal Input Design for Aircraft Parameter Estimation using Dynamic Programming Principles Science.gov (United States) Morelli, Eugene A.; Klein, Vladislav 1990-01-01 A new technique was developed for designing optimal flight test inputs for aircraft parameter estimation experiments. The principles of dynamic programming were used for the design in the time domain. This approach made it possible to include realistic practical constraints on the input and output variables. A description of the new approach is presented, followed by an example for a multiple input linear model describing the lateral dynamics of a fighter aircraft. The optimal input designs produced by the new technique demonstrated improved quality and expanded capability relative to the conventional multiple input design method. 17. An Efficacious Multi-Objective Fuzzy Linear Programming Approach for Optimal Power Flow Considering Distributed Generation. Science.gov (United States) Warid, Warid; Hizam, Hashim; Mariun, Norman; Abdul-Wahab, Noor Izzri 2016-01-01 This paper proposes a new formulation for the multi-objective optimal power flow (MOOPF) problem for meshed power networks considering distributed generation. An efficacious multi-objective fuzzy linear programming optimization (MFLP) algorithm is proposed to solve the aforementioned problem with and without considering the distributed generation (DG) effect. A variant combination of objectives is considered for simultaneous optimization, including power loss, voltage stability, and shunt capacitors MVAR reserve. Fuzzy membership functions for these objectives are designed with extreme targets, whereas the inequality constraints are treated as hard constraints. The multi-objective fuzzy optimal power flow (OPF) formulation was converted into a crisp OPF in a successive linear programming (SLP) framework and solved using an efficient interior point method (IPM). To test the efficacy of the proposed approach, simulations are performed on the IEEE 30-busand IEEE 118-bus test systems. The MFLP optimization is solved for several optimization cases. The obtained results are compared with those presented in the literature. A unique solution with a high satisfaction for the assigned targets is gained. Results demonstrate the effectiveness of the proposed MFLP technique in terms of solution optimality and rapid convergence. Moreover, the results indicate that using the optimal DG location with the MFLP algorithm provides the solution with the highest quality. 18. Biogeography-Based Optimization with Orthogonal Crossover Directory of Open Access Journals (Sweden) Quanxi Feng 2013-01-01 Full Text Available Biogeography-based optimization (BBO is a new biogeography inspired, population-based algorithm, which mainly uses migration operator to share information among solutions. Similar to crossover operator in genetic algorithm, migration operator is a probabilistic operator and only generates the vertex of a hyperrectangle defined by the emigration and immigration vectors. Therefore, the exploration ability of BBO may be limited. Orthogonal crossover operator with quantization technique (QOX is based on orthogonal design and can generate representative solution in solution space. In this paper, a BBO variant is presented through embedding the QOX operator in BBO algorithm. Additionally, a modified migration equation is used to improve the population diversity. Several experiments are conducted on 23 benchmark functions. Experimental results show that the proposed algorithm is capable of locating the optimal or closed-to-optimal solution. Comparisons with other variants of BBO algorithms and state-of-the-art orthogonal-based evolutionary algorithms demonstrate that our proposed algorithm possesses faster global convergence rate, high-precision solution, and stronger robustness. Finally, the analysis result of the performance of QOX indicates that QOX plays a key role in the proposed algorithm. 19. Stan: A Probabilistic Programming Language for Bayesian Inference and Optimization Science.gov (United States) Gelman, Andrew; Lee, Daniel; Guo, Jiqiang 2015-01-01 Stan is a free and open-source C++ program that performs Bayesian inference or optimization for arbitrary user-specified models and can be called from the command line, R, Python, Matlab, or Julia and has great promise for fitting large and complex statistical models in many areas of application. We discuss Stan from users' and developers'… 20. Steepest descent method implementation on unconstrained optimization problem using C++ program Science.gov (United States) Napitupulu, H.; Sukono; Mohd, I. Bin; Hidayat, Y.; Supian, S. 2018-03-01 Steepest Descent is known as the simplest gradient method. Recently, many researches are done to obtain the appropriate step size in order to reduce the objective function value progressively. In this paper, the properties of steepest descent method from literatures are reviewed together with advantages and disadvantages of each step size procedure. The development of steepest descent method due to its step size procedure is discussed. In order to test the performance of each step size, we run a steepest descent procedure in C++ program. We implemented it to unconstrained optimization test problem with two variables, then we compare the numerical results of each step size procedure. Based on the numerical experiment, we conclude the general computational features and weaknesses of each procedure in each case of problem. 1. A program optimization system for the cleanup of DOE hazardous waste sites an application to FY 1990 funding decisions International Nuclear Information System (INIS) Merkhofer, M.W.; Jenni, K.E.; Cotton, T.A.; Lehr, J.C.; Longo, T.P. 1989-01-01 This paper describes a formal system used by the Department of Energy (DOE) as an aid for allocating funds for cleaning up hazardous waste sites. The system, called the Program Optimization System (POS), is based on multiattribute utility analysis and was developed for DOE's Hazardous Waste and Remedial Actions Division (HWRAD). HWRAD has responsibility for recommending environmental restoration (ER) activities to the Assistant Secretary of Energy. Recently, the POS was used to analyze and recommend funding levels for FY 1990 cleanup activities at DOE defense program facilities 2. Cost-benefit study of consumer product take-back programs using IBM's WIT reverse logistics optimization tool Science.gov (United States) Veerakamolmal, Pitipong; Lee, Yung-Joon; Fasano, J. P.; Hale, Rhea; Jacques, Mary 2002-02-01 In recent years, there has been increased focus by regulators, manufacturers, and consumers on the issue of product end of life management for electronics. This paper presents an overview of a conceptual study designed to examine the costs and benefits of several different Product Take Back (PTB) scenarios for used electronics equipment. The study utilized a reverse logistics supply chain model to examine the effects of several different factors in PTB programs. The model was done using the IBM supply chain optimization tool known as WIT (Watson Implosion Technology). Using the WIT tool, we were able to determine a theoretical optimal cost scenario for PTB programs. The study was designed to assist IBM internally in determining theoretical optimal Product Take Back program models and determining potential incentives for increasing participation rates. 3. 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. 4. A first formal link between the price equation and an optimization program. Science.gov (United States) Grafen, Alan 2002-07-07 The Darwin unification project is pursued. A meta-model encompassing an important class of population genetic models is formed by adding an abstract model of the number of successful gametes to the Price equation under uncertainty. A class of optimization programs are defined to represent the "individual-as-maximizing-agent analogy" in a general way. It is then shown that for each population genetic model there is a corresponding optimization program with which formal links can be established. These links provide a secure logical foundation for the commonplace biological principle that natural selection leads organisms to act as if maximizing their "fitness", provides a definition of "fitness", and clarifies the limitations of that principle. The situations covered do not include frequency dependence or social behaviour, but the approach is capable of extension. 5. A Game Theoretical Approach Based Bidding Strategy Optimization for Power Producers in Power Markets with Renewable Electricity Directory of Open Access Journals (Sweden) Yi Tang 2017-05-01 Full Text Available In a competitive electricity market with substantial involvement of renewable electricity, maximizing profits by optimizing bidding strategies is crucial to different power producers including conventional power plants and renewable ones. This paper proposes a game-theoretic bidding optimization method based on bi-level programming, where power producers are at the upper level and utility companies are at the lower level. The competition among the multiple power producers is formulated as a non-cooperative game in which bidding curves are their strategies, while uniform clearing pricing is considered for utility companies represented by an independent system operator. Consequently, based on the formulated game model, the bidding strategies for power producers are optimized for the day-ahead market and the intraday market with considering the properties of renewable energy; and the clearing pricing for the utility companies, with respect to the power quantity from different power producers, is optimized simultaneously. Furthermore, a distributed algorithm is provided to search the solution of the generalized Nash equilibrium. Finally, simulation results were performed and discussed to verify the feasibility and effectiveness of the proposed non-cooperative game-based bi-level optimization approach. 6. A synthesis/design optimization algorithm for Rankine cycle based energy systems International Nuclear Information System (INIS) Toffolo, Andrea 2014-01-01 The algorithm presented in this work has been developed to search for the optimal topology and design parameters of a set of Rankine cycles forming an energy system that absorbs/releases heat at different temperature levels and converts part of the absorbed heat into electricity. This algorithm can deal with several applications in the field of energy engineering: e.g., steam cycles or bottoming cycles in combined/cogenerative plants, steam networks, low temperature organic Rankine cycles. The main purpose of this algorithm is to overcome the limitations of the search space introduced by the traditional mixed-integer programming techniques, which assume that possible solutions are derived from a single superstructure embedding them all. The algorithm presented in this work is a hybrid evolutionary/traditional optimization algorithm organized in two levels. A complex original codification of the topology and the intensive design parameters of the system is managed by the upper level evolutionary algorithm according to the criteria set by the HEATSEP method, which are used for the first time to automatically synthesize a “basic” system configuration from a set of elementary thermodynamic cycles. The lower SQP (sequential quadratic programming) algorithm optimizes the objective function(s) with respect to cycle mass flow rates only, taking into account the heat transfer feasibility constraint within the undefined heat transfer section. A challenging example of application is also presented to show the capabilities of the algorithm. - Highlights: • Energy systems based on Rankine cycles are used in many applications. • A hybrid algorithm is proposed to optimize the synthesis/design of such systems. • The topology of the candidate solutions is not limited by a superstructure. • Topology is managed by the genetic operators of the upper level algorithm. • The effectiveness of the algorithm is proved in a complex test case 7. Segment-based dose optimization using a genetic algorithm International Nuclear Information System (INIS) Cotrutz, Cristian; Xing Lei 2003-01-01 Intensity modulated radiation therapy (IMRT) inverse planning is conventionally done in two steps. Firstly, the intensity maps of the treatment beams are optimized using a dose optimization algorithm. Each of them is then decomposed into a number of segments using a leaf-sequencing algorithm for delivery. An alternative approach is to pre-assign a fixed number of field apertures and optimize directly the shapes and weights of the apertures. While the latter approach has the advantage of eliminating the leaf-sequencing step, the optimization of aperture shapes is less straightforward than that of beamlet-based optimization because of the complex dependence of the dose on the field shapes, and their weights. In this work we report a genetic algorithm for segment-based optimization. Different from a gradient iterative approach or simulated annealing, the algorithm finds the optimum solution from a population of candidate plans. In this technique, each solution is encoded using three chromosomes: one for the position of the left-bank leaves of each segment, the second for the position of the right-bank and the third for the weights of the segments defined by the first two chromosomes. The convergence towards the optimum is realized by crossover and mutation operators that ensure proper exchange of information between the three chromosomes of all the solutions in the population. The algorithm is applied to a phantom and a prostate case and the results are compared with those obtained using beamlet-based optimization. The main conclusion drawn from this study is that the genetic optimization of segment shapes and weights can produce highly conformal dose distribution. In addition, our study also confirms previous findings that fewer segments are generally needed to generate plans that are comparable with the plans obtained using beamlet-based optimization. Thus the technique may have useful applications in facilitating IMRT treatment planning 8. Optimizing Human Diet Problem Based on Price and Taste Using Directory of Open Access Journals (Sweden) Hossein EGHBALI 2012-07-01 Full Text Available Low price and good taste of foods are regarded as two major factors for optimal human nutrition. Due to price fluctuations and taste diversity, these two factors cannot be certainly and determinately evaluated. This problem must be viewed from another perspective because of the uncertainty about the amount of nutrients per unit of foods and also diversity of people’s daily needs to receive them.This paper discusses human diet problem in fuzzy environment. The approach deals with multi-objective fuzzy linear programming problem using a fuzzy programming technique for its solution. By prescribing a diet merely based on crisp data, some ofthe realities are neglected. For the same reason, we dealt with human diet problem through fuzzy approach. Results indicated uncertainty about factors of nutrition diet -including taste and price, amount of nutrients and their intake- would affect diet quality, making the proposed diet more realistic. 9. Enhanced index tracking modeling in portfolio optimization with mixed-integer programming z approach Science.gov (United States) Siew, Lam Weng; Jaaman, Saiful Hafizah Hj.; Ismail, Hamizun bin 2014-09-01 Enhanced index tracking is a popular form of portfolio management in stock market investment. Enhanced index tracking aims to construct an optimal portfolio to generate excess return over the return achieved by the stock market index without purchasing all of the stocks that make up the index. The objective of this paper is to construct an optimal portfolio using mixed-integer programming model which adopts regression approach in order to generate higher portfolio mean return than stock market index return. In this study, the data consists of 24 component stocks in Malaysia market index which is FTSE Bursa Malaysia Kuala Lumpur Composite Index from January 2010 until December 2012. The results of this study show that the optimal portfolio of mixed-integer programming model is able to generate higher mean return than FTSE Bursa Malaysia Kuala Lumpur Composite Index return with only selecting 30% out of the total stock market index components. 10. Optimal economic dispatch of FC-CHP based heat and power micro-grids International Nuclear Information System (INIS) Nazari-Heris, Morteza; Abapour, Saeed; Mohammadi-Ivatloo, Behnam 2017-01-01 Highlights: • The multi objective economic/environmental heat and power MG dispatch is solved. • The heat and power MG include FC, CHP, boiler, storage system, and heat buffer tank. • Multi objective scheduling of heat and power MG is solved using ε-constraint method. • DR program is employed in the stochastic programming of heat and power MG dispatch. • The uncertainties for load demand and price signals are taken into account. - Abstract: Micro-grids (MGs) are introduced as a solution for distributed energy resource (DER) units and energy storage systems (ESSs) to participate in providing the required electricity demand of controllable and non-controllable loads. In this paper, the authors study the short-term scheduling of grid-connected industrial heat and power MG which contains a fuel cell (FC) unit, combined heat and power (CHP) generation units, power-only unit, boiler, battery storage system, and heat buffer tank. The paper is aimed to solve the multi-objective MG dispatch problem containing cost and emission minimization with the considerations of demand response program and uncertainties. A probabilistic framework based on a scenario method, which is considered for load demand and price signals, is employed to overcome the uncertainties in the optimal energy management of the MG. In order to reduce operational cost, time-of-use rates of demand response programs have been modeled, and the effects of such programs on the load profile have been discussed. To solve the multi-objective optimization problem, the ε-constraint method is used and a fuzzy satisfying approach has been employed to select the best compromise solution. Three cases are studied in this research to confirm the performance of the proposed method: islanded mode, grid-connected mode, and the impact of time of the use-demand response program on MG scheduling. 11. Optimization of biodiesel supply chains based on small farmers: A case study in Brazil Energy Technology Data Exchange (ETDEWEB) Leao, Raphael; Hamacher, Silvio 2010-09-15 The strategy adopted by the Brazilian Biodiesel Program is to base its fuel production on oilseeds acquired from small, family-owned farms in the poorest regions of the country, thereby fostering social inclusion and transfer of income. The success of the program depends on the development of a robust supply chain logistic structure, appropriate distribution of crop production, and investments in new oilseed crushing units. This article presents the development of a mathematical model for optimizing the production arrangements for the supply of a biodiesel plant sourced from family farms, taking into account agricultural, logistic, industrial and social aspects. 12. A GIS-based integrative approach for land use optimization in a semi-arid watershed Directory of Open Access Journals (Sweden) S.M. Tajbakhsh 2018-01-01 Full Text Available The proper use of natural resources can preserve these valuable assets. In line with the management of natural resources, land use optimization can be highly useful. The aim of the present study is to propose an appropriate integrative model for optimized allocation of lands for surface runoff and sediment load minimization and net income maximization in Bayg watershed, Iran. In this study, five categories of land uses, i.e. irrigated orchard, rangeland, irrigated farming, rainfed farming and almond orchard were spatially optimized to minimize surface runoff and sediment yield and to increase net income by integrating three approaches: weighted goal programming, analytic hierarchy process and multi-objective land allocation algorithm. To achieve the target levels in this work, the acreages of almond orchard and rainfed farming should be reduced by 100% and 37.32% respectively, and irrigated farming acreage should be increased by 138.53%. Through these alterations in the land use acreage, the sediment load will be reduced by 16.78% and net income will be improved by 72.52%. However, runoff volume will be increased by 0.22%. Results indicated that weighted goal programming satisfied 96% and 46% of the target levels of sediment load and net income respectively, but failed to reduce runoff volume. Therefore, it is necessary for managers to control runoff using the strategies related to runoff harvesting, especially on steep slopes. Generally, it can be concluded that a combination of the techniques weighted goal programming, analytic hierarchy process and multi-objective land allocation is highly capable to optimize land use and land covers based on the conflicting objectives. 13. Practical method for generation expansion planning based on the dynamic programming. Dynamic programming ni motozuku dengen keikaku shuho Energy Technology Data Exchange (ETDEWEB) Tanabe, R.; Yasuda, K.; Yokoyama, R. (Tokyo Metropolitan Univ., Tokyo (Japan)) 1992-05-20 To supply cheap, high-reliable and a planty of the electricity is an important task of the electric supply system because the requirement for the electricity is rapidly increased in Japan. In order to solve this problem, the authors of the paper are developing a most suitable practical method based on algorithm, according to which the generation expansion planning is divided into two problems: the optimal generation mix and the optimal generation construction process and the two problems are solved respectively. But there are some bad points in the method, for example, there are only approximative practical restriction of the capacity of single machine and the existing electric supply etc., because the optimal generation mix is determined on the basis of non-linear planning. So, in the present paper, the electric supply support system is practically constructed while proposing an unified generation expansion planning based on the dynamic programming that is possible to consider these restrictions strictly and the usefullness of the method is inspected. 12 refs., 7 figs., 5 tabs. 14. Optimality Conditions in Vector Optimization CERN Document Server Jiménez, Manuel Arana; Lizana, Antonio Rufián 2011-01-01 Vector optimization is continuously needed in several science fields, particularly in economy, business, engineering, physics and mathematics. The evolution of these fields depends, in part, on the improvements in vector optimization in mathematical programming. The aim of this Ebook is to present the latest developments in vector optimization. The contributions have been written by some of the most eminent researchers in this field of mathematical programming. The Ebook is considered essential for researchers and students in this field. 15. Possibility/Necessity-Based Probabilistic Expectation Models for Linear Programming Problems with Discrete Fuzzy Random Variables Directory of Open Access Journals (Sweden) Hideki Katagiri 2017-10-01 Full Text Available This paper considers linear programming problems (LPPs where the objective functions involve discrete fuzzy random variables (fuzzy set-valued discrete random variables. New decision making models, which are useful in fuzzy stochastic environments, are proposed based on both possibility theory and probability theory. In multi-objective cases, Pareto optimal solutions of the proposed models are newly defined. Computational algorithms for obtaining the Pareto optimal solutions of the proposed models are provided. It is shown that problems involving discrete fuzzy random variables can be transformed into deterministic nonlinear mathematical programming problems which can be solved through a conventional mathematical programming solver under practically reasonable assumptions. A numerical example of agriculture production problems is given to demonstrate the applicability of the proposed models to real-world problems in fuzzy stochastic environments. 16. Trajectory Optimization Based on Multi-Interval Mesh Refinement Method Directory of Open Access Journals (Sweden) Ningbo Li 2017-01-01 Full Text Available In order to improve the optimization accuracy and convergence rate for trajectory optimization of the air-to-air missile, a multi-interval mesh refinement Radau pseudospectral method was introduced. This method made the mesh endpoints converge to the practical nonsmooth points and decreased the overall collocation points to improve convergence rate and computational efficiency. The trajectory was divided into four phases according to the working time of engine and handover of midcourse and terminal guidance, and then the optimization model was built. The multi-interval mesh refinement Radau pseudospectral method with different collocation points in each mesh interval was used to solve the trajectory optimization model. Moreover, this method was compared with traditional h method. Simulation results show that this method can decrease the dimensionality of nonlinear programming (NLP problem and therefore improve the efficiency of pseudospectral methods for solving trajectory optimization problems. 17. Outcome based state budget allocation for diabetes prevention programs using multi-criteria optimization with robust weights. Science.gov (United States) Mehrotra, Sanjay; Kim, Kibaek 2011-12-01 We consider the problem of outcomes based budget allocations to chronic disease prevention programs across the United States (US) to achieve greater geographical healthcare equity. We use Diabetes Prevention and Control Programs (DPCP) by the Center for Disease Control and Prevention (CDC) as an example. We present a multi-criteria robust weighted sum model for such multi-criteria decision making in a group decision setting. The principal component analysis and an inverse linear programming techniques are presented and used to study the actual 2009 budget allocation by CDC. Our results show that the CDC budget allocation process for the DPCPs is not likely model based. In our empirical study, the relative weights for different prevalence and comorbidity factors and the corresponding budgets obtained under different weight regions are discussed. Parametric analysis suggests that money should be allocated to states to promote diabetes education and to increase patient-healthcare provider interactions to reduce disparity across the US. 18. Optimal design of the heat pipe using TLBO (teaching–learning-based optimization) algorithm International Nuclear Information System (INIS) Rao, R.V.; More, K.C. 2015-01-01 Heat pipe is a highly efficient and reliable heat transfer component. It is a closed container designed to transfer a large amount of heat in system. Since the heat pipe operates on a closed two-phase cycle, the heat transfer capacity is greater than for solid conductors. Also, the thermal response time is less than with solid conductors. The three major elemental parts of the rotating heat pipe are: a cylindrical evaporator, a truncated cone condenser, and a fixed amount of working fluid. In this paper, a recently proposed new stochastic advanced optimization algorithm called TLBO (Teaching–Learning-Based Optimization) algorithm is used for single objective as well as multi-objective design optimization of heat pipe. It is easy to implement, does not make use of derivatives and it can be applied to unconstrained or constrained problems. Two examples of heat pipe are presented in this paper. The results of application of TLBO algorithm for the design optimization of heat pipe are compared with the NPGA (Niched Pareto Genetic Algorithm), GEM (Grenade Explosion Method) and GEO (Generalized External optimization). It is found that the TLBO algorithm has produced better results as compared to those obtained by using NPGA, GEM and GEO algorithms. - Highlights: • The TLBO (Teaching–Learning-Based Optimization) algorithm is used for the design and optimization of a heat pipe. • Two examples of heat pipe design and optimization are presented. • The TLBO algorithm is proved better than the other optimization algorithms in terms of results and the convergence 19. Optimal local dimming for LED-backlit LCD displays via linear programming DEFF Research Database (Denmark) Shu, Xiao; Wu, Xiaolin; Forchhammer, Søren 2012-01-01 and the attenuations of LCD pixels. The objective is to minimize the distortion in luminance reproduction due to the leakage of LCD and the coarse granularity of the LED lights. The optimization problem is formulated as one of linear programming, and both exact and approximate algorithms are proposed. Simulation... 20. Sizing and Optimization for Hybrid Central in South Algeria Based on Three Different Generators Directory of Open Access Journals (Sweden) Chouaib Ammari 2017-11-01 Full Text Available In this paper, we will size an optimum hybrid central content three different generators, two on renewable energy (solar photovoltaic and wind power and two nonrenewable (diesel generator and storage system because the new central generator has started to consider the green power technology in order for best future to the world, this central will use all the green power resource available and distributes energy to a small isolated village in southwest of Algeria named “Timiaouine”. The consumption of this village estimated with detailed in two season; season low consumption (winter and high consumption (summer, the hybrid central will be optimized by program Hybrid Optimization Model for Electric Renewable (HOMER PRO, this program will simulate in two configuration, the first with storage system, the second without storage system and in the end the program HOMER PRO will choose the best configuration which is the mixture of both economic and ecologic configurations, this central warrants the energetic continuity of village. Article History: Received May 18th 2017; Received in revised form July 17th 2017; Accepted Sept 3rd 2017; Available online How to Cite This Article: Ammari, C., Hamouda,M., and Makhloufi,S. (2017 Sizing and Optimization for Hybrid Central in South Algeria Based on Three Different Generators. International Journal of Renewable Energy Development, 6(3, 263-272. http://doi.org/10.14710/ijred.6.3.263-272 1. CALIBRATION, OPTIMIZATION, AND SENSITIVITY AND UNCERTAINTY ALGORITHMS APPLICATION PROGRAMMING INTERFACE (COSU-API) Science.gov (United States) The Application Programming Interface (API) for Uncertainty Analysis, Sensitivity Analysis, and Parameter Estimation (UA/SA/PE API) tool development, here fore referred to as the Calibration, Optimization, and Sensitivity and Uncertainty Algorithms API (COSU-API), was initially d... 2. Swarm intelligence-based approach for optimal design of CMOS differential amplifier and comparator circuit using a hybrid salp swarm algorithm Science.gov (United States) Asaithambi, Sasikumar; Rajappa, Muthaiah 2018-05-01 In this paper, an automatic design method based on a swarm intelligence approach for CMOS analog integrated circuit (IC) design is presented. The hybrid meta-heuristics optimization technique, namely, the salp swarm algorithm (SSA), is applied to the optimal sizing of a CMOS differential amplifier and the comparator circuit. SSA is a nature-inspired optimization algorithm which mimics the navigating and hunting behavior of salp. The hybrid SSA is applied to optimize the circuit design parameters and to minimize the MOS transistor sizes. The proposed swarm intelligence approach was successfully implemented for an automatic design and optimization of CMOS analog ICs using Generic Process Design Kit (GPDK) 180 nm technology. The circuit design parameters and design specifications are validated through a simulation program for integrated circuit emphasis simulator. To investigate the efficiency of the proposed approach, comparisons have been carried out with other simulation-based circuit design methods. The performances of hybrid SSA based CMOS analog IC designs are better than the previously reported studies. 3. Optimizing Python-based ROOT I/O with PyPy's Tracing JIT CERN Multimedia CERN. Geneva 2012-01-01 The Python programming language allows objects and classes to respond dynamically to the execution environment. Most of this, however, is made possible through language hooks which by definition can not be optimized and thus tend to be slow. The PyPy implementation of Python includes a tracing just in time compiler (JIT), which allows similar dynamic responses but at the interpreter-, rather than the application-level. Therefore, it is possible to fully remove the hooks, leaving only the dynamic response, in the optimization stage for hot loops, if the types of interest are opened up to the JIT. A general opening up of types to the JIT, based on reflection information, has already been developed (cppyy). The work described in this paper takes it one step further by customizing access to ROOT I/O to the JIT, allowing for automatic selective reading, judicious caching, and buffer tuning. 4. Multi-objective dynamic economic emission dispatch of electric power generation integrated with game theory based demand response programs International Nuclear Information System (INIS) Nwulu, Nnamdi I.; Xia, Xiaohua 2015-01-01 Highlights: • In this work, a game theory based DR program is integrated into the DEED problem. • Objectives are to minimize fuel and emissions costs and maximize the DR benefit. • Optimal generator output, customer load and customer incentive are determined. • Developed model is tested with two different scenarios. • Model provides superior results than independent optimization of DR or DEED. - Abstract: The dynamic economic emission dispatch (DEED) of electric power generation is a multi-objective mathematical optimization problem with two objective functions. The first objective is to minimize all the fuel costs of the generators in the power system, whilst the second objective seeks to minimize the emissions cost. Both objective functions are subject to constraints such as load demand constraint, ramp rate constraint, amongst other constraints. In this work, we integrate a game theory based demand response program into the DEED problem. The game theory based demand response program determines the optimal hourly incentive to be offered to customers who sign up for load curtailment. The game theory model has in built mechanisms to ensure that the incentive offered the customers is greater than the cost of interruption while simultaneously being beneficial to the utility. The combined DEED and game theoretic demand response model presented in this work, minimizes fuel and emissions costs and simultaneously determines the optimal incentive and load curtailment customers have to perform for maximal power system relief. The developed model is tested on two test systems with industrial customers and obtained results indicate the practical benefits of the proposed model 5. Automated design and optimization of flexible booster autopilots via linear programming. Volume 2: User's manual Science.gov (United States) Hauser, F. D.; Szollosi, G. D.; Lakin, W. S. 1972-01-01 COEBRA, the Computerized Optimization of Elastic Booster Autopilots, is an autopilot design program. The bulk of the design criteria is presented in the form of minimum allowed gain/phase stability margins. COEBRA has two optimization phases: (1) a phase to maximize stability margins; and (2) a phase to optimize structural bending moment load relief capability in the presence of minimum requirements on gain/phase stability margins. 6. Optimization-based topology identification of complex networks International Nuclear Information System (INIS) Tang Sheng-Xue; Chen Li; He Yi-Gang 2011-01-01 In many cases, the topological structures of a complex network are unknown or uncertain, and it is of significance to identify the exact topological structure. An optimization-based method of identifying the topological structure of a complex network is proposed in this paper. Identification of the exact network topological structure is converted into a minimal optimization problem by using the estimated network. Then, an improved quantum-behaved particle swarm optimization algorithm is used to solve the optimization problem. Compared with the previous adaptive synchronization-based method, the proposed method is simple and effective and is particularly valid to identify the topological structure of synchronization complex networks. In some cases where the states of a complex network are only partially observable, the exact topological structure of a network can also be identified by using the proposed method. Finally, numerical simulations are provided to show the effectiveness of the proposed method. (general) 7. Parameter identification using optimization techniques in the continuous simulation programs FORSIM and MACKSIM International Nuclear Information System (INIS) Carver, M.B.; Austin, C.F.; Ross, N.E. 1980-02-01 This report discusses the mechanics of automated parameter identification in simulation packages, and reviews available integration and optimization algorithms and their interaction within the recently developed optimization options in the FORSIM and MACKSIM simulation packages. In the MACKSIM mass-action chemical kinetics simulation package, the form and structure of the ordinary differential equations involved is known, so the implementation of an optimizing option is relatively straightforward. FORSIM, however, is designed to integrate ordinary and partial differential equations of abritrary definition. As the form of the equations is not known in advance, the design of the optimizing option is more intricate, but the philosophy could be applied to most simulation packages. In either case, however, the invocation of the optimizing interface is simple and user-oriented. Full details for the use of the optimizing mode for each program are given; specific applications are used as examples. (O.T.) 8. A Novel Optimal Control Method for Impulsive-Correction Projectile Based on Particle Swarm Optimization Directory of Open Access Journals (Sweden) Ruisheng Sun 2016-01-01 Full Text Available This paper presents a new parametric optimization approach based on a modified particle swarm optimization (PSO to design a class of impulsive-correction projectiles with discrete, flexible-time interval, and finite-energy control. In terms of optimal control theory, the task is described as the formulation of minimum working number of impulses and minimum control error, which involves reference model linearization, boundary conditions, and discontinuous objective function. These result in difficulties in finding the global optimum solution by directly utilizing any other optimization approaches, for example, Hp-adaptive pseudospectral method. Consequently, PSO mechanism is employed for optimal setting of impulsive control by considering the time intervals between two neighboring lateral impulses as design variables, which makes the briefness of the optimization process. A modification on basic PSO algorithm is developed to improve the convergence speed of this optimization through linearly decreasing the inertial weight. In addition, a suboptimal control and guidance law based on PSO technique are put forward for the real-time consideration of the online design in practice. Finally, a simulation case coupled with a nonlinear flight dynamic model is applied to validate the modified PSO control algorithm. The results of comparative study illustrate that the proposed optimal control algorithm has a good performance in obtaining the optimal control efficiently and accurately and provides a reference approach to handling such impulsive-correction problem. 9. School-based internet obesity prevention programs for adolescents: a systematic literature review. Science.gov (United States) Whittemore, Robin; Chao, Ariana; Popick, Rachel; Grey, Margaret 2013-03-01 In response to the childhood obesity epidemic, numerous studies on school-based Internet obesity prevention interventions have been conducted. The purpose of this systematic review is to describe, synthesize, and evaluate the research on school-based Internet obesity prevention programs for adolescents. Medline, CINAHL, and PsycInfo were searched from January 1995 to August 2012 to locate relevant studies. Ninety-one reports were initially identified, with 12 meeting the inclusion criteria. Studies had variable control groups, program content, and sample characteristics. Though few authors reported on implementation processes or body mass index (BMI) outcomes, the majority of studies were effective in improving health behaviors in the short term. Most studies were judged to have a high or unclear risk of bias in at least two domains, thus the quality of evidence for this body of literature is moderate. Further research is needed to examine programs of longer duration, optimal dose and timing of programs, cost-effectiveness, and mediators and moderators of intervention outcomes. 10. Optimizing python-based ROOT I/O with PyPy's tracing just-in-time compiler Science.gov (United States) Tlp Lavrijsen, Wim 2012-12-01 The Python programming language allows objects and classes to respond dynamically to the execution environment. Most of this, however, is made possible through language hooks which by definition can not be optimized and thus tend to be slow. The PyPy implementation of Python includes a tracing just in time compiler (JIT), which allows similar dynamic responses but at the interpreter-, rather than the application-level. Therefore, it is possible to fully remove the hooks, leaving only the dynamic response, in the optimization stage for hot loops, if the types of interest are opened up to the JIT. A general opening up of types to the JIT, based on reflection information, has already been developed (cppyy). The work described in this paper takes it one step further by customizing access to ROOT I/O to the JIT, allowing for fully automatic optimizations. 11. Optimizing python-based ROOT I/O with PyPy's tracing just-in-time compiler International Nuclear Information System (INIS) Lavrijsen, Wim TLP 2012-01-01 The Python programming language allows objects and classes to respond dynamically to the execution environment. Most of this, however, is made possible through language hooks which by definition can not be optimized and thus tend to be slow. The PyPy implementation of Python includes a tracing just in time compiler (JIT), which allows similar dynamic responses but at the interpreter-, rather than the application-level. Therefore, it is possible to fully remove the hooks, leaving only the dynamic response, in the optimization stage for hot loops, if the types of interest are opened up to the JIT. A general opening up of types to the JIT, based on reflection information, has already been developed (cppyy). The work described in this paper takes it one step further by customizing access to ROOT I/O to the JIT, allowing for fully automatic optimizations. 12. Design Optimization of Mechanical Components Using an Enhanced Teaching-Learning Based Optimization Algorithm with Differential Operator Directory of Open Access Journals (Sweden) B. Thamaraikannan 2014-01-01 Full Text Available This paper studies in detail the background and implementation of a teaching-learning based optimization (TLBO algorithm with differential operator for optimization task of a few mechanical components, which are essential for most of the mechanical engineering applications. Like most of the other heuristic techniques, TLBO is also a population-based method and uses a population of solutions to proceed to the global solution. A differential operator is incorporated into the TLBO for effective search of better solutions. To validate the effectiveness of the proposed method, three typical optimization problems are considered in this research: firstly, to optimize the weight in a belt-pulley drive, secondly, to optimize the volume in a closed coil helical spring, and finally to optimize the weight in a hollow shaft. have been demonstrated. Simulation result on the optimization (mechanical components problems reveals the ability of the proposed methodology to find better optimal solutions compared to other optimization algorithms. 13. Optimization of hot water transport and distribution networks by analytical method: OPTAL program International Nuclear Information System (INIS) Barreau, Alain; Caizergues, Robert; Moret-Bailly, Jean 1977-06-01 This report presents optimization studies of hot water transport and distribution network by minimizing operating cost. Analytical optimization is used: Lagrange's method of undetermined multipliers. Optimum diameter of each pipe is calculated for minimum network operating cost. The characteristics of the computer program used for calculations, OPTAL, are given in this report. An example of network is calculated and described: 52 branches and 27 customers. Results are discussed [fr 14. Optimization of surface maintenance International Nuclear Information System (INIS) Oeverland, E. 1990-01-01 The present conference paper deals with methods of optimizing the surface maintenance of steel-made offshore installations. The paper aims at identifying important approaches to the problems regarding the long-range planning of an economical and cost effective maintenance program. The methods of optimization are based on the obtained experiences from the maintenance of installations on the Norwegian continental shelf. 3 figs 15. Meeting the challenges with the Douglas Aircraft Company Aeroelastic Design Optimization Program (ADOP) Science.gov (United States) Rommel, Bruce A. 1989-01-01 An overview of the Aeroelastic Design Optimization Program (ADOP) at the Douglas Aircraft Company is given. A pilot test program involving the animation of mode shapes with solid rendering as well as wire frame displays, a complete aircraft model of a high-altitude hypersonic aircraft to test ADOP procedures, a flap model, and an aero-mesh modeler for doublet lattice aerodynamics are discussed. 16. Seca Coal-Based Systems Program Energy Technology Data Exchange (ETDEWEB) Matthew Alinger 2008-05-31 This report summarizes the progress made during the August 1, 2006 - May 31, 2008 award period under Cooperative Agreement DE-FC26-05NT42614 for the U. S. Department of Energy/National Energy Technology Laboratory (USDOE/NETL) entitled 'SECA Coal Based Systems'. The initial overall objective of this program was to design, develop, and demonstrate multi-MW integrated gasification fuel cell (IGFC) power plants with >50% overall efficiency from coal (HHV) to AC power. The focus of the program was to develop low-cost, high performance, modular solid oxide fuel cell (SOFC) technology to support coal gas IGFC power systems. After a detailed GE internal review of the SOFC technology, the program was de-scoped at GE's request. The primary objective of this program was then focused on developing a performance degradation mitigation path for high performing, cost-effective solid oxide fuel cells (SOFCs). There were two initial major objectives in this program. These were: (1) Develop and optimize a design of a >100 MWe integrated gasification fuel cell (IGFC) power plant; (2) Resolve identified barrier issues concerning the long-term economic performance of SOFC. The program focused on designing and cost estimating the IGFC system and resolving technical and economic barrier issues relating to SOFC. In doing so, manufacturing options for SOFC cells were evaluated, options for constructing stacks based upon various cell configurations identified, and key performance characteristics were identified. Key factors affecting SOFC performance degradation for cells in contact with metallic interconnects were be studied and a fundamental understanding of associated mechanisms was developed using a fixed materials set. Experiments and modeling were carried out to identify key processes/steps affecting cell performance degradation under SOFC operating conditions. Interfacial microstructural and elemental changes were characterized, and their relationships to observed 17. Reliability-Based Optimization of Series Systems of Parallel Systems DEFF Research Database (Denmark) Enevoldsen, I.; Sørensen, John Dalsgaard 1993-01-01 Reliability-based design of structural systems is considered. In particular, systems where the reliability model is a series system of parallel systems are treated. A sensitivity analysis for this class of problems is presented. Optimization problems with series systems of parallel systems...... optimization of series systems of parallel systems, but it is also efficient in reliability-based optimization of series systems in general.... 18. Method of optimization onboard communication network Science.gov (United States) Platoshin, G. A.; Selvesuk, N. I.; Semenov, M. E.; Novikov, V. M. 2018-02-01 In this article the optimization levels of onboard communication network (OCN) are proposed. We defined the basic parameters, which are necessary for the evaluation and comparison of modern OCN, we identified also a set of initial data for possible modeling of the OCN. We also proposed a mathematical technique for implementing the OCN optimization procedure. This technique is based on the principles and ideas of binary programming. It is shown that the binary programming technique allows to obtain an inherently optimal solution for the avionics tasks. An example of the proposed approach implementation to the problem of devices assignment in OCN is considered. 19. A Framework for Constrained Optimization Problems Based on a Modified Particle Swarm Optimization Directory of Open Access Journals (Sweden) Biwei Tang 2016-01-01 Full Text Available This paper develops a particle swarm optimization (PSO based framework for constrained optimization problems (COPs. Aiming at enhancing the performance of PSO, a modified PSO algorithm, named SASPSO 2011, is proposed by adding a newly developed self-adaptive strategy to the standard particle swarm optimization 2011 (SPSO 2011 algorithm. Since the convergence of PSO is of great importance and significantly influences the performance of PSO, this paper first theoretically investigates the convergence of SASPSO 2011. Then, a parameter selection principle guaranteeing the convergence of SASPSO 2011 is provided. Subsequently, a SASPSO 2011-based framework is established to solve COPs. Attempting to increase the diversity of solutions and decrease optimization difficulties, the adaptive relaxation method, which is combined with the feasibility-based rule, is applied to handle constraints of COPs and evaluate candidate solutions in the developed framework. Finally, the proposed method is verified through 4 benchmark test functions and 2 real-world engineering problems against six PSO variants and some well-known methods proposed in the literature. Simulation results confirm that the proposed method is highly competitive in terms of the solution quality and can be considered as a vital alternative to solve COPs. 20. Optimization of DNA Sensor Model Based Nanostructured Graphene Using Particle Swarm Optimization Technique Directory of Open Access Journals (Sweden) Hediyeh Karimi 2013-01-01 Full Text Available It has been predicted that the nanomaterials of graphene will be among the candidate materials for postsilicon electronics due to their astonishing properties such as high carrier mobility, thermal conductivity, and biocompatibility. Graphene is a semimetal zero gap nanomaterial with demonstrated ability to be employed as an excellent candidate for DNA sensing. Graphene-based DNA sensors have been used to detect the DNA adsorption to examine a DNA concentration in an analyte solution. In particular, there is an essential need for developing the cost-effective DNA sensors holding the fact that it is suitable for the diagnosis of genetic or pathogenic diseases. In this paper, particle swarm optimization technique is employed to optimize the analytical model of a graphene-based DNA sensor which is used for electrical detection of DNA molecules. The results are reported for 5 different concentrations, covering a range from 0.01 nM to 500 nM. The comparison of the optimized model with the experimental data shows an accuracy of more than 95% which verifies that the optimized model is reliable for being used in any application of the graphene-based DNA sensor. 1. The efficacy of the enhanced Aussie Optimism Positive Thinking Skills Program in improving social and emotional learning in middle childhood OpenAIRE Myles-Pallister, Jacqueline D.; Hassan, Sharinaz; Rooney, Rosanna M.; Kane, Robert T. 2014-01-01 The aim of the current study was to investigate the effects of the modified and enhanced Aussie Optimism Positive Thinking Skills Program (AO-PTS) on Year 4 and 5 children's social and emotional learning (SEL) skills. AO-PTS is a universal-school based program that is implemented by class teachers as part of regular school curricula and was developed for the prevention of depression and anxiety. The study comprised a total of 683 Year 4 and 5 students from 10 private primary schools in Wester... 2. Utilization threshold of surface water and groundwater based on the system optimization of crop planting structure Directory of Open Access Journals (Sweden) Qiang FU,Jiahong LI,Tianxiao LI,Dong LIU,Song CUI 2016-09-01 Full Text Available Based on the diversity of the agricultural system, this research calculates the planting structures of rice, maize and soybean considering the optimal economic-social-ecological aspects. Then, based on the uncertainty and randomness of the water resources system, the interval two-stage stochastic programming method, which introduces the uncertainty of the interval number, is used to calculate the groundwater exploitation and the use efficiency of surface water. The method considers the minimum cost of water as the objective of the uncertainty model for surface water and groundwater joint scheduling optimization for different planting structures. Finally, by calculating harmonious entropy, the optimal exploitation utilization interval of surface water and groundwater is determined for optimal cultivation in the Sanjiang Plain. The optimal matching of the planting structure under the economic system is suitable when the mining ratio of the surface is in 44.13%—45.45% and the exploitation utilization of groundwater is in 54.82%—66.86%, the optimal planting structure under the social system is suitable when surface water mining ratio is in 47.84%—48.04% and the groundwater exploitation threshold is in 67.07%—72.00%. This article optimizes the economic-social-ecological-water system, which is important for the development of a water- and food-conserving society and providing a more accurate management environment. 3. ANALISIS KESIAPAN PROGRAM STUDI DALAM PRODUCTION BASED EDUCATION: STUDI PADA PROGRAM STUDI D3 AKUNTANSI POLINES Directory of Open Access Journals (Sweden) Muhammad Noor Ardiansah 2015-03-01 Full Text Available There has been no clear studies to identify, verify and analyze readiness program resources in order to study the implementation of PBE resulted in initial position (existing point is not clear that the priority programs and activities that are carried out per year tend to be responsive and not directed priorities. These conditions resulted in analysis of resource readiness courses in the management of production-based learning pattern PBE draw conducted This study aims to identify and verify and analyze readiness resources management courses in the pattern of production based learning, particularly in the Accounting Studies Program. This research is expected to be used to increase the effectiveness of learning and vocational education to improve the quality and relevance of polytechnic graduates. Total score was 33 the existence of resources from the scale of 12-60. The average score is 2.75. The average score was shown the position of Prodi's resources have been used, but its role is unclear (repeatable tend to have clearly defined functions, communicated and documented (defined. Resources have been managed, monitored and evaluated well (managed are: curriculum resources, networking courses, lab facilities, ISO-based management. Resources have been used but not optimal role: resources module practice, the formulation of an internship, practice material / TA, the performance of IC-based lecturer 4. ANALISIS KESIAPAN PROGRAM STUDI DALAM PRODUCTION BASED EDUCATION: STUDI PADA PROGRAM STUDI D3 AKUNTANSI POLINES Directory of Open Access Journals (Sweden) Muhammad Noor Ardiansah 2014-06-01 Full Text Available There has been no clear studies to identify, verify and analyze readiness program resources in order to study the implementation of PBE resulted in initial position (existing point is not clear that the priority programs and activities that are carried out per year tend to be responsive and not directed priorities. These conditions resulted in analysis of resource readiness courses in the management of production-based learning pattern PBE draw conducted This study aims to identify and verify and analyze readiness resources management courses in the pattern of production based learning, particularly in the Accounting Studies Program. This research is expected to be used to increase the effectiveness of learning and vocational education to improve the quality and relevance of polytechnic graduates. Total score was 33 the existence of resources from the scale of 12-60. The average score is 2.75. The average score was shown the position of Prodi's resources have been used, but its role is unclear (repeatable tend to have clearly defined functions, communicated and documented (defined. Resources have been managed, monitored and evaluated well (managed are: curriculum resources, networking courses, lab facilities, ISO-based management. Resources have been used but not optimal role: resources module practice, the formulation of an internship, practice material / TA, the performance of IC-based lecturer 5. Reliability-Based Structural Optimization of Wave Energy Converters DEFF Research Database (Denmark) Ambühl, Simon; Kramer, Morten; Sørensen, John Dalsgaard 2014-01-01 More and more wave energy converter (WEC) concepts are reaching prototype level. Once the prototype level is reached, the next step in order to further decrease the levelized cost of energy (LCOE) is optimizing the overall system with a focus on structural and maintenance (inspection) costs......, as well as on the harvested power from the waves. The target of a fully-developed WEC technology is not maximizing its power output, but minimizing the resulting LCOE. This paper presents a methodology to optimize the structural design of WECs based on a reliability-based optimization problem... 6. Optimization of a Fuzzy-Logic-Control-Based MPPT Algorithm Using the Particle Swarm Optimization Technique Directory of Open Access Journals (Sweden) Po-Chen Cheng 2015-06-01 Full Text Available In this paper, an asymmetrical fuzzy-logic-control (FLC-based maximum power point tracking (MPPT algorithm for photovoltaic (PV systems is presented. Two membership function (MF design methodologies that can improve the effectiveness of the proposed asymmetrical FLC-based MPPT methods are then proposed. The first method can quickly determine the input MF setting values via the power–voltage (P–V curve of solar cells under standard test conditions (STC. The second method uses the particle swarm optimization (PSO technique to optimize the input MF setting values. Because the PSO approach must target and optimize a cost function, a cost function design methodology that meets the performance requirements of practical photovoltaic generation systems (PGSs is also proposed. According to the simulated and experimental results, the proposed asymmetrical FLC-based MPPT method has the highest fitness value, therefore, it can successfully address the tracking speed/tracking accuracy dilemma compared with the traditional perturb and observe (P&O and symmetrical FLC-based MPPT algorithms. Compared to the conventional FLC-based MPPT method, the obtained optimal asymmetrical FLC-based MPPT can improve the transient time and the MPPT tracking accuracy by 25.8% and 0.98% under STC, respectively. 7. Dynamic programming approach for partial decision rule optimization KAUST Repository Amin, Talha 2012-10-04 This paper is devoted to the study of an extension of dynamic programming approach which allows optimization of partial decision rules relative to the length or coverage. We introduce an uncertainty measure J(T) which is the difference between number of rows in a decision table T and number of rows with the most common decision for T. For a nonnegative real number γ, we consider γ-decision rules (partial decision rules) that localize rows in subtables of T with uncertainty at most γ. Presented algorithm constructs a directed acyclic graph Δ γ(T) which nodes are subtables of the decision table T given by systems of equations of the kind "attribute = value". This algorithm finishes the partitioning of a subtable when its uncertainty is at most γ. The graph Δ γ(T) allows us to describe the whole set of so-called irredundant γ-decision rules. We can optimize such set of rules according to length or coverage. This paper contains also results of experiments with decision tables from UCI Machine Learning Repository. 8. Dynamic programming approach for partial decision rule optimization KAUST Repository Amin, Talha M.; Chikalov, Igor; Moshkov, Mikhail; Zielosko, Beata 2012-01-01 This paper is devoted to the study of an extension of dynamic programming approach which allows optimization of partial decision rules relative to the length or coverage. We introduce an uncertainty measure J(T) which is the difference between number of rows in a decision table T and number of rows with the most common decision for T. For a nonnegative real number γ, we consider γ-decision rules (partial decision rules) that localize rows in subtables of T with uncertainty at most γ. Presented algorithm constructs a directed acyclic graph Δ γ(T) which nodes are subtables of the decision table T given by systems of equations of the kind "attribute = value". This algorithm finishes the partitioning of a subtable when its uncertainty is at most γ. The graph Δ γ(T) allows us to describe the whole set of so-called irredundant γ-decision rules. We can optimize such set of rules according to length or coverage. This paper contains also results of experiments with decision tables from UCI Machine Learning Repository. 9. Planning of motion strategy for hexapod robot using biogeography based optimization Directory of Open Access Journals (Sweden) Hayder Mahdi Abdulridha 2017-08-01 Full Text Available The necessity to utilize the usage of the robot cannot be denied since there are a lot of natural disasters occur around the world, the robot can reach places where humans cannot reach. Hexapod robotic is one of the robots utilized in this case due to its balance and versatility at some stage in the movement on any kind of floor. In this project the explanation of using software and hardware Arduino microcontroller is used to control of such a hexapod. The output signal from Arduino for controlling leg's joint angular position such as a pulse called Pulse Width Modulation (PWM. Also Arduino programmed to create the sequence of motion for six legs. The second part of project is about controlling hexapod to avoid hitches and tracking the wall by using PID controller. Tuning of the PID processes based on Biogeography Based Optimization(BBO need to keep the connection between PC and hexapod, because the BBO was written by Matlab. The experimental results using BBO to optimize the PID controller parameters of hexapod robot show the efficiency of this technique in the adaptation of controller. 10. Optimal processing pathway for the production of biodiesel from microalgal biomass: A superstructure based approach DEFF Research Database (Denmark) Rizwan, Muhammad; Lee, Jay H.; Gani, Rafiqul 2013-01-01 In this study, we propose a mixed integer nonlinear programming (MINLP) model for superstructure based optimization of biodiesel production from microalgal biomass. The proposed superstructure includes a number of major processing steps for the production of biodiesel from microalgal biomass......, such as the harvesting of microalgal biomass, pretreatments including drying and cell disruption of harvested biomass, lipid extraction, transesterification, and post-transesterfication purification. The proposed model is used to find the optimal processing pathway among the large number of potential pathways that exist...... for the production of biodiesel from microalgae. The proposed methodology is tested by implementing on a specific case with different choices of objective functions. The MINLP model is implemented and solved in GAMS using a database built in Excel. The results from the optimization are analyzed... 11. Bandgap optimization of two-dimensional photonic crystals using semidefinite programming and subspace methods International Nuclear Information System (INIS) Men, H.; Nguyen, N.C.; Freund, R.M.; Parrilo, P.A.; Peraire, J. 2010-01-01 In this paper, we consider the optimal design of photonic crystal structures for two-dimensional square lattices. The mathematical formulation of the bandgap optimization problem leads to an infinite-dimensional Hermitian eigenvalue optimization problem parametrized by the dielectric material and the wave vector. To make the problem tractable, the original eigenvalue problem is discretized using the finite element method into a series of finite-dimensional eigenvalue problems for multiple values of the wave vector parameter. The resulting optimization problem is large-scale and non-convex, with low regularity and non-differentiable objective. By restricting to appropriate eigenspaces, we reduce the large-scale non-convex optimization problem via reparametrization to a sequence of small-scale convex semidefinite programs (SDPs) for which modern SDP solvers can be efficiently applied. Numerical results are presented for both transverse magnetic (TM) and transverse electric (TE) polarizations at several frequency bands. The optimized structures exhibit patterns which go far beyond typical physical intuition on periodic media design. 12. Policy Iteration forH_\\infty $Optimal Control of Polynomial Nonlinear Systems via Sum of Squares Programming. Science.gov (United States) Zhu, Yuanheng; Zhao, Dongbin; Yang, Xiong; Zhang, Qichao 2018-02-01 Sum of squares (SOS) polynomials have provided a computationally tractable way to deal with inequality constraints appearing in many control problems. It can also act as an approximator in the framework of adaptive dynamic programming. In this paper, an approximate solution to the optimal control of polynomial nonlinear systems is proposed. Under a given attenuation coefficient, the Hamilton-Jacobi-Isaacs equation is relaxed to an optimization problem with a set of inequalities. After applying the policy iteration technique and constraining inequalities to SOS, the optimization problem is divided into a sequence of feasible semidefinite programming problems. With the converged solution, the attenuation coefficient is further minimized to a lower value. After iterations, approximate solutions to the smallest -gain and the associated optimal controller are obtained. Four examples are employed to verify the effectiveness of the proposed algorithm. 13. A comparison of physically and radiobiologically based optimization for IMRT International Nuclear Information System (INIS) Jones, Lois; Hoban, Peter 2002-01-01 Many optimization techniques for intensity modulated radiotherapy have now been developed. The majority of these techniques including all the commercial systems that are available are based on physical dose methods of assessment. Some techniques have also been based on radiobiological models. None of the radiobiological optimization techniques however have assessed the clinically realistic situation of considering both tumor and normal cells within the target volume. This study considers a ratio-based fluence optimizing technique to compare a dose-based optimization method described previously and two biologically based models. The biologically based methods use the values of equivalent uniform dose calculated for the tumor cells and integral biological effective dose for normal cells. The first biologically based method includes only tumor cells in the target volume while the second considers both tumor and normal cells in the target volume. All three methods achieve good conformation to the target volume. The biologically based optimization without the normal tissue in the target volume shows a high dose region in the center of the target volume while this is reduced when the normal tissues are also considered in the target volume. This effect occurs because the normal tissues in the target volume require the optimization to reduce the dose and therefore limit the maximum dose to that volume 14. Credibilistic multi-period portfolio optimization based on scenario tree Science.gov (United States) Mohebbi, Negin; Najafi, Amir Abbas 2018-02-01 In this paper, we consider a multi-period fuzzy portfolio optimization model with considering transaction costs and the possibility of risk-free investment. We formulate a bi-objective mean-VaR portfolio selection model based on the integration of fuzzy credibility theory and scenario tree in order to dealing with the markets uncertainty. The scenario tree is also a proper method for modeling multi-period portfolio problems since the length and continuity of their horizon. We take the return and risk as well cardinality, threshold, class, and liquidity constraints into consideration for further compliance of the model with reality. Then, an interactive dynamic programming method, which is based on a two-phase fuzzy interactive approach, is employed to solve the proposed model. In order to verify the proposed model, we present an empirical application in NYSE under different circumstances. The results show that the consideration of data uncertainty and other real-world assumptions lead to more practical and efficient solutions. 15. Coastal aquifer management under parameter uncertainty: Ensemble surrogate modeling based simulation-optimization Science.gov (United States) Janardhanan, S.; Datta, B. 2011-12-01 Surrogate models are widely used to develop computationally efficient simulation-optimization models to solve complex groundwater management problems. Artificial intelligence based models are most often used for this purpose where they are trained using predictor-predictand data obtained from a numerical simulation model. Most often this is implemented with the assumption that the parameters and boundary conditions used in the numerical simulation model are perfectly known. However, in most practical situations these values are uncertain. Under these circumstances the application of such approximation surrogates becomes limited. In our study we develop a surrogate model based coupled simulation optimization methodology for determining optimal pumping strategies for coastal aquifers considering parameter uncertainty. An ensemble surrogate modeling approach is used along with multiple realization optimization. The methodology is used to solve a multi-objective coastal aquifer management problem considering two conflicting objectives. Hydraulic conductivity and the aquifer recharge are considered as uncertain values. Three dimensional coupled flow and transport simulation model FEMWATER is used to simulate the aquifer responses for a number of scenarios corresponding to Latin hypercube samples of pumping and uncertain parameters to generate input-output patterns for training the surrogate models. Non-parametric bootstrap sampling of this original data set is used to generate multiple data sets which belong to different regions in the multi-dimensional decision and parameter space. These data sets are used to train and test multiple surrogate models based on genetic programming. The ensemble of surrogate models is then linked to a multi-objective genetic algorithm to solve the pumping optimization problem. Two conflicting objectives, viz, maximizing total pumping from beneficial wells and minimizing the total pumping from barrier wells for hydraulic control of 16. Optimal GENCO bidding strategy Science.gov (United States) Gao, Feng Electricity industries worldwide are undergoing a period of profound upheaval. The conventional vertically integrated mechanism is being replaced by a competitive market environment. Generation companies have incentives to apply novel technologies to lower production costs, for example: Combined Cycle units. Economic dispatch with Combined Cycle units becomes a non-convex optimization problem, which is difficult if not impossible to solve by conventional methods. Several techniques are proposed here: Mixed Integer Linear Programming, a hybrid method, as well as Evolutionary Algorithms. Evolutionary Algorithms share a common mechanism, stochastic searching per generation. The stochastic property makes evolutionary algorithms robust and adaptive enough to solve a non-convex optimization problem. This research implements GA, EP, and PS algorithms for economic dispatch with Combined Cycle units, and makes a comparison with classical Mixed Integer Linear Programming. The electricity market equilibrium model not only helps Independent System Operator/Regulator analyze market performance and market power, but also provides Market Participants the ability to build optimal bidding strategies based on Microeconomics analysis. Supply Function Equilibrium (SFE) is attractive compared to traditional models. This research identifies a proper SFE model, which can be applied to a multiple period situation. The equilibrium condition using discrete time optimal control is then developed for fuel resource constraints. Finally, the research discusses the issues of multiple equilibria and mixed strategies, which are caused by the transmission network. Additionally, an advantage of the proposed model for merchant transmission planning is discussed. A market simulator is a valuable training and evaluation tool to assist sellers, buyers, and regulators to understand market performance and make better decisions. A traditional optimization model may not be enough to consider the distributed 17. Multi-objective component sizing based on optimal energy management strategy of fuel cell electric vehicles International Nuclear Information System (INIS) Xu, Liangfei; Mueller, Clemens David; Li, Jianqiu; Ouyang, Minggao; Hu, Zunyan 2015-01-01 Highlights: • A non-linear model regarding fuel economy and system durability of FCEV. • A two-step algorithm for a quasi-optimal solution to a multi-objective problem. • Optimal parameters for DP algorithm considering accuracy and calculating time. • Influences of FC power and battery capacity on system performance. - Abstract: A typical topology of a proton electrolyte membrane (PEM) fuel cell electric vehicle contains at least two power sources, a fuel cell system (FCS) and a lithium battery package. The FCS provides stationary power, and the battery delivers dynamic power. In this paper, we report on the multi-objective optimization problem of powertrain parameters for a pre-defined driving cycle regarding fuel economy and system durability. We introduce the dynamic model for the FCEV. We take into consideration equations not only for fuel economy but also for system durability. In addition, we define a multi-objective optimization problem, and find a quasi-optimal solution using a two-loop framework. In the inside loop, for each group of powertrain parameters, a global optimal energy management strategy based on dynamic programming (DP) is exploited. We optimize coefficients for the DP algorithm to reduce calculating time as well as to maintain accuracy. For the outside loop, we compare the results of all the groups with each other, and choose the Pareto optimal solution based on a compromise of fuel economy and system durability. Simulation results show that for a “China city bus typical cycle,” a battery capacity of 150 Ah and an FCS maximal net output power of 40 kW are optimal for the fuel economy and system durability of a fuel cell city bus. 18. Optimization programs of radiation protection applied to post-graduation and encouraging research International Nuclear Information System (INIS) Levy, Denise S.; Sordi, Gian Maria A.A. 2013-01-01 In 2011 we started the automation and integration of radiological protection optimization programs, in order to offer unified programs and inter-related information in Portuguese, providing Brazilian radioactive facilities a complete repository for research, consultation and information. The authors of this project extended it to postgraduate education, in order to encourage postgraduate students researches, expanding methods for enhancing student learning through the use of different combined resources, such as educational technology, information technology and group dynamics. This new methodology was applied in a postgraduate discipline at Instituto de Pesquisas Energeticas e Nucleares (IPEN), Brazil, in the postgraduate discipline entitled Fundamental Elements of Radiological Protection (TNA-5732). Students have six weeks to assimilate a complex content of optimization, considering national and international standards, guidelines and recommendations published by different organizations over the past decades. Unlike traditional classes, in which students receive prompt responses, this new methodology stimulates discussion, encouraging collective thinking processes and promoting ongoing personal reflection and researches. Case-oriented problem-solving permitted students to play different roles, promoting whole-group discussions and cooperative learning, approaching theory and practical applications. Students discussed different papers, published in international conferences, and their implications according to current standards. The automation of optimization programs was essential as a research tool during the course. The results of this experience were evaluated in two consecutive years. We had excellent results compared to the previous 14 years. The methodology has exceeded expectations and will be also applied in 2013 to ionizing radiation monitoring postgraduate classes. (author) 19. 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. 20. 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. 1. Grey-Theory-Based Optimization Model of Emergency Logistics Considering Time Uncertainty. Science.gov (United States) Qiu, Bao-Jian; Zhang, Jiang-Hua; Qi, Yuan-Tao; Liu, Yang 2015-01-01 Natural disasters occur frequently in recent years, causing huge casualties and property losses. Nowadays, people pay more and more attention to the emergency logistics problems. This paper studies the emergency logistics problem with multi-center, multi-commodity, and single-affected-point. Considering that the path near the disaster point may be damaged, the information of the state of the paths is not complete, and the travel time is uncertainty, we establish the nonlinear programming model that objective function is the maximization of time-satisfaction degree. To overcome these drawbacks: the incomplete information and uncertain time, this paper firstly evaluates the multiple roads of transportation network based on grey theory and selects the reliable and optimal path. Then simplify the original model under the scenario that the vehicle only follows the optimal path from the emergency logistics center to the affected point, and use Lingo software to solve it. The numerical experiments are presented to show the feasibility and effectiveness of the proposed method. 2. A Simulation Modeling Framework to Optimize Programs Using Financial Incentives to Motivate Health Behavior Change. Science.gov (United States) Basu, Sanjay; Kiernan, Michaela 2016-01-01 While increasingly popular among mid- to large-size employers, using financial incentives to induce health behavior change among employees has been controversial, in part due to poor quality and generalizability of studies to date. Thus, fundamental questions have been left unanswered: To generate positive economic returns on investment, what level of incentive should be offered for any given type of incentive program and among which employees? We constructed a novel modeling framework that systematically identifies how to optimize marginal return on investment from programs incentivizing behavior change by integrating commonly collected data on health behaviors and associated costs. We integrated "demand curves" capturing individual differences in response to any given incentive with employee demographic and risk factor data. We also estimated the degree of self-selection that could be tolerated: that is, the maximum percentage of already-healthy employees who could enroll in a wellness program while still maintaining positive absolute return on investment. In a demonstration analysis, the modeling framework was applied to data from 3000 worksite physical activity programs across the nation. For physical activity programs, the incentive levels that would optimize marginal return on investment ($367/employee/year) were higher than average incentive levels currently offered (\$143/employee/year). Yet a high degree of self-selection could undermine the economic benefits of the program; if more than 17% of participants came from the top 10% of the physical activity distribution, the cost of the program would be expected to always be greater than its benefits. Our generalizable framework integrates individual differences in behavior and risk to systematically estimate the incentive level that optimizes marginal return on investment. © The Author(s) 2015.

3. Performance-based Pareto optimal design

NARCIS (Netherlands)

Sariyildiz, I.S.; Bittermann, M.S.; Ciftcioglu, O.

2008-01-01

A novel approach for performance-based design is presented, where Pareto optimality is pursued. Design requirements may contain linguistic information, which is difficult to bring into computation or make consistent their impartial estimations from case to case. Fuzzy logic and soft computing are

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

5. Economic optimization and evolutionary programming when using remote sensing data

OpenAIRE

Shamin Roman; Alberto Gabriel Enrike; Uryngaliyeva Ayzhana; Semenov Aleksandr

2018-01-01

The article considers the issues of optimizing the use of remote sensing data. Built a mathematical model to describe the economic effect of the use of remote sensing data. It is shown that this model is incorrect optimisation task. Given a numerical method of solving this problem. Also discusses how to optimize organizational structure by using genetic algorithm based on remote sensing. The methods considered allow the use of remote sensing data in an optimal way. The proposed mathematical m...

6. A Language for Specifying Compiler Optimizations for Generic Software

Energy Technology Data Exchange (ETDEWEB)

Willcock, Jeremiah J. [Indiana Univ., Bloomington, IN (United States)

2007-01-01

Compiler optimization is important to software performance, and modern processor architectures make optimization even more critical. However, many modern software applications use libraries providing high levels of abstraction. Such libraries often hinder effective optimization — the libraries are difficult to analyze using current compiler technology. For example, high-level libraries often use dynamic memory allocation and indirectly expressed control structures, such as iteratorbased loops. Programs using these libraries often cannot achieve an optimal level of performance. On the other hand, software libraries have also been recognized as potentially aiding in program optimization. One proposed implementation of library-based optimization is to allow the library author, or a library user, to define custom analyses and optimizations. Only limited systems have been created to take advantage of this potential, however. One problem in creating a framework for defining new optimizations and analyses is how users are to specify them: implementing them by hand inside a compiler is difficult and prone to errors. Thus, a domain-specific language for librarybased compiler optimizations would be beneficial. Many optimization specification languages have appeared in the literature, but they tend to be either limited in power or unnecessarily difficult to use. Therefore, I have designed, implemented, and evaluated the Pavilion language for specifying program analyses and optimizations, designed for library authors and users. These analyses and optimizations can be based on the implementation of a particular library, its use in a specific program, or on the properties of a broad range of types, expressed through concepts. The new system is intended to provide a high level of expressiveness, even though the intended users are unlikely to be compiler experts.

7. Software for selection of optimal layouts of fast reactors

International Nuclear Information System (INIS)

Geraskin, N.I.; Kuz'min, A.M.; Morin, D.V.

1983-01-01

A complex program for the calculation and optimization of a two-dimensional cylindrical fast reactor consisting of two axial layers and having up to 10 zones of different compositions in each layer is described. Search for optimal parameters is performed by the successive linearization method based on the small perturbation theory and linear programming. The complex program is written for the BESM-6 computer in the FORTRAN language

8. An Algebraic Programming Style for Numerical Software and Its Optimization

Directory of Open Access Journals (Sweden)

T.B. Dinesh

2000-01-01

Full Text Available The abstract mathematical theory of partial differential equations (PDEs is formulated in terms of manifolds, scalar fields, tensors, and the like, but these algebraic structures are hardly recognizable in actual PDE solvers. The general aim of the Sophus programming style is to bridge the gap between theory and practice in the domain of PDE solvers. Its main ingredients are a library of abstract datatypes corresponding to the algebraic structures used in the mathematical theory and an algebraic expression style similar to the expression style used in the mathematical theory. Because of its emphasis on abstract datatypes, Sophus is most naturally combined with object-oriented languages or other languages supporting abstract datatypes. The resulting source code patterns are beyond the scope of current compiler optimizations, but are sufficiently specific for a dedicated source-to-source optimizer. The limited, domain-specific, character of Sophus is the key to success here. This kind of optimization has been tested on computationally intensive Sophus style code with promising results. The general approach may be useful for other styles and in other application domains as well.

9. CiOpt: a program for optimization of the frequency response of linear circuits

OpenAIRE

Miró Sans, Joan Maria; Palà Schönwälder, Pere

1991-01-01

An interactive personal-computer program for optimizing the frequency response of linear lumped circuits (CiOpt) is presented. CiOpt has proved to be an efficient tool in improving designs where the inclusion of more accurate device models distorts the desired frequency response, as well as in device modeling. The outputs of CiOpt are the element values which best match the obtained and the desired frequency response. The optimization algorithms used (the Fletcher-Powell and Newton's methods,...

10. Optimization Models for Reaction Networks: Information Divergence, Quadratic Programming and Kirchhoff’s Laws

Directory of Open Access Journals (Sweden)

Julio Michael Stern

2014-03-01

Full Text Available This article presents a simple derivation of optimization models for reaction networks leading to a generalized form of the mass-action law, and compares the formal structure of Minimum Information Divergence, Quadratic Programming and Kirchhoff type network models. These optimization models are used in related articles to develop and illustrate the operation of ontology alignment algorithms and to discuss closely connected issues concerning the epistemological and statistical significance of sharp or precise hypotheses in empirical science.

11. Design of SVC Controller Based on Improved Biogeography-Based Optimization Algorithm

Directory of Open Access Journals (Sweden)

Feifei Dong

2014-01-01

Full Text Available Considering that common subsynchronous resonance controllers cannot adapt to the characteristics of the time-varying and nonlinear behavior of a power system, the cosine migration model, the improved migration operator, and the mutative scale of chaos and Cauchy mutation strategy are introduced into an improved biogeography-based optimization (IBBO algorithm in order to design an optimal subsynchronous damping controller based on the mechanism of suppressing SSR by static var compensator (SVC. The effectiveness of the improved controller is verified by eigenvalue analysis and electromagnetic simulations. The simulation results of Jinjie plant indicate that the subsynchronous damping controller optimized by the IBBO algorithm can remarkably improve the damping of torsional modes and thus effectively depress SSR, and ensure the safety and stability of units and power grid operation. Moreover, the IBBO algorithm has the merits of a faster searching speed and higher searching accuracy in seeking the optimal control parameters over traditional algorithms, such as BBO algorithm, PSO algorithm, and GA algorithm.

12. Semantic Edge Based Disparity Estimation Using Adaptive Dynamic Programming for Binocular Sensors.

Science.gov (United States)

Zhu, Dongchen; Li, Jiamao; Wang, Xianshun; Peng, Jingquan; Shi, Wenjun; Zhang, Xiaolin

2018-04-03

Disparity calculation is crucial for binocular sensor ranging. The disparity estimation based on edges is an important branch in the research of sparse stereo matching and plays an important role in visual navigation. In this paper, we propose a robust sparse stereo matching method based on the semantic edges. Some simple matching costs are used first, and then a novel adaptive dynamic programming algorithm is proposed to obtain optimal solutions. This algorithm makes use of the disparity or semantic consistency constraint between the stereo images to adaptively search parameters, which can improve the robustness of our method. The proposed method is compared quantitatively and qualitatively with the traditional dynamic programming method, some dense stereo matching methods, and the advanced edge-based method respectively. Experiments show that our method can provide superior performance on the above comparison.

13. Optimization of reload core design for PWR

International Nuclear Information System (INIS)

Shen Wei; Xie Zhongsheng; Yin Banghua

1995-01-01

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

14. Interactive Reliability-Based Optimization of Structural Systems

DEFF Research Database (Denmark)

Pedersen, Claus

In order to introduce the basic concepts within the field of reliability-based structural optimization problems, this chapter is devoted to a brief outline of the basic theories. Therefore, this chapter is of a more formal nature and used as a basis for the remaining parts of the thesis. In section...... 2.2 a general non-linear optimization problem and corresponding terminology are presented whereupon optimality conditions and the standard form of an iterative optimization algorithm are outlined. Subsequently, the special properties and characteristics concerning structural optimization problems...... are treated in section 2.3. With respect to the reliability evalutation, the basic theory behind a reliability analysis and estimation of probability of failure by the First-Order Reliability Method (FORM) and the iterative Rackwitz-Fiessler (RF) algorithm are considered in section 2.5 in which...

15. Model-based optimal monitoring as a design tool for thermal management functions; Modellbasierte Optimalsteuerung als Auslegungswerkzeug fuer Thermomanagementfunktionen

Energy Technology Data Exchange (ETDEWEB)

Appelt, Christian; Kaeppner, Christoph [Volkswagen AG, Wolfsburg (Germany)

2012-11-01

Increasing vehicle and environmental sensoring leads to further improvement of situational control strategies. In case of optimal control, the energy efficiency of the entire vehicle can benefit. However, a truly optimal control often results from a hardware demanding real-time optimization process, which typically cannot be provided by vehicle control units. This article describes a method to support the process of parameter application and function development in the field of thermal management. A heat storage prototype system is used to demonstrate a model based optimal control for a fuel efficient heat flow into the transmission and the combustion engine. Instead of designing an evitable optimal control function and fitting its parameters with a series of vehicle tests, a physically based thermal drivetrain model is used. Due to the model's highly multiple real-time capability, the global optimal dynamic programming method generates a control trajectory depending on the defined environmental conditions. Simpler control patterns are then developed by analyzing these trajectories and by identifying their cause of action. The resulting control strategy is tested by measuring the fuel saving potential on a roller test bench. (orig.)

16. Dynamic programming approach to optimization of approximate decision rules

KAUST Repository

Amin, Talha

2013-02-01

This paper is devoted to the study of an extension of dynamic programming approach which allows sequential optimization of approximate decision rules relative to the length and coverage. We introduce an uncertainty measure R(T) which is the number of unordered pairs of rows with different decisions in the decision table T. For a nonnegative real number β, we consider β-decision rules that localize rows in subtables of T with uncertainty at most β. Our algorithm constructs a directed acyclic graph Δβ(T) which nodes are subtables of the decision table T given by systems of equations of the kind "attribute = value". This algorithm finishes the partitioning of a subtable when its uncertainty is at most β. The graph Δβ(T) allows us to describe the whole set of so-called irredundant β-decision rules. We can describe all irredundant β-decision rules with minimum length, and after that among these rules describe all rules with maximum coverage. We can also change the order of optimization. The consideration of irredundant rules only does not change the results of optimization. This paper contains also results of experiments with decision tables from UCI Machine Learning Repository. © 2012 Elsevier Inc. All rights reserved.

17. Simulation-based optimization of thermal systems

International Nuclear Information System (INIS)

Jaluria, Yogesh

2009-01-01

This paper considers the design and optimization of thermal systems on the basis of the mathematical and numerical modeling of the system. Many complexities are often encountered in practical thermal processes and systems, making the modeling challenging and involved. These include property variations, complicated regions, combined transport mechanisms, chemical reactions, and intricate boundary conditions. The paper briefly presents approaches that may be used to accurately simulate these systems. Validation of the numerical model is a particularly critical aspect and is discussed. It is important to couple the modeling with the system performance, design, control and optimization. This aspect, which has often been ignored in the literature, is considered in this paper. Design of thermal systems based on concurrent simulation and experimentation is also discussed in terms of dynamic data-driven optimization methods. Optimization of the system and of the operating conditions is needed to minimize costs and improve product quality and system performance. Different optimization strategies that are currently used for thermal systems are outlined, focusing on new and emerging strategies. Of particular interest is multi-objective optimization, since most thermal systems involve several important objective functions, such as heat transfer rate and pressure in electronic cooling systems. A few practical thermal systems are considered in greater detail to illustrate these approaches and to present typical simulation, design and optimization results

18. An MILP-Based Cross-Layer Optimization for a Multi-Reader Arbitration in the UHF RFID System

Science.gov (United States)

Choi, Jinchul; Lee, Chaewoo

2011-01-01

In RFID systems, the performance of each reader such as interrogation range and tag recognition rate may suffer from interferences from other readers. Since the reader interference can be mitigated by output signal power control, spectral and/or temporal separation among readers, the system performance depends on how to adapt the various reader arbitration metrics such as time, frequency, and output power to the system environment. However, complexity and difficulty of the optimization problem increase with respect to the variety of the arbitration metrics. Thus, most proposals in previous study have been suggested to primarily prevent the reader collision with consideration of one or two arbitration metrics. In this paper, we propose a novel cross-layer optimization design based on the concept of combining time division, frequency division, and power control not only to solve the reader interference problem, but also to achieve the multiple objectives such as minimum interrogation delay, maximum reader utilization, and energy efficiency. Based on the priority of the multiple objectives, our cross-layer design optimizes the system sequentially by means of the mixed-integer linear programming. In spite of the multi-stage optimization, the optimization design is formulated as a concise single mathematical form by properly assigning a weight to each objective. Numerical results demonstrate the effectiveness of the proposed optimization design. PMID:22163743

19. An MILP-Based Cross-Layer Optimization for a Multi-Reader Arbitration in the UHF RFID System

Directory of Open Access Journals (Sweden)

Chaewoo Lee

2011-02-01

Full Text Available In RFID systems, the performance of each reader such as interrogation range and tag recognition rate may suffer from interferences from other readers. Since the reader interference can be mitigated by output signal power control, spectral and/or temporal separation among readers, the system performance depends on how to adapt the various reader arbitration metrics such as time, frequency, and output power to the system environment. However, complexity and difficulty of the optimization problem increase with respect to the variety of the arbitration metrics. Thus, most proposals in previous study have been suggested to primarily prevent the reader collision with consideration of one or two arbitration metrics. In this paper, we propose a novel cross-layer optimization design based on the concept of combining time division, frequency division, and power control not only to solve the reader interference problem, but also to achieve the multiple objectives such as minimum interrogation delay, maximum reader utilization, and energy efficiency. Based on the priority of the multiple objectives, our cross-layer design optimizes the system sequentially by means of the mixed-integer linear programming. In spite of the multi-stage optimization, the optimization design is formulated as a concise single mathematical form by properly assigning a weight to each objective. Numerical results demonstrate the effectiveness of the proposed optimization design.

20. High-resolution temperature-based optimization for hyperthermia treatment planning

International Nuclear Information System (INIS)

Kok, H P; Haaren, P M A van; Kamer, J B Van de; Wiersma, J; Dijk, J D P Van; Crezee, J

2005-01-01

In regional hyperthermia, optimization techniques are valuable in order to obtain amplitude/phase settings for the applicators to achieve maximal tumour heating without toxicity to normal tissue. We implemented a temperature-based optimization technique and maximized tumour temperature with constraints on normal tissue temperature to prevent hot spots. E-field distributions are the primary input for the optimization method. Due to computer limitations we are restricted to a resolution of 1 x 1 x 1 cm 3 for E-field calculations, too low for reliable treatment planning. A major problem is the fact that hot spots at low-resolution (LR) do not always correspond to hot spots at high-resolution (HR), and vice versa. Thus, HR temperature-based optimization is necessary for adequate treatment planning and satisfactory results cannot be obtained with LR strategies. To obtain HR power density (PD) distributions from LR E-field calculations, a quasi-static zooming technique has been developed earlier at the UMC Utrecht. However, quasi-static zooming does not preserve phase information and therefore it does not provide the HR E-field information required for direct HR optimization. We combined quasi-static zooming with the optimization method to obtain a millimetre resolution temperature-based optimization strategy. First we performed a LR (1 cm) optimization and used the obtained settings to calculate the HR (2 mm) PD and corresponding HR temperature distribution. Next, we performed a HR optimization using an estimation of the new HR temperature distribution based on previous calculations. This estimation is based on the assumption that the HR and LR temperature distributions, though strongly different, respond in a similar way to amplitude/phase steering. To verify the newly obtained settings, we calculate the corresponding HR temperature distribution. This method was applied to several clinical situations and found to work very well. Deviations of this estimation method for

1. Topology optimization for nano-photonics

DEFF Research Database (Denmark)

Jensen, Jakob Søndergaard; Sigmund, Ole

2011-01-01

Topology optimization is a computational tool that can be used for the systematic design of photonic crystals, waveguides, resonators, filters and plasmonics. The method was originally developed for mechanical design problems but has within the last six years been applied to a range of photonics...... applications. Topology optimization may be based on finite element and finite difference type modeling methods in both frequency and time domain. The basic idea is that the material density of each element or grid point is a design variable, hence the geometry is parameterized in a pixel-like fashion....... The optimization problem is efficiently solved using mathematical programming-based optimization methods and analytical gradient calculations. The paper reviews the basic procedures behind topology optimization, a large number of applications ranging from photonic crystal design to surface plasmonic devices...

2. Application of static var compensator on large synchronous motors based on linear optimization control design

International Nuclear Information System (INIS)

2003-01-01

This paper describes the application of static var compensators, on an electrical distribution network containing two large synchronous motors, one of which is excited via a three-phase thyristor bridge rectifier. The second machine is excited via a diode bridge rectifier. Based on linear optimization control, the measurable feedback signals are applied to the control system loops of static var compensators and the excitation control loop of the first synchronous motor. The phase equations method was used to develop a computer program to model the distribution network. Computer results were obtained to demonstrate the system performance for some abnormal modes of operation. These results show that employing static var compensators based on the linear optimization control design for electrical distribution networks containing large synchronous motors is beneficial and may be considered a first stage of the system design

3. Technical methods for a risk-informed, performance-based fire protection program at nuclear power plants

International Nuclear Information System (INIS)

Dey, M.K.

1998-01-01

This paper presents a technical review and examination of technical methods that are available for developing a risk-informed, performance-based fire protection program at a nuclear plant. The technical methods include ''engineering tools'' for examining the fire dynamics of fire protection problems, reliability techniques for establishing an optimal fire protection surveillance program, fire computer codes for analyzing important fire protection safety parameters, and risk-informed approaches that can range from drawing qualitative insights from risk information to quantifying the risk impact of alternative fire protection approaches. Based on this technical review and examination, it is concluded that methods for modeling fires, and reliability and fire PRA analyses are currently available to support the initial implementation of simple risk-informed, performance-based approaches in fire protection programs. (author)

4. Technical methods for a risk-informed, performance-based fire protection program at nuclear power plants

International Nuclear Information System (INIS)

Dey, M.K.

2000-01-01

This paper presents a technical review and examination of technical methods that are available for developing a risk-informed, performance-based fire protection program at a nuclear plant. The technical methods include 'engineering tools' for examining the fire dynamics of fire protection problems, reliability techniques for establishing an optimal fire protection surveillance program, fire computer codes for analyzing important fire protection safety parameters, and risk-informed approaches that can range from drawing qualitative insights from risk information to quantifying the risk impact of alternative fire protection approaches. Based on this technical review and examination, it is concluded that methods for modeling fires, and reliability and fire probabilistic risk analyses (PRA) are currently available to support the initial implementation of simple risk-informed, performance-based approaches in fire protection programs. (orig.) [de

5. GA based CNC turning center exploitation process parameters optimization

Directory of Open Access Journals (Sweden)

Z. Car

2009-01-01

Full Text Available This paper presents machining parameters (turning process optimization based on the use of artificial intelligence. To obtain greater efficiency and productivity of the machine tool, optimal cutting parameters have to be obtained. In order to find optimal cutting parameters, the genetic algorithm (GA has been used as an optimal solution finder. Optimization has to yield minimum machining time and minimum production cost, while considering technological and material constrains.

6. Process optimization of friction stir welding based on thermal models

DEFF Research Database (Denmark)

Larsen, Anders Astrup

2010-01-01

This thesis investigates how to apply optimization methods to numerical models of a friction stir welding process. The work is intended as a proof-of-concept using different methods that are applicable to models of high complexity, possibly with high computational cost, and without the possibility...... information of the high-fidelity model. The optimization schemes are applied to stationary thermal models of differing complexity of the friction stir welding process. The optimization problems considered are based on optimizing the temperature field in the workpiece by finding optimal translational speed....... Also an optimization problem based on a microstructure model is solved, allowing the hardness distribution in the plate to be optimized. The use of purely thermal models represents a simplification of the real process; nonetheless, it shows the applicability of the optimization methods considered...

7. A System to Derive Optimal Tree Diameter Increment Models from the Eastwide Forest Inventory Data Base (EFIDB)

Science.gov (United States)

Don C. Bragg

2002-01-01

This article is an introduction to the computer software used by the Potential Relative Increment (PRI) approach to optimal tree diameter growth modeling. These DOS programs extract qualified tree and plot data from the Eastwide Forest Inventory Data Base (EFIDB), calculate relative tree increment, sort for the highest relative increments by diameter class, and...

8. Direct and Mediated Relationships Between Participation in a Telephonic Health Coaching Program and Health Behavior, Life Satisfaction, and Optimism.

Science.gov (United States)

Sears, Lindsay E; Coberley, Carter R; Pope, James E

2016-07-01

The aim of this study was to examine the direct and mediated effects of a telephonic health coaching program on changes to healthy behaviors, life satisfaction, and optimism. This longitudinal correlational study of 4881 individuals investigated simple and mediated relationships between participation in a telephonic health risk coaching program and outcomes from three annual Well-being Assessments. Program participation was directly related to improvements in healthy behaviors, life satisfaction and optimism, and indirect effects of coaching on these variables concurrently and over a one-year time lag were also supported. Given previous research that improvements to life satisfaction, optimism, and health behaviors are valuable for individuals, employers, and communities, a clearer understanding of intervention approaches that may impact these outcomes simultaneously can drive greater program effectiveness and value on investment.

9. Novel Verification Method for Timing Optimization Based on DPSO

Directory of Open Access Journals (Sweden)

Chuandong Chen

2018-01-01

Full Text Available Timing optimization for logic circuits is one of the key steps in logic synthesis. Extant research data are mainly proposed based on various intelligence algorithms. Hence, they are neither comparable with timing optimization data collected by the mainstream electronic design automation (EDA tool nor able to verify the superiority of intelligence algorithms to the EDA tool in terms of optimization ability. To address these shortcomings, a novel verification method is proposed in this study. First, a discrete particle swarm optimization (DPSO algorithm was applied to optimize the timing of the mixed polarity Reed-Muller (MPRM logic circuit. Second, the Design Compiler (DC algorithm was used to optimize the timing of the same MPRM logic circuit through special settings and constraints. Finally, the timing optimization results of the two algorithms were compared based on MCNC benchmark circuits. The timing optimization results obtained using DPSO are compared with those obtained from DC, and DPSO demonstrates an average reduction of 9.7% in the timing delays of critical paths for a number of MCNC benchmark circuits. The proposed verification method directly ascertains whether the intelligence algorithm has a better timing optimization ability than DC.

10. Workshop on Computational Optimization

CERN Document Server

2015-01-01

Our everyday life is unthinkable without optimization. We try to minimize our effort and to maximize the achieved profit. Many real world and industrial problems arising in engineering, economics, medicine and other domains can be formulated as optimization tasks. This volume is a comprehensive collection of extended contributions from the Workshop on Computational Optimization 2013. It presents recent advances in computational optimization. The volume includes important real life problems like parameter settings for controlling processes in bioreactor, resource constrained project scheduling, problems arising in transport services, error correcting codes, optimal system performance and energy consumption and so on. It shows how to develop algorithms for them based on new metaheuristic methods like evolutionary computation, ant colony optimization, constrain programming and others.

11. Reliability-based performance simulation for optimized pavement maintenance

International Nuclear Information System (INIS)

Chou, Jui-Sheng; Le, Thanh-Son

2011-01-01

Roadway pavement maintenance is essential for driver safety and highway infrastructure efficiency. However, regular preventive maintenance and rehabilitation (M and R) activities are extremely costly. Unfortunately, the funds available for the M and R of highway pavement are often given lower priority compared to other national development policies, therefore, available funds must be allocated wisely. Maintenance strategies are typically implemented by optimizing only the cost whilst the reliability of facility performance is neglected. This study proposes a novel algorithm using multi-objective particle swarm optimization (MOPSO) technique to evaluate the cost-reliability tradeoff in a flexible maintenance strategy based on non-dominant solutions. Moreover, a probabilistic model for regression parameters is employed to assess reliability-based performance. A numerical example of a highway pavement project is illustrated to demonstrate the efficacy of the proposed MOPSO algorithms. The analytical results show that the proposed approach can help decision makers to optimize roadway maintenance plans. - Highlights: →A novel algorithm using multi-objective particle swarm optimization technique. → Evaluation of the cost-reliability tradeoff in a flexible maintenance strategy. → A probabilistic model for regression parameters is employed to assess reliability-based performance. → The proposed approach can help decision makers to optimize roadway maintenance plans.

12. Reliability-based performance simulation for optimized pavement maintenance

Energy Technology Data Exchange (ETDEWEB)

Chou, Jui-Sheng, E-mail: jschou@mail.ntust.edu.tw [Department of Construction Engineering, National Taiwan University of Science and Technology (Taiwan Tech), 43 Sec. 4, Keelung Rd., Taipei 106, Taiwan (China); Le, Thanh-Son [Department of Construction Engineering, National Taiwan University of Science and Technology (Taiwan Tech), 43 Sec. 4, Keelung Rd., Taipei 106, Taiwan (China)

2011-10-15

Roadway pavement maintenance is essential for driver safety and highway infrastructure efficiency. However, regular preventive maintenance and rehabilitation (M and R) activities are extremely costly. Unfortunately, the funds available for the M and R of highway pavement are often given lower priority compared to other national development policies, therefore, available funds must be allocated wisely. Maintenance strategies are typically implemented by optimizing only the cost whilst the reliability of facility performance is neglected. This study proposes a novel algorithm using multi-objective particle swarm optimization (MOPSO) technique to evaluate the cost-reliability tradeoff in a flexible maintenance strategy based on non-dominant solutions. Moreover, a probabilistic model for regression parameters is employed to assess reliability-based performance. A numerical example of a highway pavement project is illustrated to demonstrate the efficacy of the proposed MOPSO algorithms. The analytical results show that the proposed approach can help decision makers to optimize roadway maintenance plans. - Highlights: > A novel algorithm using multi-objective particle swarm optimization technique. > Evaluation of the cost-reliability tradeoff in a flexible maintenance strategy. > A probabilistic model for regression parameters is employed to assess reliability-based performance. > The proposed approach can help decision makers to optimize roadway maintenance plans.

13. Swainsonine, a novel fungal metabolite: optimization of fermentative production and bioreactor operations using evolutionary programming.

Science.gov (United States)

Singh, Digar; Kaur, Gurvinder

2014-08-01

The optimization of bioreactor operations towards swainsonine production was performed using an artificial neural network coupled evolutionary program (EP)-based optimization algorithm fitted with experimental one-factor-at-a-time (OFAT) results. The effects of varying agitation (300-500 rpm) and aeration (0.5-2.0 vvm) rates for different incubation hours (72-108 h) were evaluated in bench top bioreactor. Prominent scale-up parameters, gassed power per unit volume (P g/V L, W/m(3)) and volumetric oxygen mass transfer coefficient (K L a, s(-1)) were correlated with optimized conditions. A maximum of 6.59 ± 0.10 μg/mL of swainsonine production was observed at 400 rpm-1.5 vvm at 84 h in OFAT experiments with corresponding P g/VL and K L a values of 91.66 W/m(3) and 341.48 × 10(-4) s(-1), respectively. The EP optimization algorithm predicted a maximum of 10.08 μg/mL of swainsonine at 325.47 rpm, 1.99 vvm and 80.75 h against the experimental production of 7.93 ± 0.52 μg/mL at constant K L a (349.25 × 10(-4) s(-1)) and significantly reduced P g/V L (33.33 W/m(3)) drawn by the impellers.

14. Multi-objective optimization of Stirling engine systems using Front-based Yin-Yang-Pair Optimization

International Nuclear Information System (INIS)

Punnathanam, Varun; Kotecha, Prakash

2017-01-01

Highlights: • Efficient multi-objective optimization algorithm F-YYPO demonstrated. • Three Stirling engine applications with a total of eight cases. • Improvements in the objective function values of up to 30%. • Superior to the popularly used gamultiobj of MATLAB. • F-YYPO has extremely low time complexity. - Abstract: In this work, we demonstrate the performance of Front-based Yin-Yang-Pair Optimization (F-YYPO) to solve multi-objective problems related to Stirling engine systems. The performance of F-YYPO is compared with that of (i) a recently proposed multi-objective optimization algorithm (Multi-Objective Grey Wolf Optimizer) and (ii) an algorithm popularly employed in literature due to its easy accessibility (MATLAB’s inbuilt multi-objective Genetic Algorithm function: gamultiobj). We consider three Stirling engine based optimization problems: (i) the solar-dish Stirling engine system which considers objectives of output power, thermal efficiency and rate of entropy generation; (ii) Stirling engine thermal model which considers the associated irreversibility of the cycle with objectives of output power, thermal efficiency and pressure drop; and finally (iii) an experimentally validated polytropic finite speed thermodynamics based Stirling engine model also with objectives of output power and pressure drop. We observe F-YYPO to be significantly more effective as compared to its competitors in solving the problems, while requiring only a fraction of the computational time required by the other algorithms.

15. Trust regions in Kriging-based optimization with expected improvement

Science.gov (United States)

Regis, Rommel G.

2016-06-01

The Kriging-based Efficient Global Optimization (EGO) method works well on many expensive black-box optimization problems. However, it does not seem to perform well on problems with steep and narrow global minimum basins and on high-dimensional problems. This article develops a new Kriging-based optimization method called TRIKE (Trust Region Implementation in Kriging-based optimization with Expected improvement) that implements a trust-region-like approach where each iterate is obtained by maximizing an Expected Improvement (EI) function within some trust region. This trust region is adjusted depending on the ratio of the actual improvement to the EI. This article also develops the Kriging-based CYCLONE (CYClic Local search in OptimizatioN using Expected improvement) method that uses a cyclic pattern to determine the search regions where the EI is maximized. TRIKE and CYCLONE are compared with EGO on 28 test problems with up to 32 dimensions and on a 36-dimensional groundwater bioremediation application in appendices supplied as an online supplement available at http://dx.doi.org/10.1080/0305215X.2015.1082350. The results show that both algorithms yield substantial improvements over EGO and they are competitive with a radial basis function method.

16. A Mixed Integer Linear Programming Approach to Electrical Stimulation Optimization Problems.

Science.gov (United States)

Abouelseoud, Gehan; Abouelseoud, Yasmine; Shoukry, Amin; Ismail, Nour; Mekky, Jaidaa

2018-02-01

Electrical stimulation optimization is a challenging problem. Even when a single region is targeted for excitation, the problem remains a constrained multi-objective optimization problem. The constrained nature of the problem results from safety concerns while its multi-objectives originate from the requirement that non-targeted regions should remain unaffected. In this paper, we propose a mixed integer linear programming formulation that can successfully address the challenges facing this problem. Moreover, the proposed framework can conclusively check the feasibility of the stimulation goals. This helps researchers to avoid wasting time trying to achieve goals that are impossible under a chosen stimulation setup. The superiority of the proposed framework over alternative methods is demonstrated through simulation examples.

17. Extremum-Seeking Control and Applications A Numerical Optimization-Based Approach

CERN Document Server

Zhang, Chunlei

2012-01-01

Extremum seeking control tracks a varying maximum or minimum in a performance function such as a cost. It attempts to determine the optimal performance of a control system as it operates, thereby reducing downtime and the need for system analysis. Extremum Seeking Control and Applications is divided into two parts. In the first, the authors review existing analog optimization based extremum seeking control including gradient, perturbation and sliding mode based control designs. They then propose a novel numerical optimization based extremum seeking control based on optimization algorithms and state regulation. This control design is developed for simple linear time-invariant systems and then extended for a class of feedback linearizable nonlinear systems. The two main optimization algorithms – line search and trust region methods – are analyzed for robustness. Finite-time and asymptotic state regulators are put forward for linear and nonlinear systems respectively. Further design flexibility is achieved u...

18. Some Properties of Multiple Parameters Linear Programming

Directory of Open Access Journals (Sweden)

Maoqin Li

2010-01-01

Full Text Available We consider a linear programming problem in which the right-hand side vector depends on multiple parameters. We study the characters of the optimal value function and the critical regions based on the concept of the optimal partition. We show that the domain of the optimal value function f can be decomposed into finitely many subsets with disjoint relative interiors, which is different from the result based on the concept of the optimal basis. And any directional derivative of f at any point can be computed by solving a linear programming problem when only an optimal solution is available at the point.

19. Some Properties of Multiple Parameters Linear Programming

Directory of Open Access Journals (Sweden)

Yan Hong

2010-01-01

Full Text Available Abstract We consider a linear programming problem in which the right-hand side vector depends on multiple parameters. We study the characters of the optimal value function and the critical regions based on the concept of the optimal partition. We show that the domain of the optimal value function can be decomposed into finitely many subsets with disjoint relative interiors, which is different from the result based on the concept of the optimal basis. And any directional derivative of at any point can be computed by solving a linear programming problem when only an optimal solution is available at the point.

20. Sizing optimization of skeletal structures using teaching-learning based optimization

Directory of Open Access Journals (Sweden)

Vedat Toğan

2017-03-01

Full Text Available Teaching Learning Based Optimization (TLBO is one of the non-traditional techniques to simulate natural phenomena into a numerical algorithm. TLBO mimics teaching learning process occurring between a teacher and students in a classroom. A parameter named as teaching factor, TF, seems to be the only tuning parameter in TLBO. Although the value of the teaching factor, TF, is determined by an equation, the value of 1 or 2 has been used by the researchers for TF. This study intends to explore the effect of the variation of teaching factor TF on the performances of TLBO. This effect is demonstrated in solving structural optimization problems including truss and frame structures under the stress and displacement constraints. The results indicate that the variation of TF in the TLBO process does not change the results obtained at the end of the optimization procedure when the computational cost of TLBO is ignored.

1. Stochastic optimal control in infinite dimension dynamic programming and HJB equations

CERN Document Server

Fabbri, Giorgio; Święch, Andrzej

2017-01-01

Providing an introduction to stochastic optimal control in infinite dimension, this book gives a complete account of the theory of second-order HJB equations in infinite-dimensional Hilbert spaces, focusing on its applicability to associated stochastic optimal control problems. It features a general introduction to optimal stochastic control, including basic results (e.g. the dynamic programming principle) with proofs, and provides examples of applications. A complete and up-to-date exposition of the existing theory of viscosity solutions and regular solutions of second-order HJB equations in Hilbert spaces is given, together with an extensive survey of other methods, with a full bibliography. In particular, Chapter 6, written by M. Fuhrman and G. Tessitore, surveys the theory of regular solutions of HJB equations arising in infinite-dimensional stochastic control, via BSDEs. The book is of interest to both pure and applied researchers working in the control theory of stochastic PDEs, and in PDEs in infinite ...

2. Comparisons of Energy Management Methods for a Parallel Plug-In Hybrid Electric Vehicle between the Convex Optimization and Dynamic Programming

Directory of Open Access Journals (Sweden)

Renxin Xiao

2018-01-01

Full Text Available This paper proposes a comparison study of energy management methods for a parallel plug-in hybrid electric vehicle (PHEV. Based on detailed analysis of the vehicle driveline, quadratic convex functions are presented to describe the nonlinear relationship between engine fuel-rate and battery charging power at different vehicle speed and driveline power demand. The engine-on power threshold is estimated by the simulated annealing (SA algorithm, and the battery power command is achieved by convex optimization with target of improving fuel economy, compared with the dynamic programming (DP based method and the charging depleting–charging sustaining (CD/CS method. In addition, the proposed control methods are discussed at different initial battery state of charge (SOC values to extend the application. Simulation results validate that the proposed strategy based on convex optimization can save the fuel consumption and reduce the computation burden obviously.

3. A generalized fuzzy credibility-constrained linear fractional programming approach for optimal irrigation water allocation under uncertainty

Science.gov (United States)

Zhang, Chenglong; Guo, Ping

2017-10-01

The vague and fuzzy parametric information is a challenging issue in irrigation water management problems. In response to this problem, a generalized fuzzy credibility-constrained linear fractional programming (GFCCFP) model is developed for optimal irrigation water allocation under uncertainty. The model can be derived from integrating generalized fuzzy credibility-constrained programming (GFCCP) into a linear fractional programming (LFP) optimization framework. Therefore, it can solve ratio optimization problems associated with fuzzy parameters, and examine the variation of results under different credibility levels and weight coefficients of possibility and necessary. It has advantages in: (1) balancing the economic and resources objectives directly; (2) analyzing system efficiency; (3) generating more flexible decision solutions by giving different credibility levels and weight coefficients of possibility and (4) supporting in-depth analysis of the interrelationships among system efficiency, credibility level and weight coefficient. The model is applied to a case study of irrigation water allocation in the middle reaches of Heihe River Basin, northwest China. Therefore, optimal irrigation water allocation solutions from the GFCCFP model can be obtained. Moreover, factorial analysis on the two parameters (i.e. λ and γ) indicates that the weight coefficient is a main factor compared with credibility level for system efficiency. These results can be effective for support reasonable irrigation water resources management and agricultural production.

4. An adaptive multi-spline refinement algorithm in simulation based sailboat trajectory optimization using onboard multi-core computer systems

Directory of Open Access Journals (Sweden)

Dębski Roman

2016-06-01

Full Text Available A new dynamic programming based parallel algorithm adapted to on-board heterogeneous computers for simulation based trajectory optimization is studied in the context of “high-performance sailing”. The algorithm uses a new discrete space of continuously differentiable functions called the multi-splines as its search space representation. A basic version of the algorithm is presented in detail (pseudo-code, time and space complexity, search space auto-adaptation properties. Possible extensions of the basic algorithm are also described. The presented experimental results show that contemporary heterogeneous on-board computers can be effectively used for solving simulation based trajectory optimization problems. These computers can be considered micro high performance computing (HPC platforms-they offer high performance while remaining energy and cost efficient. The simulation based approach can potentially give highly accurate results since the mathematical model that the simulator is built upon may be as complex as required. The approach described is applicable to many trajectory optimization problems due to its black-box represented performance measure and use of OpenCL.

5. Global stability-based design optimization of truss structures using ...

Furthermore, a pure pareto-ranking based multi-objective optimization model is employed for the design optimization of the truss structure with multiple objectives. The computational performance of the optimization model is increased by implementing an island model into its evolutionary search mechanism. The proposed ...

6. Ticket Fare Optimization for China’s High-Speed Railway Based on Passenger Choice Behavior

Directory of Open Access Journals (Sweden)

Jinzi Zheng

2017-01-01

Full Text Available Although China’s high-speed railway (HSR is maturing after more than ten years of construction and development, the load factor and revenue of HSR could still be improved by optimizing the ticket fare structure. Different from the present unitary and changeless fare structure, this paper explores the application of multigrade fares to China’s HSR. On the premise that only one fare grade can be offered for each origin-destination (O-D at the same time, this paper addresses the questions of how to adjust ticket price over time to maximize the revenue. First, on the basis of piecewise pricing strategy, a ticket fare optimization model is built, which could be transformed to convex program to be solved. Then, based on the analysis of passenger arrival regularity using historical ticket data of Beijing-Shanghai HSR line, several experiments are performed using the method proposed in the paper to explore the properties of the optimal multigrade fare scheme.

7. Translator for Optimizing Fluid-Handling Components

Science.gov (United States)

Landon, Mark; Perry, Ernest

2007-01-01

A software interface has been devised to facilitate optimization of the shapes of valves, elbows, fittings, and other components used to handle fluids under extreme conditions. This software interface translates data files generated by PLOT3D (a NASA grid-based plotting-and- data-display program) and by computational fluid dynamics (CFD) software into a format in which the files can be read by Sculptor, which is a shape-deformation- and-optimization program. Sculptor enables the user to interactively, smoothly, and arbitrarily deform the surfaces and volumes in two- and three-dimensional CFD models. Sculptor also includes design-optimization algorithms that can be used in conjunction with the arbitrary-shape-deformation components to perform automatic shape optimization. In the optimization process, the output of the CFD software is used as feedback while the optimizer strives to satisfy design criteria that could include, for example, improved values of pressure loss, velocity, flow quality, mass flow, etc.

8. Automatic Multi-Level Thresholding Segmentation Based on Multi-Objective Optimization

Directory of Open Access Journals (Sweden)

L. DJEROU,

2012-01-01

Full Text Available In this paper, we present a new multi-level image thresholding technique, called Automatic Threshold based on Multi-objective Optimization "ATMO" that combines the flexibility of multi-objective fitness functions with the power of a Binary Particle Swarm Optimization algorithm "BPSO", for searching the "optimum" number of the thresholds and simultaneously the optimal thresholds of three criteria: the between-class variances criterion, the minimum error criterion and the entropy criterion. Some examples of test images are presented to compare our segmentation method, based on the multi-objective optimization approach with Otsu’s, Kapur’s and Kittler’s methods. Our experimental results show that the thresholding method based on multi-objective optimization is more efficient than the classical Otsu’s, Kapur’s and Kittler’s methods.

9. Discounted cost model for condition-based maintenance optimization

International Nuclear Information System (INIS)

Weide, J.A.M. van der; Pandey, M.D.; Noortwijk, J.M. van

2010-01-01

This paper presents methods to evaluate the reliability and optimize the maintenance of engineering systems that are damaged by shocks or transients arriving randomly in time and overall degradation is modeled as a cumulative stochastic point process. The paper presents a conceptually clear and comprehensive derivation of formulas for computing the discounted cost associated with a maintenance policy combining both condition-based and age-based criteria for preventive maintenance. The proposed discounted cost model provides a more realistic basis for optimizing the maintenance policies than those based on the asymptotic, non-discounted cost rate criterion.

10. Approximate labeling via graph cuts based on linear programming.

Science.gov (United States)

Komodakis, Nikos; Tziritas, Georgios

2007-08-01

A new framework is presented for both understanding and developing graph-cut-based combinatorial algorithms suitable for the approximate optimization of a very wide class of Markov Random Fields (MRFs) that are frequently encountered in computer vision. The proposed framework utilizes tools from the duality theory of linear programming in order to provide an alternative and more general view of state-of-the-art techniques like the \\alpha-expansion algorithm, which is included merely as a special case. Moreover, contrary to \\alpha-expansion, the derived algorithms generate solutions with guaranteed optimality properties for a much wider class of problems, for example, even for MRFs with nonmetric potentials. In addition, they are capable of providing per-instance suboptimality bounds in all occasions, including discrete MRFs with an arbitrary potential function. These bounds prove to be very tight in practice (that is, very close to 1), which means that the resulting solutions are almost optimal. Our algorithms' effectiveness is demonstrated by presenting experimental results on a variety of low-level vision tasks, such as stereo matching, image restoration, image completion, and optical flow estimation, as well as on synthetic problems.

11. Optimal depth-based regional frequency analysis

Science.gov (United States)

Wazneh, H.; Chebana, F.; Ouarda, T. B. M. J.

2013-06-01

Classical methods of regional frequency analysis (RFA) of hydrological variables face two drawbacks: (1) the restriction to a particular region which can lead to a loss of some information and (2) the definition of a region that generates a border effect. To reduce the impact of these drawbacks on regional modeling performance, an iterative method was proposed recently, based on the statistical notion of the depth function and a weight function φ. This depth-based RFA (DBRFA) approach was shown to be superior to traditional approaches in terms of flexibility, generality and performance. The main difficulty of the DBRFA approach is the optimal choice of the weight function ϕ (e.g., φ minimizing estimation errors). In order to avoid a subjective choice and naïve selection procedures of φ, the aim of the present paper is to propose an algorithm-based procedure to optimize the DBRFA and automate the choice of ϕ according to objective performance criteria. This procedure is applied to estimate flood quantiles in three different regions in North America. One of the findings from the application is that the optimal weight function depends on the considered region and can also quantify the region's homogeneity. By comparing the DBRFA to the canonical correlation analysis (CCA) method, results show that the DBRFA approach leads to better performances both in terms of relative bias and mean square error.

12. Derived heuristics-based consistent optimization of material flow in a gold processing plant

Science.gov (United States)

Myburgh, Christie; Deb, Kalyanmoy

2018-01-01

Material flow in a chemical processing plant often follows complicated control laws and involves plant capacity constraints. Importantly, the process involves discrete scenarios which when modelled in a programming format involves if-then-else statements. Therefore, a formulation of an optimization problem of such processes becomes complicated with nonlinear and non-differentiable objective and constraint functions. In handling such problems using classical point-based approaches, users often have to resort to modifications and indirect ways of representing the problem to suit the restrictions associated with classical methods. In a particular gold processing plant optimization problem, these facts are demonstrated by showing results from MATLAB®'s well-known fmincon routine. Thereafter, a customized evolutionary optimization procedure which is capable of handling all complexities offered by the problem is developed. Although the evolutionary approach produced results with comparatively less variance over multiple runs, the performance has been enhanced by introducing derived heuristics associated with the problem. In this article, the development and usage of derived heuristics in a practical problem are presented and their importance in a quick convergence of the overall algorithm is demonstrated.

13. Recent Progress on Data-Based Optimization for Mineral Processing Plants

Directory of Open Access Journals (Sweden)

Jinliang Ding

2017-04-01

Full Text Available In the globalized market environment, increasingly significant economic and environmental factors within complex industrial plants impose importance on the optimization of global production indices; such optimization includes improvements in production efficiency, product quality, and yield, along with reductions of energy and resource usage. This paper briefly overviews recent progress in data-driven hybrid intelligence optimization methods and technologies in improving the performance of global production indices in mineral processing. First, we provide the problem description. Next, we summarize recent progress in data-based optimization for mineral processing plants. This optimization consists of four layers: optimization of the target values for monthly global production indices, optimization of the target values for daily global production indices, optimization of the target values for operational indices, and automation systems for unit processes. We briefly overview recent progress in each of the different layers. Finally, we point out opportunities for future works in data-based optimization for mineral processing plants.

14. A Goal Programming Optimization Model for The Allocation of Liquid Steel Production

Science.gov (United States)

Hapsari, S. N.; Rosyidi, C. N.

2018-03-01

This research was conducted in one of the largest steel companies in Indonesia which has several production units and produces a wide range of steel products. One of the important products in the company is billet steel. The company has four Electric Arc Furnace (EAF) which produces liquid steel which must be procesed further to be billet steel. The billet steel plant needs to make their production process more efficient to increase the productvity. The management has four goals to be achieved and hence the optimal allocation of the liquid steel production is needed to achieve those goals. In this paper, a goal programming optimization model is developed to determine optimal allocation of liquid steel production in each EAF, to satisfy demand in 3 periods and the company goals, namely maximizing the volume of production, minimizing the cost of raw materials, minimizing maintenance costs, maximizing sales revenues, and maximizing production capacity. From the results of optimization, only maximizing production capacity goal can not achieve the target. However, the model developed in this papare can optimally allocate liquid steel so the allocation of production does not exceed the maximum capacity of the machine work hours and maximum production capacity.

15. Elitism set based particle swarm optimization and its application

Directory of Open Access Journals (Sweden)

Yanxia Sun

2017-01-01

Full Text Available Topology plays an important role for Particle Swarm Optimization (PSO to achieve good optimization performance. It is difficult to find one topology structure for the particles to achieve better optimization performance than the others since the optimization performance not only depends on the searching abilities of the particles, also depends on the type of the optimization problems. Three elitist set based PSO algorithm without using explicit topology structure is proposed in this paper. An elitist set, which is based on the individual best experience, is used to communicate among the particles. Moreover, to avoid the premature of the particles, different statistical methods have been used in these three proposed methods. The performance of the proposed PSOs is compared with the results of the standard PSO 2011 and several PSO with different topologies, and the simulation results and comparisons demonstrate that the proposed PSO with adaptive probabilistic preference can achieve good optimization performance.

16. Group search optimiser-based optimal bidding strategies with no Karush-Kuhn-Tucker optimality conditions

Science.gov (United States)

Yadav, Naresh Kumar; Kumar, Mukesh; Gupta, S. K.

2017-03-01

General strategic bidding procedure has been formulated in the literature as a bi-level searching problem, in which the offer curve tends to minimise the market clearing function and to maximise the profit. Computationally, this is complex and hence, the researchers have adopted Karush-Kuhn-Tucker (KKT) optimality conditions to transform the model into a single-level maximisation problem. However, the profit maximisation problem with KKT optimality conditions poses great challenge to the classical optimisation algorithms. The problem has become more complex after the inclusion of transmission constraints. This paper simplifies the profit maximisation problem as a minimisation function, in which the transmission constraints, the operating limits and the ISO market clearing functions are considered with no KKT optimality conditions. The derived function is solved using group search optimiser (GSO), a robust population-based optimisation algorithm. Experimental investigation is carried out on IEEE 14 as well as IEEE 30 bus systems and the performance is compared against differential evolution-based strategic bidding, genetic algorithm-based strategic bidding and particle swarm optimisation-based strategic bidding methods. The simulation results demonstrate that the obtained profit maximisation through GSO-based bidding strategies is higher than the other three methods.

17. Optimizing block-based maintenance under random machine usage

NARCIS (Netherlands)

de Jonge, Bram; Jakobsons, Edgars

Existing studies on maintenance optimization generally assume that machines are either used continuously, or that times until failure do not depend on the actual usage. In practice, however, these assumptions are often not realistic. In this paper, we consider block-based maintenance optimization

18. Modifications of ORNL's computer programs MSF-21 and VTE-21 for the evaluation and rapid optimization of multistage flash and vertical tube evaporators

Energy Technology Data Exchange (ETDEWEB)

Glueckstern, P.; Wilson, J.V.; Reed, S.A.

1976-06-01

Design and cost modifications were made to ORNL's Computer Programs MSF-21 and VTE-21 originally developed for the rapid calculation and design optimization of multistage flash (MSF) and multieffect vertical tube evaporator (VTE) desalination plants. The modifications include additional design options to make possible the evaluation of desalting plants based on current technology (the original programs were based on conceptual designs applying advanced and not yet proven technological developments and design features) and new materials and equipment costs updated to mid-1975.

19. A Two-Stage Robust Optimization for Centralized-Optimal Dispatch of Photovoltaic Inverters in Active Distribution Networks

DEFF Research Database (Denmark)

Ding, Tao; Li, Cheng; Yang, Yongheng

2017-01-01

Optimally dispatching Photovoltaic (PV) inverters is an efficient way to avoid overvoltage in active distribution networks, which may occur in the case of PV generation surplus load demand. Typically, the dispatching optimization objective is to identify critical PV inverters that have the most...... nature of solar PV energy may affect the selection of the critical PV inverters and also the final optimal objective value. In order to address this issue, a two-stage robust optimization model is proposed in this paper to achieve a robust optimal solution to the PV inverter dispatch, which can hedge...... against any possible realization within the uncertain PV outputs. In addition, the conic relaxation-based branch flow formulation and second-order cone programming based column-and-constraint generation algorithm are employed to deal with the proposed robust optimization model. Case studies on a 33-bus...

20. Rapid Optimal Generation Algorithm for Terrain Following Trajectory Based on Optimal Control

Institute of Scientific and Technical Information of China (English)

杨剑影; 张海; 谢邦荣; 尹健

2004-01-01

Based on the optimal control theory, a 3-dimensionnal direct generation algorithm is proposed for anti-ground low altitude penetration tasks under complex terrain. By optimizing the terrain following(TF) objective function,terrain coordinate system, missile dynamic model and control vector, the TF issue is turning into the improved optimal control problem whose mathmatical model is simple and need not solve the second order terrain derivative. Simulation results prove that this method is reasonable and feasible. The TF precision is in the scope from 0.3 m to 3.0 m,and the planning time is less than 30 min. This method have the strongpionts such as rapidness, precision and has great application value.

1. Stochastic goal programming based groundwater remediation management under human-health-risk uncertainty

International Nuclear Information System (INIS)

Li, Jing; He, Li; Lu, Hongwei; Fan, Xing

2014-01-01

Highlights: • We propose an integrated optimal groundwater remediation design approach. • The approach can address stochasticity in carcinogenic risks. • Goal programming is used to make the system approaching to ideal operation and remediation effects. • The uncertainty in slope factor is evaluated under different confidence levels. • Optimal strategies are obtained to support remediation design under uncertainty. - Abstract: An optimal design approach for groundwater remediation is developed through incorporating numerical simulation, health risk assessment, uncertainty analysis and nonlinear optimization within a general framework. Stochastic analysis and goal programming are introduced into the framework to handle uncertainties in real-world groundwater remediation systems. Carcinogenic risks associated with remediation actions are further evaluated at four confidence levels. The differences between ideal and predicted constraints are minimized by goal programming. The approach is then applied to a contaminated site in western Canada for creating a set of optimal remediation strategies. Results from the case study indicate that factors including environmental standards, health risks and technical requirements mutually affected and restricted themselves. Stochastic uncertainty existed in the entire process of remediation optimization, which should to be taken into consideration in groundwater remediation design

2. Surrogate-Based Optimization of Biogeochemical Transport Models

Science.gov (United States)

Prieß, Malte; Slawig, Thomas

2010-09-01

First approaches towards a surrogate-based optimization method for a one-dimensional marine biogeochemical model of NPZD type are presented. The model, developed by Oschlies and Garcon [1], simulates the distribution of nitrogen, phytoplankton, zooplankton and detritus in a water column and is driven by ocean circulation data. A key issue is to minimize the misfit between the model output and given observational data. Our aim is to reduce the overall optimization cost avoiding expensive function and derivative evaluations by using a surrogate model replacing the high-fidelity model in focus. This in particular becomes important for more complex three-dimensional models. We analyse a coarsening in the discretization of the model equations as one way to create such a surrogate. Here the numerical stability crucially depends upon the discrete stepsize in time and space and the biochemical terms. We show that for given model parameters the level of grid coarsening can be choosen accordingly yielding a stable and satisfactory surrogate. As one example of a surrogate-based optimization method we present results of the Aggressive Space Mapping technique (developed by John W. Bandler [2, 3]) applied to the optimization of this one-dimensional biogeochemical transport model.

3. High-performance simulation-based algorithms for an alpine ski racer’s trajectory optimization in heterogeneous computer systems

Directory of Open Access Journals (Sweden)

Dębski Roman

2014-09-01

Full Text Available Effective, simulation-based trajectory optimization algorithms adapted to heterogeneous computers are studied with reference to the problem taken from alpine ski racing (the presented solution is probably the most general one published so far. The key idea behind these algorithms is to use a grid-based discretization scheme to transform the continuous optimization problem into a search problem over a specially constructed finite graph, and then to apply dynamic programming to find an approximation of the global solution. In the analyzed example it is the minimum-time ski line, represented as a piecewise-linear function (a method of elimination of unfeasible solutions is proposed. Serial and parallel versions of the basic optimization algorithm are presented in detail (pseudo-code, time and memory complexity. Possible extensions of the basic algorithm are also described. The implementation of these algorithms is based on OpenCL. The included experimental results show that contemporary heterogeneous computers can be treated as μ-HPC platforms-they offer high performance (the best speedup was equal to 128 while remaining energy and cost efficient (which is crucial in embedded systems, e.g., trajectory planners of autonomous robots. The presented algorithms can be applied to many trajectory optimization problems, including those having a black-box represented performance measure

4. Evaluation of a Hospital-Based Pneumonia Nurse Navigator Program.

Science.gov (United States)

Seldon, Lisa E; McDonough, Kelly; Turner, Barbara; Simmons, Leigh Ann

2016-12-01

The aim of this study is to evaluate the effectiveness of a hospital-based pneumonia nurse navigator program. This study used a retrospective, formative evaluation. Data of patients admitted from January 2012 through December 2014 to a large community hospital with a primary or secondary diagnosis of pneumonia, excluding aspiration pneumonia, were used. Data included patient demographics, diagnoses, insurance coverage, core measures, average length of stay (ALOS), disposition, readmission rate, financial outcomes, and patient barriers to care were collected. Descriptive statistics and parametric testing were used to analyze data. Core measure performance was sustained at the 90th percentile 2 years after the implementation of the navigator program. The ALOS did not decrease to established benchmarks; however, the SD for ALOS decreased by nearly half after implementation of the navigator program, suggesting the program decreased the number and length of extended stays. Charges per case decreased by 21% from 2012 to 2014. Variable costs decreased by 4% over a 2-year period, which increased net profit per case by 5%. Average readmission payments increased by 8% from 2012 to 2014, and the net revenue per case increased by 8.3%. The pneumonia nurse navigator program may improve core measures, reduce ALOS, and increase net revenue. Future evaluations are necessary to substantiate these findings and optimize the cost and quality performance of navigator programs.

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

International Nuclear Information System (INIS)

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

2014-01-01

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

6. Differential Spatio-temporal Multiband Satellite Image Clustering using K-means Optimization With Reinforcement Programming

Directory of Open Access Journals (Sweden)

Irene Erlyn Wina Rachmawan

2015-06-01

Full Text Available Deforestration is one of the crucial issues in Indonesia because now Indonesia has world's highest deforestation rate. In other hand, multispectral image delivers a great source of data for studying spatial and temporal changeability of the environmental such as deforestration area. This research present differential image processing methods for detecting nature change of deforestration. Our differential image processing algorithms extract and indicating area automatically. The feature of our proposed idea produce extracted information from multiband satellite image and calculate the area of deforestration by years with calculating data using temporal dataset. Yet, multiband satellite image consists of big data size that were difficult to be handled for segmentation. Commonly, K- Means clustering is considered to be a powerfull clustering algorithm because of its ability to clustering big data. However K-Means has sensitivity of its first generated centroids, which could lead into a bad performance. In this paper we propose a new approach to optimize K-Means clustering using Reinforcement Programming in order to clustering multispectral image. We build a new mechanism for generating initial centroids by implementing exploration and exploitation knowledge from Reinforcement Programming. This optimization will lead a better result for K-means data cluster. We select multispectral image from Landsat 7 in past ten years in Medawai, Borneo, Indonesia, and apply two segmentation areas consist of deforestration land and forest field. We made series of experiments and compared the experimental results of K-means using Reinforcement Programming as optimizing initiate centroid and normal K-means without optimization process. Keywords: Deforestration, Multispectral images, landsat, automatic clustering, K-means.

7. Optimizing Crawler4j using MapReduce Programming Model

Science.gov (United States)

Siddesh, G. M.; Suresh, Kavya; Madhuri, K. Y.; Nijagal, Madhushree; Rakshitha, B. R.; Srinivasa, K. G.

2017-06-01

World wide web is a decentralized system that consists of a repository of information on the basis of web pages. These web pages act as a source of information or data in the present analytics world. Web crawlers are used for extracting useful information from web pages for different purposes. Firstly, it is used in web search engines where the web pages are indexed to form a corpus of information and allows the users to query on the web pages. Secondly, it is used for web archiving where the web pages are stored for later analysis phases. Thirdly, it can be used for web mining where the web pages are monitored for copyright purposes. The amount of information processed by the web crawler needs to be improved by using the capabilities of modern parallel processing technologies. In order to solve the problem of parallelism and the throughput of crawling this work proposes to optimize the Crawler4j using the Hadoop MapReduce programming model by parallelizing the processing of large input data. Crawler4j is a web crawler that retrieves useful information about the pages that it visits. The crawler Crawler4j coupled with data and computational parallelism of Hadoop MapReduce programming model improves the throughput and accuracy of web crawling. The experimental results demonstrate that the proposed solution achieves significant improvements with respect to performance and throughput. Hence the proposed approach intends to carve out a new methodology towards optimizing web crawling by achieving significant performance gain.

8. Factors associated with the implementation of community-based peer-led health promotion programs: A scoping review.

Science.gov (United States)

Lorthios-Guilledroit, Agathe; Richard, Lucie; Filiatrault, Johanne

2018-06-01

Peer education is growing in popularity as a useful health promotion strategy. However, optimal conditions for implementing peer-led health promotion programs (HPPs) remain unclear. This scoping review aimed to describe factors that can influence implementation of peer-led HPPs targeting adult populations. Five databases were searched using the keywords "health promotion/prevention", "implementation", "peers", and related terms. Studies were included if they reported at least one factor associated with the implementation of community-based peer-led HPPs. Fifty-five studies were selected for the analysis. The method known as "best fit framework synthesis" was used to analyze the factors identified in the selected papers. Many factors included in existing implementation conceptual frameworks were deemed applicable to peer-led HPPs. However, other factors related to individuals, programs, and implementation context also emerged from the analysis. Based on this synthesis, an adapted theoretical framework was elaborated, grounded in a complex adaptive system perspective and specifying potential mechanisms through which factors may influence implementation of community-based peer-led HPPs. Further research is needed to test the theoretical framework against empirical data. Findings from this scoping review increase our knowledge of the optimal conditions for implementing peer-led HPPs and thereby maximizing the benefits of such programs. Copyright © 2018 Elsevier Ltd. All rights reserved.

9. Reliability-Based Structural Optimization of Wave Energy Converters

Directory of Open Access Journals (Sweden)

Simon Ambühl

2014-12-01

Full Text Available More and more wave energy converter (WEC concepts are reaching prototypelevel. Once the prototype level is reached, the next step in order to further decrease thelevelized cost of energy (LCOE is optimizing the overall system with a focus on structuraland maintenance (inspection costs, as well as on the harvested power from the waves.The target of a fully-developed WEC technology is not maximizing its power output,but minimizing the resulting LCOE. This paper presents a methodology to optimize thestructural design of WECs based on a reliability-based optimization problem and the intentto maximize the investor’s benefits by maximizing the difference between income (e.g., fromselling electricity and the expected expenses (e.g., structural building costs or failure costs.Furthermore, different development levels, like prototype or commercial devices, may havedifferent main objectives and will be located at different locations, as well as receive varioussubsidies. These points should be accounted for when performing structural optimizationsof WECs. An illustrative example on the gravity-based foundation of the Wavestar deviceis performed showing how structural design can be optimized taking target reliability levelsand different structural failure modes due to extreme loads into account.

10. Workshop on Computational Optimization

CERN Document Server

2016-01-01

This volume is a comprehensive collection of extended contributions from the Workshop on Computational Optimization 2014, held at Warsaw, Poland, September 7-10, 2014. The book presents recent advances in computational optimization. The volume includes important real problems like parameter settings for controlling processes in bioreactor and other processes, resource constrained project scheduling, infection distribution, molecule distance geometry, quantum computing, real-time management and optimal control, bin packing, medical image processing, localization the abrupt atmospheric contamination source and so on. It shows how to develop algorithms for them based on new metaheuristic methods like evolutionary computation, ant colony optimization, constrain programming and others. This research demonstrates how some real-world problems arising in engineering, economics, medicine and other domains can be formulated as optimization tasks.

11. An Evidence-Based Assessment of Faith-Based Programs: Do Faith-Based Programs "Work" to Reduce Recidivism?

Science.gov (United States)

Dodson, Kimberly D.; Cabage, Leann N.; Klenowski, Paul M.

2011-01-01

Faith-based organizations administer many of the prison-based programs aimed at reducing recidivism. Many of these organizations also manage treatment programs for substance abusers, at-risk juveniles, and ex-offenders. Much of the research on religiosity and delinquency indicates that the two are inversely related. Therefore, it seems plausible…

12. Empty tracks optimization based on Z-Map model

Science.gov (United States)

Liu, Le; Yan, Guangrong; Wang, Zaijun; Zang, Genao

2017-12-01

For parts with many features, there are more empty tracks during machining. If these tracks are not optimized, the machining efficiency will be seriously affected. In this paper, the characteristics of the empty tracks are studied in detail. Combining with the existing optimization algorithm, a new tracks optimization method based on Z-Map model is proposed. In this method, the tool tracks are divided into the unit processing section, and then the Z-Map model simulation technique is used to analyze the order constraint between the unit segments. The empty stroke optimization problem is transformed into the TSP with sequential constraints, and then through the genetic algorithm solves the established TSP problem. This kind of optimization method can not only optimize the simple structural parts, but also optimize the complex structural parts, so as to effectively plan the empty tracks and greatly improve the processing efficiency.

13. On-orbit servicing system assessment and optimization methods based on lifecycle simulation under mixed aleatory and epistemic uncertainties

Science.gov (United States)

Yao, Wen; Chen, Xiaoqian; Huang, Yiyong; van Tooren, Michel

2013-06-01

To assess the on-orbit servicing (OOS) paradigm and optimize its utilities by taking advantage of its inherent flexibility and responsiveness, the OOS system assessment and optimization methods based on lifecycle simulation under uncertainties are studied. The uncertainty sources considered in this paper include both the aleatory (random launch/OOS operation failure and on-orbit component failure) and the epistemic (the unknown trend of the end-used market price) types. Firstly, the lifecycle simulation under uncertainties is discussed. The chronological flowchart is presented. The cost and benefit models are established, and the uncertainties thereof are modeled. The dynamic programming method to make optimal decision in face of the uncertain events is introduced. Secondly, the method to analyze the propagation effects of the uncertainties on the OOS utilities is studied. With combined probability and evidence theory, a Monte Carlo lifecycle Simulation based Unified Uncertainty Analysis (MCS-UUA) approach is proposed, based on which the OOS utility assessment tool under mixed uncertainties is developed. Thirdly, to further optimize the OOS system under mixed uncertainties, the reliability-based optimization (RBO) method is studied. To alleviate the computational burden of the traditional RBO method which involves nested optimum search and uncertainty analysis, the framework of Sequential Optimization and Mixed Uncertainty Analysis (SOMUA) is employed to integrate MCS-UUA, and the RBO algorithm SOMUA-MCS is developed. Fourthly, a case study on the OOS system for a hypothetical GEO commercial communication satellite is investigated with the proposed assessment tool. Furthermore, the OOS system is optimized with SOMUA-MCS. Lastly, some conclusions are given and future research prospects are highlighted.

14. Pareto-Ranking Based Quantum-Behaved Particle Swarm Optimization for Multiobjective Optimization

Directory of Open Access Journals (Sweden)

Na Tian

2015-01-01

Full Text Available A study on pareto-ranking based quantum-behaved particle swarm optimization (QPSO for multiobjective optimization problems is presented in this paper. During the iteration, an external repository is maintained to remember the nondominated solutions, from which the global best position is chosen. The comparison between different elitist selection strategies (preference order, sigma value, and random selection is performed on four benchmark functions and two metrics. The results demonstrate that QPSO with preference order has comparative performance with sigma value according to different number of objectives. Finally, QPSO with sigma value is applied to solve multiobjective flexible job-shop scheduling problems.

15. Optimization of microgrids based on controller designing for ...

African Journals Online (AJOL)

The power quality of microgrid during islanded operation is strongly related with the controller performance of DGs. Therefore a new optimal control strategy for distributed generation based inverter to connect to the generalized microgrid is proposed. This work shows developing optimal control algorithms for the DG ...

16. Series Hybrid Electric Vehicle Power System Optimization Based on Genetic Algorithm

Science.gov (United States)

Zhu, Tianjun; Li, Bin; Zong, Changfu; Wu, Yang

2017-09-01

Hybrid electric vehicles (HEV), compared with conventional vehicles, have complex structures and more component parameters. If variables optimization designs are carried on all these parameters, it will increase the difficulty and the convergence of algorithm program, so this paper chooses the parameters which has a major influence on the vehicle fuel consumption to make it all work at maximum efficiency. First, HEV powertrain components modelling are built. Second, taking a tandem hybrid structure as an example, genetic algorithm is used in this paper to optimize fuel consumption and emissions. Simulation results in ADVISOR verify the feasibility of the proposed genetic optimization algorithm.

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

18. Fast Gaussian kernel learning for classification tasks based on specially structured global optimization.

Science.gov (United States)

Zhong, Shangping; Chen, Tianshun; He, Fengying; Niu, Yuzhen

2014-09-01

For a practical pattern classification task solved by kernel methods, the computing time is mainly spent on kernel learning (or training). However, the current kernel learning approaches are based on local optimization techniques, and hard to have good time performances, especially for large datasets. Thus the existing algorithms cannot be easily extended to large-scale tasks. In this paper, we present a fast Gaussian kernel learning method by solving a specially structured global optimization (SSGO) problem. We optimize the Gaussian kernel function by using the formulated kernel target alignment criterion, which is a difference of increasing (d.i.) functions. Through using a power-transformation based convexification method, the objective criterion can be represented as a difference of convex (d.c.) functions with a fixed power-transformation parameter. And the objective programming problem can then be converted to a SSGO problem: globally minimizing a concave function over a convex set. The SSGO problem is classical and has good solvability. Thus, to find the global optimal solution efficiently, we can adopt the improved Hoffman's outer approximation method, which need not repeat the searching procedure with different starting points to locate the best local minimum. Also, the proposed method can be proven to converge to the global solution for any classification task. We evaluate the proposed method on twenty benchmark datasets, and compare it with four other Gaussian kernel learning methods. Experimental results show that the proposed method stably achieves both good time-efficiency performance and good classification performance. Copyright © 2014 Elsevier Ltd. All rights reserved.

19. Three example applications of optimization techniques to Department of Energy contractor radiation protection programs

International Nuclear Information System (INIS)

Merwin, S.E.; Martin, J.B.; Tawil, J.J.; Selby, J.M.

1989-01-01

Six numerical examples of optimization of radiation protection are provided in the appendices of International Commission on Radiological Protection (ICRP) Publication No. 37 (1983). In each case, the calculations were based on well-defined parameters and assumptions. In this paper, we examined three different numerical examples that were based on empirical data and less-certain assumptions. In the first example, the optimum sampling frequency for a typical 3H bioassay program was found to be once every 2 mo. However, this result depended on assumed values for several variables that were difficult to evaluate. The second example showed that the optimum frequency for recalibrating a group of cutie pie (CP) ionization chamber survey instruments was once every 85 d. This result depended largely on the assumption that an improperly operating CP instrument could lead to a serious overexposure. In the third example, one continuous air monitor (CAM) was determined to be the optimum number in a workplace at a Department of Energy (DOE) Pu facility. The optimum location of the CAM was determined from past glove-box release studies. These examples demonstrated that cost-benefit analysis of individual elements of radiation protection programs can be useful even if limited data are available

20. Optimal Meter Placement for Distribution Network State Estimation: A Circuit Representation Based MILP Approach

DEFF Research Database (Denmark)

Chen, Xiaoshuang; Lin, Jin; Wan, Can

2016-01-01

State estimation (SE) in distribution networks is not as accurate as that in transmission networks. Traditionally, distribution networks (DNs) are lack of direct measurements due to the limitations of investments and the difficulties of maintenance. Therefore, it is critical to improve the accuracy...... of SE in distribution networks by placing additional physical meters. For state-of-the-art SE models, it is difficult to clearly quantify measurements' influences on SE errors, so the problems of optimal meter placement for reducing SE errors are mostly solved by heuristic or suboptimal algorithms....... Under this background, this paper proposes a circuit representation model to represent SE errors. Based on the matrix formulation of the circuit representation model, the problem of optimal meter placement can be transformed to a mixed integer linear programming problem (MILP) via the disjunctive model...