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

By Timothy Ganesan, Pandian Vasant, Irraivan Elamvazuthi

Advances in Metaheuristics: purposes in Engineering Systems offers info on present methods used in engineering optimization. It provides a finished history on metaheuristic purposes, concentrating on major engineering sectors resembling strength, procedure, and fabrics. It discusses issues reminiscent of algorithmic improvements and function size techniques, and offers insights into the implementation of metaheuristic thoughts to multi-objective optimization difficulties. With this booklet, readers can discover ways to resolve real-world engineering optimization difficulties successfully utilizing the perfect concepts 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 business purposes within the strength zone. the second one focusses on technique optimization and considers 3 engineering functions: optimization of a three-phase separator, strategy plant, and a pre-treatment method. The 3rd and ultimate a part of this e-book covers business purposes in fabric engineering, with a selected specialise in sand mould-systems. it's also discussions at the power development of algorithmic features through strategic algorithmic enhancements.

This ebook 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 major source for engineers and decision-makers deciding upon and imposing metaheuristics to resolve particular engineering problems.

Show description

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

Similar operations research books

Tutorials In Operations Research

Those tutorials comprise• Nested participation optimization• Computational worldwide optimization• threat in optimization lower than uncertainty• Differential video games in advertising and marketing technological know-how• secure scheduling• Community-based operations learn• undertaking administration• utilizing recommendations conception to evaluate tasks• tendencies in OR and MS schooling on the introductory point

Tabu Search

Confronted with the problem of fixing demanding optimization difficulties that abound within the actual international, classical tools usually come across nice hassle - even if outfitted with a theoretical warrantly of discovering an optimum answer. extremely important functions in company, engineering, economics and technology can't be tackled with any average wish of good fortune, inside of useful time horizons, via answer equipment which have been the fundamental concentration of educational examine through the earlier 3 many years (and that are nonetheless the point of interest of many textbooks).

Multicriteria Analysis in Finance

This ebook presents a concise creation into the basics and utilized strategies of a number of standards choice making within the finance zone. according to an research of the character of monetary judgements and the final equipment of monetary modelling, probability administration and fiscal engineering, the e-book introduces into portfolio administration, banking administration and credits scoring.

Managing Complex, High Risk Projects: A Guide to Basic and Advanced Project Management

Maximizing reader insights into venture administration and dealing with complexity-driven hazards, this booklet explores propagation results, non-linear effects, loops, and the emergence of confident houses that could ensue over the process a undertaking. This booklet offers an advent to undertaking administration and research of conventional venture administration techniques and their limits concerning complexity.

Additional info for Advances in metaheuristics: applications in engineering systems

Example text

3 swarm INtellIGeNce ACO is among the most effective swarm intelligence-based algorithms (Pothiya, Ngamroo, & Kongprawechnon, 2010)� The original idea was based on the behavior of ants seeking the shortest path between their colony and food sources� The ACO algorithm consists of four stages: solution construction, pheromone update, local search (LS), and pheromone re-initialization (Pothiya et al�, 2010)� The ACO algorithm has been implemented as a solution method for ED problems� In Pothiya et al� (2010), ACO was used for solving ED problems with nonsmooth cost functions while taking into account valve-point effects and MF options� To improve the search process, three techniques including the priority list method, variable reduction method, and the zoom feature method were added to the conventional ACO� The near-optimal solutions acquired from the results signify that the ACO provides better solutions as compared to other methods� ACO converges to the optimum solution much faster than the other methods (PSO, TS, GA) employed in Pothiya et al� (2010)� Similar to ACO, BFO is a swarm-based optimization technique that uses population search and global search methods (Padmanabhan, Sivakumar, Jasper, & Victoire, 2011)� The BFO uses ideas from natural evolution for efficient search operations� The law of evolution states that organisms with better foraging strategies would survive while those with poor foraging strategies would be eliminated� The foraging behavior of Escherichia coli (E.

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 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.75 of 5 – based on 50 votes