Advances in metaheuristics: applications in engineering by Timothy Ganesan, Pandian Vasant, Irraivan Elamvazuthi

By Timothy Ganesan, Pandian Vasant, Irraivan Elamvazuthi

Advances in Metaheuristics: purposes in Engineering Systems presents info on present ways used in engineering optimization. It offers a complete historical past on metaheuristic functions, concentrating on major engineering sectors akin to power, method, and fabrics. It discusses subject matters corresponding to algorithmic improvements and function size methods, and gives insights into the implementation of metaheuristic recommendations to multi-objective optimization difficulties. With this booklet, readers can learn how to clear up real-world engineering optimization difficulties successfully utilizing definitely the right ideas from rising fields together with evolutionary and swarm intelligence, mathematical programming, and multi-objective optimization.

The ten chapters of this e-book are divided into 3 components. the 1st half discusses 3 commercial functions within the strength area. the second one focusses on strategy optimization and considers 3 engineering purposes: optimization of a three-phase separator, procedure plant, and a pre-treatment technique. The 3rd and ultimate a part of this e-book covers commercial purposes in fabric engineering, with a specific concentrate on sand mould-systems. it is usually discussions at the strength development of algorithmic features through strategic algorithmic enhancements.

This e-book is helping fill the present hole in literature at the implementation of metaheuristics in engineering functions and real-world engineering platforms. will probably be a massive source for engineers and decision-makers settling on and enforcing metaheuristics to resolve particular engineering problems.

Show description

Read Online or Download Advances in metaheuristics: applications in engineering systems PDF

Best operations research books

Integer Programming

'Et moi, . .. , so j'avait su remark en revenir, One provider arithmetic has rendered the je n'y serais element al! e. ' human race. It has placed good judgment again Jules Verne the place it belongs, at the topmost shelf subsequent to the dusty canister labelled 'discarded non­ The sequence is divergent; for that reason we can be sense'.

Tabu Search

Confronted with the problem of fixing tough optimization difficulties that abound within the genuine international, classical tools usually stumble upon nice trouble - even if outfitted with a theoretical warrantly of discovering an optimum answer. very important purposes in enterprise, engineering, economics and technology can't be tackled with any moderate wish of luck, inside functional time horizons, by way of answer equipment which have been the principal concentration of educational study in the course of the prior 3 a long time (and that are nonetheless the point of interest of many textbooks).

Integrated Risk Management of Non-Maturing Accounts: Practical Application and Testing of a Dynamic Replication Model

​Customer bills that neither have a hard and fast adulthood nor a hard and fast rate of interest characterize a considerable a part of a shopper bank’s investment. The modelling for his or her threat administration and pricing is a demanding but the most important job in today’s asset/liability administration, with expanding computational strength making an allowance for new ways.

Mastering Data-Intensive Collaboration and Decision Making: Research and practical applications in the Dicode project

This publication reviews on state of the art examine conducted in the context of the EU-funded Dicode venture, which goals at facilitating and augmenting collaboration and selection making in data-intensive and cognitively complicated settings. each time acceptable, Dicode builds on sought after high-performance computing paradigms and big information processing applied sciences to meaningfully seek, study, and mixture info from various, tremendous huge and speedily evolving assets.

Additional resources for Advances in metaheuristics: applications in engineering systems

Sample text

