Abstract
Multi-level network optimization (MLNO) problems arise in many contexts such as telecommunication, transportation, or electric power systems. This paper is mainly concerned with parallel implementations of the classical branch-and-bound algorithm for multi-level network design. A model for such a problem is presented and formulated as a mixed-integer program. The formulation is appealing because it integrates in the same model aspects of discrete facility location, topological network design, and dimensioning. We propose implementations that are suitable for multiple instruction stream, multiple data stream (MIMD) parallel computation systems. Thus, the implementations are very convenient for use in networks of workstations, which nowadays has become so popular. We have tested two versions of the branch-and-bound algorithm as well as different load balancing strategies. The results are very encouraging indicating a gain over sequential computations in terms of execution time.
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.
