Controlled Pool Maintenance for Metaheuristics
نویسندگان
چکیده
Recent metaheuristic developments have proved to be successful especially in cases where their fundamental concepts are complemented with pool-oriented approaches such as scatter search. These algorithms maintain a reference set of high quality solutions which are repeatedly used during the search in order to guarantee a fruitful balance between diversification and intensification. However, maintaining such a pool is not a trivial undertaking. The main problem is to find a balance between the attempt to collect a number of high quality solutions, which often results in similar solution properties, and the need to guarantee a certain degree of diversity in the pool. In the present study we highlight the advantage of pool-oriented design while focusing on controlled input and output operations. We analyze the main pool components for metaheuristics and present a review of the literature on relevant strategies in tabu search, scatter search, and path relinking. Additionally, we provide a synthesis of the literature that highlights the critical aspects of effective pool maintenance.
منابع مشابه
On Metaheuristic “Failure Modes”: A Case Study in Tabu Search for Job-Shop Scheduling
It is widely recognized that long-term memory mechanisms such as reintensification and path relinking can significantly improve the performance of ”core” metaheuristics such as tabu search or iterated local search. Case studies abound, e.g., see [2]. These algorithms are commonly designed around a set or pool of elite, high-quality solutions from which intensification and diversification scheme...
متن کاملA Unified View on Hybrid Metaheuristics
Manifold possibilities of hybridizing individual metaheuristics with each other and/or with algorithms from other fields exist. A large number of publications documents the benefits and great success of such hybrids. This article overviews several popular hybridization approaches and classifies them based on various characteristics. In particular with respect to low-level hybrids of different m...
متن کاملPeriodic flexible maintenance planning in a single-machine production environment
Preventive maintenance is the essential part of many maintenance plans. From the production point of view, the flexibility of the maintenance intervals enhances the manufacturing efficiency. On the contrary, the maintenance departments tend to know the timing of the long term maintenance plans as certain as possible. In a single-machine production environment, this paper proposes a simulation–o...
متن کاملCombining Metaheuristics and Constraint Programming to Solve a Scheduling Problem
In this paper we present a hybrid method, named Quasi Local Search, which combines Simulated Annealing augmented with a type of Tabu List to guide the search globally with Constraint Programming to search locally the optimal solution. The method can also be seen as an integration framework, once the Local Search module is independent of the Constraint Programming one and either can be worked in...
متن کاملOPTIMAL DECOMPOSITION OF FINITE ELEMENT MESHES VIA K-MEDIAN METHODOLOGY AND DIFFERENT METAHEURISTICS
In this paper the performance of four well-known metaheuristics consisting of Artificial Bee Colony (ABC), Biogeographic Based Optimization (BBO), Harmony Search (HS) and Teaching Learning Based Optimization (TLBO) are investigated on optimal domain decomposition for parallel computing. A clique graph is used for transforming the connectivity of a finite element model (FEM) into that of the cor...
متن کامل