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”

The GRASP Metaheuristic for the Electric 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%3A00347752" target="_blank" >RIV/68407700:21730/21:00347752 - isvavai.cz</a>

  • Result on the web

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

  • DOI - Digital Object Identifier

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    The GRASP Metaheuristic for the Electric Vehicle Routing Problem

  • Original language description

    The Electric Vehicle Routing Problem (EVRP) is a recently formulated combination of the Capacitated Vehicle Routing Problem (CVRP) and the Green Vehicle Routing Problem (GVRP). The goal is to satisfy all customers' demands while considering the vehicles' load capacity and limited driving range. All vehicles start from one central depot and can recharge during operation at multiple charging stations. The EVRP reflects the recent introduction of electric vehicles into fleets of delivery companies and represents a general formulation of numerous more specific VRP variants. This paper presents a newly proposed approach based on Greedy Randomized Adaptive Search Procedure (GRASP) scheme addressing the EVRP and documents its performance on a recently created dataset. GRASP is a neighbourhood-oriented metaheuristic performing repeated randomized construction of a valid solution, which is subsequently further improved in a local search phase. The implemented metaheuristic improves multiple best-known solutions and sets a benchmark on some previously unsolved instances.

  • 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

  • Continuities

    S - Specificky vyzkum na vysokych skolach

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

    17

  • Pages from-to

    189-205

  • 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

    000763018100012