The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Multiobjective Vehicle Routing Problems With Simultaneous Delivery and Pickup and Time Windows: Formulation, Instances, and Algorithms
Abstract
This paper investigates a practical variant of the vehicle routing problem (VRP), called VRP with simultaneous delivery and pickup and time windows (VRPSDPTW), in the logistics industry. VRPSDPTW is an important logistics problem in closed-loop supply chain network optimization. VRPSDPTW exhibits multiobjective properties in real-world applications. In this paper, a general multiobjective VRPSDPTW (MO-VRPSDPTW) with five objectives is first defined, and then a set of MO-VRPSDPTW instances based on data from the real-world are introduced. These instances represent more realistic multiobjective nature and more challenging MO-VRPSDPTW cases. Finally, two algorithms, multiobjective local search (MOLS) and multiobjective memetic algorithm (MOMA), are designed, implemented and compared for solving MO-VRPSDPTW. The simulation results on the proposed real-world instances and traditional instances show that MOLS outperforms MOMA in most of instances. However, the superiority of MOLS over MOMA in real-world instances is not so obvious as in traditional instances.
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.
Integrity signals
Registry
Cites
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.
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
A fast and elitist multiobjective genetic algorithm: NSGA-II
Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.996017 · Cited by 50,053
Individual Comparisons by Ranking Methods
Wilcoxon, F. (1945) · Biometrics Bulletin · doi:10.2307/3001968 · Cited by 15,354
MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition
Zhang, Q., & Li, H. (2007) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2007.892759 · Cited by 10,069
Cited by
A Survey on Evolutionary Neural Architecture Search
Liu, Y., Sun, Y., Xue, B., Zhang, M., Yen, G. G., & Tan, K. C. (2023) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2021.3100554 · Cited by 644
Evolutionary Large-Scale Multi-Objective Optimization: A Survey
Tian, Y., Si, L., Zhang, X., Cheng, R., He, C., Tan, K. C., & Jin, Y. (2022) · ACM Computing Surveys · doi:10.1145/3470971 · Cited by 401
Metadata
- Authors
- Wang, J., Zhou, Y., Wang, Y., Zhang, J., Chen, C. L. P., & Zheng, Z.
- Venue
- IEEE Transactions on Cybernetics
- Published
- 2016-03
- Volume
- 46
- Issue
- 3
- Pages
- 582-594
- ISSN
- 2168-2267 (ISSN-L)
- 2168-2275
- OpenAlex
- W2026904884
- Cited by
- 215
- References
- 3
- FWCI
- 24.60
- 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: Multiobjective Vehicle Routing Problems With Simultaneous Delivery and Pickup and Time Windows: Formulation, Instances, and Algorithms. https://app.cochat.ai/papers/10.1109/tcyb.2015.2409837
- The paper
- Wang, J., Zhou, Y., Wang, Y., Zhang, J., Chen, C. L. P., & Zheng, Z. (2016). Multiobjective Vehicle Routing Problems With Simultaneous Delivery and Pickup and Time Windows: Formulation, Instances, and Algorithms. IEEE Transactions on Cybernetics. https://doi.org/10.1109/tcyb.2015.2409837
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.