This paper focuses on two commonly used path assignment policies for agents traversing a congested network: self-interested routing, and system-optimum routing. In the routing policy each agent selects that optimizes its own utility, while in are assigned paths with goal of maximizing system performance. considers scenario where centralized network manager wishes to optimize utilities over all agents, i.e., implement policy. many real-life scenarios, however, is unable influence route due...

We define an adaptive routing problem in a stochastic time-dependent transit network which arc travel times are discrete random variables with known probability distributions. formulate it as finite horizon Markov decision process. Routing strategies conditioned on the arrival time of traveler at intermediate nodes and real-time information buses stops along their routes. The objective is to find strategy that minimizes expected time, subject constraint guarantees destination reached within...

Connected and autonomous vehicle technology has advanced rapidly in recent years. These technologies create possibilities for AI-based traffic management techniques. Developing such techniques is an important challenge opportunity the AI community as it requires synergy between experts game theory, multiagent systems, behavioral science, flow optimization. This paper takes a step this direction by considering optimization through setting broadcasting of dynamic adaptive tolls. Previous...

A substantial amount of urban traffic is related to drivers searching for parking. This study developed an online stochastic shortest path model represent the parking search process in which must choose whether park at available space or continue a closer their destination. Existing algorithms had been formulated full-reset no-reset assumptions on revisiting links. As described this paper, neither assumption was fully suitable process. Accordingly, paper proposes asymptotic reset that...

The online shortest path problem is a type of stochastic in which certain arc costs are revealed en route, and the updated accordingly to minimize expected cost. This note addresses open determining whether instance admits finite optimal solution presence negative costs. We formulate as Markov decision process show ways detect such instances course solving using standard algorithms value policy iteration. © 2016 Wiley Periodicals, Inc. NETWORKS, Vol. 67(4), 270–276

Low-conflict network designs aim to reduce intersection delay by restricting or eliminating crossing conflicts. These range from alternating one-way street grids in central business districts more radical that eliminate conflicts altogether. However, travel distances such networks are generally higher than traditional networks. This paper proposes an equilibrium approach for evaluating the trade-off between increased distance and reduced of varying topology demand patterns. To accomplish...

The paper introduces innovative techniques to enhance Trip-Based Transit Routing (TBTR), a popular bicriterion transit routing approach. Inspired by Hypergraph-based Round-based Public (HypRAPTOR), we present TBTR (HypTBTR), partitioning variant aimed at improving TBTR's query times. However, this improvement in HypTBTR (and HypRAPTOR) comes with increased preprocessing requirements. To address issue, propose two novel techniques: One-To-Many of and multilevel partitioning. Our algorithm...

As many public transportation systems around the world transition to electric buses, planning and operation of fleets can be improved via tailored decision-support tools. In this work, we study impact jointly locating charging facilities, assigning buses trips, determining when where charge buses. We propose a mixed integer linear program that co-optimizes operational decisions an iterated local search heuristic solve large-scale instances. Herein, use concurrent scheduler algorithm generate...

This paper addresses the problem of energy-efficient and safe routing last-mile electric freight vehicles. With rising environmental footprint transportation sector growing popularity E-Commerce, companies are likely to benefit from optimal time-window-feasible tours that minimize energy usage while reducing traffic conflicts at intersections thereby improving safety. We formulate this as a Bi-criterion Steiner Traveling Salesperson Problem with Time Windows (BSTSPTW) consumed number left...

To improve the utilization of public transportation systems (PTSs) during off-peak hours, we present an algorithmic framework that designs PTSs with hybrid units (HTUs), which can transport passengers or freight by leveraging a flexible interior. Against this background, study capacitated network design problem to enable cargo-hitching in existing PTSs. Specifically, setting fixed vehicle routes and timetables vehicles be equipped HTUs cargo-hitching. We optimize from total cost perspective...