检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:郭谦 刘勇[1] 马良[1] Guo Qian;Liu Yong;Ma Liang(Management School,University of Shanghai for Science&Technology,Shanghai 200093,China)
出 处:《计算机应用研究》2025年第1期177-184,共8页Application Research of Computers
基 金:教育部人文社会科学研究青年基金资助项目(21YJC630087);上海市哲学社会科学规划课题(2019BGL014)。
摘 要:针对城市居民区回收箱布局规划和路径优化问题,首先构建居民区回收箱数量与人口、回收频率、回收阈值的线性函数,并构建双层优化模型,回收总利润最大化作为上层目标,运输成本最小化作为下层目标。其次,为求解具有NP-hard特征的新模型,设计加入团体学习算子和自适应选择策略的人类学习优化算法,并与禁忌搜索算法嵌套构建混合人类学习算法(hybrid human learning optimization algorithm,HHLO)。再次,采用不同规模算例,并将新算法与基本人类学习算法、遗传算法、自适应粒子群算法、红嘴蓝鹊算法进行对比分析,验证了模型的可行性和算法的有效性。最后,通过上海杨浦区某实例进行灵敏度分析,探讨回收箱容量、分时定价策略和分区定价策略对回收中心总利润与居民满意度的影响。In addressing the layout planning and path optimization problem of recycling bins in urban residential areas,this paper constructed a linear function to relate the number of recycling bins in residential areas to population,recycling frequency,and recycling threshold.It developed a bi-level optimization model,with the upperlevel objective of maximizing total recycling profit and the lower-level objective of minimizing transportation costs.To address the NP-hard nature of the model,it designed a human learning optimization algorithm incorporating group learning operators and adaptive selection strategies.This algorithm was combined with a tabu search algorithm to form the hybrid human learning optimization algorithm(HHLO).The new algorithm was compared with basic human learning algorithms,genetic algorithms,adaptive particle swarm algorithms and red-billed blue magpie optimization algorithms across various scale instances.The results validate the model’s feasibility and the algorithm’s effectiveness.A sensitivity analysis,using a case study in Shanghai’s Yangpu District,examined how recycling bin capacity,time-based pricing strategies,and zone-based pricing strategies impacted the total profit of the recycling center and resident satisfaction.
关 键 词:回收箱布局 车辆调度 混合人类学习优化算法 双层规划
分 类 号:TP391[自动化与计算机技术—计算机应用技术] O221[自动化与计算机技术—计算机科学与技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222