【摘要】：以現(xiàn)金物流為研究背景,提出了一種基于在途風險的多類型現(xiàn)金的押運路線優(yōu)化問題,以新幣配送均衡、舊幣回收和在途風險減少為優(yōu)化目標,建立了相應的混合整數(shù)規(guī)劃模型,并設計了一種混合禁忌搜索算法進行求解,其中禁忌搜索算法用以確定路線決策,嵌入的精確算法、貪心算法和混合貪心算法用以確定新幣配送決策、舊幣回收決策和風險決策。數(shù)值實驗對問題特性和算法性能進行了分析,結果表明:(1)新幣券別均衡優(yōu)化和舊幣回收導致在途風險增加;(2)混合禁忌搜索算法能求解更大規(guī)模的問題,并得到較好的解,嵌入算法很好地平衡了運行時間和求解質量。
[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.
【作者單位】： 西南交通大學經(jīng)濟管理學院;
【基金】：國家自然科學基金資助項目(71571150,71361006) 教育部人文社會科學研究資助項目(14YJA630026) 四川省哲學社會科學重點研究基地項目(QGXH15-05) 中央高�；究蒲袠I(yè)務費資助項目(26815WCX03) 成都市科技局資助項目(2015-RK00-00038-ZF)
【分類號】：O221.4

【相似文獻】

相關期刊論文 前10條

1 郭崇慧;覃華勤;;一種改進的禁忌搜索算法及其在選址問題中的應用[J];運籌與管理;2008年01期

2 郭宇;茹海鵬;;用禁忌搜索算法求解單機總加權拖期最小問題[J];科技信息(科學教研);2008年18期

3 蔣泰;楊海s，

本文編號：2390342