Search

Abstract Functionally graded beams (FGBs) have been studied extensively in literature to predict their static stability and dynamic behavior. In typical FGBs, each of material variation has significant influence on overall beams’ strength. This research utilized single and multi-objective optimization approaches to optimize the volume fraction distribution in the Timoshenko FGBs in order to maximize the fundamental frequency while minimizing mass and axial stresses. The FGBs with different ratios of material properties are considered. Several metaheuristic optimization techniques are utilized to address single and multi-objective problems. For validating purpose, computational optimization results are compared with those available in the literature. [ABSTRACT FROM AUTHOR]

The generation rescheduling is described as the power generation shifting from one or more generators to one or more other generators as a preventive action to improve and maintain the security of the power system. Since, there is a direct link between security improvement and the lines overload under contingencies, by rescheduling generation, the transmission lines become more flexible and thus, the overload can be relieved. In this paper, contingency constrained optimal power flow (CCOPF) problem based on generation rescheduling by considering the uncertainty of photovoltaic (PV), wind turbine (WT), and plug-in hybrid electric vehicle (PHEV) have been addressed. Water cycle algorithm (WCA) using its potential in finding optimal solution has been used in order to reschedule the generators and optimize the total fuel cost, power losses under contingency scenario, and system security. Moreover, stochastic approach has been proposed for taking into account the uncertainty of PV, WT, and PHEV. Overall performance index including the power and the voltage severity indices have been provided for determining overloaded transmission lines due to the lines’ outage and consequently elimination of overloaded lines. The efficiency of the proposed algorithm has been evaluated on two IEEE-30 and IEEE 118-bus systems. The results are compared with the results of other classical and metaheuristic optimization algorithms. The simulations reveal that the WCA outperforms the other reported optimizers, and is more efficient and effective in improving security for power systems. In addition, the obtained numerical results show that renewable energy sources can significantly reduce fuel costs. [ABSTRACT FROM AUTHOR]

In this paper, conductive polymer-based composites in order to have higher electrical conductivity have been constructed using different nanoparticles and numerically considered by different classification techniques. Due to non-conducting feature of polymer-based composites, their other positive advantages (e.g., light weight and stress corrosion) underneath non-conducting defect in which this paper has tried to overcome the faced challenges. For this purpose, carbon black (CB), carbon nanotube (CNT), and expanded graphite (EG) with different weight percentages are added to the epoxy resin as input factors and the electrical conductivity of the samples are measured as response factor. The analysis of input factors is performed and the Taguchi method, artificial neural networks (ANNs) and extreme learning machine (ELM) are designed and used for the prediction of the response factor. The predicted responses using the applied methods are compared with the experimental results. In order to increase the mechanical strength, ten layers of unidirectional carbon fiber are used. The simulation results show that the ANNs and ELM provide good compatible predictions with respect to actual experiment data. Besides, obtained experimental results prove that the highest electrical conductivity has been achieved using 10, 15, and 25 percent using the CNT, EG, and CB, respectively. As a novelty of this paper, the constructed sample composite reaches the acceptable electrical conductivity suggested by United Stated Department of Energy standard considered as material development. In particular, the findings of this research can be used to construct conductive electrodes particularly in oil and gas industries. [ABSTRACT FROM AUTHOR]

In this article, a model of a T-shaped fin, consisting of a set of ordinary differential equations (ODEs), is considered. The purpose of this article is to numerically solve ODE systems of a T-shaped fin (there is no reported exact and analytical solution) using an alternative approach. Utilizing a base approximation function, some mathematical principles and metaheuristics, an approximate solution very close to the existing numerical solution was found. The weighted residual function is used as an objective function along with its constraints, such as boundary and initial values. For the sake of comparison, a generational distance metric is used to evaluate the obtained results compared with the existing results in the literature. The approximate solution found by the applied approach demonstrates its efficiency and performance compared with the existing numerical approach. [ABSTRACT FROM AUTHOR]

