Variable time discretization for a time-dependent shortest path algorithm

Ye Tian, Yi-Chang Chiu, Yang Gao

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

This paper introduces a variable time discretization strategy for a time-dependent A* shortest path algorithm. The strategy is aimed at determining the optimal memory allocation for time-dependent travel times data in order to achieve a desirable compromise between accuracy and memory usage. The proposed strategy is based on the dispersion index of the travel times/costs over the entire analysis period, as a result, producing different intervals for each link. The links with travel times that have a higher variance and a lower mean will need to have a shorter time discretization length due to greater fluctuation in travel times. The proposed strategy is implemented in the time-dependent A* algorithm and tested with a numerical experiment on a Tucson, AZ, traffic network. The results show that with the same amount of computer memory usage, the proposed variable time discretization strategy achieves much higher accuracy than that of uniform time discretization.

Original languageEnglish (US)
Title of host publicationIEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC
Pages588-593
Number of pages6
DOIs
StatePublished - 2011
Event14th IEEE International Intelligent Transportation Systems Conference, ITSC 2011 - Washington, DC, United States
Duration: Oct 5 2011Oct 7 2011

Other

Other14th IEEE International Intelligent Transportation Systems Conference, ITSC 2011
CountryUnited States
CityWashington, DC
Period10/5/1110/7/11

Fingerprint

Travel time
Storage allocation (computer)
Data storage equipment
Costs
Experiments

ASJC Scopus subject areas

  • Automotive Engineering
  • Mechanical Engineering
  • Computer Science Applications

Cite this

Tian, Y., Chiu, Y-C., & Gao, Y. (2011). Variable time discretization for a time-dependent shortest path algorithm. In IEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC (pp. 588-593). [6082871] https://doi.org/10.1109/ITSC.2011.6082871

Variable time discretization for a time-dependent shortest path algorithm. / Tian, Ye; Chiu, Yi-Chang; Gao, Yang.

IEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC. 2011. p. 588-593 6082871.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Tian, Y, Chiu, Y-C & Gao, Y 2011, Variable time discretization for a time-dependent shortest path algorithm. in IEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC., 6082871, pp. 588-593, 14th IEEE International Intelligent Transportation Systems Conference, ITSC 2011, Washington, DC, United States, 10/5/11. https://doi.org/10.1109/ITSC.2011.6082871
Tian Y, Chiu Y-C, Gao Y. Variable time discretization for a time-dependent shortest path algorithm. In IEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC. 2011. p. 588-593. 6082871 https://doi.org/10.1109/ITSC.2011.6082871
Tian, Ye ; Chiu, Yi-Chang ; Gao, Yang. / Variable time discretization for a time-dependent shortest path algorithm. IEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC. 2011. pp. 588-593
@inproceedings{a80717db241e470185b210b07bb4f541,
title = "Variable time discretization for a time-dependent shortest path algorithm",
abstract = "This paper introduces a variable time discretization strategy for a time-dependent A* shortest path algorithm. The strategy is aimed at determining the optimal memory allocation for time-dependent travel times data in order to achieve a desirable compromise between accuracy and memory usage. The proposed strategy is based on the dispersion index of the travel times/costs over the entire analysis period, as a result, producing different intervals for each link. The links with travel times that have a higher variance and a lower mean will need to have a shorter time discretization length due to greater fluctuation in travel times. The proposed strategy is implemented in the time-dependent A* algorithm and tested with a numerical experiment on a Tucson, AZ, traffic network. The results show that with the same amount of computer memory usage, the proposed variable time discretization strategy achieves much higher accuracy than that of uniform time discretization.",
author = "Ye Tian and Yi-Chang Chiu and Yang Gao",
year = "2011",
doi = "10.1109/ITSC.2011.6082871",
language = "English (US)",
isbn = "9781457721984",
pages = "588--593",
booktitle = "IEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC",

}

TY - GEN

T1 - Variable time discretization for a time-dependent shortest path algorithm

AU - Tian, Ye

AU - Chiu, Yi-Chang

AU - Gao, Yang

PY - 2011

Y1 - 2011

N2 - This paper introduces a variable time discretization strategy for a time-dependent A* shortest path algorithm. The strategy is aimed at determining the optimal memory allocation for time-dependent travel times data in order to achieve a desirable compromise between accuracy and memory usage. The proposed strategy is based on the dispersion index of the travel times/costs over the entire analysis period, as a result, producing different intervals for each link. The links with travel times that have a higher variance and a lower mean will need to have a shorter time discretization length due to greater fluctuation in travel times. The proposed strategy is implemented in the time-dependent A* algorithm and tested with a numerical experiment on a Tucson, AZ, traffic network. The results show that with the same amount of computer memory usage, the proposed variable time discretization strategy achieves much higher accuracy than that of uniform time discretization.

AB - This paper introduces a variable time discretization strategy for a time-dependent A* shortest path algorithm. The strategy is aimed at determining the optimal memory allocation for time-dependent travel times data in order to achieve a desirable compromise between accuracy and memory usage. The proposed strategy is based on the dispersion index of the travel times/costs over the entire analysis period, as a result, producing different intervals for each link. The links with travel times that have a higher variance and a lower mean will need to have a shorter time discretization length due to greater fluctuation in travel times. The proposed strategy is implemented in the time-dependent A* algorithm and tested with a numerical experiment on a Tucson, AZ, traffic network. The results show that with the same amount of computer memory usage, the proposed variable time discretization strategy achieves much higher accuracy than that of uniform time discretization.

UR - http://www.scopus.com/inward/record.url?scp=83755163815&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=83755163815&partnerID=8YFLogxK

U2 - 10.1109/ITSC.2011.6082871

DO - 10.1109/ITSC.2011.6082871

M3 - Conference contribution

AN - SCOPUS:83755163815

SN - 9781457721984

SP - 588

EP - 593

BT - IEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC

ER -