Allocation Problem Research Articles

Distributed and autonomous multi-robot for task allocation and collaboration using a greedy algorithm and robot operating system platform

Research investigations in the realm of micro-robotics often center around strategies addressing the multi-robot task allocation (MRTA) problem. Our contribution delves into the collaborative dynamics of micro-robots deployed in targeted hostile environments. Employing advanced algorithms, these robots play a crucial role in enhancing and streamlining operations within sensitive areas. We adopt a tailored GREEDY approach, strategically adjusting weight parameters in a multi-objective function that serves as a cost metric. The objective function, designed for optimization purposes, aggregates the cost functions of all agents involved. Our evaluation meticulously examines the MRTA efficiency for each micro-robot, considering dependencies on factors such as radio connectivity, available energy, and the absolute and relative availability of agents. The central focus is on validating the positive trend associated with an increasing number of agents constituting the cluster. Our methodology introduces a trio of micro-robots, unveiling a flexible strategy aimed at detecting individuals at risk in demanding environments. Each micro-robot within the cluster is equipped with logic that ensures compatibility and cooperation, enabling them to effectively execute assigned missions. The implementation of MRTA-based collaboration algorithms serves as an adaptive strategy, optimizing agents' mobility based on specific criteria related to the characteristics of the target site.<p class="JAMRISAbstract"> </p>

A FPGA Accelerator of Distributed A3C Algorithm with Optimal Resource Deployment

The asynchronous advantage actor-critic (A3C) algorithm is widely regarded as one of the most effective and powerful algorithms among various deep reinforcement learning algorithms. However, the distributed and asynchronous nature of the A3C algorithm brings increased algorithm complexity and computational requirements, which not only leads to an increased training cost but also amplifies the difficulty of deploying the algorithm on resource-limited field programmable gate array (FPGA) platforms. In addition, the resource wastage problem caused by the distributed training characteristics of A3C algorithms and the resource allocation problem affected by the imbalance between the computational amount of inference and training need to be carefully considered when designing accelerators. In this paper, we introduce a deployment strategy designed for distributed algorithms aimed at enhancing the resource utilization of hardware devices. Subsequently, a FPGA architecture is constructed specifically for accelerating the inference and training processes of the A3C algorithm. The experimental results show that our proposed deployment strategy reduces resource consumption by 62.5% and decreases the number of agents waiting for training by 32.2%, and the proposed A3C accelerator achieves 1.83× and 2.39× improvements in speedup compared to CPU (Intel i9-13900K) and GPU (NVIDIA RTX 4090) with less power consumption respectively. Furthermore, our design shows superior resource efficiency compared to existing works.

Optimisation of energy efficiency of ambient backscatter communication and reconfigurable intelligent surfaces in non‐orthogonal multiple access downlink

AbstractThe authors study the energy efficiency (EE) of ambient backscatter communication (AmBC) device‐assisted and reconfigurable intelligent surfaces (RIS)‐assisted non‐orthogonal multiple access (NOMA) downlinks. The authors establish two optimisation problems based on the two collaborative devices (AmBC devices, RIS) with the objective of maximising the EE of the system, taking into account the requirements of power limitation and rate limitation, etc. and also obtain the solutions of two problems by optimising the relevant performance metrics based on the alternating optimisation algorithm. For the backscatter device (BD)‐aided downlink NOMA network, the problem is first decoupled into three subproblems, where the power allocation optimisation subproblem is solved by using the quadratic transformation method and the subgradient algorithm. The maximum EE is obtained by iterating according to the Dinkelbach's algorithm. For the RIS‐aided downlink NOMA network, the power allocation problem is solved by the same method as above and the phase optimisation problem is solved by the successive convex approximation method. Numerical results show that the proposed algorithm can achieve convergence after several iterations, and the EE of systems with BD‐assisted and RIS‐assisted have different levels of sensitivity to different influencing factors.

