本文選題：單行設(shè)備布局問題 + 禁忌搜索算法�。� 參考：《北京郵電大學(xué)》2015年碩士論文

【摘要】：設(shè)備布局問題在實際生產(chǎn)和理論研究中存在多年,并且產(chǎn)生了許多相關(guān)的變體和相應(yīng)的解決方案。單行設(shè)備布局作為一種典型的設(shè)備布局形式,被廣泛研究。它旨在將固定數(shù)量的設(shè)備合理的安排在一行上,使得設(shè)備之間的物流成本最小。然而在實際生產(chǎn)中,不僅設(shè)備之間的物流成本是成本的重要組成部分,設(shè)備的占地面積也是非常昂貴的,占生產(chǎn)成本不可忽視的一部分。本文調(diào)研了國內(nèi)外單行設(shè)備布局問題的實際情況,在結(jié)合生產(chǎn)需求的基礎(chǔ)上,提出一種帶有附加間距的單行設(shè)備布局問題。這種附加間距可以根據(jù)需求放在設(shè)備的兩側(cè)�；谇蠼饽繕�(biāo)的不同,將該研究問題分成兩部分： 1)以優(yōu)化物流成本為目標(biāo)的帶有附加間距的單行設(shè)備布局問題的研究。對于該問題,本文采用禁忌搜索與數(shù)學(xué)規(guī)劃相結(jié)合的方法來求解。具體地說,就是用禁忌搜索尋找最優(yōu)設(shè)備序列,用數(shù)學(xué)規(guī)劃工具對設(shè)備附加間距方向進(jìn)行優(yōu)化。為了評價設(shè)備序列,本文提出一種啟發(fā)式規(guī)則用來確定設(shè)備的附加間距方向。 2)以優(yōu)化物流成本以及設(shè)備占地面積為目標(biāo)的帶有附加間距的單行設(shè)備布局問題。針對該研究問題,論文采用一種簡單的基于整數(shù)編碼的離散的差分進(jìn)化算法來求解。 為了驗證提出的模型和相應(yīng)求解方法的正確性和有效性,本文分別用小規(guī)模問題實例(10設(shè)備)、中等規(guī)模問題實例(20、30設(shè)備)以及大規(guī)模問題實例(50設(shè)備)進(jìn)行驗證。實驗結(jié)果表明：模型可以正確描述需求,提出的方法可以有效的求解模型。
[Abstract]:The problem of equipment layout has existed in practical production and theoretical research for many years, and has produced many related variants and corresponding solutions. As a typical device layout, single-line device layout has been widely studied. It aims to arrange a fixed number of equipment in a row so as to minimize the logistics costs between the devices. However, in the actual production, not only the logistics cost between the equipment is an important part of the cost, but also the occupation area of the equipment is very expensive, which can not be ignored as a part of the production cost. This paper investigates the actual situation of the single line equipment layout problem at home and abroad, and puts forward a single line equipment layout problem with additional spacing on the basis of the production demand. This additional spacing can be placed on both sides of the device as required. The problem is divided into two parts based on the difference of solving objectives: 1) the study of single-row equipment layout with additional spacing aiming at optimizing logistics cost. In this paper, Tabu search and mathematical programming are used to solve the problem. Specifically, Tabu search is used to find the optimal equipment sequence, and mathematical programming tools are used to optimize the direction of the additional spacing of the equipment. In order to evaluate the equipment sequence, this paper presents a heuristic rule to determine the direction of the additional distance of the equipment. 2) A single row layout problem with additional spacing is proposed to optimize the logistics cost and the space occupied by the equipment. A simple discrete differential evolutionary algorithm based on integer coding is used to solve the problem. In order to verify the correctness and validity of the proposed model and the corresponding solution methods, this paper uses a small scale problem case (10 equipment), a medium scale problem case (20 ~ 30 equipment) and a large scale problem case (50 equipment) to verify the validity and validity of the proposed model. The experimental results show that the model can describe the requirements correctly, and the proposed method can solve the model effectively.
【學(xué)位授予單位】：北京郵電大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2015
【分類號】：TP18

【參考文獻(xiàn)】

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

1 趙川;楊育;曾強;;基于混合遺傳算法的制造車間布局設(shè)計[J];重慶理工大學(xué)學(xué)報(自然科學(xué)版);2010年02期

2 陳希,王寧生;基于遺傳算法的車間設(shè)備虛擬布局優(yōu)化技術(shù)研究[J];東南大學(xué)學(xué)報(自然科學(xué)版);2004年05期

3 劉剛;;模擬退火算法在車間設(shè)備布局中應(yīng)用[J];機電產(chǎn)品開發(fā)與創(chuàng)新;2009年03期

4 李郝林,楊敏;基于生物遺傳算法的車間布局優(yōu)化算法[J];江蘇機械制造與自動化;2001年04期

，

本文編號：2111120