Optimal Subgraph on Disturbed Network

05/06/2021
by   Matthieu Guillot, et al.
0

During the pandemic of COVID-19, the demand of the transportation systems are drastically changed both qualitatively and quantitatively and the network has become obsolete. In this article, we study the problem of finding an optimal subnetwork that guarantee that (i) the minimal access time from any node of the urban network to the new network is not too large compared to the original transportation network; (ii) for any itinerary, the delay caused by the deletion of nodes of the transportation network is not too big; and (iii) the number of nodes of the transportation network has been reduced at least by a known factor. A solution is optimal if it induces a minimal global delay. We model this problem as a Mixed Integer Linear Program before applying the model on a real-case application on the Lyon's buses transportation network.

READ FULL TEXT

page 6

page 7

page 8

research
04/24/2020

Simulating and Evaluating Rebalancing Strategies for Dockless Bike-Sharing Systems

Following the growth of dock-based bike sharing systems as an eco-friend...
research
10/22/2020

Polynomial Delay Enumeration for Minimal Steiner Problems

Let G = (V, E) be a undirected graph and let W ⊆ V be a set of terminals...
research
11/06/2020

Optimal Resource and Demand Redistribution for Healthcare Systems Under Stress from COVID-19

When facing an extreme stressor, such as the COVID-19 pandemic, healthca...
research
10/18/2017

PRT (Personal Rapid Transit) network simulation

Transportation problems of large urban conurbations inspire search for n...
research
09/26/2020

Safe and Reliable Public Transportation Systems (SALUTARY) in the COVID-19 pandemic

The aim of the SALUTARY (Safe and Reliable Public Transportation Systems...
research
07/09/2018

Optimum Transmission Delay for Function Computation in NFV-based Networks: the role of Network Coding and Redundant Computing

In this paper, we study the problem of delay minimization in NFV-based n...
research
07/11/2012

On finding minimal w-cutset

The complexity of a reasoning task over a graphical model is tied to the...

Please sign up or login with your details

Forgot password? Click here to reset