Search

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]

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]

Graphical abstract Highlights • A dynamic optimization model Neural Network Algorithm (NNA) is proposed. • NNA is inspired by the structure of ANNs and biological nervous systems. • NNA is a parallel associated memory-based sequential-batch learning optimizer. • Convergence proof has been carried out for a random initial population. • NNA outperformed reported metaheuristic methods obtaining better quality solutions. Abstract In this research, a new metaheuristic optimization algorithm, inspired by biological nervous systems and artificial neural networks (ANNs) is proposed for solving complex optimization problems. The proposed method, named as neural network algorithm (NNA), is developed based on the unique structure of ANNs. The NNA benefits from complicated structure of the ANNs and its operators in order to generate new candidate solutions. In terms of convergence proof, the relationship between improvised exploitation and each parameter under asymmetric interval is derived and an iterative convergence of NNA is proved theoretically. In this paper, the NNA with its interconnected computing unit is examined for 21 well-known unconstrained benchmarks with dimensions 50–200 for evaluating its performance compared with the state-of-the-art algorithms and recent optimization methods. Besides, several constrained engineering design problems have been investigated to validate the efficiency of NNA for searching in feasible region in constrained optimization problems. Being an algorithm without any effort for fine tuning initial parameters and statistically superior can distinguish the NNA over other reported optimizers. It can be concluded that, the ANNs and its particular structure can be successfully utilized and modeled as metaheuristic optimization method for handling optimization problems. [ABSTRACT FROM AUTHOR]

This paper proposes a hybrid optimization method that combines the power of the harmony search (HS) with the mine blast algorithm (MBA). The resulting mine blast harmony search (MBHS) uses MBA for exploration and HS for exploitation. The HS is inspired by the improvisation process of musicians, while the MBA is derived based on explosion of landmines. The HS used in the hybrid algorithm is an improved version, introducing a new concept for the harmony memory size, while the MBA is modified in terms of its mathematical formulation. Several numerical problems and benchmarks with many design variables and constraints are used to validate MBHS, and the optimization results are compared with those from various algorithms in the literature. The numerical results show that the proposed hybrid method provides better exploitation ability (especially in the final iterations) and enjoys mature convergence to the optimum solution. [ABSTRACT FROM AUTHOR]

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]

Portfolio selection is one of the most vital financial problems in literature. The studied problem is a nonlinear multi-objective problem which has been solved by a variety of heuristic and metaheuristic techniques. In this article, a metaheuristic optimiser, the multi-objective water cycle algorithm (MOWCA), is represented to find efficient frontiers associated with the standard mean-variance (M-V) portfolio optimisation model. The inspired concept of WCA is based on the simulation of water cycle process in the nature. Computational results are obtained for analyses of daily data for the period January 2012 to December 2014, including S&P100 in the US, Hang Seng in Hong Kong, FTSE100 in the UK, and DAX100 in Germany. The performance of the MOWCA for solving portfolio optimisation problems has been evaluated in comparison with other multi-objective optimisers including the NSGA-II and multi-objective particle swarm optimisation (MOPSO). Four well-known performance metrics are used to compare the reported optimisers. Statistical optimisation results indicate that the applied MOWCA is an efficient and practical optimiser compared with the other methods for handling portfolio optimisation problems. [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]

This study addresses urban traffic light scheduling problem (UTLSP). A centralized model is employed to describe the urban traffic light control problem in a scheduling framework. In the proposed model, the concepts of cycles, splits, and offsets are not adopted, making UTLSP fall in the class of model-based optimization problems, where each traffic light is assigned in a real-time manner by the network controller. The objective is to minimize the network-wise total delay time in a given finite horizon. A swarm intelligent algorithm, namely discrete harmony search (DHS), is proposed to solve the UTLSP. In the DHS, a novel new solution generation strategy is proposed to improve the algorithm’s performance. Three local search operators with different structures are proposed based on the feature of UTLSP to improve the performance of DHS in local space. An ensemble of local search methods is proposed to integrate different neighbourhood structures. Extensive computational experiments are carried out using the traffic data from partial traffic network in Singapore. The DHS algorithm with and without local search operators and ensemble is evaluated and tested. The comparisons and discussions verify the effectiveness of DHS algorithms with local search operators and ensemble for solving UTLSP. [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]

This paper presents a modified version of the water cycle algorithm (WCA). The fundamental concepts and ideas which underlie the WCA are inspired based on the observation of water cycle process and how rivers and streams flow to the sea. New concept of evaporation rate for different rivers and streams is defined so called evaporation rate based WCA (ER-WCA), which offers improvement in search. Furthermore, the evaporation condition is also applied for streams that directly flow to sea based on the new approach. The ER-WCA shows a better balance between exploration and exploitation phases compared to the standard WCA. It is shown that the ER-WCA offers high potential in finding all global optima of multimodal and benchmark functions. The WCA and ER-WCA are tested using several multimodal benchmark functions and the obtained optimization results show that in most cases the ER-WCA converges to the global solution faster and offers more accurate results than the WCA and other considered optimizers. Based on the performance of ER-WCA on a number of well-known benchmark functions, the efficiency of the proposed method with respect to the number of function evaluations (computational effort) and accuracy of function value are represented. [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]

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]

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]

Abstract: Despite dental implantation being a great success, one of the key issues facing it is a mismatch of mechanical properties between engineered and native biomaterials, which makes osseointegration and bone remodeling problematical. Functionally graded material (FGM) has been proposed as a potential upgrade to some conventional implant materials such as titanium for selection in prosthetic dentistry. The idea of an FGM dental implant is that the property would vary in a certain pattern to match the biomechanical characteristics required at different regions in the hosting bone. However, matching the properties does not necessarily guarantee the best osseointegration and bone remodeling. Little existing research has been reported on developing an optimal design of an FGM dental implant for promoting long-term success. Based upon remodeling results, metaheuristic algorithms such as the genetic algorithms (GAs) and simulated annealing (SA) have been adopted to develop a multi-objective optimal design for FGM implantation design. The results are compared with those in literature. [Copyright &y& Elsevier]

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]

• 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]