Branch-and-bound for the precedence constrained generalized traveling salesman problem
Artikel i vetenskaplig tidskrift, 2020
The Precedence Constrained Generalized Traveling Salesman Problem (PCGTSP) combines the Generalized Traveling Salesman Problem (GTSP) and the Sequential Ordering Problem (SOP). We present a novel branching technique for the GTSP which enables the extension of a powerful pruning technique. This is combined with some modifications of known bounding methods for related problems. The algorithm manages to solve problem instances with 12-26 groups within a minute, and instances with around 50 groups which are denser with precedence constraints within 24 hours.
Minimum spanning arborescence problem
Generalized traveling salesman problem
Assignment problem
Branch-and-bound
Sequential ordering problem
Precedence constraints
Författare
Raad Salman
Stiftelsen Fraunhofer-Chalmers Centrum för Industrimatematik
Fredrik Ekstedt
Stiftelsen Fraunhofer-Chalmers Centrum för Industrimatematik
Peter Damaschke
Chalmers, Data- och informationsteknik, Data Science
Operations Research Letters
0167-6377 (ISSN)
Vol. 48 2 163-166Fundament
Grundläggande vetenskaper
Ämneskategorier
Systemvetenskap
DOI
10.1016/j.orl.2020.01.009