On parallel implementation of a discrete optimization random search algorithm

TL;DR

This paper discusses the design and implementation of a parallel version of a discrete optimization random search algorithm, analyzing its performance and effectiveness on test problems.

Contribution

It introduces a parallel implementation of a discrete optimization random search algorithm and evaluates its performance compared to the serial version.

Findings

Parallel implementation improves computational efficiency

Performance analysis shows scalability of the algorithm

Test results demonstrate effectiveness on discrete problems

Abstract

A random search algorithm intended to solve discrete optimization problems is considered. We outline the main components of the algorithm, and then describe it in more detail. We show how the algorithm can be implemented on parallel computer systems. A performance analysis of both serial and parallel versions of the algorithm is given, and related results of solving test problems are discussed.