A Modification of the Imperialist Competitive Algorithm with Hybrid Methods for Multi-Objective Optimization Problems

This paper proposes a modification of the imperialist competitive algorithm to solve multi-objective optimization problems with hybrid methods (MOHMICA) based on a modification of the imperialist competitive algorithm with hybrid methods (HMICA). The rationale for this is that there is an obvious disadvantage of HMICA in that it can only solve single-objective optimization problems but cannot solve multi-objective optimization problems. In order to adapt to the characteristics of multi-objective optimization problems, this paper improves the establishment of the initial empires and colony allocation mechanism and empire competition in HMICA, and introduces an external archiving strategy. A total of 12 benchmark functions are calculated, including 10 bi-objective and 2 tri-objective benchmarks. Four metrics are used to verify the quality of MOHMICA. Then, a new comprehensive evaluation method is proposed, called “radar map method”, which could comprehensively evaluate the convergence and distribution performance of multi-objective optimization algorithm. It can be seen from the four coordinate axes of the radar maps that this is a symmetrical evaluation method. For this evaluation method, the larger the radar map area is, the better the calculation result of the algorithm. Using this new evaluation method, the algorithm proposed in this paper is compared with seven other high-quality algorithms. The radar map area of MOHMICA is at least 14.06% larger than that of other algorithms. Therefore, it is proven that MOHMICA has advantages as a whole.

Construction of a Multimedia-Based University Ideological and Political Big Data Cloud Service Teaching Resource Sharing Model

In this paper, the intelligent education cloud service platform is first constructed in view of the high cost consumption in the process of resource sharing scheduling in colleges and universities. Secondly, the hierarchical education resource sharing grid model is proposed. Specifically, according to the characteristics of the educational resource grid, the key factors affecting the performance of copy creation strategy are analysed, and a dynamic copy creation strategy is proposed. A multiresource equity distribution mechanism based on the concept of resource sharing equity is further proposed. The mechanism establishes a planning model according to the limited task resource demand and the amount of resources shared by the user at different times so that the global cumulative share vector of superior resources meets the dictionary order optimally. The simulation experiment shows that the grid sharing model proposed in this paper has better performance on the educational cloud service platform. The proposed resource allocation mechanism has achieved good results in ensuring the fair distribution of resources and ensuring high resource utilization when resource sharing users put forward multiple groups of time-changing resource demands.

In-Organization Ethics Power-Allocation Mechanisms and Members’ Decision-Making Behavior

This study examines experimental evidence showing how ethics power allocation mechanisms affect an individual’s in-organization resource division and ethical behavior. We used two two-stage lab experiments to explore power seeking and usage; the experiments contained two stages of power contending and power usage. Stage one used two different power-seeking mechanisms in the honesty game. Stage two was based on the dictator game and the ultimatum game to measure an individual’s power usage. The results show that the decisions taken by power-holders could influence the optimization of collective resources, and power-holders who gain power with unethical methods could result in collective resource allocation inequities. With more balanced in-organization power, members tend to be more honest. Subjects also adjust their unethical behavior to adapt to the environment, which could cause the diffusion of unethical behavior. This paper re-designed the dictator game and the ultimatum game by adding an ethically vulnerable power acquisition mechanism. For organizations to prevent the disproportionate dispersion of resources and achieve more public benefits, it is meaningful for managers to create a proper in-organization ethical power allocation mechanism.

Online-Retail Supply Chain Optimization with Credit Period and Selling Price-Dependent Demand

Credit payment strategies have been implemented widely in the online retail industry. This work studies an online-retail supply chain involving credit period and selling price-dependent demands. The participants of the supply chain form a Stackelberg game where the supplier as a follower sells products to the customers through an online platform provider, who as a leader provides a credit period to customers and charges the supplier based on the quantity of goods sold. We study and compare the supply chains when the online platform provider adopts the cash payment and credit payment strategies, respectively, to investigate the effects of the credit period, the selling price and the default risk on supply chain system performance. We also investigate these supply chains under both the centralized and decentralized settings and provide an example to illustrate a simple allocation mechanism to coordinate the decentralized supply chain. Finally, an extension of the supply chain with credit payment is given.

A Spreading Factor Congestion Status-Aware Adaptive Data Rate Algorithm

LoRaWAN has established itself as one of the leading MAC layer protocols in the field of LPWAN. Although the technology itself is quite mature, its resource allocation mechanism, the Adaptive Data Rate (ADR) algorithm is still quite new, unspecified and its functionalities still limited. Various studies have shown that the performance of the ADR algorithm gradually suffers in dense networks. Recent studies and proposals have been made as attempts to improve the algorithm. In this paper, the authors proposed a spreading factor congestion status aware ADR version and compared its performance against that of four other related algorithms to study the performance improvements the algorithm brings to LoRaWAN in terms of DER and EC. LoRaSim was used to evaluate the algorithms’ performances in a simple sensing application that involved end devices transmitting data to the gateway every hour. The performances were measured based on how they affected DER as the network size increases. The results obtained show that the proposed algorithm outperforms the currently existing implementations of the ADR in terms of both DER and EC. However, the proposed algorithm is slightly outperformed by the native ADR in terms of EC. This was expected as the algorithm was mainly built to improve DER. The proposed algorithm builds on the existing algorithms and the ADR and significantly improves them in terms of DER and EC (excluding the native ADR), which is a significant step towards an ideal implementation of LoRaWAN’s ADR.

Allocation Mechanisms without Reduction

We study a simple variant of the house allocation problem (one-sided matching). We demonstrate that agents with recursive preferences may systematically prefer one allocation mechanism to the other, even among mechanisms that are considered to be the same in standard models, in the sense that they induce the same probability distribution over successful matchings. Using this, we propose a new priority groups mechanism and provide conditions under which it is preferred to two popular mechanisms, random top cycle and random serial dictatorship. (JEL C78, D44, D82)