本文關(guān)鍵詞： 裝箱問(wèn)題 凹費(fèi)用函數(shù) 差分進(jìn)化 分組編碼 自適應(yīng)局部搜索　出處：《運(yùn)籌與管理》2017年09期 　論文類(lèi)型：期刊論文

【摘要】：研究了廣泛存在于物流作業(yè)中一類(lèi)新型的裝箱問(wèn)題,主要特征體現(xiàn)在箱子使用費(fèi)用是關(guān)于裝載率的凹函數(shù)。為求解問(wèn)題,提出了一種基于分組編碼策略的改進(jìn)差分進(jìn)化算法,以避免常規(guī)實(shí)數(shù)和整數(shù)編碼方法存在放大搜索空間的不足。針對(duì)分組編碼策略,定制化設(shè)計(jì)了以促進(jìn)優(yōu)秀基因傳播為導(dǎo)向的新型變異和交叉操作,另外還嵌入了以物品置換為鄰域的自適應(yīng)局部搜索操作以增強(qiáng)局部搜索能力。對(duì)以往文獻(xiàn)給出算例在不同凹費(fèi)用函數(shù)下進(jìn)行測(cè)試,實(shí)驗(yàn)結(jié)果顯示所提出的算法明顯優(yōu)于BFD啟發(fā)式算法,并且較遺傳算法也有顯著性改進(jìn)。
[Abstract]:In this paper, a new type of packing problem widely existing in logistics is studied. The main characteristic is that the cost of using the box is a concave function about the loading rate. In order to solve the problem, an improved differential evolutionary algorithm based on block coding strategy is proposed. In order to avoid the deficiency of the conventional real number and integer coding methods, a novel mutation and crossover operation, which is oriented to promote the transmission of excellent genes, is designed to solve the problem of block coding strategy. In addition, an adaptive local search operation based on the replacement of items is embedded to enhance the local search ability. The previous examples are tested under different concave cost functions. The experimental results show that the proposed algorithm is superior to the BFD heuristic algorithm and has a significant improvement over the genetic algorithm.
【作者單位】： 東北大學(xué)工業(yè)與系統(tǒng)工程研究所;
【基金】：國(guó)家重點(diǎn)研發(fā)計(jì)劃(2017YFB0304100) 國(guó)家自然科學(xué)基金項(xiàng)目(71672032,71202151)
【分類(lèi)號(hào)】：F252;TP18

【相似文獻(xiàn)】

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

1 曹晶;鄭巍;許e，

本文編號(hào)：1502435