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”

Initial Solution Constructors for Capacitated Green Vehicle Routing Problem

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21730%2F21%3A00347713" target="_blank" >RIV/68407700:21730/21:00347713 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.1007/978-3-030-70740-8_16" target="_blank" >https://doi.org/10.1007/978-3-030-70740-8_16</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-030-70740-8_16" target="_blank" >10.1007/978-3-030-70740-8_16</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Initial Solution Constructors for Capacitated Green Vehicle Routing Problem

  • Original language description

    This paper presents an analysis of the initial feasible solution constructions for the Capacitated Green Vehicle Routing Problem (CGVRP). CGVRP is a more challenging variant of the conventional Vehicle Routing Problem (VRP), where Alternative Fuel Vehicles (AFVs) are limited by their fuel capacity and the scarce availability of Alternative Fueling Stations (AFSs). The problem also imposes a constraint on the maximum carrying capacity of the vehicle. Presented methods can be used as a starting point for more advanced metaheuristics. Some of the methods can be seen as a generalization of the traveling salesmen problem, where one can draw on the numerous techniques described and known in this domain, other methods belong to the class of divide and conquer techniques, where the subproblems are some variants of the VRP. We use a two-phase approach with several different methods for both the initial VRP route construction and the following CGVRP tour validation and repair procedure. The methods are compared on various instances and their advantages are discussed in relation to common variants of the VRP, together with a possibility of their improvements or extensions.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    <a href="/en/project/GX19-26143X" target="_blank" >GX19-26143X: Non-periodic pattern-forming metamaterials: Modular design and fabrication</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2021

  • 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

    Modelling and Simulation for Autonomous Systems

  • ISBN

    978-3-030-70739-2

  • ISSN

    0302-9743

  • e-ISSN

    1611-3349

  • Number of pages

    19

  • Pages from-to

    250-268

  • Publisher name

    Springer

  • Place of publication

    Cham

  • Event location

    Praha

  • Event date

    Oct 21, 2020

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000763018100016