计算机应用与软件Issue(2)：203-207,258,6.DOI:10.3969/j.issn.1000-386x.2016.02.048
基于双字符搜索的 GRASP-CSP 算法改进
IMPROVEMENT OF GRASP-CSP ALGORITHM BASED ON DOUBLE CHARACTER SEARCH
摘要
Abstract
The closest string problem (CSP)is a combinatorial optimisation problem.It has very important applications in bioinformatics and coding theory.For this problem,we use a probability heuristic-based algorithm,i.e.GRASP-CSP.It has three problems:relatively independent in every iteration process,narrow search range,and single judgment indicator.In light of these,we propose to further optimise GRASP-CSP by enforcing strategy and introducing strong Pareto optimisation concept,in particular,expanding the local search scope. Finally,we give an improved GRASP-CSP-based new algorithm,namely IGRASP-CSP.Experimental results indicate that the improved algorithm is able to further shorten the Hamming distance between character solution and given string set,so that obtains further optimised solution in regard to CSP problem,achieves satisfactory optimisation results,and expands from one dimension to multi-dimension.关键词
CSP/GRASP/Pareto 优化/强化策略/双字符Key words
CSP/GRASP/Pareto optimisation/Enforcing strategy/Double character分类
信息技术与安全科学引用本文复制引用
李珊珊,郑晨,朱平..基于双字符搜索的 GRASP-CSP 算法改进[J].计算机应用与软件,2016,(2):203-207,258,6.基金项目
国家自然科学基金项目（11271163）。 （）
