Anytime algorithms allow a practitioner to trade-off runtime for solution quality. This is of particular interest in multiob-jective optimization since it might be infeasible to identify the Pareto set in a reasonable amount of time. We present a theoretical model to characterize the trade-off between solution quality, in terms of relative hypervolume, and runtime for exact anytime algorithms for biobjective optimization problems. Our model works under some basic assumptions, such as, Pareto optimal solutions are collected sequentially and the Pareto front can be well approximated by a quadrant of a particular superellipse. We validate our model against an anytime algorithm based on the E-constraint approach for the biobjective unconstrained knapsack problem.

Topics
Optimization algorithms, Optimization problems
1.
M.
 
Ehrgott
,
Multicriteria Optimization
(
Springer Verlag
,
2000
).
Google Scholar
Crossref
Search ADS
 
2.
S.
 
Sayin
,
Operations Research
 
51
,
427
–
436
(
2003
).
https://doi.org/10.1287/opre.51.3.427.14951
Google Scholar
Crossref
Search ADS
 
3.
T. L.
 
Dean
 and
M. S.
 
Boddy
, “
An analysis of time-dependent planning
,” in
Proceedings of the 7th National Conference on Artificial Intelligence
(
AAAI Press
,
1988
), pp.
49
–
54
.
Google Scholar
 
4.
E.
 
Zitzler
,
L.
 
Thiele
,
M.
 
Laumanns
,
C. M.
 
Fonseca
, and
V. G.
 
da Fonseca
,
IEEE Transactions on Evolutionary Computation
 
7
,
117
–
132
(
2003
).
https://doi.org/10.1109/TEVC.2003.810758
Google Scholar
Crossref
Search ADS
 
5.
E.
 
Zitzler
 and
L.
 
Thiele
, “Multiobjective optimization using evolutionary algorithms — a comparative case study,” in
Proceedings of the 5th International Conference on PPSN
(
Springer
,
1998
), pp.
292
–
301
.
Google Scholar
 
6.
I.
 
Loshchilov
 and
T.
 
Glasmachers
, “Anytime bi-objective optimization with a hybrid multi-objective CMA-ES (HMO-CMA-ES),” in
Proceedings of the 2016 GECCO Companion
(
ACM
,
2016
), pp.
1169
–
1176
.
Google Scholar
Crossref
Search ADS
 
7.
J.
 
Dubois-Lacoste
,
M.
 
López-Ibáñez
, and
T.
 
Stützle
,
European Journal of Operational Research
 
243
,
369
–
385
(
2015
).
https://doi.org/10.1016/j.ejor.2014.10.062
Google Scholar
Crossref
Search ADS
 
8.
T.
 
Ulrich
 and
L.
 
Thiele
, “
Bounding the effectiveness of hypervolume-based (µ + λ)-archiving algorithms
,” in
Proceedings of the 6th International Conference on LION
(
Springer
,
2012
), pp.
235
–
249
.
Google Scholar
Crossref
Search ADS
 
9.
G. L.
 
Nemhauser
,
L. A.
 
Wolsey
, and
M. L.
 
Fisher
,
Mathematical Programming
 
14
,
265
–
294
(
1978
).
https://doi.org/10.1007/BF01588971
Google Scholar
Crossref
Search ADS
 
10.
M. T. M.
 
Emmerich
 and
A. H.
 
Deutz
, “Test problems based on lamé superspheres,” in
Proceedings of the 4th International Conference on EMO
(
Springer
,
2007
), pp.
922
–
936
.
Google Scholar
 
11.
G. L.
 
Nemhauser
 and
Z.
 
Ullman
,
Management Science
 
15
,
459
–
572
(
1969
).
https://doi.org/10.1287/mnsc.15.9.494
Google Scholar
Crossref
Search ADS
 
12.
M.
 
Gagliolo
 and
C.
 
Legrand
, “Algorithm survival analysis,” in
Experimental Methods for the Analysis of Optimization Algorithms
(
Springer
,
2010
), pp.
161
–
184
.
Google Scholar
Crossref
Search ADS
 
This content is only available via PDF.
© 2019 Author(s).
2019
Author(s)