Hybrid search with neighborhood reduction for the multiple traveling salesman problem
We present an effective hybrid algorithm with neighborhood reduction for solving the
multiple traveling salesman problem (mTSP). This problem aims to optimize one of the two …
multiple traveling salesman problem (mTSP). This problem aims to optimize one of the two …
Applying a genetic algorithm to a m-TSP: case study of a decision support system for optimizing a beverage logistics vehicles routing problem
Route optimization has become an increasing problem in the transportation and logistics
sector within the development of smart cities. This article aims to demonstrate the …
sector within the development of smart cities. This article aims to demonstrate the …
Hybrid fleet capacitated vehicle routing problem with flexible Monte–Carlo Tree search
The rise in EVs popularity, combined with reducing emissions and cutting costs, encouraged
delivery companies to integrate them in their fleets. The fleet heterogeneity brings new …
delivery companies to integrate them in their fleets. The fleet heterogeneity brings new …
Promoting intelligent IoT-driven logistics through integrating dynamic demand and sustainable logistics operations
Developing a more convenient and sustainable logistics delivery operation model has
become a consensus need for both academics and practitioners. However, the existing …
become a consensus need for both academics and practitioners. However, the existing …
Ant-Balanced Multiple Traveling Salesmen: ACO-BmTSP
S de Castro Pereira, EJ Solteiro Pires… - Algorithms, 2023 - mdpi.com
A new algorithm based on the ant colony optimization (ACO) method for the multiple
traveling salesman problem (mTSP) is presented and defined as ACO-BmTSP. This paper …
traveling salesman problem (mTSP) is presented and defined as ACO-BmTSP. This paper …
[HTML][HTML] Traveling of multiple salesmen to dynamically changing locations for satisfying multiple goals
Polymer grade scheduling, maritime surveillance, e-food delivery, e-commerce, and military
tactics necessitate multiple agents (eg, extruders, speed boats, salesmen) capable of visiting …
tactics necessitate multiple agents (eg, extruders, speed boats, salesmen) capable of visiting …
Optimizing the Cleaning and Disinfection Scheme for Dockless Shared Bikes
Shared bikes can help cities achieve carbon neutrality goals. Cleaning and disinfection are
vital procedures of the maintenance of shared bikes, especially during the COVID‐19 …
vital procedures of the maintenance of shared bikes, especially during the COVID‐19 …
An Algorithm for the Euclidean Bounded Multiple Traveling Salesman Problem
V Pacheco-Valencia, N Vakhania - arXiv preprint arXiv:2405.18615, 2024 - arxiv.org
In the Bounded Multiple Traveling Salesman Problem (BMTSP), a tour for each salesman,
that starts and ends at the depot and that respects the bounds on the number of cities that a …
that starts and ends at the depot and that respects the bounds on the number of cities that a …
[HTML][HTML] Популяционный алгоритм решения задачи коммивояжера
ЕЕ Полупанова, АС Поляков - … информационные технологии и …, 2021 - cyberleninka.ru
В данной статье рассматривается популяционный гибридный алгоритм решения
задачи коммивояжера, построенный с применением двух алгоритмов-генетического и …
задачи коммивояжера, построенный с применением двух алгоритмов-генетического и …
[PDF][PDF] Research Article Optimizing the Cleaning and Disinfection Scheme for Dockless Shared Bikes
Shared bikes can help cities achieve carbon neutrality goals. Cleaning and disinfection are
vital procedures of the maintenance of shared bikes, especially during the COVID-19 …
vital procedures of the maintenance of shared bikes, especially during the COVID-19 …