3 Parameter Settings of SA Algorithm No. 1 2 3 4 5 6 7 Parameter Settings Specific Values Initial temperature Maximum number of runs Maximum number of acceptance Maximum number of rejections Temperature reduction value Boltzmann annealing Stopping criteria T0 = 100 runmax = 250 accmax = 125 rejmax = 125 α = 0�95 kB = 1 Tfinal = 10−10 local minima and is thus able to explore globally for more possible solutions� An annealing schedule is selected to systematically decrease the temperature as the algorithm proceeds� As the temperature decreases, the algorithm reduces the extent of its search to converge to a minimum� A programmed SA code was used and its parameters were adjusted so that it could be utilized for finding the optimal TEC design� Choosing good algorithm parameters is very important because it greatly affects the whole optimization process� Parameter settings of SA are listed in Table 1�3� The initial temperature, T0 = 100, should be high enough such that in the first iteration of the algorithm, the probability of accepting a worse solution, is at least 80%� The temperature is the controlled parameter in SA and it is decreased gradually as the algorithm proceeds (Vasant & Barsoum, 2009)� Temperature reduction value α = 0�95 and temperature decrease function is: Tn = αTn−1 (1�39) The numerical experimentation was done with different α values: 0�70, 0�75, 0�85, 0�90, and 0�95 (Abbasi, Niaki, Khalife, & Faize, 2011)� Boltzmann annealing factor, k B, is used in the Metropolis algorithm to calculate the acceptance probability of the points� Maximum number of runs, run max = 250, determines the length of each temperature level T · accmax = 125 determines the maximum number of acceptance of a new solution point and rejmax = 125 determines the maximum number of rejection of a new solution point (run max = accmax + rejmax) (Abbasi et al�, 2011)� The stopping criteria determine when the algorithm reaches the desired energy level� The desired or final stopping temperature is set as Tfinal = 10−10� The SA algorithm is described in the following section and the flowchart of SA algorithm is shown in Figure 1�4� • Step 1: Set the initial parameters and create initial point of the design variables� For SA algorithm, determine required parameters for the algorithm as in Table 1�3� For TEC device, set required parameters such as fixed parameters and boundary constraints of the design variables, and set all the constraints and apply them into penalty function� 20 Advances in Metaheuristics: Applications in Engineering Systems Start Determine required parameters for STEC device and SA algorithm Initialize a random base point of design variable X0 Update T with function Tn = α .

1 HopfIeld Neural Network HNNs are a form of recurrent artificial neural network discovered in the 1980s (Park, Kim, Eom, & Lee, 1993)� The HNN method is based on the minimization of its energy function� Thus, it is very suitable for implementation in optimization problems� In Park et al. (1993), the authors formulated the ED problem with piecewise quadratic cost functions by using the HNN� The results obtained using this method were then compared with those obtained using the hierarchical approach� However, the implementation of the HNN to this problem involved a large number of iterations and often produced oscillations (Lee, Sode-Yome, & Park, 1998)� In Mean-Variance Mapping Optimization for Economic Dispatch 27 Lee et al.

1 2 3 4 5 6 7 Parameter Settings Specific Values Initial temperature Maximum number of runs Maximum number of acceptance Maximum number of rejections Temperature reduction value Boltzmann annealing Stopping criteria T0 = 100 runmax = 250 accmax = 125 rejmax = 125 α = 0�95 kB = 1 Tfinal = 10−10 local minima and is thus able to explore globally for more possible solutions� An annealing schedule is selected to systematically decrease the temperature as the algorithm proceeds� As the temperature decreases, the algorithm reduces the extent of its search to converge to a minimum� A programmed SA code was used and its parameters were adjusted so that it could be utilized for finding the optimal TEC design� Choosing good algorithm parameters is very important because it greatly affects the whole optimization process� Parameter settings of SA are listed in Table 1�3� The initial temperature, T0 = 100, should be high enough such that in the first iteration of the algorithm, the probability of accepting a worse solution, is at least 80%� The temperature is the controlled parameter in SA and it is decreased gradually as the algorithm proceeds (Vasant & Barsoum, 2009)� Temperature reduction value α = 0�95 and temperature decrease function is: Tn = αTn−1 (1�39) The numerical experimentation was done with different α values: 0�70, 0�75, 0�85, 0�90, and 0�95 (Abbasi, Niaki, Khalife, & Faize, 2011)� Boltzmann annealing factor, k B, is used in the Metropolis algorithm to calculate the acceptance probability of the points� Maximum number of runs, run max = 250, determines the length of each temperature level T · accmax = 125 determines the maximum number of acceptance of a new solution point and rejmax = 125 determines the maximum number of rejection of a new solution point (run max = accmax + rejmax) (Abbasi et al�, 2011)� The stopping criteria determine when the algorithm reaches the desired energy level� The desired or final stopping temperature is set as Tfinal = 10−10� The SA algorithm is described in the following section and the flowchart of SA algorithm is shown in Figure 1�4� • Step 1: Set the initial parameters and create initial point of the design variables� For SA algorithm, determine required parameters for the algorithm as in Table 1�3� For TEC device, set required parameters such as fixed parameters and boundary constraints of the design variables, and set all the constraints and apply them into penalty function� 20 Advances in Metaheuristics: Applications in Engineering Systems Start Determine required parameters for STEC device and SA algorithm Initialize a random base point of design variable X0 Update T with function Tn = α .

Download PDF sample

Rated 4.16 of 5 – based on 25 votes