Development of a relief distribution model for emergency logistics

A general language for specifying resource allocation and time-tabling problems is presented. The language is based on an expert system paradigm that was developed previously by the authors and that enables the solution of resource allocation problems by using experts' knowledge and heuristics. The language enables the specification of a problem in terms of resources, activities, allocation rules, and constraints, and thus provides a convenient knowledge acquisition tool. The language syntax is powerful and allows the specification of rules and constraints that are very difficult to formulate with traditional approaches, and it also supports the specification of various control and backtracking strategies. We constructed a generalized inference engine that runs compiled resource allocation problem specification language (RAPS) programs and provides all necessary control structures. This engine acts as an expert system shell and is called expert system for resource allocation (ESRA). The performance of RAPS combined with ESRA is demonstrated by analyzing its solution of a typical resource allocation problem.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

A general language called the resource allocation problem specification (RAPS) language, for specifying resource allocation and timetabling problems is presented. The language is based on the expert-system paradigm which enables the solution of resource allocation problems by using experts' knowledge and heuristics. The language enables the specification of a problem in terms of resources, activities, allocation rules and constraints. The language syntax is powerful and allows the specification of rules and constraints which are very difficult to formulate with the more traditional approaches. The language is independent of the inference engine that performs the allocation and can therefore be used to evaluate different allocation strategies. RAPS and the expert system for resource allocation (ESRA) shell were used to solve several resource allocation problems, which include staff allocation for air force missions and class scheduling in a university. >

The goal of delivering high-quality service has spurred research of 6G satellite communication networks. The limited resource-allocation problem has been addressed by next-generation satellite communication networks, especially multilayer networks with multiple low-Earth-orbit (LEO) and non-low-Earth-orbit (NLEO) satellites. In this study, the resource-allocation problem of a multilayer satellite network consisting of one NLEO and multiple LEO satellites is solved. The NLEO satellite is the authorized user of spectrum resources and the LEO satellites are unauthorized users. The resource allocation and dynamic pricing problems are combined, and a dynamic game-based resource pricing and allocation model is proposed to maximize the market advantage of LEO satellites and reduce interference between LEO and NLEO satellites. In the proposed model, the resource price is formulated as the dynamic state of the LEO satellites, using the resource allocation strategy as the control variable. Based on the proposed dynamic game model, an open-loop Nash equilibrium is analyzed, and an algorithm is proposed for the resource pricing and allocation problem. Numerical simulations validate the model and algorithm.

As a special form of multiaccess edge computing (MEC), vehicular edge computing (VEC) plays an important role in emergency logistics by providing real‐time and low‐latency services for vehicles. The solution of the joint task offloading and resource allocation problem (JTORA) is the key to improving VEC efficiency. This study formulates a special model according to the multistage characteristics of the computational task in vehicular edge computing networks (VECNs) for emergency logistics. First, the JTORA problem is decomposed into three computational steps, each of which includes a task offload (TO) problem and a resource allocation (RA) problem. Then, a hybrid solution is proposed which uses a simulated annealing process to optimize the genetic algorithm (GA) and cooperate with the particle swarm optimization (PSO) algorithm, called the genetic simulated annealing and particle swarm optimization (GSA‐PSO) algorithm. Furthermore, a simulation experiment is designed and the effectiveness of the GSA‐PSO is verified.

In modular integrated construction (MiC), the resource allocation problem (RAP) adopted by construction sites and vehicle routing problem (VRP) adopted by logistics companies are highly interdependent. However, this interdependence has been overlooked in the literature. Thus, the plans determined by each problem cannot be achieved practically. Moreover, there is no existing VRP model suitable for the MiC application. This study aims to propose a VRP model suitable for MiC, investigate the interdependence between the RAP and proposed VRP model, and develop a blockchain system to secure information sharing between the RAP and VRP. The first two objectives are achieved by developing a coordinated system formulated as a leader-follower Stackelberg game model (LFSGM). This model is presented as a bi-level optimisation model and solved using a nested ant colony optimisation-based algorithm. The effectiveness of the LFSGM is validated using a real case study. The results show that using the traditional approach (i.e. a separate RAP and proposed VRP) succeeds in providing a plan for the construction sites but not for the logistics company. In contrast, the LFSGM offers applicable plans for both the construction sites and logistics company. Lastly, some managerial implications are identified and discussed.

