Simulation and Optimization of Trajectories in a Congested Network

Gunnar Flötteröd () and Kai Nagel ()
Additional contact information
Gunnar Flötteröd: Berlin University of Technology, Group for Transport Systems Planning and Transport Telematics
Kai Nagel: Berlin University of Technology, Group for Transport Systems Planning and Transport Telematics

No 2006-07, Working Papers from Center for Network Industries and Infrastructure (CNI)

Abstract: The subject of this article is twofold. Firstly it describes how a dynamic macroscopic network loading model can be used to simulate the movement of arbitrarily complex individual particles (agents) through a network without loss of the macroscopic model’s differentiability. Based on this result the problem of minimizing a given functional of the macroscopic model’s states by adjustment of individual agents’ trajectories is considered. A solution procedure is proposed, which is based on subsequent linearizations of the overall system dynamics and time variant best path calculations.

Keywords: congestion; transportation; networks (search for similar items in EconPapers)
JEL-codes: C6 L91 (search for similar items in EconPapers)
Pages: 6 pages
Date: 2006
New Economics Papers: this item is included in nep-net
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.cni.tu-berlin.de/fileadmin/documents/Re ... ni_wp_no_2006-07.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:cni:wpaper:2006-07

Access Statistics for this paper

More papers in Working Papers from Center for Network Industries and Infrastructure (CNI) Contact information at EDIRC.
Bibliographic data for series maintained by Fabian Kirsch ( this e-mail address is bad, please contact ).