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

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F60162694%3AG43__%2F12%3A00477736" target="_blank" >RIV/60162694:G43__/12:00477736 - isvavai.cz</a>

Výsledek na webu

<a href="http://vavtest.unob.cz/registr" target="_blank" >http://vavtest.unob.cz/registr</a>

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

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

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 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.

Název v anglickém jazyce

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

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 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.

Druh

D - Stať ve sborníku

CEP obor

BA - Obecná matematika

OECD FORD obor

—

Projekt

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2012

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

Proceedings of 11th International Conference Aplimat 2012

ISBN

978-80-89313-58-7

ISSN

—

e-ISSN

—

Počet stran výsledku

10

Strana od-do

281-290

Název nakladatele

Faculty of Mechanical Engineering, Slovak University of Technology in Bratislava, Slovakia

Místo vydání

Bratislava, Slovakia

Místo konání akce

Bratislava, Slovakia

Datum konání akce

1. 1. 2012

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

EUR - Evropská akce

Kód UT WoS článku

—