In recent years, significant attentions have been devoted to design of metaheuristic optimization algorithms in order to solve optimization problems. Metaheuristic optimizers are methods which are inspired by observing the phenomena occurring in nature. In this paper, a comprehensive and exhaustive review has been carried out on water cycle algorithm (WCA) and its applications in a wide variety of study fields. The WCA is one of the novel metaheuristic optimization algorithms which is inspired by water cycle process in nature and how streams and rivers flow into the sea. Good exploitation and exploration capabilities have made the WCA a good alternative for solving large-scale optimization problems. Due to its capabilities and strengths, the WCA has been utilized in many and various majors including mechanical engineering, electrical and electronic engineering, civil engineering, industrial engineering, water resources and hydropower engineering, computer engineering, mathematics, and so forth. A variety of articles based on WCA have been published in different international journals such as Elsevier, Springer, IEEE Transactions, Wiley, Taylor & Francis, and in the proceedings of international conferences as well, since 2012 to the present. Thus, it is highly believed that this paper can be appropriate, beneficial and practical for students, academic researchers, professionals, and engineers. Also, it can be an innovative and comprehensive reference for subsequent academic papers and books relevant to the WCA, optimization methods, and metaheuristic optimization algorithms. [ABSTRACT FROM AUTHOR]

In this article, a self-adaptive global mine blast algorithm (GMBA) is proposed for numerical optimization. This algorithm is designed in a novel way, and a new shrapnel equation is proposed for the exploitation phase of mine blast algorithm. A theoretical study is performed, which proves the convergence of any typical shrapnel piece; a new definition for parameters values is defined based on the performed theoretical studies. The promising nature of newly designed exploitation idea is verified with the help of multiple numerical experiments. A state-of-the-art set of benchmark problems are solved with the proposed GMBA, and the optimization results are compared with seven state-of-the-art optimization algorithms. The experimental results are statistically validated by using Wilcoxon signed-rank test, and time complexity of GMBA is also calculated. It has been justified that the proposed GMBA works as a global optimizer for constrained optimization problems. As an application to the newly developed GMBA, an important data clustering problem is solved on six data clusters and the clustering results are compared with the state-of-the-art optimization algorithms. The promising results claim the proposed GMBA as a strong optimizer for data clustering application. [ABSTRACT FROM AUTHOR]

Water cycle algorithm (WCA) is a population-based metaheuristic algorithm, inspired by the water cycle process and movement of rivers and streams towards sea. The WCA shows good performance in both exploration and exploitation phases. Further, the relationship between improvised exploitation and each parameter under asymmetric interval is derived and an iterative convergence of WCA is proved theoretically. In this paper, CEC'15 computationally expensive benchmark problems (i.e., 15 problems) have been considered for efficiency measurement of WCA accompanied with other optimisers. Also, a new discretisation strategy for the WCA has been proposed and applied along with other optimisers for solving combinatorial Internet shopping optimisation problem. By applying complexity analysis, it shows that using the WCA intricacy from dimension 10–30 is increased for almost three times. Proposing a unique discretisation approach along with providing iterative convergence proof can be considered as novelty of this research. By observing the attained numerical results, the WCA could find the minimum average error of CEC'15 in 12 and 8 out of 15 cases for dimensions 10 and 30, respectively. Experimental optimisation results for a wide range computationally expensive problems reveal the effectiveness and advantage of WCA for solving both continuous and discrete optimisation problems. [ABSTRACT FROM AUTHOR]

Traffic congestion is a critical problem which makes roads busy. Traffic congestion challenges traffic flow in urban areas. A growing urban area creates complex traffic problems in daily life. Congestion phenomena cannot be resolved only by applying physical constructs such as building bridges and motorways and increasing road capacity. It is necessary to build technological systems for transportation management to control the traffic phenomenon. In this article, a new idea is proposed to tackle traffic congestion with the aid of machine learning approaches. A new strategy based on a tree-like configuration (i.e. a decision-making model) is suggested to handle traffic congestion at intersections using adaptive traffic signals. Different traffic networks with different sizes, varying from nine to 400 intersections, are examined. Numerical results and discussion are presented to prove the efficiency and application of the proposed strategy to alleviate traffic congestion. [ABSTRACT FROM AUTHOR]

This paper presents a novel approximation technique based on metaheuristics and weighted residual function (WRF) for tackling singular boundary value problems (BVPs) arising in engineering and science. With the aid of certain fundamental concepts of mathematics, Fourier series expansion, and metaheuristic optimisation algorithms, singular BVPs can be approximated as an optimisation problem with boundary conditions as constraints. The target is to minimise the WRF (i.e. error function) constructed in approximation of BVPs. The scheme involves generational distance metric for quality evaluation of the approximate solutions against exact solutions (i.e. error evaluator metric). Four test problems including two linear and two non-linear singular BVPs are considered in this paper to check the efficiency and accuracy of the proposed algorithm. The optimisation task is performed using three different optimisers including the particle swarm optimisation, the water cycle algorithm, and the harmony search algorithm. Optimisation results obtained show that the suggested technique can be successfully applied for approximate solving of singular BVPs. [ABSTRACT FROM AUTHOR]

