【摘要】：本課題來(lái)源于國(guó)家自然科學(xué)基金項(xiàng)目“柔性車間設(shè)施布局與帶裝載約束的AGV(Automated Guided Vehicle)路徑規(guī)劃集成優(yōu)化方法”(No.61304206)和企業(yè)的實(shí)際需求。設(shè)備布局和物料運(yùn)送是柔性制造系統(tǒng)(Flexible Manufacturing System, FMS)的兩個(gè)重要問(wèn)題,得到企業(yè)界和廣大研究者的重視和關(guān)注,但目前將二者集成優(yōu)化的研究還相對(duì)較少。本文以柔性制造車間為研究背景,研究其設(shè)備布局和AGV路徑規(guī)劃二者集成優(yōu)化問(wèn)題,其目的是進(jìn)一步降低制造成本和縮短生產(chǎn)周期。 本文在國(guó)家自然科學(xué)基金的資助下,以廈門B公司的二期柔性車間布局和路徑規(guī)劃項(xiàng)目作為工程背景,研究了柔性車間中的路徑規(guī)劃和設(shè)備布局重要問(wèn)題,對(duì)區(qū)域式AGV系統(tǒng)進(jìn)行了數(shù)學(xué)建模,并給出求解策略。在實(shí)現(xiàn)上采用禁忌搜索算法分別求解,并針對(duì)兩者的耦合關(guān)系進(jìn)行了研究,給出系列方法和步驟綜合求解路徑規(guī)劃和設(shè)備布局問(wèn)題。 本文的主要工作可以總結(jié)為以下方面： (1)分析柔性車間的路徑規(guī)劃和設(shè)備布局耦合問(wèn)題,采用區(qū)域式AGV系統(tǒng)來(lái)解決路徑規(guī)劃和設(shè)備布局,并針對(duì)區(qū)域式AGV系統(tǒng)進(jìn)行了數(shù)學(xué)建模,為系統(tǒng)中跨環(huán)負(fù)載量和流量及內(nèi)環(huán)的負(fù)載量和流量提供了求解策略。 (2)研究和分析了柔性車間的車間布局問(wèn)題,針對(duì)柔性車間中環(huán)形布局問(wèn)題提出了采用禁忌搜索算法進(jìn)行求解,并采用該求解方法對(duì)Nearchou提出的4種不同規(guī)模的環(huán)形布局算例進(jìn)行求解,數(shù)字仿真實(shí)驗(yàn)結(jié)果驗(yàn)證了本文方法的求解能力。 (3)研究和分析了柔性車間中區(qū)域式AGV系統(tǒng)的路徑規(guī)劃問(wèn)題。以最近距離為主線對(duì)車間的設(shè)備進(jìn)行分區(qū),提出順序連接方法對(duì)分區(qū)后的設(shè)備設(shè)置運(yùn)輸路徑,使得內(nèi)環(huán)路徑最短。為了解決各個(gè)回路間的物料運(yùn)輸,本文對(duì)各個(gè)回路設(shè)置一個(gè)中轉(zhuǎn)站,并采用禁忌搜索算法獲取各個(gè)回路的最佳中轉(zhuǎn)站,并采用順序連接方法連接各個(gè)中轉(zhuǎn)站,從而形成外環(huán)回路,使得外環(huán)回路最短。最后針對(duì)求解方案提出改進(jìn)方法以便獲取更好的設(shè)計(jì)方案。通過(guò)數(shù)據(jù)實(shí)例分析驗(yàn)證該方法的求解能力。 (4)研究和分析柔性車間中路徑規(guī)劃和設(shè)備布局耦合關(guān)系,提出了綜合求解方法。采用禁忌搜索算法對(duì)設(shè)備進(jìn)行分群,獲取最優(yōu)分群解。對(duì)分群后的各回路的設(shè)備布局采用禁忌搜索算法進(jìn)行求解,其目標(biāo)是減少環(huán)內(nèi)總流量。將回路間跨環(huán)流量最大的回路放置在一起,以減少跨環(huán)流量,從而將回路布置到車間,同時(shí)連接各個(gè)回路中轉(zhuǎn)站形成運(yùn)轉(zhuǎn)中心以解決環(huán)間運(yùn)輸。通過(guò)廈門B公司的車間規(guī)劃布局作為算例進(jìn)行求解,求解結(jié)果驗(yàn)證了算法的求解能力。 本文針對(duì)柔性車間中路徑規(guī)劃和車間布局的重要問(wèn)題,研究柔性制造車間AGV路徑規(guī)劃和設(shè)備布局的集成建模和求解方法,給出相應(yīng)的理論方法,有助于該問(wèn)題建模和求解方法上的研究進(jìn)展,具有現(xiàn)實(shí)意義和實(shí)際應(yīng)用價(jià)值。
[Abstract]:This topic comes from the project of the National Natural Science Foundation of China "flexible workshop facility layout and integrated optimization method of AGV (Automated Guided Vehicle) path planning with loading constraints" (No.61304206) and the actual needs of enterprises. Equipment layout and material transportation are two important issues in (Flexible Manufacturing System, FMS), which have been paid attention to by many researchers and enterprises. However, there are few researches on the integration and optimization of FMS and FMS. In this paper, the integrated optimization of equipment layout and AGV path planning for flexible manufacturing workshop is studied. The purpose of this problem is to further reduce manufacturing cost and shorten production cycle. In this paper, with the financial support of the National Natural Science Foundation of China and taking the second phase flexible workshop layout and route planning project of Xiamen B Company as the engineering background, the important problems of route planning and equipment layout in flexible workshop are studied. The regional AGV system is modeled and the solution strategy is given. Tabu search algorithm is used to solve the problem, and the coupling relationship between them is studied. A series of methods and steps are given to solve the path planning and equipment layout problems. The main work of this paper can be summarized as follows: (1) analyze the coupling problem of path planning and equipment layout in flexible workshop, and adopt regional AGV system to solve the problem of path planning and equipment layout. The mathematical model of the regional AGV system is presented, which provides a solution strategy for the load and flow of the cross loop and the load and flow of the inner ring. (2) the layout problem of the flexible workshop is studied and analyzed. A Tabu search algorithm is proposed to solve the circular layout problem in flexible workshop, and four different scale circular layout cases proposed by Nearchou are solved by this method. The numerical simulation results verify the ability of the proposed method. (3) the path planning problem of the regional AGV system in the flexible workshop is studied and analyzed. Taking the nearest distance as the main line, the equipment of the workshop is partitioned, and the sequential connection method is put forward to set the transportation path of the equipment after the partition, so that the inner loop path is the shortest. In order to solve the problem of material transportation between each loop, a transfer station is set up for each loop, and the Tabu search algorithm is used to obtain the best transfer station of each loop, and the sequential connection method is used to connect each transfer station. Thus, the outer loop is formed and the outer loop is the shortest. Finally, an improved method is proposed to obtain a better design scheme. The solution ability of the method is verified by the analysis of data examples. (4) the coupling relationship between path planning and equipment layout in flexible workshop is studied and analyzed, and a comprehensive solution method is proposed. Tabu search algorithm is used to cluster the equipment to obtain the optimal clustering solution. Tabu search algorithm is used to solve the equipment layout of each loop after clustering. The goal is to reduce the total flow in the loop. In order to reduce the cross loop flow, the circuit is arranged to the workshop, and the operation center is formed by connecting each loop transfer station to solve the transportation between the rings. By using the workshop layout of Xiamen B Company as an example, the algorithm is proved to be able to solve the problem. Aiming at the important problems of path planning and shop layout in flexible workshop, this paper studies the integrated modeling and solving method of AGV path planning and equipment layout in flexible manufacturing workshop, and gives the corresponding theoretical method. It is helpful to the research progress of modeling and solving the problem, and has practical significance and practical application value.
【學(xué)位授予單位】：大連理工大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類號(hào)】：TB491

