we propose to use a mathematical method based on stochastic comparisons of markov chains in order to derive performance indice bounds‎. ‎the main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (fcfs) orbit and general retrial times using the stochastic ordering techniques‎.

We study the strategic interaction among vehicles in a non-cooperative platoon coordination game. Vehicles have predefined routes transportation network with set of hubs where can wait for other to form platoons. decide on their waiting times at and utility function each vehicle includes both benefit from platooning cost waiting. show that game is potential when travel are either deterministic ...

The problem of adaptive routing in a network with failures is considered The network may be in one of nitely many states characterized by di erent travel times along the arcs and transi tions between the states occur according to a continuous time Markov chain The objective is to develop a routing strategy that minimizes the total expected travel time Dynamic programming models and ow oriented ...

In this paper, a new multi-objective path-finding model is proposed to find optimal paths in road networks with time-dependent stochastic travel times. This study is motivated by the fact that different travelers usually have different route-choice preferences, often involving multiple conflicting criteria such as expected path travel time, variance of path travel time and so forth. However, mo...

5 The dominant method for measuring values of travel time savings (VOT), and values of travel time 6 reliability (VOR) is discrete choice modeling. Generally, the data sources for these models are: stated 7 choice experiments, and revealed preference observations. There are few studies using revealed prefer8 ence data. These studies have only used travel times measured by devices such as loop d...

In this study, a non-linear optimization-based conceptual framework is proposed for incorporating stochastic capacity, travel time performance functions and varying degrees of traveler knowledge in an advanced traveler information provision environment. The proposed method categorizes commuters into two classes: (1) those with access to perfect traffic information every day, and (2) those with ...

There is a growing recognition that discrete choice models are capable of providing a more realistic picture of route choice behavior. In particular, influential factors other than travel time that are found to affect the choice of route trigger the application of random utility models in the route choice literature. This paper focuses on path-based, logit-type stochastic route choice models, i...