Evidence map›Paper›PMID 37884636›Full record

ArticleScientific reports2023

A modified particle swarm optimization algorithm for a vehicle scheduling problem with soft time windows.

Jinwei Qiao, Shuzan Li, Ming Liu, Zhi Yang, Jun Chen, Pengbo Liu, Huiling Li, Chi Ma

Abstract read
In one paragraph

Article in Scientific reports, 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 2 papers.

0numbers the graph read from it
0cells of the map it votes in
2citing 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

2 citing papers in PubMed.

  1. Article
  2. Article
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

8 authors.

Jinwei Qiao *School of Mechanical and Automotive Engineering, Qilu University of Technology (Shandong Academy of Sciences), Jinan, 250353, People's Republic of China.
Shuzan Li *School of Mechanical and Automotive Engineering, Qilu University of Technology (Shandong Academy of Sciences), Jinan, 250353, People's Republic of China.
Ming Liu *School of Mechanical and Automotive Engineering, Qilu University of Technology (Shandong Academy of Sciences), Jinan, 250353, People's Republic of China.
Zhi YangSchool of Mechanical and Automotive Engineering, Qilu University of Technology (Shandong Academy of Sciences), Jinan, 250353, People's Republic of China. yangzhi@qlu.edu.cn.
Jun Chen *School of Mechanical and Automotive Engineering, Qilu University of Technology (Shandong Academy of Sciences), Jinan, 250353, People's Republic of China.
Pengbo Liu *School of Mechanical and Automotive Engineering, Qilu University of Technology (Shandong Academy of Sciences), Jinan, 250353, People's Republic of China.
Huiling Li *Shandong Innovation and Development Research Institute, Jinan, 250353, People's Republic of China.
Chi Ma *Zaozhuang Xinjinshan Intelligent Equipment Co., Ltd, Zaozhuang, 277400, People's Republic of China.

Funding

Key Projects of Natural Science Foundation of Shandong Province ZR2020ME116Key R\&D plan of Shandong Province, China 2021CXGC010207The Innovation Ability Improvement Project for Technology-based Small- and Medium-sized Enterprises of Shandong Province 2022TSGC2051The Innovation Ability Improvement Project for Technology-based Small- and Medium-sized Enterprises of Shandong Province 2023TSGC0024The Innovation Ability Improvement Project for Technology-based Small- and Medium-sized Enterprises of Shandong Province 2023TSGC0931
6 · The paper itself

Abstract

This article constructed a vehicle scheduling problem (VSP) with soft time windows for a certain ore company. VSP is a typical NP-hard problem whose optimal solution can not be obtained in polynomial time, and the basic particle swarm optimization(PSO) algorithm has the obvious shortcoming of premature convergence and stagnation by falling into local optima. Thus, a modified particle swarm optimization (MPSO) was proposed in this paper for the numerical calculation to overcome the characteristics of the optimization problem such as: multiple constraints and NP-hard. The algorithm introduced the "elite reverse" strategy into population initialization, proposed an improved adaptive strategy by combining the subtraction function and "ladder strategy" to adjust inertia weight, and added a "jump out" mechanism to escape local optimal. Thus, the proposed algorithm can realize an accurate and rapid solution of the algorithm's global optimization. Finally, this article made typical benchmark functions experiment and vehicle scheduling simulation to verify the algorithm performance. The experimental results of typical benchmark functions proved that the search accuracy and performance of the MPSO algorithm are superior to other algorithms: the basic PSO, the improved particle swarm optimization (IPSO), and the chaotic PSO (CPSO). Besides, the MPSO algorithm can improve an ore company's profit by 48.5-71.8% compared with the basic PSO in the vehicle scheduling simulation.

Identifiers

PMID37884636
PMCPMC10603129

What OpenQuestion holds

Textmetadata
LicenceCC BY
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.