变邻域模拟退火算法在农村生活垃圾收运中的应用
作者:
基金项目:

重庆市研究生科研创新项目(CYS23520); 绿色物流智能技术重庆市重点实验室项目


Application of Variable Neighborhood Simulated Annealing Algorithm in Rural Household Garbage Collection and Transportation
Author:
  • 摘要
  • | |
  • 访问统计
  • |
  • 参考文献 [26]
  • |
  • 相似文献
  • | | |
  • 文章评论
    摘要:

    针对农村地区生活垃圾的产生特点, 考虑生活垃圾分类下的可变收运周期, 构建以最小化运输成本、车辆延迟到达惩罚成本和环境惩罚成本的多目标生活垃圾收运路径优化模型. 利用随机选择法、最近邻法相结合以重构解空间, 使用带变邻域的模拟退火算法对模型进行求解. 通过算例仿真及对比分析可知, 本文模型和算法在收运总成本和总距离方面有较好的优化效果, 均优于经典模拟退火算法和变邻域搜索算法的最优解. 相较于传统的固定周期收运方案, 本文所建立模型减去了环境污染成本, 同时在总成本上改进超110.4%, 可较好地解决农村地区垃圾收运路径优化问题.

    Abstract:

    According to the characteristics of rural household garbage generation, a multi-objective garbage collection and transportation path optimization model is constructed to minimize transportation cost, vehicle delay penalty cost, and environmental penalty cost, considering the variable collection and transportation cycle of domestic waste classification. The solution space is reconstructed with the combination of random choice method and nearest neighbor method, and the simulated annealing algorithm with variable neighborhood is used to solve the model. Through case simulation and comparative analysis, it can be seen that the proposed model and algorithm have good optimization results in terms of total collection and transportation cost and total distance. Based on the analysis, the results in this study are also superior to the optimal solutions of the classical simulated annealing algorithm and variable neighborhood search algorithm. Compared with the traditional fixed cycle collection and transportation scheme, the model established in this study subtracts the environmental pollution cost and modifies the total cost by more than 110.4%, which can effectively solve the problem of garbage collection and transportation path optimization in rural areas.

    参考文献
    [1] Francis PM, Smilowitz KR, Tzur M. The period vehicle routing problem and its extensions. In: Golden B, Raghavan S, Wasil E, eds. The Vehicle Routing Problem: Latest Advances and New Challenges. Boston: Springer, 2008. 73–102.
    [2] Lespay H, Suchan K. Territory design for the multi-period vehicle routing problem with time windows. Computers & Operations Research, 2022, 145: 105866.
    [3] Albareda-Sambola M, Fernández E, Laporte G. The dynamic multiperiod vehicle routing problem with probabilistic information. Computers & Operations Research, 2014, 48: 31–39.
    [4] Luo ZX, Qin H, Che CH, et al. On service consistency in multi-period vehicle routing. European Journal of Operational Research, 2015, 243(3): 731–744.
    [5] Campbell AM, Wilson JH. Forty years of periodic vehicle routing. Networks, 2014, 63(1): 2–15.
    [6] Rahimi-Vahed A, Crainic TG, Gendreau M, et al. A path relinking algorithm for a multi-depot periodic vehicle routing problem. Journal of Heuristics, 2013, 19(3): 497–524.
    [7] Wang Y, Li Q, Guan XY, et al. Two-echelon collaborative multi-depot multi-period vehicle routing problem. Expert Systems with Applications, 2021, 167: 114201.
    [8] Zhang WT, Zeng M, Guo P, et al. Variable neighborhood search for multi-cycle medical waste recycling vehicle routing problem with time windows. International Journal of Environmental Research and Public Health, 2022, 19(19): 12887.
    [9] Rahimi M, Ghezavati V. Sustainable multi-period reverse logistics network design and planning under uncertainty utilizing conditional value at risk (CVaR) for recycling construction and demolition waste. Journal of Cleaner Production, 2018, 172: 1567–1581.
    [10] Gómez JR, Pacheco J, Gonzalo-Orden H. A tabu search method for a bi-objective urban waste collection problem. Computer-aided Civil and Infrastructure Engineering, 2015, 30(1): 36–53.
    [11] 尚春剑, 马良, 刘勇. 垃圾分类下带时间窗异构周期性混合车辆路径问题模型及算法. 系统工程, 2021, 39(6): 131–145.
    [12] Zhao J, Huang LX. Multi-period network design problem in regional hazardous waste management systems. International Journal of Environmental Research and Public Health, 2019, 16(11): 2042.
    [13] Harijani AM, Mansour S, Karimi B, et al. Multi-period sustainable and integrated recycling network for municipal solid waste—A case study in Tehran. Journal of Cleaner Production, 2017, 151: 96–108.
    [14] Pasha U, Hoff A, Hvattum LM. Simple heuristics for the multi-period fleet size and mix vehicle routing problem. INFOR: Information Systems and Operational Research, 2016, 54(2): 97–120.
    [15] Gulczynski D, Golden B, Wasil E. The period vehicle routing problem: New heuristics and real-world variants. Transportation Research Part E: Logistics and Transportation Review, 2011, 47(5): 648–668.
    [16] Dayarian I, Crainic TG, Gendreau M, et al. An adaptive large-neighborhood search heuristic for a multi-period vehicle routing problem. Transportation Research Part E: Logistics and Transportation Review, 2016, 95: 95–123.
    [17] 狄卫民, 王然. 垃圾分类收运模式下车辆路径问题建模与仿真. 计算机应用与软件, 2021, 38(8): 309–314.
    [18] 蔡婉君, 王晨宇, 于滨, 等. 改进蚁群算法优化周期性车辆路径问题. 运筹与管理, 2014, 23(5): 70–77.
    [19] Lu XL, Pu XJ, Han XH. Sustainable smart waste classification and collection system: A bi-objective modeling and optimization approach. Journal of Cleaner Production, 2020, 276: 124183.
    [20] Wu HL, Tao FM, Qiao QQ, et al. A chance-constrained vehicle routing problem for wet waste collection and transportation considering carbon emissions. International Journal of Environmental Research and Public Health, 2020, 17(2): 458.
    [21] Hannan MA, Begum RA, Al-Shetwi AQ, et al. Waste collection route optimisation model for linking cost saving and emission reduction to achieve sustainable development goals. Sustainable Cities and Society, 2020, 62: 102393.
    [22] Akhtar M, Hannan MA, Begum RA, et al. Backtracking search algorithm in CVRP models for efficient solid waste collection and route optimization. Waste Management, 2017, 61: 117–128.
    [23] Hannan MA, Akhtar M, Begum RA, et al. Capacitated vehicle-routing problem model for scheduled solid waste collection and route optimization using PSO algorithm. Waste Management, 2018, 71: 31–41.
    [24] 吴艳群, 董鹏. 供应链中车辆路径问题的改进模拟退火算法. 计算机工程与应用, 2016, 52(12): 256–260.
    [25] 王伟权, 丁鼎, 曹淑艳. 混合变邻域搜索算法求解大规模电动车辆路径优化问题. 系统仿真学报, 2022, 34(4): 910–919.
    [26] Ram DJ, Sreenivas TH, Subramaniam KG. Parallel simulated annealing algorithms. Journal of Parallel and Distributed Computing, 1996, 37(2): 207–212.
    相似文献
    引证文献
引用本文

艾玉.变邻域模拟退火算法在农村生活垃圾收运中的应用.计算机系统应用,2024,33(9):192-200

复制
分享
文章指标
  • 点击次数:424
  • 下载次数: 1188
  • HTML阅读次数: 958
  • 引用次数: 0
历史
  • 收稿日期:2024-03-19
  • 最后修改日期:2024-04-19
  • 在线发布日期: 2024-07-26
文章二维码
您是第12826496位访问者
版权所有:中国科学院软件研究所 京ICP备05046678号-3
地址:北京海淀区中关村南四街4号 中科院软件园区 7号楼305房间,邮政编码:100190
电话:010-62661041 传真: Email:csa (a) iscas.ac.cn
技术支持:北京勤云科技发展有限公司

京公网安备 11040202500063号