基于贪心遗传的地下物流节点选择规划研究

doi:10.3969/j.issn.1007-7375.2020.05.012

工业工程 ›› 2020, Vol. 23 ›› Issue (5): 88-95.doi: 10.3969/j.issn.1007-7375.2020.05.012

基于贪心遗传的地下物流节点选择规划研究

王苏林¹, 邱菲尔², 陈凡³, 刘川昆³, 鹿腾⁴, 王芷芸⁴

1. 西南交通大学希望学院轨道交通学院，四川南充 610400;
2. 西南交通大学交通运输与物流学院, 四川成都 611756;
3. 西南交通大学土木工程学院, 四川成都 610031;
4. 西南交通大学信息科学与技术学院，四川成都 611756

收稿日期:2019-05-28 发布日期:2020-10-30
通讯作者: 刘川昆(1996-),男,重庆市人,硕士研究生,主要研究方向为地下空间开发及管理研究.E-mail:liuchuankun96@163.com E-mail:liuchuankun96@163.com
作者简介:王苏林(1984-)，女，四川省人，讲师，硕士，主要研究方向为交通运输规划与管理
基金资助:
国家级大学生创新创业训练计划资助项目(2018106113041)；研究生学术素养提升计划资助项目(2019KCJS45)

A Research on Underground Logistics Node Selection Planning Based on Greedy Genetic Algorithm

WANG Sulin¹, QIU Feier², CHEN Fan³, LIU Chuankun³, LU Teng⁴, WANG Zhiyun⁴

1. School of Rail Transportation, Southwest Jiaotong University Hope College, Nanchong 610400, China;
2. College of Transportation and Logistics, Southwest Jiaotong University, Chengdu 611756, China;
3. Civil Engineering, Southwest Jiaotong University, Chengdu 610031, China;
4. College of Information Science and Technology, Southwest Jiaotong University, Chengdu 611756, China

Received:2019-05-28 Published:2020-10-30

摘要/Abstract

摘要： 以国内某地区物流概况为研究背景，结合国内外地下物流系统研究成果，将集合覆盖的思想引入地下物流网络节点选址规划，建立以物流节点数量最少及物流节点转运率最低为优化目标的双层多目标规划模型，并结合贪心算法和遗传算法进行优化求解。研究表明：通过将集合覆盖的思想对城市地下物流系统节点规划进行初步探讨是可行有效的；基于贪心遗传算法进行优化求解，使得该地区地下物流网络节点选择达到全局最优，有效控制了物流节点的数量及节点转运率的大小；地下物流网络节点表现出明显的区域集中性，即服务节点均集中在物流需求点附近，且二级节点服务区域总是邻近某个一级节点。

关键词: 地下物流, 集合覆盖, 双层多目标规划, 贪心遗传算法, 区域集中

Abstract: Taking a local logistics survey as an engineering background, combining with the research results of underground logistics system at home and abroad, the idea of set covering is introduced into the location planning of underground logistics network, a bilevel multiobjective programming model with minimum number of logistics nodes and minimum transfer rate of logistics nodes is established, and combining greedy algorithm and genetic algorithm to solve the optimization problem. The research shows that: It is feasible and effective to introduce the idea of set covering into the planning of underground logistics nodes. Greedy genetic algorithm is used to optimize the solution, which makes the choice of the nodes of the underground logistics network reach the global optimum. The number of nodes and the transfer rate of nodes are effectively controlled. The nodes of the underground logistics network show obvious regional concentration, that is, the service nodes are all concentrated near the logistics demand point, and the two level node service area is always adjacent to a level one node.

Key words: underground logistics, set covering, bilevel multiobjective programming, greedy genetic algorithm, regional concentration

中图分类号:

王苏林, 邱菲尔, 陈凡, 刘川昆, 鹿腾, 王芷芸. 基于贪心遗传的地下物流节点选择规划研究[J]. 工业工程, 2020, 23(5): 88-95.

WANG Sulin, QIU Feier, CHEN Fan, LIU Chuankun, LU Teng, WANG Zhiyun. A Research on Underground Logistics Node Selection Planning Based on Greedy Genetic Algorithm[J]. Industrial Engineering Journal, 2020, 23(5): 88-95.

参考文献

