本文選題：物流企業(yè)　切入點(diǎn)：質(zhì)押物　出處：《鐵道科學(xué)與工程學(xué)報(bào)》2017年08期 　論文類型：期刊論文

【摘要】：對物流金融業(yè)務(wù)中的動態(tài)存貨質(zhì)押物在配送和運(yùn)輸過程中的路徑問題進(jìn)行優(yōu)化研究,以存貨質(zhì)押物在配送過程中的總線路最小為目標(biāo),將該問題看成是VRP問題并建立數(shù)學(xué)模型,通過對模擬退火算法和遺傳算法2種算法優(yōu)點(diǎn)和缺點(diǎn)進(jìn)行對比,得出模擬退火算法能更好解決該問題,并用算例驗(yàn)證該算法,該算法能夠避免解陷入局部最優(yōu),最終經(jīng)過迭代得出最優(yōu)配送路徑。
[Abstract]:This paper optimizes the path problem of dynamic inventory pledge in the process of distribution and transportation in the logistics finance business. Taking the minimum of the total route of inventory pledge in the distribution process as the goal, the problem is regarded as a VRP problem and a mathematical model is established. By comparing the advantages and disadvantages of simulated annealing algorithm and genetic algorithm, it is concluded that the simulated annealing algorithm can solve the problem better, and an example is given to verify the algorithm, which can avoid the solution falling into local optimum. Finally, the optimal distribution path is obtained by iteration.
【作者單位】： 上海海事大學(xué)物流研究中心;上海金融學(xué)院工商管理學(xué)院;
【基金】：國家自然科學(xué)基金面上資助項(xiàng)目(71471109) 交通部應(yīng)用基礎(chǔ)研究項(xiàng)目(2015329810260)
【分類號】：F253;F830;TP18
，

本文編號：1619331