Representation of the non-dominated set in biobjective discrete optimization

This paper introduces several algorithms for finding a representative subset of the non-dominated point set of a biobjective discrete optimization problem with respect to uniformity, coverage and the ?-indicator. We consider the representation problem itself as multiobjective, trying to find a good compromise between these quality measures. These representation problems are formulated as particular facility location problems with a special location structure, which allows for polynomial-time algorithms in the biobjective case based on the principles of dynamic programming and threshold approaches. In addition, we show that several multiobjective variants of these representation problems are also solvable in polynomial time. Computational results obtained by these approaches on a wide range of randomly generated point sets are presented and discussed. HighlightsWe formulate the representation problem in two dimensions for three different measures: uniformity, coverage, and ?-indicator.We present algorithms that solve the representation problems for the three measures in polynomial time.We consider multiobjective variants of representation problems, and present polynomial time algorithms to solve them.We present and discuss experimental results for all the problems.

[1]  Serpil Sayin,et al.  Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming , 2000, Math. Program..

[2]  René Beier,et al.  Random knapsack in expected polynomial time , 2003, STOC '03.

[3]  O. Kariv,et al.  An Algorithmic Approach to Network Location Problems. I: The p-Centers , 1979 .

[4]  Alejandro Crema,et al.  A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs , 2007, Eur. J. Oper. Res..

[5]  Anita Schöbel,et al.  Locating Stops Along Bus or Railway Lines—A Bicriteria Problem , 2005, Ann. Oper. Res..

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

[7]  Karl Bringmann,et al.  Two-dimensional subset selection for hypervolume and epsilon-indicator , 2014, GECCO.

[8]  Margaret M. Wiecek,et al.  A Survey of Approximation Methods in Multiobjective Programming , 2003 .

[9]  Refael Hassin,et al.  Improved complexity bounds for location problems on the real line , 1991, Oper. Res. Lett..

[10]  Johannes Bader,et al.  Hypervolume-based search for multiobjective optimization: Theory and methods , 2010 .

[11]  S. L. HAKIMIt.  AN ALGORITHMIC APPROACH TO NETWORK LOCATION PROBLEMS. , 1979 .

[12]  Matthias Ehrgott,et al.  On finding representative non-dominated points for bi-objective integer network flow problems , 2014, Comput. Oper. Res..

[13]  O. Kariv,et al.  An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .

[14]  Stacey L. Faulkenberg,et al.  On the quality of discrete representations in multiple objective programming , 2010 .

[15]  S. S. Ravi,et al.  Facility Dispersion Problems: Heuristics and Special Cases (Extended Abstract) , 1991, WADS.

[16]  H. P. Benson,et al.  Towards finding global representations of the efficient set in multiple objective mathematical programming , 1997 .

[17]  Mihalis Yannakakis,et al.  On the approximability of trade-offs and optimal access of Web sources , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[18]  Marco Laumanns,et al.  Performance assessment of multiobjective optimizers: an analysis and review , 2003, IEEE Trans. Evol. Comput..

[19]  Marco Laumanns,et al.  Performance assessment of multiobjective optimizers , 2002 .

[20]  Luís Paquete,et al.  A note on the ϵ-indicator subset selection , 2013, Theor. Comput. Sci..

[21]  Luís Paquete,et al.  On Beam Search for Multicriteria Combinatorial Optimization Problems , 2012, CPAIOR.

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

[23]  D. W. Wang,et al.  A Study on Two Geometric Location Problems , 1988, Information Processing Letters.