Hybridization of multi-objective deterministic particle swarm with derivative-free local searches

The paper presents a multi-objective derivative-free and deterministic global/local hybrid algorithm for the efficient and effective solution of simulation-based design optimization (SBDO) problems. The objective is to show how the hybridization of two multi-objective derivative-free global and local algorithms achieves better performance than the separate use of the two algorithms in solving specific SBDO problems for hull-form design. The proposed method belongs to the class of memetic algorithms, where the global exploration capability of multi-objective deterministic particle swarm optimization is enriched by exploiting the local search accuracy of a derivative-free multi-objective line-search method. To the authors best knowledge, studies are still limited on memetic, multi-objective, deterministic, derivative-free, and evolutionary algorithms for an effective and efficient solution of SBDO for hull-form design. The proposed formulation manages global and local searches based on the hypervolume metric. The hybridization scheme uses two parameters to control the local search activation and the number of function calls used by the local algorithm. The most promising values of these parameters were identified using forty analytical tests representative of the SBDO problem of interest. The resulting hybrid algorithm was finally applied to two SBDO problems for hull-form design. For both analytical tests and SBDO problems, the hybrid method achieves better performance than its global and local counterparts

Metaheuristic design of feedforward neural networks: a review of two decades of research

Over the past two decades, the feedforward neural network (FNN) optimization has been a key interest among the researchers and practitioners of multiple disciplines. The FNN optimization is often viewed from the various perspectives: the optimization of weights, network architecture, activation nodes, learning parameters, learning environment, etc. Researchers adopted such different viewpoints mainly to improve the FNN's generalization ability. The gradient-descent algorithm such as backpropagation has been widely applied to optimize the FNNs. Its success is evident from the FNN's application to numerous real-world problems. However, due to the limitations of the gradient-based optimization methods, the metaheuristic algorithms including the evolutionary algorithms, swarm intelligence, etc., are still being widely explored by the researchers aiming to obtain generalized FNN for a given problem. This article attempts to summarize a broad spectrum of FNN optimization methodologies including conventional and metaheuristic approaches. This article also tries to connect various research directions emerged out of the FNN optimization practices, such as evolving neural network (NN), cooperative coevolution NN, complex-valued NN, deep learning, extreme learning machine, quantum NN, etc. Additionally, it provides interesting research challenges for future research to cope-up with the present information processing era

A multi objective memetic inverse solver reinforced by local optimization methods

We propose a new memetic strategy that can solve the multi-physics, complex inverse problems, formulated as the multi-objective optimization ones, in which objectives are misfits between the measured and simulated states of various governing processes. The multi-deme structure of the strategy allows for both, intensive, relatively cheap exploration with a moderate accuracy and more accurate search many regions of Pareto set in parallel. The special type of selection operator prefers the coherent alternative solutions, eliminating artifacts appearing in the particular processes. The additional accuracy increment is obtained by the parallel convex searches applied to the local scalarizations of the misfit vector. The strategy is dedicated for solving ill-conditioned problems, for which inverting the single physical process can lead to the ambiguous results. The skill of the selection in artifact elimination is shown on the benchmark problem, while the whole strategy was applied for identification of oil deposits, where the misfits are related to various frequencies of the magnetic and electric waves of the magnetotelluric measurements. 2016 Elsevier B.V

The Application of Memetic Algorithms for Forearm Crutch Design: A Case Study

Product design has normally been performed by teams, each with expertise in a specific discipline such as material, structural, and electrical systems. Traditionally, each team would use its member\u27s experience and knowledge to develop the design sequentially. Collaborative design decisions explore the use of optimization methods to solve the design problem incorporating a number of disciplines simultaneously. It is known that such optimized product design is superior to the design found by optimizing each discipline sequentially due to the fact that it enables the exploitation of the interactions between the disciplines. In this paper, a bi-level decentralized framework based on Memetic Algorithm (MA) is proposed for collaborative design decision making using forearm crutch as the case. Two major decisions are considered: the weight and the strength. We introduce two design agents for each of the decisions. At the system level, one additional agent termed facilitator agent is created. Its main function is to locate the optimal solution for the system objective function which is derived from the Pareto concept. Thus to Pareto optimum for both weight and strength is obtained. It is demonstrated that the proposed model can converge to Pareto solutions

Extending optimization algorithms to complex engineering problems

(undefined

TeMA: A Tensorial Memetic Algorithm for Many-Objective Parallel Disassembly Sequence Planning in Product Refurbishment

The refurbishment market is rich in opportunities—the global refurbished smartphones market alone will be $38.9 billion by 2025. Refurbishing a product involves disassembling it to test the key parts and replacing those that are defective or worn. This restores the product to like-new conditions, so that it can be put on the market again at a lower price. Making this process quick and efficient is crucial. This paper presents a novel formulation of parallel disassembly problem that maximizes the degree of parallelism, the level of ergonomics, and how the workers' workload is balanced, while minimizing the disassembly time and the number of times the product has to be rotated. The problem is solved using the Tensorial Memetic Algorithm (TeMA), a novel two-stage many-objective (MaO) algorithm, which encodes parallel disassembly plans by using third-order tensors. TeMA first splits the objectives into primary and secondary on the basis of a decision-maker's preferences, and then finds Pareto-optimal compromises (seeds) of the primary objectives. In the second stage, TeMA performs a fine-grained local search that explores the objective space regions around the seeds, to improve the secondary objectives. TeMA was tested on two real-world refurbishment processes involving a smartphone and a washing machine. The experiments showed that, on average, TeMA is statistically more accurate than various efficient MaO algorithms in the decision-maker's area of preference

Bio-inspired computation: where we stand and what's next

In recent years, the research community has witnessed an explosion of literature dealing with the adaptation of behavioral patterns and social phenomena observed in nature towards efficiently solving complex computational tasks. This trend has been especially dramatic in what relates to optimization problems, mainly due to the unprecedented complexity of problem instances, arising from a diverse spectrum of domains such as transportation, logistics, energy, climate, social networks, health and industry 4.0, among many others. Notwithstanding this upsurge of activity, research in this vibrant topic should be steered towards certain areas that, despite their eventual value and impact on the field of bio-inspired computation, still remain insufficiently explored to date. The main purpose of this paper is to outline the state of the art and to identify open challenges concerning the most relevant areas within bio-inspired optimization. An analysis and discussion are also carried out over the general trajectory followed in recent years by the community working in this field, thereby highlighting the need for reaching a consensus and joining forces towards achieving valuable insights into the understanding of this family of optimization techniques

Bio-inspired computation: where we stand and what's next

In recent years, the research community has witnessed an explosion of literature dealing with the adaptation of behavioral patterns and social phenomena observed in nature towards efficiently solving complex computational tasks. This trend has been especially dramatic in what relates to optimization problems, mainly due to the unprecedented complexity of problem instances, arising from a diverse spectrum of domains such as transportation, logistics, energy, climate, social networks, health and industry 4.0, among many others. Notwithstanding this upsurge of activity, research in this vibrant topic should be steered towards certain areas that, despite their eventual value and impact on the field of bio-inspired computation, still remain insufficiently explored to date. The main purpose of this paper is to outline the state of the art and to identify open challenges concerning the most relevant areas within bio-inspired optimization. An analysis and discussion are also carried out over the general trajectory followed in recent years by the community working in this field, thereby highlighting the need for reaching a consensus and joining forces towards achieving valuable insights into the understanding of this family of optimization techniques