Self‐attention convolutional neural network optimized with Remora Optimization Algorithm for energy aware resource management in Non‐orthogonal Multiple Access networks

SummaryNon‐orthogonal multiple access (NOMA) is an efficient technology for future wireless communication systems. The resource management on NOMA networks is flattering for improving energy efficiency (EE) of systems. Therefore, self‐attention convolutional neural network (SACNN) optimized with Remora Optimization Algorithm (ROA) for energy aware resource management in NOMA network (SACNN‐ROA‐EE) is proposed in this paper for solving user allocation, channel allocation, and power allocation problems. The Matching‐Coalition approach is considered to face the user allocation issue, and the SACNN is considered to face the channel allocation and power allocation problems. SACNN does not adopt any optimization methods to determine the optimal parameters in channel allocation and power allocation. Therefore, the ROA is applied to optimize the SACNN weight parameters. The proposed technique is activated in MATLAB, and its efficacy is analyzed with under performances metrics, such as minimum user rate, sum rate, energy, and spectral performance. The proposed SACNN‐ROA‐EE attains 24.35%, 27.84%, and 38.58% better sum rate and 27.45%, 43.28%, 30.56% better EE compared with existing methods, such as EE utilizing communication deep neural network optimized with power allocation optimization (PAO‐CDNN‐EE), EE under deep transfer deterministic policy gradient along deep deterministic policy gradient approach (DPPGA‐DTDPPG‐EE), and EE utilizing deep reinforcement learning with baseline algorithms (BA‐DRL‐EE), respectively.

A DRL-Based Satellite Service Allocation Method in LEO Satellite Networks

Satellite computing represents a recent computational paradigm in the development of low Earth orbit (LEO) satellites. It aims to augment the capabilities of LEO satellites beyond their current transparent relay functions by enabling real-time processing, thereby providing low-latency computational services to end users. In LEO constellations, a significant deployment of computationally capable satellites is orchestrated to offer enhanced computational resources. Challenges arise in the optimal allocation of terminal services to the most suitable satellite due to overlapping coverage among neighboring satellites, compounded by constraints on satellite energy and computational resources. The satellite service allocation (SSA) problem is recognized as NP-hard, yet assessing allocation methods through results allows for the application of deep reinforcement learning (DRL) to obtain improved solutions, partially addressing the SSA challenge. In this paper, we introduce a satellite computing capability model to quantify satellite computational resources. A DRL model is proposed to address service demands, computational resources, and resolve service allocation conflicts, strategically placing each service on appropriate servers. Through simulation experiments, numerical results demonstrate the superiority of our proposed method over baseline approaches in service allocation and satellite resource utilization, showcasing advancements in this field.

Impact of trans-regional travel-related testing on epidemic spreading

The convenient transport network enables people to travel quickly and frequently across regions, but it also brings serious challenges to the emergency management of infectious diseases. This work extends the classical SEIR model by incorporating trans-regional population movements and contact infections during travel. It also includes cross-regional population testing and treatment measures to curb the spread of infectious diseases across regions. According to these characteristics, a Net-SEIHR model is established and its diffusion properties are deduced. Further, the cooperative allocation problem of limited detection resources and its control strategy are discussed. Numerical experiments show that the control measures can reduce the speed of trans-regional transmission of infectious diseases and the peak of treatment. In the case of limited testing resources, it is necessary to strengthen the detection of people in the inflow regions.

Computing Pareto-Optimal and Almost Envy-Free Allocations of Indivisible Goods