The design of water distribution systems is a large class of combinatorial, nonlinear optimization problems with complex constraints such as conservation of mass and energy equations. Since feasible solutions are often extremely complex, traditional optimization techniques are insufficient. Recently, metaheuristic algorithms have been applied to this class of problems because they are highly efficient. In this article, a recently developed optimizer called the mine blast algorithm (MBA) is considered. The MBA is improved and coupled with the hydraulic simulator EPANET to find the optimal cost design for water distribution systems. The performance of the improved mine blast algorithm (IMBA) is demonstrated using the well-known Hanoi, New York tunnels and Balerma benchmark networks. Optimization results obtained using IMBA are compared to those using MBA and other optimizers in terms of their minimum construction costs and convergence rates. For the complex Balerma network, IMBA offers the cheapest network design compared to other optimization algorithms. [ABSTRACT FROM AUTHOR]

Nowadays, many passengers use transit systems to reach their destinations; however, the growing concern for public transit is its inability to shift passenger's mode from private to public transportation. By designing a well-integrated public transit system and improving the cost-effectiveness network, the public transport could play a crucial role in passenger satisfaction and reducing the operating cost. The main target of this paper is to present a new mathematical programming model and design an efficient transit system to increase the efficiency of integrated public transit services through the development of feeder bus services and coordination of major transportation services with the aim of minimizing the costs. In this study, optimized transit services and coordinated schedules are developed using metaheuristic algorithms such as genetic algorithm, particle swarm optimization, and imperialist competitive algorithm. The data used and the coordination were obtained from a case study widely provided in the literature. Finally, obtained numerical results of the proposed model including optimal solution, statistical optimization results, and the convergence rate, and comparisons are discussed in detail using tables and figures. [ABSTRACT FROM AUTHOR]

In this paper, the water cycle algorithm (WCA), a recently developed metaheuristic method is proposed for solving multi-objective optimization problems (MOPs). The fundamental concept of the WCA is inspired by the observation of water cycle process, and movement of rivers and streams to the sea in the real world. Several benchmark functions have been used to evaluate the performance of the WCA optimizer for the MOPs. The obtained optimization results based on the considered test functions and comparisons with other well-known methods illustrate and clarify the robustness and efficiency of the WCA and its exploratory capability for solving the MOPs. [ABSTRACT FROM AUTHOR]

Differential equations play a noticeable role in engineering, physics, economics, and other disciplines. In this paper, a general approach is suggested to solve a wide variety of linear and nonlinear ordinary differential equations (ODEs) that are independent of their forms, orders, and given conditions. With the aid of certain fundamental concepts of mathematics, Fourier series expansion and metaheuristic methods, ODEs can be represented as an optimization problem. The target is to minimize the weighted residual function (cost function) of the ODEs. To this end, two different approaches, unit weight function and least square weight function, are examined in order to determine the appropriate method. The boundary and initial values of ODEs are considered as constraints for the optimization model. Generational distance metric is used for evaluation and assessment of the approximate solutions versus the exact solutions. Six ODEs and four mechanical problems are approximately solved and compared with their exact solutions. The optimization task is carried out using different optimizers including the particle swarm optimization, the cuckoo search, and the water cycle algorithm. The optimization results obtained show that metaheuristic algorithms can be successfully applied for approximate solving of different types of ODEs. The suggested least square weight function is slightly superior over the unit weight function in terms of accuracy and statistical results for approximate solving of ODEs. [ABSTRACT FROM AUTHOR]

This paper presents the applications of the mine blast algorithm (MBA) and the water cycle algorithm (WCA), in addition to an improved version of MBA for weight minimization of truss structures including discrete sizing variables. The MBA mimics the explosion of landmines, while the WCA is inspired by the observation of water cycle process. An improved version of MBA (IMBA), is also presented. The efficiency of the three optimization algorithms is tested using classical benchmark discrete truss design problems. Optimization results show that MBA, IMBA, and WCA offer a good degree of competitiveness against other state-of-the-art metaheuristic techniques. [ABSTRACT FROM AUTHOR]

