Facility layout problem: Bibliometric and benchmarking analysis

Facility layout problem is related to the location of departments in a facility area, with the aim of determining the most effective configuration. Researches based on different approaches have been published in the last six decades and, to prove the effectiveness of the results obtained, several instances have been developed. This paper presents a general overview on the extant literature on facility layout problems in order to identify the main research trends and propose future research questions. Firstly, in order to give the reader an overview of the literature, a bibliometric analysis is presented. Then, a clusterization of the papers referred to the main instances reported in literature was carried out in order to create a database that can be a useful tool in the benchmarking procedure for researchers that would approach this kind of problems

Spread enhancement for firefly algorithm with application to control mechanism of exoskeleton system

Firefly algorithm (FA) is a swarm intelligence based algorithm for global optimization and has widely been used in solving problems in many areas. The FA is good at exploring the search space and locating the global optimum, but it always gets trapped at local optimum especially in case of high dimensional problems. In order to overcome such drawbacks of FA, this paper proposes a modified variant of FA, referred to as spread enhancement strategy for firefly algorithm (SE-FA), by devising a nonlinear adaptive spread mechanism for the control parameters of the algorithm. The performance of the proposed algorithm is compared with the original FA and one variant of FA on six benchmark functions. Experimental and statistical results of the approach show better solutions in terms of reliability and convergence speed than the original FA especially in the case of high-dimensional problems. The algorithms are further tested with control of dynamic systems. The systems considered comprise assistive exoskeletons mechanism for upper and lower extremities. The performance results are evaluated in comparison to the original firefly and invasive weed algorithms. It is demonstrated that the proposed approaches are superior over the individual algorithms in terms of efficiency, convergence speed and quality of the optimal solution achieved

Human cognition inspired procedures for part family formation based on novel Inspection Based Clustering approach

Human cognition based procedures are promising approaches for solving different kind or problems, and this paper addresses the part family formation problem inspired by a human cognition procedure through a graph-based approach, drawing on pattern recognition. There are many algorithms which consider nature inspired models for solving a broad range of problem types. However, there is a noticeable existence of a gap in implementing models based on human cognition, which are generally characterized by “visual thinking”, rather than complex mathematical models. Hence, the natural power of reasoning - by detecting the patterns that mimic the natural human cognition - is used in this study as this paper is based on the partial implementation of graph theory in modelling and solving issues related to the grouping of the parts to be processed by one machine, regardless of their size. The obtained results have shown that most of the problems solved by using the proposed approach have provided interesting benchmark results when compared with previous results given by GRASP (Greedy Randomized Adaptive Search Procedure) heuristics.This work has been supported by national funds through FCT - Fundacao para a Ciencia e Tecnologia - under the [UID/CEC/00319/2019] project, and under the RD Units Projects Scopes: UIDP/04077/2020 and UIDB/04077/2020, UIDP/04077/2020 and UIDB/04077/2020

Solving the DNA fragment assembly problem with a parallel discrete firefly algorithm implemented on GPU

The Deoxyribonucleic Acid Fragment Assembly Problem (DNA-FAP) consists in reconstructing a DNA chain from a set of fragments taken randomly. This problem represents an important step in the genome project. Several authors are proposed different approaches to solve the DNA-FAP. In particular, nature-inspired algorithms have been used for its resolution. Even they were obtaining good results; its computational time associated is high. The bio-inspired algorithms are iterative search processes that can explore and exploit efficiently the solution space. Firefly Algorithm is one of the recent evolutionary computing models which is inspired by the flashing light behaviour of fireflies. Recently, the Graphics Processing Units (GPUs) technology are emerge as a novel environment for a parallel implementation and execution of bio-inspired algorithms. Therefore, the use of GPU-based parallel computing it is possible as a complementary tool to speed-up the search. In this work, we design and implement a Discrete Firefly Algorithm (DFA) on a GPU architecture in order to speed-up the search process for solving the DNA Fragment Assembly Problem. Through several experiments, the efficiency of the algorithm and the quality of the results are demonstrated with the potential to applied for longer sequences or sequences of unknown length as well.Fil: Vidal, Pablo Javier. Universidad Nacional de la Patagonia Austral. Unidad Académica Caleta Olivia. Departamento de Ciencias Exactas y Naturales; Argentina. Universidad Nacional de la Patagonia Austral. Centro de Investigaciones y Transferencia Golfo San Jorge. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro de Investigaciones y Transferencia Golfo San Jorge. Universidad Nacional de la Patagonia "San Juan Bosco". Centro de Investigaciones y Transferencia Golfo San Jorge; ArgentinaFil: Olivera, Ana Carolina. Universidad Nacional de la Patagonia Austral. Centro de Investigaciones y Transferencia Golfo San Jorge. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro de Investigaciones y Transferencia Golfo San Jorge. Universidad Nacional de la Patagonia "San Juan Bosco". Centro de Investigaciones y Transferencia Golfo San Jorge; Argentina. Universidad Nacional de la Patagonia Austral. Unidad Académica Caleta Olivia. Departamento de Ciencias Exactas y Naturales; Argentin

