Elementary solution to the three vehicles jeep problem with support of the CAS Maple

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F60162694%3AG43__%2F12%3A00482240" target="_blank" >RIV/60162694:G43__/12:00482240 - isvavai.cz</a>
Result on the web
<a href="http://vavtest.unob.cz/registr" target="_blank" >http://vavtest.unob.cz/registr</a>
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Elementary solution to the three vehicles jeep problem with support of the CAS Maple
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 twobasic variants ? the single jeep problem and the convoy of jeeps problem. This contribution deals with one modification of the jeep problem with 3 vehicles and n cans of fuel (n > 3). Elementary solutions to this problem are detailed derived for small amounts n of cans of fuel. A general solution, given by the formula for determination a distance which can be reached with n cans of fuel, is stated. Some numerical results computed by two procedures, written in the computer algebra system Maple, are presented in a form of the tables.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

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

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

Similar results(10)