We study the problem of fair and efficient allocation of a set of indivisible goods to agents with additive valuations using the popular fairness notions of envy-freeness up to one good (EF1) and equitability up to one good (EQ1) in conjunction with Pareto-optimality (PO). There exists a pseudo-polynomial time algorithm to compute an EF1+PO allocation and a non-constructive proof of the existence of allocations that are both EF1 and fractionally Pareto-optimal (fPO), which is a stronger notion than PO. We present a pseudopolynomial time algorithm to compute an EF1+fPO allocation, thereby improving the earlier results. Our techniques also enable us to show that an EQ1+fPO allocation always exists when the values are positive and that it can be computed in pseudo-polynomial time. We also consider the class of k-ary instances where k is a constant, i.e., each agent has at most k different values for the goods. For such instances, we show that an EF1+fPO allocation can be computed in strongly polynomial time. When all values are positive, we show that an EQ1+fPO allocation for such instances can be computed in strongly polynomial time. Next, we consider instances where the number of agents is constant and show that an EF1+PO (likewise, an EQ1+PO) allocation can be computed in polynomial time. These results significantly extend the polynomial-time computability beyond the known cases of binary or identical valuations. We also design a polynomial-time algorithm that computes a Nash welfare maximizing allocation when there are constantly many agents with constant many different values for the goods. Finally, on the complexity side, we show that the problem of computing an EF1+fPO allocation lies in the complexity class PLS.

Minimizing the impact of electric vehicle charging station with distributed generation and distribution static synchronous compensator using PSR index and spotted hyena optimizer algorithm on the radial distribution system

This research investigates the impact of electric vehicle charging station on power loss, voltage stability, and reliability within radial distribution systems. With the escalating use of electric vehicles, understanding these effects is crucial for ensuring the stability and efficiency of radial distribution systems infrastructure. The study formulates the electric vehicle charging station allocation problem as a multi-objective function, integrating power loss, voltage stability, and reliability metrics expressed as the PSR index. Using the IEEE 69-bus system as a test system, the research explores the ramifications of electric vehicle charging station integration and proposes strategies to mitigate their effects. An innovative combination of distributed generation and distribution static compensator are employed to alleviate the impact of electric vehicle charging station on radial distribution systems. A recent optimization methodology called spotted hyena optimizer algorithm is introduced to determine optimal electric vehicle charging station locations, with results compared to other existing algorithms. The study assesses potential power losses induced by additional electric vehicle loads, explores strategies to optimize charging rates for minimizing resistive losses, and evaluates voltage stability and reliability implications. The important results include objective function values obtained using various algorithms: Spotted hyena optimizer algorithm (0.7683), cuckoo search algorithm (0.7709), bat algorithm (0.8035), and African vultures optimization algorithm (0.7856). The findings demonstrate that the proposed algorithm outperforms other algorithms in minimizing the objective function value, indicating its efficacy in optimizing electric vehicle charging station placement within radial distribution systems. In conclusion, this research contributes valuable insights into the challenges associated with integrating electric vehicle charging station into radial distribution systems and provides innovative solutions for optimizing electric vehicle charging station placement, thereby advancing the understanding and management of distribution systems in the context of electric vehicle adoption.

Joint subchannel power allocation for downlink NOMA systems based on quantum carnivorous plant algorithm

Currently, most existing research on non-orthogonal multiple access (NOMA) systems converts power allocation into two independent procedures, i.e., inter-subchannel power allocation and intra-subchannel power allocation. However, improper inter-subchannel power allocation will adversely affect the power allocation process of intra-subchannel. If the power allocations of inter-subchannel and intra-subchannel are optimized simultaneously, it usually needs high computational complexity, and is hard to obtain an optimal solution. To tackle this issue, this paper studies the joint subchannel power allocation for NOMA systems and proposes a new intelligent algorithm called quantum carnivorous plant algorithm (QCPA) for simultaneously optimizing inter-subchannel and intra-subchannel power allocations. Analysis of the convergence of QCPA verified its superior performance on the test functions. By utilizing the optimal solution obtained by QCPA as the power allocation scheme, energy efficiency and sum transmission rate in NOMA systems are significantly increased compared to existing traditional power allocation methods. The results above demonstrate that QCPA effectively addresses test functions and the power allocation problem for NOMA. QCPA possesses favorable convergence in comparison to other comparison algorithms and methods.

