<?xml version="1.0"?>
<metadata xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/"><dc:title>Constrained multi-objective optimization of simulated tree pruning with heterogeneous criteria</dc:title><dc:creator>Strnad,	Damjan	(Avtor)
	</dc:creator><dc:creator>Kohek,	Štefan	(Avtor)
	</dc:creator><dc:subject>multi-objective optimization</dc:subject><dc:subject>virtual tree pruning</dc:subject><dc:subject>heterogeneous objectives</dc:subject><dc:subject>constraint objectives</dc:subject><dc:subject>NSGA-II</dc:subject><dc:subject>SPEA2</dc:subject><dc:subject>EuMOEA/D-EAM</dc:subject><dc:description>Virtual pruning of simulated fruit tree models is a useful functionality provided by software tools for computer-aided horticultural education and research. It also enables algorithmic
pruning optimization with respect to a set of quantitative objectives, which is important for analytical
purposes and potential applications in automated pruning. However, the existing studies in pruning
optimization focus on a single type of objective, such as light distribution within the crown. In this
paper, we propose the use of heterogeneous objectives for discrete multi-objective optimization of
simulated tree pruning. In particular, the average light intake, crown shape, and tree balance are
used to observe the emergence of different pruning patterns in the non-dominated solution sets. We
also propose the use of independent constraint objectives as a new mechanism to confine overfitting
of solutions to individual pruning criteria. Finally, we perform the comparison of NSGA-II, SPEA2,
and MOEA/D-EAM on this task. The results demonstrate that SPEA2 and MOEA/D-EAM, which
use external solution archives, can produce better sets of non-dominated solutions than NSGA-II.</dc:description><dc:publisher>MDPI</dc:publisher><dc:date>2021</dc:date><dc:date>2025-06-19 09:20:26</dc:date><dc:type>Članek v reviji</dc:type><dc:identifier>93322</dc:identifier><dc:identifier>UDK: 004.5</dc:identifier><dc:identifier>COBISS_ID: 86459907</dc:identifier><dc:identifier>DOI: 10.3390/app112210781</dc:identifier><dc:identifier>ISSN pri članku: 2076-3417</dc:identifier><dc:language>sl</dc:language><dc:rights>© 2021 by the authors</dc:rights></metadata>
