A Solution for Multi-objective Commodity Vehicle Routing Problem by NSGA-II

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F14%3A86099402" target="_blank" >RIV/61989100:27240/14:86099402 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/61989100:27740/14:86099402

Výsledek na webu

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

DOI - Digital Object Identifier

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

Jazyk výsledku

angličtina

Název v původním jazyce

A Solution for Multi-objective Commodity Vehicle Routing Problem by NSGA-II

Popis výsledku v původním jazyce

Vehicle routing is considered the basic issue in distribution management. In real-world problems, customer demand for some commodities increases on special situations. On the one hand, one of the factors that are very important for customers is the timely delivery of the demanded commodities. In this research, customers had several different kinds of demands. Therefore, a new routing model was introduced in the form of integer linear programming by combining the concepts of time windows and multiple demands and by considering the two contradictory goals of minimizing travel cost and maximizing demand coverage. Moreover, two approaches were designed for the problem-solving model based on the NSGA-II algorithm with diversification of the mutation operator structure. The two criteria of spread and coverage of non-dominated solutions were used to compare algorithms. Study of some typical created problems indicated the validity of the model and the computational efficiency of the proposed algorithm. The proposed algorithm could increase the criterion of solution spread by about 10%, and increased the number of obtained solutions on the Pareto border compared to other algorithms, which indicated its high efficiency. (C) 2014 IEEE.

Název v anglickém jazyce

A Solution for Multi-objective Commodity Vehicle Routing Problem by NSGA-II

Popis výsledku anglicky

Vehicle routing is considered the basic issue in distribution management. In real-world problems, customer demand for some commodities increases on special situations. On the one hand, one of the factors that are very important for customers is the timely delivery of the demanded commodities. In this research, customers had several different kinds of demands. Therefore, a new routing model was introduced in the form of integer linear programming by combining the concepts of time windows and multiple demands and by considering the two contradictory goals of minimizing travel cost and maximizing demand coverage. Moreover, two approaches were designed for the problem-solving model based on the NSGA-II algorithm with diversification of the mutation operator structure. The two criteria of spread and coverage of non-dominated solutions were used to compare algorithms. Study of some typical created problems indicated the validity of the model and the computational efficiency of the proposed algorithm. The proposed algorithm could increase the criterion of solution spread by about 10%, and increased the number of obtained solutions on the Pareto border compared to other algorithms, which indicated its high efficiency. (C) 2014 IEEE.

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/ED1.1.00%2F02.0070" target="_blank" >ED1.1.00/02.0070: Centrum excelence IT4Innovations</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>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

2014 14th International Conference on Hybrid Intelligent Systems, HIS 2014

ISBN

978-1-4799-7633-1

ISSN

—

e-ISSN

—

Počet stran výsledku

6

Strana od-do

12-17

Název nakladatele

IEEE

Místo vydání

New York

Místo konání akce

Kuvajt

Datum konání akce

14. 12. 2014

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

WRD - Celosvětová akce

Kód UT WoS článku

000380435700039