【摘要】：隨著城市化進(jìn)程的加速,城市的規(guī)模日益變大,銀行為了方便人民的存取款業(yè)務(wù)要求,紛紛增加辦理網(wǎng)點(diǎn)。然而由于金融行業(yè)的特殊性,網(wǎng)點(diǎn)一般不設(shè)置金庫(kù),現(xiàn)金和票據(jù)需要每天按時(shí)有效的進(jìn)行專門投送和收取。網(wǎng)點(diǎn)數(shù)量多和分散性,導(dǎo)致運(yùn)鈔車運(yùn)行路徑規(guī)劃難度的加大。運(yùn)鈔車路徑優(yōu)化問題是一個(gè)NP-Hard問題,遺傳算法對(duì)其近似最優(yōu)解的求取有很好的效果。
[Abstract]:With the acceleration of the urbanization process, the scale of the city is becoming larger and larger. In order to facilitate the people's deposit and withdrawal business, banks have increased the processing network. However, due to the particularity of the financial industry, the network does not generally set up a vault, cash and bills need to be delivered and received on time and on time. The number and dispersion of dot points lead to the increase of difficulty in route planning of cash truck. The route optimization problem of cash truck is a NP-Hard problem. Genetic algorithm has a good effect on finding the approximate optimal solution.
【學(xué)位授予單位】：蘇州大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2013
【分類號(hào)】：F832.3;F252

【參考文獻(xiàn)】

相關(guān)期刊論文 前1條

1 李天龍;呂勇哉;;基于自組織優(yōu)化算法的一類多旅行商問題[J];計(jì)算機(jī)應(yīng)用;2010年02期

，

本文編號(hào)：2363986