This thesis focuses on algorithmic design for three combinatorial optimization problems related to transportation, logistics and production research with specific types of indus- trial constraints. First, we consider the Precedence Constrained Generalized Traveling Salesman Problem (PCGTSP). This problem is an extension of two well-known combinatorial optimization problems — the Generalized Traveling Salesman Problem (GTSP) and the Precedence Constrained Asymmetric Traveling Salesman Problem (PCATSP), whose path version is known as the Sequential Ordering Problem (SOP).
[Read more]