Results 1 to 10 of about 28,852 (210)
Solving the Min-Max Clustered Traveling Salesmen Problem Based on Genetic Algorithm [PDF]
Biomimetics, 2023 The min-max clustered traveling salesmen problem (MMCTSP) is a generalized variant of the classical traveling salesman problem (TSP). In this problem, the vertices of the graph are partitioned into a given number of clusters and we are asked to find a ...
Xiaoguang Bao +3 more
doaj +2 more sources
Time-Dependent Traveling Salesman Problem with Multiple Time Windows [PDF]
Annals of computer science and information systems, 2015 The TSP, VRP and OP problems with time constraints have one common sub-problem – the task of finding the minimum route duration for a given order of customers. While much work has been done on routing and scheduling problems with time windows, to this date only few articles considered problems with multiple time windows.
Jarosław Hurkała
doaj +3 more sources
Review of Multiple Traveling Salesman Model and Its Application [PDF]
Jisuanji kexue yu tansuo, 2022 As a generalization of the classical traveling salesman problem (TSP), the multiple traveling salesman problem (MTSP) is one of the well-known combinatorial optimization problems.
ZHANG Shuohang, GUO Gaizhi
doaj +1 more source
Model Penentuan Rute Terpendek Penjemputan Sampah Menggunakan Metode MTSP dan Algoritma Genetika
Journal of Applied Computer Science and Technology, 2021 Garbage pick-ups performed by two or more people must have a route in their pickup. However, it is not easy to model the route of the pickup that each point must be passed and each point is only passed once.
Aswandi +2 more
doaj +1 more source
Model and solution for the traveling salesman problem with multiple time windows [PDF]
ITM Web of Conferences, 2022 This paper applies the multi-time window traveling salesman problem to not only optimize the logistics cost, but also effectively endow users with multiple discrete idle optional time periods to meet the time requirements of just-in-time production.
Zhang Xiaoling, Ni Yueli
doaj +1 more source
Genetic Algorithms for the Multiple Travelling Salesman Problem [PDF]
International Journal of Advanced Computer Science and Applications, 2020 We consider the multiple travelling salesman Problem (MTSP) that is one of the generalization of the travelling salesman problem (TSP). For solving this problem genetic algorithms (GAs) based on numerous crossover operators have been described in the literature. Choosing effective crossover operator can give effective GA.
Maha Ata Al-Furhud, Zakir Hussain
openaire +1 more source
Approximation of the Double Traveling Salesman Problem with Multiple Stacks
Theoretical Computer Science, 2021 The Double Travelling Salesman Problem with Multiple Stacks, DTSPMS, deals with the collect and delivery of n commodities in two distinct cities, where the pickup and the delivery tours are related by LIFO constraints. During the pickup tour, commodities are loaded into a container of k rows, or stacks, with capacity c.
Alfandari, Laurent, Toulouse, Sophie
openaire +3 more sources
A Multi-Phase Method for Euclidean Traveling Salesman Problems
Axioms, 2022 The Traveling Salesman Problem (TSP) aims to find the shortest tour for a salesman who starts and ends in the same city and visits the remaining n−1 cities exactly once.
Víctor Hugo Pacheco-Valencia +3 more
doaj +1 more source
The Double Traveling Salesman Problem with Multiple Stacks and a Choice of Container Types
Mathematics, 2020 The double traveling salesman problem with multiple stacks involves the transportation of goods between two regions. In one region, a vehicle carrying a container visits customers, where pallets of goods are loaded into the container.
Lars Magnus Hvattum +2 more
doaj +1 more source
A new local search for the bees algorithm to optimize multiple traveling salesman problem
Intelligent Systems with Applications, 2023 This paper presents a new local search operator with the Bees Algorithm (BA) to solve the Multiple Traveling Salesman Problem (MTSP), which is a kind of combinatorial optimization problem.
Ali Hamza +2 more
doaj +1 more source