Simulation and optimization of trajectories in a congested network
2006 (English)Report (Other academic)
The subject of this article is twofold. Firstly itdescribes how a dynamic macroscopic network loading modelcan be used to simulate the movement of arbitrarily complexindividual particles (agents) through a network without loss ofthe macroscopic model’s differentiability. Based on this resultthe problem of minimizing a given functional of the macroscopicmodel’s states by adjustment of individual agents’ trajectoriesis considered. A solution procedure is proposed, which is basedon subsequent linearizations of the overall system dynamics andtime variant best path calculations.
Place, publisher, year, edition, pages
2006. no report number V
Transport Systems and Logistics
IdentifiersURN: urn:nbn:se:kth:diva-76853OAI: oai:DiVA.org:kth-76853DiVA: diva2:491226
TSC import 1012 2012-02-06. QC 201205302012-02-062012-02-062012-05-30Bibliographically approved