返回
Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems
DOI:10.1016/j.ejor.2015.01.035.png)
摘要
En 中文
The paper deals with the definition and the computation of surrogate upper bound sets for the bi-objective bi-dimensional binary knapsack problem. It introduces the Optimal Convex Surrogate Upper Bound set, which is the tightest possible definition based on the convex relaxation of the surrogate relaxation. Two exact algorithms are proposed: an enumerative algorithm and its improved version. This second algorithm results from an accurate analysis of the surrogate multipliers and the dominance relations between bound sets. Based on the improved exact algorithm, an approximated version is derived. The proposed algorithms are benchmarked using a dataset composed of three groups of numerical instances. The performances are assessed thanks to a comparative analysis where exact algorithms are compared between them, the approximated algorithm is confronted to an algorithm introduced in a recent research work. (C) 2015 Elsevier B.V. All rights reserved.
Keyword:
Combinatorial optimization
Multiple objective programming
Bi-dimensional binary knapsack problem
Surrogate relaxation
Bound sets
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach多目标进化算法: 比较案例研究和强度帕累托方法
AN EXACT SEARCH FOR THE SOLUTION OF THE SURROGATE DUAL OF THE 0-1 BIDIMENSIONAL KNAPSACK-PROBLEM0-1二维背包问题的代理对偶解的精确搜索
Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms使用数学编程和进化算法解决多目标,多约束背包问题

