since the 1990’s, network reliability has been considered as a new index for evaluating transportation networks under uncertainty. a large number of studies have been revealed in the literature in this field, which are mostly dedicated to developing relevant measures that can be utilized for the evaluation of vulnerable networks under different sources of uncertainty, such as daily traffic flow...

We give a model for the description of an urban transportation network and we consider the related optimization problem which consists in finding the desing of the network which has the best transportation performances. This will be done by introducing, for every admissible network, a suitable metric space with a distance that inserted into the Monge-Kantorovich cost functional provides the cri...

Network design problem is one of the most complicated and yet challenging problems in transportation planning. The Bi-level, non-convex and integer nature of network design problem has made it into one of the most complicated optimization problems. Inclusion of time dimension to the classical network design problem could add to this complexity. In this paper an Ant Colony System (ACS) has been ...

1 Abstract Traditionally, the design of a transportation system has focused on either vehicle design or the network flow, assuming the other as given. However, to define a system level architecture for a transportation system, it is advantageous to expand the system boundary during the design process to include the network routing, the vehicle specifications, and the operations, which couple th...

    Hub covering location problem, Network design,   Single machine scheduling, Genetic algorithm,   Shuffled frog leaping algorithm   Hub location problems (HLP) are synthetic optimization problems that appears in telecommunication and transportation networks where nodes send and receive commodities (i.e., data transmissions, passengers transportation, express packages, postal deliveries, etc....