An Efficient Transformation Of The Generalized Traveling Salesman Problem

A way to optimally solve a time-dependent Vehicle Routing Problem with Time Windows

“…Next we present a transformation of the GVRP defined in G" into an ACVRP, that can be considered an extension to a multivehicle case of the one given by Noon and Bean ( [15]) for a single vehicle problem. …”

A new genetic algorithm for the asymmetric traveling salesman problem

“…In most of these articles, the transformations they propose consist of two steps. They first transform their problem into another combinatorial optimization problem, namely the asymmetric generalized traveling salesman problem (AGTSP), which in turn can be transformed into an ATSP (see, e.g., Noon and Bean (1993) or Ben-Arieh et al (2003)). The AGTSP is actually a generalization of the ATSP in which each customer has several alternative locations and only one of them has to be selected for service.…”

Algorithms for the traveling Salesman Problem with Neighborhoods involving a dubins vehicle

“…Obermeyer was the first to tackle the TSPN with Dubins vehicle dynamics in [15] using a genetic algorithm approach, then later in [16] by using a sampling based roadmap method which we will call RCM that is proven to be resolution complete. In the latter method, the DTSPN is transformed to a General Traveling Salesman Problem (GTSP) with non-overlapping nodesets and then to an Asymmetric Traveling Salesmen Problem (ATSP) through a version of the Noon and Bean transformation [17]. This is a similar approach to that used in [9] for the DTSP.…”