176 research outputs found
Iterative algorithm for lane reservation problem on transportation network
International audienceIn this paper, we study an NP-hard lane reservation problem on transportation network. By selecting lanes to be reserved on the existing transportation network under some special situations, the transportation tasks can be accomplished on the reserved lanes with satisfying the condition of time or safety. Lane reservation strategy is a flexible and economic method for traffic management. However, reserving lanes has impact on the normal traffic because the reserved lanes can only be passed by the special tasks. It should be well considered choosing reserved lanes to minimize the total traffic impact when applying the lane reservation strategy for the transportation tasks. In this paper, an integer linear program model is formulated for the considered problem and an optimal algorithm based on the cut-and-solve method is proposed. Some new techniques are developed for the cut-and-solve method to accelerate the convergence of the proposed algorithm. Numerical computation results of 125 randomly generated instances show that the proposed algorithm is much faster than a MIP solver of commercial software CPLEX 12.1 to find optimal solutions on average computing time
Recommended from our members
Planning for autonomous vehicles : ridesharing and traffic control
This report address two problems that could drive the adoption of autonomous vehicles (AV) – shared autonomous vehicle routing (SAV) problem and the autonomous intersection management system (AIM) location problem. The SAV routing problem is finding the optimal SAV to passenger matching as well as the SAV route choice. Since widespread use of SAVs would have significant effects on traffic congestion, we develop a new tabu search heuristic for the SAV routing problem under the influence of traffic congestion. The algorithm aims to minimize traveler’s travel time. It considers several adjacent solutions by repeatedly swapping travelers between SAV routes. A nearest traveler neighborhood is defined to choose travelers to consider for the swap procedure. The Sioux Falls network is used to test the performance of the heuristic with varying demand and fleet sizes. The heuristic is found to produce encouraging results in reducing the total passenger travel time. A series of experiments are performed to understand the sensitivity of the heuristic to its parameters and the effects of congestion. The AIM location problem is the problem of optimally locating AIMs in a network so as to improve the experienced travel times in the network. Traditional traffic signals are inefficient in taking advantage of the benefits of AVs. Previous studies show that full adoption of AIMs in a network is not necessarily an improvement. This report aims to develop a framework which can be used to identify the intersections where an implementation of AIMs is beneficial. To do so, two models are proposed. First, a regression model is developed to classify intersections based on their performance. Second, the AIM location problem is formulated as an optimization problem and a genetic algorithm is developed to identify the optimal distribution of AIMs in a network. Both approaches are tested on the downtown Austin network and are compared for their performanceOperations Research and Industrial Engineerin
A Tabu Search Based Metaheuristic for Dynamic Carpooling Optimization
International audienceThe carpooling problem consists in matching a set of riders' requests with a set of drivers' offers by synchronizing their origins, destinations and time windows. The paper presents the so-called Dynamic Carpooling Optimization System (DyCOS), a system which supports the automatic and optimal ridematching process between users on very short notice or even en-route. Nowadays, there are numerous research contributions that revolve around the carpooling problem, notably in the dynamic context. However, the problem's high complexity and the real time aspect are still challenges to overcome when addressing dynamic carpooling. To counter these issues, DyCOS takes decisions using a novel Tabu Search based metaheuristic. The proposed algorithm employs an explicit memory system and several original searching strategies developed to make optimal decisions automatically. To increase users' satisfaction, the proposed metaheuristic approach manages the transfer process and includes the possibility to drop off the passenger at a given walking distance from his destination or at a transfer node. In addition, the detour concept is used as an original aspiration process, to avoid the entrapment by local solutions and improve the generated solution. For a rigorous assessment of generated solutions , while considering the importance and interaction among the optimization criteria, the algorithm adopts the Choquet integral operator as an aggregation approach. To measure the effectiveness of the proposed method, we develop a simulation environment based on actual carpooling demand data from the metropolitan area of Lille in the north of France
Congestion Mitigation for Planned Special Events: Parking, Ridesharing and Network Configuration
abstract: This dissertation investigates congestion mitigation during the ingress of a planned special event (PSE). PSEs would impact the regular operation of the transportation system within certain time periods due to increased travel demand or reduced capacities on certain road segments. For individual attendees, cruising for parking during a PSE could be a struggle given the severe congestion and scarcity of parking spaces in the network. With the development of smartphones-based ridesharing services such as Uber/Lyft, more and more attendees are turning to ridesharing rather than driving by themselves. This study explores congestion mitigation during a planned special event considering parking, ridesharing and network configuration from both attendees and planner’s perspectives.
Parking availability (occupancy of parking facility) information is the fundamental building block for both travelers and planners to make parking-related decisions. It is highly valued by travelers and is one of the most important inputs to many parking models. This dissertation proposes a model-based practical framework to predict future occupancy from historical occupancy data alone. The framework consists of two modules: estimation of model parameters, and occupancy prediction. At the core of the predictive framework, a queuing model is employed to describe the stochastic occupancy change of a parking facility.
From an attendee’s perspective, the probability of finding parking at a particular parking facility is more treasured than occupancy information for parking search. However, it is hard to estimate parking probabilities even with accurate occupancy data in a dynamic environment. In the second part of this dissertation, taking one step further, the idea of introducing learning algorithms into parking guidance and information systems that employ a central server is investigated, in order to provide estimated optimal parking searching strategies to travelers. With the help of the Markov Decision Process (MDP), the parking searching process on a network with uncertain parking availabilities can be modeled and analyzed.
Finally, from a planner’s perspective, a bi-level model is proposed to generate a comprehensive PSE traffic management plan considering parking, ridesharing and route recommendations at the same time. The upper level is an optimization model aiming to minimize total travel time experienced by travelers. In the lower level, a link transmission model incorporating parking and ridesharing is used to evaluate decisions from and provide feedback to the upper level. A congestion relief algorithm is proposed and tested on a real-world network.Dissertation/ThesisDoctoral Dissertation Civil, Environmental and Sustainable Engineering 201
Optimal scheduling of connected and autonomous vehicles at a reservation-based intersection.
Reservation-based intersection control has been evaluated with better performance over traditional signal controls in terms of intersection safety, efficiency, and emission. Controlling connected and autonomous vehicles (CAVs) at a reservation-based intersection in terms of improving intersection efficiency is performed via two factors: trajectory (speed profile) and arrival time of CAVs at the intersection. In an early stage of the reservation-based intersection control, an intersection controller at the intersection may fail to find a feasible solution for both the trajectory and arrival time for a CAV at a certain planning horizon. Leveraging a deeper understanding of the control problem, reservation-based intersection control methods are able to optimize both trajectory and arrival time simultaneously while overcoming the infeasible condition. Furthermore, in order to achieve real-time control at the reservation-based intersection, a scheduling problem of CAV crossing the intersection has been widely modeled to optimize the intersection efficiency. Efficient solution algorithms have been proposed to overcome the curse of dimensionality. However, a control methodology consisting of trajectory planning and arrival time scheduling that can overcome the infeasible condition has not been explicitly explained and defined. Furthermore, an optimal control framework for joint control of the trajectory planning and arrival time scheduling in terms of global intersection efficiency has not been theoretically established and numerically validated; and mechanisms of how to reduce the time complexity meanwhile solving the scheduling problem to an optimal solution are not fully understood and rigorously defined. In this dissertation, a control method that eliminates the infeasible problem at any planning horizon is first explicitly explained and defined based on a time-speed-independent trajectory planning and scheduling model. Secondly, this dissertation theoretically defines the optimal control framework via analyzing various control methods in terms of intersection capacity, throughput and delay. Furthermore, this dissertation theoretically analyzes the mechanism of the scheduling problem and designs an exact algorithm to further reduce the time complexity. Through theoretical analyses of the properties of the scheduling problem, the reasons that the time complexity can be reduced are fundamentally explained. The results first validate that the defined control framework can adapt to extremely high traffic demand scenarios with feasible solutions at any planning horizon for all CAVs. Under extensive sensitivity analyses, the theoretical definition of the optimal control framework is validated in terms of maximizing the intersection efficiency. Moreover, numerical examples validate that a proposed scheduling algorithm finds an optimal solution with lower computation time and time complexity
Space-sharing Strategies for Storage Yard Management in a Transshipment Hub Port
Ph.DDOCTOR OF PHILOSOPH
An adaptive large neighborhood search heuristic for the share-a-ride problem
The Share-a-Ride Problem (SARP) aims at maximizing the profit of serving a set of passengers and parcels using a set of homogeneous vehicles. We propose an adaptive large neighborhood search (ALNS) heuristic to address the SARP. Furthermore, we study the problem of determining the time slack in a SARP schedule. Our proposed solution approach is tested on three sets of realistic instances. The performance of our heuristic is benchmarked against a mixed integer programming (MIP) solver and the Dial-a-Ride Problem (DARP) test instances. Compared to the MIP solver, our heuristic is superior in both the solution times and the quality of the obtained solutions if the CPU time is limited. We also report new best results for two out of twenty benchmark DARP instances
A multimodal network flow problem with product quality preservation, transshipment, and asset management
In this paper, we present an optimization model for a transportation planning problem with multiple transportation modes, highly perishable products, demand and supply dynamics, and management of the reusable transport units (RTIs). Such a problem arises in the European horticultural chain, for example. As a result of geographic dispersion of production and market, a reliable transportation solutions ensures long-term success in the European market. The model is an extension to the network ow problem. We integrate dynamic allocation, ow, and repositioning of the RTIs in order to nd the trade-o between quality requirements and operational considerations and costs. We also present detailed computational results and analysis
- …