A dynamic route assignment model for guided and unguided vehicles with a massively parallel computing architecture

DOI10.1016/0895-7177(95)00145-RzbMath0838.90036OpenAlexW2053237661MaRDI QIDQ1906978

G.-L. Chang, T. Junchaya

Publication date: 28 January 1996

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0895-7177(95)00145-r

zbMATH Keywords

route guidancemassively parallel computerconnection machinedynamic assignment modelintegrated assignment-simulation framework

Mathematics Subject Classification ID

Automated systems (robots, etc.) in control theory (93C85) Traffic problems in operations research (90B20) Parallel numerical computation (65Y05)

Related Items (1)

Stability of intelligent transportation network dynamics: a daily path flow adjustment considering travel time differentiation

Cites Work

• Dynamic Network Traffic Assignment Considered as a Continuous Time Optimal Control Problem
• Optimal Time-Varying Flows on Congested Networks
• A Decomposition Algorithm for the All-Pairs Shortest Path Problem on Massively Parallel Computer Architectures
• A New Class of Instantaneous Dynamic User-Optimal Traffic Assignment Models

This page was built for publication: A dynamic route assignment model for guided and unguided vehicles with a massively parallel computing architecture