The Logarithmic Random Bidding for the Parallel Roulette Wheel Selection with Precise Probabilities

The roulette wheel selection is a critical process in heuristic algorithms,enabling the probabilistic choice of items based on assigned fitness values. Itselects an item with a probability proportional to its fitness value. Thistechnique is commonly employed in ant-colony algorithms to randomly determinethe next city to visit when solving the traveling salesman problem. Our studyfocuses on parallel algorithms designed to select one of multiple processors,each associated with fitness values, using random wheel selection. We propose anovel approach called logarithmic random bidding, which achieves an expectedruntime logarithmic to the number of processors with non-zero fitness values,using the CRCW-PRAM model with a shared memory of constant size. Notably, thelogarithmic random bidding technique demonstrates efficient performance,particularly in scenarios where only a few processors are assigned non-zerofitness values.