多类型现金的押运路线问题

发布时间：2018-12-24 07:27

【摘要】：以现金物流为研究背景,提出了一种基于在途风险的多类型现金的押运路线优化问题,以新币配送均衡、旧币回收和在途风险减少为优化目标,建立了相应的混合整数规划模型,并设计了一种混合禁忌搜索算法进行求解,其中禁忌搜索算法用以确定路线决策,嵌入的精确算法、贪心算法和混合贪心算法用以确定新币配送决策、旧币回收决策和风险决策。数值实验对问题特性和算法性能进行了分析,结果表明:(1)新币券别均衡优化和旧币回收导致在途风险增加;(2)混合禁忌搜索算法能求解更大规模的问题,并得到较好的解,嵌入算法很好地平衡了运行时间和求解质量。
[Abstract]:Based on the research background of cash logistics, this paper proposes a multi-type cash transportation route optimization problem based on the risk in transit. The optimization goal is to balance the distribution of the new currency, to recover the old currency and to reduce the risk on the way. The corresponding mixed integer programming model is established, and a hybrid Tabu search algorithm is designed to solve the problem, in which the Tabu search algorithm is used to determine the route decision and the embedded exact algorithm. The greedy algorithm and the mixed greedy algorithm are used to determine the distribution decision, the old money recovery decision and the risk decision. The results of numerical experiments show that: (1) New coin coupon equilibrium optimization and old coin recovery lead to increased risk on the way; (2) the hybrid Tabu search algorithm can solve the larger problem and get a better solution. The embedded algorithm balances the running time and the solution quality well.
【作者单位】：西南交通大学经济管理学院;
【基金】：国家自然科学基金资助项目(71571150,71361006) 教育部人文社会科学研究资助项目(14YJA630026) 四川省哲学社会科学重点研究基地项目(QGXH15-05) 中央高校基本科研业务费资助项目(26815WCX03) 成都市科技局资助项目(2015-RK00-00038-ZF)
【分类号】：O221.4

【相似文献】