Chapter

Knowledge-Based Intelligent Information and Engineering Systems

Volume 4252 of the series Lecture Notes in Computer Science pp 1095-1102

R-Tree Based Optimization Algorithm for Dynamic Transport Problem

  • Naoto MukaiAffiliated withDepartment of Systems and Social Informatics, Graduate School of Information Science, Nagoya University
  • , Toyohide WatanabeAffiliated withDepartment of Systems and Social Informatics, Graduate School of Information Science, Nagoya University
  • , Jun FengAffiliated withHohai University

* Final gross prices may vary according to local VAT.

Get Access

Abstract

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.