CoChat

Effective Permutation Encoding for Evolutionary Optimization of the Electric Vehicle Routing Problem

Open access
Iwańkowicz, Remigiusz · 2021 · Energies

The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.

Abstract

This paper addresses the problem of route planning for a fleet of electric vehicles departing from a depot and supplying customers with certain goods. This paper aims to present a permutation-based method of vehicle route coding adapted to the specificity of electric drive. The developed method integrated with an evolutionary algorithm allows for rapid generation of routes for multiple vehicles taking into account the necessity of supplying energy in available charging stations. The minimization of the route distance travelled by all vehicles was taken as a criterion. The performed testing indicated satisfactory computation speed. A real region with four charging stations and 33 customers was analysed. Different scenarios of demand were analysed, and factors affecting the results of the proposed calculation method were indicated. The limitations of the method were pointed out, mainly caused by assumptions that simplify the problem. In the future, it is planned for research and method development to include the lapse of time and for the set of factors influencing energy consumption by a moving vehicle to be extended.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.3390/en14206651

Cites

23 of 23 references verified0 citation errors · 0 not checkable

Statistics

Figures

Figure 1 The structure of distance matrix D. Figure 1. The structure of distance matrix D .
Figure 1 The structure of distance matrix D. Figure 1. The structure of distance matrix D .CC-BY · From the PDF
Figure 2 Solution decoding algorithm. Figure 2. Solution decoding algorithm.
Figure 2 Solution decoding algorithm. Figure 2. Solution decoding algorithm.CC-BY · From the PDF
Figure 3 Example of E-VRP solution decoding. Figure 3. Example of E-VRP solution decoding.
Figure 3 Example of E-VRP solution decoding. Figure 3. Example of E-VRP solution decoding.CC-BY · From the PDF
Image 4
CC-BY · From the PDF
Figure 5 History of the evolution of the adaptation function during the optimization for the first scenario. Figure 5. History of the evolution of the adaptation function during the optimization for the first scenario.
Figure 5 History of the evolution of the adaptation function during the optimization for the first scenario. Figure 5. History of the evolution of the adaptation function during the optimization for the first scenario.CC-BY · From the PDF
Image 6
CC-BY · From the PDF
Figure 7 The visualization of the found solution for the second scenario. Figure 7. The visualization of the found solution for the second scenario.
Figure 7 The visualization of the found solution for the second scenario. Figure 7. The visualization of the found solution for the second scenario.CC-BY · From the PDF
Image 8
CC-BY · From the PDF
Figure 9 Routes of the best solution (instance 1). Figure 9. Routes of the best solution (instance 1).
Figure 9 Routes of the best solution (instance 1). Figure 9. Routes of the best solution (instance 1).CC-BY · From the PDF
Figure 10 Routes of the best solution (instance 2). Figure 10. Routes of the best solution (instance 2).
Figure 10 Routes of the best solution (instance 2). Figure 10. Routes of the best solution (instance 2).CC-BY · From the PDF
Figure 11 The distance of the route depends on the total demand of customers. Figure 11. The distance of the route depends on the total demand of customers.
Figure 11 The distance of the route depends on the total demand of customers. Figure 11. The distance of the route depends on the total demand of customers.CC-BY · From the PDF

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 23 references

Cited by

See all 4

Metadata

Authors
Iwańkowicz, R.
Affiliations
Maritime University of Szczecin (PL)
Corresponding author
Iwańkowicz, Remigiusz
Venue
Energies
Publisher
MDPI AG
Published
2021-10-14
Volume
14
Issue
20
Pages
6651
ISSN
1996-1073 (ISSN-L)
OpenAlex
W3205185148
Cited by
4
References
23
Citations by year
2026: 1 · 2025: 1 · 2024: 1 · 2023: 1
FWCI
0.26
Type
journal article
Language
en
Open access
Locations
  • Energies (publishedVersion, cc-by)
  • RePEc: Research Papers in Economics (submittedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
Funders
Uniwersytet Szczeciński
Topics
  • Physical Sciences › Engineering › Industrial and Manufacturing Engineering › Vehicle Routing Optimization Methods
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › Electric Vehicles and Infrastructure
  • Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
Keywords
electric vehicle routing problem, permutation encoding, charging stations, energy consumption, evolutionary algorithms

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Effective Permutation Encoding for Evolutionary Optimization of the Electric Vehicle Routing Problem. https://app.cochat.ai/papers/10.3390/en14206651
The paper
Iwańkowicz, R. (2021). Effective Permutation Encoding for Evolutionary Optimization of the Electric Vehicle Routing Problem. Energies. https://doi.org/10.3390/en14206651

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.