Theoretical and practical convergence of a self-adaptive penalty algorithm for constrained global optimization

This paper proposes a self-adaptive penalty function and presents a penalty-based algorithm for solving nonsmooth and nonconvex constrained optimization problems. We prove that the general constrained optimization problem is equivalent to a bound constrained problem in the sense that they have the same global solutions. The global minimizer of the penalty function subject to a set of bound constraints may be obtained by a population-based meta-heuristic. Further, a hybrid self-adaptive penalty firefly algorithm, with a local intensification search, is designed, and its convergence analysis is established. The numerical experiments and a comparison with other penalty-based approaches show the effectiveness of the new self-adaptive penalty algorithm in solving constrained global optimization problems.The authors would like to thank the referees, the Associate Editor and the Editor-in-Chief for their valuable comments and suggestions to improve the paper. This work has been supported by COMPETE: POCI-01-0145-FEDER-007043 and FCT - Funda¸c˜ao para a Ciˆencia e Tecnologia within the projects UID/CEC/00319/2013 and UID/MAT/00013/2013.info:eu-repo/semantics/publishedVersio

Adaptiver Suchansatz zur multidisziplinären Optimierung von Leichtbaustrukturen unter Verwendung hybrider Metaheuristik

Within the last few years environmental regulations, safety requirements and market competitions forced the automotive industry to open up a wide range of new technologies. Lightweight design is considered as one of the most innovative concepts to fulfil environmental, safety and many other objectives at competitive prices. Choosing the best design and production process in the development period is the most significant link in the automobile production chain. A wide range of design and process parameters needs to be evaluated to achieve numerous goals of production. These goals often stand in conflict with each other. In addition to the variation of the concepts and following the objectives, some limitations such as manufacturing restrictions, financial limits, and deadlines influence the choice of the best combination of variables. This study introduces a structural optimization tool for assemblies made of sheet metal, e.g. the automobile body, based on parametrization and evaluation of concepts in CAD and CAE. This methodology focuses on those concepts, which leads to the use of the right amount of light and strong material in the right place, instead of substituting the whole structure with the new material. An adaptive hybrid metaheuristic algorithm is designed to eliminate all factors that would lead to a local minimum instead of global optimum. Finding the global optimum is granted by using some explorative and exploitative search heuristics, which are intelligently organized by a central controller. Reliability, accuracy and the speed of the proposed algorithm are validated via a comparative study with similar algorithms for an academic optimization problem, which shows valuable results. Since structures might be subject to a wide range of load cases, e.g. static, cyclic, dynamic, temperature-dependent etc., these requirements need to be addressed by a multidisciplinary optimization algorithm. To handle the nonlinear response of objectives and to tackle the time-consuming FEM analyses in crash situations, a surrogate model is implemented in the optimization tool. The ability of such tool to present the optimum results in multi-objective problems is improved by using some user-selected fitness functions. Finally, an exemplary sub-assembly made of sheet metal parts from a car body is optimized to enhance both, static load case and crashworthiness.Die Automobilindustrie hat in den letzten Jahren unter dem Druck von Umweltvorschriften, Sicherheitsanforderungen und wettbewerbsfähigem Markt neue Wege auf dem Gebiet der Technologien eröffnet. Leichtbau gilt als eine der innovativsten und offenkundigsten Lösungen, um Umwelt- und Sicherheitsziele zu wettbewerbsfähigen Preisen zu erreichen. Die Wahl des besten Designs und Verfahrens für Produktionen in der Entwicklungsphase ist der wichtigste Ring der Automobilproduktionskette. Um unzählige Produktionsziele zu erreichen, müssen zahlreiche Design- und Prozessparameter bewertet werden. Die Anzahl und Variation der Lösungen und Ziele sowie einige Einschränkungen wie Fertigungsbeschränkungen, finanzielle Grenzen und Fristen beeinflussen die Auswahl einer guten Kombination von Variablen. In dieser Studie werden strukturelle Optimierungswerkzeuge für aus Blech gefertigte Baugruppen, z. Karosserie, basierend auf Parametrisierung und Bewertung von Lösungen in CAD bzw. CAE. Diese Methodik konzentriert sich auf die Lösungen, die dazu führen, dass die richtige Menge an leichtem / festem Material an der richtigen Stelle der Struktur verwendet wird, anstatt vollständig ersetzt zu werden. Eine adaptive Hybrid-Metaheuristik soll verhindern, dass alle Faktoren, die Bedrohungsoptimierungstools in einem lokalen Minimum konvergieren, anstelle eines globalen Optimums. Das Auffinden des globalen Optimums wird durch einige explorative und ausbeuterische Such Heuristiken gewährleistet. Die Zuverlässigkeit, Genauigkeit und Geschwindigkeit des vorgeschlagenen Algorithmus wird mit ähnlichen Algorithmen in akademischen Optimierungsproblemen validiert und führt zu respektablen Ergebnissen. Da Strukturen möglicherweise einem weiten Bereich von Lastfällen unterliegen, z. statische, zyklische, dynamische, Temperatur usw. Möglichkeit der multidisziplinären Optimierung wurde in Optimierungswerkzeugen bereitgestellt. Um die nichtlineare Reaktion von Zielen zu überwinden und um den hohen Zeitverbrauch von FEM-Analysen in Absturzereignissen zu bewältigen, könnte ein Ersatzmodell vom Benutzer verwendet werden. Die Fähigkeit von Optimierungswerkzeugen, optimale Ergebnisse bei Problemen mit mehreren Zielsetzungen zu präsentieren, wird durch die Verwendung einiger vom Benutzer ausgewählten Fitnessfunktionen verbessert. Eine Unterbaugruppe aus Blechteilen, die zur Automobilkarosserie gehören, ist optimiert, um beide zu verbessern; statischer Lastfall und Crashsicherheit

