Results 171 to 180 of about 28,852 (210)
Some of the next articles are maybe not open access.
A transformation for multiple depot multiple traveling salesman problem
2017 International Conference on Engineering & MIS (ICEMIS), 2017In this paper, we present a transformation for the Multi Depot Multiple TSP (MmTSP) into Asymmetrical TSP (ATSP). The transformation is done by duplicating the depots, and with the aid of a precedence constraint, the salesman in the transformed graph will visit the original depot and its duplicates before proceeding to the next depots.
Mustafa Assaf, Malick Ndiaye
openaire +1 more source
Analytical Hierarchy Process based Multi-objective Multiple Traveling Salesman Problem
2016 International Conference on Autonomous Robot Systems and Competitions (ICARSC), 2016The paper addresses the problem of assigning robots to target locations in the context of a disaster management scenario, while minimizing a set of pre-defined objectives. The problem is formulated as a Multi-objective Multiple Traveling Salesman Problem. A three-phase mechanism based on Analytical Hierarchy Process (AHP) is proposed.
Cheikhrouhou, Omar +2 more
openaire +2 more sources
A transformation for a Multiple Depot, Multiple Traveling Salesman Problem
2009 American Control Conference, 2009In this paper, a Multiple Depot, Multiple Traveling Salesman Problem is transformed into a Single, Asymmetric Traveling Salesman Problem if the cost of the edges satisfy the triangle inequality. This improves on the previously known transformation for a 2-Depot, Multiple Traveling Salesman Problem in the literature.
Paul Oberlin +2 more
openaire +1 more source
The Multiple Flying Sidekicks Traveling Salesman Problem: Parcel Delivery with Multiple Drones
SSRN Electronic Journal, 2019Abstract This paper considers a last-mile delivery system in which a delivery truck operates in coordination with a fleet of unmanned aerial vehicles (UAVs, or drones). Deploying UAVs from the truck enables customers located further from the depot to receive drone-based deliveries.
Chase C. Murray, Ritwik Raj
openaire +1 more source
Enhanced Approaches to Solving the Multiple Traveling Salesman Problem
AIAA Infotech @ Aerospace, 2015Two modifications to the solution methods for the Multiple Traveling Salesman Problem (MTSP) will be presented with a focus on their potential applications to UAV swarm route planning. The scenario discussed in this paper involves a set of randomly distributed cities and a specified number of UAVs.
Nathan Boone, Anoop Sathyan, Kelly Cohen
openaire +1 more source
An improved genetic algorithm for multiple traveling salesman problem
2010 2nd International Asia Conference on Informatics in Control, Automation and Robotics (CAR 2010), 2010Multiple traveling salesman problem, which uses the shortest total route as an optimization criteria, has huge application in both theoretical research and industry. This paper presents an improved genetic algorithm to provide an alternative and effective solution to the problem.
null Wei Zhou, null Yuanzong Li
openaire +1 more source
Approximation Methods for Multiple Criteria Travelling Salesman Problems
1987There has been considerable interest in the use of Tchebycheff procedures as a means of generating nondominated alternatives in multiple criteria optimization [1], [2], [3], [4], [15], [17], [18]. Such procedures require the solution of problems similar to $$ \min \max \left[ {{x_1}{f_1}(x),...,{w_r}{f_r}(x)} \right]x \in S $$ (P) where w1,...,
A. Gupta, A. Warburton
openaire +1 more source
A Two Stage Method for the Multiple Traveling Salesman Problem
International Journal of Applied Metaheuristic Computing, 2020The variation of the traveling salesman problem (TSP) with multiple salesmen (m-TSP) has been studied for many years resulting in diverse solution methods, both exact and heuristic. However, the high difficulty level on finding optimal (or acceptable) solutions has opposed the many efforts of doing so.
Azcarie Manuel Cabrera Cuevas +2 more
openaire +1 more source
Distributed hybrid method to solve multiple traveling salesman problems
2018 International Conference on Advance of Sustainable Engineering and its Application (ICASEA), 2018The traveling salesman problem (TSP) can be defined as the process of finding the shortest path for a given set of cities, starting from base city, visiting all other cities once, and returning to the base city. However, when we consider some of the real word problems such as Routing of School bus, the methods that solve the TSP are not effective to ...
Abdul Hadi M. Alaidi, Ausif Mahmood
openaire +1 more source
A transformation for a Heterogeneous, Multiple Depot, Multiple Traveling Salesman Problem
2009 American Control Conference, 2009Unmanned aerial vehicles (UAVs) are being increasingly used for surveillance missions in civil and military applications. These vehicles can be heterogeneous in the sense that they can differ either in their motion constraints or sensing/attack capabilities.
Paul Oberlin +2 more
openaire +1 more source