多介质环境条件下有毒废弃物选址-路径问题

计算机工程与应用 ›› 2016, Vol. 52 ›› Issue (2): 228-233.

多介质环境条件下有毒废弃物选址-路径问题

赵佳虹，胡鹏

西南交通大学交通运输与物流学院，成都 610031

出版日期:2016-01-15 发布日期:2016-01-28

Location-routing problem of toxic wastes under condition of multi-media environment

ZHAO Jiahong, HU Peng

School of Transportation and Logistics, Southwest Jiaotong University, Chengdu 610031, China

Online:2016-01-15 Published:2016-01-28

摘要/Abstract

摘要： 为降低物流成本，规避环境风险，研究了一类多介质环境条件下有毒废弃物选址-路径问题。考虑了环境系统的多样性，结合逸度模型设计了多介质环境风险的度量方法；以成本和环境风险最小化为目标，构建了双目标0-1混合整数线性规划模型，采用目标规划、遗传算法和蚁群算法设计了三阶段求解方法；以重庆市有毒废弃物管理实例验证了模型和算法的有效性，结果表明，模型能够更全面地度量环境风险，并有效减少物流成本。

关键词: 有毒废弃物, 选址-路径, 多介质, 逸度, 遗传算法, 蚁群算法

Abstract: Aiming to reduce the total cost and environmental risk of toxic waste logistics, a location-routing problem under the condition of multi-media environment is studied. Considering the variety of environment system, the multi-media environmental risk assessment is developed from the fugacity model. A bi-objective 0-1 mixed-integer linear programming model is formulated to minimize the total cost and environmental risk, and a three-stage algorithm through the goal programming, genetic algorithm and ant colony algorithm is also designed. A case study related to the toxic wastes management in the city of Chongqing is presented to demonstrate the effectiveness of the proposed model and approach. The computational results show that the model can successfully assess the environmental risk, and the obtained location-routing plan can provide an obvious reduction in total cost.

Key words: toxic waste, location-routing, multi-media, fugacity, genetic algorithm, ant colony algorithm

赵佳虹，胡鹏. 多介质环境条件下有毒废弃物选址-路径问题[J]. 计算机工程与应用, 2016, 52(2): 228-233.

ZHAO Jiahong, HU Peng. Location-routing problem of toxic wastes under condition of multi-media environment[J]. Computer Engineering and Applications, 2016, 52(2): 228-233.

[1]	史春天，曾艳阳，侯守明. 群体智能算法在图像分割中的应用综述[J]. 计算机工程与应用, 2021, 57(8): 36-47.
[2]	张松灿，普杰信，司彦娜，孙力帆. 基于种群相似度的自适应改进蚁群算法及应用[J]. 计算机工程与应用, 2021, 57(8): 70-77.
[3]	朱佳莹，高茂庭. 融合粒子群与改进蚁群算法的AUV路径规划算法[J]. 计算机工程与应用, 2021, 57(6): 267-273.
[4]	卜冠南，刘建华，姜磊，张冬阳. 一种自适应分组的蚁群算法[J]. 计算机工程与应用, 2021, 57(6): 67-73.
[5]	马向华，张谦. 改进蚁群算法在机器人路径规划上的研究[J]. 计算机工程与应用, 2021, 57(5): 210-215.
[6]	李昱奇，刘志乾，程凝怡，王莹莹，朱春丽. 多约束条件下无人机航迹规划[J]. 计算机工程与应用, 2021, 57(4): 225-230.
[7]	杨玮，吴莹莹，王婷. 子母式穿梭车仓储系统配置优化问题研究[J]. 计算机工程与应用, 2021, 57(4): 258-265.
[8]	李壮阔，常凯旋. 合作博弈的连续蚁群算法求解[J]. 计算机工程与应用, 2021, 57(24): 198-204.
[9]	李倩，蒋丽，梁昌勇. 基于模糊时间窗的多目标冷链配送优化[J]. 计算机工程与应用, 2021, 57(23): 255-262.
[10]	杜守信，毋涛. 双种群混合遗传算法的裁剪分床应用研究[J]. 计算机工程与应用, 2021, 57(22): 182-189.
[11]	曹立佳，刘洋. 制造车间自动导引车调度新进展[J]. 计算机工程与应用, 2021, 57(21): 59-67.
[12]	王晓光，杨培蓓. 航运物流企业数字化转型设计与效果分析[J]. 计算机工程与应用, 2021, 57(21): 241-247.
[13]	张子然，黄卫华，陈阳，章政，李梓远. 基于双向搜索的改进蚁群路径规划算法[J]. 计算机工程与应用, 2021, 57(21): 270-277.
[14]	陈倩茹，李雅丽，许科全，刘铱龙，王淑琴. 自调优自适应遗传算法的WKNN特征选择方法[J]. 计算机工程与应用, 2021, 57(20): 164-171.
[15]	石宇强，田永政，张雨琦，石小秋. 运用含复杂网络结构的多种群遗传算法求解FJSP[J]. 计算机工程与应用, 2021, 57(2): 257-266.