The DOI matches its Crossref record.
The continuous pollution routing problem
Open accessOverview
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.
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?
The check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“When a capsule network (CapsNet) is combined with an improved routing approach (Xiao et al., 2020; Xiao et al., 2021) for classification, it offers greater feature abstraction and representation capabilities without requiring a lot of data or parameters.”
From Deepfake detection using deep learning methods: A systematic and comprehensive review (2024) · cites this paper as Xiao et al., 2020
Experimental — accuracy not yet measured
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
No references could be resolved yet.
Research works printed but not linked: 37
- Barth, 2008, Real-world CO2 impacts of traffic congestion, Transp. Res. Rec. J. Transp. Res. Board, 2058, 163, 10.3141/2058-20 · DOI
- Bektas, 2011, The pollution-routing problem, Transp. Res. Part B, 45, 1232, 10.1016/j.trb.2011.02.004 · DOI · Paper page
- Castillo, 2005, An ε-accurate model for optimal unequal area facility layout, Comput. Oper. Res., 32, 429, 10.1016/S0305-0548(03)00246-6 · DOI
- Dabia, 2017, An exact approach for a variant of the pollution-routing problem, Transp. Sci., 51, 607, 10.1287/trsc.2015.0651 · DOI
- Demir, 2012, An adaptive large neighborhood search heuristic for the pollution-routing problem, Eur. J. Oper. Res., 223, 346, 10.1016/j.ejor.2012.06.044 · DOI
- Demir, 2011, A comparative analysis of several vehicle emission models for road freight transportation, Transp. Res. Part D, 6, 347, 10.1016/j.trd.2011.01.011 · DOI
- Demir, 2014, A review of recent research on green road freight transportation, Eur. J. Oper. Res., 237, 775, 10.1016/j.ejor.2013.12.033 · DOI
- Demir, 2014, The bi-objective pollution-routing problem, Eur. J. Oper. Res., 232, 464, 10.1016/j.ejor.2013.08.002 · DOI
- Erdogan, 2012, A green vehicle routing problem, Transp. Res. Part E Logist. Transp. Rev., 48, 100, 10.1016/j.tre.2011.08.001 · DOI
- Eshtehadi, 2017, Robust solutions to the pollution-routing problem with demand and travel time uncertainty, Transp. Res. Part D, 51, 351, 10.1016/j.trd.2017.01.003 · DOI
- Figliozzi, 2010, Vehicle routing problem for emissions minimization, Transp. Res. Rec. J. Transp. Res. Board, 2197, 1, 10.3141/2197-01 · DOI
- Franceschetti, 2017, A metaheuristic for the time-dependent pollution-routing problem, Eur. J. Oper. Res., 259, 972, 10.1016/j.ejor.2016.11.026 · DOI
- Franceschetti, 2013, The time-dependent pollution-routing problem, Transp. Res. Part B, 56, 265, 10.1016/j.trb.2013.08.008 · DOI
- Fukasawa, 2016, A disjunctive convex programming approach to the pollution-routing problem, Transp. Res. Part B, 94, 61, 10.1016/j.trb.2016.09.006 · DOI
- Gaur, 2013, Routing vehicles to minimize fuel consumption, Oper. Res. Lett., 41, 576, 10.1016/j.orl.2013.07.007 · DOI
- Jabali, 2012, Analysis of travel times and CO2 emissions in time-dependent vehicle routing, Prod. Oper. Manag., 21, 1060, 10.1111/j.1937-5956.2012.01338.x · DOI
- Konak, 2006, A new mixed integer programming formulation for facility layout design using flexible bays, Oper. Res. Lett., 34, 660, 10.1016/j.orl.2005.09.009 · DOI
- Koc, 2014, The fleet size and mix pollution-routing problem, Transp. Res. Part B, 70, 239, 10.1016/j.trb.2014.09.008 · DOI
- Koç, 2016, The green vehicle routing problem: a heuristic based exact solution approach, Appl. Soft Comput., 39, 154, 10.1016/j.asoc.2015.10.064 · DOI
- Kramer, 2015, A speed and departure time optimization algorithm for the pollution-routing problem, Eur. J. Oper. Res., 247, 782, 10.1016/j.ejor.2015.06.037 · DOI
- Kramer, 2015, A matheuristic approach for the pollution-routing problem, Eur. J. Oper. Res., 243, 523, 10.1016/j.ejor.2014.12.009 · DOI
- Kuo, 2010, Using simulated annealing to minimize fuel consumption for the time-dependent vehicle routing problem, Comput. Ind. Eng., 59, 157, 10.1016/j.cie.2010.03.012 · DOI
- Leggieri, 2017, A practical solution approach for the green vehicle routing problem, Transp. Res. Part E, 104, 97, 10.1016/j.tre.2017.06.003 · DOI
- Lin, 2014, Survey of green vehicle routing problem: past and future trends, Expert Syst. Appl., 41, 1118, 10.1016/j.eswa.2013.07.107 · DOI
- Saka, 2017, Using cost change estimates in a local search heuristics for the pollution routing problem, OR Spectr., 39, 557, 10.1007/s00291-016-0464-9 · DOI
- Schneider, 2014, The electric vehicle-routing problem with time windows and recharging stations, Transp. Sci., 48, 500, 10.1287/trsc.2013.0490 · DOI
- Sherali, 2003, Enhanced model formulations for optimal facility layout, Oper. Res., 51, 629, 10.1287/opre.51.4.629.16096 · DOI
- Suzuki, 2016, A dual-objective metaheuristic approach to solve practical pollution routing problem, Int. J. Prod. Econ., 176, 143, 10.1016/j.ijpe.2016.03.008 · DOI
- Tajik, 2014, A robust optimization approach for pollution routing problem with pickup and delivery under uncertainty, J. Manuf. Syst., 33, 277, 10.1016/j.jmsy.2013.12.009 · DOI
- Wang, 2012, Sailing speed optimization for container ships in a liner shipping network, Transp. Res. Part E, 48, 701, 10.1016/j.tre.2011.12.003 · DOI
- Xiao, 2015, A simulating annealing algorithm to solve the green vehicle routing & scheduling problem with hierarchical objectives and weighted tardiness, Appl. Soft Comput., 34, 372, 10.1016/j.asoc.2015.04.054 · DOI
- Xiao, 2016, The heterogeneous green vehicle routing and scheduling problem with time-varying traffic congestion, Transp. Res. Part E Logist. Transp. Rev., 88, 146, 10.1016/j.tre.2016.01.011 · DOI
- Xiao, 2017, A genetic algorithm with exact dynamic programming for the green vehicle routing & scheduling problem, J. Clean Prod., 167, 1450, 10.1016/j.jclepro.2016.11.115 · DOI
- Xiao, 2017, A problem evolution algorithm with linear programming for the dynamic facility layout problem—A general layout formulation, Comput. Oper. Res., 88, 187, 10.1016/j.cor.2017.06.025 · DOI
- Xiao, 2012, Development of a fuel consumption optimization model for the capacitated vehicle routing problem, Comput. Oper. Res., 39, 1419, 10.1016/j.cor.2011.08.013 · DOI · Paper page
- Xie, 2018, A β-accurate linearization method of Euclidean distance for the facility layout problem with heterogeneous distance metrics, Eur. J. Oper. Res., 265, 26, 10.1016/j.ejor.2017.07.052 · DOI
- Zhang, 2015, Vehicle routing problem with fuel consumption and carbon emission, Int. J. Prod. Econ., 170, 234, 10.1016/j.ijpe.2015.09.031 · DOI
Cited by
Sorted by citations
Deepfake detection using deep learning methods: A systematic and comprehensive review
Heidari, A., Jafari Navimipour, N., Dag, H., & Unal, M. (2024) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1520 · Cited by 349
“When a capsule network (CapsNet) is combined with an improved routing approach (Xiao et al., 2020; Xiao et al., 2021) for classification, it offers greater feature abstraction and representation capabilities without requiring a lot of data or parameters.”
Metadata
- Authors
- Xiao, Y., Zuo, X., Huang, J., Konak, A., & Xu, Y.
- Affiliations
- Beihang University (CN)
- Pennsylvania State University (US)
- Aston University (GB)
- Corresponding author
- Huang, Jiaoying
- Venue
- Applied Mathematics and Computation
- Publisher
- Elsevier BV
- Published
- 2020-12
- Volume
- 387
- Pages
- 125072
- ISSN
- 0096-3003 (ISSN-L)
- OpenAlex
- W3005489823
- Cited by
- 90
- References
- 0
- Citations by year
- 2026: 3 · 2025: 8 · 2024: 13 · 2023: 37 · 2022: 24 · 2021: 2 · 2020: 3
- FWCI
- 10.52
- Type
- journal article
- Language
- en
- Open access
- Locations
- Applied Mathematics and Computation (publishedVersion)
- Aston Publications Explorer (Aston University) (submittedVersion)
- RePEc: Research Papers in Economics (submittedVersion)
- Funders
- National Natural Science Foundation of China
- Topics
- Physical Sciences › Engineering › Industrial and Manufacturing Engineering › Vehicle Routing Optimization Methods
- Social Sciences › Transportation › Urban and Freight Transport Logistics
- Social Sciences › Transportation › Transportation Planning and Optimization
- Keywords
- pollution routing problem, polyhedral approximation, fuel consumption rate, linearization, linear programming model, vehicle routing
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: The continuous pollution routing problem. https://app.cochat.ai/papers/10.1016/j.amc.2020.125072
- The paper
- Xiao, Y., Zuo, X., Huang, J., Konak, A., & Xu, Y. (2020). The continuous pollution routing problem. Applied Mathematics and Computation. https://doi.org/10.1016/j.amc.2020.125072