A Parallel Interval Computation Model with Alternative Message Passing

In this paper, we propose a decentralized parallel computation model for global optimization using interval analysis. The model is adaptive to any number of processors and there is no need to design an initial decomposition scheme to feed each processor at the beginning. The work load is distributed evenly among all processors by alternative message passing. Numerical experiments indicate that the model works well and is stable with different number of parallel processors, distributes the load evenly among the processors, and provides an impressive speedup, especially when the problem is time-consuming to solve.