【摘要】：隨著互聯(lián)網(wǎng)的發(fā)展，，搜索引擎已經(jīng)成為人們快速搜索信息的重要工具，而關(guān)鍵字廣告作為搜索引擎的重要經(jīng)濟(jì)基礎(chǔ)之一，有效地滿足了廣告主的營(yíng)銷需要，同時(shí)也給搜索引擎提供商帶來(lái)巨大的利潤(rùn)。關(guān)鍵字廣告拍賣不僅成為微觀經(jīng)濟(jì)理論在互聯(lián)網(wǎng)上最成功的應(yīng)用之一，而且推動(dòng)了科學(xué)領(lǐng)域的眾多學(xué)者對(duì)其背后機(jī)制的研究，成為電子商務(wù)領(lǐng)域的研究熱點(diǎn)。交易智能體競(jìng)賽，簡(jiǎn)稱TAC，是由卡耐基梅隆大學(xué)等學(xué)校聯(lián)合主辦，旨在模擬真實(shí)的市場(chǎng)行為，將目前人工智能的理論研究成果應(yīng)用到現(xiàn)實(shí)的交易過(guò)程中。TAC/AA是虛擬關(guān)鍵字廣告拍賣平臺(tái)，研究者可以將研究成果應(yīng)用到該平臺(tái)上，驗(yàn)證算法的有效性。本文圍繞TAC/AA平臺(tái)設(shè)計(jì)了一種能夠制定連續(xù)最優(yōu)競(jìng)價(jià)策略的Agent模型，并提出了動(dòng)態(tài)多樣精英PSO算法，有效解決了Agent模型中優(yōu)化問(wèn)題的局部收斂問(wèn)題。 首先本文分析了國(guó)內(nèi)外關(guān)鍵字拍賣的研究現(xiàn)狀，介紹了TAC平臺(tái)的設(shè)計(jì)思想和比賽的規(guī)則，然后研究了關(guān)鍵字拍賣理論、Agent理論和進(jìn)化算法的相關(guān)理論。針對(duì)TAC平臺(tái)的關(guān)鍵字拍賣競(jìng)賽，設(shè)計(jì)了TAC-HEU-AA(THA)Agent模型，分析了預(yù)測(cè)器的算法的效率，通過(guò)實(shí)驗(yàn)討論了各個(gè)模塊的必要性，并將THA模型與參與TAC/AA決賽的Agent進(jìn)行比較試驗(yàn)，驗(yàn)證了模型的有效性，分析了模型的優(yōu)缺點(diǎn)。針對(duì)THA模型中的優(yōu)化器的多選擇背包問(wèn)題(MCKP，Multi-Choice Knapsack Problem)，提出了一種新的基于多樣精英選擇策略的粒子群算法(DME-PSO)。定義了3種粒子的運(yùn)動(dòng)趨勢(shì)和4種粒子間的運(yùn)動(dòng)行為。根據(jù)粒子的運(yùn)動(dòng)行為選擇粒子以保持種群的多樣性。在變異過(guò)程中，描述了種群的精英飽和現(xiàn)象，在種群精英飽和狀態(tài)時(shí)對(duì)種群加入擾動(dòng)。在實(shí)驗(yàn)中，將DME-PSO算法與貪婪算法，多種群遺傳算法和加入高斯擾動(dòng)的粒子群算法進(jìn)行比較。實(shí)驗(yàn)表明DME-PSO算法在物品數(shù)量增加時(shí)表現(xiàn)出較好的優(yōu)化效果，從而更好的解決組合優(yōu)化的局部收斂問(wèn)題。
[Abstract]:With the development of Internet, search engine has become an important tool for people to search for information quickly. As one of the important economic foundations of search engine, keyword advertisement meets the marketing needs of advertisers effectively. At the same time, it also brings huge profits to search engine providers. Keyword advertising auction has not only become one of the most successful applications of microeconomic theory on the Internet, but also promoted the research of the mechanism behind it by many scholars in the field of science, and has become a research hotspot in the field of electronic commerce. The transaction Agent Competition, or TAC, is sponsored by schools such as Carnegie Mellon University to simulate real market behavior. Applying the current theoretical research results of artificial intelligence to real transactions. TAC / AA is a virtual keyword advertising auction platform. Researchers can apply the research results to this platform to verify the effectiveness of the algorithm. This paper designs a Agent model based on TAC/AA platform, which can formulate continuous optimal bidding strategy, and proposes dynamic and diverse elite PSO algorithm, which effectively solves the problem of local convergence of optimization problem in Agent model. Firstly, this paper analyzes the research status of keyword auction at home and abroad, introduces the design idea of TAC platform and the rules of competition, and then studies the theory of keyword auction and the related theories of evolutionary algorithm. Aiming at the keyword auction competition of TAC platform, this paper designs the TAC-HEU-AA (THA) Agent model, analyzes the efficiency of the algorithm of the predictor, discusses the necessity of each module through experiments, and compares the THA model with the Agent participating in the TAC/AA finals. The validity of the model is verified and the advantages and disadvantages of the model are analyzed. Aiming at the multi-selection knapsack problem of optimizer in THA model (MCKP,Multi-Choice Knapsack Problem), a new particle swarm optimization algorithm (DME-PSO) based on multiple elitist selection strategies is proposed. The movement trends of three kinds of particles and the motion behavior of four kinds of particles are defined. The particles are selected according to their motion behavior to maintain the diversity of the population. In the process of variation, the phenomenon of elite saturation of population is described, and the disturbance is added to the population in the state of elite saturation. In the experiment, DME-PSO algorithm is compared with greedy algorithm, multi-population genetic algorithm and particle swarm optimization algorithm with Gao Si disturbance. The experimental results show that the DME-PSO algorithm performs well when the number of items increases, thus solving the problem of local convergence of combinatorial optimization better.
【學(xué)位授予單位】：哈爾濱工程大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2012
【分類號(hào)】：TP391.3;TP18

【參考文獻(xiàn)】

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

1 鮑江宏;楊啟貴;;多選擇背包問(wèn)題的快速求解算法[J];華南理工大學(xué)學(xué)報(bào)(自然科學(xué)版);2009年04期

2 戎文晉;劉樹(shù)林;;關(guān)鍵詞拍賣中最優(yōu)保留價(jià)的研究[J];管理科學(xué)學(xué)報(bào);2010年04期

3 王勇;蔡自興;周育人;肖赤心;;約束優(yōu)化進(jìn)化算法[J];軟件學(xué)報(bào);2009年01期

4 汪定偉;;考慮廣告商信譽(yù)的搜索引擎排位拍賣的機(jī)制設(shè)計(jì)[J];系統(tǒng)工程理論與實(shí)踐;2011年01期

5 艾熱提·阿布力克木;劉芳園;;基于主體Agent上的意圖表示[J];新疆師范大學(xué)學(xué)報(bào)(自然科學(xué)版);2009年04期

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

1 宋海剛;開(kāi)放電子市場(chǎng)中的議價(jià)協(xié)議及議價(jià)策略研究[D];華中科技大學(xué);2005年

本文編號(hào)：2221659