|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
標(biāo)題 |
禁忌搜索算法在編組站調(diào)機(jī)運(yùn)用計(jì)劃中的應(yīng)用(33 卷) |
英文標(biāo)題 |
Application of Tabu Search Algorithm on the Scheduling Problem of Shunting Locomotive |
摘要 |
在分析論述調(diào)機(jī)運(yùn)用計(jì)劃編制方法的基礎(chǔ)上,提出應(yīng)用禁忌搜索算法進(jìn)行編組站調(diào)機(jī)運(yùn)用計(jì)劃的編制。分別以最小化延遲解體列車(chē)和編組列車(chē)加權(quán)數(shù)量為目標(biāo)建立數(shù)學(xué)模型,以解編順序作為優(yōu)化對(duì)象,設(shè)計(jì)禁忌搜索算法對(duì)其進(jìn)行求解,并以解體順序?yàn)槔?,采用兩兩交換(2-opt)方式構(gòu)建鄰域 |
作者 |
新聞作者:王 爍,何世偉,黎浩東,申永生 |
關(guān)鍵字 |