Activity-based scheduling optimization is a combinatorial problem built on the traveling
salesman problem intending to optimize people schedules considering their trips and the …

Abstract The Jaya Algorithm is a relatively new population-based optimization, which has
become a progressively valuable tool in swarm intelligence. The Jaya algorithm …

The traveling salesman problem (TSP) is one of the most intensively studied problems in
computational mathematics. This paper proposes a swarm intelligence approach using a …

The development of an accurate nitrogen oxide (NO x) prediction model is difficult because
of multiple parameters, strong coupling, and long delay time of selective catalytic reduction …

The ant colony optimization (ACO) is one efficient approach for solving the travelling
salesman problem (TSP). Here, we propose a hybrid algorithm based on state-adaptive …

As a recent swarm intelligence optimization algorithm, sparrow search algorithm (SSA) is
widely adopted in many real-world problems. However, the solutions to the limitations of …

Abstract The Asymmetric Traveling Salesman Problem (ATSP), as a branch of the traveling
salesman problem, aims to find a group of circuits when a salesman travels all cities at the …

Energy consumption is getting rising gradually around the planet. Therefore, the importance
of energy management has increased for all nations worldwide, and long-term energy …

With the increasing prevalence of automated guided vehicles (AGVs), the multi-AGV
scheduling problem has become a hot research topic in recent years. However, little …

The Traveling Salesman Problem (TSP) which is a theoretical computer science and
operations research problem, has several applications even in its purest formulation, such …