Reliability-based route optimization of a transportation network with random arc capacities and time threshold

Authors:
Tao Zhang;Bo Guo;Yuejin Tan
Affiliations:
College of Information Systems and Management, National University of Defense Technology, Changsha, China;College of Information Systems and Management, National University of Defense Technology, Changsha, China;College of Information Systems and Management, National University of Defense Technology, Changsha, China
Venue:
IUKM'11 Proceedings of the 2011 international conference on Integrated uncertainty in knowledge modelling and decision making
Year:
2011

Citing 9
Cited 0

Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
Minimum cost-reliability ratio path problem

Computers and Operations Research
A label-setting algorithm for finding a quickest path

Computers and Operations Research
Performance Analysis Using Stochastic Petri Nets

IEEE Transactions on Computers
Two-commodity reliability evaluation of a stochastic-flow network with varying capacity weight in terms of minimal paths

Computers and Operations Research
Time Petri nets as an evaluation tool for handling travel time uncertainty in vehicle routing solutions

Expert Systems with Applications: An International Journal
Routing policy of stochastic-flow networks under time threshold and budget constraint

Expert Systems with Applications: An International Journal
Time version of the shortest path problem in a stochastic-flow network

Journal of Computational and Applied Mathematics
An algorithm to evaluate the system reliability for multicommodity case under cost constraint

Computers & Mathematics with Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The classical route optimization problem of a network focuses on the shortest or fastest route mainly under the assumption that all roads will not fail. In fact, the capacities of roads in a transportation network are not determinate but random because of the traffic accidents, maintenance or other activities. So a most reliable route from source to sink under the time threshold may be more important than the shortest or fastest route sometimes. This paper describes a stochastic Petri net-based simulation approach for reliability-based route optimization of a transportation network. The capacities of arcs may be in a stochastic state following any discrete or continuous distribution. The transmission time of each arc is also not a fixed number but stochastic according to its current capacity and demand. To solve this problem, a capacitated stochastic colored Petri net is used for modeling the system behavior. By the simulation, the optimal route with highest reliability can be obtained. Finally, an example of a transportation network with random arc capacities is given.