本文關(guān)鍵詞：基于改進禁忌搜索的多目標(biāo)自動化倉庫調(diào)度，由筆耕文化傳播整理發(fā)布。

全文: (357 KB)   (1 KB) 
輸出: BibTeX | EndNote (RIS)      

摘要 

針對多貨叉?zhèn)}庫調(diào)度優(yōu)化問題, 提出一種改進型細(xì)菌覓食算法. 首先, 分階段對趨化步長進行自適應(yīng)調(diào)節(jié), 引導(dǎo)搜索沿最優(yōu)方向進行; 其次, 提出基于個體種群多樣性貢獻率的啟發(fā)式遷移策略, 降低進入局部最優(yōu)的機率; 再次, 采用不可行解部分保留策略以增加求出最優(yōu)解的機會; 最后, 對該算法的收斂性進行證明, 并結(jié)合工業(yè)現(xiàn)場調(diào)度問題對其性能進行驗證. 算例結(jié)果表明, 所提出的算法對多貨叉?zhèn)}庫調(diào)度優(yōu)化問題在解的質(zhì)量及收斂速度上都取得了較好效果.

服務(wù)

E-mail Alert

RSS

收稿日期: 2013-10-18      出版日期: 2015-01-14

ZTFLH: TP278  

基金資助:

國家自然科學(xué)基金項目(61074032, 61273040)；上海市青年科技啟明星計劃項目(12QA1401100)；上海市教委創(chuàng)新基金項目(12YZ020)；上海市科委重大基礎(chǔ)研究項目(14JC1402200).

通訊作者: 鄧麗     E-mail: dengli@shu.edu.cn

作者簡介: 楊文強(1984), 男, 博士生, 從事生產(chǎn)計劃與調(diào)度優(yōu)化、智能控制的研究；費敏銳(1961), 男, 教授, 博士生導(dǎo)師, 從事網(wǎng)絡(luò)先進控制理論與系統(tǒng)實現(xiàn)等研究.

引用本文:   

楊文強 鄧麗 牛群 費敏銳. 改進型細(xì)菌覓食算法及多貨叉?zhèn)}庫調(diào)度應(yīng)用[J]. 控制與決策, 2015, 30(02): 321-327. YANG Wen-qiang DENG Li NIU Qun FEI Min-rui. Improved bacterial foraging algorithm and application of warehousing scheduling with multi-shuttles. Control and Decision, 2015, 30(02): 321-327.

鏈接本文:  

:8080/CN/10.13195/j.kzyjc.2013.1436     或     :8080/CN/Y2015/V30/I02/321

[1] Regattieri A, Santarelli G, Manzini R, et al. The impact of dwell point policy in an automated storage/retrieval system[J]. Int J of Production Research, 2013, 51(14): 4336-4348.
[2] Hu Y H, Huang S Y, Chen C, et al. Travel time analysis of a new automated storage and retrieval system[J]. Computers and Operations Research, 2005, 32(6): 1515-1544.
[3] Belenguer J M, Benavent E, Prins C, et al. A branch and cut method for the capacitated location-routing problem[J]. Computers and Operations Research, 2011, (38): 931-941.
[4] Atmaca E, Ozturk A. Defining order picking policy: A storage assignment model and a simulated annealing solution in AS/RS systems[J]. Applied Mathematical Modelling, 2013, 37(7): 5069-5079.
[5] Cardin O, Castagna P, Sari Z, et al. Performance evaluation of in-deep class storage for flow-rack AS/RS[J]. Int J of Production Research, 2012, 50(23): 6775-6791.
[6] 楊文強, 鄧麗, 費敏銳, 等. 基于改進禁忌搜索的多目標(biāo)自動化倉庫調(diào)度[J]. 計算機集成制造系統(tǒng), 2013, 19(8): 2097-2104.
(Yang W Q, Deng L, Fei M R, et al. Multi-objective automated warehousing scheduling based on improved tabu search[J]. Computer Integrated Manufaturing Systems, 2013, 19(8): 2097-2104.)
[7] 李梅娟, 陳雪波, 王莉. 多巷道固定貨架揀選作業(yè)優(yōu)化問題的研究[J]. 控制與決策, 2008, 23(12): 1338-1342.
(Li M J, Chen X B, Wang L. Research on order picking optimization problem for multiple aisles fixed storage racks[J]. Control and Decision, 2008, 23(12): 1338-1342.)
[8] Passino K M. Biomimicry of bacterial foraging for distributed optimization and control[J]. IEEE Control Systems, 2002, 22(3): 52-67.
[9] Panigrahi B K, Pandi V R, Sharma R, et al. Multiobjective bacteria foraging algorithm for electrical load dispatch problem[J]. Energy Conversion and Management, 2011, 52(2): 1334-1342.
[10] Dos Santos Coelho L, Da Costa Silveira C, Sierakowski C A, et al. Improved bacterial foraging strategy applied to team workshop benchmark problem[J]. IEEE Trans on Magnetics, 2010, 46(8): 2903-2906.
[11] Singh S, Ghose T, Goswami S K. Optimal feeder routing based on the bacterial foraging technique[J]. IEEE Trans on Power Delivery, 2012, 27(1): 70-78.
[12] Bakwad K M, Pattnaik S S, Sohi B S, et al. Parallel bacterial foraging optimization for video compression[J]. Int J of Recent Trends in Engineering, 2009, 1(1): 118-122.
[13] Bhushan B, Singh M, Adaptive control of nonlinear systems using bacterial foraging algorithm[J]. Int J of Computer and Electrical Engineering, 2011, 3(3): 335-342.
[14] 馬苗, 梁建慧, 郭敏. 基于細(xì)菌覓食算法的SAR 圖像閾值分割[J]. 西安電子科技大學(xué)學(xué)報, 2011, 38(6): 152-178.
(Ma M, Liang J H, Guo M. SAR image thresholding segmentation based on the bacteria foraging algorithm[J]. J of Xidian University, 2011, 38(6): 152-178.)
[15] TSP95[DB/OL].

[1] 武燕 劉小雄 池程芝. 動態(tài)多目標(biāo)優(yōu)化的預(yù)測遺傳算法[J]. 控制與決策, 2013, 28(5): 677-682.

[2] 張頂學(xué)，，廖銳全. 一種基于種群速度的自適應(yīng)粒子群算法[J]. 控制與決策, 2009, 24(8): 1257-1260.

[3] 張頂學(xué) ;關(guān)治洪;劉新芝. 一種動態(tài)改變慣性權(quán)重的自適應(yīng)粒子群算法[J]. 控制與決策, 2008, 23(11): 1253-1257.

  本文關(guān)鍵詞：基于改進禁忌搜索的多目標(biāo)自動化倉庫調(diào)度，由筆耕文化傳播整理發(fā)布。