高速公路聯(lián)網(wǎng)收費its中車輛調(diào)度問題研討(文件)
【正文】 狀態(tài)的需求點都是同時是一個運力點。 Operations Research,2000,27:12491269.[2] YangByung Park. A hybrid genetic algorithm for the vehicle scheduling problem with due tmes and time deadlines[J]. International. Journal. Production Economics,2001,73:175188.[3] Sotiris P. Gayialis, Ilias P. Tatsiopoulos. Design of an ITdriven decision support system for vehicle routing and scheduling[J]. European Journal of Operational Research,2004,152:382398.[4] M. Desrochers, , . Lenstra, . Savelsbergh, L. Stougie. Towards a model and algorithm management system for vehicle routing and scheduling problems[J]. Decision Support Systems,1999,25:109133.[5] Alan Slater. Specification for a dynamic vehicle routing and scheduling system[J]. International Journal of Transport Management,2002,1:2940.[6] Guy Desaulniers, June Lavigne, Francois Soumis. Multidepot vehicle scheduling problems with time windows and waiting costs[J]. European Journal of Operational Research,1998,111:479494.[7] Vladimir Kats, Eugene Levner. Minimizing the number of vehicles in periodic scheduling: The nonEuclidean case[J]. European Journal of Operational Research,1998,107:371377.[8] 李菁, 王宗軍, 蔣元濤, 鄒彤. 免疫算法在車輛調(diào)度問題中的應(yīng)用[J]. 運籌與管理, 2003, (12):96100.[9] 郎茂祥. 配送車輛調(diào)度問題縐議[J]. 管理現(xiàn)代化, 2003, (3):6264.[10] 吳清一. 物流系統(tǒng)工程[M]. 北京:中國物資出版社, 2004. 4986.[11] 陳火根,丁紅鋼,程耀東. 物流配送中心車輛調(diào)度模型與遺傳算法設(shè)計[J]. 浙江大學(xué)學(xué)報(工學(xué)版), 2003, (9):512516.[12] 程賜勝,陳寶星,關(guān)仕罡. 商品配送中車輛調(diào)度隨機模型的建立及其求解[J].系統(tǒng)工程, 2004, (4):6670.[13] 宋玉林,齊歡. 基于自適應(yīng)遺傳算法的配送車輛調(diào)度聚類分析[J].計算機與數(shù)字工程, 2004, (2):4547.。4 結(jié)論本文通過對ITS中車輛調(diào)度問題建立數(shù)學(xué)模型，并提出一種簡便易行的搜索算法，為車輛調(diào)度問題提供了較好的解決方案，但還有許多限制條件需要解決，如沒有考慮到時間窗的限制、多車型問題、汽車滿載/空載時耗油量的不同等等，這也是我們繼續(xù)研究的方向。將原有結(jié)點和新的網(wǎng)絡(luò)結(jié)點綜合起來，統(tǒng)一規(guī)劃。如：突然出現(xiàn)一個新的供應(yīng)點或需求點，或一個有優(yōu)先供應(yīng)權(quán)的需求點，這時需要采取措施重新規(guī)劃運
試題試卷相關(guān)推薦
鄂ICP備17016276號-1