Transportation scheduling algorithm for underground mines based on sparrow search algorithm optimized genetic algorithm
This paper addresses the problem of transporting people and goods in underground mining areas by establishing a mathematical model and proposing a coding and iterative process based on the Sparrow Search Algorithm optimized genetic algorithm. Test cases more aligned with the model were constructed using the CordeauMDVRP benchmark examples. Iterative comparisons were conducted between the basic genetic algorithm and the Sparrow Search Algorithm optimized genetic algorithm, revealing that the Sparrow Search Algorithm optimized genetic algorithm (GSSA) converges faster and avoids falling into local optima, especially with a larger number of nodes.
Authors
- Zhen Huang (ORCID: https://orcid.org/0000-0003-4819-373X)
- Z.Q. Liu
- Xiaolin Yang (ORCID: https://orcid.org/0000-0001-6552-5199)
- Z Y Chen
Institutions
- Wuhan University of Technology (CN)
Publication Details
- Published
- 2024-12-20
- DOI
- https://doi.org/10.1117/12.3054732
- Primary Topic
- Advanced Manufacturing and Logistics Optimization
- Type
- article
- Field-Weighted Citation Impact
- 0.00