首页 | 本学科首页   官方微博 | 高级检索  
     检索      

现金押运路线问题——基于多类型的风险
引用本文:徐国勋,李妍峰,李军.现金押运路线问题——基于多类型的风险[J].运筹与管理,2018,27(4):72-82.
作者姓名:徐国勋  李妍峰  李军
作者单位:西南交通大学 经济管理学院,四川 成都 610031
基金项目:国家自然科学基金项目(71571150,71361006);教育部人文社会科学研究项目(14YJA630026);四川省哲学社会科学重点研究基地项目(QGXH15-05);中央高校基本科研业务费项目(26815WCX03);成都市科技局项目(2015-RK00-00038-ZF)
摘    要:以人民币现金押运为研究背景,考虑了一种基于多类型风险的现金押运路线问题,以在途风险成本、库存现金风险成本以及运输成本为优化目标,建立了混合整数线性规划模型,并提出了一种基于多样化策略和改进邻域搜索的混合遗传算法,其中遗传算法对押运路线进行选择,贪心算法用来求解各类风险指标。数值实验分别对问题特性和算法性能进行了分析。实验结果表明:1)混合遗传算法能求解更大规模的问题,得到较好的解,并很好地平衡了运行时间和求解质量;2)多类型风险影响了行驶路线;3)客户的期望需求影响了库存现金风险。

关 键 词:多类型风险  车辆路径问题  混合遗传算法  贪心算法  
收稿时间:2016-06-06

The Cash-in-transit Routing Optimization Problem with Multi-type Risks
XU Guo-xun,LI Yan-feng,LI Jun,YANG fang.The Cash-in-transit Routing Optimization Problem with Multi-type Risks[J].Operations Research and Management Science,2018,27(4):72-82.
Authors:XU Guo-xun  LI Yan-feng  LI Jun  YANG fang
Institution:School of Economics and Management, Southwest Jiaotong University, Chengdu 610031, China
Abstract:Based on cash logistics industry, this paper introduces a routing optimization problem with multi-type risks. The problem is formulated as a mixed integer linear programming problem to balance transportation cost, transit risk and risk of cash in hand. A hybrid genetic algorithm adopted in this paper is a hybrid meta-heuristic combining the exploration capabilities of GA with efficient local search based improvement heuristics and diversity management mechanism. This method consists of a GA method to determine routing decision and a greedy method to determine the risk decision. The numerical studies are adopted to analyze problem characteristics and the method performance. The results show that the hybrid genetic algorithm can solve much larger problems, produce high quality solutions and strike a satisfying balance between the computing time and the solution quality.Multi-type risks link with the vehicle routing. Customer expect demand links with risk of cash in hand.
Keywords:multi-type risks  vehicle routing problem  hybrid genetic algorithm  greedy method  
本文献已被 CNKI 等数据库收录!
点击此处可从《运筹与管理》浏览原始摘要信息
点击此处可从《运筹与管理》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号