Abstract
The search region in multiobjective optimization problems is a part of the objective space where nondominated points could lie. It plays an important role in the generation of the nondominated set of multiobjective combinatorial optimization (MOCO) problems. In this paper, we establish the representation of the search region by half-open polyblocks (a variant concept of “polyblock” in monotonic optimization) and propose a new procedure for updating the search region. We also study the impact of stack policies to the new procedure and the existing methods that update the search region. Stack policies are then analyzed, pointing out their performance effectiveness by means of the results of rich computational experiments on finding the whole set of nondominated points of MOCO problems.
Similar content being viewed by others
Notes
N is a nonempty and stable set of points in general position i.e., for all \(z, z'\in N, z\ne z',\) we have \(z_i\ne z'_i\) for all \(i=1,\ldots ,m,\) see Dächert et al. (2017) for more details.
We use the phrase “the “raw” updating procedure” to mean the application of this procedure for a set of randomly generated points as implemented in Klamroth et al. (2015).
References
Björnson E, Zheng G, Ottersten B (2012) Robust monotonic optimization framework for multicell MISO systems. IEEE Trans Signal Process 60:2508–2523
Dächert K, Klamroth K (2015) A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems. J Glob Optim 61:643–676
Dächert K, Klamroth K, Lacour R, Vanderpooten D (2017) Efficient computation of the search region in multi-objective optimization. Eur J Oper Res 160:841–855
Ehrgott M (2005) Multicriteria optimization. Springer, Berlin
Feng B, Fan ZP, Li Y (2011) A decision method for supplier selection in multi-service outsourcing. Int J Prod Econ 132:240–250
Hoai PT, Tuy H (2018) Monotonic optimization for sensor cover energy problem. Optim Lett 12:1569–1587. https://doi.org/10.1007/s11590-017-1219-5
Jorswieck EA, Larkson EG (2010) Monotonic optimization framework for the two-user MISO interference channel. IEEE Trans Signal Proces 58:2159–2168
Kim SY, Kwon JA, Lee JW (2015) Sum-rate maximization for multicell OFDMA systems. IEEE Trans Veh Technol 64:4158–4169
Kirlik G, Sayın S (2014) A new algorithm for generating all nondominated points of multiobjective discrete optimization problems. Eur J Oper Res 232:479–488
Klamroth K, Lacour R, Vanderpooten D (2015) On the representation of the search region in multi-objective optimization. Eur J Oper Res 245:767–778
Phuong NTH, Tuy H (2003) A unified monotonic approach to generalized linear fractional programming. J Glob Optim 26:226–259
Przybylski A, Gandibleuc X, Ehrgott M (2009) A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives. Discrete Optim 7:149–165
Qian LP, Zhang YJ (2010) S-MAPEL: monotonic optimization for non-Convex joint power control and scheduling problems. IEEE Trans Wirel Commun 9:1078–1719
Qian LP, Zhang YJ, Huang J (2009) MAPEL: achieving global optimality for a non-convex wireless power control problem. IEEE Trans Wirel Commun 8:1553–1563
Tuan HD, Son TT, Tuy H, Khoa PT (2013) Monotonic optimization based decoding for linear codes. J Glob Optim 55:301–312
Tuy H (1999) Normal sets, polyblocks, and monotonic optimization. Vietnam J Math 27:277–300
Tuy H (2000) Monotonic optimization: problems and solution approaches. SIAM J Optim 11:464–494
Tuy H, Minoux M, Phuong NTH (2006) Discrete monotonic optimization with application to a discrete location problem. SIAM J Optim 17:78–97
Acknowledgements
We would like to thank the editors and anonymous referees for their useful comments which helped us to improve the paper greatly.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
This research is funded by Hanoi University of Science and Technology (HUST) under project number T2018-PC-119.
Rights and permissions
About this article
Cite this article
Hoai, P.T., Le Thi, H.A. & Nam, N.C. Half-open polyblock for the representation of the search region in multiobjective optimization problems: its application and computational aspects. 4OR-Q J Oper Res 19, 41–70 (2021). https://doi.org/10.1007/s10288-020-00430-5
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10288-020-00430-5
Keywords
- Multiobjective programming
- Multiobjective discrete programming
- Monotonic optimization
- Weighted sum scalarization
- \(\varepsilon \)-constraint method
- Multi-service outsourcing problem
- Multiobjective knapsack problem
- Multiobjective assignment problem