Purpose

The human resource (HR) allocation problem is one of the critical dimensions of the project management process. Due to this nature of the problem, researchers are continually optimizing one or more critical scheduling and allocation challenges in different ways. This study aims to optimize two goals, increasing customer satisfaction and reducing costs using the imperialist competitive algorithm.

Design/methodology/approach

Cloud-based e-commerce applications are preferred to conventional systems because they can save money in many areas, including resource use, running expenses, capital costs, maintenance and operation costs. In web applications, its core functionality of performance enhancement and automated device recovery is important. HR knowledge, expertise and competencies are becoming increasingly valuable carriers for organizational competitive advantage. As a result, HR management is becoming more relevant, as it seeks to channel all of the workers’ energy into meeting the organizational strategic objectives. The allocation of resources to maximize benefit or minimize cost is known as the resource allocation problem. Since discovering solutions in polynomial time is complicated, HR allocation in cloud-based e-commerce is an Nondeterministic Polynomial time (NP)-hard problem. In this paper, to promote the respective strengths and minimize the weaknesses, the imperialist competitive algorithm is suggested to solve these issues. The imperialist competitive algorithm is tested by comparing it to the literature’s novel algorithms using a simulation.

Findings

Empirical outcomes have illustrated that the suggested hybrid method achieves higher performance in discovering the appropriate HR allocation than some modern techniques.

Practical implications

The paper presents a useful method for improving HR allocation methods. The MATLAB-based simulation results have indicated that costs and waiting time have been improved compared to other algorithms, which cause the high application of this method in practical projects.

Originality/value

The main novelty of this paper is using an imperialist competitive algorithm for finding the best solution to the HR allocation problem in cloud-based e-commerce.

中文翻译：

---

基于元启发式算法的云电子商务人力资源配置新方法

目的

人力资源 (HR) 分配问题是项目管理过程的关键维度之一。由于问题的这种性质，研究人员正在以不同的方式不断优化一个或多个关键的调度和分配挑战。本研究旨在优化两个目标，即使用帝国主义竞争算法提高客户满意度和降低成本。

设计/方法/方法

基于云的电子商务应用程序比传统系统更受欢迎，因为它们可以在许多方面节省资金，包括资源使用、运行费用、资本成本、维护和运营成本。在 Web 应用程序中，其性能增强和自动设备恢复的核心功能很重要。人力资源知识、专长和能力正成为组织竞争优势越来越有价值的载体。因此，人力资源管理变得越来越重要，因为它试图将所有员工的精力用于实现组织战略目标。为最大化收益或最小化成本而分配资源被称为资源分配问题。由于在多项式时间内发现解很复杂，基于云的电子商务中的人力资源分配是一个非确定性多项式时间 (NP) 难题。在本文中，为了提升各自的优势并最小化劣势，建议使用帝国主义竞争算法来解决这些问题。通过使用模拟将帝国主义竞争算法与文献中的新算法进行比较，对其进行了测试。

发现

实证结果表明，与某些现代技术相比，所建议的混合方法在发现适当的 HR 分配方面具有更高的性能。

实际影响

本文提出了一种改进人力资源分配方法的有用方法。基于MATLAB的仿真结果表明，与其他算法相比，成本和等待时间都有所改善，这使得该方法在实际项目中得到了广泛应用。

原创性/价值

本文的主要新颖之处在于使用帝国主义竞争算法来寻找基于云的电子商务中人力资源分配问题的最佳解决方案。