The Covering Salesman Problem (CSP) is a generalization of the Traveling in which tour not required to visit all vertices, as long vertices are covered by tour. objective CSP find minimum length Hamiltonian cycle over subset that covers an undirected graph. In this paper, valid inequalities from generalized traveling salesman problem applied addition new explore distinct aspects problem. A bran...

We consider a generalized Path Traveling Salesman Problem where the distances are defined by a 2-edge-connected graph metric and a constant number of salesmen have to cover all the destinations by traveling along paths of minimum total length. We show that for this problem there is a polynomial algorithm with asymptotic approximation ratio of 2 .

It is well known that many arc routing problems can be transformed into the Equality Generalized Traveling Salesman Problem (E-GTSP), which in turn can be transformed into a standard Asymmetric Traveling Salesman Problem (TSP). This opens up the possibility of solving arc routing problems using existing solvers for TSP. This paper evaluates the performance of the state-of-the art TSP solver Lin...

We consider a generalized Path Traveling Salesman Problem where the distances are defined by a 2-edge-connected graph metric and a constant number of salesmen have to cover all the destinations by traveling along paths of minimum total length. We show that for this problem there is a polynomial algorithm with asymptotic approximation ratio of 2 .

The Generalized Traveling Salesman Problem (GTSP) is a modification of the Traveling Salesman Problem in which nodes are partitioned into clusters and exactly one node from each cluster is visited in a cycle. It has numerous applications, including airplane routing, computer file sequencing, and postal delivery. To produce solutions to this problem, a genetic algorithm (GA) heuristic mimicking ...

Manufacturers, who re-supply a large number of customers, continually struggle with the question of how to formulate a replenishment strategy. The purpose of this paper is to determine the optimal set of routes for a group of vehicles in the transportation network under defined constraints – which is known as the Vehicle Routing Problem (VRP) – delivering new items, and resolving the invent...

Many practical problems arising in real world applications, mainly in the fields of logistics and telecommunications, can be modeled as network design or vehicle routing problems. In this thesis we study three combinatorial optimization problems belonging to the classes of Network Design and Vehicle Routing problems that are strongly linked in the context of the design and management of transpo...

Although the m-ATSP (or multi traveling salesman problem) is well known for its importance in scheduling and vehicle routing, it has, to the best of our knowledge, never been studied polyhedraly, i.e., it has always been transformed to the standard ATSP. This transformation is valid only if the cost of an arc from node i to node j is the same for all machines. In many practical applications thi...

Motivated by applications in which a nonholonomic robotic vehicle should sequentially hit a series of waypoints in the presence of stochastic drift, we formulate a new version of the Dubins vehicle traveling salesperson problem. In our approach, we first compute the minimum expected time feedback control to hit one waypoint based on the Hamilton-Jacobi-Bellman equation. Next, minimum expected t...

This paper will address a bio-inspired algorithm able to incrementally grow decision graphs in multiple directions for discrete multi-objective optimization. The algorithm takes inspiration from the slime mould Physarum Polycephalum, an amoeboid organism that in its plasmodium state extends and optimizes a net of veins looking for food. The algorithm is here used to solve multi-objective Travel...