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

Kód výsledku v 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>

Výsledek na webu

<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

—

Jazyk výsledku

angličtina

Název v původním jazyce

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

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

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

Popis výsledku anglicky

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.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10102 - Applied mathematics

Projekt

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2017

Kód důvěrnosti údajů

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

Název statě ve sborníku

DISTANCE LEARNING, SIMULATION AND COMMUNICATION 2017 Proceedings (Selected papers)

ISBN

978-80-7231-415-7

ISSN

—

e-ISSN

—

Počet stran výsledku

7

Strana od-do

154-160

Název nakladatele

University of Defence, Brno

Místo vydání

Brno

Místo konání akce

Brno

Datum konání akce

31. 5. 2017

Typ akce podle státní příslušnosti

EUR - Evropská akce

Kód UT WoS článku

—