Bi-objective integer programming analysis based on the characteristic equation

Abstract In this paper, a bi-objective integer programming problem is analysed using the characteristic equation that was developed to solve a single-objective pure integer program. This equation can also provides other ranked solutions i.e. 2nd, 3rd,... best solutions. These solutions are potential non-dominated points for a bi-objective integer program, which is being investigated in this paper. A “C” code is developed to solve the characteristic equation, a tool which is not available in the IBM ILOG CPLEX library. Two versions of this algorithm are developed to identify the non-dominated points for the bi-objective integer programming problem. The second version improves on the first by reducing the number of search steps. Computational experiments are carried out with respect to the two algorithms developed in this paper and comparisons have also been carried out with one of the recently developed method, the balanced box method. These computational experiments indicate that the second version of the algorithm developed in this paper performed significantly better than the first version and out performed the balanced box method with respect to both CPU time and the number of iterations.

[1]  Thomas R. Stidsen,et al.  A Branch and Bound Algorithm for a Class of Biobjective Mixed Integer Programs , 2014, Manag. Sci..

[2]  Francis Sourd,et al.  Multi-objective branch and bound. Application to the bi-objective spanning tree problem , 2006 .

[3]  Horst W. Hamacher,et al.  Finding representative systems for discrete bicriterion optimization problems , 2007, Oper. Res. Lett..

[4]  Santosh Kumar,et al.  An Improved CPU Time in Triangle Splitting Method for Solving a Biobjective Mixed Integer Program , 2018 .

[5]  Jacques Renaud,et al.  An exact solution approach for multi-objective location-transportation problem for disaster response , 2014, Comput. Oper. Res..

[6]  M. Ehrgott,et al.  Improved ε-Constraint Method for Multiobjective Programming , 2008 .

[7]  Martin W. P. Savelsbergh,et al.  A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method , 2015, INFORMS J. Comput..

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

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

[10]  Matthias Ehrgott,et al.  A discussion of scalarization techniques for multiple objective integer programming , 2006, Ann. Oper. Res..

[11]  Yacov Y. Haimes,et al.  Multiobjective Decision Making: Theory and Methodology , 1983 .

[12]  Y. Aneja,et al.  BICRITERIA TRANSPORTATION PROBLEM , 1979 .

[13]  Michel Gendreau,et al.  An exact epsilon-constraint method for bi-objective combinatorial optimization problems: Application to the Traveling Salesman Problem with Profits , 2009, Eur. J. Oper. Res..

[14]  Anthony Przybylski,et al.  Multiple objective branch and bound for mixed 0-1 linear programming: Corrections and improvements for the biobjective case , 2013, Comput. Oper. Res..

[15]  Banu Soylu,et al.  An exact algorithm for biobjective mixed integer linear programming problems , 2016, Comput. Oper. Res..

[16]  Carlos Henggeler Antunes,et al.  Multiobjective Linear and Integer Programming , 2016 .