Parallel algorithms for a multi-level network optimization problem

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 pr...

Full description

Saved in:
Bibliographic Details
Published in:Parallel algorithms and applications Vol. 18; no. 3; pp. 121 - 137
Main Authors: Cruz, F.R.B., Mateus†, G.R.
Format: Journal Article
Language:English
Published: Taylor & Francis Group 01.09.2003
Subjects:
G. 1.6. [Numerical Analysis]: Optimization-integer programming
G.2.2. [Discrete Mathematics]: Graph Theory-network problems
G.4.[Mathematics of Computing]: Mathematical Software-parallel and vector implementation
Load balancing
Network design problems
Network optimization
Parallel branch-and-bound
Parallel computing
ISSN:1063-7192
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1063-7192
DOI:10.1080/10637190310001603630