Complexity Analysis of a Bicriteria Directed Multimodal Transportation Network Design Problem

TL;DR

This paper analyzes the computational complexity of a bicriteria directed multimodal transportation network design problem, revealing intractability in general cases and identifying solvable special cases, thus advancing understanding in urban and rural transportation planning.

Contribution

It establishes the problem's complexity and inapproximability, and identifies special cases where approximation algorithms are feasible, filling a gap in network design literature.

Findings

Proves the problem's computational intractability.

Identifies cases with achievable approximability.

Provides complexity insights for transportation network design.

Abstract

In this paper, we address a bicriteria network design problem that arises from practical applications in urban and rural public transportation planning. We establish the problem's complexity and demonstrate inapproximability results, highlighting the inherent difficulties in finding optimal solutions. Additionally, we identify special cases where approximability can be achieved, providing valuable insights for practitioners. Our proofs leverage complexity results related to directed network design problems, an area that has received limited attention in the existing literature. By investigating these complexity results, we aim to fill a critical gap and enhance the understanding of the interplay between bicriteria decision-making and network design challenges.