SCHÖBEL , Anita

We introduce the path player game, a noncooperative network game with a continuum of mutually dependent set of strategies. This game models network flows from the point of view of competing network operators. The players are represented by paths in the network. They have to decide how much flow shall be routed along their paths. The competitive...

Finding robust solutions of an optimization problem is an important issue in practice, and various con- cepts on how to define the robustness of a solution have been suggested. The idea of recoverable robust- ness requires that a solution can be recovered to a feasible one as soon as the realized scenario becomes known. The usual approach in...

In this paper we consider the location of stops along the edges of an already existing public transportation network. The positive effect of new stops is given by the better access of the passengers to the public transport network, while the passengers' traveling time increases due to the additional stopping activities of the trains, which is a...

A global optimization procedure is proposed to find a line in the Euclidean three-dimensional space which minimizes the sum of distances to a given finite set of three-dimensional data points. Although we are using similar techniques as for location problems in two dimensions, it is shown that the problem becomes much harder to solve. However,...

In this paper we consider a set of origin-destination pairs in a mixed model in which a network embedded in the plane represents an alternative high-speed transportation system, and study a trip covering problem which consists on locating two points in the network which maximize the number of covered pairs, that is, the number of pairs which...

In this paper we consider a trip covering location model in a mixed planar-network space. An embed- ded network in the plane represents an alternative transportation system in which traveling is fasterthan traveling within the plane. We assume that the demand to be covered is given by a set of origin- destination pairs in the plane, with some...

In this paper the following facility location problem in a mixed planarnetwork space is considered: We assume that traveling along a given network is faster than traveling within the plane according to the Euclidean distance. A pair of points (Ai,Aj ) is called covered if the time to access the network from Ai plus the time for traveling along...