Centralized versus decentralized multi-cell resource and power allocation for multiuser OFDMA networks

Mobile Edge Computing (MEC) is a promising computing paradigm, which can provide mobile devices with powerful computing capability and low delay by offloading resource-intensive tasks to the MEC Server. However, due to the varying wireless channel conditions and different task delay requirements, the resource allocation decision made by MEC Server cannot always achieve the lowest system energy consumption. In this paper, we consider resource allocation problem in a multi-user MEC system. The objective is to achieve minimum system energy consumption under delay constraint by suitably allocating communication and computing resources. We solve the communication resources (subcarrier) allocation problem through regression algorithm, make use of three regression algorithms to predict subcarrier allocation. And then calculate the computing resources (CPU frequency) allocation and system energy consumption. Simulation results show that machine learning can achieve near-optimal system energy consumption, where the system energy consumption of the ANN(Artificial Neural Network), Xgboost (Extreme Gradient Boosting), and RF(Random Forest) algorithms is 1.30%, 7.49%, and 23.29% higher than the optimal system energy consumption respectively. In the view of prediction loss, ANN and Xgboost perform better than RF.

We initiate the study of the reliable resource allocation (RRA) problem. In this problem, we are given a set of sites ℱ each with an unconstrained number of facilities as resources. Every facility at site i ∈ ℱ has an opening cost and a service reliability pi. There is also a set of clients 𝒞 to be allocated to facilities. Every client j ∈ 𝒞 accesses a facility at i with a connection cost and reliability lij. In addition, every client j has a minimum reliability requirement (MRR) rj for accessing facilities. The objective of the problem is to decide the number of facilities to open at each site and connect these facilities to clients such that all clients’ MRRs are satisfied at a minimum total cost. The unconstrained fault-tolerant resource allocation problem studied in Liao and Shen [(2011) Unconstrained and Constrained Fault-Tolerant Resource Allocation. Proceedings of the 17th Annual International Conference on Computing and Combinatorics (COCOON), Dallas, Texas, USA, August 14–16, pp. 555–566. Springer, Berlin] is a special case of RRA. Both of these resource allocation problems are derived from the classical facility location theory. In this paper, for solving the general RRA problem, we develop two equivalent primal-dual algorithms where the second one is an acceleration of the first and runs in quasi-quadratic time. In the algorithm's ratio analysis, we first obtain a constant approximation factor of 2+2√2 and then a reduced ratio of 3.722 using a factor revealing program, when lij's are uniform on i (partially uniform) and rj's are uniform above the threshold reliability that a single access to a facility is able to provide. The analysis further elaborates and generalizes the inverse dual-fitting technique introduced in Xu and Shen [(2009) The Fault-Tolerant Facility Allocation Problem. Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC), Honolulu, HI, USA, December 16–18, pp. 689–698. Springer, Berlin]. Moreover, we formalize this technique for analyzing the minimum set cover problem. For a special case of RRA, where all rj's and lij's are uniform, we derive its approximation ratio through a novel reduction to the uncapacitated facility location problem. The reduction demonstrates some useful and generic linear programming techniques.

