Tactical Models Based on a Multi-Depot Vehicle Routing Problem

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F60162694%3AG42__%2F13%3A00497664" target="_blank" >RIV/60162694:G42__/13:00497664 - 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

Tactical Models Based on a Multi-Depot Vehicle Routing Problem

Popis výsledku v původním jazyce

The Multi-Depot Vehicle Routing Problem (MDVRP) is an extension of a classic Vehicle Routing Problem (VRP). The main goal is to find optimal routes for a set of vehicles starting from multiple depots to a number of customers. Each customer should be served only once and each vehicle returns to the original depot after visiting all customers along its route. MDVRP is a well-known problem with many real applications. This paper deals with the unique solution to this problem based on applying Ant Colony Optimization (ACO) theory. The main part of the paper presents two tactical models based on this problem solution: (a) optimal supply distribution on the battlefield, and (b) UAVs (Unmanned Aerial Vehicles) routes planning for optimal reconnaissance of thearea of interest.

Název v anglickém jazyce

Tactical Models Based on a Multi-Depot Vehicle Routing Problem

Popis výsledku anglicky

The Multi-Depot Vehicle Routing Problem (MDVRP) is an extension of a classic Vehicle Routing Problem (VRP). The main goal is to find optimal routes for a set of vehicles starting from multiple depots to a number of customers. Each customer should be served only once and each vehicle returns to the original depot after visiting all customers along its route. MDVRP is a well-known problem with many real applications. This paper deals with the unique solution to this problem based on applying Ant Colony Optimization (ACO) theory. The main part of the paper presents two tactical models based on this problem solution: (a) optimal supply distribution on the battlefield, and (b) UAVs (Unmanned Aerial Vehicles) routes planning for optimal reconnaissance of thearea of interest.

Druh

D - Stať ve sborníku

CEP obor

KA - Vojenství

OECD FORD obor

—

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2013

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

Deterioration, Dependability, Diagnostics

ISBN

978-80-7231-939-8

ISSN

—

e-ISSN

—

Počet stran výsledku

8

Strana od-do

187-194

Název nakladatele

Univerzita obrany

Místo vydání

Brno

Místo konání akce

Brno

Datum konání akce

1. 1. 2013

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

WRD - Celosvětová akce

Kód UT WoS článku

—