Abstract
Branch and bound algorithms are general purpose intelligent enumeration techniques for solving combinatorial optimization problems. It is considered to be well suited to parallel processing. Typically, an application of parallel processing cannot enlarge the solvable size of combinatorial optimization problems. However, parallel branch and bound algorithms can achieve super-linear speedup versus increasing processing elements. In this case, a problem of larger size can be solved in a practical amount of computing time.In this paper, we propose the hybrid selection rule for parallel branch and bond algorithms. Typical selection rules for sequential branch and bound algorithms can be naturally enhanced to parallel one. Using six networked workstations, experimental effectiveness comparisons among several selection rules are presented. The results show that the hybrid selection rule leads to super-linear speedup.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Transactions of the Society of Instrument and Control Engineers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
