Use of Genetic Algorithms for Spare Parts Distribution System

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21260%2F14%3A00241481" target="_blank" >RIV/68407700:21260/14:00241481 - isvavai.cz</a>

Výsledek na webu

<a href="http://www.crcnetbase.com/doi/abs/10.1201/b17488-114" target="_blank" >http://www.crcnetbase.com/doi/abs/10.1201/b17488-114</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1201/b17488-114" target="_blank" >10.1201/b17488-114</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Use of Genetic Algorithms for Spare Parts Distribution System

Popis výsledku v původním jazyce

Distribution of goods from a producer to a customer belongs to the most important tasks of transportation. Our paper focuses on the usage of Genetic Algorithms (GA) for optimizing problems in transportation, namely uncapacitated facility location problemand vehicle routing problem. Both types of problems fall in the field of NP-hard problems, which cannot be solved in polynomial time. Two sets of customers and potential facilities and non-negative distances for any two elements are given in the facility location problem. The goal is to select facility locations such that the total cost is minimum. Vehicle routing problem can be described as a problem of determining vehicle routes, where every route starts in depot, then a subset of customers is visited in a specific sequence, followed by return to the depot. Every customer has to be assigned to exactly one route and the overall amount of delivered quantity of consignments assigned to one vehicle cannot exceed the capacity of the vehic

Název v anglickém jazyce

Use of Genetic Algorithms for Spare Parts Distribution System

Popis výsledku anglicky

Distribution of goods from a producer to a customer belongs to the most important tasks of transportation. Our paper focuses on the usage of Genetic Algorithms (GA) for optimizing problems in transportation, namely uncapacitated facility location problemand vehicle routing problem. Both types of problems fall in the field of NP-hard problems, which cannot be solved in polynomial time. Two sets of customers and potential facilities and non-negative distances for any two elements are given in the facility location problem. The goal is to select facility locations such that the total cost is minimum. Vehicle routing problem can be described as a problem of determining vehicle routes, where every route starts in depot, then a subset of customers is visited in a specific sequence, followed by return to the depot. Every customer has to be assigned to exactly one route and the overall amount of delivered quantity of consignments assigned to one vehicle cannot exceed the capacity of the vehic

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í

2014

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

Engineering Optimization 2014

ISBN

978-1-138-02725-1

ISSN

—

e-ISSN

—

Počet stran výsledku

6

Strana od-do

639-644

Název nakladatele

CRC Press/Balkema

Místo vydání

Leiden

Místo konání akce

Lisabon

Datum konání akce

8. 9. 2014

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

WRD - Celosvětová akce

Kód UT WoS článku

—