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%.
This research is supported by 973 Program (2006CB701306), and Key Laboratory of Management, Decision and Information Systems, CAS.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization Algorithms and Complexity. Prentice Hall Inc., Englewood Cliffs (1982)
Du, D.Z., Ko, K.-I., Wang, J.: Introduction to Computational. Higher Education Press (2002) (in Chinese)
Yu, G., Qi, X.T.: Disruption Management: Framework, Models and Applications. World Scientific Publishing, Co., Singapore (2004)
Heuristic Algorithm, http://en.wikipedia.org/wiki/Heuristic_computer_science
Vazirani, V.V.: Approximation Algorithms. Springer, Berlin (2001)
Rui, Y.: A Travelling Problem and its Extended Research. Bulletin of Maths. 9, 44–45 (1999)
Li, X.Y., Cui, J.C.: Efficient Algorithm for Kind of Exploration Problem with N Vehicles. Journal of Systems Engineering 23(4), 444–448 (2008) (in Chinese)
Liang, L.L.: A Problem of Permutation Optimization. Journal of Guangxi University for Nationalities 12(4), 72–76 (2006) (in Chinese)
Wu, T.: Koimogorov Complexity Research Historical Review. Journal of Systemic Dialectics 12(1), 24–29 (2004) (in Chinese)
Wang, Z.L., Liu, M.: Master in Matlab 7. Publishing House of Electronics Industry (2006) (in Chinese)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, X., Cui, J. (2009). Real-Time Algorithm Scheme for n-Vehicle Exploration Problem. In: Du, DZ., Hu, X., Pardalos, P.M. (eds) Combinatorial Optimization and Applications. COCOA 2009. Lecture Notes in Computer Science, vol 5573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02026-1_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-02026-1_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02025-4
Online ISBN: 978-3-642-02026-1
eBook Packages: Computer ScienceComputer Science (R0)