A Genetic Algorithm for the Multi-Depot Vehicle Routing Problem

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21260%2F15%3A00234735" target="_blank" >RIV/68407700:21260/15:00234735 - isvavai.cz</a>

Výsledek na webu

<a href="http://www.ttp.net/978-3-03835-622-6.html" target="_blank" >http://www.ttp.net/978-3-03835-622-6.html</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.4028/www.scientific.net/AMM.803.69" target="_blank" >10.4028/www.scientific.net/AMM.803.69</a>

Jazyk výsledku

angličtina

Název v původním jazyce

A Genetic Algorithm for the Multi-Depot Vehicle Routing Problem

Popis výsledku v původním jazyce

In this paper, we focus on the optimization of the system of the spare parts distribution for authorized garages in the Czech Republic. A spare parts market belongs to one of the key elements of the car industry. However, it has to adapt to still higherrequirements on accuracy, speed and minimum error rate of the deliveries with keeping the costs at its minimum at the same time. The distribution of products from depots to customers is a practical and challenging problem in logistics that opens a significant space for application of software products. The design of optimal routes of vehicles from two depots can be formulated in combinatorial optimization as a multi-depot vehicle routing problem. The goal of a multi-depot vehicle routing problem is to design routes that start and end in one of the depots and visit a subset of customers in a specific sequence. Every customer has to be visited on one of the routes and the total costs for the delivery should be minimal. Vehicle routing pro

Název v anglickém jazyce

A Genetic Algorithm for the Multi-Depot Vehicle Routing Problem

Popis výsledku anglicky

In this paper, we focus on the optimization of the system of the spare parts distribution for authorized garages in the Czech Republic. A spare parts market belongs to one of the key elements of the car industry. However, it has to adapt to still higherrequirements on accuracy, speed and minimum error rate of the deliveries with keeping the costs at its minimum at the same time. The distribution of products from depots to customers is a practical and challenging problem in logistics that opens a significant space for application of software products. The design of optimal routes of vehicles from two depots can be formulated in combinatorial optimization as a multi-depot vehicle routing problem. The goal of a multi-depot vehicle routing problem is to design routes that start and end in one of the depots and visit a subset of customers in a specific sequence. Every customer has to be visited on one of the routes and the total costs for the delivery should be minimal. Vehicle routing pro

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

BB - Aplikovaná statistika, operační výzkum

OECD FORD obor

—

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2015

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 periodika

Applied Mechanics and Materials

ISSN

1660-9336

e-ISSN

—

Svazek periodika

803

Číslo periodika v rámci svazku

803(2015)

Stát vydavatele periodika

CH - Švýcarská konfederace

Počet stran výsledku

7

Strana od-do

69-75

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—