Evidence map›Paper›PMID 42115694›Full record

ArticleScientific reports2026

The capacitated arc routing problem for on-road anti-dust operations.

Baichuan Zhu, Zhanbo Sun, Yu Tan, Changyu Zhou, Peitong Zhang, Xuting Wang

Abstract read
PubMed Full text at PMC Publisher
In one paragraph

Article in Scientific reports, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

6 authors.

Baichuan ZhuSchool of Transportation and Logistics, Southwest Jiaotong University, Chengdu, China.
Zhanbo SunSchool of Transportation and Logistics, Southwest Jiaotong University, Chengdu, China. zhanbo.sun@swjtu.edu.cn.
Yu TanSchool of Modern Posts, Chongqing University of Posts and Telecommunications, Chongqing, China.
Changyu ZhouSchool of Transportation and Logistics, Southwest Jiaotong University, Chengdu, China.
Peitong ZhangSchool of Automation, Chengdu University of Information Technology, Chengdu, China.
Xuting WangInsititute of Smart City and Intelligent Transportation, Southwest Jiaotong Universtiy, Chengdu, China.

Funding

Chengdu Science and Technology Bureau 2023YF0900021SNChongqing Municipal Education Commission Foundation KJQN202500605
6 · The paper itself

Abstract

Motivated by anti-dust operations in traffic networks, where time-of-service and service types can lead to significant differences in the effectiveness of dust suppression, this paper introduces a new variant of the capacitated arc routing problem (CARP) called CARP with heterogeneous services and time-dependent profits (CARP-HSTP). A nonlinear 0-1 programming model is formulated, and a two-stage metaheuristic with variable neighborhood search (VNS) and hybrid genetic algorithm (HGA) is developed to solve it. The dust suppression effects of various services are tested through a set of atmospheric lab experiments. Evaluated via numerical experiments and field data from the Pidu network in Chengdu, China, the proposed approach-particularly VNS-outperforms current practices by 197.8%. In addition to the practical merits in anti-dust operations, the proposed method may also shed light on other CARPs with heterogeneous service and time-dependent profits or costs.

Indexed as

Anti-dust operationsCapacitated arc routingHeterogeneous servicesHeuristicsTime-dependent profits

Identifiers

PMID42115694
PMCPMC13350850

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC-ND
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.