A bee colony optimization algorithm for efficient resource allocation in e-government systems

Purpose This paper proposes bee colony optimization (BCO) algorithm for efficient resource allocation in e-government systems. Design/methodology/approach Simulation experiments were conducted using a benchmark dataset consisting of 100 tasks and 20 resources. The primary aim was to minimize wastage of resources while maximizing their utilization. The effectiveness of the proposed BCO algorithm was evaluated by analysing metrics such as total resource utilization and allocation time. Findings The results demonstrated that the BCO algorithm outperformed the other four examined algorithms with an average resource utilization rate of 87.9%. Additionally, it exhibited the shortest average allocation time of 81.2 s, which indicates high efficiency in e-government resource allocation. Moreover, the algorithm showed stability and consistency as reflected by low standard deviations for both resource utilization and allocation time metrics. Practical implications Through the reduction of resource wastage and minimizing waiting times, this algorithm has the potential to boost citizen satisfaction and trust in government. As a result, there could be an increase in participation in e-government services. Originality/value The proposed BCO algorithm presents a promising approach for e-government resource allocation. Its ability to handle large-scale optimization problems with multiple objectives and constraints sets it apart from traditional algorithms.