A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method

doi:10.1287/ijoc.2015.0657

A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method

2015-11-01

0

PRE

AI

DOI：10.1287/ijoc.2015.0657

原文链接

原文求助

摘要

En 中文

We present a new criterion space search algorithm, the balanced box method, for finding all nondominated points of a biobjective integer program. The method extends the box algorithm, is easy to implement, and converges quickly to the complete set of nondominated points. Because the method maintains, at any point in time, a diverse set of nondominated points, it is ideally suited for fast approximation of the efficient frontier. In addition, we present several enhancements of the well-known ε-constraint, augmented weighted Tchebycheff, and perpendicular search methods. An extensive computational study, using instances from different classes of combinatorial optimization problems, demonstrates the efficacy of the balanced box method.

A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method

摘要

AI总结

期刊

机构

引用论文