Since the fiber diameter determines the mechanical, electrical, and optical properties of electrospun nanofiber mats, the effect of material and process parameters on electrospun polymethyl methacrylate (PMMA) fiber diameter were studied. Accordingly, the prediction and optimization of input factors were performed using the response surface methodology (RSM) with the design of experiments technique and artificial neural networks (ANNs). A central composite design of RSM was employed to develop a mathematical model as well as to define the optimum condition. A three-layered feed-forward ANN model was designed and used for the prediction of the response factor, namely the PMMA fiber diameter (in nm). The parameters studied were polymer concentration (13-28 wt%), feed rate (1-5 mL/h), and tip-to-collector distance (10-23 cm). From the analysis of variance, the most significant factor that caused a remarkable impact on the experimental design response was identified. The predicted responses using the RSM and ANNs were compared in figures and tables. In general, the ANNs outperformed the RSM in terms of accuracy and prediction of obtained results. [ABSTRACT FROM AUTHOR]

The heat sinks are utilized in electronic devices to eliminate heat from the chip and efficiently transmit it to the environment. Therefore, the optimal geometry sizes of fin heat sinks are the point of concern for manufacturers and designers. For this reason, the importance of optimization techniques particularly metaheuristics is understood. The design variables are width of heat sink, number of fins, fin height, and fin diameter. The various responses that have been considered are electromagnetic emitted radiations, thermal resistance, and mass of the heat sink investigated separately and simultaneously (multi-objective). Mine blast algorithm (MBA), as a recently developed optimizer, is inspired from explosion of mines. The optimum dimensions and values for each response have been obtained by the MBA and have been compared with other optimization methods in the literature. In terms of thermal resistance and mass responses, the MBA has offered better values, while for the emitted radiations, the obtained results obtained by Taguchi-based gray relational analysis (TGRA) was preferred. For manufacturing point of view, the MBA and TGRA both suggested better and efficient design. In addition, the value path analysis has been carried out to compare the trade-off among the considered responses. Finally, parametric sensitivity analyses have been implemented for design parameters, and discussions and comparisons have been carried out for the effects of each decision variable. By considering all responses, width of heat sink and fin height are considered as the most important and effective design parameters, respectively. [ABSTRACT FROM AUTHOR]

Injectable calcium phosphate cements have been introduced as adjuncts to internal fixation for treating selected fractures. These cements harden without producing much heat, develop compressive strength, and are remodeled slowly in vivo. The main purpose of the cement is to fill voids in metaphyseal bone, thereby reducing the need for bone graft. However, such cements may also improve the holding strength around metal devices in osteoporotic bone. This paper presents the optimum mechanical behavior of calcium phosphate cement/hydroxyl group functionalized multi-walled carbon nanotubes/bovine serum albumin (CPC/MWCNT-OH/BSA) composites in terms of compressive strength using well-known metaheuristic optimizers. The process parameters studied were wt% of MWCNT-OH (0.2-0.5 wt%) and wt% of BSA (5-15 wt%). The obtained results from metaheuristic algorithms were compared with the results from the response surface methodology (RSM) in the literature. The results obtained from metaheuristic algorithms outperformed the results given by the RSM in terms of less error percentage and high compressive strength. [ABSTRACT FROM AUTHOR]

In recent years, many researchers have utilized metaheuristic optimization algorithms along with fuzzy logic theory in their studies for various purposes. The harmony search (HS) algorithm is one of the metaheuristic optimization algorithms that is widely employed in different studies along with fuzzy logic (FL) theory. FL theory is a mathematical approach to expressing uncertainty by applying the conceptualization of fuzziness in a system. This review paper presents an extensive review of published papers based on the combination of HS and FL systems. In this regard, the functional characteristics of models obtained from integration of FL and HS have been reported in various articles, and the performance of each study is investigated. The basic concept of the FL approach and its derived models are introduced to familiarize readers with the principal mechanisms of FL models. Moreover, appropriate descriptions of the primary classifications acquired from the coexistence of FL and HS methods for specific purposes are reviewed. The results show that the high efficiency of HS to improve the exploration of FL in achieving the optimal solution on the one hand, and the capability of fuzzy inference systems to provide more flexible and dynamic adaptation of the HS parameters based on human perception on the other hand, can be a powerful combination for solving optimization problems. This review paper is believed to be a useful resource for students, engineers, and professionals. [ABSTRACT FROM AUTHOR]