A Review on Computational Intelligence Techniques in Cloud and Edge Computing

Cloud computing (CC) is a centralized computing paradigm that accumulates resources centrally and provides these resources to users through Internet. Although CC holds a large number of resources, it may not be acceptable by real-time mobile applications, as it is usually far away from users geographically. On the other hand, edge computing (EC), which distributes resources to the network edge, enjoys increasing popularity in the applications with low-latency and high-reliability requirements. EC provides resources in a decentralized manner, which can respond to users’ requirements faster than the normal CC, but with limited computing capacities. As both CC and EC are resource-sensitive, several big issues arise, such as how to conduct job scheduling, resource allocation, and task offloading, which significantly influence the performance of the whole system. To tackle these issues, many optimization problems have been formulated. These optimization problems usually have complex properties, such as non-convexity and NP-hardness, which may not be addressed by the traditional convex optimization-based solutions. Computational intelligence (CI), consisting of a set of nature-inspired computational approaches, recently exhibits great potential in addressing these optimization problems in CC and EC. This article provides an overview of research problems in CC and EC and recent progresses in addressing them with the help of CI techniques. Informative discussions and future research trends are also presented, with the aim of offering insights to the readers and motivating new research directions

Adaptive firefly algorithm for hierarchical text clustering

Text clustering is essentially used by search engines to increase the recall and precision in information retrieval. As search engine operates on Internet content that is constantly being updated, there is a need for a clustering algorithm that offers automatic grouping of items without prior knowledge on the collection. Existing clustering methods have problems in determining optimal number of clusters and producing compact clusters. In this research, an adaptive hierarchical text clustering algorithm is proposed based on Firefly Algorithm. The proposed Adaptive Firefly Algorithm (AFA) consists of three components: document clustering, cluster refining, and cluster merging. The first component introduces Weight-based Firefly Algorithm (WFA) that automatically identifies initial centers and their clusters for any given text collection. In order to refine the obtained clusters, a second algorithm, termed as Weight-based Firefly Algorithm with Relocate (WFAR), is proposed. Such an approach allows the relocation of a pre-assigned document into a newly created cluster. The third component, Weight-based Firefly Algorithm with Relocate and Merging (WFARM), aims to reduce the number of produced clusters by merging nonpure clusters into the pure ones. Experiments were conducted to compare the proposed algorithms against seven existing methods. The percentage of success in obtaining optimal number of clusters by AFA is 100% with purity and f-measure of 83% higher than the benchmarked methods. As for entropy measure, the AFA produced the lowest value (0.78) when compared to existing methods. The result indicates that Adaptive Firefly Algorithm can produce compact clusters. This research contributes to the text mining domain as hierarchical text clustering facilitates the indexing of documents and information retrieval processes