中国科学院重庆绿色智能技术研究院机构知识库

QQ客服 官方微博 反馈留言

	Solving Bi-objective unconstrained binary quadratic programming problem with multi-objective backbone guided search algorithm
	Xue, Li-Yuan1; Zeng, Rong-Qiang2,3; Wang, Yang4; Shang, Ming-Sheng5
	2016
摘要	This paper presents a multi-objective backbone guided search algorithm in order to optimize a bi-objective unconstrained binary quadratic programming problem. Our proposed algorithm consists of two main procedures which are hypervolume-based local search and backbone guided search. When the hypervolume-based local search procedure can not improve the Pareto approximation set any more, the backbone guided search procedure is applied for further improvements. Experimental results show that the proposed algorithm is very effective compared with the original multi-objective optimization algorithms. © Springer International Publishing Switzerland 2016.
语种	英语
DOI	10.1007/978-3-319-42294-7_66
会议(录)名称	12th International Conference on Intelligent Computing Theories and Application, ICIC 2016
页码	745-753
通讯作者	Zeng, Rong-Qiang (zrq@home.swjtu.edu.cn)
收录类别	EI
会议地点	Lanzhou, China
会议日期	August 2, 2016 - August 5, 2016