Abstract: This paper presents a new optimization technique called water cycle algorithm (WCA) which is applied to a number of constrained optimization and engineering design problems. The fundamental concepts and ideas which underlie the proposed method is inspired from nature and based on the observation of water cycle process and how rivers and streams flow to the sea in the real world. A comparative study has been carried out to show the effectiveness of the WCA over other well-known optimizers in terms of computational effort (measures as number of function evaluations) and function value (accuracy) in this paper. [Copyright &y& Elsevier]

Selection of processing and geometrical parameters is a crucial step in the extrusion process design. Optimized parameters may result in desirable microstructure at minimum load. The purpose of this paper is determination of the optimal cold forward extrusion parameters with the minimization of tool load as the objective function. This paper deals with different optimization approaches in order to determine the optimal values of logarithmic strain, die angle, and friction with the purpose of finding the minimal tool loading obtained by cold forward extrusion process. The obtained extrusion force model as a fitness function was used to carry out the optimization. Based upon the objective function, metaheuristic algorithms such as genetic algorithm and simulated annealing were adopted as optimization methods for finding the optimum values of cold forward extrusion parameters and the obtained results were compared with those in literature. The better results lead to the smallest energy consumption, longer tool life, better formability of the work material, and the quality of the finished product. [ABSTRACT FROM AUTHOR]

Abstract: In this study a novel optimization method is presented, the so called mine blast algorithm (MBA). The fundamental concepts and ideas of MBA are derived from the explosion of mine bombs in real world. The efficiency of the proposed optimizer is tested via the optimization of several truss structures with discrete variables and its performance is compared with several well-known metaheuristic algorithms. The results show that MBA is able to provide faster convergence rate and also manages to achieve better optimal solutions compared to other efficient optimizers. [Copyright &y& Elsevier]

In order to develop the dynamic effectiveness of the structures such as trusses, the application of optimisation methods plays a significant role in improving the shape and size of elements. However, conjoining two heterogeneous variables, nodal coordinates and cross-sectional elements, makes a challenging optimisation problem that is nonlinear, multimodal, large-scale with dynamic constraints. To handle these challenges, evolutionary and swarm optimisation algorithms can be robust and practical tools and show great potential to solve such complex problems. This paper proposed a comparative truss optimisation framework to solve two large-scale structures, including 314-bar and 260-bar trusses. The proposed framework consists of twelve state-of-the-art bio-inspired algorithms. The experimental results show that the marine predators algorithm (MPA) performed best compared with other algorithms in terms of convergence speed and the quality of the proposed designs of the trusses. [ABSTRACT FROM AUTHOR]

Internationally, there are heightened demands for efficient public transportation systems due to high population growth rates in urban areas and their associated increased trip demands within and across city boundaries. An ideal and sustainable public transportation system should satisfy its passengers while minimizing operation costs that are often associated with energy consumptions. One such cost-effective approach is establishing an integrated public transit system. A transit system generally includes a set of bus routes and rail lines connected by transfer stations. The main objective of this research is to propose a sustainable and integrated transit establishment model to design an optimal bus transit system in combination with an existing railway system dealing with both fixed and variable demands while satisfying multiple objectives. Moreover, this paper finds an optimum set of transit routes that corresponds to chosen tradeoffs between user cost, operator cost and, notably, unsatisfied demand cost. Optimal transit networks have been achieved using single and multi-objective approaches via metaheuristic optimization algorithms including the genetic algorithm and the non-dominated sorting genetic algorithm II (NSGA-II). The study area is chosen as Daejeon City, South Korea for its strategic location. Compared with existing transit networks, the proposed approach shows significant improvements in terms of costs. In addition, the proposed approach can provide an efficient methodology for finding alternative alignments of existing transit systems for decision makers. [ABSTRACT FROM AUTHOR]

