arXiv cs.NE
· Papers
Variable Search Stepsize for Randomized Local Search in Multi-Objective Combinatorial Optimization
arXiv:2602.05675v2 Announce Type: replace Abstract: Over the past two decades, research in evolutionary multi-objective optimization has predominantly focused on continuous domains, with comparatively limited attention given to multi-objective combinatorial optimization problems (MOCOPs). Combinatorial problems differ