DocumentCode :
239327
Title :
Efficient storage of transport network routes for simulation models
Author :
Alanis, Ramon
Author_Institution :
Alberta Health Services, Edmonton, AB, Canada
fYear :
2014
fDate :
7-10 Dec. 2014
Firstpage :
1931
Lastpage :
1942
Abstract :
A heuristic approach is presented which, combined with the use of data structures, reduces storage requirements to store full optimal paths on transportation networks. The goal is to allow the use of full road networks on the implementation of simulations for the operation of a fleet of vehicles. The approach is based on the representation of routing information as a routing matrix, where we exploit structural properties of routing information to reduce storage requirements.
Keywords :
road traffic; road vehicles; simulation; vehicle routing; data structures; full optimal paths; full road networks; heuristic approach; routing information; routing matrix; simulation models; storage requirements; structural properties; transport network routes; transportation networks; vehicles fleet; Approximation algorithms; Computational modeling; Data structures; Roads; Routing; Vehicles;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Simulation Conference (WSC), 2014 Winter
Conference_Location :
Savanah, GA
Print_ISBN :
978-1-4799-7484-9
Type :
conf
DOI :
10.1109/WSC.2014.7020040
Filename :
7020040
Link To Document :
بازگشت