改進差分進化算法求解裝載率凹費用裝箱問題
發(fā)布時間:2018-02-11 06:42
本文關(guān)鍵詞: 裝箱問題 凹費用函數(shù) 差分進化 分組編碼 自適應(yīng)局部搜索 出處:《運籌與管理》2017年09期 論文類型:期刊論文
【摘要】:研究了廣泛存在于物流作業(yè)中一類新型的裝箱問題,主要特征體現(xiàn)在箱子使用費用是關(guān)于裝載率的凹函數(shù)。為求解問題,提出了一種基于分組編碼策略的改進差分進化算法,以避免常規(guī)實數(shù)和整數(shù)編碼方法存在放大搜索空間的不足。針對分組編碼策略,定制化設(shè)計了以促進優(yōu)秀基因傳播為導(dǎo)向的新型變異和交叉操作,另外還嵌入了以物品置換為鄰域的自適應(yīng)局部搜索操作以增強局部搜索能力。對以往文獻給出算例在不同凹費用函數(shù)下進行測試,實驗結(jié)果顯示所提出的算法明顯優(yōu)于BFD啟發(fā)式算法,并且較遺傳算法也有顯著性改進。
[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)工程研究所;
【基金】:國家重點研發(fā)計劃(2017YFB0304100) 國家自然科學(xué)基金項目(71672032,71202151)
【分類號】:F252;TP18
【相似文獻】
相關(guān)期刊論文 前10條
1 曹晶;鄭巍;許e,
本文編號:1502435
本文鏈接:http://sikaile.net/jingjifazhanlunwen/1502435.html
最近更新
教材專著