本文選題：車輛路徑問(wèn)題 + 二維裝箱問(wèn)題　； 參考：《中國(guó)管理科學(xué)》2017年07期

【摘要】：研究包含時(shí)間窗、多車場(chǎng)因素的二維裝箱車輛路徑問(wèn)題,建立相應(yīng)的數(shù)學(xué)模型,并提出求解該問(wèn)題的一種新的混合算法,混合算法由量子粒子群算法和引導(dǎo)式局部搜索算法組成。其中,量子粒子群算法用于求解車輛路徑問(wèn)題,引導(dǎo)式局部搜索算法用于求解可行裝箱方案。在引導(dǎo)式局部搜索算法中,提出一種基于最小浪費(fèi)原則的啟發(fā)式裝箱規(guī)則,以靈活確定待裝貨物和裝貨空間之間的匹配關(guān)系,減少重復(fù)確定裝箱方案所消耗的時(shí)間。設(shè)計(jì)了兩組數(shù)值試驗(yàn):第一組基于標(biāo)準(zhǔn)算例庫(kù),并將混合算法計(jì)算結(jié)果與已有文獻(xiàn)中的結(jié)果進(jìn)行對(duì)比;第二組基于隨機(jī)生成的新算例,新算例給出多車場(chǎng)和時(shí)間窗數(shù)據(jù),用于演示混合算法對(duì)新模型的計(jì)算過(guò)程和計(jì)算結(jié)果。兩組數(shù)值試驗(yàn)的結(jié)果表明,混合算法在效率和性能方面均有較好的表現(xiàn),計(jì)算結(jié)果和計(jì)算時(shí)間均優(yōu)于已有文獻(xiàn),且混合算法能夠較好的求解包含時(shí)間窗、多車場(chǎng)因素的二維裝箱車輛路徑問(wèn)題模型。
[Abstract]:In this paper, the two-dimensional packing vehicle routing problem with time windows and multi-yard factors is studied, the corresponding mathematical model is established, and a new hybrid algorithm is proposed to solve the problem. The hybrid algorithm consists of quantum particle swarm optimization (QPSO) and guided local search algorithm. Quantum Particle Swarm Optimization (QPSO) is used to solve the vehicle routing problem and the guided local search algorithm is used to solve the feasible packing scheme. In the guided local search algorithm, a heuristic packing rule based on the principle of minimum waste is proposed to flexibly determine the matching relationship between the loading space and the goods to be loaded, and to reduce the time taken to determine the packing scheme repeatedly. Two groups of numerical experiments are designed: the first group is based on the standard example library, and the results of the hybrid algorithm are compared with the results in the existing literatures, and the second group is based on the random generation of new examples, the new example gives the multi-field and time window data. It is used to demonstrate the calculation process and results of the hybrid algorithm for the new model. The results of two groups of numerical experiments show that the hybrid algorithm has better performance in efficiency and performance, and the computational results and computation time are better than those in previous literatures, and the hybrid algorithm can solve the inclusion time window better. A two-dimensional packing vehicle routing problem model with multi-yard factors.
【作者單位】： 北京信息科技大學(xué);北京科技大學(xué);
【基金】：國(guó)家自然科學(xué)基金青年項(xiàng)目(71602008) 北京市社會(huì)科學(xué)基金研究基地項(xiàng)目(16JDGLC032) 北京交通大學(xué)人才基金(B15RC00150)
【分類號(hào)】：O224;TP18

【相似文獻(xiàn)】

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

1 劉紅梅;陳楊;;車輛路徑問(wèn)題的形式化方法研究[J];科技資訊;2008年05期

2 唐加福;孔媛;潘震東;董穎;;基于劃分的蟻群算法求解貨物權(quán)重車輛路徑問(wèn)題[J];控制理論與應(yīng)用;2008年04期

3 徐俊杰;;利用微正則退火算法求解車輛路徑問(wèn)題[J];安慶師范學(xué)院學(xué)報(bào)(自然科學(xué)版);2009年02期

4 戴錫;葉耀華;吳勤e，

本文編號(hào)：1811375