Elementary Solution to the Jeep Problem with One Chief and Two Supporting Vehicles

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F60162694%3AG43__%2F17%3A00534465" target="_blank" >RIV/60162694:G43__/17:00534465 - isvavai.cz</a>

Výsledek na webu

<a href="http://ieeexplore.ieee.org/document/7988738/" target="_blank" >http://ieeexplore.ieee.org/document/7988738/</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/MILTECHS.2017.7988738" target="_blank" >10.1109/MILTECHS.2017.7988738</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Elementary Solution to the Jeep Problem with One Chief and Two 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 contribution deals with one modication of the jeep problém with 3 vehicles and n cans of fuel (n > 3). Elementary solutions to this modication are detailed derived for small amounts n of cans of fuel. General solution to this problém using harmonic numbers is also stated. Numerical solutions for some of the outstanding amounts of fuel and units of distance, computed by the programming language of the computer algebra system Maple, are presented, too.

Název v anglickém jazyce

Elementary Solution to the Jeep Problem with One Chief and Two 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 contribution deals with one modication of the jeep problém with 3 vehicles and n cans of fuel (n > 3). Elementary solutions to this modication are detailed derived for small amounts n of cans of fuel. General solution to this problém using harmonic numbers is also stated. Numerical solutions for some of the outstanding amounts of fuel and units of distance, computed by the programming language of 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

Conference Proceedings of International Conference on Military Technology (ICMT'2017)

ISBN

978-1-5386-1988-9

ISSN

—

e-ISSN

—

Počet stran výsledku

5

Strana od-do

97-101

Název nakladatele

IEEE

Místo vydání

Piscataway, NJ 08854-4141 USA

Místo konání akce

Brno

Datum konání akce

21. 7. 2017

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

WRD - Celosvětová akce

Kód UT WoS článku

—