Abstract
This article presents a collaborative algorithmic framework that is effective for solving a multi-task optimization scenario where the evaluation of their objectives consists of two parts: The first part involves a common computationally heavy function, e.g., a numerical simulation, while the second part further evaluates the objective by performing additional, significantly less computationally-intensive calculations. The ideas behind the collaborative framework are (i) to solve all the optimization problems simultaneously and (ii) at each iteration, to perform a synchronous “collaborative” operation. This distinctive operation entails sharing the outcome of the heavy part between all search processes. The goal is to improve the performance of each individual process by taking advantage of the already-computed heavy part of solution candidates from other searches. Several problem sets are presented. With respect to solution quality, consistency, and convergence speed, we observe that our collaborative algorithms perform better than traditional optimization techniques. Information sharing is most actively exploited during early stages of optimization. Though the collaborative algorithms require additional computing time, the added cost is diminishing with increasing difference between the computational cost of the expensive and light parts.