R-Tree Based Optimization Algorithm for Dynamic Transport Problem

  • Naoto Mukai
  • Toyohide Watanabe
  • Jun Feng
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4252)


The scheduling problem of transport vehicles is one of the important issues in our international society. Such a problem should be solved optimally and instantaneously to keep high profitability and conveniency. However, it is hard to find an optimal solution in such a transport problem because transport requests occur constantly and the optimal solution changes according to the requests. Therefore, the strategy to find a near-optimal solution is a practical way to solve the problem at low calculation cost. In this paper, we focus on the range constraints of the optimization problem. The assignment of requests is optimized by request exchange between transport vehicles in their belonging group (i.e., range constraint) to keep the calculation cost low. The group of transport vehicles should be dynamically changed on the basis of their positions. Hence, we introduce an indexing tree called R-Tree and re-construct the tree in certain intervals to index moving transport vehicles dynamically. In the last of this paper, we report the influence of group size and the update interval on the performance of transport vehicles and then show the effectiveness of our optimization algorithm.


Schedule Problem Leaf Node Spatial Object Time Distance Indexing Tree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Noda, I., Ohta, M., Shinoda, K., Kumada, Y., Nakashima, H.: Is demand bus reasonable in learge scale towns? Technical Report, 2003-ICS-131, IPSJ SIG Technical Report (in Japanese) (2003)Google Scholar
  2. 2.
    Harano, T., Ishikawa, T.: On the validity of cooperated demand bus. Technical Report 2004-ITS-19, IPSJ SIG Technical Report (in Japanese) (2004)Google Scholar
  3. 3.
    Qili, K., Ong, K.: A reactive method for real time dynamic vehicle routing problem. In: Proc. of ICTAI 2000, pp. 176–181 (2000)Google Scholar
  4. 4.
    Tian, Y., Song, J., Yao, D., Hu, J.: Dynamic vehicle routing problem using hybrid ant system. In: Proceedings of the 2003 IEEE International Conference on Intelligent Transportation Systems, pp. 970–974 (2003)Google Scholar
  5. 5.
    Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: Proc. of ACM SIGMOD 1984, pp. 47–57 (1984)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Naoto Mukai
    • 1
  • Toyohide Watanabe
    • 1
  • Jun Feng
    • 2
  1. 1.Department of Systems and Social Informatics, Graduate School of Information ScienceNagoya UniversityNagoyaJapan
  2. 2.Hohai UniversityNanjingChina

Personalised recommendations