scholarly journals A branch-and-cut algorithm for the generalized traveling salesman problem with time windows

2020 ◽  
Vol 286 (3) ◽  
pp. 849-866 ◽  
Author(s):  
Yuan Yuan ◽  
Diego Cattaruzza ◽  
Maxime Ogier ◽  
Frédéric Semet
Keyword(s):  
Traveling Salesman Problem ◽  
Time Windows ◽  
Branch And Cut ◽  
Traveling Salesman ◽  
Generalized Traveling Salesman Problem

scholarly journals Heterogeneous Task Allocation and Sequencing via Decentralized Large Neighborhood Search

2017 ◽  
Vol 05 (02) ◽  
pp. 79-95 ◽  
Author(s):  
Armin Sadeghi ◽  
Stephen L. Smith
Keyword(s):  
Traveling Salesman Problem ◽  
Task Allocation ◽  
Branch And Cut ◽  
Traveling Salesman ◽  
Neighborhood Search ◽  
Large Neighborhood Search ◽  
Solution Quality ◽  
Solution Approach ◽  
Large Neighborhood ◽  
Generalized Traveling Salesman Problem

This paper focuses on decentralized task allocation and sequencing for multiple heterogeneous robots. Each task is defined as visiting a point in a subset of the robot configuration space — this definition captures a variety of tasks including inspection and servicing. The robots are heterogeneous in that they may be subject to different differential motion constraints. Our approach is to transform the problem into a multi-vehicle generalized traveling salesman problem (GTSP). To solve the GTSP, we propose a novel decentralized implementation of large-neighborhood search (LNS). Our solution approach leverages the GTSP insertion methods proposed in Fischetti et al. [A branch-and-cut algorithm for the symmetric generalized traveling salesman problem, Oper. Res. 45(3) (1997) 378–394]. to repeatedly remove and reinsert tasks from each robot path. Decentralization is achieved using combinatorial-auctions between the robots on tasks removed from robot’s path. We provide bounds on the length of the dynamically feasible robot paths produced by the insertion methods. We also show that the number of bids in each combinatorial auction, a crucial factor in the runtime, scales linearly with the number of tasks. Finally, we present extensive benchmarking results to characterize both solution quality and runtime, which show improvements over existing decentralized task allocation methods.

A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem

1997 ◽  
Vol 45 (3) ◽  
pp. 378-394 ◽  
Author(s):  
Matteo Fischetti ◽  
Juan José Salazar González ◽  
Paolo Toth
Keyword(s):  
Traveling Salesman Problem ◽  
Branch And Cut ◽  
Traveling Salesman ◽  
Generalized Traveling Salesman Problem

scholarly journals An Optimal Algorithm for the Traveling Salesman Problem with Time Windows

1995 ◽  
Vol 43 (2) ◽  
pp. 367-371 ◽  
Author(s):  
Yvan Dumas ◽  
Jacques Desrosiers ◽  
Eric Gelinas ◽  
Marius M. Solomon
Keyword(s):  
Traveling Salesman Problem ◽  
Optimal Algorithm ◽  
Time Windows ◽  
Traveling Salesman ◽  
The Traveling Salesman Problem

scholarly journals The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm

2008 ◽  
Vol 121 (2) ◽  
pp. 269-305 ◽  
Author(s):  
Irina Dumitrescu ◽  
Stefan Ropke ◽  
Jean-François Cordeau ◽  
Gilbert Laporte
Keyword(s):  
Traveling Salesman Problem ◽  
Branch And Cut ◽  
Traveling Salesman ◽  
Pickup And Delivery ◽  
The Traveling Salesman Problem

A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows

1998 ◽  
Vol 46 (3) ◽  
pp. 330-335 ◽  
Author(s):  
Michel Gendreau ◽  
Alain Hertz ◽  
Gilbert Laporte ◽  
Mihnea Stan
Keyword(s):  
Traveling Salesman Problem ◽  
Time Windows ◽  
Traveling Salesman ◽  
The Traveling Salesman Problem ◽  
Insertion Heuristic
Sign in / Sign up

Export Citation Format

Share Document