A criterion space search algorithm for biobjective integer programming: the balanced box method

Title: A criterion space search algorithm for biobjective integer programming: the balanced box method
Creator: Boland, Natashia; Charkhgard, Hadi; Savelsbergh, Martin
Relation: INFORMS Journal on Computing Vol. 27, Issue 4, p. 735-754
Publisher Link: http://dx.doi.org/10.1287/ijoc.2015.0657
Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
Resource Type: journal article
Date: 2015
Description: 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.
Subject: biobjective integer programming; criterion space search algorithm; balanced box method
Identifier: http://hdl.handle.net/1959.13/1313369
Identifier: uon:22582
Identifier: ISSN:1091-9856
Language: eng
Reviewed

		Thumbnail	File	Description	Size	Format