Improved genetic algorithm based on rule optimization strategy for fibre allocation

ABSTRACT In modern manufacturing industry, in order to adapt to changes in the general environment, the manufacturing industry must improve production efficiency. To this end, this article introduces an improved genetic algorithm based on rule selection to tackle the nondeterministic polynomial hard problem stemming from inventory fibre resources and fibre selection principles in optical cable production. The algorithm aims to maximize inventory score and minimize fibre segmentation rate. It employs a permutation encoding approach to link the genetic algorithm with fibre allocation solutions and applies a self-attention mechanism to determine subset solution weight within each solution. To boost the recombination of favourable gene segments from different chromosomes, a rule optimization strategy is integrated into the crossover operation based on the weights. This operations enhance the algorithm's global search capability and convergence speed. A feasibility repair strategy is then used to inspect and rectify chromosomes, preventing the generation of illegal solutions. The legitimate mutation operation, founded on weight optimization rules, effectively reduces the algorithm's running time by avoiding illegal solutions. By leveraging actual production data from an optical cable manufacturer for simulation, the experimental results confirm the effectiveness of the improved genetic algorithm in addressing the fibre allocation problem. Comparative simulations with the unimproved genetic algorithm and a stepwise greedy algorithm underscore the superiority of the improved genetic algorithm in resolving the fibre allocation problem.

Mathematical Programming Formulations for the Berth Allocation Problems in Container Seaport Terminals

Background: Improving the performance of marine terminals is one of the major concerns of both researchers and decision-makers in the maritime transportation sector. The problem of container storage planning and the berth allocation problem (BAP) are the two mainstays of optimizing port operations. Methods: In this work, we address these two issues, proposing two mathematical models that operate sequentially and are applicable to both static and dynamic cases. The first developed model is a mixed-integer linear problem model aimed at minimizing vessel traffic time in the port. The second model developed is a multi-objective optimization model based on goal programming (GP) to minimize both container transfer time and the number of storage areas (minimizing container dispersion). Results: The robustness of the proposed models has been proven through a benchmark with tests using data from the literature and real port data, based on the IBM ILOG CPLEX 12.5 solver. Conclusions: The two developed mathematical models allowed the both minimization of the transfer time and the number of used storage areas, whatever the number of operations handling companies (OHCs) operating in the seaport and for both static and dynamic cases. We propose, as prospects for this work, the development of a heuristic model to deal with the major instances relating to the case of large ports.

Multi-Connectivity for Multicast Video Streaming in Cellular Networks

The escalating demand for high-quality video streaming poses a major challenge for communication networks today. Catering to these bandwidth-hungry video streaming services places a huge burden on the limited spectral resources of communication networks, limiting the resources available for other services as well. Large volumes of video traffic can lead to severe network congestion, particularly during live streaming events, which require sending the same content to a large number of users simultaneously. For such applications, multicast transmission can effectively combat network congestion while meeting the demands of all the users by serving groups of users requesting the same content over shared spectral resources. Streaming services can further benefit from multi-connectivity, which allows users to receive content from multiple base stations simultaneously. Integrating multi-connectivity within multicast streaming can improve the system resource utilization while also providing seamless connectivity to multicast users. Toward this end, this work studied the impact of using multi-connectivity (MC) alongside wireless multicast for meeting the resource requirements of video streaming. Our findings show that MC substantially enhances the performance of multicast streaming, particularly benefiting cell-edge users who often experience poor channel conditions. We especially considered the number of users that can be simultaneously served by multi-connected multicast systems. It was observed that about 60% of the users that are left unserved under single-connectivity multicast are successfully served using the same resources by employing multi-connectivity in multicast transmissions. We prove that the optimal resource allocation problem for MC multicast is NP-hard. As a solution, we present a greedy approximation algorithm with an approximation factor of (1−1/e). Furthermore, we establish that no other polynomial-time algorithm can offer a superior approximation. To generate realistic video traffic patterns in our simulations, we made use of traces from actual videos. Our results clearly demonstrate that multi-connectivity leads to significant enhancements in the performance of multicast streaming.

