In the context of motion planning in robotics, the problem of path planning based on artificial
potential fields has been examined using different algorithms to avoid trapping in local …

In this paper, we propose a novel ant colony optimization algorithm based on improved
brainstorm optimization (IBSO-ACO) to solve the vehicle routing problem with soft time …

Heuristic calculation is an essential method to solve optimisation problems. However, its
vast computing requirements limit its real-time and online applications, especially in …

This paper presents a new heuristic approach for multiple traveling salesmen problem
(mTSP) and other variants of the TSP. In this approach, the TSP and its variants are seen as …

The number of variants of the vehicle routing problem (VRP) has grown rapidly in the last
decades. Among these, VRPs with time window constraints are among the most studied …

In this paper, we propose novel Ising machines hyperparameter tuning techniques for
practical use when handling multiple combinatorial problem instances in a short period of …

Kernel k-means and spectral clustering methods have both been used extensively to cluster
data that are non-linearly separable in input space. While there has been significant …

Transportation in economic systems such as services, production and distribution enjoys a
special and important position and provides a significant portion of the country's gross …

We regard monitoring of a river or water basin. We propose a method for calculating the
work carried out as part of this activity. A group of autonomous unmanned underwater …

This thesis is divided into two parts. In the first part, I describe efficient meta-heuristic
algorithms for a series of combinatorially complex optimization problems, while the second …