Computing journey start times with recurrent traffic conditions

Computing journey start times with recurrent traffic conditions

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
IET Intelligent Transport Systems — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

In this study, the authors discuss the effective usage of technology to solve the problem of deciding on journey start times for recurrent traffic conditions. The developed algorithm guides the vehicles to travel on more reliable routes that are not easily prone to congestion or travel delays, ensures that the start time is as late as possible to avoid the traveller waiting too long at their destination and attempts to minimise the travel time. Experiments show that in order to be more certain of reaching their destination on time, a traveller has to leave early and correspondingly arrive early, resulting in a large waiting time. The application developed here asks the user to set this certainty factor as per the task in hand, and computes the best start time and route.


    1. 1)
      • 1. Gordon, R. (Eds.): ‘Chapter 3: functional ITS design issues’, in ‘Intelligent freeway transportation systems’ (Springer, NY, 2009), pp. 1740.
    2. 2)
    3. 3)
    4. 4)
      • 4. Weyns, D., Holvoet, T., Helleboogh, A.: ‘Anticipatory vehicle routing using delegate multi-agent systems’. Proc. IEEE Intelligent Transportation Systems Conf., Seattle, WA, 2007, pp. 8793.
    5. 5)
    6. 6)
      • 6. Ando, Y., Fukazawa, Y., Masutani, O., Iwasaki, H., Honiden, S.: ‘Performance of pheromone model for predicting traffic congestion’. Proc. Fifth Int. Jt. Conf. on Autonomous Agents and Multiagent Systems, New York, 2006, pp. 7380.
    7. 7)
      • 7. Narzt, W., Pomberger, G., Wilflingseder, U., et al: ‘Self-organization in trafric networks by digital pheromones’. Proc. IEEE Intelligent Transportation Systems Conf., Seattle, WA, 2007, pp. 490495.
    8. 8)
    9. 9)
    10. 10)
    11. 11)
    12. 12)
      • 12. van Lint, J.: ‘Incremental and online learning through extended kalman filtering with constraint weights for freeway travel time prediction’. Proc. Intelligent Transportation Systems Conf., Toronto, 2006, pp. 10411046.
    13. 13)
    14. 14)
    15. 15)
    16. 16)
      • 16. Tatomir, B., Rothkrantz, L.: ‘Hierarchical routing in traffic using swarm-intelligence’. Proc. 2006 Intelligent Transportation Systems Conf., Toronto, 2006, pp. 230235.
    17. 17)
    18. 18)
    19. 19)
      • 19. Reichardt, D., Miglietta, M., Moretti, L., Morsink, P., Schulz, W.: ‘CarTALK 2000: safe and comfortable driving based upon inter-vehicle-communication’. Proc. 2002 IEEE Intelligent Vehicle Symp., 2002, vol. 2, pp. 545550.
    20. 20)
      • 20. Kala, R.: ‘Motion planning for multiple autonomous vehicles’, PhD thesis, University of Reading, UK, 2013.
    21. 21)
    22. 22)
      • 22. Openstreetmap, available at:, accessed August 2012.
    23. 23)

Related content

This is a required field
Please enter a valid email address