Energy-Efficient Resource Optimization for IRS-Assisted VLC-Enabled Offshore Communication System

In this paper, a downlink energy efficiency maximization problem is investigated in an intelligent reflective surface (IRS)-assisted visible light communication system. In order to extend wireless communication coverage of the onshore base station, an IRS mounted on a unmanned aerial vehicle (UAV) is introduced to assist an onshore lighthouse with simultaneously providing remote ship users wireless communication services and illumination. Aiming to maximizing the energy efficiency of the proposed system, a resource allocation problem is formulated as the ratio of the achievable system sum rate to the total power consumption under the constraints of the user’s data requirement and transmit power budget. Due to the non-convexity of the proposed problem, the Dinkelbach method and mean-square error (MSE) method are adopted to turn the non-convex origin problem into two equivalent problems, namely transmit beamforming and reflected phase shifting. The Lagrangian method and semidefinite relaxation technique are used to obtain the closed-form solutions of these two subproblems. Accordingly, an alternative optimization-based resource allocation scheme is proposed to obtain the optimal system energy efficiency. The simulation results show that the proposed scheme performs better in terms of energy efficiency over benchmark schemes.

Sequential multichannel allocation in cache-enabled multicasting small-cell networks

This paper investigates the optimization of multichannel allocation in cache-enabled multicasting small-cell networks (CMSNs). In the traditional fixed channel allocation scheme (FCA), small-cell base stations (SBSs) allocate a fix channel to each local cache popular content. In order to further increasing the utilization of allocated channels, we first propose a sequential multichannel allocation scheme (SMA), in which SBSs allocate a sequential channel set to their cached files dynamically. We formulate the problem of sequential multichannel allocation as two NP-hard non-linear programming problems with two optimization objectives of minimizing the global collision level (GCL) and maximizing the global file-downloading level (GFL), and demonstrate the advantages of the proposed DSCA over FCA. Then, two channel allocation potential games are proposed to achieve GCL and GFL optimization respectively. To achieve Nash equilibria (NEs) of the proposed games, we present a better response based SMA algorithm (BR-SMA) for both two games, and propose an improved better response based SMA algorithm (IBR-SMA) for the game for GCL maximization which have two exploration modes for each decision-maker.

Traffic-Aware Energy-Efficient Resource Allocation for RSMA Based UAV Communications

Traffic measurement will play an essential role in future networks to reveal the traffic requirements of the users, which will support network operations like resource allocation. In this paper, we study the traffic-aware resource allocation problem for downlink rate-splitting multiple access (RSMA) based unmanned aerial vehicle (UAV) communications. Specifically, with the help of traffic measurement, user requirements on achievable rate are known as prior knowledge to the UAV. Considering user requirements, we maximize the energy efficiency of the UAV by jointly optimizing the UAV deployment, beamforming, rate allocation, and subcarrier allocation. To overcome the non-convexity of the above problem, a joint optimization is developed to solve it iteratively. First, a heuristic approach is proposed to find the three-dimensional location of the UAV. Then, successive convex approximation approach is utilized to optimize RSMA parameters. Moreover, we formulate the subcarrier allocation problem as a many-to-one two-sided matching game, which is tackled by the swap matching algorithm. Numerical results suggest that the proposed subcarrier allocation scheme outperforms benchmark schemes, and RSMA based schemes perform close to that based on non-orthogonal multiple access, which all outperform orthogonal frequency division multiple access based scheme.

Modeling the dynamic allocation problem of multi-service storage system with strategy learning

