AAAI Publications, Thirteenth Annual Symposium on Combinatorial Search

Font Size: 
Branch-and-Bound for the Precedence Constrained Generalized Traveling Salesman Problem
Raad Salman, Fredrik Ekstedt, Peter Damaschke

Last modified: 2020-05-08

Abstract


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.


Full Text: PDF