Elementary solution to the Jeep problem with one chief and three supporting vehicles

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F60162694%3AG43__%2F17%3A00534464" target="_blank" >RIV/60162694:G43__/17:00534464 - isvavai.cz</a>
Result on the web
<a href="http://dlsc.unob.cz/data/DLSC%202017%20Proceedings%20Selected%20papers.pdf" target="_blank" >http://dlsc.unob.cz/data/DLSC%202017%20Proceedings%20Selected%20papers.pdf</a>
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Elementary solution to the Jeep problem with one chief and three supporting vehicles
Original language description
The jeep problem is a well-known logistics problem. A jeep must cross a desert wider than it can travel on one tank of fuel with the help of optimal arrangement of fuel dumps along the route. The available resources refer, especially, to solutions of two basic variants - the single jeep problem and the convoy of jeeps problem. This paper deals with one modification of the jeep problem with 4 vehicles and n cans of fuel (n>4). Elementary solutions to this modification are derived for small amounts n of cans of fuel. General solution using harmonic numbers is also stated. Numerical solutions for some amounts of fuel and units of distance, computed by the computer algebra system Maple, are presented, too.
Czech name
—
Czech description
—

Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2017
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
DISTANCE LEARNING, SIMULATION AND COMMUNICATION 2017 Proceedings (Selected papers)
ISBN
978-80-7231-415-7
ISSN
—
e-ISSN
—
Number of pages
7
Pages from-to
154-160
Publisher name
University of Defence, Brno
Place of publication
Brno
Event location
Brno
Event date
May 31, 2017
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—

Similar results(10)