Proceedings ArticleDOI
A transformation for a Multiple Depot, Multiple Traveling Salesman Problem
Paul Oberlin,Sivakumar Rathinam,Swaroop Darbha +2 more
- pp 2636-2641
TLDR
In 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.Abstract:
In 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. To test the effectiveness of the transformation, some computational results are presented by applying the well known LKH heuristic on the transformed problem for instances involving Dubins vehicles. Results show that the transformation is effective and high quality solutions can be found for large instances in a relatively short time.read more
Citations
More filters
Journal ArticleDOI
Multirobot Rendezvous Planning for Recharging in Persistent Tasks
TL;DR: The problem is solved by first formulating the rendezvous planning problem to recharge each UAV once using both an integer linear program and a transformation to the Travelling Salesman Problem, and then leveraged to plan recurring rendezvous' over longer horizons using fixed horizon and receding horizon strategies.
Proceedings ArticleDOI
A transformation for a Heterogeneous, Multiple Depot, Multiple Traveling Salesman Problem
TL;DR: This paper presents a transformation of a Heterogeneous, Multiple Depot, Multiple Traveling Salesman Problem (HMDMTSP) into a single, Asymmetric, Traveling salesman problem (ATSP), and results show that good quality solutions can be obtained for the HMD MTSP relatively fast.
Journal ArticleDOI
A comprehensive survey on the Multiple Traveling Salesman Problem: Applications, approaches and taxonomy
TL;DR: In this paper, the authors provide a comprehensive review of existing studies on MTSP and highlight the approaches applied to solve the MTSP as well as its application domains, and propose a taxonomy and a classification of recent studies.
Proceedings ArticleDOI
coRide: carpool service with a win-win fare model for large-scale taxicab networks
TL;DR: This paper presents the first systematic work to design, implement, and evaluate a carpool service, called coRide, in a large-scale taxicab network intended to reduce total mileage for less gas consumption and presents a win-win fare model as the incentive mechanism for passengers and drivers to participate.
coRide: Carpool Service with a Win-Win Fare Model for Large-Scale
Desheng Zhang,李晔,张帆 +2 more
TL;DR: In this article, a carpool service, called coRide, is proposed in a large-scale taxicab network intended to reduce total mileage for less gas consumption, and the system consists of three components, a dispatching cloudserver, passenger clients, and an onboard customized device, called TaxiBox.
References
More filters
MonographDOI
The vehicle routing problem
Paolo Toth,Daniele Vigo +1 more
TL;DR: In this paper, the authors present a comprehensive overview of the most important techniques proposed for the solution of hard combinatorial problems in the area of vehicle routing problems, focusing on a specific family of problems.
Journal ArticleDOI
On curves of minimal length with a constraint on average curvature, and with prescribed initial and terminal positions and tangents
Journal ArticleDOI
An effective implementation of the Lin–Kernighan traveling salesman heuristic
TL;DR: An implementation of the Lin–Kernighan heuristic, one of the most successful methods for generating optimal or near-optimal solutions for the symmetric traveling salesman problem (TSP), is described.
Journal ArticleDOI
Models, relaxations and exact approaches for the capacitated vehicle routing problem
Paolo Toth,Daniele Vigo +1 more
TL;DR: This paper reviews the exact algorithms based on the branch and bound approach proposed in the last years for the solution of the basic version of the vehicle routing problem (VRP), where only the vehicle capacity constraints are considered, and concludes by examining possible future directions of research in this field.
Journal ArticleDOI
Motion planning for multitarget surveillance with mobile sensor agents
Zhijun Tang,Umit Ozguner +1 more
TL;DR: A gradient-approximation algorithm is proposed to generate a suboptimal loop path for a mobile agent to traverse a sequence of target points in the multi-MSA-multitarget case and a cooperative online motion-planning approach is developed.