物流配送車(chē)輛優(yōu)化調(diào)度仿真研究
發(fā)布時(shí)間:2018-11-15 12:55
【摘要】:傳統(tǒng)物流配送車(chē)輛調(diào)度研究存在目標(biāo)單一,約束條件考慮有限,路徑規(guī)劃不合理等問(wèn)題,不利于實(shí)際應(yīng)用。調(diào)度優(yōu)化可有效節(jié)約資源,提升企業(yè)運(yùn)營(yíng)效益。為了降低配送車(chē)輛的距離和時(shí)間總成本,提高求解算法的效率和精度,提出一種適用型整數(shù)規(guī)劃模型和改進(jìn)型最大最小蟻群算法。首先建立了針對(duì)時(shí)變環(huán)境、帶時(shí)間窗、限制車(chē)輛容量等約束條件的車(chē)輛優(yōu)化調(diào)度模型,采用結(jié)合時(shí)變策略的改進(jìn)型最大最小蟻群算法求解調(diào)度模型,并給出了具體實(shí)現(xiàn)流程。以Solomon測(cè)試集對(duì)算法性能進(jìn)行測(cè)試,仿真結(jié)果表明,改進(jìn)型最大最小蟻群算法具有較高的求解精度和收斂速度,適用型模型及算法實(shí)用地、有效地優(yōu)化了物流配送車(chē)輛的調(diào)度問(wèn)題。
[Abstract]:The traditional research on vehicle scheduling of logistics distribution has some problems, such as single objective, limited consideration of constraint conditions, unreasonable path planning, and so on, which is not conducive to practical application. Scheduling optimization can effectively save resources and improve the efficiency of enterprise operation. In order to reduce the distance and total time cost of the distribution vehicle and improve the efficiency and accuracy of the algorithm, a suitable integer programming model and an improved maximum and minimum ant colony algorithm are proposed. Firstly, a vehicle optimal scheduling model with time-varying environment, time window and limited vehicle capacity is established. An improved maximum and minimum ant colony algorithm combined with time-varying strategy is used to solve the scheduling model, and the implementation flow is given. The Solomon test set is used to test the performance of the algorithm. The simulation results show that the improved maximum and minimum ant colony algorithm has higher accuracy and convergence speed, and the applicable model and algorithm are practical. The vehicle scheduling problem of logistics distribution is effectively optimized.
【作者單位】: 北京郵電大學(xué)自動(dòng)化學(xué)院;
【基金】:國(guó)家“十二五”科技支撐計(jì)劃(014BAD10B06)
【分類(lèi)號(hào)】:TP18;U116.2
本文編號(hào):2333364
[Abstract]:The traditional research on vehicle scheduling of logistics distribution has some problems, such as single objective, limited consideration of constraint conditions, unreasonable path planning, and so on, which is not conducive to practical application. Scheduling optimization can effectively save resources and improve the efficiency of enterprise operation. In order to reduce the distance and total time cost of the distribution vehicle and improve the efficiency and accuracy of the algorithm, a suitable integer programming model and an improved maximum and minimum ant colony algorithm are proposed. Firstly, a vehicle optimal scheduling model with time-varying environment, time window and limited vehicle capacity is established. An improved maximum and minimum ant colony algorithm combined with time-varying strategy is used to solve the scheduling model, and the implementation flow is given. The Solomon test set is used to test the performance of the algorithm. The simulation results show that the improved maximum and minimum ant colony algorithm has higher accuracy and convergence speed, and the applicable model and algorithm are practical. The vehicle scheduling problem of logistics distribution is effectively optimized.
【作者單位】: 北京郵電大學(xué)自動(dòng)化學(xué)院;
【基金】:國(guó)家“十二五”科技支撐計(jì)劃(014BAD10B06)
【分類(lèi)號(hào)】:TP18;U116.2
【相似文獻(xiàn)】
相關(guān)期刊論文 前2條
1 楊菲;;物流配送車(chē)輛優(yōu)化調(diào)度問(wèn)題的探討[J];中國(guó)市場(chǎng);2012年45期
2 胡紅春;;煙草物流配送車(chē)輛線路優(yōu)化研究與應(yīng)用[J];物流技術(shù);2012年21期
相關(guān)碩士學(xué)位論文 前2條
1 李慧叢;考慮配送員工滿意度的物流配送車(chē)輛調(diào)度研究[D];河北工程大學(xué);2016年
2 張之富;物流配送車(chē)輛優(yōu)化調(diào)度研究[D];上海海事大學(xué);2007年
,本文編號(hào):2333364
本文鏈接:http://sikaile.net/kejilunwen/daoluqiaoliang/2333364.html
最近更新
教材專著