Optimization of a spare parts distribution system

Kód výsledku v IS VaVaI

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

Výsledek na webu

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

DOI - Digital Object Identifier

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

Jazyk výsledku

angličtina

Název v původním jazyce

Optimization of a spare parts distribution system

Popis výsledku v původním jazyce

In this paper we focus on the system of the spare parts distribution for authorised garages in the Czech republic and its optimization based on genetic algorithm. Real world problem of garages supply consists of the design of the optimal location of distribution depots and the design of routes that are used for everyday delivery of spare parts. Both of these subproblems that belong to NP-hard problems are solved separately using genetic algorithm. In the facility location problem, the set of customers,set of potential locations of facilities and distances for all their combinations are given and our goal is to select location of facilities with the minimum costs based on chosen criterion. In the second part of the optimization the vehicle routing problem is solved where the goal is to determine the routes described as a sequence of customers visited on this route. Every route starts and ends in the depot and is limited by capacity of the vehicle. Homogeneous fleet was used in this pro

Název v anglickém jazyce

Optimization of a spare parts distribution system

Popis výsledku anglicky

In this paper we focus on the system of the spare parts distribution for authorised garages in the Czech republic and its optimization based on genetic algorithm. Real world problem of garages supply consists of the design of the optimal location of distribution depots and the design of routes that are used for everyday delivery of spare parts. Both of these subproblems that belong to NP-hard problems are solved separately using genetic algorithm. In the facility location problem, the set of customers,set of potential locations of facilities and distances for all their combinations are given and our goal is to select location of facilities with the minimum costs based on chosen criterion. In the second part of the optimization the vehicle routing problem is solved where the goal is to determine the routes described as a sequence of customers visited on this route. Every route starts and ends in the depot and is limited by capacity of the vehicle. Homogeneous fleet was used in this pro

Druh

D - Stať ve sborníku

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 statě ve sborníku

2015 Smart Cities Symposium Prague (SCSP)

ISBN

978-1-4673-6727-1

ISSN

—

e-ISSN

—

Počet stran výsledku

4

Strana od-do

—

Název nakladatele

IEEE Press

Místo vydání

New York

Místo konání akce

Prague

Datum konání akce

24. 6. 2015

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

EUR - Evropská akce

Kód UT WoS článku

—