Abstract
Effectively parallelizing of branch-and-bound (BnB) solvers for mathematical programming problems with discrete variables in distributed computing environment is an important issue. Recently Everest web-based environment has been equipped with a generic message service. This improvement enables BnB-solvers to run in parallel and to exchange incumbents values. Thus Everest environment got generic application that parallelizes BnB-solvers (SCIP and COIN-OR CBC) in a rather simple way. Initially, the application was based on preliminary decomposition of feasible domain, e.g. by fixing values of some integer variables. In the current article further improvement of this Everest application is presented. It supports so called “concurrent parallelization” when all BnB-solvers work with the same optimization problem but with different settings defining search path in BnB-tree. Thus, running solvers have more chance to find incumbents, to exchange their values and to reduce BnB search. Preliminary testing of improved BnB-service on Traveling Salesman Problem shows noticeable 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 callDisclaimer: 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.
