ArticleScientific reports2024
A Greedy Tabu Dual Heuristic algorithm for the cyclic pickup and delivery problem with 3D loading constraints.
Article in Scientific reports, 2024. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
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.
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.
Who cites it
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
6 authors.
Funding
Abstract
The optimization of auto parts supply chain logistics plays a decisive role in the development of the automotive industry. To reduce logistics costs and improve transportation efficiency, this paper addresses the joint optimization problem of multi-vehicle pickup and delivery transportation paths under time window constraints, coupled with the three-dimensional loading of goods. The model considers mixed time windows, three-dimensional loading constraints, cyclic pickup and delivery paths, varying vehicle loads and volumes, flow balance, and time window constraints. Evaluation rules for the three-dimensional loading test of goods are also set, resulting in constructing a comprehensive optimization model for the inbound logistics of auto parts and components. In this study, a Greedy-Tabu Dual-Heuristic algorithm is proposed, which integrates an Improved Greedy Algorithm with an Enhanced Tabu Search Algorithm based on the ɛ-sampling strategy. The overall problem-solving process for the Improved Greedy Algorithm and the Tabu Search Algorithm is outlined. The superiority, efficiency, and stability of the improved algorithm are verified by solving cases of various sizes and analyzing the algorithm's results before and after improvement. A case study involving the third-party logistics company R Enterprise compares the pickup and delivery-separated Milk-Run mode with the simultaneous delivery and pickup Milk-Run mode. The proposed method shows a 26.67% reduction in total distance traveled and a 46.60% decrease in waiting time compared to the traditional Milk-Run approach. Additionally, when evaluated against the standard 3D loading inspection method, the proposed approach improves average vehicle load utilization by 17% and vehicle volume utilization by 15%. These findings verify the applicability and superiority of the proposed algorithms and models in practical scenarios.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
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.