發(fā)布時(shí)間：2019-03-01 10:35

【摘要】：隨著全球性經(jīng)濟(jì)的飛速發(fā)展,制造產(chǎn)業(yè)面臨著新的挑戰(zhàn),企業(yè)要想在激烈的競(jìng)爭(zhēng)中立于不敗之地,必須以最低的成本、最好的質(zhì)量、最快的速度和最優(yōu)的服務(wù)來(lái)響應(yīng)市場(chǎng)。通過(guò)改善生產(chǎn)調(diào)度方案,可以有效地提高企業(yè)的生產(chǎn)效率,增強(qiáng)企業(yè)的市場(chǎng)競(jìng)爭(zhēng)力,由此調(diào)度問(wèn)題應(yīng)運(yùn)而生。車間調(diào)度問(wèn)題就是要解決如何利用有限的資源在滿足各種生產(chǎn)約束的前提下,確定工件和設(shè)備的加工順序和時(shí)間,使性能指標(biāo)最優(yōu)。然而企業(yè)的實(shí)際生產(chǎn)調(diào)度過(guò)程中,一般不會(huì)單純的只考慮一個(gè)目標(biāo),往往同時(shí)考慮多個(gè)目標(biāo),多目標(biāo)優(yōu)化問(wèn)題就會(huì)普遍存在,因此多目標(biāo)混合流水車間調(diào)度問(wèn)題(Hybrid Flow-Shop Scheduling Problem, HFSP)的研究有重大意義。 本文通過(guò)對(duì)遺傳算法(Genetic Algorithm, GA)和粒子群算法(Particle Swarm Optimization, PSO)進(jìn)行融合,提出了一種針對(duì)HFSP的多目標(biāo)遺傳粒子群混合算法。遺傳算法具有較強(qiáng)的魯棒性和群體尋優(yōu)能力,但其存在過(guò)早收斂和后期搜索效率低的問(wèn)題,粒子群具有計(jì)算簡(jiǎn)單和效率高的特點(diǎn),但存在易早熟和陷入局部最優(yōu)的缺點(diǎn)。在分別分析了遺傳算法和粒子群算法優(yōu)劣勢(shì)的基礎(chǔ)上,取長(zhǎng)補(bǔ)短,利用遺傳算法優(yōu)秀的群體尋優(yōu)能力,總體上把握進(jìn)化的方向,根據(jù)粒子群算法計(jì)算簡(jiǎn)單、效率高的特點(diǎn),首先進(jìn)行多個(gè)粒子群的獨(dú)立進(jìn)化,快速地全面搜索出較優(yōu)良的個(gè)體,各粒子群之間亦實(shí)行個(gè)體遷移,以擴(kuò)大搜索領(lǐng)域,然后采集各粒子群的最優(yōu)個(gè)體組成遺傳算法的初始種群,進(jìn)行遺傳操作,隨后用得到的優(yōu)良個(gè)體代替種群中的較劣個(gè)體,如此循環(huán),高效率地找到目標(biāo)最優(yōu)解。本文在詳細(xì)分析了HFSP基礎(chǔ)上,建立了一套完整的多目標(biāo)遺傳粒子群混合算法求解方案。 本文實(shí)現(xiàn)了利用多目標(biāo)遺傳粒子群混合算法解決HFSP,首先根據(jù)企業(yè)生產(chǎn)中常見的優(yōu)化目標(biāo)建立了HFSP模型,在此基礎(chǔ)上,利用HFSP中的經(jīng)典實(shí)例進(jìn)行測(cè)試,分析評(píng)估了算法的效率,并將該算法的結(jié)論與其他算法進(jìn)行比較,結(jié)果表明,該算法有明顯的優(yōu)越性,可以有效地解決HFSP,具有良好的應(yīng)用前景。
[Abstract]:With the rapid development of the global economy, the manufacturing industry is facing new challenges. In order to be invincible in the fierce competition, enterprises must respond to the market with the lowest cost, the best quality, the fastest speed and the best service. By improving the production scheduling scheme, the production efficiency of the enterprise can be effectively improved and the market competitiveness of the enterprise can be enhanced, thus the scheduling problem emerges as the times require. The problem of job-shop scheduling is to solve the problem of how to make use of limited resources to determine the processing order and time of workpieces and equipment under the premise of satisfying various production constraints, so as to optimize the performance index. However, in the actual production scheduling process of an enterprise, the multi-objective optimization problem will generally exist because it does not only consider only one goal, but also considers more than one goal at the same time. Therefore, the study of multi-objective hybrid flow shop scheduling problem (Hybrid Flow-Shop Scheduling Problem, HFSP) is of great significance. Based on the fusion of genetic algorithm (Genetic Algorithm, GA) and particle swarm optimization (Particle Swarm Optimization, PSO), a hybrid multi-objective genetic particle swarm optimization algorithm for HFSP is proposed in this paper. Genetic algorithm has strong robustness and population optimization ability, but it has the problems of premature convergence and low search efficiency in late stage. Particle swarm optimization has the characteristics of simple calculation and high efficiency, but it is easy to precocity and fall into local optimization. Based on the analysis of the advantages and disadvantages of genetic algorithm and particle swarm optimization algorithm, the advantages and disadvantages of genetic algorithm and particle swarm optimization algorithm are analyzed, and the excellent population optimization ability of genetic algorithm is used to grasp the direction of evolution in general. According to the characteristics of simple calculation and high efficiency of particle swarm optimization algorithm, First, the independent evolution of multiple particle swarm groups is carried out, and the better individuals are searched out quickly and comprehensively. The individual migration is also carried out among the particle swarm to expand the search field, and then the optimal individuals of each particle swarm are collected to make up the initial population of genetic algorithm. Genetic manipulation is carried out, and then the superior individuals are used to replace the inferior individuals in the population, so that the target optimal solution can be found efficiently in this cycle. In this paper, based on the detailed analysis of HFSP, a complete set of multi-objective genetic particle swarm hybrid algorithm is proposed. In this paper, a hybrid multi-objective genetic particle swarm algorithm is used to solve HFSP,. Firstly, the HFSP model is established according to the common optimization objectives in enterprise production. On this basis, the classical examples in HFSP are used to test, and the efficiency of the algorithm is analyzed and evaluated. The conclusion of the algorithm is compared with other algorithms, and the results show that the algorithm has obvious advantages and can effectively solve HFSP, has a good application prospect.
【學(xué)位授予單位】：大連交通大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類號(hào)】：TP18;TB497

