This paper advances the field of network disruption analysis by introducing an application to a multi-modal transport network, capitalizing on the redundancies and improved connectivity of an integrated metro-bus network. Metro network resilience to disruptions can be enhanced by leveraging on...

This paper introduces the vehicle routing problem with soft time windows (VRPSTW) in which problem definition differs from ones previously defined in literature. Branch-and-price approach is employed, resulting in a set partitioning master problem and its new subproblem. Novel techniques are...

We determine the exact upper bound of the inefficiency of atomic splittable selfish traffic equilibria with elastic travel demand with and without road pricing. In the previous results, only pseudo-approximation bound were obtained for this case. By comparison, we also conclude that the traffic...

In this paper, discrete choice methods in the form of multinomial logit and latent class models are proposed to explain ticket purchase timing of passenger railway. The choice model and demand functions are incorporated into a revenue optimization problem which jointly considers pricing and seat...

This paper addresses a novel sustainable hub location problem (SHLP) in which two new environmental-based cost functions accounting for air and noise pollution of vehicles are incorporated. To cope with uncertain data incorporated in the model, a mixed possibilistic–stochastic programming...

This paper focuses on the planning of road restoration efforts during disaster response and recovery. The primary objective is to maximize network accessibility for all locations in the area during the restoration process so that survivors are evacuated and road side debris is removed as soon as...

This paper investigates whether fast capacity expansions as a means to narrow cost differentials between a de novo airline entrant and established incumbents helps or hinders the survival of the entrant. Evidence from a longitudinal sample of new entrants in the European passenger airline...

Container routing determines how to transport containers from their origins to their destinations in a liner shipping network. Container routing needs to be solved a number of times as a subproblem in tactical-level decision planning of liner shipping operations. Container routing is similar to...

A common metric to measure the robustness of a network is its algebraic connectivity. This paper introduces the flight routes addition/deletion problem and compares three different methods to analyze and optimize the algebraic connectivity of the air transportation network. The Modified Greedy...