The k-interchange-constrained diameter of a transit network: A connectedness indicator that accounts for travel convenience

08/27/2020
by   Nassim Dehouche, et al.
0

We study two variants of the shortest path problem. Given an integer k, the k-color-constrained and the k-interchange-constrained shortest path problems, respectively seek a shortest path that uses no more than k colors and one that makes no more than k - 1 alternations of colors. We show that the former problem is NP-hard, when the latter is tractable. The study of these problems is motivated by some limitations in the use of diameter-based metrics to evaluate the topological structure of transit networks. We notably show that indicators such as the diameter or directness of a transit network fail to adequately account for travel convenience in measuring the connectivity of a network and propose a new network indicator, based on solving the k-interchange-constrained shortest path problem, that aims at alleviating these limitations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/06/2023

Solving the recoverable robust shortest path problem in DAGs

This paper deals with the recoverable robust shortest path problem under...
research
06/26/2022

Constrained Shortest-Path Reformulations for Discrete Bilevel and Robust Optimization

Many discrete optimization problems are amenable to constrained shortest...
research
01/17/2018

Shortest Path and Maximum Flow Problems Under Service Function Chaining Constraints

With the advent of Network Function Virtualization (NFV), Physical Netwo...
research
08/09/2018

A Constrained Shortest Path Scheme for Virtual Network Service Management

Virtual network services that span multiple data centers are important t...
research
06/14/2023

PathWise: a flexible, open-source library for the Resource Constrained Shortest Path

In this paper, we consider a fundamental and hard combinatorial problem:...
research
12/04/2018

Multiple Manifold Clustering Using Curvature Constrained Path

The problem of multiple surface clustering is a challenging task, partic...
research
10/19/2021

Collective Shortest Paths for Minimizing Congestion on Temporal Load-Aware Road Networks

Shortest path queries over graphs are usually considered as isolated tas...

Please sign up or login with your details

Forgot password? Click here to reset