【參考文獻(xiàn)】

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

1 王征;胡祥培;王旭坪;;帶二維裝箱約束的物流配送車輛路徑問(wèn)題[J];系統(tǒng)工程理論與實(shí)踐;2011年12期

2 董宗然;周慧;;禁忌搜索算法評(píng)述[J];軟件工程師;2010年Z1期

3 李新振;滕歡;;自適應(yīng)遺傳-禁忌搜索混合算法在PMU最優(yōu)配置中的應(yīng)用[J];四川電力技術(shù);2009年03期

4 張建英;趙志萍;劉暾;;基于人工勢(shì)場(chǎng)法的機(jī)器人路徑規(guī)劃[J];哈爾濱工業(yè)大學(xué)學(xué)報(bào);2006年08期

5 竺長(zhǎng)安;齊繼陽(yáng);曾議;;基于遺傳禁忌混合搜索算法的設(shè)備布局研究[J];系統(tǒng)工程與電子技術(shù);2006年04期

6 王竹芳;潘德惠;;用遺傳-禁忌搜索混合算法求解組合投資問(wèn)題[J];東北大學(xué)學(xué)報(bào);2006年01期

7 齊繼陽(yáng),竺長(zhǎng)安,曾議;遺傳算法在設(shè)備布局設(shè)計(jì)中的應(yīng)用[J];中國(guó)設(shè)備工程;2005年10期

8 李火生,李志華,鐘毅芳,戴同;生產(chǎn)車間設(shè)備布局線性模型及算法研究[J];計(jì)算機(jī)工程與應(yīng)用;2002年11期

9 孫樹棟,曲彥賓;遺傳算法在機(jī)器人路徑規(guī)劃中的應(yīng)用研究[J];西北工業(yè)大學(xué)學(xué)報(bào);1998年01期

相關(guān)博士學(xué)位論文 前1條

1 鄭曉軍;生產(chǎn)車間設(shè)施布局優(yōu)化方法研究[D];大連理工大學(xué);2010年

相關(guān)碩士學(xué)位論文 前6條

1 馮海雙;AGV自動(dòng)運(yùn)輸系統(tǒng)調(diào)度及路徑規(guī)劃的研究[D];哈爾濱工業(yè)大學(xué);2013年

2 趙保華;基于遺傳算法的設(shè)備布局設(shè)計(jì)及軟件開發(fā)[D];武漢理工大學(xué);2012年

3 蘇小進(jìn);機(jī)械加工車間設(shè)備布局建模與算法研究[D];上海交通大學(xué);2009年

4 曹戰(zhàn);基于遺傳算法的車間設(shè)備布局問(wèn)題研究[D];大連交通大學(xué);2007年

5 藍(lán)志坤;多AGV的自動(dòng)化物流系統(tǒng)動(dòng)態(tài)路徑規(guī)劃的研究[D];吉林大學(xué);2005年

6 李紅英;自動(dòng)導(dǎo)引小車系統(tǒng)（AGVS）路徑規(guī)劃技術(shù)研究[D];合肥工業(yè)大學(xué);2005年

，

本文編號(hào)：2293181