A Parallel Branch and Bound Algorithm for Vehicle Routing Problem.

In Operation Research, Branch and Bound is one of the basic methods to solve Integer programming (IP) problems. According to dividing property of branch and bound, parallel algorithms for solving Integer Programming are common. In this paper, a new parallel branch and bound algorithm is proposed for muli-computers. This algorithm instead using of shared memory multi-processor environment, uses multi computers and dynamic load balancing. As well as reduce drastically the intercommunication between processes. This algorithm is implemented for well known Capacitated Vehicle Routing Problem (CVRP). In addition, our results are quite good comparing to other algorithms. [ABSTRACT FROM AUTHOR]