A Parallel Shortest Augmenting Path Algorithm for the Assignment Problem

Abstract

A parallel version of the shortest augmenting path algorithm for the assignment problem 1s described. Although generating the initial dual solution and partial assignment in parallel does not require substantive changes in the sequential algorlthm, using several augmenting paths in parallel does require a new dual variable recalculation method. The parallel algorithm was tested on a 14-bit processor Butterfly Plus computer, on problems with up to 900 million variables. The speedup obtained increases with problem size. The algorlthm was also embedded mto a parallel branch and bound procedure for the traveling salesman problem on a directed graph. which was tested on the Butterfly Plus on problems involving up to 30,000 cities. © 1991, ACM. All rights reserved.