FCL was forked in 2015, creating a new project called HPP-FCL. Since then, a large part of the code has been rewritten or removed (unused and untested code), and new features have been introduced (see ...
Abstract: The Traveling Salesman Problem (TSP) is a widely studied NP-complete optimization challenge with significant theoretical and practical implications. This study proposes a hybrid ...
Abstract: When dealing with expensive multiobjective optimization problems, majority of existing surrogate-assisted evolutionary algorithms (SAEAs) generate solutions in decision space and screen ...