|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2007年09 期
| 標(biāo)題 |
| 改進(jìn)有序組合樹法在鐵路普通零擔(dān)貨物拼箱配裝中的應(yīng)用(25 卷) |
| 英文標(biāo)題 |
| Application of Improved Sequential Combination Tree Algorithm on the Arrangement of Railway General Less-than-carload Goods |
| 摘要 |
| 為優(yōu)化鐵路普通零擔(dān)貨物拼箱配裝方案，以集裝箱標(biāo)記載重最大化為目標(biāo)，建立0—1整數(shù)規(guī)劃模型，利用改進(jìn)的有序組合樹算法對模型進(jìn)行求解，得出最優(yōu)拼箱配裝方案。通過拼箱配裝實例的計算，說明該算法解決零擔(dān)拼箱配裝問題具有一定的有效性和優(yōu)越性。 |
| 作者 |
| 新聞作者:付永軍,安 晨 |
| 關(guān)鍵字 |
