Leveraging saving-based algorithms by master-slave genetic algorithms
Abstract
Saving-based algorithms are commonly used as inner mechanisms of efficient heuristic construction procedures. We present a general mechanism for enhancing the effectiveness of such heuristics based on a two-level genetic algorithm. The higher-level algorithm searches in the space of possible merge lists which are then used by the lower-level saving-based algorithm to build the solution. We describe the general framework and we illustrate its application to three hard combinatorial problems. Experimental results on three hard combinatorial optimization problems show that the approach is very effective and it enables considerable enhancement of the performance of saving-based algorithms. (C) 2011 Elsevier Ltd. All rights reserved.
Source
Engineering Applications of Artificial IntelligenceVolume
24Issue
4Collections
Related items
Showing items related by title, author, creator and subject.
-
An energy-aware scheme for solving the routing problem in the internet of things based on jaya and flower pollination algorithms
Sadrishojaei, M.; Navimipour, N.J.; Reshadi, M.; Hosseinzadeh, M. (Springer Science and Business Media Deutschland GmbH, 2023)Clustering and routing protocols for Internet of Things (IoT) need to consider energy usage and how to reduce it. Unbalanced power usage is a common concern with current solutions to cluster-based routing problems in the ... -
Improving the accuracy of indoor positioning system
Hameez, Mohammed Muwafaq Noori (Kadir Has Üniversitesi, 2019)Indoor positioning applications needs high accuracy and precision to overcome the existing obstacles and relatively small areas. There are several methods which could be used to locate an object or people in an indoor ... -
A memetic random-key genetic algorithm for a symmetric multi-objective traveling salesman problem
Samanlıoğlu, Funda; Ferrell, William G., Jr.; Kurz, Mary E. (Pergamon-Elsevier Science Ltd, 2008)This paper proposes a methodology to find weakly Pareto optimal solutions to a symmetric multi-objective traveling salesman problem using a memetic random-key genetic algorithm that has been augmented by a 2-opt local ...