1,721,199 research outputs found
Some Applications of the Generalized Vehicle Routing Problem
No full textThe Generalized Vehicle Routing Problem (GVRP) is an extension of the classical Vehicle Routing Problem (VRP) in which the vertex set is partitioned into clusters and vehicles must visit exactly one (or at least one) vertex per cluster. The GVRP provides a useful modelling framework for a wide variety of applications. The purpose of this paper is to provide such examples of applications and models. These include the Travelling Salesman with Profits, several VRP extensions, the Windy Routing Problem, and the design of tandem configurations for automated guided vehicles
The Black and White Traveling Salesman Problem
No full textThe black and white traveling salesman problem (BWTSP) is defined on a graph G whose vertex set is partitioned into
black and white vertices. The aim is to design a shortest Hamiltonian tour on G subject to cardinality and length constraints:
both the number of white vertices as well as the length of the tour between two consecutive black vertices are bounded
above. The BWTSP has applications in airline scheduling and in telecommunications. This paper proposes an integer linear
formulation for the undirected BWTSP, as well as several classes of valid inequalities. An exact branch-and-cut algorithm
is then developed. Extensive tests show that it can solve exactly instances involving up to 100 vertices. The algorithm can
also be applied directly to solve unit demand vehicle routing problems of similar sizes
- …
