A review of interactive methods for multiobjective integer and mixed-integer programming

This paper makes a review of interactive methods devoted to multiobjective integer and mixed-integer programming (MOIP/MOMIP) problems. The basic concepts concerning the characterization of the non-dominated solution set are first introduced, followed by a remark about non-interactive methods vs. interactive methods. Then, we focus on interactive MOIP/MOMIP methods, including their characterization according to the type of preference information required from the decision maker, the computing process used to determine non-dominated solutions and the interactive protocol used to communicate with the decision maker. We try to draw out some contrasts and similarities of the different types of methods.

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

[2]  G. W. Evans,et al.  An Overview of Techniques for Solving Multiobjective Mathematical Programs , 1984 .

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

[4]  B. Roy.  Meaning and validity of interactive procedures as tools for decision making , 1987 .

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

[6]  J. M. Rivera,et al.  A combined approach to solve binary multicriteria problems , 1982 .

[7]  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..

[8]  Richard F. Deckro,et al.  Solving zero-one multiple objective programs through implicit enumeration , 1983 .

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

[10]  D. J. White,et al.  A multiple objective interactive Lagrangean relaxation approach , 1985 .

[11]  G. Kiziltan,et al.  An Algorithm for Multiobjective Zero-One Linear Programming , 1983 .

[12]  Alejandro Crema,et al.  A method for finding the set of non-dominated vectors for multiple objective integer linear programs , 2004, Eur. J. Oper. Res..

[13]  Pekka Korhonen,et al.  A pareto race , 1988 .

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

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

[16]  João C. N. Clímaco,et al.  An Interactive Method for 0-1 Multiobjective Problems Using Simulated Annealing and Tabu Search , 2000, J. Heuristics.

[17]  S. Zionts,et al.  A class of practical interactive branch and bound algorithms for multicriteria integer programming , 1986 .

[18]  A. Wierzbicki.  A Mathematical Basis for Satisficing Decision Making , 1982 .

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

[20]  A. Wierzbicki.  On the completeness and constructiveness of parametric characterizations to vector optimization problems , 1986 .

[21]  Stanley Zionts,et al.  An Interactive Branch and Bound Procedure for Multicriterion Integer Linear Programming , 1980 .

[22]  L. M. Rasmussen.  Zero--one programming with multiple criteria , 1986 .

[23]  Vassil Vassilev,et al.  A Reference Direction Algorithm for Solving Multiple Objective Integer Linear Programming Problems , 1993 .

[24]  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..

[25]  Lori S. Franz,et al.  An Interactive Procedure for Solving Multiple Objective Integer Linear Programming Problems , 1985 .

[26]  R. Soland,et al.  An interactive branch-and-bound algorithm for multiple criteria optimization , 1986 .

[27]  R. Soland.  MULTICRITERIA OPTIMIZATION: A GENERAL CHARACTERIZATION OF EFFICIENT SOLUTIONS* , 1979 .

[28]  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..

[29]  S. Zionts,et al.  An Interactive Multiple Objective Linear Programming Method for a Class of Underlying Nonlinear Utility Functions , 1983 .

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

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

[32]  R. Soland,et al.  An interactive combined branch-and-bound/tchebycheff algorithm for multiple criteria optimization , 1989 .

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

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

[35]  D. J. White,et al.  A branch and bound method for multi-objective boolean problems , 1984 .

[36]  Masatoshi Sakawa,et al.  An interactive fuzzy satisficing method for multiobjective integer programming problems through genetic algorithms , 1998, KES.

[37]  Masatoshi Sakawa,et al.  An interactive fuzzy satisficing method for large scale multiobjective 0-1 programming problems with fuzzy parameters through genetic algorithms , 1998, Eur. J. Oper. Res..

[38]  R. Benayoun,et al.  Linear programming with multiple objective functions: Step method (stem) , 1971, Math. Program..

[39]  Panos M. Pardalos,et al.  Encyclopedia of Optimization , 2006 .

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

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

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

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

[44]  Michael J. Magazine,et al.  An Interactive Heuristic Approach for Multi-Objective Integer-Programming Problems , 1986 .

[45]  José Craveirinha,et al.  Multicriteria Analysis in Telecommunication Network Planning and Design — Problems and Issues , 2005 .

[46]  Bernardo Villarreal,et al.  An Improved Interactive Multicriteria Integer Programming Algorithm , 1985 .

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

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

[49]  Ralph E. Steuer,et al.  A combined Tchebycheff/aspiration criterion vector interactive multiobjective programming procedure , 1993 .

[50]  P. L. Kunsch,et al.  Interactive Methods for Multi-Objective Integer Linear Programming , 1986 .

[51]  H. Kunzi,et al.  Lectu re Notes in Economics and Mathematical Systems , 1975 .