Path planning is a fundamental function of mobile robots that have been nowadays used in
a variety of areas. Evolutionary algorithms (EAs) have been experimentally showed to be …

Garden balsam optimization (GBO) is a new proposed evolutionary algorithm based on
swarm intelligence. Convergence and time complexity analyses are very important in …

A subset S of vertices in a graph G=(V, E) is a connected dominating set of G if every vertex
of V∖ S is adjacent to a vertex in S and the subgraph induced by S is connected. The …

This article proposes a new formulation for the maximum leaf spanning tree problem
(MLSTP) using network flow concepts to ensure the graph connectivity of the problem's …

Runtime analysis of continuous evolutionary algorithms (EAs) is a hard topic in the
theoretical research of evolutionary computation, relatively few results have been obtained …

For complicated problems that cannot be solved in polynomial first hitting time (FHT)/running
time (RT), a remedy is to perform approximate FHT/TH analysis for given approximation …

Evolutionary algorithms have long been quite successfully applied to solve multi-objective
optimization problems. However, theoretical analysis of multi-objective evolutionary …

Evolutionary algorithms (EAs) are stochastic heuristic algorithms which are often
successfully used for solving many optimization problems. However, the rigorous theoretical …

The maximum independent set problem (MISP) is a classic graph combinatorial optimization
problem and it is known to be NP-complete. In this paper, we investigate the performance of …

When evolutionary algorithms (EAs) are unlikely to locate precise global optimal solutions
with satisfactory performances, it is important to substitute alternative theoretical routine for …