Related papers: A bio-inspired algorithm for fuzzy user equilibriu…

Spurred by the growth of transportation network companies and increasing data capabilities, vehicle routing and ride-matching algorithms can improve the efficiency of private transportation services. However, existing routing solutions do…

Extreme weather events, like flooding, disrupt urban transportation networks by reducing speeds and capacities, and by closing roadways. These hazards create regime-dependent uncertainty in link performance and travel-time distribution…

This paper introduces a multi-agent approach to adjust traffic lights based on traffic situation in order to reduce average delay time. In the traffic model, lights of each intersection are controlled by an autonomous agent. Since decision…

This paper investigates the social optimum for a dynamic linear quadratic collective choice problem where a group of agents choose among multiple alternatives or destinations. The agents' common objective is to minimize the average cost of…

We consider the simplified model of strategic allocation of trajectories in the airspace presented in a previous publication. Two types of companies, characterized by different cost functions, compete for allocation of trajectories in the…

Fuzzy constraints are a popular approach to handle preferences and over-constrained problems in scenarios where one needs to be cautious, such as in medical or space applications. We consider here fuzzy constraint problems where some of the…

Optimizing traffic flow is essential for easing congestion. However, even when globally-optimal, coordinated and individualized routes are provided, users may choose alternative routes which offer lower individual costs. By analyzing the…

In heterogeneous networks (HetNets), load balancing among different tiers can be effectively achieved by a biased user association scheme with which each user chooses to associate with one base station (BS) based on the biased received…

The residual queue during a given study period (e.g., peak hour) is an important feature that should be considered when solving a traffic assignment problem under equilibrium for strategic traffic planning. Although studies have focused…

We study binary coordination games with random utility played in networks. A typical equilibrium is fuzzy -- it has positive fractions of agents playing each action. The set of average behaviors that may arise in an equilibrium typically…

The paper presents various modifications of the Frank-Wolfe algorithm in the equilibrium traffic assignment problem. The Beckman model is used as a model for experiments. In this article, first of all, attention is paid to the choice of the…

Given facilities with capacities and clients with penalties and demands, the transportation problem with market choice consists in finding the minimum-cost way to partition the clients into unserved clients, paying the penalties, and into…

We propose an algorithm for solving the time-dependent shortest path problem in flow fields where the FIFO (first-in-first-out) assumption is violated. This problem variant is important for autonomous vehicles in the ocean, for example,…

In this work we focus on modeling a little studied type of traffic, namely the network traffic generated from endhosts. We introduce a parsimonious parametric model of the marginal distribution for connection arrivals. We employ mixture…

This paper considers a time-varying optimization problem associated with a network of systems, with each of the systems shared by (and affecting) a number of individuals. The objective is to minimize cost functions associated with the…

We consider an online network routing problem in continuous time, where calls have Poisson arrivals and exponential durations. The first-fit dynamic alternative routing algorithm sequentially selects up to $d$ random two-link routes between…

We present a study of the application of a variant of a recently introduced heuristic algorithm for the optimization of transport routes on complex networks to the problem of finding the optimal routes of communication between nodes on…

In this paper, we consider a mesh-structured unmanned aerial vehicle (UAV) networks exploiting partially overlapping channels (POCs). For general data-collection tasks in UAV networks, we aim to optimize the network throughput with…

Optimal transport has been used extensively in resource matching to promote the efficiency of resources usages by matching sources to targets. However, it requires a significant amount of computations and storage spaces for large-scale…

Within mobility systems, the presence of self-interested users can lead to aggregate routing patterns that are far from the societal optimum which could be achieved by centrally controlling the users' choices. In this paper, we design a…