Border crossing delays between New York State and Southern Ontario cause problems like enormous economic loss and massive environmental pollutions. In this area, there are three bordercrossing ports: Peace Bridge (PB), Rainbow Bridge (RB) and Lewiston-Queenston Bridge (LQ) at Niagara Frontier border. The goals of this paper are to figure out whether the distributions of binational wait times fo...

Falling across the problem of the unforeseen congested events in the logistic transportation, we build the online vehicle scheduling model with the recoverable congested vertices in this paper. Our optimization objective minimizes the total time of online scheduling. Considering the dynamic occurrence characteristics of the congested vertices one by one, we first introduce three online scheduli...

Resolving the problem of congestion roads is very challenging; however a way out of this problem will bring about many most wanted results like helping people not late to work; deliveries arrive on time and more. One approach to confront this task is letting the drivers be aware of congested roads online, so the drivers will be able to avoid going through the congested roads. This paper propose...

Airport surface congestion results in significant increases in taxi times, fuel burn and emissions at major airports. This paper describes the field tests of a congestion control strategy at Boston Logan International Airport. The approach determines a suggested rate to meter pushbacks from the gate, in order to prevent the airport surface from entering congested states and to reduce the time t...

This study focuses on how to determine the skip-stop scheduling for a congested urban transit line during the morning rush hours. A transit schedule with uneven headways and skip-stop operations is adopted to match the time-dependent demands and accelerate the circulative utilizations of vehicles. This schedule allows the buses to run on unequal vehicle-departure intervals and to skip some stat...

Calculating aggregation operators of moving point objects, using time as a continuous variable, presents unique problems when querying for congestion in a moving and changing (or dynamic) query space. We present a set of congestion query operators, based on a threshold value, that estimate the following 5 aggregation operations in d-dimensions. 1) We call the count of point objects that interse...

The main results of this paper are (I) a simulation algorithm which, under quite general constraints, transforms algorithms running on the Congested Clique into algorithms running in the MapReduce model, and (II) a distributed O(∆)-coloring algorithm running on the Congested Clique which has an expected running time of O(1) rounds, if ∆ ≥ Θ(log n); and O(log log log n) rounds otherwise. Applyin...

These notes are dedicated to the analysis of one-dimensional free-congested Navier–Stokes equations. After a brief synthesis results obtained in Dalibard and Perrin (Commun Math Sci 18(7):1775–1813, 2020) related existence asymptotic stability partially congested profiles associated soft congestion Navier-Stokes system, we present first local well-posedness result for

Recently, according to growth and concentration of population in urban area, congested situations at several railway stations in rush hour become a serious social issue. Therefore, designing the station more comfortably for the passengers has been desired. In other words, in order to mitigate the congested situations, a method measuring crowds flow characteristics should be developed. In this p...

We consider a congested aggregation model that describes the evolution of a density through the competing effects of nonlocal Newtonian attraction and a hard height constraint. This provides a counterpoint to existing literature on repulsive-attractive nonlocal interaction models, where the repulsive effects instead arise from an interaction kernel or the addition of diffusion. We formulate our...