Related papers: Managing network congestion with a tradable credit…
The route planning problem based on the greedy algorithm represents a method of identifying the optimal or near-optimal route between a given start point and end point. In this paper, the PCA method is employed initially to downscale the…
This paper describes the impact on transportation network companies (TNCs) of the imposition of a congestion charge and a driver minimum wage. The impact is assessed using a market equilibrium model to calculate the changes in the number of…
We investigate the impacts of spatial pricing for ride-sourcing services in a Stackelberg framework considering traffic congestion. In the lower level, we use combined distribution and assignment approaches to explicitly capture the…
This study considers that the collective route choices of travelers en route represent a resolution of their competition on network routes. Well understanding this competition and coordinating their route choices help mitigate urban traffic…
Demand for sustainable mobility is particularly high in urban areas. Hence, there is a growing need to predict when people will decide to use different travel modes with an emphasis on environmentally friendly travel modes. As travel mode…
We consider a profit maximization problem in an urban mobility on-demand service, of which the operator owns a fleet, provides both exclusive and shared trip services, and dynamically determines prices of offers. With knowledge of the…
This paper focuses on solving the capacitated arc routing problem with time-dependent service costs (CARPTDSC), which is motivated by winter gritting applications. In the current literature, exact algorithms designed for CARPTDSC can only…
Bike Sharing Systems (BSSs) are emerging as an innovative transportation service. Ensuring the proper functioning of a BSS is crucial given that these systems are committed to eradicating many of the current global concerns, by promoting…
We consider the Minimum Multi-Commodity Flow Subgraph (MMCFS) problem: given a directed graph $G$ with edge capacities $\mathit{cap}$ and a retention ratio $\alpha\in(0,1)$, find an edge-wise minimum subgraph $G' \subseteq G$ such that for…
Major cities worldwide experience problems with the performance of their road transportation networks, and the continuous increase in traffic demand presents a substantial challenge to the optimal operation of urban road networks and the…
Urban rail transit often operates with high service frequencies to serve heavy passenger demand during rush hours. Such operations can be delayed by two types of congestion: train congestion and passenger congestion, both of which interact…
This research proposes an incremental welfare consensus method based on flexible alternating current transmission systems (FACTS) and demand response (DR) programs to control transmission network congestion in order to increase the…
In many real-world routing problems, decision makers must optimise over sparse graphs such as transportation networks with non-metric costs on the edges that do not obey the triangle inequality. Motivated by finding a sufficiently long…
All the existing real world networks are evolving, hence, study of traffic dynamics in these enlarged networks is a challenging task. The critical issue is to optimize the network structure to improve network capacity and avoid traffic…
A gradual takeover strategy is proposed, in which the dynamic driving privilege assignment in real-time and the driving privilege gradual handover are realized. Firstly, the driving privilege assignment based on the risk level is achieved.…
This paper provides a framework to quantify the sensitivity associated with behavioral models based on Cumulative Prospect Theory (CPT). These are used to design dynamic pricing strategies aimed at maximizing performance metrics of the…
This paper analyses the performance benefits of a user-centric scheduling approach, exploiting the flexibility of both dynamic time division duplex (TDD) and a variable transmission time interval (TTI), where the downlink to uplink ratio…
Next-day delivery logistics services are redefining the industry by increasingly focusing on customer service. A challenge each logistics service provider faces is to jointly optimize time window assignment and vehicle routing for such…
This paper proposes a macroscopic model to describe the equilibrium distribution of passenger arrivals for the morning commute problem in a congested urban rail transit system. We use a macroscopic train operation sub-model developed by Seo…
Existing studies have extensively used spatiotemporal data to discover the mobility patterns of various types of travellers. Smart card data (SCD) collected by the automated fare collection systems can reflect a general view of the mobility…