Resource allocation in sparse graphs

Resource allocation in sparsely connected networks, a representative problem of systems with real variables, is studied using the replica and Bethe approximation methods. An efficient distributed algorithm is devised on the basis of insights gained from the analysis and is examined using numerical simulations,showing excellent performance and full agreement with the theoretical results. The physical properties of the resource allocation model are discussed.

Optimization of facility location-allocation problem in customer-driven supply chain

This paper develops and applies an integrated multiple criteria decision making approach to optimize the facility location-allocation problem in the contemporary customer-driven supply chain. Unlike the traditional optimization techniques, the proposed approach, combining the analytic hierarchy process (AHP) and the goal programming (GP) model, considers both quantitative and qualitative factors, and also aims at maximizing the benefits of deliverer and customers. In the integrated approach, the AHP is used first to determine the relative importance weightings or priorities of alternative locations with respect to both deliverer oriented and customer oriented criteria. Then, the GP model, incorporating the constraints of system, resource, and AHP priority is formulated to select the best locations for setting up the warehouses without exceeding the limited available resources. In this paper, a real case study is used to demonstrate how the integrated approach can be applied to deal with the facility location-allocation problem, and it is proved that the integrated approach outperforms the traditional costbased approach.

An integrated multiple criteria decision making approach for resource allocation in higher education

Resource allocation is one of the major decision problems arising in higher education. Resources must be allocated optimally in such a way that the performance of universities can be improved. This paper applies an integrated multiple criteria decision making approach to the resource allocation problem. In the approach, the Analytic Hierarchy Process (AHP) is first used to determine the priority or relative importance of proposed projects with respect to the goals of the universities. Then, the Goal Programming (GP) model incorporating the constraints of AHP priority, system, and resource is formulated for selecting the best set of projects without exceeding the limited available resources. The projects include 'hardware' (tangible university's infrastructures), and 'software' (intangible effects that can be beneficial to the university, its members, and its students). In this paper, two commercial packages are used: Expert Choice for determining the AHP priority ranking of the projects, and LINDO for solving the GP model. Copyright © 2007 Inderscience Enterprises Ltd.

Centralised or decentralised? Strategic implications of resource allocation models

This paper examines the strategic implications of resource allocation models (RAMs). Four interrelated aspects of resource allocation are discussed: degree of centralisation, locus of strategic direction, cross-subsidy, and locus of control. The paper begins with a theoretical overview of these concepts, locating the study in the contexts of both strategic management literature and the university. The concepts are then examined empirically, drawing upon a longitudinal study of three UK universities, Warwick, London School of Economics and Political Science (LSE), and Oxford Brookes. Findings suggest that RAMs are historically and culturally situated within the context of each university and this is associated with different patterns of strategic direction and forms of strategic control. As such, the RAM in use may be less a matter of best practice than one of internal fit. The paper concludes with some implications for theory and practice by discussing the potential trajectories of each type of RAM.

The role of trust in the resource allocation process of an old university

Allocation procedures, have attracted considerable interest among higher education institutions in recent years. Relevant previous research indicates that several universities adopt different approaches to the resource allocation problem, employing models and procedures that reflect their organisational arrangements and their internal socio – political dynamics. We argue that while studying accounting processes in their organisational context, the role of trust should also be considered carefully. In particular, it is very important to consider the attitudes of the individuals involved and interacting within organisational processes, and especially the trust between them, which plays an important role to the overall good governance of these processes. In our study, the role of interpersonal trust in an old Scottish University resource allocation process is examined. The study indicates that trust is a very necessary insight to the facilitation of social structures of accountability that enhance a better governance of the resource allocation process.

The steady performance of a porous and compliant aerostatic thrust bearing

Recent developments in aerostatic thrust bearings have included: (a) the porous aerostatic thrust bearing containing a porous pad and (b) the inherently compensated compliant surface aerostatic thrust bearing containing a thin elastomer layer. Both these developments have been reported to improve the bearing load capacity compared to conventional aerostatic thrust bearings with rigid surfaces. This development is carried one stage further in a porous and compliant aerostatic thrust bearing incorporating both a porous pad and an opposing compliant surface. The thin elastomer layer forming the compliant surface is bonded to a rigid backing and is of a soft rubber like material. Such a bearing is studied experimentally and theoretically under steady state operating conditions. A mathematical model is presented to predict the bearing performance. In this model is a simplified solution to the elasticity equations for deflections of the compliant surface. Account is also taken of deflections in the porous pad due to the pressure difference across its thickness. The lubrication equations for flow in the porous pad and bearing clearance are solved by numerical finite difference methods. An iteration procedure is used to couple deflections of the compliant surface and porous pad with solutions to the lubrication equations. Comparisons between experimental results and theoretically predicted bearing performance are in good agreement. However these results show that the porous and compliant aerostatic thrust bearing performance is lower than that of a porous aerostatic thrust bearing with a rigid surface in place of the compliant surface. This discovery is accounted to the recess formed in the bearing clearance by deflections of the compliant surface and its effect on flow through the porous pad.

Evolution of competing strategies in a threshold model for task allocation

A nature inspired decentralised multi-agent algorithm is proposed to solve a problem of distributed task allocation in which cities produce and store batches of different mail types. Agents must collect and process the mail batches, without global knowledge of their environment or communication between agents. The problem is constrained so that agents are penalised for switching mail types. When an agent process a mail batch of different type to the previous one, it must undergo a change-over, with repeated change-overs rendering the agent inactive. The efficiency (average amount of mail retrieved), and the flexibility (ability of the agents to react to changes in the environment) are investigated both in static and dynamic environments and with respect to sudden changes. New rules for mail selection and specialisation are proposed and are shown to exhibit improved efficiency and flexibility compared to existing ones. We employ a evolutionary algorithm which allows the various rules to evolve and compete. Apart from obtaining optimised parameters for the various rules for any environment, we also observe extinction and speciation.

The effect of load on agent-based algorithms for distributed task allocation

Multi-agent algorithms inspired by the division of labour in social insects and by markets, are applied to a constrained problem of distributed task allocation. The efficiency (average number of tasks performed), the flexibility (ability to react to changes in the environment), and the sensitivity to load (ability to cope with differing demands) are investigated in both static and dynamic environments. A hybrid algorithm combining both approaches, is shown to exhibit improved efficiency and robustness. We employ nature inspired particle swarm optimisation to obtain optimised parameters for all algorithms in a range of representative environments. Although results are obtained for large population sizes to avoid finite size effects, the influence of population size on the performance is also analysed. From a theoretical point of view, we analyse the causes of efficiency loss, derive theoretical upper bounds for the efficiency, and compare these with the experimental results.