Various metaheuristic optimization algorithms are being developed to obtain optimal solutions to real-world problems. Metaheuristic algorithms are inspired by various metaphors, resulting in different search mechanisms, operators, and parameters, and thus algorithm-specific strengths and weaknesses. Newly developed algorithms are generally tested using benchmark problems. However, for existing traditional benchmark problems, it is difficult for users to freely modify the characteristics of a problem. Thus, their shapes and sizes are limited, which is a disadvantage. In this study, a modified Gaussian fitness landscape generator is proposed based on a probability density function, to make up for the disadvantages of traditional benchmark problems. The fitness landscape developed in this study contains a total of six features and can be employed to easily create various problems depending on user needs, which is an important advantage. It is applied to quantitatively evaluate the performance and reliability of eight reported metaheuristic algorithms. In addition, a sensitivity analysis is performed on the population size for population-based algorithms. Furthermore, improved versions of the metaheuristic algorithm are considered, to investigate which performance aspects are enhanced by applying the same fitness landscape. The modified Gaussian fitness landscape generator can be employed to compare the performances of existing optimization algorithms and to evaluate the performances of newly developed algorithms. In addition, it can be employed to develop methods of improving algorithms by evaluating their strengths and weaknesses. [ABSTRACT FROM AUTHOR]

Abstract This paper presents a synthesis strategy for impact force localization and identification of framed structures in time-domain using a two-step wavelet-based fitness evaluation scheme in conjunction with genetic and water cycle algorithms. For this purpose, a straightforward approach is developed for sensitivity analysis of accelerations and spatial signal connecting the peak values. The proposed scheme is capable of using diverse scales of wavelet functions at considerably small sampling rates. A decimal genetic algorithm (GA) coding system and a recently developed water cycle algorithm (WCA) are improved to be used for impact localization and identification, respectively. The fitness evaluation is then modified for using the obtained results from sensitivity analysis rather than the acceleration itself. Numerical study is first conducted for a large space frame to evaluate the precision, convergence, and efficiency of the identified results using the proposed GA-WCA strategy to different measurement scenarios and initial estimates of the structural model. For comparison purposes, the robustness of WCA in identification step is thoroughly compared with other three state-of-the-art optimization algorithms i.e., particle swarm optimization (PSO), imperialist competitive algorithm (ICA), and differential evolution (DE). Afterwards, an experimental validation study is carried out on a laboratory scale truss bridge. It is concluded that the computational performance of the proposed method is significantly better than the existing methods with respect to fitness evaluation. Results show that, even for the cases with a rough knowledge on structural parameters, the impact force is successfully identified with an excellent precision. This demonstrates the superiority of WCA strategy in handling the global search over large design space with large number of design variables. It is also concluded that the impact localization step is accomplished very fast, thus providing a near real-time strategy in dealing with large-scaled frame and bridge structures. Highlights • A near real-time method is achieved for impact localization of large systems. • A wavelet-based and multi-species decimal genetic algorithm (DGA) is improved. • Impact identification step is satisfactorily achieved using a water cycle strategy. • An efficient wavelet-based sensitivity approach is proposed for fitness evaluation. • Impact identification of a large-scaled space frame is examined. [ABSTRACT FROM AUTHOR]

Water distribution network decomposition, which is an engineering approach, is adopted to increase the efficiency of obtaining the optimal cost design of a water distribution network using an optimization algorithm. This study applied the source tracing tool in EPANET, which is a hydraulic and water quality analysis model, to the decomposition of a network to improve the efficiency of the optimal design process. The proposed approach was tested by carrying out the optimal cost design of two water distribution networks, and the results were compared with other optimal cost designs derived from previously proposed optimization algorithms. The proposed decomposition approach using the source tracing technique enables the efficient decomposition of an actual large-scale network, and the results can be combined with the optimal cost design process using an optimization algorithm. This proves that the final design in this study is better than those obtained with other previously proposed optimization algorithms. [ABSTRACT FROM PUBLISHER]

Abstract: This paper presents the application of ant colony optimization (ACO) for the multi-objective optimization of hybrid laminates for obtaining minimum weight and cost. The investigated laminate is made of glass–epoxy and graphite–epoxy plies to combine the lightness and economical attributes of the first with the high-stiffness property of the second using a modified variation of ACO so called the elitist ant system (EAS) in order to make the tradeoff between the cost and weight as the objective functions. First natural frequency was considered as a constraint. The obtained results using the EAS method including the Pareto set, optimum stacking sequences, and the number of plies made of either glass or graphite fibers were compared with those using the genetic algorithm (GA) and any colony system (ACS) reported in literature. The comparisons confirm the advantage of hybridization and showed that the EAS algorithm outperformed the GA and ACS in terms of function’s value and constraint accuracy. [Copyright &y& Elsevier]

