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

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

Multi-objective optimization for the reliable pollution-routing problem with cross-dock selection using Pareto-based algorithms

Tirkolaee, Erfan Babaee, Goli, Alireza, Faridnia, Amin, Soltani, Mehdi, Weber, Gerhard-Wilhelm · 2020 · Journal of Cleaner Production

Abstract

Abstract Cross-docking practice plays an important role in improving the efficiency of distribution networks, especially, for optimizing supply chain operations. Moreover, transportation route planning, controlling the Greenhouse Gas (GHG) emissions and customer satisfaction constitute the major parts of the supply chain that need to be taken into account integratedly within a common framework. For this purpose, this paper tries to introduce the reliable Pollution-Routing Problem with Cross-dock Selection (PRP-CDS) where the products are processed and transported through at least one cross-dock. To formulate the problem, a Bi-Objective Mixed-Integer Linear Programming (BOMILP) model is developed, where the first objective is to minimize total cost including pollution and routing costs and the second is to maximize supply reliability. Accordingly, sustainable development of the supply chain is addressed. Due to the high complexity of the problem, two well-known meta-heuristic algorithms including Multi-Objective Simulated-annealing Algorithm (MOSA) and Non-dominated Sorting Genetic Algorithm II (NSGA-II) are designed to provide efficient Pareto solutions. Furthermore, the e-constraint method is applied to the model to test its applicability in small-sized problems. The efficiency of the suggested solution techniques is evaluated using different measures and a statistical test. To validate the performance of the proposed methodology, a real case study problem is conducted using the sensitivity analysis of demand parameter. Based on the main findings of the study, it is concluded that the solution techniques can yield high-quality solutions and NSGA-II is considered as the most efficient solution tool, the optimal route planning of the case study problem in delivery and pick-up phases is attained using the best-found Pareto solution and the highest change in the objective function occurs for the total cost value by applying a 20% increase in the demand parameter.

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.2020.122927

Cites

2 of 2 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 2 references

Cited by

See all 187

Metadata

Authors
Tirkolaee, E. B., Goli, A., Faridnia, A., Soltani, M., & Weber, G.-W.
Venue
Journal of Cleaner Production
Publisher
Elsevier BV
Published
2020-12
Volume
276
Pages
122927
ISSN
0959-6526 (ISSN-L)
OpenAlex
W3044692478
Cited by
187
References
2
FWCI
19.66
Type
journal article
Language
en
Open access
closed

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: Multi-objective optimization for the reliable pollution-routing problem with cross-dock selection using Pareto-based algorithms. https://app.cochat.ai/papers/10.1016/j.jclepro.2020.122927
The paper
Tirkolaee, E. B., Goli, A., Faridnia, A., Soltani, M., & Weber, G.-W. (2020). Multi-objective optimization for the reliable pollution-routing problem with cross-dock selection using Pareto-based algorithms. Journal of Cleaner Production. https://doi.org/10.1016/j.jclepro.2020.122927

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.