IDEAS home Printed from https://ideas.repec.org/a/axf/gbppsa/v13y2025ip123-132.html

Empirical Study on Traffic Flow Prediction and Route Optimization in Chengdu City

Author

Listed:
  • Tang, Na
  • Zhou, Xinhui
  • Chen, Xieyu

Abstract

This study presents an empirical investigation of urban traffic flow forecasting and route optimization using over 1.4 billion GPS trajectory records collected from more than 14,000 taxis in Chengdu between 24th and 30th August 2014. Applying the DBSCAN clustering algorithm, a high-density hotspot region was identified, centered on the city center (approximately 104.05°E, 30.65°N), highlighting pronounced spatial clustering in taxi activity. For taxi demand forecasting, a multivariate LSTM neural network model was developed, achieving low prediction errors on the test set (MAE ranging from 0.14 to 0.17) and accurately capturing spatio-temporal demand patterns across different zones. For example, the model successfully forecasted nearly 5,500 demand instances during the evening peak in the High-Tech Zone, closely matching the observed peak of approximately 6,000 instances, while discrepancies of around 500 instances occurred in areas such as Chenghua District. Additionally, the Isolation Forest anomaly detection model identified sudden acceleration (763 instances) and high-speed driving (593 instances) as the primary abnormal driving behaviors, with a higher incidence observed during empty-vehicle states. These findings offer a reliable data-driven foundation for intelligent urban taxi dispatch, transport resource optimization, and traffic safety management.

Suggested Citation

  • Tang, Na & Zhou, Xinhui & Chen, Xieyu, 2025. "Empirical Study on Traffic Flow Prediction and Route Optimization in Chengdu City," GBP Proceedings Series, Scientific Open Access Publishing, vol. 13, pages 123-132.
  • Handle: RePEc:axf:gbppsa:v:13:y:2025:i::p:123-132
    as

    Download full text from publisher

    File URL: https://soapubs.com/index.php/GBPPS/article/view/795/776
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:axf:gbppsa:v:13:y:2025:i::p:123-132. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Yuchi Liu (email available below). General contact details of provider: https://soapubs.com/index.php/GBPPS .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.