Balanced multiple traveling salesmen problems (BMTSP) are a popular kind of
combinatorial optimization problems widely existing in the real world. This problem aims to …

VANET has been an area of great interest and exploration for researchers to solve several
challenging issues regarding communication, topology, security etc. in the last few years …

Abstract Travelling Salesman Problem (TSP) is one of the significant problems in computer
science which tries to find the shortest path for a salesman who needs to visit a set of cities …

Vehicle routing problem is an interesting combinatoric research problem of NP-complete
class for investigation. Many researchers in the past have targeted this interesting …

There is a technological transformation from wireless telephony to VANET network, from the
mobile node to a vehicle node and from the transport system to the Intelligent transport …

This paper illustrates and gives a complete picture of the TSP using Hungarian algorithm.
The problem will notify the salesman with the order of places in which he has to travel, when …

The potholes in the road cause substantial monetary and physical damage to the ongoing
traffic. Also, it requires extensive maintenance, especially in areas where the temperature …

Abstract Vehicle Routing Problem being a combinatorial class of problems has implications
in various areas and applications where traditional methods to find a search space either fail …

В последнее время основным способом повышения производительности
вычислительных устройств стало увеличение числа вычислительных ядер в …

In the realm of parallel computing, optimization plays a pivotal role in achieving efficient and
scalable solutions. In this work, we present the parallelization of a hybrid genetic search for …