In this article, scheduling and rescheduling problems with increasing processing time and new job insertion are studied for reprocessing problems in the remanufacturing process. To handle the unpredictability of reprocessing time, an experience-based strategy is used. Rescheduling strategies are applied for considering the effect of increasing reprocessing time and the new subassembly insertion. To optimize the scheduling and rescheduling objective, a discrete harmony search (DHS) algorithm is proposed. To speed up the convergence rate, a local search method is designed. The DHS is applied to two real-life cases for minimizing the maximum completion time and the mean of earliness and tardiness (E/T). These two objectives are also considered together as a bi-objective problem. Computational optimization results and comparisons show that the proposed DHS is able to solve the scheduling and rescheduling problems effectively and productively. Using the proposed approach, satisfactory optimization results can be achieved for scheduling and rescheduling on a real-life shop floor. [ABSTRACT FROM AUTHOR]

This study addresses flexible job shop scheduling problem (FJSP) with two constraints, namely fuzzy processing time and new job insertion. The uncertainty of processing time and new job insertion are two scheduling related characteristics in remanufacturing. Fuzzy processing time is used to describe the uncertainty in processing time. Rescheduling operator is executed when new job(s) is (are) inserted into the schedule currently being executed. A two-stage artificial bee colony (TABC) algorithm with several improvements is proposed to solve FJSP with fuzzy processing time and new job insertion constraints. Also, several new solution generation methods and improvement strategies are proposed and compared with each other. The objective is to minimize maximum fuzzy completion time. Eight instances from remanufacturing are solved using the proposed TABC algorithm. The proposed improvement strategies are compared and discussed in detail. Two proposed ABC algorithms with the best performances are compared against seven existing algorithms over by five benchmark cases. The optimization results and comparisons show the competitiveness of the proposed TABC algorithm for solving FJSP. [ABSTRACT FROM AUTHOR]

Minimum cost of energy is the main goal of a wind farm layout optimization. This is achieved by maximizing the total energy while minimizing the total costs of the farm. In this study, two sizes of commercial turbines were considered to investigate the effect of a non-homogenous farm on the layout optimization process. A cost model consisting of turbines, cable, transformers, foundation, and service vehicle routes was developed. Using Genetic Algorithm and Artificial Neural Network, first the superiority of the new algorithm in turbines and cable layout was verified versus previous studies. Next, two cases were investigated, i.e. (1) a farm populated with identical turbines and (2) a farm with a random mixture of both sizes of turbines. The layouts of both cases were optimized by both single and multi-objective optimizations. In the single objective optimization, only the larger turbines remained in the optimal layout of the second case and reduced the Levelized Cost of Energy (LCOE) into half of the first case. Multi-objective optimization clarified the reason for selecting larger size turbines in the layouts when the goal of the optimization was to minimize the cost of energy. As reported in literature, non-homogenous farms produce higher output. However, they impose a higher LCOE which makes them less appealing to developers. • Single objective (cost) and multi-objective (cost & power output) optimization result in different layout. • Non-homogenous farms produce higher power output. • Non-homogenous farms impose a higher LCOE which makes them less appealing to developers. [ABSTRACT FROM AUTHOR]

• This work studies an integrated distributed flow shop scheduling and distribution problem. • A mixed integer programming model is given to describe this problem mathematically. • An enhanced brain storm optimization algorithm is designed. • Optimal solutions are obtained by using mathematical programming solvers. • State-of-the-art results are acquired by the designed approach. Production and distribution are two essential activities in supply chain management. Currently, integrated production and distribution problems receive much attention because decision-makers devote to improving the operation efficiency of both stages and try to achieve an optimal solution. This work proposes an integrated distributed production and distribution problem with consideration of time windows, in which a set of jobs (i.e., customer orders) needs to be assigned among factories and the jobs are processed on flow shop environments at their associated factories. Then, the completed jobs are delivered by capacitated vehicles to customers in different regions while satisfying given time windows as much as possible. Accordingly, to optimally solve the proposed problem, a mixed integer programming model with minimizing total weighted earliness and tardiness has been established. For the optimization task, an enhanced brain storm optimization algorithm with some particular strategies is designed to handle the considered problem. To assess the performance of the proposed optimization method, several experiments by adopting a set of benchmark test problems are performed, and state-of-the-art optimizers are chosen for comparisons. The obtained optimization results exhibit that the designed algorithm significantly outperforms its rivals and can be considered as an excellent optimizer for solving the studied problem. Besides, compared with the CPLEX solver, the designed optimizer also performs much better for solving large-size problems. [ABSTRACT FROM AUTHOR]