AN ADAPTIVE MEMBRANE ALGORITHM FOR SOLVING COMBINATORIAL OPTIMIZATION PROBLEMS

在线阅读 下载PDF 导出详情
摘要 Membranealgorithms(MAs),whichinheritfromPsystems,constituteanewparallelanddistributeframeworkforapproximatecomputation.Inthepaper,amembranealgorithmisproposedwiththeimprovementthattheinvolvedparameterscanbeadaptivelychosen.Inthealgorithm,somemembranescanevolvedynamicallyduringthecomputingprocesstospecifythevaluesoftherequestedparameters.Thenewalgorithmistestedonawell-knowncombinatorialoptimizationproblem,thetravellingsalesmanproblem.Theempiricalevidencesuggeststhattheproposedapproachisefficientandreliablewhendealingwith11benchmarkinstances,particularlyobtainingthebestoftheknownsolutionsineightinstances.Comparedwiththegeneticalgorithm,simulatedannealingalgorithm,neuralnetworkandafine-tunednon-adaptivemembranealgorithm,ouralgorithmperformsbetterthanthem.Inpractice,todesigntheairlinenetworkthatminimizethetotalroutingcostontheCABdatawithtwenty-fiveUScities,wecanquicklyobtainhighqualitysolutionsusingouralgorithm.
机构地区 不详
出版日期 2014年05月15日(中国期刊网平台首次上网日期,不代表论文的发表时间)