Displaying similar documents to “Applications of a Special Polynomial Class of Tsp”

An optimal path planning problem for heterogeneous multi-vehicle systems

Martin Klaučo, Slavomír Blažek, Michal Kvasnica (2016)

International Journal of Applied Mathematics and Computer Science

Similarity:

A path planning problem for a heterogeneous vehicle is considered. Such a vehicle consists of two parts which have the ability to move individually, but one of them has a shorter range and is therefore required to keep in a close distance to the main vehicle. The objective is to devise an optimal path of minimal length under the condition that at least one part of the heterogeneous system visits all desired waypoints exactly once. Two versions of the problem are considered. One assumes...

Multiple routing strategies in a labelled network

J. Maublanc, D. Peyrton, A. Quilliot (2001)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

We present here models and algorithms for the construction of efficient path systems, robust to possible variations of the characteristics of the network. We propose some interpretations of these models and proceed to numerical experimentations of the related algorithms. We conclude with a discussion of the way those concepts may be applied to the design of a Public Transportation System.

The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets

T. Brian Boffey, R. C. Williams, B. Pelegrín, P. Fernandez (2010)

RAIRO - Operations Research

Similarity:

Individual items of flow in a telecommunications or a transportation network may need to be separated by a minimum distance or time, called a “headway”. If link dependent, such restrictions in general have the effect that the minimum time path for a “convoy” of items to travel from a given origin to a given destination will depend on the size of the convoy. The Quickest Path problem seeks a path to minimise this convoy travel time. A closely related bicriterion problem is the Maximum...

On the minimum cost multiple-source unsplittable flow problem

Meriema Belaidouni, Walid Ben-Ameur (2007)

RAIRO - Operations Research

Similarity:

The minimum cost multiple-source unsplittable flow problem is studied in this paper. A simple necessary condition to get a solution is proposed. It deals with capacities and demands and can be seen as a generalization of the well-known semi-metric condition for continuous multicommdity flows. A cutting plane algorithm is derived using a superadditive approach. The inequalities considered here are valid for single knapsack constraints. They are based on nondecreasing superadditive functions...