Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

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

A heterogeneous electric taxi fleet routing problem with recharging stations to maximize the company’s profit

Open access
Nafarieh, Farnaz, Aghsami, Amir, Rabbani, Erfan, Rabbani, Masoud · 2023 · RAIRO - Operations Research

Abstract

During the past years, many kinds of research have been done in order to reduce the cost of transportation by using different models of the vehicle routing problem. The increase in the amount of pollution caused by vehicles and environmental concerns about the emission of greenhouse gases has led to the use of green vehicles such as electric vehicles in the urban transport fleet. The main challenge in using electric vehicles with limited battery capacity is their long recharging time. For this purpose, several recharging stations are considered in the transportation network so that if the battery needs to be recharged, the electric vehicle can recharge and complete its journey. On the other hand, due to the limited amount of the electric vehicle’s energy, the fuel consumption of this fleet is highly dependent on their load, and it is necessary to consider their load in the planning. In this article, the problem of routing electric taxis is presented considering the economic and environmental aspects of implementing electric taxis for city services. Despite other studies that have only focused on reducing energy consumption or minimizing distance traveled by electric vehicles, for the first time, the problem of urban electric taxi routing has been modeled by considering different types of electric taxis with the aim of achieving the maximum profit of this business. The use of a heterogeneous fleet in this study leads to wider coverage of different types of demand. Therefore, a mathematical programming model is presented to formulate the problem. Then, several problem examples are designed and solved for validation purposes, and the simulated annealing algorithm (SA) will be introduced and used to solve large-scale problems.

Overview

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

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Integrity signals

Registry

Crossref · 10.1051/ro/2023006

Cites

38 of 38 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.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Research works printed but not linked: 4

  1. Abbaspour, 2022, J. Comput. Des. Eng., 9, 1917
  2. Paz, 2018, Int. J. Ind. Eng. Comput., 9, 123
  3. Reyes-Rubiano, 2019, SORT, 1, 3
  4. Torabzadeh, 2022, Int. J. Manage. Sci. Eng. Manage., 17, 220

Cited by

See all 6

Metadata

Authors
Nafarieh, F., Aghsami, A., Rabbani, E., & Rabbani, M.
Affiliations
  • University of Tehran (IR)
  • Amirkabir University of Technology (IR)
Venue
RAIRO - Operations Research
Publisher
EDP Sciences
Published
2023-03
Volume
57
Issue
2
Pages
459-479
ISSN
  • 0399-0559 (ISSN-L)
  • 2804-7303
OpenAlex
W4318066542
Cited by
6
References
38
Citations by year
2025: 2 · 2024: 4
FWCI
0.80
Type
journal article
Language
en
Open access
Locations
  • RAIRO - Operations Research (publishedVersion, cc-by)
  • Springer Link (Chiba Institute of Technology) (submittedVersion, other-oa)
  • AYBU AVESIS (submittedVersion)
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 › Engineering › Automotive Engineering › Electric and Hybrid Vehicle Technologies
Keywords
electric taxis, vehicle routing, heterogeneous fleet, charging stations, battery charging, profit maximization, green vehicles, urban transport, simulated annealing, mathematical programming model

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: A heterogeneous electric taxi fleet routing problem with recharging stations to maximize the company’s profit. https://app.cochat.ai/papers/10.1051/ro/2023006
The paper
Nafarieh, F., Aghsami, A., Rabbani, E., & Rabbani, M. (2023). A heterogeneous electric taxi fleet routing problem with recharging stations to maximize the company’s profit. RAIRO - Operations Research. https://doi.org/10.1051/ro/2023006

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.