优化分配水资源

水资源危机使得合理分配和利用水资源非常重要.本文给出了干旱缺水时,如何把有限的水资源在社会各个行业部门之间进行优化分配的模型,以获得最大的社会效益、经济效益和生态效益.     

Resource Allocation with Wobbly Functions

We consider resource allocation with separable objective functions defined over subranges of the integers. While it is well known that (the maximisation version of) this problem can be solved efficiently if the objective functions are concave, the general problem of resource allocation with functions that are not necessarily concave is difficult.In this article, we focus on a large class of problem instances, with objective functions that are close to a concave function or some other smooth function, but with small irregularities in their shape. It is described that these properties are important in many practical situations.The irregularities make it hard or impossible to use known, efficient resource allocation techniques. We show that, for this class of functions the optimal solution can be computed efficiently. We support our claims by experimental evidence. Our experiments show that our algorithm in hard and practically relevant cases runs up to 40–60 times faster than the standard method.     

Resource Allocation with Noise Constraints

In the allocation of resources to activities, each activity is described by a concave return function and the sum of the returns is maximized. There are linear constraints on the available quantity of each essential resource. Existing methods for the incremental generation of almost-optimal allocations and for the evaluation of such allocations are extended to include allocations involving "noise" constraints in addition to the linear constraints on the available quantity of each resource. A noise constraint, which is defined in the paper, may be expressed by any relationship, not necessarily linear. An example is given in which the noise constraints take the form of constraints on additional resources.     

On Resource Allocation in Project Networks

The problem of scheduling activities so as to minimize project duration in the presence of resource constraints is considered. A branch and bound algorithm is described and some limited computational experience is reported.     

大规模云系统中的绿色资源分配模型研究

为了实现大规模云环境下的资源分配和绿色计算,提出了一种绿色资源分配协议.协议通过服务器整合(Server Consolidation)在一定CPU与内存资源限制之下,可以最大限度地减少云系统功耗,并适应不断变化的负载模式.仿真实验数据证明了协议的有效性和可扩展性.     

不确定环境下服务资源配置优化

在服务资源配置过程中,按维修状态将服务对象分成三类:完全维修、部分维修及最小维修.由于维修服务的特性,服务成本与服务时间均是一个模糊数,并且维修对象在服务时所处的维修状态也具有一定的不确定性.针对这类情况下的服务资源配置问题,提出了同时考虑模糊服务成本和模糊服务时间及不确定维修状态的最小化服务成本为优化指标的服务资源配置模型.在模型的求解过程中采用多粒子群算法,通过仿真计算表明了该方法的可行性和有效性.     

Efficient Resource Allocation with Non-Concave Objective Functions

We consider resource allocation with separable objective functions defined over subranges of the integers. While it is well known that (the maximization version of) this problem can be solved efficiently if the objective functions are concave, the general problem of resource allocation with non-concave functions is difficult. In this article we show that for fairly well-shaped non-concave objective functions, the optimal solution can be computed efficiently. Our main enabling ingredient is an algorithm for aggregating two objective functions, where the cost depends on the complexity of the two involved functions. As a measure of complexity of a function, we use the number of subintervals that are convex or concave.     

Optimization of a Multiperiod Resource Allocation Model

In this paper we examine multiperiod resource allocation problems, such as allocating a given marketing budget among T periods. The return functions of each period are assumed to be concave functions of the effective effort variable, which is composed of the expenditures in all previous periods and the present one. Assuming that the effect of an amount spent in period t is decreasing by a fixed rate in successive periods, necessary and sufficient conditions for a non-boundary optimal policy are derived. Under these conditions the optimal policy which maximizes total returns is obtained.     

On Resource Allocation Problems with Interval-Scale Coefficients

In this paper we discuss the classical problem of the allocation of a single finite resource among many competing activities for the specific case where the coefficients of the objective function form an interval scale. In this case there is no longer a single optimal solution, but rather a set of efficient solutions. We recommend a technique equivalent to parametric objective function analysis to generate the set of efficient solutions to the problem.     

Fractional Resource Allocation with S-Shaped Return Functions

A fractional resource allocation problem with S-shaped return functions and an affine cost function is considered. Properties of optimal solutions are derived, including conditions for certain allocations to be zero. Conditions are given for the determination of an optimal solution by concave approximations of the return functions; otherwise an error bound is obtained.     

资源公平分配的一种贪婪算法

对资源公平分配模型提出了一种简单的贪婪算法,在一定条件下可得到全局最优解且在相当多的情况下所得解都为最优解。该方法效率极高,编程简单,计算量很小,从大量模拟情况来看相当有效。     

An Algorithm for Solving a Resource Allocation Problem

The paper discusses the solution of a resource allocation problem and a new method for solving a special case of the problem. An algorithm for solving the general problem is presented, and computational experience comparing it with existing methods is given.     

城市公共设施事故应急资源配置优化模型

城市公共设施事故发生时,迅速调动应急资源,尽早展开救援,对促进社会发展和保持社会稳定具有重要意义。本文根据城市公共设施突发事故中资源配置问题的特点,运用多目标规划的思想,建立了应急资源配置的多目标规划模型,并通过实验模拟对模型进行了求解验证。此模型可以成功实现城市公共设施事故应急资源的有效配置,为相关部门的决策提供理论指导。     

An Experimental Investigation of Resource Allocation in Multiactivity Projects

This paper describes a computer-based experiment in the scheduling of multiactivity projects with limited resources. The main interest lay in a comparison of the traditional sorting criteria used to allot priority to activities competing for resources inadequate to satisfy all the demands and criteria newly defined for this work. One aim was to isolate, if possible, a criterion equally as good as the Critical Path parameters usually employed and yet easier to compute in practice. A similar experiment was carried out by Pascoe but none of the criteria used satisfied the second condition. It was also possible to monitor the effects on the scheduling of network parameters such as shape and connectivity.     

Discrete Resource Allocation by a Branch and Bound Method

A branch and bound method given by Shih for the solution of a class of discrete single resource allocation problems with concave return functions and several constraints of any type is extended to cover problems with arbitrary non-decreasing return functions.