Simulation and Optimization of Trajectories in a Congested Network

This file is part of IDEAS, which uses RePEc data

Simulation and Optimization of Trajectories in a Congested Network

Author Info

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)

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.

Download Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. In case of further problems read the IDEAS help file. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

Publisher Info
Paper provided by Center for Network Industries and Infrastructure (CNI) in its series Working Papers with number 2006-07.

Download reference. The following formats are available: HTML, plain text, BibTeX, RIS (EndNote), ReDIF
Length: 6 pages
Date of creation: 2006
Date of revision:
Handle: RePEc:cni:wpaper:2006-07

Contact details of provider:
Email:
Web page: http://www.cni.tu-berlin.de
More information through EDIRC

For technical questions regarding this item, or to correct its listing, contact: (Fabian Kirsch).

Find related papers by JEL classification:
L91 - Industrial Organization - - Industry Studies: Transportation and Utilities - - - Transportation: General
C6 - Mathematical and Quantitative Methods - - Mathematical Methods and Programming

This paper has been announced in the following NEP Reports:

NEP-ALL-2007-01-14 (All new papers)
NEP-NET-2007-01-14 (Network Economics)

References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:

M. Jones & S. Vines, 1998. "Choosing the smoothing parameter for unordered multinomial data," TEST: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer, vol. 7(2), pages 413-426, December. [Downloadable!] (restricted)
Gunnar Flötteröd & Kai Nagel, 2006. "Bayesian modeling and estimation of combined route and activity location choice," Working Papers 2006-06, Center for Network Industries and Infrastructure (CNI). [Downloadable!]

Full references

Cited by:
(explanations, Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.)

Gunnar Flötteröd & Kai Nagel, 2006. "Bayesian modeling and estimation of combined route and activity location choice," Working Papers 2006-06, Center for Network Industries and Infrastructure (CNI). [Downloadable!]

Statistics

Access and download statistics

Did you know? IDEAS also computes impact factors for journals and working paper series.

This page was last updated on 2008-10-2.

This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.