All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

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

The result's identifiers

  • Result code in 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>

  • Alternative codes found

    RIV/61989100:27740/14:86099402

  • Result on the web

    <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>

Alternative languages

  • Result language

    angličtina

  • Original language name

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

  • Original language description

    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.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/ED1.1.00%2F02.0070" target="_blank" >ED1.1.00/02.0070: IT4Innovations Centre of Excellence</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2014

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

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

  • ISBN

    978-1-4799-7633-1

  • ISSN

  • e-ISSN

  • Number of pages

    6

  • Pages from-to

    12-17

  • Publisher name

    IEEE

  • Place of publication

    New York

  • Event location

    Kuvajt

  • Event date

    Dec 14, 2014

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000380435700039