Ad hoc solution of the multicommodity-flow-over-time problem

Authors:
Matthias Braun;Stephan Winter
Affiliations:
German Aerospace Center, Hamburg, Germany;Department of Geomatics, University of Melbourne, Melbourne, Victoria, Australia
Venue:
IEEE Transactions on Intelligent Transportation Systems
Year:
2009

Citing 9
Cited 2

Spatial tessellations: concepts and applications of Voronoi diagrams

Spatial tessellations: concepts and applications of Voronoi diagrams
Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Fast approximation algorithms for multicommodity flow problems

Selected papers of the 23rd annual ACM symposium on Theory of computing
Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length

Journal of the ACM (JACM)
Introduction to Algorithms

Introduction to Algorithms
Algorithms for minimum-cost paths in time-dependent networks with waiting policies

Networks
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Multicommodity flows over time: Efficient algorithms and complexity

Theoretical Computer Science
Adaptations of the A* algorithm for the computation of fastest paths in deterministic discrete-time dynamic networks

IEEE Transactions on Intelligent Transportation Systems

Maximum multicommodity flows over time without intermediate storage

ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Determining the Viability of a Demand-Responsive Transport System under Varying Demand Scenarios

Proceedings of the Sixth ACM SIGSPATIAL International Workshop on Computational Transportation Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Ad hoc shared-ride systems built upon intelligent-transportation-system (ITS) technology represent a promising scenario for investigating the multicommodity-flow-overtime problem. This type of problem is known to be strongly NP-hard. Furthermore, capacity assignment in this shared-ride system is a problem to be solved in highly dynamic transportation and communication networks. So far, the known heuristics to this problem are centralized and require global knowledge about the environment. This paper develops a decentralized ad hoc capacity-assignment approach. Based on a spatial decomposition of the global optimization problem, the solution provides effective agent decisions using only local knowledge. The effectiveness is assessed by the trip quality for ride clients and by the required communication effort.