Skip to main content

The Jeep Problem, searching for the best strategy with a genetic algorithm

  • Conference paper
Information Processing and Security Systems

Abstract

In the Jeep Problem, the goal is to maximize the distance the jeep can penetrate into the desert using a given quantity of fuel. The jeep must not take all the fuel from the base at once. The jeep is allowed to go forward, unload some fuel, and then return to its base using the fuel remaining in its tank. At the base, it may refuel and set out again. When it reaches the fuel it has stored previously, it may use it to fill up its tank. This paper describes an attempt of solving this problem (finding the best strategy for the jeep) with a genetic algorithm. Experiments with both binary and real-coded GAs were performed.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

7 References

  1. W. W. R. Ball and H. S. M. Coxeter. Mathematical Recreations and Essays. Dover, New York, USA, 13 edition, 1987.

    Google Scholar 

  2. R. Bourisli and D. A. Kaminski. Solving fluid flow problems using a real-coded genetic algorithm with uniform refinement. Internet PDF document, http://raed.freewebpageorg.GAPF.pdf. Department of Mechanical, Aerospace and Nuclear Engineering, Rensselaer Polytechnic Institute, USA.

    Google Scholar 

  3. L. J. Eshelman, R. A. Caruana, and J. D. Schaffer. Biases in the crossover landscape. In J. D. Schaffer, editor, Proceedings of the Third International Conference on Genetic Algorithms. Morgan Kaufmann, 1989.

    Google Scholar 

  4. Melanie Mitchell. Introduction to Genetic Algorithms. The MIT Press, Cambridge, Massachusetts, USA, 1998. A Bradford Book.

    Google Scholar 

  5. Eric W. Weisstein. Euler-mascheroni constant. Published by Wolfram Research, 1999. From Math World-A Wolfram Web Resource, http://mathworld.wolfram.com/Euler-MascheroniConstant.html.

    Google Scholar 

  6. Eric W. Weisstein. Jeep problem. Published by Wolfram Research, 1999. From Math World-A Wolfram Web Resource, http://mathworld.wolfram.com/JeepProblem.html.

    Google Scholar 

  7. Eric W. Weisstein. Polygamma function. Published by Wolfram Research, 1999. From Math World-A Wolfram Web Resource, http://mathworld.wolfram.com/PolygammaFunction.html.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer Science+Business Media, Inc.

About this paper

Cite this paper

Klęsk, P. (2005). The Jeep Problem, searching for the best strategy with a genetic algorithm. In: Saeed, K., Pejaś, J. (eds) Information Processing and Security Systems. Springer, Boston, MA. https://doi.org/10.1007/0-387-26325-X_41

Download citation

  • DOI: https://doi.org/10.1007/0-387-26325-X_41

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-387-25091-5

  • Online ISBN: 978-0-387-26325-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics