Real-Time Algorithm Scheme for n-Vehicle Exploration Problem

  • Authors:

  • Xiaoya Li;Jinchuan Cui

  • Affiliations:

  • Institute of Applied Mathematics, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, China 100190;Institute of Applied Mathematics, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, China 100190

  • Venue:
  • COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider a new kind of n -vehicle exploration problem. Given n vehicles, respectively denoted by v 1 ,v 2 , *** ,v n , the oil capacity of v i is a i , and the oil consumption amount of v i is b i . The n vehicles depart from the same place, and steer straight to the same direction. Without oil supply in the middle, but some vehicles can stop wherever and give its oil to any others. The question is how to arrange the order of n vehicles to make one of the vehicles go the farthest. In this paper, we propose a couple of heuristic algorithms and construct the real-time algorithm scheme. We can find a solution in a reasonable time complexity and approximation ratio under the real-time scheme. We simulate the proposed algorithms, and the results show that the approximate ratio of heuristic algorithm is as well as be above 98%.