In this paper, we propose a max-flow-min-cost (MFMC) problem to obtain the upper bound of network capacity and develop an efficient packet routing strategy. The MFMC problem is formulated as two linear programs (LP). The optimal solutions of the two LPs are the upper bound of network capacity...

This paper aims to model and investigate the discrete urban road network design problem, using a multi-objective time-dependent decision-making approach. Given a base network made up with two-way links, candidate link expansion projects, and candidate link construction projects, the problem...

In this study, global positioning system data from 460 urban taxis are used to develop a time-dependent logit model. The rate of return (ROR, also known as profit per unit time) is used as a factor underlying taxi drivers' searching behaviour for customers. The data also reveal that the search...