Xinyu Cheng

Mr. Xinyu Cheng


Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
8 January 2026 in Sensors
Verified
Journal Article
Open access
PDF file
DCDe-Tian Chu
De-Tian Chu
XCXinyu Cheng
Xinyu Cheng
LBLinyuan Bai
Linyuan Bai
HLHai feng Ling
Hai feng Ling
The growing demand for efficient last-mile delivery has made routing optimization a critical challenge for logistics providers. Traditional vehicle routing models typically minimize a single criterion, such as travel distance or time, without considering broader social and environmental impacts. This paper proposes a novel Multi-Criteria Adaptive Hybrid Ant Colony Optimization (MCAH-ACO) algorithm for solving the delivery vehicle routing problem formulated as a Multiple Traveling Salesman Problem (MTSP). The proposed MCAH-ACO introduces three key innovations: a multi-criteria pheromone decomposition strategy that maintains separate pheromone matrices for each optimization objective, an adaptive weight balancing mechanism that dynamically adjusts criterion weights to prevent dominance by any single objective, and a 2-opt local search enhancement integrated with elite archive diversity preservation. A comprehensive cost function is designed to integrate four categories of factors: distance, time, social-environmental impact, and safety. Extensive experiments on real-world data from the Greater Toronto Area demonstrate that MCAH-ACO significantly outperforms existing approaches including Genetic Algorithm (GA), Adaptive GA, and standard Max–Min Ant System (MMAS), achieving 12.3% lower total cost and 18.7% fewer safety-critical events compared with the best baseline while maintaining computational efficiency.

16 December 2025 in Preprints.org
Verified
Preprint
Open access
PDF file
DCDe-Tian Chu
De-Tian Chu
XCXinyu Cheng
Xinyu Cheng
LBLinyuan Bai
Linyuan Bai
HLHai feng Ling
Hai feng Ling
Last-mile delivery routing has become a pressing challenge as e-commerce volumes continue to surge. Most existing vehicle routing models focus on minimizing just one criterion---travel distance or time---while overlooking social and environmental costs. How can we balance these competing factors? This paper present MCAH-ACO, a Multi-Criteria Adaptive Hybrid Ant Colony Optimization algorithm that treats delivery routing as a Multiple Traveling Salesman Problem (MTSP). Our approach is distinguished by three mechanisms. First, multi-criteria pheromone decomposition maintain separate pheromone matrices for each objective. Second, an adaptive weight balancing scheme adjust criterion weights on the fly, preventing any single factor from dominating. Third, 2-opt local search works alongside an elite archive that preserves solution diversity. The cost function capture four aspects: distance, time, social-environmental impact, and safety. We tested MCAH-ACO on real delivery data from the Greater Toronto Area. Results show 12.3% lower total cost and 18.7% fewer safety-critical events versus the strongest baseline (Max--Min Ant System), with runtime remaining competitive.