Abstract Multiple Traveling Salesman Problem (MTSP) is able to model and solve various
real-life applications such as multiple scheduling, multiple vehicle routing and multiple path …

Multiple traveling salesperson problems (m TSP) are a collection of problems that
generalize the classical traveling salesperson problem (TSP). In a nutshell, an m TSP …

The travelling salesman problem (TSP) and its variants have been studied extensively due
to its wide range of real-world applications, yet there are challenges in providing efficient …

This paper introduces a novel practical variant, namely an open close multiple travelling
salesmen problem with single depot (OCMTSP) that concerns the generalization of classical …

Рассматривается задача оптимального планирования маршрутов полета однотипных
БПЛА при групповом патрулировании территорий большой протяженности …

Optimasi produksi perlu diperhatikan agar didapatkan jumlah produksi yang optimal, yang
mana hal ini akan berhubungan dengan profit perusahaan. Selain itu rute distribusi yang …

This paper introduces the multi-depot multi-travelling salesman problem with split and
delivery demand (M m TSP-SD). The problem has been formulated as a flexible optimisation …

Este artículo introduce una metodología para abordar la gestión logística al generar planes
de trabajo basado en el problema del Agente Viajero Múltiple (MTSP) y tienen como …

The genetic algorithm is one of the best algorithms in order to solve many combinatorial
optimization problems, especially traveling salesman problem. The application of genetic …

The Travelling Salesman Problem (TSP) is a well-known problem in the operations research
field. This research focuses on solving variants of the TSP through the use of proper …