A New Reliable Hybrid Algorithm for Shortening the Expanding Range of Interval

In this paper, we investigate the interval mathematics and branch and bound strategy. Facing the problems of interval mathematics, we propose a new parallel hybrid global optimization algorithm to reduce the amount of computation, spend less computing time and reduce the share of memory. The new algorithm firstly utilizes the heuristic selection to reduce the share of memory, then uses the particle swarm strategy to confine the thresholds of the amounts of computation. the algorithm adopts the parallel method to spend less computing time. Therefore, Contrasting with some traditional global optimization algorithms, our algorithm can reduce the time complexity and space complexity effectively in the case of guaranteeing the reliability of the result interval.