Ad Hoc Solution of the Multicommodity-Flow-Over-Time Problem

Authored by Stephan Winter, Matthias Braun

Date Published: 2009-12

DOI: 10.1109/tits.2009.2026443

Sponsors: No sponsors listed

Platforms: Java

Model Documentation: Other Narrative Mathematical description

Model Code URLs: Model code not found

Abstract

Ad hoc shared-ride systems built upon intelligent-transportation-system (ITS) technology represent a promising scenario for investigating the multicommodity-flow-over-time 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.

Tags

Agent-based modeling Optimization local control multicommodity flow transportation planning