CoChat

A new formulation of the electric vehicle routing problem with time windows considering concave nonlinear charging function

Open access
Zuo, Xiaorong, Xiao, Yiyong, You, Meng, Kaku, Ikou, Xu, Yuchun · 2019 · Journal of Cleaner Production
Cited by 94

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

Abstract

The electric vehicle routing problem with time window (EVRPTW) is an extension of the traditional vehicle routing problem with time window (VRPTW), where new features of electric vehicles are considered, such as limited battery capacities, lack of infrastructures, and long charging time. In this study, new technical formulations were presented for vehicle route selection and charging station visit, which reduces the formulation complexity without using duplicated dummy nodes or arcs. Besides, a new linearization method was developed that employs a set of secant lines to surrogate the concave nonlinear charging function with linear constraints. This method defines the charging time as a continuous variable and uses fewer variables than existing formulation in literature. A mixed-integer linear programming (MILP) model was developed for the EVRPTW and computational experiments on Solomon's VRPTW instances were conducted to verify the proposed model. The experimental results were compared with those obtained by traditional routing models, which showed that the proposed model can result in better EVs logistics schedules with higher charging time utilizations.

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.1016/j.jclepro.2019.117687

Cites

3 of 3 references verified0 citation errors · 0 not checkable

Statistics

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

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

Cited by

Metadata

Authors
Zuo, X., Xiao, Y., You, M., Kaku, I., & Xu, Y.
Venue
Journal of Cleaner Production
Publisher
Elsevier BV
Published
2019-11
Volume
236
Pages
117687
ISSN
0959-6526 (ISSN-L)
OpenAlex
W2957073379
Cited by
94
References
3
FWCI
5.58
Type
journal article
Language
en
Open access
green

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

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.