Nature-inspired Parameter Controllers for ACO-based Reactive Search

Abstract

This study proposes machine learning strategies to control the parameter adaptation in ant colony optimization algorithm, the prominent swarm intelligence metaheuristic. The sensitivity to parameters' selection is one of the main limitations within the swarm intelligence algorithms when solving combinatorial problems. These parameters are often tuned manually by algorithm experts to a set that seems to work well for the problem under study, a standard set from the literature or using off-line parameter tuning procedures. In the present study, the parameter search process is integrated within the running of the ant colony optimization without incurring an undue computational overhead. The proposed strategies were based on a novel nature-inspired idea. The results for the travelling salesman and quadratic assignment problems revealed that the use of the augmented strategies generally performs well against other parameter adaptation methods.

Analisis Belanja Modal Teknologi Informasi Menggunakan Fungsi Produksi Cobb Douglas Pada Perusahaan Berbasis Ti

“…Keuntungan berinvestasi TI dapat berwujud dan tidak berwujud. Ada manfaat yang bisa langsung dirasakan, ada pula manfaat yang baru bisa dirasakan setelah jangka waktu tertentu [14]. Namun, dalam banyak kasus, manfaat ini tidak sesuai dengan hasil bisnis terbesar perusahaan.…”

Adaptive Cultural Algorithm-Based Cuckoo Search for Time-Dependent Vehicle Routing Problem with Stochastic Customers Using Adaptive Fractional Kalman Speed Prediction

“…To avoid sensitivity to parameters selection, which is one of the main limitations in swarm intelligence algorithms, adaptive mechanism is adopted into CACS. ACO [28] used for comparison also proposed machine learning strategies to control the parameter adaptation. e objective function by different p and different algorithms is listed in Table 7.…”

Adaptive Parameter Control Strategy for Ant-Miner Classification Algorithm

“…ACO is a swarm-intelligence metaheuristic algorithm used to solve combinatorial optimization problems. This algorithm was first applied to the traveling salesman problem and has since been widely applied to a variety of NP-hard optimization problems, such as quadratic assignment problems, vehicle routing with time windows, grid computing, and data mining [21], [22]. The first ACO algorithm is the ant system, proposed by Dorigo et al in the 1990s [23].…”