An improved algorithm for solving biobjective integer programs

A parametric algorithm for identifying the Pareto set of a biobjective integer program is proposed. The algorithm is based on the weighted Chebyshev (Tchebycheff) scalarization, and its running time is asymptotically optimal. A number of extensions are described, including: a technique for handling weakly dominated outcomes, a Pareto set approximation scheme, and an interactive version that provides access to all Pareto outcomes. Extensive computational tests on instances of the biobjective knapsack problem and a capacitated network routing problem are presented.

[1]  Gabriel R. Bitran,et al.  Theory and algorithms for linear multiple objective programs with zero–one variables , 1979, Math. Program..

[2]  K. Bhaskar.  A Multiple Objective Approach to Capital Budgeting , 1979 .

[3]  Kathrin Klamroth,et al.  Unbiased approximation in multicriteria optimization , 2003, Math. Methods Oper. Res..

[4]  Mark H. Karwan,et al.  Multicriteria dynamic programming with an application to the integer case , 1982 .

[5]  Edward L. Hannan,et al.  An algorithm for the multiple objective integer linear programming problem , 1982 .

[6]  D. Schweigert,et al.  Three algorithms for bicriteria integer linear programs , 1994 .

[7]  Kathrin Klamroth,et al.  Norm-Based Approximation in Bicriteria Programming , 2001, Comput. Optim. Appl..

[8]  Ignacy Kaliszewski.  Using trade-off information in decision-making algorithms , 2000, Comput. Oper. Res..

[9]  H. Moskowitz,et al.  Algorithms for nonlinear integer bicriterion problems , 1989 .

[10]  S. Zionts,et al.  Preference structure representation using convex cones in multicriteria integer programming , 1989 .

[11]  Michael M. Kostreva,et al.  A method for approximating solutions Of multicriterial nonlinear Optimization problems , 1995 .

[12]  S. Ruzika,et al.  Approximation Methods in Multiobjective Programming , 2005 .

[13]  W. Shin,et al.  An interactive paired comparison method for bicriterion integer programming , 1994 .

[14]  Stanley Zionts,et al.  An interactive method for bicriteria integer programming , 1990, IEEE Trans. Syst. Man Cybern..

[15]  João C. N. Clímaco,et al.  An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound , 2000, Eur. J. Oper. Res..

[16]  P. S. Pulat,et al.  Bicriteria network flow problems: Integer case , 1993 .

[17]  George Mavrotas,et al.  A branch and bound algorithm for mixed zero-one multiple objective linear programming , 1998, Eur. J. Oper. Res..

[18]  Antonio Sedeño-Noda,et al.  An algorithm for the biobjective integer minimum cost flow problem , 2001, Comput. Oper. Res..

[19]  João C. N. Clímaco,et al.  Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems , 1999, Eur. J. Oper. Res..

[20]  A. M. Geoffrion.  Proper efficiency and the theory of vector maximization , 1968 .

[21]  Xavier Gandibleux,et al.  A survey and annotated bibliography of multiobjective combinatorial optimization , 2000, OR Spectr..

[22]  Francis J. Vasko,et al.  The cable trench problem: combining the shortest path and minimum spanning tree problems , 2002, Comput. Oper. Res..

[23]  Stanley Zionts,et al.  Interactive Bicriteria Integer Programming: A Performance Analysis , 1991 .

[24]  Y. Aksoy.  An interactive branch‐and‐bound algorithm for bicriterion nonconvex/mixed integer programming , 1990 .

[25]  Ralph E. Steuer,et al.  An interactive weighted Tchebycheff procedure for multiple objective programming , 1983, Math. Program..

[26]  Bernardo Villarreal,et al.  Multicriteria integer programming: A (hybrid) dynamic programming recursive approach , 1981, Math. Program..

[27]  Xavier Gandibleux,et al.  Multiobjective Combinatorial Optimization — Theory, Methodology, and Applications , 2003 .

[28]  Ignacy Kaliszewski,et al.  Dynamic parametric bounds on efficient outcomes in interactive multiple criteria decision making problems , 2003, Eur. J. Oper. Res..

[29]  Matthias Ehrgott,et al.  Multiple criteria decision analysis: state of the art surveys , 2005 .

[30]  V. Bowman.  On the Relationship of the Tchebycheff Norm and the Efficient Frontier of Multiple-Criteria Objectives , 1976 .

[31]  J. Wallenius,et al.  A reference direction approach to multiple objective integer linear programming , 1995 .

[32]  Shirley Dex,et al.  JR 旅客販売総合システム（マルス）における運用及び管理について , 1991 .

[33]  Ted K. Ralphs.  The SYMPHONY Callable Library for Mixed-Integer Linear Programming , 2005 .

[34]  Gabriel R. Bitran,et al.  Linear multiple objective programs with zero–one variables , 1977, Math. Program..

[35]  Rajendra S. Solanki,et al.  Generating the noninferior set in mixed integer biobjective linear programs: An application to a location problem , 1991, Comput. Oper. Res..

[36]  Juhani Koski,et al.  Multicriterion optimization of composite laminates for maximum failure margins with an interactive descent algorithm , 2002 .

[37]  Subhash C. Narula,et al.  An interactive algorithm for solving multiple objective integer linear programming problems , 1994 .

[38]  R. S. Laundy,et al.  Multiple Criteria Optimisation: Theory, Computation and Application , 1989 .

[39]  João C. N. Clímaco,et al.  Multicriteria Integer Programming: An Overview of the Different Algorithmic Approaches , 1997 .

[40]  D. J. Elzinga,et al.  An algorithm for the bi-criterion integer programming problem , 1986 .

[41]  Subhash C. Narula,et al.  An interactive procedure for multiple objective integer linear programming problems , 1993 .

[42]  Scott Henderson,et al.  Does Accounting Research Matter , 1978 .

[43]  W. Michalowski,et al.  Efficient Solutions and Bounds on Tradeoffs , 1997 .