Results 11 to 20 of about 28,986 (210)
Exact methods for the traveling salesman problem with multiple drones
Transportation Research Part C: Emerging Technologies, 2021 Drone delivery is drawing increasing attention in last-mile delivery. Effective solution methods to solve decision-making problems arising in drone delivery allow to run and assess drone delivery systems. In this paper, we focus on delivery systems with a single traditional vehicle and multiple drones working in tandem to fulfill customer requests.
Cavani S., Iori M., Roberti R.
openaire +5 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
A hybrid genetic algorithm for the min–max Multiple Traveling Salesman Problem
Computers & Operations ResearchThis paper proposes a hybrid genetic algorithm for solving the Multiple Traveling Salesman Problem (mTSP) to minimize the length of the longest tour. The genetic algorithm utilizes a TSP sequence as the representation of each individual, and a dynamic programming algorithm is employed to evaluate the individual and find the optimal mTSP solution for ...
Sasan Mahmoudinazlou, Changhyun Kwon
openaire +5 more sources
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
Efficient Approximations for Many-Visits Multiple Traveling Salesman Problems
, 2021 25 pages, 3 ...
Bérczi, Kristóf +2 more
openaire +2 more sources
Modeling the flying sidekick traveling salesman problem with multiple drones
Networks, 2021 AbstractThis article considers a version of the flying sidekick traveling salesman problem in which parcels are delivered to customers by either a truck or a set of identical flying drones. The flights of the drones are limited by the battery endurance and each flight is made of a launch, a service to a customer, and a return: launch and return must ...
Mauro Dell'Amico +2 more
openaire +2 more sources
An Algorithm for Mapping the Asymmetric Multiple Traveling Salesman Problem onto Colored Petri Nets
Algorithms, 2018 The Multiple Traveling Salesman Problem is an extension of the famous Traveling Salesman Problem. Finding an optimal solution to the Multiple Traveling Salesman Problem (mTSP) is a difficult task as it belongs to the class of NP-hard problems.
Furqan Hussain Essani, Sajjad Haider
doaj +1 more source
Multiple Carrier-Vehicle Travelling Salesman Problem
, 2020 In this paper the Carrier-Vehicle Travelling Salesman Problem (CV-TSP) is extended to the case of 2 carriers and one small vehicle. The paper defines a minimum-time trajectory mission plan for the visit of a group of target points by the small vehicle.
Fahradyan, Tigran +2 more
openaire +2 more sources
A Genetic Algorithm with New Local Operators for Multiple Traveling Salesman Problems
International Journal of Computational Intelligence Systems, 2018 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 planning problems, etc.
Kin-Ming Lo +5 more
doaj +1 more source