Distributed localized bi-objective search.

European Journal of Operational Research(2014)

引用 2|浏览7
暂无评分
摘要
•A new distributed heuristic approach is designed for approximating the Pareto set of bi-objective optimization problems (DLBS).•DLBS is based on parallel cooperative computation, objective space decomposition, and adaptive search.•DLBS is studied, experimented, and deployed on a cluster of hundreds of core.•The DLBS efficiency is measured in terms of approximation quality, computational time and scalability.
更多
查看译文
关键词
Multiple objective programming,Combinatorial optimization,Parallel and distributed computing,Evolutionary computation
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要