【相似文獻(xiàn)】

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

1 潘全科;趙保華;屈玉貴;畢于慧;;一類解決無(wú)等待流水車間調(diào)度問(wèn)題的蟻群算法[J];計(jì)算機(jī)集成制造系統(tǒng);2007年09期

2 何利;劉永賢;劉笑天;;粒子群優(yōu)化算法求解車間調(diào)度問(wèn)題[J];機(jī)械與電子;2007年08期

3 王秋芬;楊澤平;梁道雷;;一種改進(jìn)的車間調(diào)度問(wèn)題算法[J];科學(xué)技術(shù)與工程;2013年11期

4 蘇子林;;車間調(diào)度問(wèn)題及其進(jìn)化算法分析[J];機(jī)械工程學(xué)報(bào);2008年08期

5 徐建有;董乃群;顧樹生;;帶有順序相關(guān)調(diào)整時(shí)間的多目標(biāo)流水車間調(diào)度問(wèn)題[J];計(jì)算機(jī)集成制造系統(tǒng);2013年12期

6 康寧,王鳳儒,劉丕娥,常會(huì)友;有交貨期的單件車間調(diào)度問(wèn)題的逆序算法[J];系統(tǒng)工程理論與實(shí)踐;1999年12期

7 馬邦雄;葉春明;;利用貓群算法求解流水車間調(diào)度問(wèn)題[J];現(xiàn)代制造工程;2014年06期

8 曲媛;楊曉偉;;關(guān)于流水車間調(diào)度問(wèn)題的綜述[J];中小企業(yè)科技;2007年08期

9 何利;劉永賢;謝華龍;張禹;;面向IC生產(chǎn)模式的Job Shop調(diào)度問(wèn)題的研究[J];制造技術(shù)與機(jī)床;2008年12期

10 董薇;張淑麗;;Matlab/Visual C++混合編程求解單件車間調(diào)度問(wèn)題[J];機(jī)械工程師;2008年03期

相關(guān)會(huì)議論文 前3條

1 鄒逢興;曾令李;高政;劉烽;;一種求解混合流水車間調(diào)度問(wèn)題的分布式方法[A];2009中國(guó)控制與決策會(huì)議論文集（2）[C];2009年

2 朱婧;;求解車間調(diào)度問(wèn)題的改進(jìn)模擬退火算法[A];第五屆（2010）中國(guó)管理學(xué)年會(huì)——商務(wù)智能分會(huì)場(chǎng)論文集[C];2010年

3 洪宗友;龐哈利;;No-wait流水車間調(diào)度問(wèn)題的一種啟發(fā)式算法[A];2007中國(guó)控制與決策學(xué)術(shù)年會(huì)論文集[C];2007年

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

1 何利;即時(shí)定制生產(chǎn)模式及其車間調(diào)度問(wèn)題的研究[D];東北大學(xué);2008年

2 黃英杰;基于目標(biāo)級(jí)聯(lián)法和智能優(yōu)化算法的車間調(diào)度問(wèn)題研究[D];華南理工大學(xué);2012年

3 劉延風(fēng);置換流水車間調(diào)度問(wèn)題的幾種智能算法[D];西安電子科技大學(xué);2012年

4 常桂娟;基于微粒群算法的車間調(diào)度問(wèn)題研究[D];青島大學(xué);2008年

5 崔U，

本文編號(hào)：2432346