Vector processing approach to constrained network problems
作者:
M. A. Venkataramana,
John J. Dinkel,
John Mote,
期刊:
Naval Research Logistics (NRL)
(WILEY Available online 1991)
卷期:
Volume 38,
issue 1
页码: 71-85
ISSN:0894-069X
年代: 1991
DOI:10.1002/1520-6750(199102)38:1<71::AID-NAV3220380108>3.0.CO;2-6
出版商: Wiley Subscription Services, Inc., A Wiley Company
数据来源: WILEY
摘要:
AbstractModification of algorithms designed for scalar computing, to take advantage of vector processing, raises several challenges. This article presents the vectorization of the primal simplex based network algorithm and results in a 50% improvement in computational time. One of the major contributors to this improvement is the matching of the size of the pricing candidate list to the vector register size. The side constraints are relaxed into a single surrogate constraint. The single constraint network algorithm is vectorized and used as the basis for solving large‐scale constrained network problems. Computational experiments are presented which illustrate the vectorization of the network code as well as the ability of the surrogate constraint approach to deal with large constrained network problem
点击下载:
PDF
(833KB)
返 回