Coordinated platooning with multiple speeds

In a platoon, vehicles travel one after another with small intervehicle distances; trailing vehicles in a platoon save fuel because they experience less aerodynamic drag. This work presents a coordinated platooning model with multiple speed options that integrates scheduling, routing, speed selection, and platoon formation/dissolution in a mixed-integer linear program that minimizes the total fuel consumed by a set of vehicles while traveling between their respective origins and destinations. The performance of this model is numerically tested on a grid network and the Chicago-area highway network. We find that the fuel-savings factor of a multivehicle system significantly depends on the time each vehicle is allowed to stay in the network; this time affects vehicles’ available speed choices, possible routes, and the amount of time for coordinating platoon formation. For problem instances with a large number of vehicles, we propose and test a heuristic decomposed approach that applies a clustering algorithm to partition the set of vehicles and then routes each group separately. When the set of vehicles is large and the available computational time is small, the decomposed approach finds significantly better solutions than does the full model.     

The time-dependent vehicle routing problem with soft time windows and stochastic travel times

This paper studies a vehicle routing problem with time-dependent and stochastic travel times. In our problem setting, customers have soft time windows. A mathematical model is used in which both efficiency for service as well as reliability for customers are taken into account. Depending on whether service times are included or not, we consider two versions of this problem. Two metaheuristics are built: a Tabu Search and an Adaptive Large Neighborhood Search. We carry out our experiments for well-known problem instances and perform comprehensive analyses on the numerical results in terms of the computational time and the solution quality. Experiments confirm that the proposed procedure is effective to obtain very good solutions to be performed in real-life environment.     

A Bayesian approach to detect pedestrian destination-sequences from WiFi signatures

In this paper, we propose a methodology to use the communication network infrastructure, in particular WiFi traces, to detect the sequence of activity episodes visited by pedestrians. Due to the poor quality of WiFi localization, a probabilistic method is proposed that infers activity-episode locations based on WiFi traces and calculates the likelihood of observing these traces in the pedestrian network, taking into account prior knowledge. The output of the method consists of candidates of activity-episodes sequences associated with the likelihood to be the true one. The methodology is validated on traces generated by a known sequence of activities, while the performance being evaluated on a set of anonymous users. Results show that it is possible to predict the number of episodes and the activity-episodes locations and durations, by merging information about the activity locations on the map, WiFi measurements and prior information about schedules and the attractivity in pedestrian infrastructure. The ambiguity of each activity episode in the sequence is explicitly measured.     

Customized bus service design for jointly optimizing passenger-to-vehicle assignment and vehicle routing

Emerging transportation network services, such as customized buses, hold the promise of expanding overall traveler accessibility in congested metropolitan areas. A number of internet-based customized bus services have been planned and deployed for major origin-destination (OD) pairs to/from inner cities with limited physical road infrastructure. In this research, we aim to develop a joint optimization model for addressing a number of practical challenges for providing flexible public transportation services. First, how to maintain minimum loading rate requirements and increase the number of customers per bus for the bus operators to reach long-term profitability. Second, how to optimize detailed bus routing and timetabling plans to satisfy a wide range of specific user constraints, such as passengers’ pickup and delivery locations with preferred time windows, through flexible decision for matching passengers to bus routes. From a space-time network modeling perspective, this paper develops a multi-commodity network flow-based optimization model to formulate a customized bus service network design problem so as to optimize the utilization of the vehicle capacity while satisfying individual demand requests defined through space-time windows. We further develop a solution algorithm based on the Lagrangian decomposition for the primal problem and a space-time prism based method to reduce the solution search space. Case studies using both the illustrative and real-world large-scale transportation networks are conducted to demonstrate the effectiveness of the proposed algorithm and its sensitivity under different practical operating conditions.     

城市轨道交通多交路共线运营客流分配方法

多交路共线运营客流分配是城市轨道交通复杂交路设计、列车开行方案优化的基础。本 文以典型共线运营多交路为例，通过划分客流出行区段将乘客分为不同类型，分析了不同类型客 流的路径选择策略，提出以发车频率确定的客流分担比例计算方法，构建了基于发车频率和乘客 出行区段划分的客流分配模型。在此基础上，将多交路共线运营物理网络转化为共线运营服务 网络，通过引入超路径的概念，将乘客出行优化策略转化为共线运营服务网络上的最短超路径问 题，并考虑乘客在车拥挤感知费用，提出了基于超路径的客流增量分配方法。最后，通过算例验 证了共线客流分配方法的有效性，对比分析了两种方法的特点和适用性。     

Activity-based market equilibrium for capacitated multimodal transport systems

