畢業(yè)設(shè)計論文基于線性規(guī)劃的最優(yōu)路徑設(shè)計

1、基于線性規(guī)劃的最優(yōu)路徑設(shè)計[摘要]各個領(lǐng)域中的大量問題都可以歸結(jié)為線性規(guī)劃問題尤其在物流管理活動中有大量的規(guī)劃問題如網(wǎng)絡(luò)配送中的運(yùn)輸規(guī)劃問題它屬于線性規(guī)劃問題的特例運(yùn)輸問題存在多種解法目前計算機(jī)應(yīng)用普及用一般的解線性規(guī)劃的軟件來解運(yùn)輸問題是一條較好的途徑根據(jù)調(diào)查表明近幾十年來線性規(guī)劃在各個行業(yè)中都得到了廣泛的應(yīng)用而且運(yùn)輸問題的模型不單只是適用于一般意義上的物資運(yùn)輸問題更重要的是它適用于一切道路網(wǎng)絡(luò)問題因此。[關(guān)鍵詞]線性規(guī)劃Floyd算

2、法優(yōu)路徑Linearprogrammingbasedoptimalpathdesign[Abstract]LARGEnumberofproblemsinvariousfieldscanbereducedtolinearprogrammingproblemsespeciallyinlogisticsmanagementactivitiesalargenumberofplanningissuessuchaswkdistributionpro

3、blemsintransptplanningitisaspecialcaseoflinearprogrammingproblemswithmultiplesolutionofthetransptthecurrentpopularityofcomputerapplicationsusingthegenerallinearprogrammingsoftwaretosolvethetransptproblemisagoodwaytoAccdi

4、ngtothesurveyindicatedthatinrecentdecadeslinearprogramminginallsectshavebeenwidelyusedtransptthemodelisnotonlyapplicabletothegeneralsenseofmaterialtransptmeimptantlyitappliestoallroadwkproblemtherefeimprovetheeconomiceff

5、ectofthegeneralintwoways:firstthetechnologicalimprovements.Secondimprovementofproductionganizationplanningnamelyreasonablearrangethehumanmaterialresources.Themethodovercomesthemaximumdistanceequaltotheaveragedistancemeth

6、odthelackofequallawsprinciplesaremesimpleclearhighprecisionthiseasytoplaytheadvantagesofcomputertechnologytoimprovetheaccuracyofeconomicdistance.Inthispapersteeltransptationdersfexampleusingmatlablingosoftwaretodesignthe

7、optimalpathofthetransptpipecalculatetheminimumpipedertransptcosts.2.1運(yùn)輸問題的特征..............................................................................錯誤!未定義書簽。2.2線性規(guī)劃在運(yùn)輸問題中的一般數(shù)學(xué)形式.....................................

8、..錯誤!未定義書簽。第三章Floyd算法...................................................................................................錯誤!未定義書簽。3.1最短路徑定義..............................................................................錯誤!未

9、定義書簽。3.1.1單源最短路徑..........................................................................錯誤!未定義書簽。3.1.2任意頂點(diǎn)間的最短路徑............................................................錯誤!未定義書簽。3.2Floyd算法...........................

10、..........................................................錯誤!未定義書簽。3.2.1Floyd算法基本思想.................................................................錯誤!未定義書簽。3.2.2Floyd算法步驟.................................................