沈阳航空航天大学学报2024，Vol.41Issue(2)：86-96,11.DOI:10.3969/j.issn.2095-1248.2024.02.010
改进的ALNS算法求解MDVRPTW问题
Improved ALNS algorithm for solving multi-depots vehicle routing problem with time windows
摘要
Abstract
The multi-depots vehicle routing problem with time windows(MDVRPTW)was studied.The MDVRPTW model was designed,and an adaptive large neighborhood search algorithm combined with the Gaussian mixture model(GMM)clustering algorithm was proposed.By classifying the cus-tomer set before the neighborhood transformation,the initial solution was optimized,and the algo-rithm efficiency was improved.Six different transformation factors were used.A scoring system was used to enable the algorithm to select appropriate transformation factor adaptively at different stages of the iteration.The rationality of parameter was analyzed and three simulation experiments were de-signed.The experimental results verifies the efficiency of the algorithm.关键词
多车场车辆路径问题/时间窗/改进的ALNS算法/GMM聚类算法/邻域变换Key words
MDVRP/time windows/improved ALNS algorithm/GMM clustering algorithm/neigh-borhood transformation分类
信息技术与安全科学引用本文复制引用
李琳,赵雄,郑学东..改进的ALNS算法求解MDVRPTW问题[J].沈阳航空航天大学学报,2024,41(2):86-96,11.基金项目
国家自然科学基金(项目编号:61972266,61403260) （项目编号:61972266,61403260）
辽宁省自然科学基金(项目编号:2020-MS-233) （项目编号:2020-MS-233）
辽宁省兴辽英才计划(项目编号:XLYC2002017) （项目编号:XLYC2002017）