Empirical studies have shown that demand for multimodal transport systems is highly correlated with activity schedules of individuals. Nonetheless, existing analytical equilibrium models of multimodal systems have only considered trip-based demand. We propose a new market equilibrium model that is sensitive to traveler activity schedules and system capacities. The model is based on a constrained mixed logit model of activity schedule choice, where each schedule in the choice set is generated with a multimodal extension of the household activity pattern problem. The extension explicitly accounts for both passenger choices of activity participation and multimodal choices like public transit, walking, and vehicle parking. The market equilibrium is achieved with Lagrangian relaxation to determine the optimal dual price of the capacity constraint, and a method of successive averages with column generation finds an efficient choice set of activity schedules to assign flows over the dynamic network load capacities. An example illustrates the model and algorithm, effects similar to Vickrey’s morning commute model can be observed as a special case. A case study of the Oakville Go Transit station access “last mile” problem in the Greater Toronto Area is conducted with 166 survey samples reflecting 3680 individuals. Results suggest that a $10 fixed parking fee at Oakville station would lead to a reduction of access auto share from 54.8% to 49.5%, an increase in access transit share from 20.7% to 25.9%, and a disutility increase of 11% for the of single-activity residents of Oakville.     

Anticipating emission-sensitive traffic management strategies for dynamic delivery routing

Traffic pollution is an increasing challenge for cities. Emissions such as nitrogen dioxides pose a major health threat to the city’s inhabitants. These emissions often accumulate to critical levels in local areas of the city. To react to these critical emission levels, cities start implementing dynamic traffic management systems (TMS). These systems dynamically redirect traffic flows away from critical areas. These measures impact the travel speeds within the city. This is of particular importance for parcel delivery companies. These companies deliver goods to customers in the city. To avoid long delivery times and higher costs, companies already adapt their routing with respect to changing traffic conditions. Still, a communication with the TMS may allow anticipatory planning to avoid potentially critical areas in the city. In this paper, we show how communication between TMS and delivery companies results in benefits for both parties. To exploit the provided information, we develop a dynamic routing policy anticipating potential future measures of the TMS. We analyze our algorithm in a comprehensive case study for the TMS of the city of Braunschweig, Germany, a city often used as reference for a typical European city layout. We show that for the delivery company, integrating the TMS’ information in their routing algorithms reduces the driving times significantly. For the TMS, providing the information results in less traffic in the polluted areas.     

Congestion avoidance in city traffic

The number of vehicles on the road (worldwide) is constantly increasing, causing traffic jams and congestion especially in city traffic. Anticipatory vehicle routing techniques have thus far been applied to fairly small networked traffic scenarios and uniform traffic. We note here a number of limitations of these techniques and present a routing strategy on the assumption of a city map that has a large number of nodes and connectivity and where the vehicles possess highly varying speed capabilities. A scenario of operation with such characteristics has not previously been sufficiently studied in the literature. Frequent short‐term planning is preferred as compared with infrequent planning of the complete map. Experimental results show an efficiency boost when single‐lane overtaking is allowed, traffic signals are accounted for and every vehicle prefers to avoid high traffic density on a road by taking an alternative route. Comparisons with optimistic routing, pessimistic routing and time message channel routing are given. Copyright © 2014 John Wiley & Sons, Ltd.     

A tailored branch-and-price approach for a joint tramp ship routing and bunkering problem

This paper deals with a practical tramp ship routing problem while taking into account different bunker prices at different ports, which is called the joint tramp ship routing and bunkering (JSRB) problem. Given a set of cargoes to be transported and a set of ports with different bunker prices, the proposed problem determines how to route ships to carry the cargoes and the amount of bunker to purchase at each port, in order to maximize the total profit. After building an integer linear programming model for the JSRB problem, we propose a tailored branch-and-price (B&P) solution approach. The B&P approach incorporates an efficient method for obtaining the optimal bunkering policy and a novel dominance rule for detecting inefficient routing options. The B&P approach is tested with randomly generated large-scale instances derived from real-world planning problems. All of the instances can be solved efficiently. Moreover, the proposed approach for the JSRB problem outperforms the conventional sequential planning approach and can incorporate the prediction of future cargo demand to avoid making myopic decisions.     

Dynamic traffic routing in a network with adaptive signal control

In real traffic networks, travellers’ route choice is affected by traffic control strategies. In this research, we capture the interaction between travellers’ route choice and traffic signal control in a coherent framework. For travellers’ route choice, a VANET (Vehicular Ad hoc NETwork) is considered, where travellers have access to the real-time traffic information through V2V/V2I (Vehicle to Vehicle/Vehicle to Infrastructure) infrastructures and make route choice decisions at each intersection using hyper-path trees. We test our algorithm and control strategy by simulation in OmNet++ (A network communication simulator) and SUMO (Simulation of Urban MObility) under several scenarios. The simulation results show that with the proposed dynamic routing, the overall travel cost significantly decreases. It is also shown that the proposed adaptive signal control reduces the average delay effectively, as well as reduces the fluctuation of the average speed within the whole network.