The shortest tour distance for visiting all points exactly once and returning to the origin is
computed by solving the well-known traveling salesman problem (TSP). Owing to the large …

In this article, we have introduced an advanced new method of solving a traveling salesman
problem (TSP) with the whale optimization algorithm (WOA), and K-means which is a …

Travelling Salesman Problem (TSP) can be applied to find the most efficient route to travel
between various nodes. The goal is to make smart cities to be created by heuristic …

Improvement in physical network infrastructure is often required to enhance the services
provided by telecommunication companies to meet consumer demand. One aspect of …

The advancements in precision agriculture are vi-tal to support the increasing demand for
global food supply. Precision spot spraying is a major step towards reducing chemicalusage …

This paper reviews recent research work on applying the well-known Travelling Salesman
Problem (TSP) optimization technique in construction scheduling and then discusses its …

The shortest tour distance for visiting all points exactly once and returning to the origin is
computed by solving the well-known Traveling Salesman Problem (TSP). Due to the large …

We propose a new Ant Colony Algorithm (ACO) which is a Hybrid combination of ACO with
Simulated Annealing (SA). We call this algorithm the ACOSA algorithm. This new algorithm …

Strategy is used to solve nonlinear swarm intelligence optimization problems where social
sharing of information helps individual to get benefit from before experience of other …

Sentiment analysis has attracted researchers in recent years which aims to present an
automatic method for analyzing comments, assessments, opinions and sentiments of a text …