Heuristic computational intelligence techniques are widely used in combinatorial
optimization problems, essentially in large size configurations. Bio-inspired heuristics such …

In this paper, a parameter adaptation-based ant colony optimization (ACO) algorithm based
on particle swarm optimization (PSO) algorithm with the global optimization ability, fuzzy …

In this study, an improved salp swarm algorithm based on particle swarm optimization for
maximum power point tracking of optimal photovoltaic systems is investigated. The effect of …

This paper focuses on the systematic review of various metaheuristic techniques employed
for analysing different software quality aspects, including fault proneness, defect …

The Traveling Salesman Problem (TSP) is a combinatorial optimization problem that is
useful in a number of applications. Since there is no known polynomial-time algorithm for …

E-commerce is expanding their roots in every business. Fast, efficient, reliable, timely
delivery of goods and optimal transportation cost are the major challenges in e-commerce …

Aiming at the problem that Ant Colony Optimization (ACO) is subject primarily to the
parameters, we propose a hybrid algorithm SOA-ACO-2Opt to optimize the ACO parameter …

Epistasis effects are depicted as interactions between different single nucleotide
polymorphism (SNPs). It plays an essential role to recognise the individual susceptibility to …

Ant colony optimization (ACO) is prone to get into the local optimum and has a slow
convergence speed when it is applied to the traveling salesman problem (TSP). Therefore …

The path planning problems for unmanned aerial vehicles (UAVs) can be considered as
large scale global optimisation (LSGO) problems. Collision-free and smoother flyable paths …