具有精确概率的并行轮盘赌选择的对数随机竞价
The Logarithmic Random Bidding for the Parallel Roulette Wheel Selection with Precise Probabilities
AI总结:
针对并行处理器上的轮盘赌选择问题,提出对数随机竞价方法,在常数大小共享内存的 CRCW-PRAM 模型中实现随非零适应度处理器数对数增长的预期运行时间。
摘要:
轮盘赌选择是启发式算法中的一个关键过程,能够基于所分配的适应度值对项目进行概率选择。它以与项目适应度值成比例的概率选择该项目。该技术通常用于蚁群算法中,以便在求解旅行商问题时随机确定下一个要访问的城市。我们的研究聚焦于并行算法,这些算法旨在使用随机轮盘选择,从多个各自关联适应度值的处理器中选择一个。我们提出了一种称为对数随机竞价的新方法,该方法采用具有常数大小共享内存的 CRCW-PRAM 模型,实现了与具有非零适应度值的处理器数量呈对数关系的预期运行时间。值得注意的是,对数随机竞价技术展现出高效性能,尤其是在只有少数处理器被分配非零适应度值的场景中。
英文摘要:
The roulette wheel selection is a critical process in heuristic algorithms, enabling the probabilistic choice of items based on assigned fitness values. It selects an item with a probability proportional to its fitness value. This technique is commonly employed in ant-colony algorithms to randomly determine the next city to visit when solving the traveling salesman problem. Our study focuses on parallel algorithms designed to select one of multiple processors, each associated with fitness values, using random wheel selection. We propose a novel approach called logarithmic random bidding, which achieves an expected runtime logarithmic to the number of processors with non-zero fitness values, using the CRCW-PRAM model with a shared memory of constant size. Notably, the logarithmic random bidding technique demonstrates efficient performance, particularly in scenarios where only a few processors are assigned non-zero fitness values.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。