陈冬芳,薛继伟,张漫

• 1:大庆石油学院计算机科学学院

• 2:大庆石油学院计算机科学学院

• 3:大庆石油学院计算机科学学院 黑龙江大庆163318

• 4:黑龙江大庆163318中国科学院成都计算机应用研究所

摘要(Abstract)：

综述了近年来国内外学者对全局最优化问题的研究成果,分析了不同全局最优算法的优缺点,指出了因存在最优化问题的本质特征(NP-难题)而在实践中算法可解的问题并不一定可解,同时指出了没有适合解决任何问题的通用全局最优算法,最后给出了2个研究趋势.

关键词(KeyWords)：全局优化;禁忌搜索;遗传算法;模拟退火算法;分枝与界定;区间方法

Abstract:

Keywords:

基金项目(Foundation):国家973计划项目(2004CB318003)

作者(Author):陈冬芳,薛继伟,张漫

Email:

参考文献(References)：

• [1] TanP H,RasmussenL K.Tabu search multiuser detection inCDMA[A].RadioVetenskap ochKommunikation[C].Sweden:Stock holm,2002.744-748.

• [2] TanP H ,RasmussenL K.A reactive tabu search heuristic for multiuser detection inCDMA[A].ISIT 2002[C].Switzerland:Lau sanne,2002.472.

• [3] NiarS,FrevilleA.A parallel tabu search algorithm for the0-1 multidimensional knapsack problem[A].11thInternationalParallelProcessingSymposium(IPPS '97)[C],Switzerland,Geneva,IEEE,1997.512-516.

• [4] WatsonJ P,WhitleyL D,HoweA E.A dynamic model of tabu search for theJob-Shop scheduling problem[A].The1stMultidisci plinaryInternationalConference onScheduling:Theory andApplications(MISTA 2003)[C].Netherlands:KluwerAcademicPub lishers,2003.320-336.

• [5] KirkpatrickS,GelattC D.Optimization by simulated annealing[J].Science,1983,220(4598):671-680.

• [6] 康立山,谢 云,尤矢勇,等.非数值并行算法-模拟退火算法[M].北京:科学出版社,1994.

• [7] 王 凌.智能优化算法及其应用[M].北京:清华大学出版社,2001.

• [8] NouraniY ,AndresenB.A comparison of simulated annealing cooling strategies[J].Journal ofPhysicsA:Mathematical andGener al,1998,41:8373-8385.

• [9] AliM,T rnA,ViitanenS.A direct search simulated annealing algorithm for optimization involving continuous variables[EB/OL].http://www.tucs.fi/publications/techreports/TR97.php,1997.

• [10] WahB W,ChangY-J.Trace-based methods for solving nonlinear global optimization and satisfiability problems[J].Journal ofGlobalOptimization,1997,10(2):107-141.

• [11] VaranelliJ M,CohoonJ P.A two-stage simulated annealing methodology[A].5thGreatLakesSymposium onVLSI[C].USA:Buffalo,1995.50-53.

• [12] VaranelliJ M.On theAcceleration of simulated annealing[D].USA:University ofVirginia,1996.

• [13] DiekmannR,LülingR,SimonJ.Problem independent distributed simulated annealing and its applications[EB/OL]. http://citese er.nj.nec.com/diekmann93problem.html,1993.

• [14] 刘 勇,康立山,陈毓屏.非数值并行算法-遗传算法[M].北京:科学出版社,1995.

• [15] WinstonP H.Artificial intelligence[M].NewYork:Addison-Wesley,1984.

• [16] CollinsG E,LoosR.Real zeros of polynomials[J].ComputingSupple-mentum,1982,(4):83-94.

• [17] CollinsG E,JohnsonJ R,KrandickW.Interval arithmetic in cylindrical algebraic decomposition[J].Journal ofSymbolicComputa tion,2002,34:145-157.

• [18] YangL.Recent advances in automated theorem proving on inequalities[J].ComputSci&Technol,1999,14(5):435-446.

• [19] YangL,XiaS H.An inequality-proving program applied to global optimization[A].Proceeding of theAsianTechnologyConfer ence inMathematics2000[C].Blacksburg:ATCM Inc,2000.40-51.

• [20] 杨 路.全局优化的符号算法与有限核原理[A].林东岱.数学与数学机械化[C].山东:山东教育出版社,2001.210-220.

• [21] HanzonB,JibeteanD.Global minimization of a multivariate polynomial using matrix methods[J].Journal ofGlobalOptimization,2003,(27):1-31.

• [22] GranvilliersL.A symbolic-numerical branch and prune algorithm for solving non-linear polynomial systems[J].Journal ofUniver salComputerScience,1998,4(2):125-146.

• [23] CsendesT.Numerical experiences with a new generalized subinterval selection criterion for interval global optimization[J].ReliableComputing,2003,(9):109-125.

• [24] SharyS P.A surprising approach in interval global optimization[J].ReliableComputing,2001,(7):497-505.