Tactical Models Based on a Multi-Depot Vehicle Routing Problem

Result code in 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>

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

Tactical Models Based on a Multi-Depot Vehicle Routing Problem

Original language description

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.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

KA - Militarism

OECD FORD branch

—

Project

—

Continuities

S - Specificky vyzkum na vysokych skolach

Publication year

2013

Confidentiality

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

Article name in the collection

Deterioration, Dependability, Diagnostics

ISBN

978-80-7231-939-8

ISSN

—

e-ISSN

—

Number of pages

8

Pages from-to

187-194

Publisher name

Univerzita obrany

Place of publication

Brno

Event location

Brno

Event date

Jan 1, 2013

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—