Considering the proliferation in the number of cloud users on an everyday basis, the task of resource provisioning in order to support all these users becomes a challenging problem. When resource allocation is non-optimal, users may face high costs or performance issues. So, in order to maximize profit and resource utilization while satisfying all client requests, it is essential for Cloud Service Providers to come up with ways to allocate resources adaptively for diverse conditions. This is a constrained optimization problem. Each client that submits a request to the cloud has its own best interests in mind. But each of these clients competes with other clients in the quest to obtain required quantum of resources. Hence, every client is a participant in this competition. So, a preliminary analysis of the problem reveals that it can be modelled as a game between clients. A game theoretic modelling of this problem provides us an ability to find an optimal resource allocation by employing game theoretic concepts. Resource allocation problems are NP-Hard, involving VM allocation and migration within and possibly, among data centres. Owing to the dynamic nature and number of requests, static methods fail to surmount race conditions. Using a Min-Max Game approach, we propose an algorithm that can overcome the problems mentioned. We propose to employ a utility maximization approach to solve the resource provisioning and allocation problem. We implement a new factor into the game called the utility factor which considers the time and budget constraints of every user. Resources are provisioned for tasks having the highest utility for the corresponding resource.

Logistics costs often represent a large portion of the expenses of companies. In order to reduce them, location allocation and vehicle routing are crucial. In the administrative decision of the logistics, location allocation problems (LAP) and vehicle routing problems (VRP) are interdependent. But most of time, they are considered separately. This can not reduce company's total cost in reality and will also increase the total cost sometimes. Thus, we should integrate these two problems. The location routing problem (LRP) overcomes above drawback by simultaneously tackling location allocation and vehicle routing problem. Nowadays, there are many literatures to research LRP, but most only research a single-stage logistics location routing problem. In this paper, we consider the multi-stage logistics location routing problem. We present mathematical model for multi-stage logistics location routing problem and proposes a heuristic approach on the basis of genetic algorithm to solve problem.

Software testing Resource allocation and release time decisions are vital for the software systems. The objective behind such critical decisions may differ from firm to firm. The motive of the firm may be maximization of software reliability or maximization of number of faults to be removed from each module or it may be minimization of number of faults remaining in the software or minimization of testing resources. Taking into consideration these different aims, various authors have investigated the problem of resource allocation and release time problem. In this paper we investigate various software release policies and resource allocation problem, for example, policies based on the dual constraints of cost and reliability.

PurposeThe 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/approachCloud-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.FindingsEmpirical outcomes have illustrated that the suggested hybrid method achieves higher performance in discovering the appropriate HR allocation than some modern techniques.Practical implicationsThe 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/valueThe 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.

With the global economic development and the instability of the political structure, in recent years, the occurrence of major disasters around the world has shown an intensified trend. This paper reviews on the model and algorithm of relief distribution in emergency logistics. Systematically analyzing the present academic research on relief distribution, this paper classified researchers into four categories: Vehicle Routing Problems; Inventory Routing Problems; Location Problems; location Routing Problems. Finally, we draw a conclusion of emergency logistics and propose a new study direction of relief distribution in the future research.

Considering the computational complexity and fronthaul capacity requirements of network-wide centralized optimization for Cell-free (CF) massive multiple input multiple output (MIMO) networks, we focus on user-centric (UC) networks wherein each user is served by a subset of access points (APs) rather than all the APs. We study a proportional-fair resource allocation (RA) problem, including slot resource allocation and precoding design in UC networks over consecutive time-slots. We formulate the proportional-fair (PF) resource allocation problem as a series of weighted sum-rate maximization problems and develop a two-stage heuristic RA scheme to solve the problem. The scheme adopts a user grouping process to decompose resource allocation problem into intra-group orthogonal resource allocation sub-problems. A modularity-based user grouping algorithm upon a constructed weighted digraph is proposed. Then, relying on the grouping results, a parallel distributed PFRA algorithm consisting of user selection process and a Signal to Leakage plus Noise Ratio (SLNR)-based precoding design is proposed to fulfil intra-group resource allocation. Rather than global channel state information (CSI) collected from the whole network, local CSI obtained cooperatively within each AP subset is utilized in the proposed resource allocation scheme. Numerical results confirm that the proposed RA scheme outperforms in throughput while maintaining comparable fairness among users.

DINLIP: Model for Integrated Decision, Bound and Time Driven Capacitated Multi Echelon Supply Chain Network