《物流配送路徑優(yōu)化問(wèn)題研究的國(guó)內(nèi)外文獻(xiàn)綜述》4100字

物流配送路徑優(yōu)化問(wèn)題研究的國(guó)內(nèi)外文獻(xiàn)綜述目錄TOC\o"1-2"\h\u591物流配送路徑優(yōu)化問(wèn)題研究的國(guó)內(nèi)外文獻(xiàn)綜述 [49]考慮到顧客在時(shí)間和空間上的隨機(jī)性，采用時(shí)空泊松分布模擬客戶位置的方法，提出了將不同品種的貨物進(jìn)行共同配送的模型，利用遺傳算法和禁忌搜索相結(jié)合，對(duì)模型的進(jìn)行求解，得到改進(jìn)的遺傳算法搜索最優(yōu)方案的能力更強(qiáng)。參考文獻(xiàn)Dantzig,G.B.RamserJH.TheTruckDispatchingProblem[J].ManagementScience,1959,6(1):80-91.BodinLD,GoldenBL,AssadAA,etal.Routingandschedulingofvehiclesandcrews:thestateofart[J].Computers&OpcrationsRescarch,1983,(10):63-211.BakerBM,AyechewMA.Ageneticalgorithmforthevehicleroutingproblem[J].Computers&OperationsResearch,2003,30(5):787-800.Kolen,ComparisonofSystemsBasedonEvolutionarySearchandSimulatedAnnealingtoSolvetheVRTWProblerm.InternationalJournalofComputationalIntelligenceandApplications[J].2004,4(1):27-39.ChenP,HuangH,DongXY.Iteratedvariableneighborhooddescentalgorithmforthecapacitatedvehicleroutingproblem[J].ExpertSystemswithApplications,2010,37(2):1620-1627.RajeevG,RamanM.AhybridofAntColonyandfireflyalgorithms(HAFA)forsolvingvehicleroutingproblems[J].JournalofComputationalScience,2018(3):25-38.劉晉,亢耀先.車(chē)輛路線路徑問(wèn)題的一種新的啟發(fā)式算法一二重優(yōu)化法[J].北京郵電大學(xué)學(xué)報(bào),1985(1):60-68.劉寶碇,趙瑞清,王綱.不確定規(guī)劃及應(yīng)用[M].清華大學(xué)出版社,2003.王征,張俊,王旭坪.多車(chē)場(chǎng)帶時(shí)間窗配送路徑問(wèn)題的變鄰域搜索算法[J].中國(guó)管理科學(xué),2011,19(02):99-109.李寧.物流配送網(wǎng)絡(luò)規(guī)劃問(wèn)題研究[D].北京:北京交通大學(xué)碩士學(xué)位論文,2011.麻存瑞,柏赟,趙欣苗,曾瑋.快遞配送車(chē)輛路徑優(yōu)化研究[J].交通運(yùn)輸系統(tǒng)工程與信息,2017,17(04):182-187.龐燕,羅華麗,邢立寧,任騰.車(chē)輛路徑優(yōu)化問(wèn)題及求解方法研究綜述[J].控制理論與應(yīng)用,2019,36(10):1573-1584.李陽(yáng),范厚明,張曉楠,楊翔.隨機(jī)需求車(chē)輛路徑問(wèn)題及混合變鄰域分散搜索算法求解[J].控制理論與應(yīng)用,2017,34(12):1594-1604.Kolen,A.Rinnooy,K.Trienekens,H.Vehicleroutingwithtimewindows[J].Operationsresearch,1987,35(2):266-73.Savelsbergh,M.LocalSearchinRoutingProblemswithTimeWindows[J].AnnalsofOperationsResearch.1985,16(4):285-305.Thangiah,S.Nygard,K.Ageneticalgorithmsystemforvehicleroutingwithtimewindows[J].UniteStates:IEEE,1990:322-328.Joe,L.Blanton,J.Multiplevehicleroutingproblemwithtimeandcapacityconstraintsusinggeneticalgorithms[J].MorganKaufmanPublishersInc,1993:452-459.Errico,F,Desaulniers,G,Gendreau,M.Aprioriooptimizationwithrecourseforthevehicleroutingproblemwithhardtimewindowsandstochasticservicetimes[J].EuropeanJournalofOperationalResearch,2015,249(1).Desrochers,M.Carlsson,J.Worst-casedemanddistributionsinvehiclerouting[J].EuropeanJournalofOperationalResearch.2017,256(2):462-272.魏俊華,王安麟,童毅.基于需求劃分的帶軟時(shí)間窗的路徑優(yōu)化方法[J].公路交通科技,2005,22(10):165-170.張建勇,李軍,郭耀煌.帶模糊預(yù)約時(shí)間的動(dòng)態(tài)VRP的插入式啟發(fā)式算法[J].西南交通大學(xué)學(xué)報(bào),2008,43(1).楊寧棟,郎茂祥,胡思繼.有時(shí)間窗車(chē)輛路徑問(wèn)題的模型及其改進(jìn)模擬退火算法研究[J].管理工程學(xué)報(bào),2006,20(3):104-107.張文博,蘇秦,程光路.基于動(dòng)態(tài)需求的帶時(shí)間窗的車(chē)輛路徑問(wèn)題[J].工業(yè)工程與管理,2016,21(06):68-74.柴