Transportation of Euro Pallets Solved as a Split Delivery Vehicle Routing Problem.

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F29142890%3A_____%2F19%3A00036107" target="_blank" >RIV/29142890:_____/19:00036107 - isvavai.cz</a>

Výsledek na webu

<a href="http://www.actalogistica.eu/issues/2019/II_2019_04_Fabry.pdf" target="_blank" >http://www.actalogistica.eu/issues/2019/II_2019_04_Fabry.pdf</a>

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Transportation of Euro Pallets Solved as a Split Delivery Vehicle Routing Problem.

Popis výsledku v původním jazyce

The article is aimed at the logistic problem of the company transporting Euro pallets to its customers. The main focus is on finding more effective routes for pallets distribution in terms of the total distance. The real instance can be solved as the vehicle routing problem. In many cases, splitting of the customer demand into several routes, can significantly improve the solution. The real problem consists in the pallets distribution from the depot to twelve customers. For solution, model in MPL for Windows is formulated and solved in CPLEX. Because of NP-hardness of the problem, it is necessary to propose heuristic algorithms for getting the effective feasible solution instead of unreachable optimum solution.

Název v anglickém jazyce

Transportation of Euro Pallets Solved as a Split Delivery Vehicle Routing Problem.

Popis výsledku anglicky

The article is aimed at the logistic problem of the company transporting Euro pallets to its customers. The main focus is on finding more effective routes for pallets distribution in terms of the total distance. The real instance can be solved as the vehicle routing problem. In many cases, splitting of the customer demand into several routes, can significantly improve the solution. The real problem consists in the pallets distribution from the depot to twelve customers. For solution, model in MPL for Windows is formulated and solved in CPLEX. Because of NP-hardness of the problem, it is necessary to propose heuristic algorithms for getting the effective feasible solution instead of unreachable optimum solution.

Druh

J_SC - Článek v periodiku v databázi SCOPUS

CEP obor

—

OECD FORD obor

10102 - Applied mathematics

Projekt

—

Návaznosti

N - Vyzkumna aktivita podporovana z neverejnych zdroju

Rok uplatnění

2019

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

Acta logistica

ISSN

1339-5629

e-ISSN

—

Svazek periodika

6

Číslo periodika v rámci svazku

2

Stát vydavatele periodika

SK - Slovenská republika

Počet stran výsledku

5

Strana od-do

49-53

Kód UT WoS článku

—

EID výsledku v databázi Scopus

2-s2.0-85071677517