本文選題：遺傳算法 + 蟻群算法�。� 參考：《大連理工大學(xué)》2015年碩士論文

【摘要】：在工程項(xiàng)目管理中,合理地安排進(jìn)度和壓縮成本能夠拓展可得利潤(rùn)的空間,為項(xiàng)目帶來(lái)可觀的經(jīng)濟(jì)效益。傳統(tǒng)的工期費(fèi)用優(yōu)化方法如常用的數(shù)學(xué)規(guī)劃法、啟發(fā)式算法等都存在著一定的缺陷性。而混合算法因其計(jì)算高效、結(jié)果優(yōu)良的特性在近幾年引起學(xué)者們的關(guān)注,并在多個(gè)領(lǐng)域取得良好的效果。本文在前人研究的基礎(chǔ)上,針對(duì)傳統(tǒng)方法存在的一些問(wèn)題,利用混合遺傳算法在雙目標(biāo)組合優(yōu)化方面展現(xiàn)的獨(dú)特優(yōu)勢(shì),將遺傳算法和蟻群算法進(jìn)行混合應(yīng)用于網(wǎng)絡(luò)計(jì)劃的工期費(fèi)用優(yōu)化中。為實(shí)現(xiàn)工期和費(fèi)用同時(shí)優(yōu)化的目標(biāo),利用遺傳算法大范圍全局搜索的優(yōu)點(diǎn)以及蟻群算法正反饋性、求精解效率高等特征進(jìn)行兩種算法的混合交叉銜接工作。對(duì)活動(dòng)的持續(xù)時(shí)間和直接費(fèi)用為連續(xù)性函數(shù)關(guān)系的費(fèi)用優(yōu)化問(wèn)題進(jìn)行重點(diǎn)研究,將混合算法的所得結(jié)果分別與傳統(tǒng)算法和蟻群算法的所得結(jié)果進(jìn)行分析與比較,結(jié)果表明本文所用的混合算法在關(guān)鍵路徑上的尋找更高效,所得的工期結(jié)果也更合理和準(zhǔn)確。在一定程度上證明了其數(shù)學(xué)優(yōu)化模型的實(shí)際應(yīng)用可行性,為工期費(fèi)用優(yōu)化提供了一種新的思路和解決問(wèn)題的途徑。
[Abstract]:In the engineering project management, reasonable arrangement of schedule and reduction of cost can expand the available profit space and bring considerable economic benefits to the project. The traditional optimization methods such as mathematical programming and heuristic algorithms have some defects. The hybrid algorithm has attracted the attention of scholars in recent years because of its high efficiency and excellent results, and has achieved good results in many fields. In this paper, based on the previous studies, the unique advantages of hybrid genetic algorithm (HGA) in dual-objective combinatorial optimization are presented in view of some problems existing in traditional methods. Genetic algorithm (GA) and ant colony algorithm (ACA) are used to optimize the cost of network planning. In order to achieve the goal of time limit and cost optimization at the same time, the hybrid crossover of the two algorithms is carried out by using the advantages of genetic algorithm (GA) in large scale global search and the positive feedback of ant colony algorithm (ACA). This paper focuses on the cost optimization problem in which the duration and direct cost of activities are continuous function. The results of hybrid algorithm are analyzed and compared with those of traditional algorithm and ant colony algorithm, respectively. The results show that the hybrid algorithm used in this paper is more efficient in finding critical paths, and the obtained results are more reasonable and accurate. To a certain extent, the practical application feasibility of its mathematical optimization model is proved, which provides a new way of thinking and solving the problem for the optimization of construction period and cost.
【學(xué)位授予單位】：大連理工大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2015
【分類(lèi)號(hào)】：TU72

【參考文獻(xiàn)】

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

1 陳寶山;;項(xiàng)目工期—成本優(yōu)化問(wèn)題的蟻群算法設(shè)計(jì)[J];中國(guó)城市經(jīng)濟(jì);2011年24期

2 王海恒;魏志華;;網(wǎng)絡(luò)技術(shù)在施工項(xiàng)目管理中的應(yīng)用問(wèn)題[J];黑龍江科技信息;2010年08期

3 孫偉峰;董福全;蘇會(huì)德;;網(wǎng)絡(luò)計(jì)劃工期優(yōu)化在工程進(jìn)度管理中的應(yīng)用[J];山東冶金;2011年02期

4 劉爾烈,張艷海;建筑施工項(xiàng)目進(jìn)度、成本和質(zhì)量目標(biāo)的綜合優(yōu)化[J];天津理工學(xué)院學(xué)報(bào);2001年02期

5 駱剛,劉爾烈,王健;遺傳算法在網(wǎng)絡(luò)計(jì)劃資源優(yōu)化中的應(yīng)用[J];天津大學(xué)學(xué)報(bào);2004年02期

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

1 楊秀梅;基于遺傳算法的組卷系統(tǒng)的研究[D];上海交通大學(xué);2007年

，

本文編號(hào)：1958743