【摘要】：繁榮穩(wěn)健的汽車消費市場,促使整車物流異軍突起。第三方整車物流模式,在行業(yè)與市場的激烈競爭下,逐漸成為整車物流企業(yè)的首選方式。如何合理配置有限的運輸能力,降低物流成本,是整車物流企業(yè)提升服務(wù)水平以及提高市場競爭力的重要途徑之一。因此,本文對基于多參數(shù)約束條件下的第三方整車物流配載問題及其求解方法展開研究,主要研究內(nèi)容如下:首先,在整車配載優(yōu)化理論知識的基礎(chǔ)上,根據(jù)具體情況,對配載問題進(jìn)行數(shù)學(xué)描述,以配載的載體為重點,優(yōu)化處理外部結(jié)構(gòu)特征,建立配載問題的數(shù)學(xué)模型。其次,研究整車配載優(yōu)化算法。結(jié)合模型的影響因素,分別提出優(yōu)化方法。借鑒聚類思想,提出訂單譜系聚類算法,完成批量訂單的求解。鑒于FVRP對配載問題的影響,提出基于客戶目的地的FVRP算法,優(yōu)化處理車輛路徑的動態(tài)影響。為提高配載求解速度,提出基于貪心策略的改進(jìn)分支定界法。綜合上述各種啟發(fā)式算法,確定一種求解多參數(shù)約束的整車配載優(yōu)化問題的方法。最后,運用MATLAB和數(shù)據(jù)庫知識實現(xiàn)算法編程,通過對比實驗,分析改進(jìn)分支定界算法的計算準(zhǔn)確性及運算速率。通過實際應(yīng)用案例,結(jié)合配載結(jié)果,體現(xiàn)配載優(yōu)化算法的實際應(yīng)用性能。
[Abstract]:Prosperous and steady car consumption market, promote the whole vehicle logistics suddenly. Third-party vehicle logistics mode, in the fierce competition between industry and market, has gradually become the first choice of vehicle logistics enterprises. How to reasonably allocate the limited transportation capacity and reduce the logistics cost is one of the important ways for the whole vehicle logistics enterprises to improve the service level and enhance the market competitiveness. Therefore, this paper studies the third party logistics loading problem and its solution based on multi-parameter constraints. The main research contents are as follows: first, based on the theoretical knowledge of vehicle loading optimization, according to the specific situation, Based on the mathematical description of the stowage problem, the external structural characteristics are optimized and the mathematical model of the stowage problem is established with the emphasis on the carrier of the stowage. Secondly, the optimization algorithm of vehicle stowage is studied. Combined with the influence factors of the model, the optimization method is put forward respectively. An order pedigree clustering algorithm is proposed to solve the batch order by using the clustering idea. In view of the influence of FVRP on stowage problem, a FVRP algorithm based on customer destination is proposed to optimize the dynamic effect of vehicle routing. An improved branch and bound method based on greedy strategy is proposed to improve the speed of stowage solution. Based on the above heuristic algorithms, a method to solve the vehicle loading optimization problem with multi-parameter constraints is proposed. Finally, the algorithm is programmed by using MATLAB and database knowledge, and the accuracy and speed of the improved branch and bound algorithm are analyzed through comparative experiments. Through practical application cases, combined with the results of stowage, the practical application performance of the stowage optimization algorithm is demonstrated.
【學(xué)位授予單位】：南昌大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2015
【分類號】：U468.8

【參考文獻(xiàn)】

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

1 叢大眾;;oracle數(shù)據(jù)庫中存儲過程開發(fā)研究[J];電子制作;2015年01期

2 許卓偉;林偉勝;;電力營銷系統(tǒng)Oracle數(shù)據(jù)庫優(yōu)化研究[J];科技創(chuàng)新與應(yīng)用;2015年06期

相關(guān)碩士學(xué)位論文 前1條

1 王德濤;基于共同配送模式的整車物流配送路徑優(yōu)化研究[D];長安大學(xué);2013年

，

本文編號：2366352