[1] 李鹏, 朱合华, 王璇, 等. 地下物流系统对城市可持续发展的作用探讨[J]. 地下空间与工程学报., 2007, 3(1): 1-4
LI Peng, ZHU Hehua, WANG Xuan, et al. Underground logistics system-towards the sustainable development of the city[J]. Journal of Underground Space and Engineering, 2007, 3(1): 1-4
[2] CHEN Zhilong, DONG Jianjun, REN Rui. Urban underground logistics system in China: opportunities or challenges[J]. Underground Space, 2017, 2(3): 195-208
[3] ZEVGOLIS I E, MAVRIKOS A A, KALIAMPAKOSB D C. Construction, storage capacity and economics of an underground warehousing–logistics center in Athens, Greece[J]. Tunnelling and Underground Space Technology, 2004, 19(2): 165-173
[4] 钱七虎, 郭东军. 城市地下物流系统导论[M]. 北京: 人民交通出版社, 2007.
[5] 马祖军. 城市地下物流系统及其设计[J]. 物流技术, 2004(10): 12-15
MA Zujun. Urban under ground logistics system and its design[J]. Logistics Technology, 2004(10): 12-15
[6] 闫文涛, 覃燕红. 地下物流节点选址的双层规划模型及算法研究[J]. 地下空间与工程学报, 2016, 12(4): 870-874
YAN Wentao, QIN Yanhong. Research on bi-level programming model and algrithm of underground logistics node location[J]. Journal of Underground Space and Engineering, 2016, 12(4): 870-874
[7] 易美, 周爱莲. 一类城市地下物流网络规划模型研究[J]. 交通科学与工程, 2016, 32(3): 93-98
YI Mei, ZHOU Ailian. Research on a logistics network planning model of the urban underground[J]. Journal of Transport Science and Engineering, 2016, 32(3): 93-98
[8] 曾令慧, 周爱莲. 基于遗传算法的城市地下物流网络优化模型[J]. 交通科学与工程, 2016, 32(2): 89-93
ZENG Linghui, ZHOU Ailian. Optimizing path of urban underground logistics network based on genetic algorithm[J]. Journal of Transport Science and Engineering, 2016, 32(2): 89-93
[9] 张培林, 魏巧云. 物流配送中心选址模型及其启发式算法[J]. 交通运输工程学报, 2003, 3(2): 65-68
ZHANG Peilin, WEI Qiaoyun. Logistics distribution center allocation model and elicitation algorithm[J]. Journal of Traffic and TRansportation Engineering, 2003, 3(2): 65-68
[10] 戢晓峰, 普永明, 梁斐雯, 等. 交通管制时限条件下城市物流配送优化双层规划模型[J]. 公路交通科技, 2014, 31(12): 145-152
JI Xiaofeng, PU Yongming, LIANG Feiwen, et al. Bi-level programming model for city logistics distribution optimization under time restrict condition caused by traffic control[J]. Journal of Highway and Transportation Research and Development, 2014, 31(12): 145-152
[11] 谢雪姣, 青科言, 朱志浩. 基于混合整数线性规划的地下物流网络构建[J]. 综合运输, 2018, 40(8): 53-56, 126
XIE Xuejiao, QING Keyan, ZHU Zhihao. Research on underground logistics node selection planning based on mixed integer linear programming[J]. China Transportation Review, 2018, 40(8): 53-56, 126
[12] 李明, 刘航, 张晓建. 多物流配送中心的选址布局问题优化模型研究[J]. 重庆交通大学学报(自然科学版), 2017, 36(1): 97-102
LI Ming, LIU Hang, ZHANG Xiaojian. Research on the optimization model of site selection and layout of logistics distribution center[J]. Journal of Chongqing Jiaotong University(Natural Science), 2017, 36(1): 97-102
[13] 刘川昆, 陈铭颢, 王芷芸, 等. 基于模拟退火的地下物流通道网络设计[J]. 公路交通科技, 2019, 36(6): 151-158
LIU Chuankun, CHEN Minghao, WANG Zhiyun, et al. Network Design of Underground Logistics Channel Based on Simulated Annealing[J]. Journal of Highway and Transportation Research and Development, 2019, 36(6): 151-158
[14] 范月娇, 潘文军. 面向电子商务企业的物流配送服务半径界定[J]. 长安大学学报(社会科学版), 2009, 11(3): 21-25
FAN Yuejiao, PAN Wenjun. Definition of logistics distribution service radius for e-commerce enterprises[J]. Journal of Chang’an University(Social Science Edition), 2009, 11(3): 21-25
[15] 陈端兵, 黄文奇. 一种求解集合覆盖问题的启发式算法[J]. 计算机科学, 2007, 34(4): 133-136
CHEN Duanbing, HUANG Wenqi. A heuristic algorithm for set covering problem[J]. Computer Science, 2007, 34(4): 133-136
[16] 钟晴, 戴特奇. 中国机场总规模分层优化测算研究——基于人口覆盖角度[J]. 地理科学进展, 2014, 33(12): 1642-1649
ZHONG Qing, DAI Teqi. Stratified estimation of the total number and location of Chinese civil airports based on population cover age using revised LSCP and MCLP models[J]. Progress in Geography, 2014, 33(12): 1642-1649
[17] 李卫江, 郭晓汾, 张毅, 等. 基于Matlab优化算法的物流中心选址[J]. 长安大学学报(自然科学版), 2006, 26(3): 76-79
LI Weijiang, GUO Xiaofen, ZHANG Yi, et al. Logistics center location based on matlab optimization algorithm[J]. Journal of Chang'an University(Natural Science Edition), 2006, 26(3): 76-79
[18] 李辰. 一种改进的贪心遗传混合算法在车间调度中的应用与研究[D]. 大连: 大连交通大学, 2013.
LI Chen. Research of an improved greedy genetic hybrid algorithm in job-shop scheduling[D]. Dalian: Dalian Jiaotong University, 2013.

基于贪心遗传的地下物流节点选择规划研究

A Research on Underground Logistics Node Selection Planning Based on Greedy Genetic Algorithm

RichHTML

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 4

编辑推荐

Metrics

本文评价

[1]	沈晓冰, 杨保华. 基于双层混合联运的震后应急物资配送模糊多目标优化[J]. 工业工程, 2017, 20(3): 113-117.
[2]	丁雪峰, 陈前程, 高攀. 考虑供方组内强外部性的双边服务平台定价策略[J]. 工业工程, 2019, 22(6): 27-33.
[3]	芦娟, 夏扬坤, 邹安全, 符卓, 王松, 魏占国, 符瑛. 带装载能力的需求依背包拆分车辆路径问题[J]. 工业工程, 2019, 22(6): 67-73.
[4]	李玉民, 邱梦, 黑柏林, 方曾利. 考虑高铁时间窗和客户满意度的生鲜品公铁联运路径选择[J]. 工业工程, 2021, 24(2): 49-56.