Gas storage, especially underground gas storage (UGS), plays a particularly important role in coping with supply disruptions. UGSs provide flexible services, e.g. firm storage service (FSS), interruptible storage service (ISS), and price hedging service (PHS), to their customers to harmonize the fluctuations in gas demand. At the beginning of each period, UGS has to allocate the overall capacity for different services for market auction. Allocation of available capacity is generally based on historical data and hands-on experience, which is operationally and economically inefficient. To address the problem, the paper developed a reinforcement learning model that captures the stochastic and dynamic features of the gas allocation problem. We study the optimal gas dispatching strategy under conditions where uncertain market states (e.g., demand load and price) exist in a continuous state space. The decision maker can improve their strategy by evaluating the expected rewards of storage actions in response to specific market states (or “learning” in the environment). In a 360-day numerical experiment, the model and algorithm demonstrate high efficiency in solving the problem. Meanwhile, several managerial implications regarding working gas volume (WGV) and agreed capacity are proposed to help improve the operational efficiency of UGS.

A study of jamming resource allocation based on a hyperheuristic framework

There are massive data and rapidly changing battlefield situations in modern electronic warfare, which is a challenge to jamming resource allocation. It is difficult for the existing optimization algorithms to balance optimization capability and calculation speed at the same time. Above all, this study designs a fuzzy multiattribute evaluation model based on behavioral characteristics. The model comprehensively integrates the characteristics of signal behavior, motion behavior, and external intelligence and can effectively deal with unknown threat signals. Then, this study proposes an improved genetic selection electronic warfare operator (EWO) hyperheuristic (GAEWHH) algorithm. As an emergent optimization algorithm, the HH framework has not previously been applied to the problem of jamming resource allocation. This is a two-level algorithm framework that can isolate problem domains. The high level uses an improved genetic algorithm to search the heuristic space, and four EWOs based on the problem domain are designed for the low level to search the solution space. Combining different EWOs can change the population diversity, evolution direction, and algorithm complexity of the GAEWHH algorithm, which improves the algorithm performance to meet battlefield situation requirements. The experiment shows that for large-scale problems, the GAEWHH algorithm is better than the mainstream evolutionary algorithm in terms of optimization capability and better than Google OR-Tools in terms of calculation speed. In this way, the GAEWHH algorithm achieves a balance between optimization capability and calculation speed.

Cost allocation and airport problems

We consider the problem of dividing the cost of a facility when agents can be ordered in terms of the needs they have for it, and accommodating an agent with a certain need allows accommodating all agents with lower needs at no extra cost. This problem is known as the “airport problem”, the facility being the runway. We review the literature devoted to its study, and formulate a number of open questions.

Solving large-scale electricity market pricing problems in polynomial time

In centralized wholesale electricity markets worldwide, market operators use mixed-integer linear programming to solve the allocation problem. Prices are typically determined based on the duals of relaxed versions of this optimization problem. The resulting outcomes are efficient, but market operators must pay out-of-market uplifts to some market participants and incur a considerable budget deficit that was criticized by regulators. As the share of renewables increases, the number of market participants will grow, leading to larger optimization problems and runtime issues. At the same time, non-convexities will continue to matter e.g., due to ramping constraints of the generators required to address the variability of renewables or non-convex curtailment costs. We draw on recent theoretical advances in the approximation of competitive equilibrium to compute allocations and prices in electricity markets using convex optimization. The proposed mechanism promises approximate efficiency, no budget deficit, and computational tractability. We present experimental results for this new mechanism in the context of electricity markets, and compare the runtimes, the average efficiency loss of the method, and the uplifts paid with standard pricing rules. We find that the computations with the new algorithm are considerably faster for relevant problem sizes. In general, the computational advantages come at the cost of efficiency losses and a price markup for the demand side. Interestingly, both are small with realistic problem instances. Importantly, the market operator does not incur a budget deficit and the uplifts paid to market participants are significantly lower compared to standard pricing rules.

Distributed Strategies for Constrained Nonsmooth Resource Allocation Problems With Autonomous Second-Order Agents

Distributed Strategies for Constrained Nonsmooth Resource Allocation Problems With Autonomous Second-Order Agents