WorldWideScience

Sample records for berth allocation problem

  1. Hybrid Heuristic Approaches for Tactical Berth Allocation Problem

    DEFF Research Database (Denmark)

    Iris, Cagatay; Larsen, Allan; Pacino, Dario;

    Tactical berth allocation problem deals with: the berth allocation (as- signs and schedules vessels to berth-positions), and the quay crane (QC) assignment (finds number of QCs that will serve). In this work, we strengthen the current mathematical models (MM) with novel lower bounds and valid ine...... inequalities. And, we propose a hybrid heuristic which combines MM with greedy and search heuristics. Results show that problem can be solved efficiently respect to optimality and computational time.......Tactical berth allocation problem deals with: the berth allocation (as- signs and schedules vessels to berth-positions), and the quay crane (QC) assignment (finds number of QCs that will serve). In this work, we strengthen the current mathematical models (MM) with novel lower bounds and valid...

  2. Models for the discrete berth allocation problem: A computational comparison

    DEFF Research Database (Denmark)

    Buhrkal, Katja Frederik; Zuglian, Sara; Røpke, Stefan;

    2011-01-01

    In this paper we consider the problem of allocating arriving ships to discrete berth locations at container terminals. This problem is recognized as one of the most important processes for any container terminal. We review and describe three main models of the discrete dynamic berth allocation pr...... problem, improve the performance of one model, and, through extensive numerical tests, compare all models from a computational perspective. The results indicate that a generalized set-partitioning model outperforms all other existing models....

  3. Minimizing the Total Service Time of Discrete Dynamic Berth Allocation Problem by an Iterated Greedy Heuristic

    Directory of Open Access Journals (Sweden)

    Shih-Wei Lin

    2014-01-01

    Full Text Available Berth allocation is the forefront operation performed when ships arrive at a port and is a critical task in container port optimization. Minimizing the time ships spend at berths constitutes an important objective of berth allocation problems. This study focuses on the discrete dynamic berth allocation problem (discrete DBAP, which aims to minimize total service time, and proposes an iterated greedy (IG algorithm to solve it. The proposed IG algorithm is tested on three benchmark problem sets. Experimental results show that the proposed IG algorithm can obtain optimal solutions for all test instances of the first and second problem sets and outperforms the best-known solutions for 35 out of 90 test instances of the third problem set.

  4. Minimizing the total service time of discrete dynamic berth allocation problem by an iterated greedy heuristic.

    Science.gov (United States)

    Lin, Shih-Wei; Ying, Kuo-Ching; Wan, Shu-Yen

    2014-01-01

    Berth allocation is the forefront operation performed when ships arrive at a port and is a critical task in container port optimization. Minimizing the time ships spend at berths constitutes an important objective of berth allocation problems. This study focuses on the discrete dynamic berth allocation problem (discrete DBAP), which aims to minimize total service time, and proposes an iterated greedy (IG) algorithm to solve it. The proposed IG algorithm is tested on three benchmark problem sets. Experimental results show that the proposed IG algorithm can obtain optimal solutions for all test instances of the first and second problem sets and outperforms the best-known solutions for 35 out of 90 test instances of the third problem set.

  5. A Dynamic Berth Allocation Problem with Priority Considerations under Stochastic Nature

    NARCIS (Netherlands)

    Ursavas, Evrim; Bulut, Onder; Tasgetiren, Fatih

    2012-01-01

    Stochastic nature of vessel arrivals and handling times adds to the complexity of the well-known NP-hard berth allocation problem. To aid real decision-making under customer differentiations, a dynamic stochastic model designed to reflect different levels of vessel priorities is put forward. For exp

  6. Integrated Berth Allocation-Quay Crane Assignment Problem: Reformulations, Improved Constraints and Computational Results

    DEFF Research Database (Denmark)

    Iris, Cagatay; Røpke, Stefan; Pacino, Dario

    , since the handling time of the vessels primarily depends on the number of containers to be handled and the number of cranes deployed, it would be beneficial to consider the integration of those two problems. In this work we extend the current state of the art by strengthening the current best...... problem (BAP) and the quay crane assignment problem (QCAP). Such integrated problem is known in the literature ([1]) as the Berth Allocation and Crane Assignment Problem (BACAP). The state-of-the-art [1] models this problem using two decision variables X_ij and Y_ij, representing respectively the partial...... order of the time and space dimension of the berth assignment, where i and j are two vessels. Moreover the variables r_itq define the number of cranes q to be assigned to vessel i at time t, and a set of auxiliary variables such as the vessel start time S_i. An optimal solution to the BACAP minimizes...

  7. Improved Models to Integrated Berth Allocation-Quay Crane Assignment Problem: A Computational Comparison and Novel Solution Approaches

    DEFF Research Database (Denmark)

    Iris, Cagatay; Pacino, Dario; Røpke, Stefan

    heavily relies on the efficiency of quay cranes operations, and the usage of the berthing area. Optimizing the allocation of ships to berth and the related assignment of cranes are important problems that are mostly covered as two separate cases in the literature. However, since the handling time...... of the vessels primarily depends on the number of containers to be handled and the number of cranes deployed, it would be beneficial to consider the integration of those two problems. This work extends the state-of-the-art by strengthening the current best mathematical formulation. Computational experiments...

  8. A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports

    DEFF Research Database (Denmark)

    Robenek, Tomáš; Umang, Nitish; Bierlaire, Michel

    2014-01-01

    the integrated problem. In the proposed model, the master problem is formulated as a set-partitioning problem, and subproblems to identify columns with negative reduced costs are solved using mixed integer programming. To obtain sub-optimal solutions quickly, a metaheuristic approach based on critical......In this research, two crucial optimization problems of berth allocation and yard assignment in the context of bulk ports are studied. We discuss how these problems are interrelated and can be combined and solved as a single large scale optimization problem. More importantly we highlight...... the differences in operations between bulk ports and container terminals which highlights the need to devise specific solutions for bulk ports. The objective is to minimize the total service time of vessels berthing at the port. We propose an exact solution algorithm based on a branch and price framework to solve...

  9. Berth-crane allocation problem based on the preferences of berthing position%考虑偏好泊位的泊位和岸桥集成分派问题

    Institute of Scientific and Technical Information of China (English)

    蒋大培; 胡志华; 胡少龙

    2014-01-01

    As the most important resources in port, berths and quay-cranes that are optimally alloca-ted and scheduled can improve the operate efficiency of container port.The berth-crane allocation problem is to arrange the best berthing position, dwelling time and the numbers of operating quay cranes for vessels calling for services in the container port.Considering the continuous berth alloca-tion problem, a model of 0-1 mixed integer linear programming of berth-cranes allocated was pro-posed based on preference berthing position.The goal of the model is to minimize the differences be-tween the preferences berthing position and berthing position and the length of the stay time in the terminal for all vessels. The impacts of port operating costs and quay-cranes operating costs caused by vessel berthing in differ preference berthing position, the time of vessel arriving and departing by differ preference berthing position penalties were investigated. Through simulation analysis, a scheme of berth-crane integrate allocation based on the preference berthing position was developed. Our work broadens the research area of berth allocation and prosides managerialt recommendations for port operation in berth allocation.%作为集装箱港口非常重要的资源,泊位和岸桥的合理分派与调度可以提高集装箱港口的作业效率。集装箱港口泊位和岸桥的集成分配问题,是为到达集装箱港口的船舶安排最佳停靠泊位、停靠时间与作业岸桥数。考虑连续泊位的泊位分配,以最小化偏离偏好泊位的泊位数和船舶在港停留时间为目标,建立基于偏好泊位的泊位和岸桥集成分配问题的0-1混合整数规划模型;研究船舶停靠不同偏好泊位对港口运营成本、岸桥作业成本的影响,分析偏好泊位惩罚成本的设置给船舶到港时间与离港时间带来的影响。通过仿真分析,得到考虑偏好泊位的泊位和岸桥集成分派计划,拓宽了泊位分

  10. Dynamic berth and quay crane allocation for multiple berth positions and quay cranes

    NARCIS (Netherlands)

    Tri Cahyono, Rully; Flonk, E.J.; Jayawardhana, Bayu

    2015-01-01

    We study in this paper a dynamic berth and quay cranes allocation strategy in general seaport container terminals. We develop a dynamical model that describes the operation of berthing process with multiple discrete berthing positions and multiple quay cranes. Based on the proposed model, we develop

  11. Integrated Berth Allocation and Quay Crane Assignment Problem: Set partitioning models and computational results

    DEFF Research Database (Denmark)

    Iris, Cagatay; Pacino, Dario; Røpke, Stefan;

    2015-01-01

    . To improve the performance of the set partitioning formulations, a number of variable reduction techniques are proposed. Furthermore, we analyze the effects of different discretization schemes and the impact of using a time-variant/invariant quay crane allocation policy. Computational experiments show...

  12. Aheuristic Algorithm for Berth Scheduling Problem in Container Ports

    Institute of Scientific and Technical Information of China (English)

    张海滨

    2011-01-01

    In this paper,the berth scheduling problem is transformed into a special two-dimensional packing problem with some constraints.A nonlinear programming model for the problem is established,and a heuristic algorithm is proposed to solve the model.Simulation

  13. The liner shipping berth scheduling problem with transit times

    DEFF Research Database (Denmark)

    Reinhardt, Line Blander; Plum, Christian E.M.; Pisinger, David

    2016-01-01

    In this paper speed optimization of an existing liner shipping network is solved by adjusting the port berth times. The objective is to minimize fuel consumption while retaining the customer transit times including the transhipment times. To avoid too many changes to the time table, changes of port...... berth times are only accepted if they lead to savings above a threshold value. Since the fuel consumption of a vessel is a non-linear convex function of the speed, it is approximated by a piecewise linear function. The developed model is solved using exact methods in less than two minutes for large...

  14. Distributed Storage Allocation Problems

    OpenAIRE

    Leong, Derek; Dimakis, Alexandros G.; Ho, Tracey

    2009-01-01

    We investigate the problem of using several storage nodes to store a data object, subject to an aggregate storage budget or redundancy constraint. It is challenging to find the optimal allocation that maximizes the probability of successful recovery by the data collector because of the large space of possible symmetric and nonsymmetric allocations, and the nonconvexity of the problem. For the special case of probability-l recovery, we show that the optimal allocatio...

  15. 基于滚动规划的泊位和岸桥分配集成模型研究%Study for rolling based berth and quay crane allocation model

    Institute of Scientific and Technical Information of China (English)

    白治江; 黄卿

    2014-01-01

    泊位分配(BA),岸桥配置(QCA)及岸桥调度(QCS)是三个基本的岸边决策问题。提出了一个基于混合整数线性规划的BA和QCA的集成模型,模型综合考虑了货轮优先权,理想泊位及处理时间三个方面的因素。在实际生产数据上的运行结果表明该模型具有决策支持的潜在能力。%Berth Allocation(BA), Quay Crane Assignment(QCA)and Quay Crane Schedule(QCS)are three basic decision problems about seaboard. A Mixed Integer Linear Program(MILP)based integrated model of BA and QCA is presented. This model takes into acount the vessel priorities, preferred berthing locations and handling time consideration. The exper-iment result on the practical data shows that this model has the potential to support the operation and decision-making.

  16. Allocation Problems and Market Design

    DEFF Research Database (Denmark)

    Smilgins, Aleksandrs

    The thesis contains six independent papers with a common theme: Allocation problems and market design. The first paper is concerned with fair allocation of risk capital where independent autonomous subunits have risky activities and together constitute the entity's total risk, whose associated risk...... with fractional players to allocate the common cost in an entity to the finite number of outputs. The paper is concerned with the computation of Aumann-Shapley prices when the cost function is estimated as a convex hull of a set of observed data points. It is discussed how to overcome certain problems related...... to non-differentiability of the cost function and inefficiency in production. Staying within the theme of cost sharing a fourth paper analyzes a model for trading green energy in a grid where countries are characterized by stochastic demand and stochastic production. The gain is obtained by trading which...

  17. 面向服务的泊位和岸桥联合调度%Service-oriented berth allocation and quay crane assignment

    Institute of Scientific and Technical Information of China (English)

    杜玉泉; 陈秋双; 姬晓涛

    2011-01-01

    In terms of the basic ideas of behavioral operation research,a service-oriented Mixed-Integer Nonlinear Programming(MINLP) model by using a deep integration method was formulated to deal with the berth allocation and quay crane assignment problem.To overcome the problems of computational intractability and optimality absence,the model was transformed into a Mixed-Integer Second Order Cone Programming(MISOCP) model,and the optimization software CPLEX was used to solve the model.Since the branch and cut algorithm was time-consuming and ran out of memory for some instances,MINLP model was solved by outer approximation algorithm.Based on the characteristics of the problem,the model was decomposed into a mixed-integer linear programming master problem and a nonlinear programming sub-problem.The optimal solution to the sub-problem was obtained by analytical method,and the outer approximation of nonlinear constraints was derived by using the first-order Taylor series expansion.Finally,solution performance of the branch and cut algorithm and the outer approximation algorithm was compared by numerical experiments.Moreover,convergence of the outer approximation algorithm was verified.The sensitivity analysis of key parameters in the model was also conducted.%从行为运筹学角度,面向服务性目标,采用深度集成的方法对泊位和岸桥联合调度问题建立了混合整数非线性规划模型。为克服计算困难和最优性缺失等问题,将模型转化为混合整数二阶锥规划模型,并利用优化软件CPLEX对其求解。针对CPLEX中分支切割算法在某些实例上存在内存溢出、求解时间长等问题,采用外逼近算法对混合整数非线性规划模型进行求解:根据问题特点将模型分解为混合整数线性规划主问题和非线性规划子问题,其中,子问题可用解析方法求得最优解,同时利用一阶Taylor展开导出了非线性约束的外逼近。最后,基于数值实验比较了分支

  18. On the Ramified Optimal Allocation Problem

    CERN Document Server

    Xia, Qinglan

    2011-01-01

    This paper proposes an optimal allocation problem with ramified transport technology in a spatial economy. Ramified transportation is used to model the transport economy of scale in group transportation observed widely in both nature and efficiently designed transport systems of branching structures. The ramified allocation problem aims at finding an optimal allocation plan as well as an associated optimal allocation path to minimize overall cost of transporting commodity from factories to households. This problem differentiates itself from existing ramified transportation literature in that the distribution of production among factories is not fixed but endogenously determined as observed in many allocation practices. It's shown that due to the transport economy of scale in ramified transportation, each optimal allocation plan corresponds equivalently to an optimal assignment map from households to factories. This optimal assignment map provides a natural partition of both households and allocation paths. We...

  19. Bounds in the location-allocation problem

    DEFF Research Database (Denmark)

    Juel, Henrik

    1981-01-01

    Develops a family of stronger lower bounds on the objective function value of the location-allocation problem. Solution methods proposed to solve problems in location-allocation; Efforts to develop a more efficient bound solution procedure; Determination of the locations of the sources....

  20. Fund allocation using capacitated vehicle routing problem

    Science.gov (United States)

    Mamat, Nur Jumaadzan Zaleha; Jaaman, Saiful Hafizah; Ahmad, Rokiah Rozita; Darus, Maslina

    2014-09-01

    In investment fund allocation, it is unwise for an investor to distribute his fund into several assets simultaneously due to economic reasons. One solution is to allocate the fund into a particular asset at a time in a sequence that will either maximize returns or minimize risks depending on the investor's objective. The vehicle routing problem (VRP) provides an avenue to this issue. VRP answers the question on how to efficiently use the available fleet of vehicles to meet a given service demand, subjected to a set of operational requirements. This paper proposes an idea of using capacitated vehicle routing problem (CVRP) to optimize investment fund allocation by employing data of selected stocks in the FTSE Bursa Malaysia. Results suggest that CRVP can be applied to solve the issue of investment fund allocation and increase the investor's profit.

  1. Resource Allocation Problems with Concave Reward Functions

    NARCIS (Netherlands)

    Grundel, S.; Borm, P.E.M.; Hamers, H.J.M.

    2013-01-01

    Abstract: In a resource allocation problem there is a common-pool resource, which has to be divided among agents. Each agent is characterized by a claim on this pool and an individual concave reward function on assigned resources. An assignment of resources is optimal if the total joint reward is ma

  2. Vehicle routing problem in investment fund allocation

    Science.gov (United States)

    Mamat, Nur Jumaadzan Zaleha; Jaaman, Saiful Hafizah; Ahmad, Rokiah Rozita; Mohd, Ismail

    2013-04-01

    Since its introduction by Dantzig and Ramser in 1959, vehicle routing problem keeps evolving in theories, applications and variability. The evolution in computing and technology are also important contributors to research in solving vehicle routing problem. The main sectors of interests among researchers and practitioners for vehicle routing problem are transportation, distribution and logistics. However, literature found that concept and benefits of vehicle routing problem are not taken advantages of by researchers in the field of investment. Other methods found used in investment include multi-objective programming, linear programming, goal programming and integer programming. Yet the application of vehicle routing problem is not fully explored. A proposal on a framework of the fund allocation optimization using vehicle routing problem is presented here. Preliminary results using FTSE Bursa Malaysia data testing the framework are also given.

  3. Submodular Cost Allocation Problem and Applications

    CERN Document Server

    Chekuri, Chandra

    2011-01-01

    We study the Minimum Submodular-Cost Allocation problem (MSCA). In this problem we are given a finite ground set $V$ and $k$ non-negative submodular set functions $f_1 ,..., f_k$ on $V$. The objective is to partition $V$ into $k$ (possibly empty) sets $A_1 ,..., A_k$ such that the sum $\\sum_{i=1}^k f_i(A_i)$ is minimized. Several well-studied problems such as the non-metric facility location problem, multiway-cut in graphs and hypergraphs, and uniform metric labeling and its generalizations can be shown to be special cases of MSCA. In this paper we consider a convex-programming relaxation obtained via the Lov\\'asz-extension for submodular functions. This allows us to understand several previous relaxations and rounding procedures in a unified fashion and also develop new formulations and approximation algorithms for several problems. In particular, we give a $(1.5 - 1/k)$-approximation for the hypergraph multiway partition problem. We also give a $\\min\\{2(1-1/k), H_{\\Delta}\\}$-approximation for the hypergraph...

  4. Shift-invariant target in allocation problems.

    Science.gov (United States)

    Mandal, Saumen; Biswas, Atanu

    2014-07-10

    We provide a template for finding target allocation proportions in optimal allocation designs where the target will be invariant for both shifts in location and scale of the response distributions. One possible application of such target allocation proportions is to carry out a response-adaptive allocation. While most of the existing designs are invariant for any change in scale of the underlying distributions, they are not location invariant in most of the cases. First, we indicate this serious flaw in the existing literature and illustrate how this lack of location invariance makes the performance of the designs very poor in terms of allocation for any drastic change in location, such as the changes from degrees centigrade to degrees Fahrenheit. We illustrate that unless a target allocation is location invariant, it might lead to a completely irrelevant and useless target for allocation. Then we discuss how such location invariance can be achieved for general continuous responses. We illustrate the proposed method using some real clinical trial data. We also indicate the possible extension of the procedure for more than two treatments at hand and in the presence of covariates.

  5. A Simulation Based Approach to Optimize Berth Throughput Under Uncertainty at Marine Container Terminals

    Science.gov (United States)

    Golias, Mihalis M.

    2011-01-01

    Berth scheduling is a critical function at marine container terminals and determining the best berth schedule depends on several factors including the type and function of the port, size of the port, location, nearby competition, and type of contractual agreement between the terminal and the carriers. In this paper we formulate the berth scheduling problem as a bi-objective mixed-integer problem with the objective to maximize customer satisfaction and reliability of the berth schedule under the assumption that vessel handling times are stochastic parameters following a discrete and known probability distribution. A combination of an exact algorithm, a Genetic Algorithms based heuristic and a simulation post-Pareto analysis is proposed as the solution approach to the resulting problem. Based on a number of experiments it is concluded that the proposed berth scheduling policy outperforms the berth scheduling policy where reliability is not considered.

  6. Vehicle routing problem and capacitated vehicle routing problem frameworks in fund allocation problem

    Science.gov (United States)

    Mamat, Nur Jumaadzan Zaleha; Jaaman, Saiful Hafizah; Ahmad, Rokiah@Rozita

    2016-11-01

    Two new methods adopted from methods commonly used in the field of transportation and logistics are proposed to solve a specific issue of investment allocation problem. Vehicle routing problem and capacitated vehicle routing methods are applied to optimize the fund allocation of a portfolio of investment assets. This is done by determining the sequence of the assets. As a result, total investment risk is minimized by this sequence.

  7. Optimizing investment fund allocation using vehicle routing problem framework

    Science.gov (United States)

    Mamat, Nur Jumaadzan Zaleha; Jaaman, Saiful Hafizah; Ahmad, Rokiah Rozita

    2014-07-01

    The objective of investment is to maximize total returns or minimize total risks. To determine the optimum order of investment, vehicle routing problem method is used. The method which is widely used in the field of resource distribution shares almost similar characteristics with the problem of investment fund allocation. In this paper we describe and elucidate the concept of using vehicle routing problem framework in optimizing the allocation of investment fund. To better illustrate these similarities, sectorial data from FTSE Bursa Malaysia is used. Results show that different values of utility for risk-averse investors generate the same investment routes.

  8. Bankruptcy Problem Allocations and the Core of Convex Games

    Directory of Open Access Journals (Sweden)

    William Olvera-Lopez

    2014-01-01

    Full Text Available A well-known result related to bankruptcy problems establishes that a vector is a bankruptcy allocation if and only if it belongs to the core of the associated O’Neill’s bankruptcy game. In this paper we show that this game is precisely the unique TU-game based on convex functions that satisfies the previous result. In addition, given a bankruptcy problem, we show a way for constructing bankruptcy games such that the set of bankruptcy allocations is a subset of their core or their core is a subset of the set of bankruptcy allocations. Also, we show how these results can be applied for finding new bankruptcy solutions.

  9. A Hybrid Dynamic Programming Method for Concave Resource Allocation Problems

    Institute of Scientific and Technical Information of China (English)

    姜计荣; 孙小玲

    2005-01-01

    Concave resource allocation problem is an integer programming problem of minimizing a nonincreasing concave function subject to a convex nondecreasing constraint and bounded integer variables. This class of problems are encountered in optimization models involving economies of scale. In this paper, a new hybrid dynamic programming method was proposed for solving concave resource allocation problems. A convex underestimating function was used to approximate the objective function and the resulting convex subproblem was solved with dynamic programming technique after transforming it into a 0-1 linear knapsack problem. To ensure the convergence, monotonicity and domain cut technique was employed to remove certain integer boxes and partition the revised domain into a union of integer boxes. Computational results were given to show the efficiency of the algorithm.

  10. Properties and solution methods for large location-allocation problems

    DEFF Research Database (Denmark)

    Juel, Henrik; Love, Robert F.

    1982-01-01

    Location-allocation with l$ _p$ distances is studied. It is shown that this structure can be expressed as a concave minimization programming problem. Since concave minimization algorithms are not yet well developed, five solution methods are developed which utilize the special properties of the l...

  11. A bat algorithm for the redundancy allocation problem

    Science.gov (United States)

    Talafuse, T. P.; Pohl, E. A.

    2016-05-01

    This article uses a recently developed bat algorithm (BA) meta-heuristic optimization method to solve the reliability redundancy allocation problem (RAP). The RAP is a well-known NP-hard problem which has been the subject of much prior work, generally of a restricted form where each component must consist of identical components in parallel to make computations tractable. Meta-heuristic methods overcome this limitation and allow for larger instances to be solved for a more general case where different components can be placed in parallel. The BA has not yet been used in reliability design, as it was a method initially designed for continuous problems. A BA is devised and tested on a well-known suite of problems from the literature. It is shown that the BA is competitive with the best known heuristics for redundancy allocation.

  12. Bandwidth allocation and pricing problem for a duopoly market

    Directory of Open Access Journals (Sweden)

    You Peng-Sheng

    2011-01-01

    Full Text Available This research discusses the Internet service provider (ISP bandwidth allocation and pricing problems for a duopoly bandwidth market with two competitive ISPs. According to the contracts between Internet subscribers and ISPs, Internet subscribers can enjoy their services up to their contracted bandwidth limits. However, in reality, many subscribers may experience the facts that their on-line requests are denied or their connection speeds are far below their contracted speed limits. One of the reasons is that ISPs accept too many subscribers as their subscribers. To avoid this problem, ISPs can set limits for their subscribers to enhance their service qualities. This paper develops constrained nonlinear programming to deal with this problem for two competitive ISPs. The condition for reaching the equilibrium between the two competitive firms is derived. The market equilibrium price and bandwidth resource allocations are derived as closed form solutions.

  13. Decomposition method for zonal resource allocation problems in telecommunication networks

    Science.gov (United States)

    Konnov, I. V.; Kashuba, A. Yu

    2016-11-01

    We consider problems of optimal resource allocation in telecommunication networks. We first give an optimization formulation for the case where the network manager aims to distribute some homogeneous resource (bandwidth) among users of one region with quadratic charge and fee functions and present simple and efficient solution methods. Next, we consider a more general problem for a provider of a wireless communication network divided into zones (clusters) with common capacity constraints. We obtain a convex quadratic optimization problem involving capacity and balance constraints. By using the dual Lagrangian method with respect to the capacity constraint, we suggest to reduce the initial problem to a single-dimensional optimization problem, but calculation of the cost function value leads to independent solution of zonal problems, which coincide with the above single region problem. Some results of computational experiments confirm the applicability of the new methods.

  14. Design of an adaptive backstepping controller for auto-berthing a cruise ship under wind loads

    Directory of Open Access Journals (Sweden)

    Park Jong-Yong

    2014-06-01

    Full Text Available The auto-berthing of a ship requires excellent control for safe accomplishment. Crabbing, which is the pure sway motion of a ship without surge velocity, can be used for this purpose. Crabbing is induced by a peculiar operation procedure known as the push-pull mode. When a ship is in the push-pull mode, an interacting force is induced by complex turbulent flow around the ship generated by the propellers and side thrusters. In this paper, three degrees of freedom equations of the motions of crabbing are derived. The equations are used to apply the adaptive backstepping control method to the auto-berthing controller of a cruise ship. The controller is capable of handling the system nonlinearity and uncertainty of the berthing process. A control allocation algorithm for a ship equipped with two propellers and two side thrusters is also developed, the performance of which is validated by simulation of auto-berthing.

  15. Design of an adaptive backstepping controller for auto-berthing a cruise ship under wind loads

    Science.gov (United States)

    Park, Jong-Yong; Kim, Nakwan

    2014-06-01

    The auto-berthing of a ship requires excellent control for safe accomplishment. Crabbing, which is the pure sway motion of a ship without surge velocity, can be used for this purpose. Crabbing is induced by a peculiar operation procedure known as the push-pull mode. When a ship is in the push-pull mode, an interacting force is induced by complex turbulent flow around the ship generated by the propellers and side thrusters. In this paper, three degrees of freedom equations of the motions of crabbing are derived. The equations are used to apply the adaptive backstepping control method to the auto-berthing controller of a cruise ship. The controller is capable of handling the system nonlinearity and uncertainty of the berthing process. A control allocation algorithm for a ship equipped with two propellers and two side thrusters is also developed, the performance of which is validated by simulation of auto-berthing.

  16. A Generalization of the Aumann-Shapley Value for Risk Capital Allocation Problems

    NARCIS (Netherlands)

    Boonen, T.J.; De Waegenaere, A.M.B.; Norde, H.W.

    2012-01-01

    Abstract: This paper analyzes risk capital allocation problems. For risk capital allocation problems, the aim is to allocate the risk capital of a firm to its divisions. Risk capital allocation is of central importance in risk-based performance measurement. We consider a case in which the aggregate

  17. A Heuristic Algorithm for Resource Allocation/Reallocation Problem

    Directory of Open Access Journals (Sweden)

    S. Raja Balachandar

    2011-01-01

    Full Text Available This paper presents a 1-opt heuristic approach to solve resource allocation/reallocation problem which is known as 0/1 multichoice multidimensional knapsack problem (MMKP. The intercept matrix of the constraints is employed to find optimal or near-optimal solution of the MMKP. This heuristic approach is tested for 33 benchmark problems taken from OR library of sizes upto 7000, and the results have been compared with optimum solutions. Computational complexity is proved to be (2 of solving heuristically MMKP using this approach. The performance of our heuristic is compared with the best state-of-art heuristic algorithms with respect to the quality of the solutions found. The encouraging results especially for relatively large-size test problems indicate that this heuristic approach can successfully be used for finding good solutions for highly constrained NP-hard problems.

  18. Finite-size scaling approach to dynamic storage allocation problem

    Science.gov (United States)

    Seyed-allaei, Hamed

    2003-09-01

    It is demonstrated how dynamic storage allocation algorithms can be analyzed in terms of finite-size scaling. The method is illustrated in the three simple cases of the first-fit, next-fit and best-fit algorithms, and the system works at full capacity. The analysis is done from two different points of view-running speed and employed memory. In both cases, and for all algorithms, it is shown that a simple scaling function exists and the relevant exponents are calculated. The method can be applied on similar problems as well.

  19. Algorithms for the minimum spanning tree problem with resource allocation

    Directory of Open Access Journals (Sweden)

    Seiji Kataoka

    2016-01-01

    Full Text Available We formulate the minimum spanning tree problem with resource allocation (MSTRA in two ways, as discrete and continuous optimization problems (d-MSTRA/c-MSTRA, prove these to be NP-hard, and present algorithms to solve these problems to optimality. We reformulate d-MSTRA as the knapsack constrained minimum spanning tree problem, and solve this problem using a previously published branch-and-bound algorithm. By applying a ‘peg test’, the size of d-MSTRA is (significantly reduced. To solve c-MSTRA, we introduce the concept of f-fractionalsolution, and prove that an optimal solution can be found within this class of solutions. Based on this fact, as well as conditions for ‘pruning’ subproblems, we develop an enumerative algorithm to solve c-MSTRA to optimality. We implement these algorithms in ANSI C programming language and, through extensive numerical tests, evaluate the performance of the developed codes on various types of instances.

  20. A cuckoo search algorithm by Lévy flights for solving reliability redundancy allocation problems

    Science.gov (United States)

    Valian, Ehsan; Valian, Elham

    2013-11-01

    A new metaheuristic optimization algorithm, called cuckoo search (CS), was recently developed by Yang and Deb (2009, 2010). This article uses CS and Lévy flights to solve the reliability redundancy allocation problem. The redundancy allocation problem involves setting reliability objectives for components or subsystems in order to meet the resource consumption constraint, e.g. the total cost. The difficulties facing the redundancy allocation problem are to maintain feasibility with respect to three nonlinear constraints, namely, cost, weight and volume-related constraints. The redundancy allocation problems have been studied in the literature for decades, usually using mathematical programming or metaheuristic optimization algorithms. The performance of the algorithm is tested on five well-known reliability redundancy allocation problems and is compared with several well-known methods. Simulation results demonstrate that the optimal solutions obtained by CS are better than the best solutions obtained by other methods.

  1. Solving the optimal attention allocation problem in manual control

    Science.gov (United States)

    Kleinman, D. L.

    1976-01-01

    Within the context of the optimal control model of human response, analytic expressions for the gradients of closed-loop performance metrics with respect to human operator attention allocation are derived. These derivatives serve as the basis for a gradient algorithm that determines the optimal attention that a human should allocate among several display indicators in a steady-state manual control task. Application of the human modeling techniques are made to study the hover control task for a CH-46 VTOL flight tested by NASA.

  2. Berthing control with multi-agent system; Multi agent system ni yoru chakusan seigyo

    Energy Technology Data Exchange (ETDEWEB)

    Ito, H. [Tokyo Univ. (Japan)

    1998-12-31

    The berthing of a ship is a kind of control operations of position, speed and direction of a ship in order to bring a ship alongside a quay. Berthing control is accompanied with a hard problem in which the 6 freedoms of position and speed in 3 directions such as fore and behind, right and left and a revolution must be controlled. In this study, a concept of the agent was introduced as a means of berthing. The agent is a computer program which can be worked in a person`s place. If an autonomous intelligence is carried on each element such as a tugboat or a propeller of ship, the element is able to act based on judgement decided by itself without an instruction from a control center. Thereby, the berthing control system as a multi-agent system having an adaptability and a cooperativeness will be realized. Then the multi-agent system to help berthing was constructed by applying the Muller`s three phase model as a cooperative autonomous agent and by sharing the role of each phase. 8 refs., 12 figs., 1 tab.

  3. 49 CFR 393.76 - Sleeper berths.

    Science.gov (United States)

    2010-10-01

    ...: (1) Adequate bedclothing and blankets; and (2) Either: (i) Springs and a mattress; or (ii) An innerspring mattress; or (iii) A cellular rubber or flexible foam mattress at least four inches thick; or (iv... rain. (g) Protection against exhaust and fuel leaks and exhaust heat. A sleeper berth must be...

  4. A trust-based sensor allocation algorithm in cooperative space search problems

    Science.gov (United States)

    Shen, Dan; Chen, Genshe; Pham, Khanh; Blasch, Erik

    2011-06-01

    Sensor allocation is an important and challenging problem within the field of multi-agent systems. The sensor allocation problem involves deciding how to assign a number of targets or cells to a set of agents according to some allocation protocol. Generally, in order to make efficient allocations, we need to design mechanisms that consider both the task performers' costs for the service and the associated probability of success (POS). In our problem, the costs are the used sensor resource, and the POS is the target tracking performance. Usually, POS may be perceived differently by different agents because they typically have different standards or means of evaluating the performance of their counterparts (other sensors in the search and tracking problem). Given this, we turn to the notion of trust to capture such subjective perceptions. In our approach, we develop a trust model to construct a novel mechanism that motivates sensor agents to limit their greediness or selfishness. Then we model the sensor allocation optimization problem with trust-in-loop negotiation game and solve it using a sub-game perfect equilibrium. Numerical simulations are performed to demonstrate the trust-based sensor allocation algorithm in cooperative space situation awareness (SSA) search problems.

  5. A COMPREHENSIVE DEA APPROACH FOR THE RESOURCE ALLOCATION PROBLEM BASED ON SCALE ECONOMIES CLASSIFICATION

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    This paper is concerned with the resource allocation problem based on data envelopment analysis(DEA)which is generally found in practice such as in public services and in production process.In management context,the resource allocation has to achieve the effective-efficient-equality aim and tries to balance the different desires of two management layers:central manager and each sector.In mathematical programming context,to solve the resource allocation asks for introducing many optimization techniques such as multiple-objective programming and goal programming.We construct an algorithm framework by using comprehensive DEA tools including CCR,BCC models,inverse DEA model,the most compromising common weights analysis model,and extra resource allocation algorithm.Returns to scale characteristic is put major place for analyzing DMUs' scale economies and used to select DMU candidates before resource allocation.By combining extra resource allocation algorithm with scale economies target,we propose a resource allocation solution,which can achieve the effective-efficient-equality target and also provide information for future resource allocation.Many numerical examples are discussed in this paper,which also verify our work.

  6. A heuristic and hybrid method for the tank allocation problem in maritime bulk shipping

    DEFF Research Database (Denmark)

    Vilhelmsen, Charlotte; Larsen, Jesper; Lusby, Richard Martin

    2016-01-01

    In bulk shipping, ships often have multiple tanks and carry multiple inhomogeneous products at a time. When operating such ships it is therefore a major challenge to decide how to best allocate cargoes to available tanks while taking into account tank capacity, safety restrictions, ship stability...... and strength as well as other operational constraints. The problem of finding a feasible solution to this tank allocation problem has been shown to be NP-Complete. We approach the problem on a tactical level where requirements for computation time are strict while solution quality is less important than simply...

  7. A robust optimisation approach to the problem of supplier selection and allocation in outsourcing

    Science.gov (United States)

    Fu, Yelin; Keung Lai, Kin; Liang, Liang

    2016-03-01

    We formulate the supplier selection and allocation problem in outsourcing under an uncertain environment as a stochastic programming problem. Both the decision-maker's attitude towards risk and the penalty parameters for demand deviation are considered in the objective function. A service level agreement, upper bound for each selected supplier's allocation and the number of selected suppliers are considered as constraints. A novel robust optimisation approach is employed to solve this problem under different economic situations. Illustrative examples are presented with managerial implications highlighted to support decision-making.

  8. A dynamic programming algorithm for the space allocation and aisle positioning problem

    DEFF Research Database (Denmark)

    Bodnar, Peter; Lysgaard, Jens

    2014-01-01

    The space allocation and aisle positioning problem (SAAPP) in a material handling system with gravity flow racks is the problem of minimizing the total number of replenishments over a period subject to practical constraints related to the need for aisles granting safe and easy access to storage l...

  9. Distributed Services with Foreseen and Unforeseen Tasks: The Mobile Re-allocation Problem

    NARCIS (Netherlands)

    J.A. Larco Martinelli (Jose); R. Dekker (Rommert); U. Kaymak (Uzay)

    2007-01-01

    textabstractIn this paper we deal with a common problem found in the operations of security and preventive/corrective maintenance services: that of routing a number of mobile resources to serve foreseen and unforeseen tasks during a shift. We define the (Mobile Re-Allocation Problem) MRAP as the pro

  10. A raw material storage yard allocation problem for a large-scale steelworks

    Energy Technology Data Exchange (ETDEWEB)

    Kim, B.I.; Koo, J.; Park, B.S. [POSTECH, Pohang (Republic of Korea). Department of Industrial and Management Engineering

    2009-04-15

    This paper addresses a raw material storage yard allocation problem at a large-scale steelworks. At the steelworks, raw materials such as coal and iron ore are imported by ships from overseas, discharged from the ships by unloading equipment, and transported into and stored in the yards. The stored materials then are transported and used in the production equipment such as steel mills. The yard allocation decision, i.e., where to store the materials, determines the travel distance of the materials as well as the storage efficiency of the yards. Here, the yard allocation problem is solved using a mixed integer programming model. The solution compares favorably with the current practice of the steelworks.

  11. A Heuristic and Hybrid Method for the Tank Allocation Problem in Maritime Bulk Shipping

    DEFF Research Database (Denmark)

    Vilhelmsen, Charlotte; Larsen, Jesper; Lusby, Richard Martin

    and strength as well as other operational constraints. The problem of finding a feasible solution to this tank allocation problem has been shown to be NP-Complete. We approach the problem on a tactical level where requirements for computation time are strict while solution quality is less important than simply...... have created a hybrid method that first runs the heuristic and if the heuristic fails to solve the problem, then runs the modified optimality based method on the parts of the problem that the heuristic did not solve. This hybrid method cuts between 90% and 94% of the average running times compared...... finding a feasible solution. We have developed a heuristic that can efficiently find feasible cargo allocations. Computational results show that it can solve 99% of the considered instances within 0.4 seconds and all of them if allowed longer time. We have also modified an optimality based method from...

  12. Uncertain multiobjective redundancy allocation problem of repairable systems based on artificial bee colony algorithm

    Institute of Scientific and Technical Information of China (English)

    Guo Jiansheng; Wang Zutong; Zheng Mingfa; Wang Ying

    2014-01-01

    Based on the uncertainty theory, this paper is devoted to the redundancy allocation problem in repairable parallel-series systems with uncertain factors, where the failure rate, repair rate and other relative coefficients involved are considered as uncertain variables. The availability of the system and the corresponding designing cost are considered as two optimization objectives. A crisp multiobjective optimization formulation is presented on the basis of uncertainty theory to solve this resultant problem. For solving this problem efficiently, a new multiobjective artificial bee colony algorithm is proposed to search the Pareto efficient set, which introduces rank value and crowding distance in the greedy selection strategy, applies fast non-dominated sort procedure in the exploitation search and inserts tournament selection in the onlooker bee phase. It shows that the proposed algorithm outperforms NSGA-II greatly and can solve multiobjective redundancy allocation problem efficiently. Finally, a numerical example is provided to illustrate this approach.

  13. A Decision Support Method for Truck Scheduling and Storage Allocation Problem at Container

    Institute of Scientific and Technical Information of China (English)

    CAO Jinxin; SHI Oixin; Der-Horng Lee

    2008-01-01

    Truck scheduling and storage allocation, as two separate subproblems in port operations, have been deeply studied in past decades. However, from the operational point of view, they are highly interde-pendent. Storage allocation for import containers has to balance the travel time and queuing time of each container in yard. This paper proposed an integer programming model handling these two problems as a whole. The objective of this model is to reduce congestion and waiting time of container trucks in the termi-nal so as to decrease the makespan of discharging containers. Due to the inherent complexity of the prob-lem, a genetic algorithm and a greedy heuristic algorithm are designed to attain near optimal solutions. It shows that the heuristic algorithm can achieve the optimal solution for small-scale problems. The solutions of small- and large-scale problems obtained from the heuristic algorithm are better than those from the ge-netic algorithm.

  14. 46 CFR 108.203 - Berths and lockers.

    Science.gov (United States)

    2010-10-01

    ... 46 Shipping 4 2010-10-01 2010-10-01 false Berths and lockers. 108.203 Section 108.203 Shipping... EQUIPMENT Construction and Arrangement Accommodation Spaces § 108.203 Berths and lockers. (a) Each sleeping...) Each occupant of a sleeping space must have a readily accessible locker of hard, smooth material....

  15. A dynamic programming algorithm for the buffer allocation problem in homogeneous asymptotically reliable serial production lines

    Directory of Open Access Journals (Sweden)

    Diamantidis A. C.

    2004-01-01

    Full Text Available In this study, the buffer allocation problem (BAP in homogeneous, asymptotically reliable serial production lines is considered. A known aggregation method, given by Lim, Meerkov, and Top (1990, for the performance evaluation (i.e., estimation of throughput of this type of production lines when the buffer allocation is known, is used as an evaluative method in conjunction with a newly developed dynamic programming (DP algorithm for the BAP. The proposed algorithm is applied to production lines where the number of machines is varying from four up to a hundred machines. The proposed algorithm is fast because it reduces the volume of computations by rejecting allocations that do not lead to maximization of the line's throughput. Numerical results are also given for large production lines.

  16. Arithmetic and algebraic problem solving and resource allocation: the distinct impact of fluid and numerical intelligence.

    Science.gov (United States)

    Dix, Annika; van der Meer, Elke

    2015-04-01

    This study investigates cognitive resource allocation dependent on fluid and numerical intelligence in arithmetic/algebraic tasks varying in difficulty. Sixty-six 11th grade students participated in a mathematical verification paradigm, while pupil dilation as a measure of resource allocation was collected. Students with high fluid intelligence solved the tasks faster and more accurately than those with average fluid intelligence, as did students with high compared to average numerical intelligence. However, fluid intelligence sped up response times only in students with average but not high numerical intelligence. Further, high fluid but not numerical intelligence led to greater task-related pupil dilation. We assume that fluid intelligence serves as a domain-general resource that helps to tackle problems for which domain-specific knowledge (numerical intelligence) is missing. The allocation of this resource can be measured by pupil dilation.

  17. A variable neighbourhood search algorithm for the constrained task allocation problem

    OpenAIRE

    Lusa, A.; Potts, C.N.

    2006-01-01

    A Variable Neighbourhood Search algorithm that employs new neighbourhoods is proposed for solving a task allocation problem whose main characteristics are: (i) each task requires a certain amount of resources and each processor has a capacity constraint which limits the total resource of the tasks that are assigned to it; (ii) the cost of solution includes fixed costs when using processors, task assignment costs, and communication costs between tasks assigned to different processors. A comput...

  18. A Novel Joint Problem of Routing, Scheduling, and Variable-Width Channel Allocation in WMNs

    Directory of Open Access Journals (Sweden)

    Chun-Cheng Lin

    2014-01-01

    Full Text Available This paper investigates a novel joint problem of routing, scheduling, and channel allocation for single-radio multichannel wireless mesh networks in which multiple channel widths can be adjusted dynamically through a new software technology so that more concurrent transmissions and suppressed overlapping channel interference can be achieved. Although the previous works have studied this joint problem, their linear programming models for the problem were not incorporated with some delicate constraints. As a result, this paper first constructs a linear programming model with more practical concerns and then proposes a simulated annealing approach with a novel encoding mechanism, in which the configurations of multiple time slots are devised to characterize the dynamic transmission process. Experimental results show that our approach can find the same or similar solutions as the optimal solutions for smaller-scale problems and can efficiently find good-quality solutions for a variety of larger-scale problems.

  19. A bi-objective model for emergency services location-allocation problem with maximum distance constraint

    Directory of Open Access Journals (Sweden)

    Mansoureh Haj Mohammad Hosseini

    2011-04-01

    Full Text Available In this paper, a bi-objective mathematical model for emergency services location-allocation problem on a tree network considering maximum distance constraint is presented. The first objective function called centdian is a weighted mean of a minisum and a minimax criterion and the second one is a maximal covering criterion. For the solution of the bi-objective optimization problem, the problem is split in two sub problems: the selection of the best set of locations, and a demand assignment problem to evaluate each selection of locations. We propose a heuristic algorithm to characterize the efficient location point set on the network. Finally, some numerical examples are presented to illustrate the effectiveness of the proposed algorithms.

  20. Solving a Location, Allocation, and Capacity Planning Problem with Dynamic Demand and Response Time Service Level

    Directory of Open Access Journals (Sweden)

    Carrie Ka Yuk Lin

    2014-01-01

    Full Text Available Logistic systems with uncertain demand, travel time, and on-site processing time are studied here where sequential trip travel is allowed. The relationship between three levels of decisions: facility location, demand allocation, and resource capacity (number of service units, satisfying the response time requirement, is analysed. The problem is formulated as a stochastic mixed integer program. A simulation-based hybrid heuristic is developed to solve the dynamic problem under different response time service level. An initial solution is obtained from solving static location-allocation models, followed by iterative improvement of the three levels of decisions by ejection, reinsertion procedure with memory of feasible and infeasible service regions. Results indicate that a higher response time service level could be achieved by allocating a given resource under an appropriate decentralized policy. Given a response time requirement, the general trend is that the minimum total capacity initially decreases with more facilities. During this stage, variability in travel time has more impact on capacity than variability in demand arrivals. Thereafter, the total capacity remains stable and then gradually increases. When service level requirement is high, the dynamic dispatch based on first-come-first-serve rule requires smaller capacity than the one by nearest-neighbour rule.

  1. Simulation-Based Optimization for Storage Allocation Problem of Outbound Containers in Automated Container Terminals

    Directory of Open Access Journals (Sweden)

    Ning Zhao

    2015-01-01

    Full Text Available Storage allocation of outbound containers is a key factor of the performance of container handling system in automated container terminals. Improper storage plans of outbound containers make QC waiting inevitable; hence, the vessel handling time will be lengthened. A simulation-based optimization method is proposed in this paper for the storage allocation problem of outbound containers in automated container terminals (SAPOBA. A simulation model is built up by Timed-Colored-Petri-Net (TCPN, used to evaluate the QC waiting time of storage plans. Two optimization approaches, based on Particle Swarm Optimization (PSO and Genetic Algorithm (GA, are proposed to form the complete simulation-based optimization method. Effectiveness of this method is verified by experiment, as the comparison of the two optimization approaches.

  2. Modeling Multioperator Multi-UAV Operator Attention Allocation Problem Based on Maximizing the Global Reward

    Directory of Open Access Journals (Sweden)

    Yuhang Wu

    2016-01-01

    Full Text Available This paper focuses on the attention allocation problem (AAP in modeling multioperator multi-UAV (MOMU, with the operator model and task properties taken into consideration. The model of MOMU operator AAP based on maximizing the global reward is established and used to allocate tasks to all operators as well as set work time and rest time to each task simultaneously for operators. The proposed model is validated in Matlab simulation environment, using the immune algorithm and dynamic programming algorithm to evaluate the performance of the model in terms of the reward value with regard to the work time, rest time, and task allocation. The result shows that the total reward of the proposed model is larger than the one obtained from previously published methods using local maximization and the total reward of our method has an exponent-like relation with the task arrival rate. The proposed model can improve the operators’ task processing efficiency in the MOMU command and control scenarios.

  3. The Dynamic Modeling Algorithm of Information Organization and Allocation Problem on Internet Communications

    Institute of Scientific and Technical Information of China (English)

    Li Yuan-xiang; Liu Dong-mei

    2003-01-01

    With the frequent information accesses from users to the Internet, it is important to organize and allocate information resources properly on different web servers. This paper considers the following protblem: Due to the capacity limitation of each single web server, it is impossible to put all information resources on one web server. Hence it is an important problem to put them on several different servers suchas: (1) the amount of information resources assigned on any server is less than its capacity; (2) the access bottleneck can be avoided. In order to solve the problem in which the access frequency is variable, this paper proposes a dynamic optimal modeling. Based on the computational complexity results, the paper further focuses on the genetic algorithm for solving the dynamic problem. Finally we give the simulation results and conclusions.

  4. The Impact of Walking Time on U-Shaped Assembly Line Worker Allocation Problems

    Directory of Open Access Journals (Sweden)

    Parames Chutima

    2010-04-01

    Full Text Available The one-piece flow manufacturing line of single and customized products is usually organized as a U-shaped assembly layout. In this study, the characteristics of a single U-line are described and modeled. The worker allocation problem is hierarchically concerned with the task assignment into a U-line and allocate task to workers in sequence. Several products are assembled in 7-task to 297-task problems, and each problem is performed with a given cycle time. The primary purpose is to identify the impact of walking time on both symmetrical and rectangular U-shaped assembly layouts. The minor purpose is to compare the number of workers between two fixed layouts. Coincidence algorithm demonstrates clarifying solutions. To respond to two previous aims, the primary objective function of a number of workers is used. Finally, with the Pareto-optimal frontier between the deviation of operation times of workers and the walking time, its computational study is exemplified to identify good task assignment and walking path.

  5. Integrating Gene Expression Programming and Geographic Information Systems for Solving a Multi Site Land Use Allocation Problem

    Directory of Open Access Journals (Sweden)

    Khalid A. Eldrandaly

    2009-01-01

    Full Text Available Problem statement: Land use planning may be defined as the process of allocating different activities or uses to specific units of area within a region. Multi sites Land Use Allocation Problems (MLUA refer to the problem of allocating more than one land use type in an area. MLUA problem is one of the truly NP Complete (combinatorial optimization problems. Approach: To cope with this type of problems, intelligent techniques such as genetic algorithms and simulated annealing, have been used. In this study a new approach for solving MLUA problems was proposed by integrating Gene Expression Programming (GEP and GIS. The feasibility of the proposed approach in solving MLUA problems was checked using a fictive case study. Results: The results indicated clearly that the proposed approach gives good and satisfactory results. Conclusion/Recommendation: Integrating GIS and GEP is a promising and efficient approach for solving MLUA problems. This research focused on minimizing the development costs and maximizing the compactness of the allocated land use. The optimization model can be extended in the future to maximize also the spatial contiguity of the allocated land use.

  6. Integrated Yard Space Allocation and Yard Crane Deployment Problem in Resource-Limited Container Terminals

    Directory of Open Access Journals (Sweden)

    Caimao Tan

    2016-01-01

    Full Text Available Yard storage space and yard crane equipment are the core resources in the container terminal yard area. This paper studies the integrated yard space allocation (outbound container space and yard crane deployment problem in resource-limited container terminals where yard space and yard cranes are extremely scarce. Two corresponding counterstrategies are introduced, respectively, and the integrated problem is solved as mixed integer programming. The model this paper formulated considers the container volume fluctuation of the service line, and the objective is a trade-off between yard sharing space and terminal operation cost. In numerical experiments, this paper tries to reveal the management meaning in practical operation of container terminal and provides decision support for terminal managers; therefore a series of scenarios are presented to analyze the relations among the yard sharing space, the number of yard cranes, the size of yard subblock, and the cost of terminal operation.

  7. A Non-Cooperative Approach to the Joint Subcarrier and Power Allocation Problem in Multi-Service SCFDMA Networks

    Directory of Open Access Journals (Sweden)

    E. E. Tsiropoulou

    2016-06-01

    Full Text Available In this paper a joint resource allocation problem is studied in a multi-service Single Carrier FDMA (SC-FDMA wireless network. Mobile users request various services with different Quality of Service (QoS characteristics and they determine in a distributed and non-cooperative manner a joint subcarrier and power allocation towards fulfilling their QoS prerequisites. Initially, a well-designed utility function is formulated to appropriately represent users’ diverse QoS prerequisites with respect to their requested service. The subcarriers allocation problem is solved based on a multilateral bargaining model, where users are able to select different discount factors to enter the bargaining game, thus better expressing their different needs in system resources with respect to their requested service. The subcarriers mapping is realized based either on the localized SC-FDMA method where the subcarriers are sequentially allocated to the users or the distributed SC-FDMA via considering the maximum channel gain policy, where each subcarrier is allocated to the user with the maximum channel gain. Given the subcarriers assignment, an optimization problem with respect to users’ uplink transmission power is formulated and solved, in order to determine the optimal power allocation per subcarrier assigned to each user. Finally, the performance of the proposed framework is evaluated via modeling and simulation and extensive numerical results are presented.

  8. A greedy heuristic algorithm for solving the capacitated planar multi-facility location-allocation problem

    Science.gov (United States)

    Luis, Martino; Ramli, Mohammad Fadzli; Lin, Abdullah

    2016-10-01

    This study investigates the capacitated planar multi-facility location-allocation problem by considering various capacity constraints. The problem is also known as the capacitated multi-source Weber problem, where the number of facilities to be located is specified and each of which has a capacity constraint. An efficient greedy randomised adaptive search procedure (GRASP) is proposed to deal with the problem. A scheme that applies the furthest distance rule (FDR) and self-adjusted threshold parameters to generate initial facility locations that are situated sparsely within GRASP framework is also presented. The construction of the restricted candidate list (RCL) within GRASP is also guided by applying a concept of restricted regions that prevents new facility locations to be sited too close to the previous selected facility locations. The performance of the proposed GRASP heuristics is tested using benchmark data sets from literature. The computational experiments show that the proposed methods provide encouraging solutions when compared to recently published papers. Some future research avenues on the subject are also briefly highlighted.

  9. The Manpower Allocation Problem with Time Windows and Job-Teaming Constraints: A Branch-and-Price Approach

    DEFF Research Database (Denmark)

    Hansen, Anders Dohn; Kolind, Esben; Clausen, Jens

    2009-01-01

    In this paper, we consider the Manpower Allocation Problem with Time Windows, Job-Teaming Constraints and a limited number of teams (m-MAPTWTC). Given a set of teams and a set of tasks, the problem is to assign to each team a sequential order of tasks to maximize the total number of assigned task...

  10. Crisscross Optimization Algorithm and Monte Carlo Simulation for Solving Optimal Distributed Generation Allocation Problem

    Directory of Open Access Journals (Sweden)

    Xiangang Peng

    2015-12-01

    Full Text Available Distributed generation (DG systems are integral parts in future distribution networks. In this paper, a novel approach integrating crisscross optimization algorithm and Monte Carlo simulation (CSO-MCS is implemented to solve the optimal DG allocation (ODGA problem. The feature of applying CSO to address the ODGA problem lies in three interacting operators, namely horizontal crossover, vertical crossover and competitive operator. The horizontal crossover can search new solutions in a hypercube space with a larger probability while in the periphery of each hypercube with a decreasing probability. The vertical crossover can effectively facilitate those stagnant dimensions of a population to escape from premature convergence. The competitive operator allows the crisscross search to always maintain in a historical best position to quicken the converge rate. It is the combination of the double search strategies and competitive mechanism that enables CSO significant advantage in convergence speed and accuracy. Moreover, to deal with system uncertainties such as the output power of wind turbine and photovoltaic generators, an MCS-based method is adopted to solve the probabilistic power flow. The effectiveness of the CSO-MCS method is validated on the typical 33-bus and 69-bus test system, and results substantiate the suitability of CSO-MCS for multi-objective ODGA problem.

  11. Heuristic for solving capacitor allocation problems in electric energy radial distribution networks

    Directory of Open Access Journals (Sweden)

    Maria A. Biagio

    2012-04-01

    Full Text Available The goal of the capacitor allocation problem in radial distribution networks is to minimize technical losses with consequential positive impacts on economic and environmental areas. The main objective is to define the size and location of the capacitors while considering load variations in a given horizon. The mathematical formulation for this planning problem is given by an integer nonlinear mathematical programming model that demands great computational effort to be solved. With the goal of solving this problem, this paper proposes a methodology that is composed of heuristics and Tabu Search procedures. The methodology presented explores network system characteristics of the network system reactive loads for identifying regions where procedures of local and intensive searches should be performed. A description of the proposed methodology and an analysis of computational results obtained which are based on several test systems including actual systems are presented. The solutions reached are as good as or better than those indicated by well referenced methodologies. The technique proposed is simple in its use and does not require calibrating an excessive amount of parameters, making it an attractive alternative for companies involved in the planning of radial distribution networks.

  12. Dynamical Allocation of Cellular Resources as an Optimal Control Problem: Novel Insights into Microbial Growth Strategies.

    Directory of Open Access Journals (Sweden)

    Nils Giordano

    2016-03-01

    Full Text Available Microbial physiology exhibits growth laws that relate the macromolecular composition of the cell to the growth rate. Recent work has shown that these empirical regularities can be derived from coarse-grained models of resource allocation. While these studies focus on steady-state growth, such conditions are rarely found in natural habitats, where microorganisms are continually challenged by environmental fluctuations. The aim of this paper is to extend the study of microbial growth strategies to dynamical environments, using a self-replicator model. We formulate dynamical growth maximization as an optimal control problem that can be solved using Pontryagin's Maximum Principle. We compare this theoretical gold standard with different possible implementations of growth control in bacterial cells. We find that simple control strategies enabling growth-rate maximization at steady state are suboptimal for transitions from one growth regime to another, for example when shifting bacterial cells to a medium supporting a higher growth rate. A near-optimal control strategy in dynamical conditions is shown to require information on several, rather than a single physiological variable. Interestingly, this strategy has structural analogies with the regulation of ribosomal protein synthesis by ppGpp in the enterobacterium Escherichia coli. It involves sensing a mismatch between precursor and ribosome concentrations, as well as the adjustment of ribosome synthesis in a switch-like manner. Our results show how the capability of regulatory systems to integrate information about several physiological variables is critical for optimizing growth in a changing environment.

  13. An Application of Stochastic Programming in Solving Capacity Allocation and Migration Planning Problem under Uncertainty

    OpenAIRE

    Yin-Yann Chen; Hsiao-Yao Fan

    2015-01-01

    The semiconductor packaging and testing industry, which utilizes high-technology manufacturing processes and a variety of machines, belongs to an uncertain make-to-order (MTO) production environment. Order release particularly originates from customer demand; hence, demand fluctuation directly affects capacity planning. Thus, managing capacity allocation is a difficult endeavor. This study aims to determine the best capacity allocation with limited resources to maximize the net profit. Three ...

  14. Hydrodynamic loads of sea waves on horizontal elements of berths with wave quenching chambers

    Directory of Open Access Journals (Sweden)

    Leshchenko Sergey Vladimirovich

    2014-05-01

    Full Text Available In the process of hydraulic structures design, in particular berths with wave cancelling structures, which serve to decrease the wave impact on structures, there appears a problem of vertical wave hydrodynamic loads calculation on floor slabs. In the existing normative documents there are no requirements on calculating vertical wave loads on the horizontal floor slabs of open-type structures (enveloping, mooring, approach trestles, etc. and stairs of sloping-staired open-type structures. A mathematical model is proposed for calculation of the vertical wave loads on the floor slab through moorings. The model is based on the theory of jet impact on a solid surface. The width of the wave crest, striking in the overlap of the pier, and its vertical velocity is determined by the linear wave theory. The coefficient of transmission of waves through wave quenching chambers is calculated according to the previously developed methods. Vertical wave loading is adjusted based on the ratio of the wave length and width of the overlay. Model validation is performed according to the hydraulic modelling interaction of waves with through berths in the port of Tuapse. 7 variants of their design were considered. Data mapping mathematical and hydraulic modeling showed them a close match.

  15. A Fairness Relation Based on the Asymmetric Choquet Integral and Its Application in Network Resource Allocation Problems

    Directory of Open Access Journals (Sweden)

    Aoi Honda

    2014-01-01

    Full Text Available The recent problem of network resource allocation is studied where pairs of users could be in a favourable situation, given that the allocation scheme is refined by some add-on technology. The general question here is whether the additional effort can be effective with regard to the user’s experience of fairness. The computational approach proposed in this paper to handle this question is based on the framework of relational optimization. For representing different weightings for different pairs of users, the use of a fuzzy measure appears to be reasonable. The generalized Choquet integrals are discussed from the viewpoint of representing fairness and it is concluded that the asymmetric Choquet integral is the most suitable approach. A binary relation using the asymmetric Choquet integral is proposed. In case of a supermodular fuzzy measure, this is a transitive and cycle-free relation. The price of fairness with regard to a wireless channel allocation problem taking channel interference into account is experimentally studied and it can be seen that the asymmetric on relation actually selects allocations that perform on average between maxmin fairness and proportional fairness, and being more close to maxmin fairness as long as channel interference is not high.

  16. Guidance and Control of Position and Attitude for Rendezvous and Dock/Berthing with a Noncooperative/Target Spacecraft

    Directory of Open Access Journals (Sweden)

    Gilberto Arantes

    2014-01-01

    Full Text Available Noncooperative target spacecrafts are those assets in orbit that cannot convey any information about their states (position, attitude, and velocities or facilitate rendezvous and docking/berthing (RVD/B process. Designing a guidance, navigation, and control (GNC module for the chaser in a RVD/B mission with noncooperative target should be inevitably solved for on-orbit servicing technologies. The proximity operations and the guidance for achieving rendezvous problems are addressed in this paper. The out-of-plane maneuvers of proximity operations are explored with distinct subphases, including a chaser far approach in the target’s orbit to the first hold point and a closer approach to the final berthing location. Accordingly, guidance solutions are chosen for each subphase from the standard Hill based Closhessy-Willtshire (CW solution, elliptical fly-around, and Glideslope algorithms. The control is based on a linear quadratic regulator approach (LQR. At the final berthing location, attitude tracker based on a proportional derivative (PD form is tested to synchronize the chaser and target attitudes. The paper analyzes the performance of both controllers in terms of the tracking ability and the robustness. Finally, it prescribes any restrictions that may be imposed on the guidance during any subphase which can help to improve the controllers tracking ability.

  17. Modeling of Channel Allocation in Broadband Powerline Communications Access Networks as a Multi-Criteria Optimization Problem

    Science.gov (United States)

    Haidine, Abdelfatteh; Lehnert, Ralf

    The planning process of the Broadband Powerline communications access networks contains two main problem parts: theGeneralized Base Station Placement (GBSP) problem and the PLC Channel Allocation Problem (P-CAP). The GBSP is investigated/solved in our previous works. In this paper, we focus on the P-CAP. The task of the P-CAP consists in allocating a sub-set of channels from an available set of PLC channels to each base station in the B-PLC site. Two optimization objectives are considered for the solution of this problem; namely the maximization of the resource reuse and the minimization of the generated interferences in the site. These objectives are conflicting, since the optimization of one of them results in the deterioration of the other. Therefore, this problem is modeled as a Multi-objective (or multi-criteria) Optimization Problem (MOP). Three variants of Pareto-based multi-objective algorithms, using evolutionary search, are used to solve it. Their performances are evaluated on four problem instances.

  18. Review of the Uruguayan Kidney Allocation System: the solution to a complex problem, preliminary data.

    Science.gov (United States)

    Bengochea, M; Alvarez, I; Toledo, R; Carretto, E; Forteza, D

    2010-01-01

    The National Kidney Transplant Program with cadaveric donors is based on centralized and unique waitlist, serum bank, and allocation criteria, approved by Instituto Nacional de Donación y Trasplante (INDT) in agreement with clinical teams. The median donor rates over last 3 years is 20 per million population and the median number of waitlist candidates is 450. The increased number of waiting list patients and the rapid aging of our populations demanded strategies for donor acceptance, candidate assignment, and analysis of more efficient and equitable allocation models. The objectives of the new national allocation system were to improve posttransplant patient and graft survivals, allow equal access to transplantation, and reduce waitlist times. The objective of this study was to analyze variables in our current allocation system and to create a mathematical/simulation model to evaluate a new allocation system. We compared candidates and transplanted patients for gender, age, ABO blood group, human leukocyte agents (HLA), percentage of reactive antibodies (PRA), and waiting list and dialysis times. Only 2 factors showed differences: highly sensitized and patients >65 years old (Bernoulli test). An agreement between INDT and Engineering Faculty yielded a major field of study. During 2008 the data analysis and model building began. The waiting list data of the last decade of donors and transplants were processed to develop a virtual model. We used inputs of candidates and donors, with outputs and structure of the simulation system to evaluate the proposed changes. Currently, the INDT and the Mathematics and Statistics Institute are working to develop a simulation model, that is able to analyze our new national allocation system.

  19. Performance impact of mutation operators of a subpopulation-based genetic algorithm for multi-robot task allocation problems.

    Science.gov (United States)

    Liu, Chun; Kroll, Andreas

    2016-01-01

    Multi-robot task allocation determines the task sequence and distribution for a group of robots in multi-robot systems, which is one of constrained combinatorial optimization problems and more complex in case of cooperative tasks because they introduce additional spatial and temporal constraints. To solve multi-robot task allocation problems with cooperative tasks efficiently, a subpopulation-based genetic algorithm, a crossover-free genetic algorithm employing mutation operators and elitism selection in each subpopulation, is developed in this paper. Moreover, the impact of mutation operators (swap, insertion, inversion, displacement, and their various combinations) is analyzed when solving several industrial plant inspection problems. The experimental results show that: (1) the proposed genetic algorithm can obtain better solutions than the tested binary tournament genetic algorithm with partially mapped crossover; (2) inversion mutation performs better than other tested mutation operators when solving problems without cooperative tasks, and the swap-inversion combination performs better than other tested mutation operators/combinations when solving problems with cooperative tasks. As it is difficult to produce all desired effects with a single mutation operator, using multiple mutation operators (including both inversion and swap) is suggested when solving similar combinatorial optimization problems.

  20. A New Biobjective Model to Optimize Integrated Redundancy Allocation and Reliability-Centered Maintenance Problems in a System Using Metaheuristics

    Directory of Open Access Journals (Sweden)

    Shima MohammadZadeh Dogahe

    2015-01-01

    Full Text Available A novel integrated model is proposed to optimize the redundancy allocation problem (RAP and the reliability-centered maintenance (RCM simultaneously. A system of both repairable and nonrepairable components has been considered. In this system, electronic components are nonrepairable while mechanical components are mostly repairable. For nonrepairable components, a redundancy allocation problem is dealt with to determine optimal redundancy strategy and number of redundant components to be implemented in each subsystem. In addition, a maintenance scheduling problem is considered for repairable components in order to identify the best maintenance policy and optimize system reliability. Both active and cold standby redundancy strategies have been taken into account for electronic components. Also, net present value of the secondary cost including operational and maintenance costs has been calculated. The problem is formulated as a biobjective mathematical programming model aiming to reach a tradeoff between system reliability and cost. Three metaheuristic algorithms are employed to solve the proposed model: Nondominated Sorting Genetic Algorithm (NSGA-II, Multiobjective Particle Swarm Optimization (MOPSO, and Multiobjective Firefly Algorithm (MOFA. Several test problems are solved using the mentioned algorithms to test efficiency and effectiveness of the solution approaches and obtained results are analyzed.

  1. The Manpower Allocation Problem with Time Windows and Job-Teaming Constraints: A Branch-and-Price Approach - Technical Report

    DEFF Research Database (Denmark)

    Hansen, Anders Dohn; Kolind, Esben; Clausen, Jens

    In this paper, we consider the Manpower Allocation Problem with Time Windows, Job-Teaming Constraints and a limited number of teams (m-MAPTWTC). Given a set of teams and a set of tasks, the problem is to assign to each team a sequential order of tasks to maximize the total number of assigned tasks....... Both teams and tasks may be restricted by time windows outside which operation is not possible. Some tasks require cooperation between teams, and all teams cooperating must initiate execution simultaneously. We present an IP-model for the problem, which is decomposed using Dantzig-Wolfe decomposition....... The problem is solved by column generation in a Branch-and-Price framework. Simultaneous execution of tasks is enforced by the branching scheme. To test the efficiency of the proposed algorithm, 12 realistic test instances are introduced. The algorithm is able to find the optimal solution in 11 of the test...

  2. An optimisation model for the warehouse design and product assignment and allocation problem

    OpenAIRE

    Geraldes, Carla A. S.; Carvalho, Sameiro; Pereira, Guilherme

    2013-01-01

    Warehouse design and planning is a great challenge in the field of Supply Chain Management. In this paper we discuss an optimisation model aiming to support some warehouse management decisions. In particular a mixed-integer programming model (MILP) is presented to determine product assignment and allocation to the functional areas, as well as the size of each area. Our aim is to capture the trade-offs among the different warehouse costs in order to achieve global optimal design satisfying th...

  3. A Heuristic Distributed Task Allocation Method for Multivehicle Multitask Problems and Its Application to Search and Rescue Scenario.

    Science.gov (United States)

    Zhao, Wanqing; Meng, Qinggang; Chung, Paul W H

    2016-04-01

    Using distributed task allocation methods for cooperating multivehicle systems is becoming increasingly attractive. However, most effort is placed on various specific experimental work and little has been done to systematically analyze the problem of interest and the existing methods. In this paper, a general scenario description and a system configuration are first presented according to search and rescue scenario. The objective of the problem is then analyzed together with its mathematical formulation extracted from the scenario. Considering the requirement of distributed computing, this paper then proposes a novel heuristic distributed task allocation method for multivehicle multitask assignment problems. The proposed method is simple and effective. It directly aims at optimizing the mathematical objective defined for the problem. A new concept of significance is defined for every task and is measured by the contribution to the local cost generated by a vehicle, which underlies the key idea of the algorithm. The whole algorithm iterates between a task inclusion phase, and a consensus and task removal phase, running concurrently on all the vehicles where local communication exists between them. The former phase is used to include tasks into a vehicle's task list for optimizing the overall objective, while the latter is to reach consensus on the significance value of tasks for each vehicle and to remove the tasks that have been assigned to other vehicles. Numerical simulations demonstrate that the proposed method is able to provide a conflict-free solution and can achieve outstanding performance in comparison with the consensus-based bundle algorithm.

  4. 集装箱码头泊位及岸桥管理的SIMIO仿真研究%Simulation of Berth and Quay Crane Management for Container Terminal Based on SIMIO

    Institute of Scientific and Technical Information of China (English)

    李绍武; 王筱雨

    2015-01-01

    通过 SIMIO 仿真软件对某集装箱码头的靠泊、装卸以及水平运输作业过程进行仿真建模,为船舶到港、泊位分配以及岸桥借调过程设定了更准确的过程逻辑,并设计了不同的泊位-岸桥分配调度模型,优化目标为最小化单船平均在港时间。通过分析仿真结果得出了一个较优的泊位分配和岸桥调度方案,为码头的运营与管理提供了参考,也为 SIMIO 在集装箱码头以及物流集散中心作业过程的仿真研究提供了一些新的思路。%Simulations are performed for a real container terminal in terms of berth allocation, cargo loading/unloading and horizontal traffic by using the simulation software SIMIO, in which more precise process logics are designed for the process of containership arriving, berth allocation and quay crane dispatching. Models are designed for different berth allocations and quay crane assignments, aiming at minimizing the average staying time of each containership. An optimization scheme of berth allocation and quay crane assignment is obtained based on analysis of simulation results, which may be taken as a basis for terminal operation and management, and provides some new thoughts for simulations of container terminal and cargo logistic center operation process by SIMIO.

  5. An Application of Stochastic Programming in Solving Capacity Allocation and Migration Planning Problem under Uncertainty

    Directory of Open Access Journals (Sweden)

    Yin-Yann Chen

    2015-01-01

    Full Text Available The semiconductor packaging and testing industry, which utilizes high-technology manufacturing processes and a variety of machines, belongs to an uncertain make-to-order (MTO production environment. Order release particularly originates from customer demand; hence, demand fluctuation directly affects capacity planning. Thus, managing capacity allocation is a difficult endeavor. This study aims to determine the best capacity allocation with limited resources to maximize the net profit. Three bottleneck stations in the semiconductor packaging and testing process are mainly investigated, namely, die bond (DB, wire bond (WB, and molding (MD stations. Deviating from previous studies that consider the deterministic programming model, customer demand in the current study is regarded as an uncertain parameter in formulating a two-stage scenario-based stochastic programming (SP model. The SP model seeks to respond to sharp demand fluctuations. Even if future demand is uncertain, migration decision for machines and tools will still obtain better robust results for various demand scenarios. A hybrid approach is proposed to solve the SP model. Moreover, two assessment indicators, namely, the expected value of perfect information (EVPI and the value of the stochastic solution (VSS, are adopted to compare the solving results of the deterministic planning model and stochastic programming model. Sensitivity analysis is performed to evaluate the effects of different parameters on net profit.

  6. Heuristics for the Buffer Allocation Problem with Collision Probability Using Computer Simulation

    Directory of Open Access Journals (Sweden)

    Eishi Chiba

    2015-01-01

    Full Text Available The standard manufacturing system for Flat Panel Displays (FPDs consists of a number of pieces of equipment in series. Each piece of equipment usually has a number of buffers to prevent collision between glass substrates. However, in reality, very few of these buffers seem to be used. This means that redundant buffers exist. In order to reduce cost and space necessary for manufacturing, the number of buffers should be minimized with consideration of possible collisions. In this paper, we focus on an in-line system in which each piece of equipment can have any number of buffers. In this in-line system, we present a computer simulation method for the computation of the probability of a collision occurring. Based on this method, we try to find a buffer allocation that achieves the smallest total number of buffers under an arbitrarily specified collision probability. We also implement our proposed method and present some computational results.

  7. Multiobjective Optimization Model for Pricing and Seat Allocation Problem in Non Profit Performing Arts Organization

    DEFF Research Database (Denmark)

    Baldin, Andrea; Bille, Trine; Ellero, Andrea

    The implementation of Revenue Management (RM) techniques in non profit performing arts organizations presents new challenges compared to other sectors, such as transportion or hospitality industries, in which these techniques are more consolidated. Indeed, performing arts organizations are charac......The implementation of Revenue Management (RM) techniques in non profit performing arts organizations presents new challenges compared to other sectors, such as transportion or hospitality industries, in which these techniques are more consolidated. Indeed, performing arts organizations...... is to incentive the customers to discriminate among themselves according to their reservation price, offering a schedule of different prices corresponding to different seats in the venue. In this context, price and allocation of the theatre seating area are decision variables that allow theatre managers to manage...... of heterogeneity among customer categories in both choice and demand. The proposed model is validated with booking data referring to the Royal Danish Theatre during the period 2010-2015....

  8. Scenario-based modeling for multiple allocation hub location problem under disruption risk: multiple cuts Benders decomposition approach

    Science.gov (United States)

    Yahyaei, Mohsen; Bashiri, Mahdi

    2017-03-01

    The hub location problem arises in a variety of domains such as transportation and telecommunication systems. In many real-world situations, hub facilities are subject to disruption. This paper deals with the multiple allocation hub location problem in the presence of facilities failure. To model the problem, a two-stage stochastic formulation is developed. In the proposed model, the number of scenarios grows exponentially with the number of facilities. To alleviate this issue, two approaches are applied simultaneously. The first approach is to apply sample average approximation to approximate the two stochastic problem via sampling. Then, by applying the multiple cuts Benders decomposition approach, computational performance is enhanced. Numerical studies show the effective performance of the SAA in terms of optimality gap for small problem instances with numerous scenarios. Moreover, performance of multi-cut Benders decomposition is assessed through comparison with the classic version and the computational results reveal the superiority of the multi-cut approach regarding the computational time and number of iterations.

  9. A note on the sensitivity of the strategic asset allocation problem

    Directory of Open Access Journals (Sweden)

    W.J. Hurley

    2015-12-01

    Full Text Available The Markowitz mean–variance portfolio optimization problem is a quadratic programming problem whose first-order conditions require the solution of a linear system. It is well known that the optimal portfolio weights are sensitive to parameter estimates, particularly the mean return vector. This has generally been attributed to the interaction of estimation error and optimization. In this paper we present some examples that suggest the linear system produced by the first-order conditions is ill-conditioned and it is this property that gives rise to the sensitivity of the optimal weights.

  10. Experimental Study on Allowable Berthing and Mooring Conditions of An Oil Tanker

    Institute of Scientific and Technical Information of China (English)

    张日向; 刘忠波; 张宁川; 韩丽华

    2003-01-01

    When an oil tanker under the combined action of wind, waves and tidal current and is berthed or moored to a platform, the impact forces on the fenders and the tensile force in the mooring lines are important factors in the studies of berthing and mooring conditions. Based on the experiment of a berthing and mooring tanker model under the action of wind, wave and tidal current in the same direction, this paper studies the allowable berthing and mooring conditions by considering the tensile forces of mooring lines and impact forces on the fenders, as well as the impact energy on the fenders. And a method has been proposed here for motion amplitude analysis. A successful method to decrease impact forces on the fenders is put forward. Blowing-in wind and blowing-off wind and different angles between waves and the fenders are considered in the experimental study. In the berthing tests of the tanker model, the impact forces are measured and the impact energy is calculated, then the berthing conditions are determined. In the mooring tests of the tanker model, the mooring line tensile forces and impact forces are measured, and the allowable mooring conditions are given that will be useful to engineering design.

  11. Identifying and prioritizing the preference criteria using analytical hierarchical process for a student-lecturer allocation problem of internship programme

    Science.gov (United States)

    Faudzi, Syakinah; Abdul-Rahman, Syariza; Rahman, Rosshairy Abd; Hew, Jafri Hj. Zulkepli

    2016-10-01

    This paper discusses on identifying and prioritizing the student's preference criteria towards supervisor using Analytical Hierarchical Process (AHP) for student-lecturer allocation problem of internship programme. Typically a wide number of students undertake internship every semester and many preferences criteria may involve when assigning students to lecturer for supervision. Thus, identifying and prioritizing the preference criteria of assigning students to lecturer is critically needed especially when involving many preferences. AHP technique is used to prioritize the seven criteria which are capacity, specialization, academic position, availability, professional support, relationship and gender. Student's preference alternative is classified based on lecturer's academic position which are lecturer, senior lecturer, associate professor and professor. Criteria are ranked to find the best preference criteria and alternatives of the supervisor that students prefer to have. This problem is solved using Expert Choice 11 software. A sample of 30 respondents who are from semester 6 and above are randomly selected to participate in the study. By using questionnaire as our medium in collecting the student's data, consistency index is produced to validate the proposed study. Findings and result showed that, the most important preference criteria is professional support. It is followed by specialization, availability, relationship, gender, academic position and capacity. This study found that student would like to have a supportive supervisor because lack of supervision can lead the students to achieve low grade and knowledge from the internship session.

  12. 凹资源配置问题的混合动态规划方法%A Hybrid Dynamic Programming Method for Concave Resource Allocation Problems

    Institute of Scientific and Technical Information of China (English)

    姜计荣; 孙小玲

    2005-01-01

    Concave resource allocation problem is an integer programming problem of minimizing a nonincreasing concave function subject to a convex nondecreasing constraint and bounded integer variables. This class of problems are encountered in optimization models involving economies of scale. In this paper, a new hybrid dynamic programming method was proposed for solving concave resource allocation problems. A convex underestimating function was used to approximate the objective function and the resulting convex subproblem was solved with dynamic programming technique after transforming it into a 0-1 linear knapsack problem. To ensure the convergence, monotonicity and domain cut technique was employed to remove certain integer boxes and partition the Reviseddomain into a union of integer boxes. Computational results were given to show the efficiency of the algorithm.

  13. Consistently Trained Artificial Neural Network for Automatic Ship Berthing Control

    Directory of Open Access Journals (Sweden)

    Y.A. Ahmed

    2015-09-01

    Full Text Available In this paper, consistently trained Artificial Neural Network controller for automatic ship berthing is discussed. Minimum time course changing manoeuvre is utilised to ensure such consistency and a new concept named ‘virtual window’ is introduced. Such consistent teaching data are then used to train two separate multi-layered feed forward neural networks for command rudder and propeller revolution output. After proper training, several known and unknown conditions are tested to judge the effectiveness of the proposed controller using Monte Carlo simulations. After getting acceptable percentages of success, the trained networks are implemented for the free running experiment system to judge the network’s real time response for Esso Osaka 3-m model ship. The network’s behaviour during such experiments is also investigated for possible effect of initial conditions as well as wind disturbances. Moreover, since the final goal point of the proposed controller is set at some distance from the actual pier to ensure safety, therefore a study on automatic tug assistance is also discussed for the final alignment of the ship with actual pier.

  14. An improvement of a beam search method for warehouse storage allocation planning problems minimizing the number of operations and the aggregated number of products for each customer

    Science.gov (United States)

    Nishi, Tatsushi; Yamamoto, Shinichiro; Konishi, Masami

    The storage allocation planning problem in warehouse management is to determine the allocation of products to the storage space and intermediate operations for retrieving products so as to minimize the number of operations, and maximize the collected number of products for each customer when the sequence of requests for inlet and retrieval operations are given. In this paper, we propose an efficient beam search method for generating a near optimal solution with a reasonable computation time. A heuristic procedure is also proposed in order to reduce a search space in the beam search method by using the information of subsequent inlet and retrieving requests. The validity of the proposed method is confirmed by comparing the results with the optimal solution derived by solving an MILP problem. The effectiveness of the proposed method is demonstrated by solving an actual large-sized problem consisting of more than 3000 operations.

  15. Developing a bi-objective optimization model for solving the availability allocation problem in repairable series-parallel systems by NSGA II

    Science.gov (United States)

    Amiri, Maghsoud; Khajeh, Mostafa

    2016-11-01

    Bi-objective optimization of the availability allocation problem in a series-parallel system with repairable components is aimed in this paper. The two objectives of the problem are the availability of the system and the total cost of the system. Regarding the previous studies in series-parallel systems, the main contribution of this study is to expand the redundancy allocation problems to systems that have repairable components. Therefore, the considered systems in this paper are the systems that have repairable components in their configurations and subsystems. Due to the complexity of the model, a meta-heuristic method called as non-dominated sorting genetic algorithm is applied to find Pareto front. After finding the Pareto front, a procedure is used to select the best solution from the Pareto front.

  16. 76 FR 38155 - California State Nonroad Engine Pollution Control Standards; Ocean-Going Vessels At-Berth in...

    Science.gov (United States)

    2011-06-29

    ... Regulation is designed to reduce emissions of oxides of nitrogen and particulate matter from auxiliary diesel... restricted by statute. EPA's Office of Transportation and Air Quality also maintains a webpage that contains... California ports (``At-Berth Regulation'').\\1\\ The At-Berth Regulation is designed to significantly...

  17. 一类带时间窗车辆分配问题的贪婪算法%Greedy Algorithm for the Vehicle Allocation Problem With Time Windows

    Institute of Scientific and Technical Information of China (English)

    李冰; 轩华

    2013-01-01

      本文对一类带时间窗的车辆分配问题进行了分析,引入了车辆任务的概念,并将问题转化为车辆与车辆任务的匹配问题,同时制订了运输任务选择和车辆选择的贪婪策略,并在此基础上设计了车辆分配问题的贪婪算法,最后通过实例验证了算法的有效性。%A vehicle allocation problem with time windows is analyzed .The concept of vehicle task is defined . The vehicle allocation problem is transformed into the problem : the vehicle matches the vehicle task .And the greedy method of choice transportation task and vehicle are instituted .On the basis of the above, the greedy al-gorithm on vehicle allocation is devised.At last a case is proved to validate the feasibility of the algorithm .

  18. 教育资源配置的价值取向问题研究%A Study on the Value Orientation Problems of Allocation of Educational Resources

    Institute of Scientific and Technical Information of China (English)

    张国强

    2015-01-01

    The essence of allocation of educational resources is the interest game among the various stakeholders of educational resources. Different value orientations not only guide the policy-making of allocation of educational resources but also regulate the formation of patterns and ways about allocation of educational resources. Fairness and efficiency are the basic principles and the essential value orientations for allocation of educational resources,and there is a spiral relationship between them. The value orientations which can solve practical problems are based on the unity of fairness and efficiency in practical education. The key to realizing the integration of three kinds of value orientations is that all kinds of stakeholders should join the policy-making and implementation of allocation of educational resources. In particular,importance should be attached to the weak interest groups.%教育资源配置的实质是教育资源的各类利益相关者之间的利益博弈,不同的价值取向不仅导引着教育资源配置政策制定,也规约着教育资源配置格局和方式的形成。公平与效率是教育资源配置的两个基本原则,也是教育资源配置的两个基本价值取向,两者之间存在着螺旋上升的关系。而解决现实问题的价值取向则是基于教育实际的“公平”与“效率”的统一。实现三种价值取向的融合关键是各类利益相关者加入到教育资源配置政策制定和执行中来,尤其是要加强对弱势利益群体的重视。

  19. Dynamism in a Semiconductor Industrial Machine Allocation Problem using a Hybrid of the Bio-inspired and Musical-Harmony Approach

    Science.gov (United States)

    Kalsom Yusof, Umi; Nor Akmal Khalid, Mohd

    2015-05-01

    Semiconductor industries need to constantly adjust to the rapid pace of change in the market. Most manufactured products usually have a very short life cycle. These scenarios imply the need to improve the efficiency of capacity planning, an important aspect of the machine allocation plan known for its complexity. Various studies have been performed to balance productivity and flexibility in the flexible manufacturing system (FMS). Many approaches have been developed by the researchers to determine the suitable balance between exploration (global improvement) and exploitation (local improvement). However, not much work has been focused on the domain of machine allocation problem that considers the effects of machine breakdowns. This paper develops a model to minimize the effect of machine breakdowns, thus increasing the productivity. The objectives are to minimize system unbalance and makespan as well as increase throughput while satisfying the technological constraints such as machine time availability. To examine the effectiveness of the proposed model, results for throughput, system unbalance and makespan on real industrial datasets were performed with applications of intelligence techniques, that is, a hybrid of genetic algorithm and harmony search. The result aims to obtain a feasible solution to the domain problem.

  20. Berth-Crane AIIocation ProbIem Based on MuIti-Agent with the Preferences of Berthing Position%基于多Agent的偏好泊位约束下泊位-岸桥分配

    Institute of Scientific and Technical Information of China (English)

    朱硕博; 金永贺

    2016-01-01

    泊位和岸桥是码头前沿最宝贵的资源,为其设计合理调度机制能够获得更高的效能。考虑连续泊位的岸线,加入偏好泊位约束条件,以最小化偏离偏好泊位成本为目标函数,结合多Agent的智能化特点,提出基于多Agent的联合调度模型,在模型基础上设计分步的遗传算法,实现高效的泊位岸桥联合调度。并用实验证明模型和算法的有效性,实验结果验证引入偏好泊位约束条件确实能提高码头作业效率,降低因偏离偏好泊位带来的成本。%Berth and crane are the most precious resources, making reasonable design for the scheduling mechanism can make full use of resources. Considers the continuous berth with preference berthing constraints, to minimize the deviation from the berth preference cost as objective function, combined with the Multi-Agent’s intelligent characteristics, proposes a scheduling model based on Multi-Agent. Designs a new genetic algorithm bases on the model to achieve efficient berth crane scheduling. And makes example to prove the validity of the model and algorithm. The experimental results verify the introduction of preference constraints can efficiency improve the berth handling, and also can reduce the cost caused by the deviation from the berth preference.

  1. Allocation of Capacitors and Voltage Regulators in Unbalanced Distribution Systems: A Multi-objective Problem in Probabilistic Frameworks

    Science.gov (United States)

    Carpinelli, Guido; Noce, Christian; Russo, Angela; Varilone, Pietro

    2014-12-01

    Capacitors and series voltage regulators are used extensively in distribution systems to reduce power losses and improve the voltage profile along the feeders. This paper deals with the problem of contemporaneously choosing optimal locations and sizes for both capacitors and series voltage regulators in three-phase, unbalanced distribution systems. This is a mixed, non-linear, constrained, multi-objective optimization problem that usually is solved in deterministic scenarios. However, distribution systems are stochastic in nature, which can lead to inaccurate deterministic solutions. To take into account the unavoidable uncertainties that affect the input data related to the problem, in this paper, we have formulated and solved the multi-objective optimization problem in probabilistic scenarios. To address the multi-objective optimization problem, algorithms were used in which all the objective functions were combined to form a single function. These algorithms allow us to transform the original multi-objective optimization problem into an equivalent, single-objective, optimization problem, an approach that appeared to be particularly suitable since computational time was an important issue. To further reduce the computational efforts, a linearized form of the equality constraints of the optimization model was used, and a micro-genetic algorithm-based procedure was applied in the solution method.

  2. 某区域军队卫生人力资源配置的问题及对策%Problems of Military Health Human Resources Allocation and Countermeasures

    Institute of Scientific and Technical Information of China (English)

    李海博; 杨鸿洋; 张鹭鹭

    2012-01-01

    目的 分析某区域军队卫生人力资源配置存在的问题及其影响因素,为合理配置卫生人力资源及实现可持续发展提供建议.方法 以现有资料、现场调查资料为基础,将描述性研究与分析性研究相结合,对某区域军队卫生人力资源配置的问题及影响因素进行系统分析.结果 某区域军队卫生人力资源超缺编并存;医院、疗养院人才结构不尽合理;部队卫生机构技术水平不高,专业队伍不够稳定;卫生士官队伍编制不合理,培养层次较低.结论 应优化卫生人力资源结构,提高部队卫生人才数量和质量,强化军医大学培养的地位与作用.%Objective Analyze the problems of military health manpower resource allocations and influence factors, and provide recommendations to make decision of rational allocation of health human resources and a-chieve sustainable development. Methods Based on existing data, field survey data, descriptive and analytical a-nalysis methods were adopted to study the allocation of military health human resources and the influence factors. Results The allocation of military health human resources was uneven as overmany and less coexist; the personnel structure of hospital and sanatorium were not reasonable; service abilities of the primary health institution were weak and the service staff were not stable; the structure of health noncommissioned officers was unreasonable and the cultivation objective was of lower level. Conclusions We should optimize the structure of health human resources, improve the quantity and quality of military health personnel, and improve the role of the military medical university in cultivation of health human resources.

  3. ESG Allocations

    Data.gov (United States)

    Department of Housing and Urban Development — This report displays the Emergency Solutions Grants (ESG), formerly Emergency Shelter Grants, allocation by jurisdiction. The website allows users to look at...

  4. Numerical Prediction of Hydrodynamic Forces on A Berthed Ship Induced by A Passing Ship in Different Waterway Geometries

    Institute of Scientific and Technical Information of China (English)

    王宏志; 邹早建

    2016-01-01

    An investigation has been conducted to quantify the effect of waterway geometry on the form and magnitude of forces and moment experienced by a berthed ship due to a passing ship. By using the dynamic mesh technique and solving the unsteady RANS equations in conjunction with a RNGk−ε turbulence model, numerical simulation of the three-dimensional unsteady viscous flow around a passing ship and a berthed ship in different waterway geometries is conducted, and the hydrodynamic forces and moment acting on the berthed ship are calculated. The proposed method is verified by comparing the numerical results with existing empirical curves and a selection of results from model scale experiments. The calculated interaction forces and moment are presented for six different waterway geometries. The magnitude of the peak values and the form of the forces and moment on the berthed ship for different cases are investigated to assess the effect of the waterway geometry.The results of present study can provide certain guidance on safe maneuvering of a ship passing by a berthed ship.

  5. Risk capital allocation

    DEFF Research Database (Denmark)

    Hougaard, Jens Leth; Smilgins, Aleksandrs

    Risk capital allocation problems have been widely discussed in the academic literature. We consider a company with multiple subunits having individual portfolios. Hence, when portfolios of subunits are merged, a diversification benefit arises: the risk of the company as a whole is smaller than...

  6. Allocating outsourced warranty service contracts

    NARCIS (Netherlands)

    M. Opp; I. Adan; V.G. Kulkarni; J.M. Swaminathan

    2009-01-01

    Motivated by our interactions with a leading manufacturer of computers, in this paper we consider static allocation as applied to the problem of minimizing the costs of outsourcing warranty services to repair vendors. Under static allocation, a manufacturer assigns each item to one of several contra

  7. Discussion of Optimal Allocation of Resources Theory for Communication Enterprises

    Institute of Scientific and Technical Information of China (English)

    JIN Xiao-lin; YU Hua; SU Hua-ying

    2004-01-01

    The theory on the resource optimal allocation is discussed in this article. On the base of the discussion, for the main problems existing in the resource allocation of communication enterprises, the reasonable allocating measures are put forward.

  8. Cost Allocation and Convex Data Envelopment

    DEFF Research Database (Denmark)

    Hougaard, Jens Leth; Tind, Jørgen

    This paper considers allocation rules. First, we demonstrate that costs allocated by the Aumann-Shapley and the Friedman-Moulin cost allocation rules are easy to determine in practice using convex envelopment of registered cost data and parametric programming. Second, from the linear programming...... problems involved it becomes clear that the allocation rules, technically speaking, allocate the non-zero value of the dual variable for a convexity constraint on to the output vector. Hence, the allocation rules can also be used to allocate inefficiencies in non-parametric efficiency measurement models...... such as Data Envelopment Analysis (DEA). The convexity constraint of the BCC model introduces a non-zero slack in the objective function of the multiplier problem and we show that the cost allocation rules discussed in this paper can be used as candidates to allocate this slack value on to the input (or output...

  9. Cost Allocation and Convex Data Envelopment

    DEFF Research Database (Denmark)

    Hougaard, Jens Leth; Tind, Jørgen

    This paper considers allocation rules. First, we demonstrate that costs allocated by the Aumann-Shapley and the Friedman-Moulin cost allocation rules are easy to determine in practice using convex envelopment of registered cost data and parametric programming. Second, from the linear programming...... such as Data Envelopment Analysis (DEA). The convexity constraint of the BCC model introduces a non-zero slack in the objective function of the multiplier problem and we show that the cost allocation rules discussed in this paper can be used as candidates to allocate this slack value on to the input (or output...... problems involved it becomes clear that the allocation rules, technically speaking, allocate the non-zero value of the dual variable for a convexity constraint on to the output vector. Hence, the allocation rules can also be used to allocate inefficiencies in non-parametric efficiency measurement models...

  10. The effect of early berthing prospects on the energy efficiency operational index in oil tanker vessels

    Science.gov (United States)

    Acomi, N.; Acomi, O. C.

    2016-08-01

    Marine pollution is one of the main concerns of our society. In order to reduce air pollution produced by ships, the International Maritime Organization has developed technical, operational and management measures. Part of the operational measures refers to CO2 emissions that contribute to the energy efficiency of the vessel. The difficulty in assessing the energy efficiency of the vessel rests with the diversity of voyage parameters, including quantity of cargo, distance and type of fuel in use. Assessing the energy efficiency of the vessel is thus not a matter of determining the absolute value of the CO2, but of providing a meaningful construct to enable tracking performance trends over time, for the same ship, a fleet of ships or across the industry. This concept is the Energy Efficiency Operational Index, EEOI. The purpose of this study is to analyse the influence of a well predicted voyage on the EEOI value. The method used consists in a comparative analysis of two situations regarding berthing prospects: the real passage plan and an early prediction that supposes the vessel to arrive on time as required. The results of the study represent a monitoring tool for the ship owners to assess the EEOI from the early stage of designing the berthing prospects.

  11. The Mooring Pattern Study for Q-Flex Type LNG Carriers Scheduled for Berthing at Ege Gaz Aliaga LNG Terminal

    Directory of Open Access Journals (Sweden)

    Selcuk Nas

    2014-12-01

    Full Text Available Ever growing energy industry requires larger quantities of LNG to be transported by bigger ships between terminals. Every day, new kind of large vessels created by new technologies, and these are used to trade around the globe. This is the dynamic change in shipping industry. But on the other hand these new vessels need to safely berth to existing terminals which we may accept as more static part of the trade. Thus this study born by the request of Ege Gaz Aliaga LNG Terminal management to determine if it is safe to berth to the terminal by a new breed of large LNG carrier type named as Q-Flex and Q-Max. Transas Bridge Simulator NTPRO 5000 series was used in this study for extensive experiments which had been simulated by the use of hook function. During the study, every force applied to mooring hooks and dolphins by the ship lines were divided into 3 dimensions and then measured by simulation experiments. With analysis of the data, required hook and dolphins strengths were determined for the safe mooring arrangements. Upon the completion of the study Ege Gaz Aliaga LNG Terminal became the first safe berth for Q-Flex type vessels in the Mediterranean and the Black Sea. And finally all experiments were confirmed with real life experience when the first Q-Flex type LNG carrier berthed to the Ege Gaz Aliaga LNG Terminal.

  12. Cost allocation in distribution planning

    Energy Technology Data Exchange (ETDEWEB)

    Engevall, S.

    1996-12-31

    This thesis concerns cost allocation problems in distribution planning. The cost allocation problems we study are illustrated using the distribution planning situation at the Logistics department of Norsk Hydro Olje AB. The planning situation is modeled as a Traveling Salesman Problem and a Vehicle Routing Problem with an inhomogeneous fleet. The cost allocation problems are the problems of how to divide the transportation costs among the customers served in each problem. The cost allocation problems are formulated as cooperative games, in characteristic function form, where the customers are defined to be the players. The games contain five and 21 players respectively. Game theoretical solution concepts such as the core, the nucleolus, the Shapley value and the {tau}-value are discussed. From the empirical results we can, among other things, conclude that the core of the Traveling Salesman Game is large, and that the core of the Vehicle Routing Game is empty. In the accounting of Norsk Hydro the cost per m{sup 3} can be found for each tour. We conclude that for a certain definition of the characteristic function, a cost allocation according to this principle will not be included in the core of the Traveling Salesman Game. The models and methods presented in this thesis can be applied to transportation problems similar to that of Norsk Hydro, independent of the type of products that are delivered. 96 refs, 11 figs, 26 tabs

  13. A States of Matter Search-Based Approach for Solving the Problem of Intelligent Power Allocation in Plug-in Hybrid Electric Vehicles

    Directory of Open Access Journals (Sweden)

    Arturo Valdivia-Gonzalez

    2017-01-01

    Full Text Available Recently, many researchers have proved that the electrification of the transport sector is a key for reducing both the emissions of green-house pollutants and the dependence on oil for transportation. As a result, Plug-in Hybrid Electric Vehicles (or PHEVs are receiving never before seen increased attention. Consequently, large-scale penetration of PHEVs into the market is expected to take place in the near future, however, an unattended increase in the PHEVs needs may cause several technical problems which could potentially compromise the stability of power systems. As a result of the growing necessity for addressing such issues, topics related to the optimization of PHEVs’ charging infrastructures have captured the attention of many researchers. Related to this, several state-of-the-art swarm optimization methods (such as the well-known Particle Swarm Optimization (PSO or the recently proposed Gravitational Search Algorithm (GSA approach have been successfully applied in the optimization of the average State of Charge (SoC, which represents one of the most important performance indicators in the context of PHEVs’ intelligent power allocation. Many of these swarm optimization methods, however, are known to be subject to several critical flaws, including premature convergence and a lack of balance between the exploration and exploitation of solutions. Such problems are usually related to the evolutionary operators employed by each of the methods on the exploration and exploitation of new solutions. In this paper, the recently proposed States of Matter Search (SMS swarm optimization method is proposed for maximizing the average State of Charge of PHEVs within a charging station. In our experiments, several different scenarios consisting on different numbers of PHEVs were considered. To test the feasibility of the proposed approach, comparative experiments were performed against other popular PHEVs’ State of Charge maximization approaches

  14. Allocations for Heterogenous Distributed Storage

    CERN Document Server

    Ntranos, Vasileios; Dimakis, Alexandros G

    2012-01-01

    We study the problem of storing a data object in a set of data nodes that fail independently with given probabilities. Our problem is a natural generalization of a homogenous storage allocation problem where all the nodes had the same reliability and is naturally motivated for peer-to-peer and cloud storage systems with different types of nodes. Assuming optimal erasure coding (MDS), the goal is to find a storage allocation (i.e, how much to store in each node) to maximize the probability of successful recovery. This problem turns out to be a challenging combinatorial optimization problem. In this work we introduce an approximation framework based on large deviation inequalities and convex optimization. We propose two approximation algorithms and study the asymptotic performance of the resulting allocations.

  15. 基于聚类算法的多无人机系统任务分配%A Study on the Task Allocation Problem for Multi-UAV System Based on Clustering Algorithm

    Institute of Scientific and Technical Information of China (English)

    龙国庆; 祝小平; 董世友

    2011-01-01

    针对现有任务分配方法在任务点较多时不易解算,且计算量大的问题,提出了基于模糊C-均值聚类算法的多无人机系统任务分配方法.首先,利用模糊C-均值聚类算法得到的隶属度矩阵对任务点进行初始分配;其次,针对基于空间划分聚类可能造成各UAV任务不均衡的问题,设计任务的局部优化调整规则;最后,结合单旅行商问题,利用Tabu Search算法为各UAV设计最优任务航线.仿真结果表明,该方法能有效解决多无人机系统的任务分配问题,算法具有较好的时效性.%Aiming to reduce the computational complexity of the present task allocation strategy,a method of task allocation for Multi-UAV system is proposed based on the fuzzy C-means clustering algorithm.First of all,initial task allocation is achieved based on the membership degree matrix of task points; secondly,the initial task allocation plan is partially adjusted to achieve the relative balance of each UAV's task; finally,with the model of the single traveling salesman problem,the optimal task route of each UAV is calculated by Tabu Search Algorithm.The simulation results show that this method can effectively solve the multi-UAV task allocation problem,and the algorithm has a better timeliness.

  16. Applied cost allocation

    DEFF Research Database (Denmark)

    Bogetoft, Peter; Hougaard, Jens Leth; Smilgins, Aleksandrs

    2016-01-01

    This paper deals with empirical computation of Aumann–Shapley cost shares for joint production. We show that if one uses a mathematical programing approach with its non-parametric estimation of the cost function there may be observations in the data set for which we have multiple Aumann......–Shapley prices. We suggest to overcome such problems by using lexicographic goal programing techniques. Moreover, cost allocation based on the cost function is unable to account for differences between efficient and actual cost. We suggest to employ the notion of rational inefficiency in order to supply a set...... of assumptions concerning firm behavior. These assumptions enable us to connect inefficient with efficient production and thereby provide consistent ways of allocating the costs arising from inefficiency....

  17. Modeling and Solving the Three Seaside Operational Problems Using an Object-Oriented and Timed Predicate/Transition Net

    Directory of Open Access Journals (Sweden)

    Hsien-Pin Hsu

    2017-02-01

    Full Text Available Container terminals (CTs play an essential role in the global transportation system. To deal with growing container shipments, a CT needs to better solve the three essential seaside operational problems; berth allocation problem (BAP, quay crane assignment problem (QCAP, and quay crane scheduling problem (QCSP, which affect the performance of a CT considerably. In past studies, the three seaside operational problems have often been solved individually or partially, which is likely to result in poor overall system performance. However, solving the three seaside operational problems simultaneously is in fact a very complicated task. In this research, we dealt with the three seaside operational problems at the same time by using a novel high-level Petri net, termed an Object-Oriented and Timed Predicate/Transition Net (OOTPr/Tr net. After defining the three seaside operational problems formally, we integrated them as a three-level framework that was further transformed into an OOTPr/Tr net model. Then, using the Prolog programming language, we implemented this model as a simulation tool to find the best solution based on the various combinations of heuristic rules used.

  18. Residency Allocation Database

    Data.gov (United States)

    Department of Veterans Affairs — The Residency Allocation Database is used to determine allocation of funds for residency programs offered by Veterans Affairs Medical Centers (VAMCs). Information...

  19. Divergence in plant and microbial allocation strategies explains continental patterns in microbial allocation and biogeochemical fluxes.

    Science.gov (United States)

    Averill, Colin

    2014-10-01

    Allocation trade-offs shape ecological and biogeochemical phenomena at local to global scale. Plant allocation strategies drive major changes in ecosystem carbon cycling. Microbial allocation to enzymes that decompose carbon vs. organic nutrients may similarly affect ecosystem carbon cycling. Current solutions to this allocation problem prioritise stoichiometric tradeoffs implemented in plant ecology. These solutions may not maximise microbial growth and fitness under all conditions, because organic nutrients are also a significant carbon resource for microbes. I created multiple allocation frameworks and simulated microbial growth using a microbial explicit biogeochemical model. I demonstrate that prioritising stoichiometric trade-offs does not optimise microbial allocation, while exploiting organic nutrients as carbon resources does. Analysis of continental-scale enzyme data supports the allocation patterns predicted by this framework, and modelling suggests large deviations in soil C loss based on which strategy is implemented. Therefore, understanding microbial allocation strategies will likely improve our understanding of carbon cycling and climate.

  20. Distributed algorithms for resource allocation and routing

    OpenAIRE

    Hu, Zengjian

    2007-01-01

    In this thesis, we study distributed algorithms in the context of two fundamental problems in distributed systems, resource allocation and routing. Resource allocation studies how to distribute workload evenly to resources. We consider two different resource allocation models, the diffusive load balancing and the weighted balls-into-bins games. Routing studies how to deliver messages from source to estination efficiently. We design routing algorithms for broadcasting and gossiping in ad hoc n...

  1. Visualizing Dynamic Memory Allocations

    NARCIS (Netherlands)

    Moreta, Sergio; Telea, Alexandru

    2007-01-01

    We present a visualization tool for dynamic memory allocation information obtained from instrumenting the runtime allocator used by C programs. The goal of the presented visualization techniques is to convey insight in the dynamic behavior of the allocator. The purpose is to help the allocator desig

  2. Centralized Allocation in Multiple Markets

    DEFF Research Database (Denmark)

    Monte, Daniel; Tumennasan, Norovsambuu

    The problem of allocating indivisible objects to different agents, where each indi vidual is assigned at most one object, has been widely studied. Pápai (2000) shows that the set of strategy-proof, nonbossy, Pareto optimal and reallocation-proof rules are hierarchical exchange rules | generalizat......The problem of allocating indivisible objects to different agents, where each indi vidual is assigned at most one object, has been widely studied. Pápai (2000) shows that the set of strategy-proof, nonbossy, Pareto optimal and reallocation-proof rules are hierarchical exchange rules...... | generalizations of Gale's Top Trading Cycles mechanism. We study the centralized allocation that takes place in multiple markets. For example, the assignment of multiple types of indivisible objects; or the assignment of objects in successive periods. We show that the set of strategy-proof, Pareto efficient...

  3. An optimization strategy for storage space allocation in container terminal based on matrix genetic algorithm%基于矩阵式遗传算法的集装箱码头堆场空间资源分配优化策略

    Institute of Scientific and Technical Information of China (English)

    顾天意; 梁承姬

    2012-01-01

    To solve the Storage Space Allocation Problem (SSAP), an optimization strategy for the storage space allocation is proposed based on the Matrix Genetic Algorithm ( M-GA). The strategy aims at minimizing the transportation distance between the storage blocks and the vessel berths, and the factors such as quay crane and yard crane are taken into account. The storage space allocation model based on quay crane operating lines is built firstly; then the extended version of the SSAP is resolved by the M-GA; the influences of different genetic strategies on the performance of Genetic Algorithm (GA) are analyzed finally. The case of Shanghai Zhanghuabang Container Terminal verifies the superiority of the proposed method.%为解决堆场空间资源配置问题(Storage Space Allocation Problem,SSAP),以箱区到泊位运输距离最小为目标,综合考虑岸桥、场桥等因素,提出一种基于矩阵式遗传算法(Matrix Genetic Algorithm,M-GA)的集装箱码头堆场空间资源分配优化策略.该方法首先建立基于装卸作业面的堆场空间资源分配模型;然后运用M-GA求解扩展后的SSAP;最后分析不同遗传策略对遗传算法( Genetic Algorithm,GA)性能的影响,并以上海张华浜码头的案例验证该方法的优越性.

  4. Characterization of n-Hexane sub-fraction of Bridelia micrantha (Berth and its antimycobacterium activity

    Directory of Open Access Journals (Sweden)

    Samie Amidou

    2011-04-01

    Full Text Available Abstract Background Tuberculosis, caused by Mycobacterium tuberculosis (MTB, is the most notified disease in the world. Development of resistance to first line drugs by MTB is a public health concern. As a result, there is the search for new and novel sources of antimycobacterial drugs for example from medicinal plants. In this study we determined the in vitro antimycobacterial activity of n-Hexane sub-fraction from Bridelia micrantha (Berth against MTB H37Ra and a clinical isolate resistant to all five first-line antituberculosis drugs. Methods The antimycobacterial activity of the n-Hexane sub-fraction of ethyl acetate fractions from acetone extracts of B. micrantha barks was evaluated using the resazurin microplate assay against two MTB isolates. Bioassay-guided fractionation of the ethyl acetate fraction was performed using 100% n-Hexane and Chloroform/Methanol (99:1 as solvents in order of increasing polarity by column chromatography and Resazurin microtiter plate assay for susceptibility tests. Results The n-Hexane fraction showed 20% inhibition of MTB H37Ra and almost 35% inhibition of an MTB isolate resistant to all first-line drugs at 10 μg/mL. GC/MS analysis of the fraction resulted in the identification of twenty-four constituents representing 60.5% of the fraction. Some of the 24 compounds detected included Benzene, 1.3-bis (3-phenoxyphenoxy (13.51%, 2-pinen-4-one (10.03%, N(b-benzyl-14-(carboxymethyl (6.35% and the least detected compound was linalool (0.2%. Conclusions The results show that the n-Hexane fraction of B. micrantha has antimycobacterial activity.

  5. Grid-based Hybrid Particle Swarm Optimization algorithm for task allocation problem%基于网格的混合微粒群算法解决任务调度问题

    Institute of Scientific and Technical Information of China (English)

    叶春晓; 罗娟

    2012-01-01

    Grid task allocation is a typical NP complete problem. According to the essence of grid and based on Particle Swarm Optimization algorithm, this paper proposes a new algorithm called Grid-based Hybrid Particle Swarm Optimization(GHPSO). This algorithm transforms and redefines the problem's resolution space to make it more suitable to the problem-solving environment of PSO algorithm, achieves the optimal allocation of grid resources. The simulation results compared with the Discrete Particle Swarm Optimization algorithm and Genetic Algorithm show that this algorithm has better performance.%网格任务分配是一个NP难问题,结合微粒群优化(Particle Swarm Optimization,PSO)算法,和网格自身的特性,提出了基于网格的混合微粒群算法.算法对问题的解空间进行变换、重定义,使之更加符合PSO算法的求解环境,实现了网格资源的优化分配.与离散微粒群(DPSO)算法和遗传算法进行了仿真比较,结果表明,新的PSO算法具有较好的性能.

  6. Cost allocation in shortest path games

    NARCIS (Netherlands)

    Voorneveld, M.; Grahn, S.

    2001-01-01

    A class of cooperative games arising from shortest path problems is dened These shortest path games are shown to be totally balanced and allow a population monotonic allocation scheme Possible methods for obtaining core elements are indicated rst by relating to the allocation rules in taxation and b

  7. Cognitive radio networks dynamic resource allocation schemes

    CERN Document Server

    Wang, Shaowei

    2014-01-01

    This SpringerBrief presents a survey of dynamic resource allocation schemes in Cognitive Radio (CR) Systems, focusing on the spectral-efficiency and energy-efficiency in wireless networks. It also introduces a variety of dynamic resource allocation schemes for CR networks and provides a concise introduction of the landscape of CR technology. The author covers in detail the dynamic resource allocation problem for the motivations and challenges in CR systems. The Spectral- and Energy-Efficient resource allocation schemes are comprehensively investigated, including new insights into the trade-off

  8. Legitimate Allocation of Public Healthcare

    DEFF Research Database (Denmark)

    Lippert-Rasmussen, Kasper; Lauridsen, Sigurd

    2009-01-01

    governing priorities among groups of patients. The Accountability for Reasonableness (A4R) framework suggests an ingenious solution to this problem of moral disagreement. Rather than advocating any substantive distributive principle, its advocates propose a feasible set of conditions, which, if met......Citizens' consent to political decisions is often regarded as a necessary condition of political legitimacy. Consequently, legitimate allocation of healthcare has seemed almost unattainable in contemporary pluralistic societies. The problem is that citizens do not agree on any single principle...

  9. Multi-objective Harmony Search Algorithm for Solving Human Resource Allocation Problem%求解人力资源分配问题的多目标和声搜索算法

    Institute of Scientific and Technical Information of China (English)

    吴昊; 杨佳; 王会颖; 尹道明

    2013-01-01

      人力资源分配问题是将若干个人力资源合理分配给若干个工作任务,从而达到人力生产效率最大化与人力生产成本最小化。文中提出一种改进的多目标和声搜索(MOIHS)算法来求解人力资源分配问题。 MOIHS算法是通过改变记忆考虑的选择机制与微调概率来改进基本的和声算法提高算法收敛稳定性,并采用快速非支配排序方法与建立动态拥挤的距离来获得一个分布良好的Pareto解集。在求解人力资源分配问题时,同时优化人力生产成本最小化与效率最大化两个目标,最后通过一个实例可以得到在解决该问题上多目标改进和声搜索算法优于多目标遗传算法,求出的解集也具有良好的分布性。%The human resource allocation problem seeks to find the expected objectives by allocating the limited amount of resource to va-rious activates. In this paper,a new multi-objective improved harmony search (MOIHS) has been proposed and applied to human re-source allocation problem to simultaneously optimize two goals about the cost minimization and efficiency maximization. MOIHS im-proves the base harmony search by changing the selection mechanism of memory consideration and the fine-tuning probability. It also u-ses the rapid non-dominate sorting method and establishes the dynamic crowded distance to get a good distribution of Pareto solution set. The experiment results show that,the improved harmony search is better than genetic algorithm for multi-objective resource allocation problem,it is able to give a well distributed Pareto-optimal solution.

  10. 银川市基础教育师资均等化配置的现状、问题与对策%Present Conditions, Problems and Countermeasures of Equalization of Teachers Allocation of Elementary Education in Yinchuan

    Institute of Scientific and Technical Information of China (English)

    任楠

    2012-01-01

    Through the survey made in the three area of Yinchuan, and taking Xingqing area as the indi- vidual case to carry on the investigation, describing the current situation of Yinchuan of teachers of ele- mentary education in preparation, quality, gender, and age structure, finding that the problems existed in the teachers allocation of elementary education are imbalanced teachers allocation, quantity shortage, low gold content of the degree and the unreasonable structures of age, gender and subject, considering that it should take measures in the parts of the teachers' quantity, quality and structure to solve the problems.%通过对银川市市辖三个区的调研,并以兴庆区为研究个案进行了研究,描述了银川市基础教育师资在编制、质量、性别和年龄结构方面的现状,发现银川市基础教育师资配置中存在师资配置失衡、数量不足、学历含金量低和年龄、性别、学科结构不合理问题,认为应从师资数量、质量和结构方面采取措施予以解决。

  11. Associated Health Allocation

    Data.gov (United States)

    Department of Veterans Affairs — The Associated Health Allocation Database is used to determine the allocation of positions and funds for VA Associated Health programs offered by Veterans Affairs...

  12. Construction Technique for Accurate Positioning of Large Steel Boxed Cofferdam Using Pulling and Berthing Pier System%大型钢吊箱拉靠墩系统精确定位施工技术

    Institute of Scientific and Technical Information of China (English)

    陈超华; 徐斯林; 穆清君

    2011-01-01

    The main bridge of Wuhan Erqi Changjiang River Bridge is a three-pylon composite girder cable-stayed bridge. The pile cap of pylon pier No. 3 of the bridge is located in deepwater and was constructed in dry environment in large steel boxed cofferdam. To resolve the problem of accurate positioning of the large cofferdam, the pulling and berthing pier system was used after comparison of the different positioning schemes. The pier system is composed of a pulling pier at the upstream side and a berthing pier at the downstream side, on the pulling pier, the main pulling cables and tie-down cables were set while on thg berthing pier, the crisscross pulling cables were set. The positioning anchors were cast into the river longitudinally along the bridge and the side anchoring cables were set. After construction preparation, the cofferdam was initially posi-tioned by the pulling and berthing pier system to make the cofferdam basically set in place in plan position. By using the side anchoring cables, pulling cables and by means of non-uniform pumping of water into the bulks of the cofferdam, the plan position, plan torsion, oscillation and perpendicularity of the cofferdam were adjusted and the plan offsetting of the cofferdam was brought to be within +12 mm, the torsional angle to be 58" and the inclination to be 1/3 000 so as to make the construction of the cofferdam meet the relevant requirements in the codes and eventually realize the accurate positioning of the cofferdam.%武汉二七长江大桥主桥为三塔结合梁斜拉桥,其3号墩位于深水中,采用钢吊箱实现承台干施工.为解决大型钢吊箱精确定位难题,经过方案比选,采用拉靠墩系统定位方案,该系统由上游拉墩和下游靠墩组成,拉墩设主拉缆和下拉缆,靠墩设交叉拉缆,顺桥向抛锚,设置边锚缆.施工准备后,利用拉靠墩系统进行钢吊箱初定位,使其平面位置基本就位;通过边锚缆系统、拉缆系统及夹壁舱不均衡灌

  13. Memory Allocation in Distributed Storage Networks

    CERN Document Server

    Sardari, Mohsen; Fekri, Faramarz; Soljanin, Emina

    2010-01-01

    We consider the problem of distributing a file in a network of storage nodes whose storage budget is limited but at least equals to the size file. We first generate $T$ encoded symbols (from the file) which are then distributed among the nodes. We investigate the optimal allocation of $T$ encoded packets to the storage nodes such that the probability of reconstructing the file by using any $r$ out of $n$ nodes is maximized. Since the optimal allocation of encoded packets is difficult to find in general, we find another objective function which well approximates the original problem and yet is easier to optimize. We find the optimal symmetric allocation for all coding redundancy constraints using the equivalent approximate problem. We also investigate the optimal allocation in random graphs. Finally, we provide simulations to verify the theoretical results.

  14. 基于实例的船舶靠泊操纵技术探讨%The Discussion on the Techniques of Vessel’s Berthing Operation

    Institute of Scientific and Technical Information of China (English)

    丁振国

    2015-01-01

    船舶靠泊码头操作是驾驶员经常性经历的工作之一,也是操船中事故发生率较高的一项操作。以3个码头靠泊时的体会出发,从制定靠泊计划、了解码头情况、熟知本船性能和控制余速4个方面,进一步总结船舶靠泊码头应注意的事项。%Berthing operation is one of the officer’s routine.It is an operation which is at high risks of accidents in maneuvering.This paper commences at three berthing experiences, summarizes some items to pay attention in berthing operation from the following four aspects, the development of berthing plan, the understanding of pier, familiarization of vessels’performance and the control of residual velocity.

  15. 船舶自动靠泊控制研究综述%Review on the research of ship automatic berthing control

    Institute of Scientific and Technical Information of China (English)

    张强; 张显库

    2015-01-01

    介绍国内外船舶自动靠泊控制的研究成果,并结合“船舶工业4.0”与世界海事组织“益航海”战略实施计划背景,提出船舶自动靠泊控制研究的模型统一化、控制智能化、靠泊全程化、测量精确化、实现工程化的发展趋势.%Research on ship automatic berthing control in the domestic and abroad was introduced .Combining the ship au-tomatic berthing research with the “shipbuilding industry 4.0”and “e-Navigation” project of IMO, the development of ship automatic berthing trends to be unified model , intelligent control, whole process of berthing , accurate measurement and engineering realization .

  16. Stochastic -robust optimization model and algorithm of multiple allocation hub set covering problem%多分配枢纽站集覆盖问题的随机��-鲁棒优化模型及算法

    Institute of Scientific and Technical Information of China (English)

    商丽媛; 谭清美

    2014-01-01

    The hub location is an important issue for the hub-and-spoke network optimization design, and hub covering is a type of the hub location problem. The uncertainty of the hub station construction costs and the uncertainty of the distance between two nodes are considered. The model of stochastic��-robust multiple allocation hub set covering problem is proposed with combination of stochastic optimization and robust optimization. Binary quantum-behaved particle swarm optimization algorithm is improved based on immunity thought. Immune quantum-behaved particle swarm optimization algorithm is proposed to solve the stochastic��-robust multiple allocation hub set covering model. The simulation example of this model is given, and the result shows the feasibility and effectiveness of the proposed model and algorithm.%枢纽站选址是轴辐式网络优化设计的重要问题,枢纽站覆盖则是该问题的一个类型。考虑枢纽站建站成本和节点间运输距离的不确定性,结合随机优化和鲁棒优化方法,建立了完备轴辐式网络中多分配枢纽站集覆盖问题的随机��-鲁棒优化模型;采用二进制编码,对量子粒子群算法进行改进,加入免疫思想,设计了免疫量子粒子群求解算法。最后通过算例对模型进行仿真计算,结果表明了该模型及算法的可行性和有效性。

  17. Mobile Ocean Test Berth Support: Cooperative Research and Development Final Report, CRADA Number CRD-10-413

    Energy Technology Data Exchange (ETDEWEB)

    LiVecchi, Albert [National Renewable Energy Lab. (NREL), Golden, CO (United States)

    2015-12-01

    The Northwest National Marine Renewable Energy Center (NNMREC), headquartered at the Oregon State University, is establishing the capabilities to test prototype wave energy conversion devices in the ocean. This CRADA will leverage the technical expertise and resources at NREL in the wind industry and in ocean engineering to support and enhance the development of the NNMREC Mobile Ocean Test Berth (MOTB). This CRADA will provide direct support to NNMREC by providing design evaluation and review of the MOTB, developing effective protocols for testing of the MOTB and wave energy conversion devices in the ocean, assisting in the specification of appropriate instrumentation and data acquisition packages, and providing guidance on obtaining and maintaining A2LA (American Association for Laboratory Accreditation) accreditation.

  18. Discrete Tolerance Allocation for Product Families

    OpenAIRE

    Lööf, Johan; Söderberg, Rikard

    2011-01-01

    Abstract This paper extends earlier research on the discrete tolerance allocation problem in order to optimize an entire product family simultaneously. This methodology enables top-down tolerancing approach where requirements on assembly level on products within a family are allocated to single part requirements. The proposed solution has been implemented as an interface with an optimization algorithm coupled with a variation simulation software. The paper also consists of an exten...

  19. Robust resource allocation in future wireless networks

    CERN Document Server

    Parsaeefard, Saeedeh; Mokari, Nader

    2017-01-01

    This book presents state-of-the-art research on robust resource allocation in current and future wireless networks. The authors describe the nominal resource allocation problems in wireless networks and explain why introducing robustness in such networks is desirable. Then, depending on the objectives of the problem, namely maximizing the social utility or the per-user utility, cooperative or competitive approaches are explained and their corresponding robust problems are considered in detail. For each approach, the costs and benefits of robust schemes are discussed and the algorithms for reducing their costs and improving their benefits are presented. Considering the fact that such problems are inherently non-convex and intractable, a taxonomy of different relaxation techniques is presented, and applications of such techniques are shown via several examples throughout the book. Finally, the authors argue that resource allocation continues to be an important issue in future wireless networks, and propose spec...

  20. Multiagent task allocation in social networks

    NARCIS (Netherlands)

    De Weerdt, M.M.; Zhang, Y.; Klos, T.

    2011-01-01

    This paper proposes a new variant of the task allocation problem, where the agents are connected in a social network and tasks arrive at the agents distributed over the network. We show that the complexity of this problem remains NP-complete. Moreover, it is not approximable within some factor. In c

  1. Distributed Task Allocation in Social Networks

    NARCIS (Netherlands)

    De Weerdt, M.M.; Zhang, Y.; Klos, T.

    2007-01-01

    This paper proposes a new variant of the task allocation problem, where the agents are connected in a social network and tasks arrive at the agents distributed over the network. We show that the complexity of this problem remains NPhard. Moreover, it is not approximable within some factor. We develo

  2. Multiagent task allocation in social networks

    NARCIS (Netherlands)

    M.M. de Weerdt (Mathijs); Y. Zhang (Yingqian); T.B. Klos (Tomas)

    2011-01-01

    textabstractThis paper proposes a new variant of the task allocation problem, where the agents are connected in a social network and tasks arrive at the agents distributed over the network. We show that the complexity of this problem remains NP-complete. Moreover, it is not approximable within some

  3. A Method of Reliability Allocation of a Complicated Large System

    Institute of Scientific and Technical Information of China (English)

    WANG Zhi-sheng; QIN Yuan-yuan; WANG Dao-bo

    2004-01-01

    Aiming at the problem of reliability allocation for a complicated large system, a new thought is brought up. Reliability allocation should be a kind of decision-making behavior; therefore the more information is used when apportioning a reliability index, the more reasonable an allocation is obtained. Reliability allocation for a complicated large system consists of two processes, the first one is a reliability information reporting process fromt bottom to top, and the other one is a reliability index apportioning process from top to bottom. By a typical example, we illustrate the concrete process of reliability allocation algorithms.

  4. How Fair are Fair Allocations?

    DEFF Research Database (Denmark)

    Wøhlk, Sanne; Kiilerich, Lone

    2016-01-01

    investigates the fairness of such allocations. Previous literature has applied numerous ways of measuring allocation fairness as well as numerous strategies for obtaining allocations. The goal of this paper is to study the fairness of allocations obtained by different allocation methods as viewed by different...... fairness measures. We hope that this will help guide future research towards a rational choice of allocation methods and measures....

  5. Game of Power Allocation on Networks

    CERN Document Server

    Li, Yuke

    2016-01-01

    This paper develops a distributed resource allocation game to study countries' pursuit of targets such as self-survival in the networked international environment. The paper has two general contributions: firstly, it contributes the basic idea that countries' behavior, which is power allocation, is a basic human behavior of resource allocation and the development of this game is the first time countries' behavior has ever been rigorously studied from a resource allocation perspective; secondly, the game itself has an intrinsically interesting and novel mathematical structure --- it actually presents a new technical problem with a surprising amount of informative predictions which arise from the rich parameter space that defines all kinds of possibilities for the networked international environments. The predictions both motivate major theoretical results (e.g., Nash equilibrium existence) and shed light on real world politics.

  6. Optimality versus stability in water resource allocation.

    Science.gov (United States)

    Read, Laura; Madani, Kaveh; Inanloo, Bahareh

    2014-01-15

    Water allocation is a growing concern in a developing world where limited resources like fresh water are in greater demand by more parties. Negotiations over allocations often involve multiple groups with disparate social, economic, and political status and needs, who are seeking a management solution for a wide range of demands. Optimization techniques for identifying the Pareto-optimal (social planner solution) to multi-criteria multi-participant problems are commonly implemented, although often reaching agreement for this solution is difficult. In negotiations with multiple-decision makers, parties who base decisions on individual rationality may find the social planner solution to be unfair, thus creating a need to evaluate the willingness to cooperate and practicality of a cooperative allocation solution, i.e., the solution's stability. This paper suggests seeking solutions for multi-participant resource allocation problems through an economics-based power index allocation method. This method can inform on allocation schemes that quantify a party's willingness to participate in a negotiation rather than opt for no agreement. Through comparison of the suggested method with a range of distance-based multi-criteria decision making rules, namely, least squares, MAXIMIN, MINIMAX, and compromise programming, this paper shows that optimality and stability can produce different allocation solutions. The mismatch between the socially-optimal alternative and the most stable alternative can potentially result in parties leaving the negotiation as they may be too dissatisfied with their resource share. This finding has important policy implications as it justifies why stakeholders may not accept the socially optimal solution in practice, and underlies the necessity of considering stability where it may be more appropriate to give up an unstable Pareto-optimal solution for an inferior stable one. Authors suggest assessing the stability of an allocation solution as an

  7. Fair subcarrier-power allocation scheme for multiuser multicarrier systems

    Institute of Scientific and Technical Information of China (English)

    Mohammed Abd-Elnaby; Germien G Sedhom; Nagy W Messiha; Xu Zhu; Fathi E Abd El-Samie

    2015-01-01

    The main objective of multiuser orthogonal frequency division multiple access (MU-OFDM) is to maximize the total system capacity in wireless communication systems. Thus, the problem in MU-OFDM system is the adaptive allocation of the resources (subcarriers, bits and power) to different users subject to several restrictions to maximize the total system capacity. In this work, a proposed subcarrier allocation algorithm was presented to assign the subcarriers with highest channel gain to the users. After the subcarrier allocation, subcarrier gain-based power allocation (SGPA) was employed for power and bit loading. The simulation results show that the proposed subcarrier-power allocation scheme can achieve high total system capacity and good fairness in allocating the resources to the users with slightly high computational complexity compared to the existing subcarrier allocation algorithms.

  8. Problems

    Directory of Open Access Journals (Sweden)

    Yekini Shehu

    2010-01-01

    real Banach space which is also uniformly smooth using the properties of generalized f-projection operator. Using this result, we discuss strong convergence theorem concerning general H-monotone mappings and system of generalized mixed equilibrium problems in Banach spaces. Our results extend many known recent results in the literature.

  9. Redundancy-Allocation in Pharmaceutical Plant

    Directory of Open Access Journals (Sweden)

    Deepika Garg

    2010-05-01

    Full Text Available In present paper three heuristics algorithms to optimize the problem of constrained redundancy allocation in complex system are described and used to allocate redundancy in a manufacturing system namely pharmaceutical plant. Computational procedures of proposed algorithms are outlined. These algorithms are applied to find the best redundancy strategy, combination of components, and levels of redundancy for each subsystem in order to maximize the system reliability under cost constraints .Results of these algorithms are compared to get best possible solution for the proposed problem.

  10. Online Stochastic Ad Allocation: Efficiency and Fairness

    CERN Document Server

    Feldman, Jon; Korula, Nitish; Mirrokni, Vahab S; Stein, Cliff

    2010-01-01

    We study the efficiency and fairness of online stochastic display ad allocation algorithms from a theoretical and practical standpoint. In particular, we study the problem of maximizing efficiency in the presence of stochastic information. In this setting, each advertiser has a maximum demand for impressions of display ads that will arrive online. In our model, inspired by the concept of free disposal in economics, we assume that impressions that are given to an advertiser above her demand are given to her for free. Our main theoretical result is to present a training-based algorithm that achieves a (1-\\epsilon)-approximation guarantee in the random order stochastic model. In the corresponding online matching problem, we learn a dual variable for each advertiser, based on data obtained from a sample of impressions. We also discuss different fairness measures in online ad allocation, based on comparison to an ideal offline fair solution, and develop algorithms to compute "fair" allocations. We then discuss sev...

  11. Railway Track Allocation: Models and Methods

    DEFF Research Database (Denmark)

    Lusby, Richard Martin; Larsen, Jesper; Ehrgott, Matthias

    2011-01-01

    Efficiently coordinating the movement of trains on a railway network is a central part of the planning process for a railway company. This paper reviews models and methods that have been proposed in the literature to assist planners in finding train routes. Since the problem of routing trains...... on a railway network entails allocating the track capacity of the network (or part thereof) over time in a conflict-free manner, all studies that model railway track allocation in some capacity are considered relevant. We hence survey work on the train timetabling, train dispatching, train platforming......, and train routing problems, group them by railway network type, and discuss track allocation from a strategic, tactical, and operational level....

  12. Railway Track Allocation: Models and Methods

    DEFF Research Database (Denmark)

    Lusby, Richard Martin; Larsen, Jesper; Ehrgott, Matthias

    Eciently coordinating the movement of trains on a railway network is a central part of the planning process for a railway company. This paper reviews models and methods that have been proposed in the literature to assist planners in nding train routes. Since the problem of routing trains...... on a railway network entails allocating the track capacity of the network (or part thereof) over time in a con ict-free manner, all studies that model railway track allocation in some capacity are considered relevant. We hence survey work on the train timetabling, train dispatching, train platforming......, and train routing problems, group them by railway network type, and discuss track allocation from a strategic, tactical, and operational level....

  13. Allocation of Ground Handling Resources at Copenhagen Airport

    DEFF Research Database (Denmark)

    Justesen, Tor Fog

    operations is imperative for the viability and continued development of both individual airports and the air transportation industry in general. This thesis gives a general introduction to the management of airport operations. It describes the main airport processes and optimization problems...... that these processes give rise to. The primary focus is on ground handling resource allocation problems, it looks in detail at the following problems: the check-in counter allocation problem, the baggage make-up position problem, the tactical stand and gate allocation problem, the operational stand and gate allocation...... to generate appropriate initial variables, enabling the heuristic to efficiently find near-optimal and operationally valid solutions. The work described in this thesis was carried out in the context of an Industrial PhD project at Copenhagen Airport in collaboration with the Technical University of Denmark...

  14. Resource Allocation Using Metaheuristic Search

    Directory of Open Access Journals (Sweden)

    Andy M. Connor

    2014-02-01

    Full Text Available This research is focused on solving problems in the area of software project management using metaheuristic search algorithmsand as such is resea rch in the field of search based software engineering. The main aim of this research is to ev aluate the performance of different metaheuristic search techniques in resource allocat ion and scheduling problemsthat would be typical of software development projects.This paper reports a set of experiments which evaluate the performance of three algorithms, namely simulat ed annealing, tabu search and genetic algorithms. The experimental results indicate thata ll of themetaheuristics search techniques can be used to solve problems in resource allocation an d scheduling within a software project. Finally, a comparative analysis suggests that overa ll the genetic algorithm had performed better than simulated annealing and tabu search.

  15. Risk capital allocation with autonomous subunits

    DEFF Research Database (Denmark)

    Hougaard, Jens Leth; Smilgins, Aleksandrs

    2016-01-01

    Risk capital allocation problems have been widely discussed in the academic literature. We consider a set of independent subunits collaborating in order to reduce risk: that is, when subunit portfolios are merged a diversification benefit arises and the risk of the group as a whole is smaller than...

  16. Behind the Resource Domino. Part II: Allocation

    Science.gov (United States)

    Thiemann, F. C.; Bumbarger, C. S.

    1972-01-01

    Discusses the problem of allocation and acquisition of resources from an administrative point of view. Suggests that an administrator's accountability as a leader is fixed in how efficiently and effectively resources are deployed in the organizational goal attainment efforts. (Author/DN)

  17. Multisorted Tree-Algebras for Hierarchical Resources Allocation

    Directory of Open Access Journals (Sweden)

    Erick Patrick Zobo

    2015-01-01

    Full Text Available This paper presents a generic abstract model for the study of disparities between goals and results in hierarchical multiresources allocation systems. In an organization, disparities in resource allocation may occur, when, after comparison of a resource allocation decision with an allocation reference goal or property, some agents have surplus resources to accomplish their tasks, while at the same time other agents have deficits of expected resources. In the real world, these situations are frequently encountered in organizations facing scarcity of resources and/or inefficient management. These disparities can be corrected using allocation decisions, by measuring and reducing gradually such disparities and their related costs, without totally canceling the existing resource distribution. While a lot of research has been carried out in the area of resource allocation, this specific class of problems has not yet been formally studied. The paper exposes the results of an exploratory research study of this class of problems. It identifies the commonalities of the family of hierarchical multiresource allocation systems and proposes the concept of multisorted tree-algebra for the modeling of these problems. The research presented here is not yet an in-depth descriptive research study of the mathematical theory of multisorted tree-algebra, but a formal study on modelling hierarchical multiresource allocation problems.

  18. Resource Allocation of Agricultural Science and Technology R&D

    Institute of Scientific and Technical Information of China (English)

    2011-01-01

    The status quo of resource allocation of agricultural science and technology R&D(research and development)both at home and abroad,including the amount and function of agricultural science and technology research funds,human resources in the resources of agricultural science and technology R&D,the efficiency of resource allocation of agricultural science and technology R&D,the management system of agricultural scientific innovation and the operation status of scientific funds,is analyzed.The problems in the current resource allocation of agricultural science and technology R&D are put forward,including unreasonable resource allocation;low efficiency,and low efficiency of the transformation of agricultural scientific achievements.The highly effective resource allocation of agricultural science and technology R&D is analyzed from the aspects of resource allocation structure,environment,channel,spatial layout and industrial chain.

  19. Problems and Suggestions on Improvement of Water Resources Allocation in River Basins in China%中国流域水资源分配制度存在的问题与改进建议

    Institute of Scientific and Technical Information of China (English)

    许新宜; 杨丽英; 王红瑞; 高媛媛

    2011-01-01

    As population and economy grow, demands for water will escalate.In most countries,demands for water are initially met by engineering, supply-side solutions.Based on reviewing international and domestic practices on water resources allocation within river basins, a comparison of a variety of methodologies and models of water resources allocation and documentation of the best practices were systematically performed.There are many general lessons and key issues that can be learned from the review.This review explains the relationship between water allocation schemes within river basins and policies regarding water resources management.There are many cases in China and around the world that water resources allocation only concentrates on surface water resources.Theoretically, the total demands for water within a river basin are generally supplied from a combination of surface water and groundwater resources, so reasonably integrated water resources allocation schemes are preferable.Once conditions are suitable, certain demands may be supplied from either surface water or groundwater resources, i.e., conjunctive use.Conjunctive use is advantageous over other utilization ways as it provides an opportunity to rely on surface water resources when conditions are good, resulting in renewal of the groundwater resources.When surface flows are below the average, groundwater resources can be drawn upon more heavily, even temporarily at rates greater than the sustainable yield.Prudent management is required to ensure that the long-term average rates of exploitation are within sustainable limits, and joint allocation of surface water and groundwater resources is desirable for these situations.The study integrates responsibility, entitlements, and benefits as the principles for water resources allocation in China.Two concepts of water use stocks and incremental water use were proposed to reflect the efficiency and equity of water allocation schemes.Assessment indicators for the

  20. Task mapping for non-contiguous allocations.

    Energy Technology Data Exchange (ETDEWEB)

    Leung, Vitus Joseph; Bunde, David P.; Ebbers, Johnathan; Price, Nicholas W.; Swank, Matthew.; Feer, Stefan P.; Rhodes, Zachary D.

    2013-02-01

    This paper examines task mapping algorithms for non-contiguously allocated parallel jobs. Several studies have shown that task placement affects job running time for both contiguously and non-contiguously allocated jobs. Traditionally, work on task mapping either uses a very general model where the job has an arbitrary communication pattern or assumes that jobs are allocated contiguously, making them completely isolated from each other. A middle ground between these two cases is the mapping problem for non-contiguous jobs having a specific communication pattern. We propose several task mapping algorithms for jobs with a stencil communication pattern and evaluate them using experiments and simulations. Our strategies improve the running time of a MiniApp by as much as 30% over a baseline strategy. Furthermore, this improvement increases markedly with the job size, demonstrating the importance of task mapping as systems grow toward exascale.

  1. Multi-robot task allocation for exploration

    Institute of Scientific and Technical Information of China (English)

    GAO Ping-an; CAI Zi-xing

    2006-01-01

    The problem of allocating a number of exploration tasks to a team of mobile robots in dynamic environments was studied. The team mission is to visit several distributed targets. The path cost of target is proportional to the distance that a robot has to move to visit the target. The team objective is to minimize the average path cost of target over all targets. Finding an optimal allocation is strongly NP-hard. The proposed algorithm can produce a near-optimal solution to it. The allocation can be cast in terms of a multi-round single-item auction by which robots bid on targets. In each auction round, one target is assigned to a robot that produces the lowest path cost of the target. The allocated targets form a forest where each tree corresponds a robot's exploring targets set. Each robot constructs an exploring path through depth-first search in its target tree. The time complexity of the proposed algorithm is polynomial. Simulation experiments show that the allocating method is valid.

  2. Operator allocation model and scheduling algorithm for flexible job-shop problem%柔性生产中人员配置模型及其调度算法

    Institute of Scientific and Technical Information of China (English)

    高丽; 徐克林; 朱伟; 童科娜

    2012-01-01

    为减少柔性生产企业的劳务费用,提高运营效益,以合理的人工分配方案和最佳作业排序为目标建立了数学模型,并设计一种多目标混合算法.将作业分解为子作业层和父作业层,采用遗传算法和动态规划法获取最佳的人工分配方案.在人工优化模型的基础上利用模拟退火遗传算法,将搜索空间限制在第一工位工件投产序列的置换向量空间内,并采用交叉算子和变异算子对选择算子进行了重新设计,生成最优作业排序计划.一组测试问题的求解结果表明了所提出方法的有效性及鲁棒性.%To reduce crew expenses and raise operation profits of flexible production enterprises,a mathematical model was constructed on the basis of reasonable operator allocation scheme and optimal sequence of operations,and a multi-objective mixed algorithm was used for solving the problem.The operation is divided into two layers,and the man-hour optimization scheme can be acquired by genetic algorithm and dynamic programming method.A simulated annealing genetic algorithm was proposed to optimize the sequence of operations,in which the search was limited to the space of permutation vectors of the order,and a given set of jobs were performed in the first stage using a hybrid crossover operators and mutation operators to redesign the selection operators.A set of test results show that the proposed algorithm is effective.

  3. Statistical Mechanics of Resource Allocation

    CERN Document Server

    Inoue, Jun-ichi

    2014-01-01

    We provide a mathematical model to investigate the resource allocation problem for agents, say, university graduates who are looking for their positions in labor markets. The basic model is described by the so-called Potts spin glass which is well-known in the research field of statistical physics. In the model, each Potts spin (a tiny magnet in atomic scale length) represents the action of each student, and it takes a discrete variable corresponding to the company he/she applies for. We construct the energy to include three distinct effects on the students' behavior, namely, collective effect, market history and international ranking of companies. In this model system, the correlations (the adjacent matrix) between students are taken into account through the pairwise spin-spin interactions. We carry out computer simulations to examine the efficiency of the model. We also show that some chiral representation of the Potts spin enables us to obtain some analytical insights into our labor markets.

  4. A new network losses allocation method in deregulated environment

    Institute of Scientific and Technical Information of China (English)

    WANG Cheng-min; HOU Zhi-jian

    2005-01-01

    Network losses allocation is one of the major problems in the market environment. The quadric function of the injected nodal power is used in this paper as a representation for network losses, which are allocated fairly using the called market equilibrium principle while the bidding curves are corrected. The power market equilibrium is simulated as three different models that can be solved simply by the optimal power flow algorithm combining the generation scheduling problem with network losses allocation. The case study is made at an IEEE-30 nodes system and a perfect result is proved in this paper.

  5. Attention allocation before antisaccades.

    Science.gov (United States)

    Klapetek, Anna; Jonikaitis, Donatas; Deubel, Heiner

    2016-01-01

    In the present study, we investigated the distribution of attention before antisaccades. We used a dual task paradigm, in which participants made prosaccades or antisaccades and discriminated the orientation of a visual probe shown at the saccade goal, the visual cue location (antisaccade condition), or a neutral location. Moreover, participants indicated whether they had made a correct antisaccade or an erroneous prosaccade. We observed that, while spatial attention in the prosaccade task was allocated only to the saccade goal, attention in the antisaccade task was allocated both to the cued location and to the antisaccade goal. This suggests parallel attentional selection of the cued and antisaccade locations. We further observed that in error trials--in which participants made an incorrect prosaccade instead of an antisaccade--spatial attention was biased towards the prosaccade goal. These erroneous prosaccades were mostly unnoticed and were often followed by corrective antisaccades with very short latencies (parallel programming of the reflexive prosaccade to the cue and the antisaccade to the intended location. Taken together, our results suggest that attention allocation and saccade goal selection in the antisaccade task are mediated by a common competitive process.

  6. Life cycle methodology for copper : allocation and recycling approaches

    Energy Technology Data Exchange (ETDEWEB)

    Gobling-Reisemann, S. [Bremen Univ., Bremen (Germany). Faculty of Production Engineering; Tikana, L.; Sievers, H.; Klassert, A. [Deutsches Kupferinstitut, Dusseldorf (Germany). Life Cycle Centre

    2007-07-01

    This paper provided an overview of different methodologies available for recycling and assessing the life cycles of copper ores. Approaches towards allocation in life cycle assessments (LCA) included detailed modelling; system expansion; physical allocation; economic allocation; and subsequent-use allocation. Approaches towards recycling included system expansion, cut-off approaches, open loop approach; value corrected substitution; and the cascade approach. Sulphuric acid and steam are produced as by-products during copper production, and most copper ores contain molybdenum, gold, silver, and nickel. The environmental impacts of copper by-products must be considered when conducting LCAs. Existing standards allow different implementation methods for recycling and allocation into metal LCAs, and the selection of a methodology can significantly influence the ecological profile of copper and copper products. Allocation is needed when processes with more than 1 function are investigated. ISO standards recommend avoiding allocation problems by using detailed system modelling. Allocation factors should be chosen that reflect the physical relationship between the functional units produced and their associated environmental burdens. Case studies were presented to demonstrate allocations of co- and byproducts and recycling in copper production. 19 refs., 2 tabs., 4 figs.

  7. Irrational time allocation in decision-making.

    Science.gov (United States)

    Oud, Bastiaan; Krajbich, Ian; Miller, Kevin; Cheong, Jin Hyun; Botvinick, Matthew; Fehr, Ernst

    2016-01-13

    Time is an extremely valuable resource but little is known about the efficiency of time allocation in decision-making. Empirical evidence suggests that in many ecologically relevant situations, decision difficulty and the relative reward from making a correct choice, compared to an incorrect one, are inversely linked, implying that it is optimal to use relatively less time for difficult choice problems. This applies, in particular, to value-based choices, in which the relative reward from choosing the higher valued item shrinks as the values of the other options get closer to the best option and are thus more difficult to discriminate. Here, we experimentally show that people behave sub-optimally in such contexts. They do not respond to incentives that favour the allocation of time to choice problems in which the relative reward for choosing the best option is high; instead they spend too much time on problems in which the reward difference between the options is low. We demonstrate this by showing that it is possible to improve subjects' time allocation with a simple intervention that cuts them off when their decisions take too long. Thus, we provide a novel form of evidence that organisms systematically spend their valuable time in an inefficient way, and simultaneously offer a potential solution to the problem.

  8. A Distributed Cooperative Power Allocation Method for Campus Buildings

    Energy Technology Data Exchange (ETDEWEB)

    Hao, He; Sun, Yannan; Carroll, Thomas E.; Somani, Abhishek

    2015-09-01

    We propose a coordination algorithm for cooperative power allocation among a collection of commercial buildings within a campus. We introduced thermal and power models of a typical commercial building Heating, Ventilation, and Air Conditioning (HVAC) system, and utilize model predictive control to characterize their power flexibility. The power allocation problem is formulated as a cooperative game using the Nash Bargaining Solution (NBS) concept, in which buildings collectively maximize the product of their utilities subject to their local flexibility constraints and a total power limit set by the campus coordinator. To solve the optimal allocation problem, a distributed protocol is designed using dual decomposition of the Nash bargaining problem. Numerical simulations are performed to demonstrate the efficacy of our proposed allocation method

  9. Resource Allocation Among Agents with MDP-Induced Preferences

    CERN Document Server

    Dolgov, D A; 10.1613/jair.2102

    2011-01-01

    Allocating scarce resources among agents to maximize global utility is, in general, computationally challenging. We focus on problems where resources enable agents to execute actions in stochastic environments, modeled as Markov decision processes (MDPs), such that the value of a resource bundle is defined as the expected value of the optimal MDP policy realizable given these resources. We present an algorithm that simultaneously solves the resource-allocation and the policy-optimization problems. This allows us to avoid explicitly representing utilities over exponentially many resource bundles, leading to drastic (often exponential) reductions in computational complexity. We then use this algorithm in the context of self-interested agents to design a combinatorial auction for allocating resources. We empirically demonstrate the effectiveness of our approach by showing that it can, in minutes, optimally solve problems for which a straightforward combinatorial resource-allocation technique would require the ag...

  10. Spectrum Allocation Based on Game Theory in Cognitive Radio Networks

    Directory of Open Access Journals (Sweden)

    Qiufen Ni

    2013-03-01

    Full Text Available As a kind of intelligent communication technology, the characteristic of dynamic spectrum allocation of cognitive radio provides feasible scheme for sharing with the spectrum resources among the primary user and secondary users, which solves the current spectrum resource scarcity problem. In this paper, we comprehensively explored the cognitive radio spectrum allocation models based on game theory from cooperative game and non-cooperative game, which provide detailed overview and analysis on the state of the art of spectrum allocation based on game theory. In order to provide flexible and efficient spectrum allocation in wireless networks, this paper also provides the general framework model based on game theory for cognitive radio spectrum allocation.

  11. Accounting of allocation of production enterprises’ overhead costs

    Directory of Open Access Journals (Sweden)

    О.V. Ivaniuta

    2016-12-01

    Full Text Available Taking into account the complexity of engineering technological cycles, the use of traditional approaches to the allocation of overhead costs at the researching enterprises is inexpedient and inefficient. The authors find out that to solve this problem it is not enough to choose only one base of allocation because the formed prime cost with such an approach will not meet the reality. That is why it is suggested to use a multilevel allocation of overhead costs. The proposed approach involves the allocation of overhead costs at the following levels: fixed and variable, with shops of main and auxiliary production, calculation stations, some orders. Each level involves the selection of individual allocation bases that are grouped on economic, technological and integrated ones.

  12. Robust Inversion and Data Compression in Control Allocation

    Science.gov (United States)

    Hodel, A. Scottedward

    2000-01-01

    We present an off-line computational method for control allocation design. The control allocation function delta = F(z)tau = delta (sub 0) (z) mapping commanded body-frame torques to actuator commands is implicitly specified by trim condition delta (sub 0) (z) and by a robust pseudo-inverse problem double vertical line I - G(z) F(z) double vertical line less than epsilon (z) where G(z) is a system Jacobian evaluated at operating point z, z circumflex is an estimate of z, and epsilon (z) less than 1 is a specified error tolerance. The allocation function F(z) = sigma (sub i) psi (z) F (sub i) is computed using a heuristic technique for selecting wavelet basis functions psi and a constrained least-squares criterion for selecting the allocation matrices F (sub i). The method is applied to entry trajectory control allocation for a reusable launch vehicle (X-33).

  13. Allocation and Location of Transport Logistics Centres

    Directory of Open Access Journals (Sweden)

    D. Mocková

    2010-01-01

    Full Text Available The facility allocation problem sets out to determine the optimal number of facilities to be opened. Based on multiple criteria evaluation, the optimal location of the facilities is usually solved subsequently. Several considerations, e.g. technical parameters, costs and finance must be taken into account. Economic analysis is carried out on the basis of the specific instance of the problem.Let us assume that the number of potentially located facilities is known. Then the problem of the optimal location of a given number of facilities in a network is referred to as the facility location problem. The solution to the problem is a set of facilities optimally located in an area such that this area is fully covered by the required services that the facilities provide. An example of a real-life problem of this type is the location of logistics centers. 

  14. Current Situation,Problems and Countermeasures about Disabled Mass Sports under the Perspective of Resource Allocation View%资源配置视角下残疾人群众体育的现状、问题与对策

    Institute of Scientific and Technical Information of China (English)

    吴燕丹; 王聪颖

    2015-01-01

    The development of disabled mass sports is the most importance people's livelihood project to government ,but there are still many issues in the process .One of the main obstacles is the resource misallocation .According to the study method of literature review ,investigation , logical analysis ,mathematical statistics ,this paper tries to review the overall characteristics of China's disabled mass sports ,analyzes the problems occurred in development of disabled mass sports and conducts a in‐depth research as an example of the operation of disabled mass sports in some provinces and cities .The results show that it is common to disabled mass sports in China for lacking of institutional resources ,financial resources ,information resources ,human resources and material resources etc .On the basis of synthesizing viewpoints of experts and collecting opinions of managers ,providers and users ,it will achieve the goal that disabled and ordinary people can fuse and share sports according to develop the role of government guid‐ance ,regulate the support and the mechanism of resources supply ,optimize configuration and resources allocation .%发展残疾人群众体育是政府非常重视的民生工程,但在推进过程中仍存在较多问题,其中一个主要的障碍就是资源配置失当。运用文献调研、调查、逻辑分析和数理统计等方法对我国残疾人群众体育总体特征进行概况扫描,分析我国残疾人群众体育发展存在问题,并结合部分省、市残疾人群众体育运行情况进行深入的实地调研。结果表明,我国残疾人群众体育在多方面都取得显著成绩,但仍存在制度资源、经费资源、信息资源、人力资源、物质资源等方面的缺失,综合专家观点并在广泛征集管理者、服务者和使用者意见的基础上,提出发挥政府导向作用,调控供给和资源支持机制,优化配置和资源共享等对策,最大化利用资源,

  15. Optimal allocation of trend following strategies

    Science.gov (United States)

    Grebenkov, Denis S.; Serror, Jeremy

    2015-09-01

    We consider a portfolio allocation problem for trend following (TF) strategies on multiple correlated assets. Under simplifying assumptions of a Gaussian market and linear TF strategies, we derive analytical formulas for the mean and variance of the portfolio return. We construct then the optimal portfolio that maximizes risk-adjusted return by accounting for inter-asset correlations. The dynamic allocation problem for n assets is shown to be equivalent to the classical static allocation problem for n2 virtual assets that include lead-lag corrections in positions of TF strategies. The respective roles of asset auto-correlations and inter-asset correlations are investigated in depth for the two-asset case and a sector model. In contrast to the principle of diversification suggesting to treat uncorrelated assets, we show that inter-asset correlations allow one to estimate apparent trends more reliably and to adjust the TF positions more efficiently. If properly accounted for, inter-asset correlations are not deteriorative but beneficial for portfolio management that can open new profit opportunities for trend followers. These concepts are illustrated using daily returns of three highly correlated futures markets: the E-mini S&P 500, Euro Stoxx 50 index, and the US 10-year T-note futures.

  16. A Novel Subcarrier Allocation Algorithm for MC-CDMA Systems

    Science.gov (United States)

    Seyman, Muhammet Nuri; Saçakli, Bircan

    2016-09-01

    Multi carrier modulation techniques such as MC-CDMA are used in high-speed communication applications. Due to MC-CDMA being a multiuser in technology, the subcarrier quantity allocated per user decreases in case the quantity of active users increases. Consequently, data rates per user are reduced with the increase in the bit error rate (BER). Efficient allocation of subcarriers to users within the system can aid the overcoming of this problem. This study develops a new algorithm for subcarrier allocation and system performance improvement in terms of BER, and data rates in comparison to other algorithms were ensured.

  17. Zinc allocation and re-allocation in rice

    NARCIS (Netherlands)

    Stomph, T.J.; Jiang, W.; Putten, van der P.E.L.; Struik, P.C.

    2014-01-01

    Aims: Agronomy and breeding actively search for options to enhance cereal grain Zn density. Quantifying internal (re-)allocation of Zn as affected by soil and crop management or genotype is crucial. We present experiments supporting the development of a conceptual model of whole plant Zn allocation

  18. Optimizing the Allocation of Material Flow in a Logistics System

    OpenAIRE

    Tanka Milkova

    2013-01-01

    The article is devoted to the issue of the optimum allocation of material flow in a logistics system, the author’s proposition being that the allocation and movement of the material flow in a logistics system can be rationalized, based on the use of special approaches and techniques. There is presented the economic formulation of the problem and is constructed the economic and mathematical model ensuring the movement of the material flow in a logistics system at minimum cost of its transporta...

  19. Optimum Power and Rate Allocation for Coded V-BLAST: Average Optimization

    CERN Document Server

    Kostina, Victoria

    2010-01-01

    An analytical framework for performance analysis and optimization of coded V-BLAST is developed. Average power and/or rate allocations to minimize the outage probability as well as their robustness and dual problems are investigated. Compact, closed-form expressions for the optimum allocations and corresponding system performance are given. The uniform power allocation is shown to be near optimum in the low outage regime in combination with the optimum rate allocation. The average rate allocation provides the largest performance improvement (extra diversity gain), and the average power allocation offers a modest SNR gain limited by the number of transmit antennas but does not increase the diversity gain. The dual problems are shown to have the same solutions as the primal ones. All these allocation strategies are shown to be robust. The reported results also apply to coded multiuser detection and channel equalization systems relying on successive interference cancelation.

  20. Multi-robot Task Allocation for Search and Rescue Missions

    Science.gov (United States)

    Hussein, Ahmed; Adel, Mohamed; Bakr, Mohamed; Shehata, Omar M.; Khamis, Alaa

    2014-12-01

    Many researchers from academia and industry are attracted to investigate how to design and develop robust versatile multi-robot systems by solving a number of challenging and complex problems such as task allocation, group formation, self-organization and much more. In this study, the problem of multi-robot task allocation (MRTA) is tackled. MRTA is the problem of optimally allocating a set of tasks to a group of robots to optimize the overall system performance while being subjected to a set of constraints. A generic market-based approach is proposed in this paper to solve this problem. The efficacy of the proposed approach is quantitatively evaluated through simulation and real experimentation using heterogeneous Khepera-III mobile robots. The results from both simulation and experimentation indicate the high performance of the proposed algorithms and their applicability in search and rescue missions.

  1. Sensing Task Allocation for Heterogeneous Channels in Cooperative Spectrum Sensing

    Directory of Open Access Journals (Sweden)

    Qihui Wu

    2010-12-01

    Full Text Available In the traditional centralized cooperative spectrum sensing, all secondary users sense the same channel. But, for a given channel, there exists detection performance diversity among all the users, due to the different signal-fading process. Involving the user with poor performance in cooperative sensing will not only deteriorate the detection correctness but also waste the sensing time. In the heterogeneous channels, the problem is even severe. A novel idea is to allocate the secondary users to sense different channels. We analyze the allocation problem before formulate it to be an optimization problem, which is a NP-hard problem. Then we propose the declined complexity algorithm in equal secondary user case and the two-hierarchy approach algorithm in unequal case. With the simulation, we verify the near optimality of the proposed algorithms and the advantage of the task allocation.

  2. Storage Allocation in Automated Container Terminals: the Upper Level

    Directory of Open Access Journals (Sweden)

    Mengjue Xia

    2016-10-01

    Full Text Available Nowadays automation is a trend of container terminals all over the world. Although not applied in current automated container terminals, storage allocation is indispensable in conventional container terminals, and promising for automated container terminals in future. This paper seeks into the storage allocation problem in automated container terminals and proposed a two level structure for the problem. A mixed integer programming model is built for the upper level, and a modified Particle Swarm Optimization (PSO algorithm is applied to solve the model. The applicable conditions of the model is investigated by numerical experiments, so as the performance of the algorithm in different problem scales. It is left to future research the lower level of the problem and the potential benefit of storage allocation to automated container terminals.

  3. Adapting water allocation management to drought scenarios

    Directory of Open Access Journals (Sweden)

    P. Giacomelli

    2008-04-01

    Full Text Available Climate change dynamics have significant consequences on water resources on a watershed scale. With water becoming scarcer and susceptible to variation, the planning and reallocation decisions in watershed management need to be reviewed. This research focuses on an in-depth understanding of the current allocation balance of water resources among competitors, placed along the course of the Adda River. In particular, during the summer period, the demand for water dramatically increases. This is due to the increase in irrigation activities in the lower part of the basin and to the highest peaks of tourist inflow, in the Como Lake and Valtellina areas. Moreover, during these months, the hydroelectric reservoirs in the upper part of the Adda River basin (the Valtellina retain most of the volume of water coming from the snow and glacier melt. The existing allocation problem among these different competing users is exacerbated by the decreasing water supplies. The summer of 2003 testified the rise in a number of allocation problems and situations of water scarcity that brought about environmental and economical consequences. The RICLIC project is committed to the understanding of water dynamics on a regional scale, to quantify the volumes involved and offer local communities an instrument to improve a sustainable water management system, within uncertain climate change scenarios.

  4. Cost allocation with limited information

    DEFF Research Database (Denmark)

    Hougaard, Jens Leth; Tind, Jørgen

    all activities have been performed, for example by finishing all outputs. Here the allocation is made progressively with suggestions for activities. I other words cost allocation is performed in parallel for example with a production planning process. This development does not require detailed...

  5. Risk allocation under liquidity constraints

    NARCIS (Netherlands)

    Csóka, P.; Herings, P.J.J.

    2013-01-01

    Risk allocation games are cooperative games that are used to attribute the risk of a financial entity to its divisions. In this paper, we extend the literature on risk allocation games by incorporating liquidity considerations. A liquidity policy specifies state-dependent liquidity requirements that

  6. Utility-based bandwidth allocation algorithm for heterogeneous wireless networks

    Institute of Scientific and Technical Information of China (English)

    CHAI Rong; WANG XiuJuan; CHEN QianBin; SVENSSON Tommy

    2013-01-01

    In next generation wireless network (NGWN), mobile users are capable of connecting to the core network through various heterogeneous wireless access networks, such as cellular network, wireless metropolitan area network (WMAN), wireless local area network (WLAN), and ad hoc network. NGWN is expected to provide high-bandwidth connectivity with guaranteed quality-of-service to mobile users in a seamless manner; however, this desired function demands seamless coordination of the heterogeneous radio access network (RAN) technologies. In recent years, some researches have been conducted to design radio resource management (RRM) architectures and algorithms for NGWN; however, few studies stress the problem of joint network performance optimization, which is an essential goal for a cooperative service providing scenario. Furthermore, while some authors consider the competition among the service providers, the QoS requirements of users and the resource competition within access networks are not fully considered. In this paper, we present an interworking integrated network architecture, which is responsible for monitoring the status information of different radio access technologies (RATs) and executing the resource allocation algorithm. Within this architecture, the problem of joint bandwidth allocation for heterogeneous integrated networks is formulated based on utility function theory and bankruptcy game theory. The proposed bandwidth allocation scheme comprises two successive stages, i.e., service bandwidth allocation and user bandwidth allocation. At the service bandwidth allocation stage, the optimal amount of bandwidth for different types of services in each network is allocated based on the criterion of joint utility maximization. At the user bandwidth allocation stage, the service bandwidth in each network is optimally allocated among users in the network according to bankruptcy game theory. Numerical results demonstrate the efficiency of

  7. Spectrum Allocation in Two-Tier Networks

    CERN Document Server

    Chandrasekhar, Vikram

    2008-01-01

    Two-tier networks, comprising a conventional cellular network overlaid with shorter range hotspots (e.g. femtocells, distributed antennas, or wired relays), offer an economically viable way to improve cellular system capacity. The capacity-limiting factor in such networks is interference. The cross-tier interference between macrocells and femtocells can suffocate the capacity due to the near-far problem, so in practice hotspots should use a different frequency channel than the potentially nearby high-power macrocell users. Centralized or coordinated frequency planning, which is difficult and inefficient even in conventional cellular networks, is all but impossible in a two-tier network. This paper proposes and analyzes an optimum decentralized spectrum allocation policy for two-tier networks that employ frequency division multiple access (including OFDMA). The proposed allocation is optimal in terms of Area Spectral Efficiency (ASE), and is subjected to a sensible Quality of Service (QoS) requirement, which g...

  8. On Allocation Policies for Power and Performance

    CERN Document Server

    Dyachuk, Dmytro; 10.1109/GRID.2010.5697986

    2011-01-01

    With the increasing popularity of Internet-based services and applications, power efficiency is becoming a major concern for data center operators, as high electricity consumption not only increases greenhouse gas emissions, but also increases the cost of running the server farm itself. In this paper we address the problem of maximizing the revenue of a service provider by means of dynamic allocation policies that run the minimum amount of servers necessary to meet user's requirements in terms of performance. The results of several experiments executed using Wikipedia traces are described, showing that the proposed schemes work well, even if the workload is non-stationary. Since any resource allocation policy requires the use of forecasting mechanisms, various schemes allowing compensating errors in the load forecasts are presented and evaluated.

  9. ON OPTIMAL LOCAL BUFFER ALLOCATION IN FLEXIBLE MANUFACTURING SYSTEMS

    Institute of Scientific and Technical Information of China (English)

    1998-01-01

    An optimal design problem of local buffer allocation in the FMS is discussed in order to maximize a reward earned from processed jobs at all workstations. Structural properties of the optimal design problem are analyzed for the model with two job routing policies. Based on these properties, approaches to optimal solutions are given.

  10. A group-based tasks allocation algorithm for the optimization of long leave opportunities in academic departments

    Science.gov (United States)

    Eyono Obono, S. D.; Basak, Sujit Kumar

    2011-12-01

    The general formulation of the assignment problem consists in the optimal allocation of a given set of tasks to a workforce. This problem is covered by existing literature for different domains such as distributed databases, distributed systems, transportation, packets radio networks, IT outsourcing, and teaching allocation. This paper presents a new version of the assignment problem for the allocation of academic tasks to staff members in departments with long leave opportunities. It presents the description of a workload allocation scheme and its algorithm, for the allocation of an equitable number of tasks in academic departments where long leaves are necessary.

  11. Systematic Task Allocation Evaluation in Distributed Software Development

    Science.gov (United States)

    Münch, Jürgen; Lamersdorf, Ansgar

    Systematic task allocation to different development sites in global software development projects can open business and engineering perspectives and help to reduce risks and problems inherent in distributed development. Relying only on a single evaluation criterion such as development cost when distributing tasks to development sites has shown to be very risky and often does not lead to successful solutions in the long run. Task allocation in global software projects is challenging due to a multitude of impact factors and constraints. Systematic allocation decisions require the ability to evaluate and compare task allocation alternatives and to effectively establish customized task allocation practices in an organization. In this article, we present a customizable process for task allocation evaluation that is based on results from a systematic interview study with practitioners. In this process, the relevant criteria for evaluating task allocation alternatives are derived by applying principles from goal-oriented measurement. In addition, the customization of the process is demonstrated, related work and limitations are sketched, and an outlook on future work is given.

  12. Antenna allocation in MIMO radar with widely separated antennas for multi-target detection.

    Science.gov (United States)

    Gao, Hao; Wang, Jian; Jiang, Chunxiao; Zhang, Xudong

    2014-10-27

    In this paper, we explore a new resource called multi-target diversity to optimize the performance of multiple input multiple output (MIMO) radar with widely separated antennas for detecting multiple targets. In particular, we allocate antennas of the MIMO radar to probe different targets simultaneously in a flexible manner based on the performance metric of relative entropy. Two antenna allocation schemes are proposed. In the first scheme, each antenna is allocated to illuminate a proper target over the entire illumination time, so that the detection performance of each target is guaranteed. The problem is formulated as a minimum makespan scheduling problem in the combinatorial optimization framework. Antenna allocation is implemented through a branch-and-bound algorithm and an enhanced factor 2 algorithm. In the second scheme, called antenna-time allocation, each antenna is allocated to illuminate different targets with different illumination time. Both antenna allocation and time allocation are optimized based on illumination probabilities. Over a large range of transmitted power, target fluctuations and target numbers, both of the proposed antenna allocation schemes outperform the scheme without antenna allocation. Moreover, the antenna-time allocation scheme achieves a more robust detection performance than branch-and-bound algorithm and the enhanced factor 2 algorithm when the target number changes.

  13. Resource Allocation for Delay Differentiated Traffic in Multiuser OFDM Systems

    CERN Document Server

    Tao, Meixia; Zhang, Fan

    2007-01-01

    Most existing work on adaptive allocation of subcarriers and power in multiuser orthogonal frequency division multiplexing (OFDM) systems has focused on homogeneous traffic consisting solely of either delay-constrained data (guaranteed service) or non-delay-constrained data (best-effort service). In this paper, we investigate the resource allocation problem in a heterogeneous multiuser OFDM system with both delay-constrained (DC) and non-delay-constrained (NDC) traffic. The objective is to maximize the sum-rate of all the users with NDC traffic while maintaining guaranteed rates for the users with DC traffic under a total transmit power constraint. Through our analysis we show that the optimal power allocation over subcarriers follows a multi-level water-filling principle; moreover, the valid candidates competing for each subcarrier include only one NDC user but all DC users. By converting this combinatorial problem with exponential complexity into a convex problem or showing that it can be solved in the dual...

  14. Processor Allocation for Optimistic Parallelization of Irregular Programs

    CERN Document Server

    Versaci, Francesco

    2012-01-01

    Optimistic parallelization is a promising approach for the parallelization of irregular algorithms: potentially interfering tasks are launched dynamically, and the runtime system detects conflicts between concurrent activities, aborting and rolling back conflicting tasks. However, parallelism in irregular algorithms is very complex. In a regular algorithm like dense matrix multiplication, the amount of parallelism can usually be expressed as a function of the problem size, so it is reasonably straightforward to determine how many processors should be allocated to execute a regular algorithm of a certain size (this is called the processor allocation problem). In contrast, parallelism in irregular algorithms can be a function of input parameters, and the amount of parallelism can vary dramatically during the execution of the irregular algorithm. Therefore, the processor allocation problem for irregular algorithms is very difficult. In this paper, we describe the first systematic strategy for addressing this pro...

  15. Dynamic Channel Allocation Management Using Agents Technology

    Directory of Open Access Journals (Sweden)

    Ion BOGDAN

    2009-07-01

    Full Text Available Channel allocation schemes are management techniques meant to solve the radio access problem in the telecommunications area. There are several known schemes namely: static, dynamic, hybrid and flexible channel allocation schemes. In our work we developed the channel allocation scheme using a decentralized structure, based on software agents. In order to create such a structure, some functions must be carried out by some specialized functional entities. Each functional entity is implemented with an agent, having a specific role. Using this manner of implementation, different functions of the system can be implemented at different sites, located apart and also the structure can be modularized. In our work we have created the agents structure and the communications between agents, on the use of Multiagent Systems Engineering Technology. We also involved the AgentTool platform to automate the creation of the agents structure and the code resulted was in Java. In order to realize the test of our system we considered a shape of 21 radio areas, each including a number of users. Each wireless user can initiate a number of calls per hour and each call last a holding time. The communications between agents were realized for the TCP/IP protocol, based on socket connections.

  16. Register Allocation By Model Transformer Semantics

    CERN Document Server

    Wang, Yin

    2012-01-01

    Register allocation has long been formulated as a graph coloring problem, coloring the conflict graph with physical registers. Such a formulation does not fully capture the goal of the allocation, which is to minimize the traffic between registers and memory. Linear scan has been proposed as an alternative to graph coloring, but in essence, it can be viewed as a greedy algorithm for graph coloring: coloring the vertices not in the order of their degrees, but in the order of their occurence in the program. Thus it suffers from almost the same constraints as graph coloring. In this article, I propose a new method of register allocation based on the ideas of model transformer semantics (MTS) and static cache replacement (SCR). Model transformer semantics captures the semantics of registers and the stack. Static cache replacement relaxes the assumptions made by graph coloring and linear scan, aiming directly at reducing register-memory traffic. The method explores a much larger solution space than that of graph c...

  17. Community-aware task allocation for social networked multiagent systems.

    Science.gov (United States)

    Wang, Wanyuan; Jiang, Yichuan

    2014-09-01

    In this paper, we propose a novel community-aware task allocation model for social networked multiagent systems (SN-MASs), where the agent' cooperation domain is constrained in community and each agent can negotiate only with its intracommunity member agents. Under such community-aware scenarios, we prove that it remains NP-hard to maximize system overall profit. To solve this problem effectively, we present a heuristic algorithm that is composed of three phases: 1) task selection: select the desirable task to be allocated preferentially; 2) allocation to community: allocate the selected task to communities based on a significant task-first heuristics; and 3) allocation to agent: negotiate resources for the selected task based on a nonoverlap agent-first and breadth-first resource negotiation mechanism. Through the theoretical analyses and experiments, the advantages of our presented heuristic algorithm and community-aware task allocation model are validated. 1) Our presented heuristic algorithm performs very closely to the benchmark exponential brute-force optimal algorithm and the network flow-based greedy algorithm in terms of system overall profit in small-scale applications. Moreover, in the large-scale applications, the presented heuristic algorithm achieves approximately the same overall system profit, but significantly reduces the computational load compared with the greedy algorithm. 2) Our presented community-aware task allocation model reduces the system communication cost compared with the previous global-aware task allocation model and improves the system overall profit greatly compared with the previous local neighbor-aware task allocation model.

  18. Fast discriminative latent Dirichlet allocation

    Data.gov (United States)

    National Aeronautics and Space Administration — This is the code for fast discriminative latent Dirichlet allocation, which is an algorithm for topic modeling and text classification. The related paper is at...

  19. Collective credit allocation in science

    CERN Document Server

    Shen, Hua-Wei

    2014-01-01

    Collaboration among researchers is an essential component of the modern scientific enterprise, playing a particularly important role in multidisciplinary research. However, we continue to wrestle with allocating credit to the coauthors of publications with multiple authors, since the relative contribution of each author is difficult to determine. At the same time, the scientific community runs an informal field-dependent credit allocation process that assigns credit in a collective fashion to each work. Here we develop a credit allocation algorithm that captures the coauthors' contribution to a publication as perceived by the scientific community, reproducing the informal collective credit allocation of science. We validate the method by identifying the authors of Nobel-winning papers that are credited for the discovery, independent of their positions in the author list. The method can also compare the relative impact of researchers working in the same field, even if they did not publish together. The ability...

  20. FY12 CPD Formula Allocation

    Data.gov (United States)

    Department of Housing and Urban Development — The Fiscal Year (FY) 2012 budget for the Department of Housing and Urban Development has been enacted. This spreadsheet provide full-year allocations for the Office...

  1. OPTIMAL POWER ALLOCATION WITH AF AND SDF STRATEGIES IN DUAL-HOP COOPERATIVE MIMO NETWORKS

    Institute of Scientific and Technical Information of China (English)

    Xu Xiaorong; Zheng Baoyu; Zhang Jianwu

    2010-01-01

    Dual-hop cooperative Multiple-Input Multiple-Output (MIMO) network with multi-relay cooperative communication is introduced. Power allocation problem with Amplify-and-Forward (AF) and Selective Decode-and-Forward (SDF) strategies in multi-node scenario are formulated and solved respectively. Optimal power allocation schemes that maximize system capacity with AF strategy are presented. In addition,optimal power allocation methods that minimize asymptotic Symbol Error Rate (SER) with SDF cooperative protocol in multi-node scenario are also proposed. Furthermore,performance comparisons are provided in terms of system capacity and approximate SER. Numerical and simulation results confirm our theoretical analysis. It is revealed that,maximum system capacity could be obtained when powers are allocated optimally with AF protocol,while minimization of system's SER could also be achieved with optimum power allocation in SDF strategy. In multi-node scenario,those optimal power allocation algorithms are superior to conventional equal power allocation schemes.

  2. Unconstrained and Constrained Fault-Tolerant Resource Allocation

    CERN Document Server

    Liao, Kewen

    2011-01-01

    First, we study the Unconstrained Fault-Tolerant Resource Allocation (UFTRA) problem (a.k.a. FTFA problem in \\cite{shihongftfa}). In the problem, we are given a set of sites equipped with an unconstrained number of facilities as resources, and a set of clients with set $\\mathcal{R}$ as corresponding connection requirements, where every facility belonging to the same site has an identical opening (operating) cost and every client-facility pair has a connection cost. The objective is to allocate facilities from sites to satisfy $\\mathcal{R}$ at a minimum total cost. Next, we introduce the Constrained Fault-Tolerant Resource Allocation (CFTRA) problem. It differs from UFTRA in that the number of resources available at each site $i$ is limited by $R_{i}$. Both problems are practical extensions of the classical Fault-Tolerant Facility Location (FTFL) problem \\cite{Jain00FTFL}. For instance, their solutions provide optimal resource allocation (w.r.t. enterprises) and leasing (w.r.t. clients) strategies for the cont...

  3. Joint overbooking and seat allocation for fare families

    DEFF Research Database (Denmark)

    Hjorth, Robert; Fiig, Thomas; Bondoux, Nicolas

    2016-01-01

    of the complexity and dimensionality of the Dynamic Program (DP), which prohibits computation for realistic size problems. We review several DP models developed for seat-allocation and overbooking over a time span of 40 years, reflecting changed business environments. In this report we link these models together...... by means of two transformations: The marginal revenue transformation of Fiig et al. [2010] and the equivalence charging scheme of Subramanian et al. [1999]. These transformations enable us to transform the joint seat allocation and overbooking problem for fare family fare structures into an equivalent...

  4. Resource allocation for multichannel broadcasting visible light communication

    Science.gov (United States)

    Le, Nam-Tuan; Jang, Yeong Min

    2015-11-01

    Visible light communication (VLC), which offers the possibility of using light sources for both illumination and data communications simultaneously, will be a promising incorporation technique with lighting applications. However, it still remains some challenges especially coverage because of field-of-view limitation. In this paper, we focus on this issue by suggesting a resource allocation scheme for VLC broadcasting system. By using frame synchronization and a network calculus QoS approximation, as well as diversity technology, the proposed VLC architecture and QoS resource allocation for the multichannel-broadcasting MAC (medium access control) protocol can solve the coverage limitation problem and the link switching problem of exhibition service.

  5. How do Parents allocate Time ?

    OpenAIRE

    Bloemen, Hans G.; Stancanelli, Elena G F

    2008-01-01

    This paper focuses on the time allocation of spouses and the impact of economic variables. We present a stylized model of the time allocation of spouses to illustrate the expected impact of wages and non-labour income. The empirical model simultaneously specifies three time-use choices -paid work, childcare, and housework- and wage and employment equations for each spouse, allowing for correlation across the errors of the ten equations. We exploit the rich information in the French time-use s...

  6. How should INGOs allocate resources?

    Directory of Open Access Journals (Sweden)

    Scott Wisor

    2012-02-01

    Full Text Available International Non-governmental Organizations (INGOs face difficult choices when choosing to allocate resources. Given that the resources made available to INGOs fall far short of what is needed to reduce massive human rights deficits, any chosen scheme of resource allocation requires failing to reach other individuals in great need. Facing these moral opportunity costs, what moral reasons should guide INGO resource allocation? Two reasons that clearly matter, and are recognized by philosophers and development practitioners, are the consequences (or benefit or harm reduction of any given resource allocation and the need (or priority of individual beneficiaries. If accepted, these reasons should lead INGOs to allocate resources to a limited number of countries where the most prioritarian weighted harm reduction will be achieved. I make three critiques against this view. First, on grounds the consequentialist accepts, I argue that INGOs ought to maintain a reasonably wide distribution of resources. Second, I argue that even if one is a consequentialist, consequentialism ought not act as an action guiding principle for INGOs. Third, I argue that additional moral reasons should influence decision making about INGO resource allocation. Namely, INGO decision making should attend to relational reasons, desert, respect for agency, concern for equity, and the importance of expressing a view of moral wrongs.

  7. Media-specific rate allocation in heterogeneous wireless networks

    Institute of Scientific and Technical Information of China (English)

    JURCA Dan; FROSSARD Pascal

    2006-01-01

    We address the problem of joint path selection and rate allocation in multipath wireless streaming, in order to optimize a media specific quality of service. We leverage on the existence of multiple parallel wireless services, in order to enhance the received video quality at a wireless client. An optimization problem is proposed, aimed at minimizing a video distortion metric based on sequence-dependent parameters, and transmission channel characteristics, for a given wireless network infrastructure.Even if joint optimal path selection and rate allocation is in general an NP complete problem, an in-depth analysis of the media distortion evolution allows defining a low complexity optimal streaming strategy, under reasonable network assumptions. In particular, we show that a greedy allocation of rates along paths with increasing error probability leads to an optimal solution. We argue that a network path should not be chosen for transmission, unless all other available paths with lower error probability have been chosen. Moreover, the chosen paths should be used at their maximum end-to-end bandwidth. These results are demonstrated for both independent network paths, and non-disjoint channel segments, in generic network topologies. Simulation results showed that the optimal rate allocation carefully trades off total encoding/transmission rate, with the end-to-end transmission error probability and the number of chosen paths. In many cases, the optimal rate allocation provides more than 20% improvement in received video quality, compared to heuristic-based algorithms.

  8. Research on Multirobot Pursuit Task Allocation Algorithm Based on Emotional Cooperation Factor

    OpenAIRE

    Baofu Fang; Lu Chen; Hao Wang; Shuanglu Dai; Qiubo Zhong

    2014-01-01

    Multirobot task allocation is a hot issue in the field of robot research. A new emotional model is used with the self-interested robot, which gives a new way to measure self-interested robots’ individual cooperative willingness in the problem of multirobot task allocation. Emotional cooperation factor is introduced into self-interested robot; it is updated based on emotional attenuation and external stimuli. Then a multirobot pursuit task allocation algorithm is proposed, which is based on em...

  9. 15 CFR 335.4 - Allocation.

    Science.gov (United States)

    2010-01-01

    ... 15 Commerce and Foreign Trade 2 2010-01-01 2010-01-01 false Allocation. 335.4 Section 335.4... § 335.4 Allocation. (a) For HTS 9902.51.11 and HTS 9902.51.15 each Tariff Rate Quota will be allocated separately. Allocation will be based on an applicant's Worsted Wool Suit production, on a weighted...

  10. Weighted Max-Min Resource Allocation for Frequency Selective Channels

    CERN Document Server

    Zehavi, Ephi; Levanda, Ronny; Han, Zhu

    2010-01-01

    In this paper, we discuss the computation of weighted max-min rate allocation using joint TDM/FDM strategies under a PSD mask constraint. We show that the weighted max-min solution allocates the rates according to a predetermined rate ratio defined by the weights, a fact that is very valuable for telecommunication service providers. Furthermore, we show that the problem can be efficiently solved using linear programming. We also discuss the resource allocation problem in the mixed services scenario where certain users have a required rate, while the others have flexible rate requirements. The solution is relevant to many communication systems that are limited by a power spectral density mask constraint such as WiMax, Wi-Fi and UWB.

  11. Optimizing Earth Allocation for Rock-Fill Dam Construction

    Institute of Scientific and Technical Information of China (English)

    ZHONG Denghua; HU Chengshun; ZHANG Jing

    2005-01-01

    An optimal allocation of earth is of great significance to reduce the project cost and duration in the construction of rock-fill dams. The earth allocation is a dynamic system affected by various time-space constraints. Based on previous studies, a new method of optimizing this dynamic system as a static one is presented. In order to build a generalized and flexible model of the problem, some man-made constraints were investigated in building the mathematic model. Linear programming and simplex method are introduced to solve the optimization problem of earth allocation. A case study in a large-scale rock-fill dam construction project is presented to demonstrate the proposed method and its successful application shows the feasibility and effectiveness of the method.

  12. Optimal Constrained Resource Allocation Strategies under Low Risk Circumstances

    CERN Document Server

    Andreica, Mugurel Ionut; Visan, Costel

    2009-01-01

    In this paper we consider multiple constrained resource allocation problems, where the constraints can be specified by formulating activity dependency restrictions or by using game-theoretic models. All the problems are focused on generic resources, with a few exceptions which consider financial resources in particular. The problems consider low-risk circumstances and the values of the uncertain variables which are used by the algorithms are the expected values of the variables. For each of the considered problems we propose novel algorithmic solutions for computing optimal resource allocation strategies. The presented solutions are optimal or near-optimal from the perspective of their time complexity. The considered problems have applications in a broad range of domains, like workflow scheduling in industry (e.g. in the mining and metallurgical industry) or the financial sector, motion planning, facility location and data transfer or job scheduling and resource management in Grids, clouds or other distribute...

  13. Solution of Multi-objective Order Allocation Problem Based on Binary Ant Colony Algorithm%基于二元蚁群算法的多目标订单分配问题求解

    Institute of Scientific and Technical Information of China (English)

    叶青; 熊伟清; 江宝钏

    2011-01-01

    为了在最小化综合成本的同时尽量均衡企业的生产负荷以及为水平型制造协作联盟(HMCA)订单分配的管理工作提供依据,设计多种群混合行为二元蚁群算法,用于求解 HMCA 订单分配的多目标模型.该方法在二元蚁群算法的堆础上引入区域划分、环境评价与奖励策略,以弥补二元蚁群算法难以同时寻找多个解的缺陷,通过引入中心扰动行为,进一步提高求解质量.实验结果表明,该算法可以保证分布性,且求解质量较高.%In order to provide the basis for the management of allocating orders in Horizontal Manufacturing Collaborative Alliance(HMCA), this paper designs an algorithm named Multi-population Binary Ant Colony Algorithm with Hybrid Behaviors(MPBAHB) to minimize the comprehensive cost and balance the production loads among the selected manufacturing enterprises.Based on Binary Ant Colony Algorithm (BACA), two strategies of zoning and environmental evaluation/reward are introduced to conquer the drawback of original BACA of difficult to get multiple solutions.And a searching behavior named "central disturbing" is introduced to BACA, so as to strengthen the searching ability.Experimental results prove that the algorithm can get better solutions while keeping the distribution of Pareto front.

  14. Task allocation in a distributed computing system

    Science.gov (United States)

    Seward, Walter D.

    1987-01-01

    A conceptual framework is examined for task allocation in distributed systems. Application and computing system parameters critical to task allocation decision processes are discussed. Task allocation techniques are addressed which focus on achieving a balance in the load distribution among the system's processors. Equalization of computing load among the processing elements is the goal. Examples of system performance are presented for specific applications. Both static and dynamic allocation of tasks are considered and system performance is evaluated using different task allocation methodologies.

  15. Location-Based Resource Allocation for OFDMA

    KAUST Repository

    Ghorbel, Mahdi

    2011-05-01

    Cognitive radio is one of the hot topics for emerging and future wireless communication. It has been proposed as a suitable solution for the spectrum scarcity caused by the increase in frequency demand. The concept is based on allowing unlicensed users, called cognitive or secondary users, to share the unoccupied frequency bands with their owners, called the primary users, under constraints on the interference they cause to them. In order to estimate this interference, the cognitive system usually uses the channel state information to the primary user, which is often impractical to obtain. However, we propose to use location information, which is easier to obtain, to estimate this interference. The purpose of this work is to propose a subchannel and power allocation method which maximizes the secondary users\\' total capacity under the constraints of limited budget power and total interference to the primary under certain threshold. We model the problem as a constrained optimization problem for both downlink and uplink cases. Then, we propose low-complexity resource allocation schemes based on the waterfilling algorithm. The simulation results show the efficiency of the proposed method with comparison to the exhaustive search algorithm.

  16. Analysis on the Hydrodynamic Impact Among the Berths in the Dawanshan Wave Energy Test Site%大万山波浪能试验场泊位间水动力影响分析

    Institute of Scientific and Technical Information of China (English)

    王鑫; 李大鸣; 李雪临; 石建军; 韩林生

    2015-01-01

    当前我国近海海域属稀缺资源,波浪能试验场建设须通过合理布局各测试泊位,在保证试验场各泊位可同时正常开展测试工作的前提下,尽量减小用海面积。拉近试验泊位距离,是减小用海面积的直接手段,但在此过程中,必须保证在试验场场址海域水动力环境下,泊位接入测试波浪能装置后,其之间的水动力影响在可接受的范围内。以大万山波浪能试验场泊位设计为例,介绍一种有效的泊位间水动力影响分析方法。方法采用自主开发的二维Boussinesq波浪模型,开展水动力影响分析工作,同时引入相对波高比概念,对泊位接入装置后影响距离和影响面积进行了定量的分析。文中研究得出的分析方法,可用于判定泊位布局设计的合理性。%Currently, offshore sea areas are scarce resources in China. In order to ensure the wave energy test site to operate in good condition, and to minimize utilized sea areas, it is essential to rationalize the layout of berths in the test site. Reducing the distance among berths is the most direct means to achieve the target. However, it must ensure that after linking up wave energy devices, the dynamic impacts among the berths are with the acceptable range under the hydrodynamic environment of the test site. Taking the example of the design of berth layout in the Dawanshan wave energy test site, this paper introduces an effective hydrodynamic impact analysis method which applies the independently developed two-dimensional Boussinesq wave model to conduct the analysis. Meanwhile, the concept of relative wave height ratio is used to carry out the quantitative analysis on the impact distance and impact area of the berths which link with the wave energy devices. The analyzing method derived in this study can be used to evaluate the quality of layout design.

  17. Allocation of risk capital based on iso-entropic coherent risk measure

    Directory of Open Access Journals (Sweden)

    Chengli Zheng

    2015-04-01

    Full Text Available Purpose: The potential of diversified portfolio leads to the risk capital allocation problem. There are many kinds of methods or rules to allocate risk capital.  However, they have flaws, such as non-continuity, unfairness. In order to get a better method, we propose a new risk measure to be the base of risk capital allocation rule. Design/methodology/approach: We proposed two kinds of allocation methods: one is marginal risk contribution based on iso-entropic coherent risk measure(IE, the other one is to combine the minimal excess allocation(EBA principle and IE into risk capital allocation. The iso-entropic coherent risk measure has many advantages over others; it is continuous and more powerful in distinguishing risks, consistent with higher-order stochastic dominances than other risk measures. And EBA is consistent with the amount of risk, which means fairness for risk capital allocation. Findings: Through cases, simulations and empirical application, it shows that these two allocation rules satisfy some good properties, can be more efficient, more precise and fairer. And the EBA based on IE may be the better one. Research limitations/implications: However, there are some problems still open. One is how to treat the negative value of allocation. Second is that the consistence between the allocated risk capital and the amount of the risk needs to be studied further. Originality/value: A good risk measure is very important for risk capital allocation. We proposed two methods to deal with risk capital allocation based on a new coherent risk measure called iso-entropic risk measure, which is smooth and consistent with higher-order stochastic dominance and has higher resolution of risk. It shows that the risk capital allocation rules based on iso-entropic risk measure are better than the other rules.

  18. Reserve-constrained economic dispatch: Cost and payment allocations

    Energy Technology Data Exchange (ETDEWEB)

    Misraji, Jaime [Sistema Electrico Nacional Interconectado de la Republica Dominicana, Calle 3, No. 3, Arroyo Hondo 1, Santo Domingo, Distrito Nacional (Dominican Republic); Conejo, Antonio J.; Morales, Juan M. [Department of Electrical Engineering, Universidad de Castilla-La Mancha, Campus Universitario s/n, 13071 Ciudad Real (Spain)

    2008-05-15

    This paper extends basic economic dispatch analytical results to the reserve-constrained case. For this extended problem, a cost and payment allocation analysis is carried out and a detailed economic interpretation of the results is provided. Sensitivity values (Lagrange multipliers) are also analyzed. A case study is considered to illustrate the proposed analysis. Conclusions are duly drawn. (author)

  19. A distributed resource allocation algorithm for many processes

    NARCIS (Netherlands)

    Hesselink, Wim H.

    2013-01-01

    Resource allocation is the problem that a process may enter a critical section CS of its code only when its resource requirements are not in conflict with those of other processes in their critical sections. For each execution of CS, these requirements are given anew. In the resource requirements, l

  20. Preventing Under-Reporting in Social Task Allocation

    Science.gov (United States)

    de Weerdt, Mathijs; Zhang, Yingqian

    In games where agents are asked to declare their available resources, they can also strategize over this declaration. Surprisingly, not in all such games a VCG payment can be applied to construct a truthful mechanism using an optimal algorithm, though such payments can prevent under-reporting of resources. We show this for the problem of allocating tasks in a social network (STAP).

  1. Multi-Constraint multi-processor Resource Allocation

    NARCIS (Netherlands)

    Behrouzian, A.R.B.; Goswami, D.; Basten, T.; Geilen, M.; Ara, H.A.

    2015-01-01

    This work proposes a Multi-Constraint Resource Allocation (MuCoRA) method for applications from multiple domains onto multi-processors. In particular, we address a mapping problem for multiple throughput-constrained streaming applications and multiple latency-constrained feedback control application

  2. Methods for Precise Submesh Allocation

    Directory of Open Access Journals (Sweden)

    Craig Morgenstern

    1994-01-01

    Full Text Available In this article we describe and compare several recently proposed algorithms for precise submesh allocation in a two-dimensional mesh connected system. The methods surveyed include various frame sliding strategies, the maximum boundary value heuristic, and interval set scan techniques. In addition, a new enhancement to the interval set scan method is described. This enhancement results in an algorithm that has better allocation and run-time performance under a FCFS scheduling policy than any of the other proposed methods. We present results drawn from an extensive simulation study to illustrate the relative efficiency of the various methods.

  3. Using linear integer programming for multi-site land-use allocation

    NARCIS (Netherlands)

    Aerts, J.C.J.H.; Eisinger, E.; Heuvelink, G.B.M.; Stewart, Th.J.

    2003-01-01

    Research in the area of spatial decision support (SDS) and resource allocation has recently generated increased attention for integrating optimization techniques with GIS. In this paper we address the use of spatial optimization techniques for solving multi-site land-use allocation (MLUA) problems,

  4. Sustainable Land Allocation GIS-based decision support for industrial forest plantation development in Indonesia

    NARCIS (Netherlands)

    Yanuariadi, T.

    1999-01-01

    A land allocation model for sustainable industrial forest plantation (IFP) project establishment is developed in this research. The model provides the foundation for a spatial decision support system (DSS) that deals with analytical and practical problem solving in IFP land allocation in Indonesia.

  5. Coordinating energy allocation and process performance using an agent-based approach

    DEFF Research Database (Denmark)

    Umair, Aisha; Clausen, Anders; Jørgensen, Bo Nørregaard

    2015-01-01

    Energy efficient systems are receiving worldwide attention in response to the negative effects of global warming. Energy efficient systems are concerned with allocation of adequate resources in the energy domain to meet the energy demand in the process domain. In allocation, a balancing problem a...

  6. A Theory for the Initial Allocating of Real Time Tasks in Distributed Systems

    Institute of Scientific and Technical Information of China (English)

    鄢勇; 金灿明

    1992-01-01

    Referring to a set of real time tasks with arriving time,executing time and deadline,this paper discusses the problem of polynomial time initial-allocating approximation algorithms in a distributed system and five new results are gained which provide a theory for the designing of initial-allocating algorithms of real time tasks.

  7. Capital Allocation for Insurance Companies: Issues and Methods

    DEFF Research Database (Denmark)

    Nielsen, Jens Perch; Poulsen, Rolf; Mumford, Paul

    2010-01-01

    We address some key issues related to risk and capital allocation in insurance companies. We argue that the Froot-Stein approach to risk is relevant to a number of important problems in the daily management of an insurance portfolio and that – taken to its consequence – this approach will lead...... a new way of combining capital allocation and pricing of insurance policies. Through a performance measure of return on capital, we suggest a way of evaluating the price of capital for a single policy, that this money is held as a reserve and that this reserve should run off in such a way that old...

  8. Allocating Freight Empty Cars in Railway Networks with Dynamic Demands

    Directory of Open Access Journals (Sweden)

    Ce Zhao

    2014-01-01

    Full Text Available This paper investigates the freight empty cars allocation problem in railway networks with dynamic demands, in which the storage cost, unit transportation cost, and demand in each stage are taken into consideration. Under the constraints of capacity and demand, a stage-based optimization model for allocating freight empty cars in railway networks is formulated. The objective of this model is to minimize the total cost incurred by transferring and storing empty cars in different stages. Moreover, a genetic algorithm is designed to obtain the optimal empty cars distribution strategies in railway networks. Finally, numerical experiments are given to show the effectiveness of the proposed model and algorithm.

  9. Designing for dynamic task allocation

    NARCIS (Netherlands)

    Dongen, C.J.G. van; Maanen, P.P. van

    2005-01-01

    Future platforms are envisioned in which human-machine teams are able to share and trade tasks as demands in situations change. It seems that human-machine coordination has not received the attention it deserves by past and present approaches to task allocation. In this paper a simple way to make co

  10. The Discipline of Asset Allocation.

    Science.gov (United States)

    Petzel, Todd E.

    2000-01-01

    Discussion of asset allocation for college/university endowment funds focuses on three levels of risk: (1) the absolute risk of the portfolio (usually leading to asset diversification); (2) the benchmark risk (usually comparison with peer institutions; and (3) personal career risk (which may incline managers toward maximizing short-term returns,…

  11. Regulating nutrient allocation in plants

    Energy Technology Data Exchange (ETDEWEB)

    Udvardi, Michael; Yang, Jiading; Worley, Eric

    2014-12-09

    The invention provides coding and promoter sequences for a VS-1 and AP-2 gene, which affects the developmental process of senescence in plants. Vectors, transgenic plants, seeds, and host cells comprising heterologous VS-1 and AP-2 genes are also provided. Additionally provided are methods of altering nutrient allocation and composition in a plant using the VS-1 and AP-2 genes.

  12. Cross-Layer Optimal Rate Allocation for Heterogeneous Wireless Multicast

    Directory of Open Access Journals (Sweden)

    Amr Mohamed

    2009-01-01

    Full Text Available Heterogeneous multicast is an efficient communication scheme especially for multimedia applications running over multihop networks. The term heterogeneous refers to the phenomenon when multicast receivers in the same session require service at different rates commensurate with their capabilities. In this paper, we address the problem of resource allocation for a set of heterogeneous multicast sessions over multihop wireless networks. We propose an iterative algorithm that achieves the optimal rates for a set of heterogeneous multicast sessions such that the aggregate utility for all sessions is maximized. We present the formulation of the multicast resource allocation problem as a nonlinear optimization model and highlight the cross-layer framework that can solve this problem in a distributed ad hoc network environment with asynchronous computations. Our simulations show that the algorithm achieves optimal resource utilization, guarantees fairness among multicast sessions, provides flexibility in allocating rates over different parts of the multicast sessions, and adapts to changing conditions such as dynamic channel capacity and node mobility. Our results show that the proposed algorithm not only provides flexibility in allocating resources across multicast sessions, but also increases the aggregate system utility and improves the overall system throughput by almost 30% compared to homogeneous multicast.

  13. Integrated quay crane allocation and yard truck schedule problem in container terminals%集装箱码头岸桥分配与集卡调度整合问题研究

    Institute of Scientific and Technical Information of China (English)

    马超; 梁承姬

    2015-01-01

    Quay crane and truck scheduling are interrelated issues with mutual influence. In order to improve port handling efficiency, it is necessary to coordinate them in a good relationship. The scheduling problem was solved by formulating a mixed integer programming ( MIP ) model which consider both loading and unloading. The goal of this model was to minimize the completion time of both import and export containers. Due to the complexity of the problem, a layered approach was used for the solution of the two devices scheduling. Meanwhile, an improved genetic algorithm was used to solve the model. The new method was compared with CPLEX. The experiment demonstrates that the improved genetic algorithm obtains optimal solution for six cases of total cases and the aver-age gap of left cases is less than 5%. Numerical experiments show that the proposed algorithm can efficiently handle the problem within a limited time. In solving time, along with the increase of the number of trucks, the time span of the CPLEX solutions differs from the 1 second to 1 hour, but the improved algorithm only need dozens of seconds to solve the problem. Thus, the improved algorithm can effectively solve such problem.%岸桥分配与集卡调度是相互联系相互影响的问题,如果要提高码头装卸效率,就必须协调好两者的调度关系。针对集装箱码头岸桥和集卡的协同调度问题,以使进口箱和出口箱的总完工时间最短为目的,考虑了集卡路径约束和岸桥实际操作情况等实际约束,构建了边装边卸的混合整数规划模型。由于模型比较复杂,因此采用了分层方法来实现两种设备的协调调度,并用改进的遗传算法来求解模型。实验表明,通过将改进算法的结果与标准化软件CPLEX所求得的最优解或下界比较,算法求得6组最优解且剩余算例平均偏差小于5%;在求解时间方面,随着岸桥、集卡和集装箱数量的增加,CPLEX求解时间跨度由1 s到1 h快速

  14. CAPACITY ALLOCATION IN A COMPETITIVE MULTI-CHANNEL SUPPLY CHAIN

    Institute of Scientific and Technical Information of China (English)

    Kaijun LIU; Zigang ZHANG

    2007-01-01

    This paper addresses the capacity allocation problem for a capacitated manufacturer who can distribute her product to the end customers through an independent retailer channel as well as through her direct channel. Demands of the channels are substitutable, which induces competition between them. We show that to avoid channel competition, it is possible for the manufacturer to deny the retailer of capacity. Specifically, if channel substitution rate is high, a retailer of low demand will never be allocated any capacity even when the available capacity is ample. While, if the channel substitution rate is low, capacity allocation strategy depends on the retailer's demand and the available capacity.Many other interesting managerial insights are provided and illustrated with numerical examples.

  15. Allocation Strategies of Virtual Resources in Cloud-Computing Networks

    Directory of Open Access Journals (Sweden)

    D.Giridhar Kumar

    2014-11-01

    Full Text Available In distributed computing, Cloud computing facilitates pay per model as per user demand and requirement. Collection of virtual machines including both computational and storage resources will form the Cloud. In Cloud computing, the main objective is to provide efficient access to remote and geographically distributed resources. Cloud faces many challenges, one of them is scheduling/allocation problem. Scheduling refers to a set of policies to control the order of work to be performed by a computer system. A good scheduler adapts its allocation strategy according to the changing environment and the type of task. In this paper we will see FCFS, Round Robin scheduling in addition to Linear Integer Programming an approach of resource allocation.

  16. Optimal Sensor Allocation for Fault Detection and Isolation

    Science.gov (United States)

    Azam, Mohammad; Pattipati, Krishna; Patterson-Hine, Ann

    2004-01-01

    Automatic fault diagnostic schemes rely on various types of sensors (e.g., temperature, pressure, vibration, etc) to measure the system parameters. Efficacy of a diagnostic scheme is largely dependent on the amount and quality of information available from these sensors. The reliability of sensors, as well as the weight, volume, power, and cost constraints, often makes it impractical to monitor a large number of system parameters. An optimized sensor allocation that maximizes the fault diagnosibility, subject to specified weight, volume, power, and cost constraints is required. Use of optimal sensor allocation strategies during the design phase can ensure better diagnostics at a reduced cost for a system incorporating a high degree of built-in testing. In this paper, we propose an approach that employs multiple fault diagnosis (MFD) and optimization techniques for optimal sensor placement for fault detection and isolation (FDI) in complex systems. Keywords: sensor allocation, multiple fault diagnosis, Lagrangian relaxation, approximate belief revision, multidimensional knapsack problem.

  17. Establishing the fair allocation of international aviation carbon emission rights

    Directory of Open Access Journals (Sweden)

    Feng-Cai Zhao

    2014-09-01

    Full Text Available To identify potentially unfair use of international aviation carbon emission rights in different countries, this paper presents a carbon Lorenz curve and Gini coefficient, constructed on the basis of historical cumulative international aviation CO2 emissions per capita. The study follows a methodology adapted from the research into fair income allocation. The results of these calculations show that there has been vast unfairness surrounding international aviation carbon emissions in the past, and that this unfairness has been partially hidden by a delay in accumulative start dates. A solution to this problem, allowing fair allocation of carbon emissions, is the key to building a mechanism for the reduction of global international aviation emissions. This study proposes a fair method for allocating emission rights, based on a responsibility-capacity index. Taking a goal of carbon-neutral growth by 2020 as an example, the degree of carbon emission reduction expected from different countries by 2021 is calculated using the proposed method.

  18. The job interview arrangement in the expert resources reasonable allocation problem%解决面试工作安排中专家资源合理分配问题

    Institute of Scientific and Technical Information of China (English)

    陈香

    2014-01-01

    遗传算法GA (genetic algorithm)作为一种解决复杂问题的有效方法,是由美国密执安大学的John Holland教授于1975年首先提出来的,这种算法是以达尔文的生物进化论为启发而创建的,是基于生物进化中自然选择、适者生存和物种遗传思想的搜索算法。%Genetic algorithm (GA based algorithm), as a kind of effective method to solve complex problems, is by the university of Michigan professor John Holland in 1975, first of all, this algorithm is based on Darwinian evolution inspired, is based on natural selection, survival of the fittest in biological evolution and genetic search algorithm.

  19. Power allocation for non-orthogonal decode-and-forward cooperation protocol

    Institute of Scientific and Technical Information of China (English)

    ZHANG Yong; XU YouYun; CAI YueMing

    2009-01-01

    This paper studies the power allocation problem for the non-orthogonal decode-and-forward (NDF) cooperation protocol with selection relaying. With the availability of the magnitudes of all channel gains at the source, the power allocation is explored that maximizes the mutual information between the source and destination subject to a total power constraint. The minimum power that avoids the outage of the relay is set as a condition, under which the power allocation problem becomes one of selecting the optimal one from several allocation factor triplets. It is shown that the power allocation scheme can provide considerable performance gain, and the non-orthogonal cooperation protocol is superior to the orthogonal protocol and direct transmission.

  20. Joint Relay Selection and Power Allocation for Cooperative Communication over Frequency Selective Fading Channels

    Directory of Open Access Journals (Sweden)

    Youhua Ma

    2012-08-01

    Full Text Available In this paper, we consider the joint problem of relay selection and optimal power allocation for multi-relay amplify-and-forward (AF cooperative communication system over frequency selective fading channels. An optimization model combined relay selection and power allocation under a total transmission power budget is formulated. Then, this combinatorial problem is solved in a distributed strategy. Relay selection with a new threshold-based multiple-relay selection (MRS scheme is implemented at first, and then power is allocated between source and the selected relays in an optimized way to maximize channel capacity. Simulation result shows that the proposed joint scenario with relay selection and power allocation achieves better throughput performance than that of parallel-relay scenario (means that random relay is selected to forward data and allocated part of total power on average. Furthermore, the performances of the new MRS scheme and other relay selection strategies are also investigated.

  1. Process Completing Sequences for Resource Allocation Systems with Synchronization

    Directory of Open Access Journals (Sweden)

    Song Foh Chew

    2012-01-01

    Full Text Available This paper considers the problem of establishing live resource allocation in workflows with synchronization stages. Establishing live resource allocation in this class of systems is challenging since deciding whether a given level of resource capacities is sufficient to complete a single process is NP-complete. In this paper, we develop two necessary conditions and one sufficient condition that provide quickly computable tests for the existence of process completing sequences. The necessary conditions are based on the sequence of completions of subprocesses that merge together at a synchronization. Although the worst case complexity is O(2, we expect the number of subprocesses combined at any synchronization will be sufficiently small so that total computation time remains manageable. The sufficient condition uses a reduction scheme that computes a sufficient capacity level of each resource type to complete and merge all subprocesses. The worst case complexity is O(⋅, where is the number of synchronizations. Finally, the paper develops capacity bounds and polynomial methods for generating feasible resource allocation sequences for merging systems with single unit allocation. This method is based on single step look-ahead for deadly marked siphons and is O(2. Throughout the paper, we use a class of Petri nets called Generalized Augmented Marked Graphs to represent our resource allocation systems.

  2. Allocation of Transmission Cost Using Power Flow Tracing Methods

    Directory of Open Access Journals (Sweden)

    CH Vishnu Vardhan Reddy

    2016-10-01

    Full Text Available In the open access restructured power system market, it is necessary to develop an appropriate pricing scheme that can provide the useful economic information to market participants, such as generation, transmission companies and customers. Though many methods have already been proposed, but accurately estimating and allocating the transmission cost in the transmission pricing scheme is still a challenging task. This work addresses the problem of allocating the cost of the transmission network to generators and demands. In this work four methods using DC Power flow and AC power flow have been attempted. They are MW-Mile Method, MVA-Mile Method, GGDF method and Bialek Tracing method.MVA-Mile method and Bialek Tracing method applies AC power flow and considers apparent power flows. The purpose of the present work is to allocate the cost pertaining to the transmission lines of the network to all the generators and demands. A load flow solution is run and, the proposed method determines how line flows depend on nodal currents. This result is then used to allocate network costs to generators and demands. The technique presented in this work is related to the allocation of the cost to GENCO‘s TRANSCO‘s and DISCO‘s. A technique for tracing the flow of electricity of lines among generators with GGDF and Bialek upstream looking algorithm is proposed. With these methods correct economic signals are generated for all players. All these methods are tested on IEEE 14 bus system

  3. Resource pooling for frameless network architecture with adaptive resource allocation

    Institute of Scientific and Technical Information of China (English)

    XU XiaoDong; WANG Da; TAO XiaoFeng; SVENSSON Tommy

    2013-01-01

    The system capacity for future mobile communication needs to be increased to fulfill the emerging requirements of mobile services and innumerable applications. The cellular topology has for long been regarded as the most promising way to provide the required increase in capacity. However with the emerging densification of cell deployments, the traditional cellular structure limits the efficiency of the resource, and the coordination between different types of base stations is more complicated and entails heavy cost. Consequently, this study proposes frameless network architecture (FNA) to release the cell boundaries, enabling the topology needed to implement the FNA resource allocation strategy. This strategy is based on resource pooling incorporating a new resource dimension-antenna/antenna array. Within this architecture, an adaptive resource allocation method based on genetic algorithm is proposed to find the optimal solution for the multi-dimensional resource allocation problem. Maximum throughput and proportional fair resource allocation criteria are considered. The simulation results show that the proposed architecture and resource allocation method can achieve performance gains for both criteria with a relatively low complexity compared to existing schemes.

  4. Frequency allocations for a new satellite service - Digital audio broadcasting

    Science.gov (United States)

    Reinhart, Edward E.

    1992-03-01

    The allocation in the range 500-3000 MHz for digital audio broadcasting (DAB) is described in terms of key issues such as the transmission-system architectures. Attention is given to the optimal amount of spectrum for allocation and the technological considerations relevant to downlink bands for satellite and terrestrial transmissions. Proposals for DAB allocations are compared, and reference is made to factors impinging on the provision of ground/satellite feeder links. The allocation proposals describe the implementation of 50-60-MHz bandwidths for broadcasting in the ranges near 800 MHz, below 1525 MHz, near 2350 MHz, and near 2600 MHz. Three specific proposals are examined in terms of characteristics such as service areas, coverage/beam, channels/satellite beam, and FCC license status. Several existing problems are identified including existing services crowded with systems, the need for new bands in the 1000-3000-MHz range, and variations in the nature and intensity of implementations of existing allocations that vary from country to country.

  5. Ad Serving Using a Compact Allocation Plan

    CERN Document Server

    Chen, Peiji; Mandalapu, Srinath; Nagarajan, Chandrashekhar; Shanmugasundaram, Jayavel; Vassilvitskii, Sergei; Vee, Erik; Yu, Manfai; Zien, Jason

    2012-01-01

    A large fraction of online display advertising is sold via guaranteed contracts: a publisher guarantees to the advertiser a certain number of user visits satisfying the targeting predicates of the contract. The publisher is then tasked with solving the ad serving problem - given a user visit, which of the thousands of matching contracts should be displayed, so that by the expiration time every contract has obtained the requisite number of user visits. The challenges of the problem come from (1) the sheer size of the problem being solved, with tens of thousands of contracts and billions of user visits, (2) the unpredictability of user behavior, since these contracts are sold months ahead of time, when only a forecast of user visits is available and (3) the minute amount of resources available online, as an ad server must respond with a matching contract in a fraction of a second. We present a solution to the guaranteed delivery ad serving problem using {\\em compact allocation plans}. These plans, computed offl...

  6. Allocation Reform of Public Educational Resources under the Background of Population Flow——Introduction and Related Problems of Educational Voucher System%人口流动社会背景下公共教育资源配置改革——兼论教育券制度的引进及其相关问题

    Institute of Scientific and Technical Information of China (English)

    俞杨建

    2012-01-01

    With rapid transformation from the traditional society to the modern one,lots of surplus rural labors have transferred from the country to the town and from less-developed regions to developed ones.Therefore,education problems of a number of preschoolers are on the agenda.Using the educational voucher system for reference,the paper discusses the allocation reform of China's public educational resources and related problems.%随着我国由传统社会向现代社会迅速转型,大量的农村剩余劳动力从农村向城市转移,从经济欠发达地区向经济发达地区流动。大批学龄儿童随父母流进城市。流动学龄儿童的教育问题提上日程。文章借鉴教育券制度,对我国公共教育资源配置改革及相关问题进行了探讨。

  7. Hybrid Distributed Iterative Capacity Allocation over Bluetooth Network

    DEFF Research Database (Denmark)

    Son, L.T.; Schiøler, Henrik; Madsen, Ole Brun

    With the current development of mobile devices, short range wireless communications have become more and more popular, and many researches on short range wireless communications, such as Bluetooth, have gained special interests, in industry as well as in academy. This paper analyzes capacity...... allocation issues in Bluetooth network as convex optimization problem. We formulate the problem of maximizing of total network flows and minimizing the costs of flows. The hybrid distributed capacity allocation scheme is proposed as an approximated solution of the formulated problem that satisfies quality...... of service requirements and constraints in Bluetooth network, such as limited capacity, decentralized, frequent changes of topology and of capacities assigned to nodes in the network. The simulation shows that the performance of Bluetooth could be improved by applying the hybrid distributed iterative...

  8. Hybrid Distributed Iterative Capacity Allocation over Bluetooth Network

    DEFF Research Database (Denmark)

    Son, L.T.; Schiøler, Henrik; Madsen, Ole Brun

    2002-01-01

    With the current development of mobile devices, short range wireless communications have become more and more popular, and many researches on short range wireless communications, such as Bluetooth, have gained special interests, in industry as well as in academy. This paper analyzes capacity...... allocation issues in Bluetooth network as convex optimization problem. We formulate the problem of maximizing of total network flows and minimizing the costs of flows. The hybrid distributed capacity allocation scheme is proposed as an approximated solution of the formulated problem that satisfies quality...... of service requirements and constraints in Bluetooth network, such as limited capacity, decentralized, frequent changes of topology and of capacities assigned to nodes in the network. The simulation shows that the performance of Bluetooth could be improved by applying the hybrid distributed iterative...

  9. Storage Space Allocation of Inbound Container in Railway Container Terminal

    Directory of Open Access Journals (Sweden)

    Li Wang

    2014-01-01

    Full Text Available Efficient storage strategy of railway container terminals is important in balancing resource utilization, reducing waiting time, and improving handling efficiency. In this paper, we consider the formulation and solution algorithm for storage space allocation problem of inbound containers in railway container terminal. The problem is formulated as two-stage optimization models, whose objectives are balancing the workload of inbound containers and reducing the overlapping amounts. An algorithm implement process based on rolling horizon approach is designed to solve the proposed models. Computational experiments on an actual railway container terminal show that the proposed approach is effective to solve space allocation problem of inbound container and is significant for the operation and organization of railway container terminals.

  10. Optimal resource allocation for distributed video communication

    CERN Document Server

    He, Yifeng

    2013-01-01

    While most books on the subject focus on resource allocation in just one type of network, this book is the first to examine the common characteristics of multiple distributed video communication systems. Comprehensive and systematic, Optimal Resource Allocation for Distributed Video Communication presents a unified optimization framework for resource allocation across these systems. The book examines the techniques required for optimal resource allocation over Internet, wireless cellular networks, wireless ad hoc networks, and wireless sensor networks. It provides you with the required foundat

  11. 45 CFR 304.15 - Cost allocation.

    Science.gov (United States)

    2010-10-01

    ... 45 Public Welfare 2 2010-10-01 2010-10-01 false Cost allocation. 304.15 Section 304.15 Public... FEDERAL FINANCIAL PARTICIPATION § 304.15 Cost allocation. A State agency in support of its claims under title IV-D of the Social Security Act must have an approved cost allocation plan on file with...

  12. 42 CFR 24.2 - Allocation.

    Science.gov (United States)

    2010-10-01

    ... 42 Public Health 1 2010-10-01 2010-10-01 false Allocation. 24.2 Section 24.2 Public Health PUBLIC....2 Allocation. (a) The Secretary, within the number authorized in the PHS Act, shall determine the... may advise the Secretary to make adjustments to the allocation at any time. (c) The majority of...

  13. 42 CFR 433.34 - Cost allocation.

    Science.gov (United States)

    2010-10-01

    ... 42 Public Health 4 2010-10-01 2010-10-01 false Cost allocation. 433.34 Section 433.34 Public... Provisions § 433.34 Cost allocation. A State plan under Title XIX of the Social Security Act must provide that the single or appropriate Agency will have an approved cost allocation plan on file with...

  14. 45 CFR 98.55 - Cost allocation.

    Science.gov (United States)

    2010-10-01

    ... 45 Public Welfare 1 2010-10-01 2010-10-01 false Cost allocation. 98.55 Section 98.55 Public... of Child Care and Development Funds § 98.55 Cost allocation. (a) The Lead Agency and subgrantees shall keep on file cost allocation plans or indirect cost agreements, as appropriate, that have...

  15. 25 CFR 39.902 - Allocation.

    Science.gov (United States)

    2010-04-01

    ... 25 Indians 1 2010-04-01 2010-04-01 false Allocation. 39.902 Section 39.902 Indians BUREAU OF... Maintenance and Minor Repair Fund § 39.902 Allocation. (a) Interim Maintenance and Minor Repair funds shall be... determining school allocations shall be taken from the facilities inventory maintained by the Division...

  16. 24 CFR 945.203 - Allocation plan.

    Science.gov (United States)

    2010-04-01

    ... 24 Housing and Urban Development 4 2010-04-01 2010-04-01 false Allocation plan. 945.203 Section... FAMILIES Application and Approval Procedures § 945.203 Allocation plan. (a) Applicable terminology. (1) As used in this section, the terms “initial allocation plan” refers to the PHA's first submission of...

  17. 48 CFR 5452.249 - Allocation.

    Science.gov (United States)

    2010-10-01

    ... 48 Federal Acquisition Regulations System 7 2010-10-01 2010-10-01 false Allocation. 5452.249... SOLICITATION PROVISIONS AND CONTRACT CLAUSES Texts of Provisions and Clauses 5452.249 Allocation. The Defense... contemplated and the contract amount is expected to exceed the small purchase limitation. Allocation (DFSC...

  18. 45 CFR 1355.57 - Cost allocation.

    Science.gov (United States)

    2010-10-01

    ... 45 Public Welfare 4 2010-10-01 2010-10-01 false Cost allocation. 1355.57 Section 1355.57 Public... MAINTENANCE PAYMENTS, ADOPTION ASSISTANCE, AND CHILD AND FAMILY SERVICES GENERAL § 1355.57 Cost allocation. (a... maintenance payments or adoption assistance payments may be made under the State plan. (b) Cost allocation...

  19. 45 CFR 205.150 - Cost allocation.

    Science.gov (United States)

    2010-10-01

    ... 45 Public Welfare 2 2010-10-01 2010-10-01 false Cost allocation. 205.150 Section 205.150 Public... ASSISTANCE PROGRAMS § 205.150 Cost allocation. A State plan under title I, IV-A, X, XIV, or XVI (AABD) of the Social Security Act must provide that the State agency will have an approved cost allocation plan on...

  20. 39 CFR 3060.12 - Asset allocation.

    Science.gov (United States)

    2010-07-01

    ... 39 Postal Service 1 2010-07-01 2010-07-01 false Asset allocation. 3060.12 Section 3060.12 Postal... COMPETITIVE PRODUCTS ENTERPRISE § 3060.12 Asset allocation. Within 6 months of January 23, 2009, and for each... competitive products enterprise using a method of allocation based on appropriate revenue or cost...

  1. 42 CFR 457.228 - Cost allocation.

    Science.gov (United States)

    2010-10-01

    ... 42 Public Health 4 2010-10-01 2010-10-01 false Cost allocation. 457.228 Section 457.228 Public...; Reduction of Federal Medical Payments § 457.228 Cost allocation. A State plan must provide that the single or appropriate CHIP Agency will have an approved cost allocation plan on file with the Department...

  2. 15 CFR 923.92 - Allocation.

    Science.gov (United States)

    2010-01-01

    ... 15 Commerce and Foreign Trade 3 2010-01-01 2010-01-01 false Allocation. 923.92 Section 923.92....92 Allocation. (a) Subsections 303(4), 306(d)(3)(B) and 306(d)(10) of the Act foster..., areawide agencies, regional agencies and interstate agencies. Such allocations provide for...

  3. Intelligent tactical asset allocation support system

    NARCIS (Netherlands)

    Hiemstra, Y.

    1995-01-01

    This paper presents an advanced support system for Tactical Asset Allocation. Asset allocation explains over 90% of portfolio performance (Brinson, Hood and Beebower, 1988). Tactical asset allocation adjusts a strategic portfolio on the basis of short term market outlooks. The system includes apredi

  4. 40 CFR 74.26 - Allocation formula.

    Science.gov (United States)

    2010-07-01

    ...) SULFUR DIOXIDE OPT-INS Allowance Calculations for Combustion Sources § 74.26 Allocation formula. (a) The Administrator will calculate the annual allowance allocation for a combustion source based on the data... 40 Protection of Environment 16 2010-07-01 2010-07-01 false Allocation formula. 74.26 Section...

  5. Model Checking Dynamic Allocation and Deallocation

    NARCIS (Netherlands)

    Distefano, Dino; Rensink, Arend; Katoen, Joost-Pieter

    2001-01-01

    This paper proposes Allocational Temporal Logic (ATL) as a formalism to express properties concerning the dynamic allocation (birth) and de-allocation (death) of entities, such as the objects in an object-based system. The logic is interpreted on History-Dependent Automata, extended with a symbolic

  6. Constrained Allocation Flux Balance Analysis

    CERN Document Server

    Mori, Matteo; Martin, Olivier C; De Martino, Andrea; Marinari, Enzo

    2016-01-01

    New experimental results on bacterial growth inspire a novel top-down approach to study cell metabolism, combining mass balance and proteomic constraints to extend and complement Flux Balance Analysis. We introduce here Constrained Allocation Flux Balance Analysis, CAFBA, in which the biosynthetic costs associated to growth are accounted for in an effective way through a single additional genome-wide constraint. Its roots lie in the experimentally observed pattern of proteome allocation for metabolic functions, allowing to bridge regulation and metabolism in a transparent way under the principle of growth-rate maximization. We provide a simple method to solve CAFBA efficiently and propose an "ensemble averaging" procedure to account for unknown protein costs. Applying this approach to modeling E. coli metabolism, we find that, as the growth rate increases, CAFBA solutions cross over from respiratory, growth-yield maximizing states (preferred at slow growth) to fermentative states with carbon overflow (preferr...

  7. Portfolio Allocation Subject to Credit Risk

    Directory of Open Access Journals (Sweden)

    Rogerio de Deus Oliveira

    2003-12-01

    Full Text Available Credit Risk is an important dimension to be considered in the risk management procedures of financial institutions. Is a particularly useful in emerging markets where default rates on bank loan products are usually high. It is usually calculated through highly costly Monte Carlo simulations which consider different stochastic factors driving the uncertainly associated to the borrowers liabilities. In this paper, under some restrictions, we drive closed form formulas for the probability distributions of default rates of bank loans products involving a big number of clients. This allows us to quickly obtain the credit risk of such products. Moreover, using these probability distributions, we solve the problem of optimal portfolio allocation under default risk.

  8. Resources Allocation Schemas for Web Information Monitoring

    Institute of Scientific and Technical Information of China (English)

    CHEN Kang; SHEN Meiming; ZHENG Weimin

    2005-01-01

    The web is an extremely dynamic world where information is updated even every second. A web information monitoring system fetches information from the web continuously and finds changes by comparing two versions of the same page. The updating of a specific web page is modeled as a Poisson process with parameter to indicate the change frequency. As the amount of computing resources is limited, it is necessary to find some policies for reducing the overall change-detection time. Different allocation schemas are evaluated experimentally to find out which one is the most suitable for the web information monitoring problem. The experimental data shows the runtime characteristics of the overall system performance and the relationship to the total amount of resources.

  9. Stochastic Resource Allocation for Energy-Constrained Systems

    Directory of Open Access Journals (Sweden)

    Sachs DanielGrobe

    2009-01-01

    Full Text Available Battery-powered wireless systems running media applications have tight constraints on energy, CPU, and network capacity, and therefore require the careful allocation of these limited resources to maximize the system's performance while avoiding resource overruns. Usually, resource-allocation problems are solved using standard knapsack-solving techniques. However, when allocating conservable resources like energy (which unlike CPU and network remain available for later use if they are not used immediately knapsack solutions suffer from excessive computational complexity, leading to the use of suboptimal heuristics. We show that use of Lagrangian optimization provides a fast, elegant, and, for convex problems, optimal solution to the allocation of energy across applications as they enter and leave the system, even if the exact sequence and timing of their entrances and exits is not known. This permits significant increases in achieved utility compared to heuristics in common use. As our framework requires only a stochastic description of future workloads, and not a full schedule, we also significantly expand the scope of systems that can be optimized.

  10. Power Allocation over Two Identical Gilbert-Elliott Channels

    CERN Document Server

    Tang, Junhua

    2012-01-01

    We study the problem of power allocation over two identical Gilbert-Elliot communication channels. Our goal is to maximize the expected discounted number of bits transmitted over an infinite time horizon. This is achieved by choosing among three possible strategies: (1) betting on channel 1 by allocating all the power to this channel, which results in high data rate if channel 1 happens to be in good state, and zero bits transmitted if channel 1 is in bad state (even if channel 2 is in good state) (2) betting on channel 2 by allocating all the power to the second channel, and (3) a balanced strategy whereby each channel is allocated half the total power, with the effect that each channel can transmit a low data rate if it is in good state. We assume that each channel's state is only revealed upon transmission of data on that channel. We model this problem as a partially observable Markov decision processes (MDP), and derive key threshold properties of the optimal policy. Further, we show that by formulating a...

  11. Popularity-aware rate allocation in multiview video

    Science.gov (United States)

    Fiandrotti, Attilio; Chakareski, Jacob; Frossard, Pascal

    2010-07-01

    We propose a framework for popularity-driven rate allocation in H.264/MVC-based multi-view video communications when the overall rate and the rate necessary for decoding each view are constrained in the delivery architecture. We formulate a rate allocation optimization problem that takes into account the popularity of each view among the client population and the rate-distortion characteristics of the multi-view sequence so that the performance of the system is maximized in terms of popularity-weighted average quality. We consider the cases where the global bit budget or the decoding rate of each view is constrained. We devise a simple ratevideo- quality model that accounts for the characteristics of interview prediction schemes typical of multi-view video. The video quality model is used for solving the rate allocation problem with the help of an interior point optimization method. We then show through experiments that the proposed rate allocation scheme clearly outperforms baseline solutions in terms of popularity-weighted video quality. In particular, we demonstrate that the joint knowledge of the rate-distortion characteristics of the video content, its coding dependencies, and the popularity factor of each view is key in achieving good coding performance in multi-view video systems.

  12. Dynamic optimization model for allocating medical resources in epidemic controlling

    Directory of Open Access Journals (Sweden)

    Ming Liu

    2013-03-01

    Full Text Available Purpose: The model proposed in this paper addresses a dynamic optimization model for allocating medical resources in epidemic controlling.Design/methodology/approach: In this work, a three-level and dynamic linear programming model for allocating medical resources based on epidemic diffusion model is proposed. The epidemic diffusion model is used to construct the forecasting mechanism for dynamic demand of medical resources. Heuristic algorithm coupled with MTLAB mathematical programming solver is adopted to solve the model. A numerical example is presented for testing the model’s practical applicability.Findings: The main contribution of the present study is that a discrete time-space network model to study the medical resources allocation problem when an epidemic outbreak is formulated. It takes consideration of the time evolution and dynamic nature of the demand, which is different from most existing researches on medical resources allocation.Practical implications: In our model, the medicine logistics operation problem has been decomposed into several mutually correlated sub-problems, and then be solved systematically in the same decision scheme. Thus, the result will be much more suitable for real operations.Originality/value: In our model, the rationale that the medical resources allocated in early periods will take effect in subduing the spread of the epidemic spread and thus impact the demand in later periods has been for the first time incorporated. A win-win emergency rescue effect is achieved by the integrated and dynamic optimization model. The total rescue cost is controlled effectively, and meanwhile, inventory level in each urban health departments is restored and raised gradually.

  13. Availability Allocation of Networked Systems Using Markov Model and Heuristics Algorithm

    Directory of Open Access Journals (Sweden)

    Ruiying Li

    2014-01-01

    Full Text Available It is a common practice to allocate the system availability goal to reliability and maintainability goals of components in the early design phase. However, the networked system availability is difficult to be allocated due to its complex topology and multiple down states. To solve these problems, a practical availability allocation method is proposed. Network reliability algebraic methods are used to derive the availability expression of the networked topology on the system level, and Markov model is introduced to determine that on the component level. A heuristic algorithm is proposed to obtain the reliability and maintainability allocation values of components. The principles applied in the AGREE reliability allocation method, proposed by the Advisory Group on Reliability of Electronic Equipment, and failure rate-based maintainability allocation method persist in our allocation method. A series system is used to verify the new algorithm, and the result shows that the allocation based on the heuristic algorithm is quite accurate compared to the traditional one. Moreover, our case study of a signaling system number 7 shows that the proposed allocation method is quite efficient for networked systems.

  14. Optimization of Power Allocation for Multiusers in Multi-Spot-Beam Satellite Communication Systems

    Directory of Open Access Journals (Sweden)

    Heng Wang

    2014-01-01

    Full Text Available In recent years, multi-spot-beam satellite communication systems have played a key role in global seamless communication. However, satellite power resources are scarce and expensive, due to the limitations of satellite platform. Therefore, this paper proposes optimizing the power allocation of each user in order to improve the power utilization efficiency. Initially the capacity allocated to each user is calculated according to the satellite link budget equations, which can be achieved in the practical satellite communication systems. The problem of power allocation is then formulated as a convex optimization, taking account of a trade-off between the maximization of the total system capacity and the fairness of power allocation amongst the users. Finally, an iterative algorithm based on the duality theory is proposed to obtain the optimal solution to the optimization. Compared with the traditional uniform resource allocation or proportional resource allocation algorithms, the proposed optimal power allocation algorithm improves the fairness of power allocation amongst the users. Moreover, the computational complexity of the proposed algorithm is linear with both the numbers of the spot beams and users. As a result, the proposed power allocation algorithm is easy to be implemented in practice.

  15. Research on the Cost Allocation of Joint Distribution of Agricultural Products based on Game Theory

    Directory of Open Access Journals (Sweden)

    Jing Wang

    2013-08-01

    Full Text Available Joint distribution in the process of circulation of agricultural products can reduce the cost of agricultural products circulation, improves the efficiency of logistics distribution, but for how to solve the problem of cost allocation has always been the major obstacle to the development of this model. The joint distribution model of agricultural products is presented in this study and then considers the problem of cost reduction in joint distribution of two agricultural products retailers. The amount of cost reduction is regarded as the income of distribution, which is distributed effectively by using game theory and resolve the problem of Cost allocation in joint distribution. Through the analysis of an example the joint distribution model can largely reduce the cost of distribution for agricultural products. Finally, through the distribution cost allocation verified the effectiveness and feasibility of this method of cost allocation.

  16. Hybrid Genetic Crossover Based Swarm Intelligence Optimization for Efficient Resource Allocation in MIMO OFDM Systems

    Directory of Open Access Journals (Sweden)

    B. Sathish Kumar

    2015-07-01

    Full Text Available Rapid development of wireless services, leads to ubiquitous personal connectivity in the world. The demand for multimedia interactivity is higher in the world which leads to the requirement of high data transmission rate. Multiple-Input Multiple-Output Orthogonal Frequency Division Multiplexing (MIMO-OFDM is a future wireless service which is used to overcome the existing service problems such as development of subscriber pool and higher throughput per user. Although it overcomes the problems in existing services, resource allocation becomes one of the major issues in the MIMO-OFDM systems. Resource allocation in MIMO-OFDM is the optimization of subcarrier and power allocation for the user. The overall performance of the system can be improved only with the efficient resource allocation approach. The user data rate is increased by efficient allocation of the subcarrier and power allocation for each user at the base station, which is subject to constraints on total power and bit error rate. In this study, the problem of resource allocation in MIMO-OFDM system is tackled using hybrid artificial bee colony optimization algorithm based on a crossover operation along with Poisson-Jensen in equation. The experimental results show that the proposed methodology is better than the existing techniques.

  17. Routing and spectrum allocation in multi-ring based data center networks

    Science.gov (United States)

    Zhang, Zitian; Hu, Weisheng; Ye, Tong; Sun, Weiqiang; Zhao, Li; Zhang, Kuo

    2016-02-01

    Recently, we proposed a multi-ring based optical circuit switching (OCS) network following the principle of a Clos network. The network can provide connectivity to a large number of racks which may be distributed across a relatively large geographical space in a data center. However, property of the ring based switch in the central stage of the multi-ring based OCS network introduces a unique routing and spectrum allocation (RSA) problem which is more complex than the routing problem in a classical Clos switching network. In this paper, we extend our work to investigate the RSA problem. For a given set of inter-rack traffic requests, we consider two spectrum allocation schemes, namely fixed spectrum allocation and flexible spectrum allocation. For the fixed case, we show that the RSA problem degenerates into the traditional routing problem of the Clos network. As for the flexible case, property of spectrum division multiplexing technology and bandwidth limitation of the ring based switches should be taken into consideration during allocation of the central module, such that the system throughput can be maximized. This paper presents an integer linear program (ILP) formulation as well as a heuristic algorithm we developed to solve the flexible RSA problem. We evaluate the performance of both the two spectrum allocation schemes under different traffic patterns. Our results demonstrate that, to handle uneven inter-rack traffic pattern in general data center networks, flexible spectrum allocation can lead to an increase of about 120% in system throughput, although its computational complexity is slightly higher than that of the fixed spectrum allocation scheme.

  18. SHALE: An Efficient Algorithm for Allocation of Guaranteed Display Advertising

    CERN Document Server

    Bharadwaj, Vijay; Ma, Wenjing; Nagarajan, Chandrashekhar; Tomlin, John; Vassilvitskii, Sergei; Vee, Erik; Yang, Jian

    2012-01-01

    Motivated by the problem of optimizing allocation in guaranteed display advertising, we develop an efficient, lightweight method of generating a compact {\\em allocation plan} that can be used to guide ad server decisions. The plan itself uses just O(1) state per guaranteed contract, is robust to noise, and allows us to serve (provably) nearly optimally. The optimization method we develop is scalable, with a small in-memory footprint, and working in linear time per iteration. It is also "stop-anytime", meaning that time-critical applications can stop early and still get a good serving solution. Thus, it is particularly useful for optimizing the large problems arising in the context of display advertising. We demonstrate the effectiveness of our algorithm using actual Yahoo! data.

  19. The veil of ignorance and health resource allocation.

    Science.gov (United States)

    Soto, Carlos

    2012-08-01

    Some authors view the veil of ignorance as a preferred method for allocating resources because it imposes impartiality by stripping deliberators of knowledge of their personal identity. Using some prominent examples of such reasoning in the health care sector, I will argue for the following claims. First, choice behind a veil of ignorance often fails to provide clear guidance regarding resource allocation. Second, regardless of whether definite results could be derived from the veil, these results do not in themselves have important moral standing. This is partly because the veil does not determine which features are morally relevant for a given distributive problem. Third, even when we have settled the question of what features to count, choice behind a veil of ignorance arguably fails to take persons seriously. Ultimately, we do not need the veil to solve distributive problems, and we have good reason to appeal to some other distributive model.

  20. Hybrid particle swarm optimization for multiobjective resource allocation

    Institute of Scientific and Technical Information of China (English)

    Yi Yang; Li Xiaoxing; Gu Chunqin

    2008-01-01

    Resource allocation (RA) is the problem of allocating resources among various artifacts or business units to meet one or more expected goals,such as maximizing the profits,minimizing the costs,or achieving the best qualities.A complex multiobjective RA is addressed,and a multiobjective mathematical model is used to find solutions efficiently.Then,an improved particle swarm algorithm (mO_PSO) is proposed combined with a new particle diversity controller policies and dissipation operation.Meanwhile,a modified Pareto methods used in PSO to deal with multiobjectives optimization is presented.The effectiveness of the provided algorithm is validated by its application to some illustrative example dealing with multiobjective RA problems and with the comparative experiment with other algorithm.

  1. Cooperative Task Allocation Method of MCAV/UCAV Formation

    Directory of Open Access Journals (Sweden)

    Yun Zhong

    2016-01-01

    Full Text Available Unmanned Combat Aerial Vehicle (UCAV cooperative task allocation under Manned Combat Aerial Vehicle’s (MCAV limited control is one of the important problems in UCAV research field. Hereto, we analyze the key technical and tactical indices influence task allocation problem and build an appropriate model to maximize the objective function values as well as reflecting various constraints. A novel improved multigroup ant colony algorithm (IMGACA is proposed to solve the model; the algorithm mainly includes random sequence-based UCAV selection strategy, constraint-based candidate task generation strategy, objective function value-based state transition strategy, and crossover operator-based local search strategy. Simulation results show that the built model is reasonable and the proposed algorithm performs well in feasibility, timeliness, and stability.

  2. An Efficient Algorithm for Resource Allocation in Parallel and Distributed Computing Systems

    Directory of Open Access Journals (Sweden)

    S.F. El-Zoghdy

    2013-03-01

    Full Text Available Resource allocation in heterogeneous parallel and distributed computing systems is the process of allocating user tasks to processing elements for execution such that some performance objective is optimized. In this paper, a new resource allocation algorithm for the computing grid environment is proposed. It takes into account the heterogeneity of the computational resources. It resolves the single point of failure problem which many of the current algorithms suffer from. In this algorithm, any site manager receives two kinds of tasks namely, remote tasks arriving from its associated local grid manager, and local tasks submitted directly to the site manager by local users in its domain. It allocates the grid workload based on the resources occupation ratio and the communication cost. The grid overall mean task response time is considered as the main performance metric that need to be minimized. The simulation results show that the proposed resource allocation algorithm improves the grid overall mean task response time. (Abstract

  3. A Joint Design Approach of Partitioning and Allocation in Parallel Data Warehouses

    Science.gov (United States)

    Bellatreche, Ladjel; Benkrid, Soumia

    Traditionally, designing a parallel data warehouse consists first in fragmenting its schema and then allocating the generated fragments over the nodes of the parallel machine. The main drawback of this approach is that interdependency between fragmentation and allocation processes is not taken into account during the design phase. This interdependency is characterized by the fact that generated of fragments are one of the inputs of the allocation problem and both processes optimize the same set of queries. In this paper, we present a new approach for designing parallel relational data warehouses on a shared nothing machine, where the fragmentation and the allocation are done simultaneously. To allocate efficiently query workload over nodes, a load balancing method is given. Finally, a validation of our proposals is presented.

  4. An Improved Genetic Algorithm for Allocation Optimization of Distribution Centers

    Institute of Scientific and Technical Information of China (English)

    钱晶; 庞小红; 吴智铭

    2004-01-01

    This paper introduced an integrated allocation model for distribution centers (DCs). The facility cost, inventory cost, transportation cost and service quality were considered in the model. An improved genetic algorithm (IGA) was proposed to solve the problem. The improvement of IGA is based on the idea of adjusting crossover probability and mutation probability. The IGA is supplied by heuristic rules too. The simulation results show that the IGA is better than the standard GA(SGA) in search efficiency and equality.

  5. Constrained Allocation Flux Balance Analysis

    Science.gov (United States)

    Mori, Matteo; Hwa, Terence; Martin, Olivier C.

    2016-01-01

    New experimental results on bacterial growth inspire a novel top-down approach to study cell metabolism, combining mass balance and proteomic constraints to extend and complement Flux Balance Analysis. We introduce here Constrained Allocation Flux Balance Analysis, CAFBA, in which the biosynthetic costs associated to growth are accounted for in an effective way through a single additional genome-wide constraint. Its roots lie in the experimentally observed pattern of proteome allocation for metabolic functions, allowing to bridge regulation and metabolism in a transparent way under the principle of growth-rate maximization. We provide a simple method to solve CAFBA efficiently and propose an “ensemble averaging” procedure to account for unknown protein costs. Applying this approach to modeling E. coli metabolism, we find that, as the growth rate increases, CAFBA solutions cross over from respiratory, growth-yield maximizing states (preferred at slow growth) to fermentative states with carbon overflow (preferred at fast growth). In addition, CAFBA allows for quantitatively accurate predictions on the rate of acetate excretion and growth yield based on only 3 parameters determined by empirical growth laws. PMID:27355325

  6. Transnational Energy Companies' Investment Allocation Decisions

    Energy Technology Data Exchange (ETDEWEB)

    Osmundsen, Petter; Emhjellen, Magne; Halleraker, Morten

    2001-10-01

    When making international capital budgeting decisions, energy companies are often faced with capital and organisational constraints. The constraints may be real or management imposed. In addition, when entering into a new country or region the companies will incur fixed new area costs that must be considered before investment approval. The decision problem is therefore not a linear problem where the standard net present value rule applies, but a non-linear problem of selecting the combination of projects with the maximum aggregate net present value. New project investments will therefore be selected based on the size of the net present value (often referred to as financial volume or materiality) compared to the projects' use of capital and scarce personnel and organisational capacity. Consequently, projects with a positive net present value, but with low materiality, may not be approved. The portfolio choice has a parallel to the company's choice of core areas. Instead of complex portfolio models, the companies often apply simpler allocation mechanisms, e.g., combinations of fixed investment budgets and materiality requirements. Analysing petroleum cases, we compare the allocations decisions generated by portfolio models and simpler mechanisms. We also discuss the implications of this capital allocation pattern for governments' design of tax systems and license conditions. (author)

  7. Software Operational Profile Based Test Case Allocation Using Fuzzy Logic

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    Software operational profile (SOP) is used in software reliability prediction, software quality assessment, performance analysis of software, test case allocation, determination of "when to stop testing," etc. Due to the limited data resources and large efforts required to collect and convert the gathered data into point estimates, reluctance is observed by the software professionals to develop the SOP. A framework is proposed to develop SOP using fuzzy logic, which requires usage data in the form of linguistics. The resulting profile is named fuzzy software operational profile (FSOP). Based on this work, this paper proposes a generalized approach for the allocation of test cases, in which occurrence probability of operations obtained from FSOP are combined with the criticality of the operations using fuzzy inference system (FIS). Traditional methods for the allocation of test cases do not consider the application in which software operates. This is intuitively incorrect. To solve this problem, allocation of test cases with respect to software application using the FIS model is also proposed in this paper.

  8. Job Admission and Resource Allocation in Distributed Streaming Systems

    Science.gov (United States)

    Wolf, Joel; Bansal, Nikhil; Hildrum, Kirsten; Parekh, Sujay; Rajan, Deepak; Wagle, Rohit; Wu, Kun-Lung

    This paper describes a new and novel scheme for job admission and resource allocation employed by the SODA scheduler in System S. Capable of processing enormous quantities of streaming data, System S is a large-scale, distributed stream processing system designed to handle complex applications. The problem of scheduling in distributed, stream-based systems is quite unlike that in more traditional systems. And the requirements for System S, in particular, are more stringent than one might expect even in a “standard” stream-based design. For example, in System S, the offered load is expected to vastly exceed system capacity. So a careful job admission scheme is essential. The jobs in System S are essentially directed graphs, with software “processing elements” (PEs) as vertices and data streams as edges connecting the PEs. The jobs themselves are often heavily interconnected. Thus resource allocation of individual PEs must be done carefully in order to balance the flow. We describe the design of the SODA scheduler, with particular emphasis on the component, known as macroQ, which performs the job admission and resource allocation tasks. We demonstrate by experiments the natural trade-offs between job admission and resource allocation.

  9. MAC Layer Resource Allocation for Wireless Body Area Networks

    Institute of Scientific and Technical Information of China (English)

    Qinghua Shen; Xuemin Sherman Shen; Tom HLuan; Jing Liu

    2014-01-01

    Wireless body area networks (WBANs) can provide low-cost, timely healthcare services and are expected to be widely used for e-healthcare in hospitals. In a hospital, space is often limited and multiple WBANs have to coexist in an area and share the same channel in order to provide healthcare services to different patients. This causes severe interference between WBANs that could significantly reduce the network throughput and increase the amount of power consumed by sensors placed on the body. There-fore, an efficient channel-resource allocation scheme in the medium access control (MAC) layer is crucial. In this paper, we devel-op a centralized MAC layer resource allocation scheme for a WBAN. We focus on mitigating the interference between WBANs and reducing the power consumed by sensors. Channel and buffer state are reported by smartphones deployed in each WBAN, and channel access allocation is performed by a central controller to maximize network throughput. Sensors have strict limitations in terms of energy consumption and computing capability and cannot provide all the necessary information for channel allocation in a timely manner. This deteriorates network performance. We exploit the temporal correlation of the body area channel in order to minimize the number of channel state reports necessary. We view the network design as a partly observable optimization prob-lem and develop a myopic policy, which we then simulate in Matlab.

  10. Optimization of reliability allocation strategies through use of genetic algorithms

    Energy Technology Data Exchange (ETDEWEB)

    Campbell, J.E.; Painton, L.A.

    1996-08-01

    This paper examines a novel optimization technique called genetic algorithms and its application to the optimization of reliability allocation strategies. Reliability allocation should occur in the initial stages of design, when the objective is to determine an optimal breakdown or allocation of reliability to certain components or subassemblies in order to meet system specifications. The reliability allocation optimization is applied to the design of a cluster tool, a highly complex piece of equipment used in semiconductor manufacturing. The problem formulation is presented, including decision variables, performance measures and constraints, and genetic algorithm parameters. Piecewise ``effort curves`` specifying the amount of effort required to achieve a certain level of reliability for each component of subassembly are defined. The genetic algorithm evolves or picks those combinations of ``effort`` or reliability levels for each component which optimize the objective of maximizing Mean Time Between Failures while staying within a budget. The results show that the genetic algorithm is very efficient at finding a set of robust solutions. A time history of the optimization is presented, along with histograms or the solution space fitness, MTBF, and cost for comparative purposes.

  11. A Thrust Allocation Method for Efficient Dynamic Positioning of a Semisubmersible Drilling Rig Based on the Hybrid Optimization Algorithm

    Directory of Open Access Journals (Sweden)

    Luman Zhao

    2015-01-01

    Full Text Available A thrust allocation method was proposed based on a hybrid optimization algorithm to efficiently and dynamically position a semisubmersible drilling rig. That is, the thrust allocation was optimized to produce the generalized forces and moment required while at the same time minimizing the total power consumption under the premise that forbidden zones should be taken into account. An optimization problem was mathematically formulated to provide the optimal thrust allocation by introducing the corresponding design variables, objective function, and constraints. A hybrid optimization algorithm consisting of a genetic algorithm and a sequential quadratic programming (SQP algorithm was selected and used to solve this problem. The proposed method was evaluated by applying it to a thrust allocation problem for a semisubmersible drilling rig. The results indicate that the proposed method can be used as part of a cost-effective strategy for thrust allocation of the rig.

  12. An iterative expanding and shrinking process for processor allocation in mixed-parallel workflow scheduling.

    Science.gov (United States)

    Huang, Kuo-Chan; Wu, Wei-Ya; Wang, Feng-Jian; Liu, Hsiao-Ching; Hung, Chun-Hao

    2016-01-01

    Parallel computation has been widely applied in a variety of large-scale scientific and engineering applications. Many studies indicate that exploiting both task and data parallelisms, i.e. mixed-parallel workflows, to solve large computational problems can get better efficacy compared with either pure task parallelism or pure data parallelism. Scheduling traditional workflows of pure task parallelism on parallel systems has long been known to be an NP-complete problem. Mixed-parallel workflow scheduling has to deal with an additional challenging issue of processor allocation. In this paper, we explore the processor allocation issue in scheduling mixed-parallel workflows of moldable tasks, called M-task, and propose an Iterative Allocation Expanding and Shrinking (IAES) approach. Compared to previous approaches, our IAES has two distinguishing features. The first is allocating more processors to the tasks on allocated critical paths for effectively reducing the makespan of workflow execution. The second is allowing the processor allocation of an M-task to shrink during the iterative procedure, resulting in a more flexible and effective process for finding better allocation. The proposed IAES approach has been evaluated with a series of simulation experiments and compared to several well-known previous methods, including CPR, CPA, MCPA, and MCPA2. The experimental results indicate that our IAES approach outperforms those previous methods significantly in most situations, especially when nodes of the same layer in a workflow might have unequal workloads.

  13. Power-Rate Allocation in DS/CDMA Based on Discretized Verhulst Equilibrium

    CERN Document Server

    Sampaio, Lucas Dias H; Proença, Mario Lemes; Abrão, Taufik

    2010-01-01

    This paper proposes to extend the discrete Verhulst power equilibrium approach, previously suggested in [1], to the power-rate optimal allocation problem. Multirate users associated to different types of traffic are aggregated to distinct user' classes, with the assurance of minimum rate allocation per user and QoS. Herein, Verhulst power allocation algorithm was adapted to the single-input-single-output DS/CDMA jointly power-rate control problem. The analysis was carried out taking into account the convergence time, quality of solution, in terms of the normalized squared error (NSE), when compared with the analytical solution based on interference matrix inverse, and computational complexity. Numerical results demonstrate the validity of the proposed resource allocation methodology.

  14. A mathematical modeling approach to resource allocation for railroad-highway crossing safety upgrades.

    Science.gov (United States)

    Konur, Dinçer; Golias, Mihalis M; Darks, Brandon

    2013-03-01

    State Departments of Transportation (S-DOT's) periodically allocate budget for safety upgrades at railroad-highway crossings. Efficient resource allocation is crucial for reducing accidents at railroad-highway crossings and increasing railroad as well as highway transportation safety. While a specific method is not restricted to S-DOT's, sorting type of procedures are recommended by the Federal Railroad Administration (FRA), United States Department of Transportation for the resource allocation problem. In this study, a generic mathematical model is proposed for the resource allocation problem for railroad-highway crossing safety upgrades. The proposed approach is compared to sorting based methods for safety upgrades of public at-grade railroad-highway crossings in Tennessee. The comparison shows that the proposed mathematical modeling approach is more efficient than sorting methods in reducing accidents and severity.

  15. Methodology for reliability allocation based on fault tree analysis and dualistic contrast

    Institute of Scientific and Technical Information of China (English)

    TONG Lili; CAO Xuewu

    2008-01-01

    Reliability allocation is a difficult multi-objective optimization problem.This paper presents a methodology for reliability allocation that can be applied to determine the reliability characteristics of reactor systems or subsystems.The dualistic contrast,known as one of the most powerful tools for optimization problems,is applied to the reliability allocation model of a typical system in this article.And the fault tree analysis,deemed to be one of the effective methods of reliability analysis,is also adopted.Thus a failure rate allocation model based on the fault tree analysis and dualistic contrast is achieved.An application on the emergency diesel generator in the nuclear power plant is given to illustrate the proposed method.

  16. Minimum cost maximum flow algorithm for upstream bandwidth allocation in OFDMA passive optical networks

    Science.gov (United States)

    Wu, Yating; Kuang, Bin; Wang, Tao; Zhang, Qianwu; Wang, Min

    2015-12-01

    This paper presents a minimum cost maximum flow (MCMF) based upstream bandwidth allocation algorithm, which supports differentiated QoS for orthogonal frequency division multiple access passive optical networks (OFDMA-PONs). We define a utility function as the metric to characterize the satisfaction degree of an ONU on the obtained bandwidth. The bandwidth allocation problem is then formulated as maximizing the sum of the weighted total utility functions of all ONUs. By constructing a flow network graph, we obtain the optimized bandwidth allocation using the MCMF algorithm. Simulation results show that the proposed scheme improves the performance in terms of mean packet delay, packet loss ratio and throughput.

  17. Space Network Control (SNC) Conference on Resource Allocation Concepts and Approaches. Overview

    Science.gov (United States)

    1991-01-01

    In session 1 of the conference, Concepts for space network resource allocation was the main topic. In session 2, Space Network Control and user payload operations and control center human-computer interface, was the topic of discussion. The topic of session 3 was Resource allocation tools, technology, and algorithms. Some of the stated goals for the conference are as follows: to survey existing resource allocation concepts and approaches; to identify solutions applicable to the SN problem; to identify fruitful avenues of study in support of SNC development; and to capture knowledge in proceedings and make available to bidders on the SNC concept definition procurement.

  18. Time allocation between feeding and incubation in uniparental arctic-breeding shorebirds: energy reserves provide leeway in a tight schedule

    NARCIS (Netherlands)

    Tulp, I.Y.M.; Schekkerman, H.

    2006-01-01

    Birds with uniparental incubation may face a time allocation problem between incubation and feeding. Eggs need regular warming to hatch successfully, but the parent must leave the nest to feed and safeguard its own survival. Time allocation during incubation is likely to depend on factors influencin

  19. Peer-Allocated Instant Response (PAIR): Computional allocation of peer tutors in learning communities

    NARCIS (Netherlands)

    Westera, Wim

    2009-01-01

    Westera, W. (2007). Peer-Allocated Instant Response (PAIR): Computational allocation of peer tutors in learning communities. Journal of Artificial Societies and Social Simulation, http://jasss.soc.surrey.ac.uk/10/2/5.html

  20. Constant time worker thread allocation via configuration caching

    Science.gov (United States)

    Eichenberger, Alexandre E; O'Brien, John K. P.

    2014-11-04

    Mechanisms are provided for allocating threads for execution of a parallel region of code. A request for allocation of worker threads to execute the parallel region of code is received from a master thread. Cached thread allocation information identifying prior thread allocations that have been performed for the master thread are accessed. Worker threads are allocated to the master thread based on the cached thread allocation information. The parallel region of code is executed using the allocated worker threads.

  1. A simple convex optimization problem with many applications

    DEFF Research Database (Denmark)

    Vidal, Rene Victor Valqui

    1994-01-01

    This paper presents an algorithm for the solution of a simple convex optimization problem. This problem is a generalization of several other optimization problems which have applications to resource allocation, optimal capacity expansion, and vehicle scheduling. The algorithm is based...

  2. A strategic capacity allocation model for a complex supply chain: formulation and solution approach comparison

    OpenAIRE

    Li, H.; Hendry, L; Teunter, R.H.

    2009-01-01

    In this paper, a capacity allocation problem is discussed based on a more complex supply chain than has been typically considered in previous quantitative modelling studies. This study analyses an integrated supply chain operation from raw material purchasing to final product distribution. The aim is to optimize the allocation of capacities among different facilities and product items. In this paper, a mixed integer programming model with dynamic characteristics is presented first, and then a...

  3. A spatial orthogonal allocation and heterogeneous cultural hybrid algorithm for multirobot exploration mission planning

    Institute of Scientific and Technical Information of China (English)

    2011-01-01

    A spatial orthogonal allocation method is devised for multirobot tasks allocation.A 3D space model is adopted to describe exploration mission;meanwhile spatial orthogonal tentative technology is utilized to update the attractor position for load balance.Heterogeneous interactive cultural hybrid architecture is proposed to solve a robot route planning problem;it utilizes good-point-set to initialize population spaces,redefine novel evolution model and particle evolution ability,and introduce near-neighbor lo...

  4. Optimal Allocation of Water Resources Based on Water Supply Security

    Directory of Open Access Journals (Sweden)

    Jianhua Wang

    2016-06-01

    Full Text Available Under the combined impacts of climate change and human activities, a series of water issues, such as water shortages, have arisen all over the world. According to current studies in Science and Nature, water security has become a frontier critical topic. Water supply security (WSS, which is the state of water resources and their capacity and their capacity to meet the demand of water users by water supply systems, is an important part of water security. Currently, WSS is affected by the amount of water resources, water supply projects, water quality and water management. Water shortages have also led to water supply insecurity. WSS is now evaluated based on the balance of the supply and demand under a single water resources condition without considering the dynamics of the varying conditions of water resources each year. This paper developed an optimal allocation model for water resources that can realize the optimal allocation of regional water resources and comprehensively evaluate WSS. The objective of this model is to minimize the duration of water shortages in the long term, as characterized by the Water Supply Security Index (WSSI, which is the assessment value of WSS, a larger WSSI value indicates better results. In addition, the simulation results of the model can determine the change process and dynamic evolution of the WSS. Quanzhou, a city in China with serious water shortage problems, was selected as a case study. The allocation results of the current year and target year of planning demonstrated that the level of regional comprehensive WSS was significantly influenced by the capacity of water supply projects and the conditions of the natural water resources. The varying conditions of the water resources allocation results in the same year demonstrated that the allocation results and WSSI were significantly affected by reductions in precipitation, decreases in the water yield coefficient, and changes in the underlying surface.

  5. State Profiles of Subcounty Allocation Procedures: Appendix to the Title I, ESEA, Subcounty Allocation Study.

    Science.gov (United States)

    Gutmann, Babette; Paller, Alan T.

    In this appendix to the study of subcounty allocation of Title I of the Elementary and Secondary Education Act, state by state profiles of subcounty allocation are provided. The allocation formula and procedures used by each state for fiscal year 1977 are explained. Other data for each state, such as number of school districts and counties which…

  6. Efficient power allocation for fixed-gain amplify-and-forward relaying in rayleigh fading

    KAUST Repository

    Zafar, Ammar

    2013-06-01

    In this paper, we study power allocation strategies for a fixed-gain amplify-and-forward relay network employing multiple relays. We consider two optimization problems for the relay network: 1) optimal power allocation to maximize the end-to-end signal-to-noise ratio (SNR) and 2) minimizing the total consumed power while maintaining the end-to-end SNR over a threshold value. We assume that the relays have knowledge of only the channel statistics of all the links. We show that the SNR maximization problem is concave and the power minimization problem is convex. Hence, we solve the problems through convex programming. Numerical results show the benefit of allocating power optimally rather than uniformly. © 2013 IEEE.

  7. Load Balancing in Local Computational Grids within Resource Allocation Process

    Directory of Open Access Journals (Sweden)

    Rouhollah Golmohammadi

    2012-11-01

    Full Text Available A suitable resource allocation method in computational grids should schedule resources in a way that provides the requirements of the users and the resource providers; i.e., the maximum number of tasks should be completed in their time and budget constraints and the received load be distributed equally between resources. This is a decision-making problem, while the scheduler should select a resource from all ones. This process is a multi criteria decision-making problem; because of affect of different properties of resources on this decision. The goal of this decision-making process is balancing the load and completing the tasks in their defined constraints. The proposed algorithm is an analytic hierarchy process based Resource Allocation (ARA method. This method estimates a value for the preference of each resource and then selects the appropriate resource based on the allocated values. The simulations show the ARA method decreases the task failure rate at least 48% and increases the balance factor more than 3.4%.

  8. User Equilibrium Exchange Allocation Algorithm Based on Super Network

    Directory of Open Access Journals (Sweden)

    Peiyi Dong

    2013-12-01

    Full Text Available The theory of super network is an effective method to various traffic networks with means of multiple decision-making. It provides us with a favorable pricing decision tool for it combines a practical transport network with the space pricing decision. Spatial price equilibrium problem has always been the important research direction of the Transport Economics and regional transportation planning. As to how to combine the two, this paper presents the user equilibrium exchange allocation algorithm based on super network, which successfully keep the classical spatial price equilibrium problems (SPE into a super-network analysis framework. Through super-network analysis, we can add two virtual nodes in the network, which correspond to the virtual supply node and the super-super-demand virtual node, analysis the user equivalence with the SPE equilibrium and find the concrete steps of users exchange allocation algorithm based on super-network equilibrium. Finally, we carried out experiments to verify. The experiments show that: through the user equilibrium exchange SPE allocation algorithm based on super-network, we can get the steady-state equilibrium solution, which demonstrate that the algorithm is reasonable.

  9. Comprehensive Reliability Allocation Method for CNC Lathes Based on Cubic Transformed Functions of Failure Mode and Effects Analysis

    Institute of Scientific and Technical Information of China (English)

    YANG Zhou; ZHU Yunpeng; REN Hongrui; ZHANG Yimin

    2015-01-01

    Reliability allocation of computerized numerical controlled(CNC) lathes is very important in industry. Traditional allocation methods only focus on high-failure rate components rather than moderate failure rate components, which is not applicable in some conditions. Aiming at solving the problem of CNC lathes reliability allocating, a comprehensive reliability allocation method based on cubic transformed functions of failure modes and effects analysis(FMEA) is presented. Firstly, conventional reliability allocation methods are introduced. Then the limitations of direct combination of comprehensive allocation method with the exponential transformed FMEA method are investigated. Subsequently, a cubic transformed function is established in order to overcome these limitations. Properties of the new transformed functions are discussed by considering the failure severity and the failure occurrence. Designers can choose appropriate transform amplitudes according to their requirements. Finally, a CNC lathe and a spindle system are used as an example to verify the new allocation method. Seven criteria are considered to compare the results of the new method with traditional methods. The allocation results indicate that the new method is more flexible than traditional methods. By employing the new cubic transformed function, the method covers a wider range of problems in CNC reliability allocation without losing the advantages of traditional methods.

  10. A survey and taxonomy on energy efficient resource allocation techniques for cloud computing systems

    Energy Technology Data Exchange (ETDEWEB)

    Hameed, Abdul; Khoshkbarforoushha, Alireza; Ranjan, Rajiv; Jayaraman, Prem Prakash; Kolodziej, Joanna; Balaji, Pavan; Zeadally, Sherali; Malluhi, Qutaibah Marwan; Tziritas, Nikos; Vishnu, Abhinav; Khan, Samee U.; Zomaya, Albert

    2014-06-06

    In a cloud computing paradigm, energy efficient allocation of different virtualized ICT resources (servers, storage disks, and networks, and the like) is a complex problem due to the presence of heterogeneous application (e.g., content delivery networks, MapReduce, web applications, and the like) workloads having contentious allocation requirements in terms of ICT resource capacities (e.g., network bandwidth, processing speed, response time, etc.). Several recent papers have tried to address the issue of improving energy efficiency in allocating cloud resources to applications with varying degree of success. However, to the best of our knowledge there is no published literature on this subject that clearly articulates the research problem and provides research taxonomy for succinct classification of existing techniques. Hence, the main aim of this paper is to identify open challenges associated with energy efficient resource allocation. In this regard, the study, first, outlines the problem and existing hardware and software-based techniques available for this purpose. Furthermore, available techniques already presented in the literature are summarized based on the energy-efficient research dimension taxonomy. The advantages and disadvantages of the existing techniques are comprehensively analyzed against the proposed research dimension taxonomy namely: resource adaption policy, objective function, allocation method, allocation operation, and interoperability.

  11. Rethinking Reinforcement: Allocation, Induction, and Contingency

    Science.gov (United States)

    Baum, William M.

    2012-01-01

    The concept of reinforcement is at least incomplete and almost certainly incorrect. An alternative way of organizing our understanding of behavior may be built around three concepts: "allocation," "induction," and "correlation." Allocation is the measure of behavior and captures the centrality of choice: All behavior entails choice and consists of…

  12. 15 CFR 336.4 - Allocation.

    Science.gov (United States)

    2010-01-01

    ... 15 Commerce and Foreign Trade 2 2010-01-01 2010-01-01 false Allocation. 336.4 Section 336.4 Commerce and Foreign Trade Regulations Relating to Commerce and Foreign Trade (Continued) INTERNATIONAL... § 336.4 Allocation. (a) The Tariff Rate Quota licenses will be issued to eligible manufacturers on...

  13. 45 CFR 400.13 - Cost allocation.

    Science.gov (United States)

    2010-10-01

    ... 45 Public Welfare 2 2010-10-01 2010-10-01 false Cost allocation. 400.13 Section 400.13 Public Welfare Regulations Relating to Public Welfare OFFICE OF REFUGEE RESETTLEMENT, ADMINISTRATION FOR CHILDREN... for Refugee Resettlement Award of Grants to States § 400.13 Cost allocation. (a) A State must...

  14. 10 CFR 490.503 - Credit allocation.

    Science.gov (United States)

    2010-01-01

    ... 10 Energy 3 2010-01-01 2010-01-01 false Credit allocation. 490.503 Section 490.503 Energy DEPARTMENT OF ENERGY ENERGY CONSERVATION ALTERNATIVE FUEL TRANSPORTATION PROGRAM Alternative Fueled Vehicle Credit Program § 490.503 Credit allocation. (a) Based on annual credit activity report information,...

  15. Evidence on changes in aid allocation criteria

    NARCIS (Netherlands)

    Claessens, S.; Cassimon, D.; Van Campenhout, B.

    2009-01-01

    Have donors changed their aid-allocation criteria over the past three decades toward greater selectivity, a frequently stated goal of the international development community? Using data on how 22 donors allocated their bilateral aid among 147 countries over 1970-2004, the article finds that after th

  16. A novel model on dynamic resource allocation in optical networks

    Institute of Scientific and Technical Information of China (English)

    TANG Yong; RAO Min; LI Lei; CHEN Yu; JIANG Jianfeng; ZHANG Mingde; SUN Xiaohan

    2005-01-01

    A novel model on dynamic resource allocation in the WDM optical networks is proposed, basing on the integrated considerations of the impacts of transmission impairments and service classification on dynamic resource allocation in the optical layer.In this model, the priorities of optical connection requests are mapped into different thresholds of transmission impairments, and a uniform method which is adopted to evaluate the virtual wavelength path (VWP) candidates is defined. The Advanced Preferred Wavelength Sets Algorithm (A-PWS) and the heuristic Dynamic Min-Cost & Optical Virtual Wavelength Path Algorithm (DMC-OVWP) are presented addressing the routing and wavelength assignment (RWA) problem based on dynamic traffic and multi priorities in wavelength-routed optical networks. For a received optical connection request,DMC-OVWP is employed to calculate a list of the VWP candidates, and an appropriate VWP which matches the request's priority is picked up to establish the lightpath by analyzing the transmission qualities of the VWP candidates.

  17. Power Efficient Resource Allocation for Clouds Using Ant Colony Framework

    CERN Document Server

    Chimakurthi, Lskrao

    2011-01-01

    Cloud computing is one of the rapidly improving technologies. It provides scalable resources needed for the ap- plications hosted on it. As cloud-based services become more dynamic, resource provisioning becomes more challenging. The QoS constrained resource allocation problem is considered in this paper, in which customers are willing to host their applications on the provider's cloud with a given SLA requirements for performance such as throughput and response time. Since, the data centers hosting the applications consume huge amounts of energy and cause huge operational costs, solutions that reduce energy consumption as well as operational costs are gaining importance. In this work, we propose an energy efficient mechanism that allocates the cloud resources to the applications without violating the given service level agreements(SLA) using Ant colony framework.

  18. CPU and memory allocation optimization using fuzzy logic

    Science.gov (United States)

    Zalevsky, Zeev; Gur, Eran; Mendlovic, David

    2002-12-01

    The allocation of CPU time and memory resources, are well known problems in organizations with a large number of users, and a single mainframe. Usually the amount of resources given to a single user is based on its own statistics, not on the entire statistics of the organization therefore patterns are not well identified and the allocation system is prodigal. In this work the authors suggest a fuzzy logic based algorithm to optimize the CPU and memory distribution between the users based on the history of the users. The algorithm works separately on heavy users and light users since they have different patterns to be observed. The result is a set of rules, generated by the fuzzy logic inference engine that will allow the system to use its computing ability in an optimized manner. Test results on data taken from the Faculty of Engineering in Tel Aviv University, demonstrate the abilities of the new algorithm.

  19. Adaptive computational resource allocation for sensor networks

    Institute of Scientific and Technical Information of China (English)

    WANG Dian-hong; FEI E; YAN Yu-jie

    2008-01-01

    To efficiently utilize the limited computational resource in real-time sensor networks, this paper focu-ses on the challenge of computational resource allocation in sensor networks and provides a solution with the method of economies. It designs a mieroeconomic system in which the applications distribute their computational resource consumption across sensor networks by virtue of mobile agent. Further, it proposes the market-based computational resource allocation policy named MCRA which satisfies the uniform consumption of computational energy in network and the optimal division of the single computational capacity for multiple tasks. The simula-tion in the scenario of target tracing demonstrates that MCRA realizes an efficient allocation of computational re-sources according to the priority of tasks, achieves the superior allocation performance and equilibrium perform-ance compared to traditional allocation policies, and ultimately prolongs the system lifetime.

  20. Coordination Incentives, Performance Measurement and Resource Allocation in Public Sector Organizations

    DEFF Research Database (Denmark)

    Dietrichson, Jens

    Why are coordination problems common when public sector organizations share responsibilities, and what can be done to mitigate such problems? This paper uses a multi-task principal-agent model to examine two related reasons: the incentives to coordinate resource allocation and the difficulties...

  1. Sample-Path Optimization of Buffer Allocations in a Tandem Queue - Part I : Theoretical Issues

    NARCIS (Netherlands)

    Gürkan, G.; Ozge, A.Y.

    1996-01-01

    This is the first of two papers dealing with the optimal bu er allocation problem in tandem manufacturing lines with unreliable machines.We address the theoretical issues that arise when using sample-path optimization, a simulation-based optimization method, to solve this problem.Sample-path optimiz

  2. Dynamic Channel Allocation in Sectored Cellular Systems

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    It is known that dynamic channel assignment(DCA) strategy outperforms the fixed channel assignment(FCA) strategy in omni-directional antenna cellular systems. One of the most important methods used in DCA was channel borrowing. But with the emergence of cell sectorization and spatial division multiple access(SDMA) which are used to increase the capacity of cellular systems, the channel assignment faces a series of new problems. In this paper, a dynamic channel allocation scheme based on sectored cellular systems is proposed. By introducing intra-cell channel borrowing (borrowing channels from neighboring sectors) and inter-cell channel borrowing (borrowing channels from neighboring cells) methods, previous DCA strategies, including compact pattern based channel borrowing(CPCB) and greedy based dynamic channel assignment(GDCA) schemes proposed by the author, are improved significantly. The computer simulation shows that either intra-cell borrowing scheme or inter-cell borrowing scheme is efficient enough to uniform and non-uniform traffic service distributions.

  3. Validation Effectiveness of Develop Maintainability Allocation on Aircraft Mechanical Components

    Directory of Open Access Journals (Sweden)

    Wan Husain W.M.S.

    2016-01-01

    Full Text Available Maintainability Allocation is a process to identify the allowable maximum task time for each individual component. Consequently, this provides clear pictures to the designers to design and identify potential design improvement within allowable maintenance allocation time limits. During the design process elements such as missteps or misapplications most commonly occur. Here, the authors propose having the maximum target for each individual maintainability component. The main objective of this paper is to present the validation process of developed Maintainability Allocation to potentially eliminate previous problems. The process of validation begins with analysed all the data collected from Service Difficulty Reports (SDR for selected aircraft. This is to understand the problems from existing aircraft before a new design is proposed through the process of Maintainability Allocation prediction. The validation processes have discovered the importance of utilising historical information such as feedback information. The second area is looking at the element of quantifying the data collected from aircraft feedback information which contains various types of information that could be used for future improvement. Validation process shows that feedback information has helped to identify the critical and sensitive components that need more attention for further improvement. The study shows that the aircraft maintenance related feedback information systems analyses were very useful for deciding maintainability effectiveness; these include planning, organising maintenance and design improvement. There is no doubt that feedback information has the ability to contribute an important role in design activities. The results also show that maintainability is an important measure that can be used as a guideline for managing efforts made for the improvement of aircraft components.

  4. 某矿石泊位项目职业病危害预测及关键控制点分析%Forecast of Occupational Hazards and Analysis of Critical Control Points for a Certain Ore Berth Proj ect

    Institute of Scientific and Technical Information of China (English)

    戴雪松; 李焕焕; 周桂侠; 赵杰

    2014-01-01

    采用类比法、检查表法及经验法对拟新建的矿石泊位项目存在的粉尘、化学毒物、噪声等职业病危害因素进行危害预测,找出关键控制点,提出了可行的防护对策。%Hazard forecast for proposed ore berth project is made in terms of existing occupational hazard factors including dusts,chemical toxicants and noises, etc by the use of analogy method, checklist method and empirical method.Critical control points are found out and feasible protective countermeasures are also proposed.

  5. Man-machine Function Allocation Based on Uncertain Linguistic Multiple Attribute Decision Making

    Institute of Scientific and Technical Information of China (English)

    ZHANG An; TANG Zhili; ZHANG Chao

    2011-01-01

    Function allocation is one of the necessary stages in the design course of man-machine systems since appropriate function allocation makes the whole system more effective,reliable and inexpensive.Therefore,our research mainly focuses on the problems of function allocation between man and machine in man-machine systems,analyses each capability advantage of man and machine according to their respective inherent characteristics and makes a comparison between them.In view of highly uncertain characteristics of decision attribute value in the practical process,we introduce the uncertain linguistic multiple attribute decision making (ULMADM) method in the function allocation process.Meanwhile,we also use the uncertain extended weighted arithmetic averaging (UEWAA) method to determine the automation level range of the operator functions.Then,we eventually establish the automation level of man-machine function allocation by using the multi-attribute decision making algorithm,which is combined by UEWAA and uncertain linguistic hybrid aggregation (ULHA) operators.Finally,an example about function allocation is given,that is,fault diagnosis in the cockpit of civil aircraft.The final result of the example demonstrates that the proposed method about function allocation is feasible and effective.

  6. Vehicle Sliding Mode Control with Adaptive Upper Bounds: Static versus Dynamic Allocation to Saturated Tire Forces

    Directory of Open Access Journals (Sweden)

    Ali Tavasoli

    2012-01-01

    Full Text Available Nonlinear vehicle control allocation is achieved through distributing the task of vehicle control among individual tire forces, which are constrained to nonlinear saturation conditions. A high-level sliding mode control with adaptive upper bounds is considered to assess the body yaw moment and lateral force for the vehicle motion. The proposed controller only requires the online adaptation of control gains without acquiring the knowledge of upper bounds on system uncertainties. Static and dynamic control allocation approaches have been formulated to distribute high-level control objectives among the system inputs. For static control allocation, the interior-point method is applied to solve the formulated nonlinear optimization problem. Based on the dynamic control allocation method, a dynamic update law is derived to allocate vehicle control to tire forces. The allocated tire forces are fed into a low-level control module, where the applied torque and active steering angle at each wheel are determined through a slip-ratio controller and an inverse tire model. Computer simulations are used to prove the significant effects of the proposed control allocation methods on improving the stability and handling performance. The advantages and limitations of each method have been discussed, and conclusions have been derived.

  7. Phenotypically flexible sex allocation in a simultaneous hermaphrodite

    NARCIS (Netherlands)

    Brauer, Verena S.; Schaerer, Lukas; Michiels, Nico K.

    2007-01-01

    Previous studies on sex allocation in simultaneous hermaphrodites have typically focused either on evolutionary or one-time, ontogenetic optimization of sex allocation, ignoring variation within an individual's lifetime. Here, we study whether hermaphrodites also possess facultative sex allocation,

  8. Resource allocation in shared spectrum access communications for operators with diverse service requirements

    Science.gov (United States)

    Kibria, Mirza Golam; Villardi, Gabriel Porto; Ishizu, Kentaro; Kojima, Fumihide; Yano, Hiroyuki

    2016-12-01

    In this paper, we study inter-operator spectrum sharing and intra-operator resource allocation in shared spectrum access communication systems and propose efficient dynamic solutions to address both inter-operator and intra-operator resource allocation optimization problems. For inter-operator spectrum sharing, we present two competent approaches, namely the subcarrier gain-based sharing and fragmentation-based sharing, which carry out fair and flexible allocation of the available shareable spectrum among the operators subject to certain well-defined sharing rules, traffic demands, and channel propagation characteristics. The subcarrier gain-based spectrum sharing scheme has been found to be more efficient in terms of achieved throughput. However, the fragmentation-based sharing is more attractive in terms of computational complexity. For intra-operator resource allocation, we consider resource allocation problem with users' dissimilar service requirements, where the operator supports users with delay constraint and non-delay constraint service requirements, simultaneously. This optimization problem is a mixed-integer non-linear programming problem and non-convex, which is computationally very expensive, and the complexity grows exponentially with the number of integer variables. We propose less-complex and efficient suboptimal solution based on formulating exact linearization, linear approximation, and convexification techniques for the non-linear and/or non-convex objective functions and constraints. Extensive simulation performance analysis has been carried out that validates the efficiency of the proposed solution.

  9. A cross-layer resource allocation scheme for spatial multiplexing-based MIMO-OFDMA systems

    Directory of Open Access Journals (Sweden)

    Al-Shatri Hussein

    2011-01-01

    Full Text Available Abstract We investigate the resource allocation problem for the downlink of a multiple-input multiple-output orthogonal frequency division multiple access (MIMO-OFDMA system. The sum rate maximization itself cannot cope with fairness among users. Hence, we address this problem in the context of the utility-based resource allocation presented in earlier papers. This resource allocation method allows to enhance the efficiency and guarantee fairness among users by exploiting multiuser diversity, frequency diversity, as well as time diversity. In this paper, we treat the overall utility as the quality of service indicator and design utility functions with respect to the average transmission rate in order to simultaneously provide two services, real-time and best-effort. Since the optimal solutions are extremely computationally complex to obtain, we propose a suboptimal joint subchannel and power control algorithm that converges very fast and simplifies the MIMO resource allocation problem into a single-input single-output resource allocation problem. Simulation results indicate that using the proposed method achieves near-optimum solutions, and the available resources are distributed more fairly among users.

  10. Resource Allocation for Downlink Multi-Cell OFDMA Cognitive Radio Network Using Hungarian Method

    Directory of Open Access Journals (Sweden)

    N. Forouzan

    2013-12-01

    Full Text Available This paper considers the problem of resource allocation for downlink part of an OFDM-based multi-cell cognitive radio network which consists of multiple secondary transmitters and receivers communicating simultaneously in the presence of multiple primary users. We present a new framework to maximize the total data throughput of secondary users by means of subchannel assignment, while ensuring interference leakage to PUs is below a threshold. In this framework, we first formulate the resource allocation problem as a nonlinear and non-convex optimization problem. Then we represent the problem as a maximum weighted matching in a bipartite graph and propose an iterative algorithm based on Hungarian method to solve it. The present contribution develops an efficient subchannel allocation algorithm that assigns subchannels to the secondary users without the perfect knowledge of fading channel gain between cognitive radio transmitter and primary receivers. The performance of the proposed subcarrier allocation algorithm is compared with a blind subchannel allocation as well as another scheme with the perfect knowledge of channel-state information. Simulation results reveal that a significant performance advantage can still be realized, even if the optimization at the secondary network is based on imperfect network information.

  11. Multi-Robot Dynamic Task Allocation Using Modified Ant Colony System

    Science.gov (United States)

    Xu, Zhenzhen; Xia, Feng; Zhang, Xianchao

    This paper presents a dynamic task allocation algorithm for multiple robots to visit multiple targets. This algorithm is specifically designed for the environment where robots have dissimilar starting and ending locations. And the constraint of balancing the number of targets visited by each robot is considered. More importantly, this paper takes into account the dynamicity of multi-robot system and the obstacles in the environment. This problem is modeled as a constrained MTSP which can not be transformed to TSP and can not be solved by classical Ant Colony System (ACS). The Modified Ant Colony System (MACS) is presented to solve this problem and the unvisited targets are allocated to appropriate robots dynamically. The simulation results show that the output of the proposed algorithm can satisfy the constraints and dynamicity for the problem of multi-robot task allocation.

  12. Dynamic cache resources allocation for energy efficiency

    Institute of Scientific and Technical Information of China (English)

    CHEN Li-ming; ZOU Xue-cheng; LEI Jian-ming; LIU Zheng-lin

    2009-01-01

    This article proposes a mechanism of low overhead and less runtime, termed dynamic cache resources allocation (DCRA), which allocates each application with required cache resources. The mechanism collects cache hit-miss information at runtime and then analyzes the information and decides how many cache resources should be allocated to the current executing application. The amount of cache resources varies dynamically to reduce the total number of misses and energy consumption. The study of several applications from SPEC2000 shows that significant energy saving is achieved for the application based on the DCRA with an average of 39% savings.

  13. Dynamic Allocation of Sugars in Barley

    Science.gov (United States)

    Cumberbatch, L. C.; Crowell, A. S.; Fallin, B. A.; Howell, C. R.; Reid, C. D.; Weisenberger, A. G.; Lee, S. J.; McKisson, J. E.

    2014-03-01

    Allocation of carbon and nitrogen is a key factor for plant productivity. Measurements are carried out by tracing 11C-tagged sugars using positron emission tomography and coincidence counting. We study the mechanisms of carbon allocation and transport from carbohydrate sources (leaves) to sinks (stem, shoot, roots) under various environmental conditions such as soil nutrient levels and atmospheric CO2 concentration. The data are analyzed using a transfer function analysis technique to model transport and allocation in barley plants. The experimental technique will be described and preliminary results presented. This work was supported in part by USDOE Grant No. DE-FG02-97-ER41033 and DE-SC0005057.

  14. Cost Optimization Technique of Task Allocation in Heterogeneous Distributed Computing System

    Directory of Open Access Journals (Sweden)

    Faizul Navi Khan

    2013-11-01

    Full Text Available A Distributed Computing System (DCS is a network of workstations, personal computer and /or other computing systems. Such system may be heterogeneous in the sense that the computing nodes may have different speeds and memory capacities. A DCS accepts tasks from users and executes different modules of these tasks on various nodes of the system. Task allocation in a DCS is a common problem and a good number of task allocation algorithms have been proposed in the literature. In such environment an application runs in a DCS can be accessible on every node present within the DCS. In such cases if number of tasks is less than or equal to available processors in the DCS, we can assign these task without any trouble. But this allocation becomes complicated when numbers of tasks are greater than the numbers of processors. The problem of task allocation for processing of ‘m’ tasks to ‘n’ processors (m>n in a DCS is addressed here through a new modified tasks allocation technique. The model, presented in this paper allocates the tasks to the processor of different processing capacity to increase the performance of the DCS. The technique presented in this paper is based on the consideration of processing cost of the task to the processors. We have tried a new technique to assign all the tasks as per the required availability of processors and their processing capacity so that all the tasks of application get execute in the DCS.

  15. Location-allocation models and new solution methodologies in telecommunication networks

    Science.gov (United States)

    Dinu, S.; Ciucur, V.

    2016-08-01

    When designing a telecommunications network topology, three types of interdependent decisions are combined: location, allocation and routing, which are expressed by the following design considerations: how many interconnection devices - consolidation points/concentrators should be used and where should they be located; how to allocate terminal nodes to concentrators; how should the voice, video or data traffic be routed and what transmission links (capacitated or not) should be built into the network. Including these three components of the decision into a single model generates a problem whose complexity makes it difficult to solve. A first method to address the overall problem is the sequential one, whereby the first step deals with the location-allocation problem and based on this solution the subsequent sub-problem (routing the network traffic) shall be solved. The issue of location and allocation in a telecommunications network, called "The capacitated concentrator location- allocation - CCLA problem" is based on one of the general location models on a network in which clients/demand nodes are the terminals and facilities are the concentrators. Like in a location model, each client node has a demand traffic, which must be served, and the facilities can serve these demands within their capacity limit. In this study, the CCLA problem is modeled as a single-source capacitated location-allocation model whose optimization objective is to determine the minimum network cost consisting of fixed costs for establishing the locations of concentrators, costs for operating concentrators and costs for allocating terminals to concentrators. The problem is known as a difficult combinatorial optimization problem for which powerful algorithms are required. Our approach proposes a Fuzzy Genetic Algorithm combined with a local search procedure to calculate the optimal values of the location and allocation variables. To confirm the efficiency of the proposed algorithm with respect

  16. Power Allocation and Spectrum Sharing in Multi-User, Multi-Channel Systems with Strategic Users

    CERN Document Server

    Kakhbod, Ali

    2010-01-01

    We consider the decentralized power allocation and spectrum sharing problem in multi-user, multi-channel systems with strategic users. We present a mechanism/game form that has the following desirable features. (1) It is individually rational. (2) It is budget balanced at every Nash equilibrium of the game induced by the game form as well as off equilibrium. (3) The allocation corresponding to every Nash equilibrium (NE) of the game induced by the mechanism is a Lindahl allocation, that is a weakly Pareto optimal allocation. Our proposed game form/mechanism achieves all the above desirable properties without any assumption about, concavity, differentiability, monotonicity, or quasi-linearity of the users' utility functions.

  17. Adaptive control and constrained control allocation for overactuated ocean surface vessels

    Science.gov (United States)

    Chen, Mou; Jiang, Bin

    2013-12-01

    In this article, the constrained control allocation is proposed for overactuated ocean surface vessels with parametric uncertainties and unknown external disturbances. The constrained control allocation is transformed into a convex quadratic programming problem and a recurrent neural network is employed to solve it. To complete the control allocation, the control command is derived via the backstepping method. Adaptive tracking control is proposed for the full-state feedback case using the backstepping technique and the Lyapunov synthesis. It is proved that the proposed adaptive tracking control is able to guarantee semi-global uniform ultimate boundedness of all signals in the closed-loop system. Then, the obtained control command is distributed to each actuator of overactuated ocean vessels. Finally, simulation studies are presented to illustrate the effectiveness of the proposed adaptive tracking control and the constrained control allocation scheme.

  18. On optimal allocation in binary response trials; is adaptive design really necessary?

    CERN Document Server

    Azriel, David; Rinott, Yosef

    2011-01-01

    We consider the classical problem of selecting the best of two treatments in clinical trials with binary response. The target is to find the design that maximizes the power of the relevant test. Many papers use a normal approximation to the power function and claim that \\textit{Neyman allocation} that assigns subjects to treatment groups according to the ratio of the responses' standard deviations, should be used. As the standard deviations are unknown, an adaptive design is often recommended. The asymptotic justification of this approach is arguable, since it uses the normal approximation in tails where the error in the approximation is larger than the estimated quantity. We consider two different approaches for optimality of designs that are related to Pitman and Bahadur definitions of relative efficiency of tests. We prove that the optimal allocation according to the Pitman criterion is the balanced allocation and that the optimal allocation according to the Bahadur approach depends on the unknown paramete...

  19. Adaptive Neural Network Control with Control Allocation for A Manned Submersible in Deep Sea

    Institute of Scientific and Technical Information of China (English)

    YU Jian-cheng; ZHANG Ai-qun; WANG Xiao-hui; WU Bao-ju

    2007-01-01

    This paper thoroughly studies a control system with control allocation for a manned submersible in deep sea being developed in China. The proposed control system consists of a neural-network-based direct adaptive controller and a dynamic control allocation module. A control energy cost function is used as the optimization criteria of the control allocation module, and weighted pseudo-inverse is used to find the solution of the control allocation problem. In the presence of bounded unknown disturbance and neural networks approximation error, stability of the closed-loop control system of manned submersible is proved with Lyaponov theory. The feasibility and validity of the proposed control system is further verified through experiments conducted on a semi-physical simulation platform for the manned submersible in deep sea.

  20. [Optimal allocation of irrigation water resources based on systematical strategy].

    Science.gov (United States)

    Cheng, Shuai; Zhang, Shu-qing

    2015-01-01

    With the development of the society and economy, as well as the rapid increase of population, more and more water is needed by human, which intensified the shortage of water resources. The scarcity of water resources and growing competition of water in different water use sectors reduce water availability for irrigation, so it is significant to plan and manage irrigation water resources scientifically and reasonably for improving water use efficiency (WUE) and ensuring food security. Many investigations indicate that WUE can be increased by optimization of water use. However, present studies focused primarily on a particular aspect or scale, which lack systematic analysis on the problem of irrigation water allocation. By summarizing previous related studies, especially those based on intelligent algorithms, this article proposed a multi-level, multi-scale framework for allocating irrigation water, and illustrated the basic theory of each component of the framework. Systematical strategy of optimal irrigation water allocation can not only control the total volume of irrigation water on the time scale, but also reduce water loss on the spatial scale. It could provide scientific basis and technical support for improving the irrigation water management level and ensuring the food security.

  1. Practical Approaches to Adaptive Resource Allocation in OFDM Systems

    Directory of Open Access Journals (Sweden)

    N. Y. Ermolova

    2007-11-01

    Full Text Available Whenever a communication system operates in a time-frequency dispersive radio channel, the link adaptation provides a benefit in terms of any system performance metric by employing time, frequency, and, in case of multiple users, multiuser diversities. With respect to an orthogonal frequency division multiplexing (OFDM system, link adaptation includes bit, power, and subcarrier allocations. While the well-known water-filling principle provides the optimal solution for both margin-maximization and rate-maximization problems, implementation complexity often makes difficult its application in practical systems. This paper presents a few suboptimal (low-complexity adaptive loading algorithms for both single- and multiuser OFDM systems. We show that the single-user system performance can be improved by suitable power loading and an algorithm based on the incomplete channel state information is derived. At the same time, the power loading in a multiuser system only slightly affects performance while the initial subcarrier allocation has a rather big impact. A number of subcarrier allocation algorithms are discussed and the best one is derived on the basis of the order statistics theory.

  2. FORUM: Bilateral Monopoly: A Market for Intercountry River Water Allocation

    Science.gov (United States)

    Lekakis

    1998-01-01

    / Collaboration of countries with an aim to share fresh surface water resources promises to generate potential joint benefits. Unfortunately, existing agreements lack the perspective and capacity to produce any real action in efficient cross-border water allocation. When that problem is encountered by any two adjacent countries claiming riparian rights to the same watercourse, this paper suggests that apossible solution to be examined is a water market. This market requires the relevant countries to engage in a bargaining process as described in the theory of bilateral monopoly. The bargaining process should determine both the water quantity to be transferred and the price to be paid. However, there has to be a fair allocation of the joint benefits resulting from the transfer for a sustainable price solution. As an empirical illustration, the paper examines the case of river Nestos shared by Bulgaria and Greece in the southern Balkans. A net revenue function quadratic in water is specified and estimated using scarce data on three agricultural crops in Greece. Sensitivity analysis on the size and distribution of the net benefits is also performed.KEY WORDS: Bilateral agreements; Water markets; Efficient allocation

  3. Practical Approaches to Adaptive Resource Allocation in OFDM Systems

    Directory of Open Access Journals (Sweden)

    Ermolova NY

    2008-01-01

    Full Text Available Abstract Whenever a communication system operates in a time-frequency dispersive radio channel, the link adaptation provides a benefit in terms of any system performance metric by employing time, frequency, and, in case of multiple users, multiuser diversities. With respect to an orthogonal frequency division multiplexing (OFDM system, link adaptation includes bit, power, and subcarrier allocations. While the well-known water-filling principle provides the optimal solution for both margin-maximization and rate-maximization problems, implementation complexity often makes difficult its application in practical systems. This paper presents a few suboptimal (low-complexity adaptive loading algorithms for both single- and multiuser OFDM systems. We show that the single-user system performance can be improved by suitable power loading and an algorithm based on the incomplete channel state information is derived. At the same time, the power loading in a multiuser system only slightly affects performance while the initial subcarrier allocation has a rather big impact. A number of subcarrier allocation algorithms are discussed and the best one is derived on the basis of the order statistics theory.

  4. Optimal Energy Allocation for Wireless Communications with Energy Harvesting Constraints

    CERN Document Server

    Ho, Chin Keong

    2011-01-01

    We consider the use of energy harvesters, in place of conventional batteries with fixed energy storage, for point-to-point wireless communications. In addition to the challenge of transmitting in a channel with time selective fading, energy harvesters provide a perpetual but unreliable energy source. In this paper, we consider the problem of energy allocation over a finite horizon, taking into account channel conditions and energy sources that are time varying, so as to maximize the throughput. Two types of side information (SI) on the channel conditions and harvested energy are assumed to be available: causal SI (of the past and present slots) and full SI (of the past, present and future slots). We obtain structural results for the optimal energy allocation, via the use of dynamic programming and convex optimization techniques. In particular, if unlimited energy can be stored in the battery with harvested energy and full SI is available, we prove the optimality of a water-filling energy allocation solution w...

  5. Worst-case analysis of heap allocations

    DEFF Research Database (Denmark)

    Puffitsch, Wolfgang; Huber, Benedikt; Schoeberl, Martin

    2010-01-01

    In object oriented languages, dynamic memory allocation is a fundamental concept. When using such a language in hard real-time systems, it becomes important to bound both the worst-case execution time and the worst-case memory consumption. In this paper, we present an analysis to determine...... the worst-case heap allocations of tasks. The analysis builds upon techniques that are well established for worst-case execution time analysis. The difference is that the cost function is not the execution time of instructions in clock cycles, but the allocation in bytes. In contrast to worst-case execution...... time analysis, worst-case heap allocation analysis is not processor dependent. However, the cost function depends on the object layout of the runtime system. The analysis is evaluated with several real-time benchmarks to establish the usefulness of the analysis, and to compare the memory consumption...

  6. A Novel Register Allocation Algorithm for Testability

    Institute of Scientific and Technical Information of China (English)

    SUN Qiang; ZHOU Tao; LI Haijun

    2007-01-01

    In the course of high-level synthesis of integrate circuit, the hard-to-test structure caused by irrational schedule and allocation reduces the testability of circuit. In order to improve the circuit testability, this paper proposes a weighted compatibility graph (WCG), which provides a weighted formula of compatibility graph based on register allocation for testability and uses improved weighted compatibility clique partition algorithm to deal with this WCG. As a result, four rules for testability are considered simultaneously in the course of register allocation so that the objective of improving the design of testability is acquired. Tested by many experimental results of benchmarks and compared with many other models, the register allocation algorithm proposed in this paper has greatly improved the circuit testability with little overhead on the final circuit area.

  7. CDC Allocates $184 Million for Zika Protection

    Science.gov (United States)

    ... fullstory_162694.html CDC Allocates $184 Million for Zika Protection Funds are earmarked for states, territories, local ... million has been earmarked to protect Americans against Zika virus infection, the U.S. Centers for Disease Control ...

  8. Multi-criteria power and energy shortage allocation in power systems

    Energy Technology Data Exchange (ETDEWEB)

    Eke, Petr Ya.; Popov, Vladimir A.; Junges, Marcio F.D.; Moraes, Marcos A. de [Santa Maria Univ., RS (Brazil). Programa de Pos-graduacao em Engenharia Eletrica; Prakhovnik, Arthur V.; Razumovsky, Oleg V. [National Technichal Univ. (KPI), Kiev (Ukraine).Research Inst. of Automation and Energetics

    1997-12-31

    The problems of power and energy shortage (natural or associated with the efficiency of load management) allocation are formulated as multi criteria optimization problems to consider and to minimize diverse negative consequences of limiting consumers. Their solution is based on the Bellman-Zadeh approach to decision making in a fuzzy environment. The advantages and capacities opened by its application are discussed. The results realized as an adaptive interactive decision making system which can be used in allocating diverse types of resources or their shortages. (author) 19 refs., 3 tabs.; e-mail: ekel at super.ufsm.br

  9. Fairness based resource allocation for multiuser MISO-OFDMA systems with beamforming

    Institute of Scientific and Technical Information of China (English)

    SUN Kai; WANG Ying; CHEN Zi-xiong; ZHANG Ping

    2009-01-01

    Resource allocation problem in multiuser multiple input single output-orthogonal frequency division multiple access (MISO-OFDMA) systems with downlink beamforming for frequency selective fading channels is studied. The article aims at maximizing system throughput with the constraints of total power and bit error rate (BER) while supporting fairness among users. The downlink proportional fairness (PF) scheduling problem is reformulated as a maximization of the sum of logarithmic user data rate. From necessary conditions on optimality obtained analytically by Karush-Kuhn-Tucker (KKT) condition, an efficient user selection and resource allocation algorithm is proposed. The computer simulations reveal that the proposed algorithm achieves tradeoff between system throughput and fairness among users.

  10. Priority-based Resource Allocation for RT and NRT Traffics in OFDMA Systems

    DEFF Research Database (Denmark)

    Wang, Hua

    2007-01-01

    In this paper, we address the problem of adaptive radio resource allocation and QoS provisioning for real-time (RT) and non-real-time (NRT) services in OFDMA systems. The proposed algorithm tightly couples the subchannel allocation and packet scheduling together through an integrated cross......-layer approach in which each packet is assigned a priority value by taking both the instantaneous channel condition and the QoS requirements into account. An efficient suboptimal algorithm with low computational complexity is proposed to solve the linear optimization problem. Simulation results show...

  11. [High-cost therapy. Ethical principles of allocation of scarce resources].

    Science.gov (United States)

    Norheim, O F

    1992-10-10

    This article raises some ethical problems concerning high-cost therapy for malignant haematological diseases. The problem of setting priorities is discussed within the framework of utilitarianism, right-based theories and the contractarian theory of John Rawls. It is argued that utilitarianism can provide precise answers, based on the principle of allocative efficiency. However, this is not the only objective of a public health care system. The right-based approach is discussed, but sufficiently precise definitions seem hard to formulate. The contractarian approach is regarded as interesting, since it tries to address the question of trade-offs between objectives of allocative efficiency and distributive fairness.

  12. A woman's place: household labour allocation in rural Kenya.

    Science.gov (United States)

    Neitzert, M

    1994-01-01

    This article synthesizes the literature on household labor allocation. The review reveals that development policies impacting on the labor market favor men over women. Male favoritism also occurs in household decision-making. Data from the 1988 Rural Labor Force Survey were used to examine rural household labor allocation in 1988 and the extent of female and male participation in home and market production and the degree of labor market discrimination against women. It is argued that the standard neoclassical model of economics does not recognize the unequal bargaining power of each member of the household in arriving at a solution to the joint welfare maximization problem. Women's position is expected to worsen during economic development. Women will have less than full participation in the labor market. Women's distinct role in household welfare provision is often disregarded. Development policy mainly focuses on market activities where women hold few positions. Labor allocation in the empirical analysis pertains to the mean hours per week in farm activities, household activities, schooling, and paid or unpaid non-farm work. Findings indicate that average earnings were lower for females than males and that returns to education and training were higher for males than females. Wage discrimination accounted for 30-66% of the earnings gap between rural men and women. Women faced discrimination on their returns to human capital and occupational choices. The concentration of women in low-paying jobs accounted for 21% of the wage gap. Women's lower education accounted for over 10%. Findings suggest that Kenyan households respond to market incentives. Women worked longer hours than men and contributed more to household welfare. Policy should focus on models of household provisioning and not on a joint utility function. Policy should encourage households to revise labor allocation strategies.

  13. Allocative Efficiency of Technically Inefficient Production Units

    OpenAIRE

    Bogetoft, Peter; Fare, Rolf

    1999-01-01

    We discuss how to measure allocative efficiency without presuming technical efficiency. This is relevant when it is easier to introduce reallocations than improvements of technical efficiency. We compare the approach to the traditional one of assuming technical efficiency before measuring allocative efficiency. In particular, we develop necessary and sufficient conditions on the technology to ensure consistent measures and we give dual organizational interpretations of the approaches.

  14. Efficient Algorithms for Renewable Energy Allocation to Delay Tolerant Consumers

    CERN Document Server

    Neely, Michael J; Dimakis, Alexandros G

    2010-01-01

    We investigate the problem of allocating energy from renewable sources to flexible consumers in electricity markets. We assume there is a renewable energy supplier that provides energy according to a time-varying (and possibly unpredictable) supply process. The plant must serve consumers within a specified delay window, and incurs a cost of drawing energy from other (possibly non-renewable) sources if its own supply is not sufficient to meet the deadlines. We formulate two stochastic optimization problems: The first seeks to minimize the time average cost of using the other sources (and hence strives for the most efficient utilization of the renewable source). The second allows the renewable source to dynamically set a price for its service, and seeks to maximize the resulting time average profit. These problems are solved via the Lyapunov optimization technique. Our resulting algorithms do not require knowledge of the statistics of the time-varying supply and demand processes and are robust to arbitrary samp...

  15. Optimal Resource Allocation for Network Protection: A Geometric Programming Approach

    CERN Document Server

    Preciado, Victor M; Enyioha, Chinwendu; Jadbabaie, Ali; Pappas, George

    2013-01-01

    We study the problem of containing spreading processes in arbitrary directed networks by distributing protection resources throughout the nodes of the network. We consider two types of protection resources are available: (i) Preventive resources able to defend nodes against the spreading (such as vaccines in a viral infection process), and (ii) corrective resources able to neutralize the spreading after it has reached a node (such as antidotes). We assume that both preventive and corrective resources have an associated cost and study the problem of finding the cost-optimal distribution of resources throughout the nodes of the network. We analyze these questions in the context of viral spreading processes in directed networks. We study the following two problems: (i) Given a fixed budget, find the optimal allocation of preventive and corrective resources in the network to achieve the highest level of containment, and (ii) when a budget is not specified, find the minimum budget required to control the spreading...

  16. Life-cycle asset allocation with focus on retirement savings

    DEFF Research Database (Denmark)

    Konicz, Agnieszka Karolina

    costs, taxes, and uncertain labor income. The problem is solved using a combination of a multi-stage stochastic linear programming (SLP) model and stochastic optimal control, such that the practical application is emphasized. Both solutions are integrated into the SLP formulation. The decisions......We consider optimal asset allocation of a pension saver with uncertain lifetime. The objective is to maximize the expected utility of the retirement savings. The model accounts for characteristics of a pension saver given by her mortality risk, risk attitude, type of retirement contract, trading...

  17. Affirmative action and the allocation of health care.

    Science.gov (United States)

    Francis, L P

    1999-09-01

    The justifications of affirmative action, the compensatory, corrective and redistributive, have been widely recognized in legal thinking. They have been applied, principally, to employment practices. They can also be applied to health care. Arguments for affirmative action in health care allocation shift the burden of proof to those who deny that racism is the root cause of differential morbidity and mortality experienced by, for example, African Americans. At the very least, these arguments mandate much needed research into the causes of minorities' poor health. Without such research, racism remains the presumptive cause of, and affirmative action the appropriate remedy for, the health care problems minorities face.

  18. A study of multiagent systems for resource allocation

    Science.gov (United States)

    Liu, Haixiao; Shao, Zhichao; Li, Shanfei; Tan, Xianglin

    2017-03-01

    The agent and multiagent system is one of the most active methods for solving complicated problems as to resource allocation recently. Here, an agent can be considered as a computer program who takes autonomous actions to obtain some units of resources for individual purposes and common goals. The environment can be referred to the place where scattered resources and agent behavior-restricted rules are stored. And a multiagent system is a type of computing system built upon multiple situated agents who interact with each other under mechanisms. This paper aims to overview the techniques regarding agents and the environment.

  19. THE EFFECTIVENESS OF BUDGET ALLOCATION IN PUBLIC PROCUREMENT

    Directory of Open Access Journals (Sweden)

    Irina Yu. Fedorova

    2015-01-01

    Full Text Available This article deals with the problem of budget allocation in the state order inRussia. Assesses the effectiveness of the financial mechanism of the public procurement business entities, purchasing activities are regulated by Federal Law №44-FZ and №223-FZ. The dynamics of financing the procurement process and reveal its features by using the most common methods of procurement through competitive bidding and without bidding. Identifies the causes of inefficient spending budget as a result of the non-competitive procurement methods by certain categories of business entities. 

  20. Revenue Allocation and Economic Development in Nigeria

    Directory of Open Access Journals (Sweden)

    Dagwom Yohanna Dang

    2013-09-01

    Full Text Available This study empirically examines the impact of revenue allocation on economic development in Nigeria. Specifically, the study looks at how the various revenue allocations to the three tiers of government affect real gross domestic product (RGDP in Nigeria using time series data for the period 1993 to 2012. Error correction model (ECM and Pairwise Granger Causality test are used in analyzing the data. The study carries out test of stationarity of the variables using Augmented Dickey–Fuller unit root test and test of long-run relationship among the variables using Johansen Cointegration test. The study’s findings show that revenue allocations have significant causal relationship with economic development in Nigeria, with only revenue allocation to states having significant negative relationship. Unidirectional causality runs from revenue allocations to real GDP in Nigeria. All variables of the study are cointegrated and have a long-run relationship that 87.62% of the short-run disequilibrium is corrected yearly. The study recommends among others that more financial control and value for money audit should be carried out to minimize wastages and corruption in the states of the federation, so as to change the direction of influence of states’ revenue allocation on economic development.

  1. Simulated Annealing Algorithm Combined with Chaos for Task Allocation in Real-Time Distributed Systems

    OpenAIRE

    Wenbo Wu; Jiahong Liang; Xinyu Yao; Baohong Liu

    2014-01-01

    This paper addresses the problem of task allocation in real-time distributed systems with the goal of maximizing the system reliability, which has been shown to be NP-hard. We take account of the deadline constraint to formulate this problem and then propose an algorithm called chaotic adaptive simulated annealing (XASA) to solve the problem. Firstly, XASA begins with chaotic optimization which takes a chaotic walk in the solution space and generates several local minima; secondly XASA improv...

  2. RESSOURCES ALLOCATION POSSIBILITIES WITHIN HEALTH SERVICES

    Directory of Open Access Journals (Sweden)

    Manea Liliana

    2011-12-01

    Full Text Available The state policy in the health care area must take into account the complexity and specificity of the domain. Health means not only “to treat”, but also “to prevent” and “to recover and rehabilitate the individual physically”. Regardless of the adopted health insurance system, the health system is facing a big problem and this is the insufficient funds necessary to function properly. The underfunding may have various causes, from a wrong health policy, based on “treating” instead of “preventing”, by the misuse of funds. This papers intended to formulate assumptions that underpin the research I am conducting within the Doctoral Research Program held at the Valahia University of Targoviste, which aims at using the management control in increasing the health services performance. The application of the accounting and management control methods in determining health costs can be a beginning to streamline the system. This is also a result of the fact that health care is a public service with specific characteristics: it can not be subject only to market requirements but at the same time he must undergo an administrative savings, representing a typical case of market failure. The increased cost of treatment, as well as the decline in their quality can be determined by the discrepancy between the funding and payment mechanisms. Different payment systems currently available do nothing but perpetuate the shortcomings in the system. Switching to the introduction of cost and budgets by cost centers or object (if solved can be a step forward for a better management of resources. In this context, we consider as a necessity to be imposed the cost analysis on responsibility centers, the definition of the cost object and cost center identification and determination of direct costs and those indirect services to choose the basis for the allocation of cost centers and the determination of each actual cost per diagnosis.

  3. An Enhanced OFDM Resource Allocation Algorithm in C-RAN Based 5G Public Safety Network

    Directory of Open Access Journals (Sweden)

    Lei Feng

    2016-01-01

    Full Text Available Public Safety Network (PSN is the network for critical communication when disaster occurs. As a key technology in 5G, Cloud-Radio Access Network (C-RAN can play an important role in PSN instead of LTE-based RAN. This paper firstly introduces C-RAN based PSN architecture and models the OFDM resource allocation problem in C-RAN based PSN as an integer quadratic programming, which allows the trade-off between expected bitrates and allocating fairness of PSN Service User (PSU. However, C-RAN based PSN needs to improve the efficiency of allocating algorithm because of a mass of PSU-RRH associations when disaster occurs. To deal with it, the resources allocating problem with integer variables is relaxed into one with continuous variables in the first step and an algorithm based on Generalized Bender’s Decomposition (GBD is proposed to solve it. Then we use Feasible Pump (FP method to get a feasible integer solution on the original OFDM resources allocation problem. The final experiments show the total throughput achieved by C-RAN based PSN is at most higher by 19.17% than the LTE-based one. And the average computational time of the proposed GBD and FP algorithm is at most lower than Barrier by 51.5% and GBD with no relaxation by 30.1%, respectively.

  4. Optimization of Joint Power and Bandwidth Allocation in Multi-Spot-Beam Satellite Communication Systems

    Directory of Open Access Journals (Sweden)

    Heng Wang

    2014-01-01

    Full Text Available Multi-spot-beam technique has been widely applied in modern satellite communication systems. However, the satellite power and bandwidth resources in a multi-spot-beam satellite communication system are scarce and expensive; it is urgent to utilize the resources efficiently. To this end, dynamically allocating the power and bandwidth is an available way. This paper initially formulates the problem of resource joint allocation as a convex optimization problem, taking into account a compromise between the maximum total system capacity and the fairness among the spot beams. A joint bandwidth and power allocation iterative algorithm based on duality theory is then proposed to obtain the optimal solution of this optimization problem. Compared with the existing separate bandwidth or power optimal allocation algorithms, it is shown that the joint allocation algorithm improves both the total system capacity and the fairness among spot beams. Moreover, it is easy to be implemented in practice, as the computational complexity of the proposed algorithm is linear with the number of spot beams.

  5. Estimation of distribution algorithm for resource allocation in green cooperative cognitive radio sensor networks.

    Science.gov (United States)

    Naeem, Muhammad; Pareek, Udit; Lee, Daniel C; Anpalagan, Alagan

    2013-04-12

    Due to the rapid increase in the usage and demand of wireless sensor networks (WSN), the limited frequency spectrum available for WSN applications will be extremely crowded in the near future. More sensor devices also mean more recharging/replacement of batteries, which will cause significant impact on the global carbon footprint. In this paper, we propose a relay-assisted cognitive radio sensor network (CRSN) that allocates communication resources in an environmentally friendly manner. We use shared band amplify and forward relaying for cooperative communication in the proposed CRSN. We present a multi-objective optimization architecture for resource allocation in a green cooperative cognitive radio sensor network (GC-CRSN). The proposed multi-objective framework jointly performs relay assignment and power allocation in GC-CRSN, while optimizing two conflicting objectives. The first objective is to maximize the total throughput, and the second objective is to minimize the total transmission power of CRSN. The proposed relay assignment and power allocation problem is a non-convex mixed-integer non-linear optimization problem (NC-MINLP), which is generally non-deterministic polynomial-time (NP)-hard. We introduce a hybrid heuristic algorithm for this problem. The hybrid heuristic includes an estimation-of-distribution algorithm (EDA) for performing power allocation and iterative greedy schemes for constraint satisfaction and relay assignment. We analyze the throughput and power consumption tradeoff in GC-CRSN. A detailed analysis of the performance of the proposed algorithm is presented with the simulation results.

  6. The Use of Different Rules to Allocate Reward and Punishment.

    Science.gov (United States)

    Mueller, Charles W.

    Much research has been conducted about how and when individuals allocate rewards, yet little research exists concerning the allocation of punishment. The process of allocating negative outcomes may be different from the decision making process for positive outcomes. To examine the decision making process for allocating rewards and punishment,…

  7. 18 CFR 367.28 - Methods of allocation.

    Science.gov (United States)

    2010-04-01

    ... 18 Conservation of Power and Water Resources 1 2010-04-01 2010-04-01 false Methods of allocation... Instructions § 367.28 Methods of allocation. Indirect costs and compensation for use of capital must be... allocation. Both direct and allocated indirect costs on projects must be assigned among those companies...

  8. 7 CFR 761.205 - Computing the formula allocation.

    Science.gov (United States)

    2010-01-01

    ... 7 Agriculture 7 2010-01-01 2010-01-01 false Computing the formula allocation. 761.205 Section 761..., DEPARTMENT OF AGRICULTURE SPECIAL PROGRAMS GENERAL PROGRAM ADMINISTRATION Allocation of Farm Loan Programs Funds to State Offices § 761.205 Computing the formula allocation. (a) The formula allocation for FO...

  9. 26 CFR 1.514(e)-1 - Allocation rules.

    Science.gov (United States)

    2010-04-01

    ... 26 Internal Revenue 7 2010-04-01 2010-04-01 true Allocation rules. 1.514(e)-1 Section 1.514(e)-1... Allocation rules. Where only a portion of property is debt-financed property, proper allocation of the basis...)(iii) of § 1.514(b)-1 for illustrations of proper allocation....

  10. 24 CFR 791.404 - Field Office allocation planning.

    Science.gov (United States)

    2010-04-01

    ... 24 Housing and Urban Development 4 2010-04-01 2010-04-01 false Field Office allocation planning... Allocation of Budget Authority for Housing Assistance § 791.404 Field Office allocation planning. (a) General objective. The allocation planning process should provide for the equitable distribution of available...

  11. 47 CFR 64.903 - Cost allocation manuals.

    Science.gov (United States)

    2010-10-01

    ... 47 Telecommunication 3 2010-10-01 2010-10-01 false Cost allocation manuals. 64.903 Section 64.903... RULES RELATING TO COMMON CARRIERS Allocation of Costs § 64.903 Cost allocation manuals. (a) Each... mid-sized incumbent local exchange carriers is required to file a cost allocation manual...

  12. 20 CFR 633.105 - Allocation of funds.

    Science.gov (United States)

    2010-04-01

    ... invitation to submit applications for State(s) or area(s) open for competition as provided in the... units of government, or public agencies. (b) State allocations (allocable funds). (1) No less than 94... funds for use in a State whose allocation is less than $120,000. (ii) Those funds not allocated will...

  13. Joint Uplink Resource Allocation Algorithm with Proportional-Fair in Heterogeneous Wireless Networks

    Directory of Open Access Journals (Sweden)

    Juan Fan

    2013-10-01

    Full Text Available In this paper, we exploit the uplink radio resource allocation considering proportional fairness among users in heterogeneous wireless networks. Meanwhile, multi-mode user terminals are assumed to have the capability of using multiple radio access technologies simultaneously. To this end, a joint optimization problem is formulated for power and bandwidth allocation for uplink transmission. Since the formulated primal problem is difficult to solve directly, we make continuous relaxation and obtain a near-optimal solution using Karush-Kuhn-Tucker conditions, and then propose a joint resource allocation algorithm. Simulation results show the proposed algorithm work, and the algorithm provides superior system throughput and much better fairness among users comparing to a heuristic algorithm

  14. The vehicle routing game: An application of cost allocation in a gas and oil company

    Energy Technology Data Exchange (ETDEWEB)

    Engevall, Stefan; Goethe-Lundgren, Maud; Vaerbrand, Peter

    2000-12-01

    In this article we study a cost allocation problem that arises in a distribution planning situation at the Logistics department at Norsk Hydro Olje AB. The routes from one depot during one day are considered, for which the total distribution cost is to be divided among the customers that are visited. This cost allocation problem is formulated as a vehicle routing game, allowing the use of vehicles with different capacities. Cost allocation methods based on different concepts from cooperative game theory, such as the core and the nucleolus, are discussed. A procedure that can be used to investigate whether the core is empty or not is presented, as well as a procedure to compute the nucleolus. Computational results for the Norsk Hydro case are also presented and discussed.

  15. Distributive Stochastic Learning for Delay-Optimal OFDMA Power and Subband Allocation

    CERN Document Server

    Cui, Ying

    2010-01-01

    In this paper, we consider the distributive queue-aware power and subband allocation design for a delay-optimal OFDMA uplink system with one base station, $K$ users and $N_F$ independent subbands. Each mobile has an uplink queue with heterogeneous packet arrivals and delay requirements. We model the problem as an infinite horizon average reward Markov Decision Problem (MDP) where the control actions are functions of the instantaneous Channel State Information (CSI) as well as the joint Queue State Information (QSI). To address the distributive requirement and the issue of exponential memory requirement and computational complexity, we approximate the subband allocation Q-factor by the sum of the per-user subband allocation Q-factor and derive a distributive online stochastic learning algorithm to estimate the per-user Q-factor and the Lagrange multipliers (LM) simultaneously and determine the control actions using an auction mechanism. We show that under the proposed auction mechanism, the distributive online...

  16. An ethics framework for assisting clinician-managers in resource allocation decision making.

    Science.gov (United States)

    Meslin, E M; Lemieux-Charles, L; Wortley, J T

    1997-01-01

    In response to continued pressure on the Canadian healthcare system, hospitals are implementing structural changes to address issues of cost containment, utilization, and resource allocation. One strategy has been to decentralize managerial decision making to clinicians, creating "clinician-managers" (CMs). We surveyed 3,000 hospital-based CMs in Ontario, Canada (including physicians, nurses, and other health professionals), in order to understand the nature and frequency of the ethical issues they face as a consequence of their involvement in resource allocation decisions, and to identify mechanisms for dealing with these problems in their hospitals. Based on the survey results, we developed a Management Ethics Framework to assist CMs to reach an ethically justifiable resolution of these types of problems, both individually, and in the context of their membership in the healthcare team. The results, and particularly the discussion that follows, represent a confluence of philosophical, clinical, and organizational perspective on ethics and resource allocation by clinicians.

  17. An improved model for the oPtImal Measurement Probes Allocation tool

    Energy Technology Data Exchange (ETDEWEB)

    Sterle, C., E-mail: claudio.sterle@unina.it [Consorzio CREATE/Dipartimento di Ingegneria Elettrica e delle Tecnologie dell’Informazione, Università degli Studi di Napoli Federico II, Via Claudio 21, 80125 Napoli (Italy); Neto, A.C. [Fusion for Energy, 08019 Barcelona (Spain); De Tommasi, G. [Consorzio CREATE/Dipartimento di Ingegneria Elettrica e delle Tecnologie dell’Informazione, Università degli Studi di Napoli Federico II, Via Claudio 21, 80125 Napoli (Italy)

    2015-10-15

    Highlights: • The problem of optimally allocating the probes of a diagnostic system is tackled. • The problem is decomposed in two consecutive optimization problems. • Two original ILP models are proposed and sequentially solved to optimality. • The proposed ILP models improve and extend the previous work present in literature. • Real size instances have been optimally solved with very low computation time. - Abstract: The oPtImal Measurement Probes Allocation (PIMPA) tool has been recently proposed in [1] to maximize the reliability of a tokamak diagnostic system against the failure of one or more of the processing nodes. PIMPA is based on the solution of integer linear programming (ILP) problems, and it minimizes the effect of the failure of a data acquisition component. The first formulation of the PIMPA model did not support the concept of individual slots. This work presents an improved ILP model that addresses the above mentioned problem, by taking into account all the individual probes.

  18. Eliminating bias in randomized controlled trials: importance of allocation concealment and masking.

    Science.gov (United States)

    Viera, Anthony J; Bangdiwala, Shrikant I

    2007-02-01

    Randomization in randomized controlled trials involves more than generation of a random sequence by which to assign subjects. For randomization to be successfully implemented, the randomization sequence must be adequately protected (concealed) so that investigators, involved health care providers, and subjects are not aware of the upcoming assignment. The absence of adequate allocation concealment can lead to selection bias, one of the very problems that randomization was supposed to eliminate. Authors of reports of randomized trials should provide enough details on how allocation concealment was achieved so the reader can determine the likelihood of success. Fortunately, a plan of allocation concealment can always be incorporated into the design of a randomized trial. Certain methods minimize the risk of concealment failing more than others. Keeping knowledge of subjects' assignment after allocation from subjects, investigators/health care providers, or those assessing outcomes is referred to as masking (also known as blinding). The goal of masking is to prevent ascertainment bias. In contrast to allocation concealment, masking cannot always be incorporated into a randomized controlled trial. Both allocation concealment and masking add to the elimination of bias in randomized controlled trials.

  19. Current Subcounty Allocation Practices: Volume I of the Title I, ESEA, Subcounty Allocation Study.

    Science.gov (United States)

    Paller, Alan T.; Gutmann, Babette

    In this report, subcounty allocation of Title I of the Elementary and Secondary Education Act (ESEA) funds is described in terms of direct allocation, use of the statutory formula emphasizing census data, United States Office of Education (USOE) regulations, participating states, geographic and administrative overlaps, hold harmless adjustments…

  20. An Analysis and Allocation System for Library Collections Budgets: The Comprehensive Allocation Process (CAP)

    Science.gov (United States)

    Lyons, Lucy Eleonore; Blosser, John

    2012-01-01

    The "Comprehensive Allocation Process" (CAP) is a reproducible decision-making structure for the allocation of new collections funds, for the reallocation of funds within stagnant budgets, and for budget cuts in the face of reduced funding levels. This system was designed to overcome common shortcomings of current methods. Its philosophical…

  1. Healthcare resource allocation decisions affecting uninsured services

    Science.gov (United States)

    Harrison, Krista Lyn; Taylor, Holly A.

    2017-01-01

    Purpose Using the example of community access programs (CAPs), the purpose of this paper is to describe resource allocation and policy decisions related to providing health services for the uninsured in the USA and the organizational values affecting these decisions. Design/methodology/approach The study used comparative case study methodology at two geographically diverse sites. Researchers collected data from program documents, meeting observations, and interviews with program stakeholders. Findings Five resource allocation or policy decisions relevant to providing healthcare services were described at each site across three categories: designing the health plan, reacting to funding changes, and revising policies. Organizational values of access to care and stewardship most frequently affected resource allocation and policy decisions, while economic and political pressures affect the relative prioritization of values. Research limitations/implications Small sample size, the potential for social desirability or recall bias, and the exclusion of provider, member or community perspectives beyond those represented among participating board members. Practical implications Program directors or researchers can use this study to assess the extent to which resource allocation and policy decisions align with organizational values and mission statements. Social implications The description of how healthcare decisions are actually made can be matched with literature that describes how healthcare resource decisions ought to be made, in order to provide a normative grounding for future decisions. Originality/value This study addresses a gap in literature regarding how CAPs actually make resource allocation decisions that affect access to healthcare services. PMID:27934550

  2. Location-Based Resource Allocation for OFDMA Cognitive Radio Systems

    KAUST Repository

    Ghorbel, Mahdi

    2011-05-01

    Cognitive radio is one of the hot topics for emerging and future wireless communication. It has been proposed as a suitable solution for the spectrum scarcity caused by the increase in frequency demand. The concept is based on allowing unlicensed users, called cognitive or secondary users, to share the unoccupied frequency bands with their owners, called the primary users, under constraints on the interference they cause to them. In order to estimate this interference, the cognitive system usually uses the channel state information to the primary user, which is often impractical to obtain. However, we propose to use location information, which is easier to obtain, to estimate this interference. The purpose of this work is to propose a subchannel and power allocation method which maximizes the secondary users\\' total capacity under the constraints of limited budget power and total interference to the primary under certain threshold. We model the problem as a constrained optimization problem for both downlink and uplink cases. Then, we propose low-complexity resource allocation schemes based on the waterfilling algorithm. The simulation results show the efficiency of the proposed method with comparison to the exhaustive search algorithm.

  3. Optimal Rate Allocation in Cluster-Tree WSNs

    Directory of Open Access Journals (Sweden)

    Jose Lopez Vicario

    2011-03-01

    Full Text Available In this paper, we propose a solution to the problem of guaranteed time slot allocation in cluster-tree WSNs. Our design uses the so-called Network Utility Maximization (NUM approach as far as we aim to provide a fair distribution of the available resources. From the point of view of implementation, we extend here the authors’ proposed Coupled-Decompositions Method (CDM in order to compute the NUM problem inside the cluster tree topology and we prove the optimality of this new extended version of the method. As a result, we obtain a distributed solution that reduces the total amount of signalling information in the network up to a factor of 500 with respect to the classical techniques, that is, primal and dual decomposition. This is possible because the CDM finds the optimal solution with a small number of iterations. Furthermore, when we compare our solution to the standard-proposed First Come First Serve (FCFS policy, we realize that FCFS becomes pretty unfair as the traffic load in the network increases and thus, a fair allocation of resources can be considered whenever the price to pay in terms of signalling and computational complexity is controlled.

  4. Optimal land use allocation of urban fringe in Guangzhou

    Institute of Scientific and Technical Information of China (English)

    GONG Jianzhou; LIU Yansui; CHEN Wenli

    2012-01-01

    In response to the strong drive for social and economic development,local governments have implemented urban master plans,providing measures and timeframes to address the continuous demand for land and to alleviate urban problems.In this paper,a multi-objective model was constructed to discuss the problem,including economic benefits and ecological effectiveness,in terms of land use optimization.A genetic algorithm was then adopted to solve the model,and a performance evaluation and sensitivity analysis were conducted using Pareto optimality.Results showed that a set of tradeoffs could be acquired by the allocation of land use.In addition,the Pareto solutions proved the model to be efficient; for example,a limit of 13,500 ha of urban area conformed to plan recommendations.The reduction in crop land,orchard land,grassland,and unused land provided further efficiencies.These results implied that further potential regional land resources remain and that the urban master plan is able to support sustainable local development in the years to come,as well as verified that it is feasible to use land use allocation multi-objective modeling and genetic algorithms.

  5. A Novel Algorithm for Optimizing Multiple Services Resource Allocation

    Directory of Open Access Journals (Sweden)

    Amjad Gawanmeh

    2016-06-01

    Full Text Available Resource provisioning becomes more and more challenging problem in cloud computing environment since cloudbased services become more numerous and dynamic. The problem of scheduling multiple tasks for multiple users on a given number of resources is considered NP-Complete problem, and therefore, several heuristic based research methods were proposed, yet, there are still many improvements can be done, since the problem has several optimization parameters. In addition, most proposed solutions are built on top of several assumptions and simplifications by applying computational methods such as game theory, fuzzy logic, or evolutionary computing. This paper presents an algorithm to address the problem of resource allocation across a cloud-based network, where several resources are available, and the cost of computational service depends on the amount of computation. The algorithm is applicable without restrictions on cost vector or compaction time matrix as opposed to methods in the literature. In addition, the execution of the algorithm shows better utility compared to methods applied on similar problems.

  6. Multi-robot task allocation based on two dimensional artificial fish swarm algorithm

    Science.gov (United States)

    Zheng, Taixiong; Li, Xueqin; Yang, Liangyi

    2007-12-01

    The problem of task allocation for multiple robots is to allocate more relative-tasks to less relative-robots so as to minimize the processing time of these tasks. In order to get optimal multi-robot task allocation scheme, a twodimensional artificial swarm algorithm based approach is proposed in this paper. In this approach, the normal artificial fish is extended to be two dimension artificial fish. In the two dimension artificial fish, each vector of primary artificial fish is extended to be an m-dimensional vector. Thus, each vector can express a group of tasks. By redefining the distance between artificial fish and the center of artificial fish, the behavior of two dimension fish is designed and the task allocation algorithm based on two dimension artificial swarm algorithm is put forward. At last, the proposed algorithm is applied to the problem of multi-robot task allocation and comparer with GA and SA based algorithm is done. Simulation and compare result shows the proposed algorithm is effective.

  7. A Dynamic Pricing Reverse Auction-Based Resource Allocation Mechanism in Cloud Workflow Systems

    Directory of Open Access Journals (Sweden)

    Xuejun Li

    2016-01-01

    Full Text Available Market-oriented reverse auction is an efficient and cost-effective method for resource allocation in cloud workflow systems since it can dynamically allocate resources depending on the supply-demand relationship of the cloud market. However, during the auction the price of cloud resource is usually fixed, and the current resource allocation mechanisms cannot adapt to the changeable market properly which results in the low efficiency of resource utilization. To address such a problem, a dynamic pricing reverse auction-based resource allocation mechanism is proposed. During the auction, resource providers can change prices according to the trading situation so that our novel mechanism can increase the chances of making a deal and improve efficiency of resource utilization. In addition, resource providers can improve their competitiveness in the market by lowering prices, and thus users can obtain cheaper resources in shorter time which would decrease monetary cost and completion time for workflow execution. Experiments with different situations and problem sizes are conducted for dynamic pricing-based allocation mechanism (DPAM on resource utilization and the measurement of Time⁎Cost (TC. The results show that our DPAM can outperform its representative in resource utilization, monetary cost, and completion time and also obtain the optimal price reduction rates.

  8. Global Register Allocation for SIMD Multiprocessors

    Institute of Scientific and Technical Information of China (English)

    BenjaminHAO; DavidPEARSON; 等

    1996-01-01

    It is relatively clear how to map regular,repetitive or grid oriented computations onto SIMD architectures.It is not so clear,however,how to do this for irregular computations even though there may be significant amounts of intrinsic parallelism in branch free code.We study compilation techniques for this type of code when targeted to SIMD computers and illustrate their use on a simple model architecture.In this paper,we present one of the compilation techniques,global register allocation,we have developed for SIMD computers,and demonstrate that it can effectively allocate registers for parallelizing irregular computations in branch free code.This technique is an extension and a modification of the register allocation via graph coloring approach used by sequential compilers.Our performance results validate our method.

  9. On System Engineering a Barter-Based Re-allocation of Space System Key Development Resources

    Science.gov (United States)

    Kosmann, William J.

    NASA has had a decades-long problem with cost growth during the development of space science missions. Numerous agency-sponsored studies have produced average mission level development cost growths ranging from 23 to 77%. A new study of 26 historical NASA science instrument set developments using expert judgment to re-allocate key development resources has an average cost growth of 73.77%. Twice in history, during the Cassini and EOS-Terra science instrument developments, a barter-based mechanism has been used to re-allocate key development resources. The mean instrument set development cost growth was -1.55%. Performing a bivariate inference on the means of these two distributions, there is statistical evidence to support the claim that using a barter-based mechanism to re-allocate key instrument development resources will result in a lower expected cost growth than using the expert judgment approach. Agent-based discrete event simulation is the natural way to model a trade environment. A NetLogo agent-based barter-based simulation of science instrument development was created. The agent-based model was validated against the Cassini historical example, as the starting and ending instrument development conditions are available. The resulting validated agent-based barter-based science instrument resource re-allocation simulation was used to perform 300 instrument development simulations, using barter to re-allocate development resources. The mean cost growth was -3.365%. A bivariate inference on the means was performed to determine that additional significant statistical evidence exists to support a claim that using barter-based resource re-allocation will result in lower expected cost growth, with respect to the historical expert judgment approach. Barter-based key development resource re-allocation should work on science spacecraft development as well as it has worked on science instrument development. A new study of 28 historical NASA science spacecraft

  10. Adaptive Resource Allocation For MAI Minimization In Wireless Adhoc Network

    Directory of Open Access Journals (Sweden)

    Mohammed Abdul Waheed

    2011-05-01

    Full Text Available Coding-based solutions for MANETs have emerged as a basic solution to current high rate data accessing in adhoc network. This has become essential related to the absence of centralized control such as a monitoring station. A code assignment protocol is needed to assign distinct codes to different terminals. This problem is less effective in small networks, but becomes dominative in large networks where the numbers of code sequence are lesser than the number of terminals to code, demanding reuse of the codes. The issue of code allocation in communication is focused in this paper with the evaluation of MAI in wireless network. Unlike previously proposed protocols in this paper a focus for the multiple access interference (MAI, thereby addressing the limiting near-far problem that decreases the throughput performance in MANETs is made. The code assignment scheme is developed for the proper usage of users code under MANETs communication to minimize the MAI impact.

  11. Allocation Of The DSTATCOM In The Distribution System

    Directory of Open Access Journals (Sweden)

    Aliasghar Baziar

    2015-08-01

    Full Text Available Abstract Through this article a novel random structure is depicted to shape the uncertainty result of the active and reactive loads in the DSTATCOM allocation and problem in sizing. The planned technique has 2m1 point approximation method PEM to capture the random associated with the anticipated fault of the loads. The aims are minimization of the entire active power losses which lessen the voltage nonconformity of the buses. A new optimization procedure on the root of the bat algorithm BA is confirmed to explore the problem galaxy universally. In addition the clue of interactive fuzzy sufficient method is useful in the multi-objective preparation in providing a suitable stability between the optimization of the objective roles. Lastly the proposed method will be examed on the 69-bus IEEE distribution system to settle its likelihood and effective presentation.

  12. A Dynamic Tap Allocation for Concurrent CMA-DD Equalizers

    Directory of Open Access Journals (Sweden)

    Trindade DiegovonBM

    2010-01-01

    Full Text Available Abstract This paper proposes a dynamic tap allocation for the concurrent CMA-DD equalizer as a low complexity solution for the blind channel deconvolution problem. The number of taps is a crucial factor which affects the performance and the complexity of most adaptive equalizers. Generally an equalizer requires a large number of taps in order to cope with long delays in the channel multipath profile. Simulations show that the proposed new blind equalizer is able to solve the blind channel deconvolution problem with a specified and reduced number of active taps. As a result, it minimizes the output excess mean square error due to inactive taps during and after the equalizer convergence and the hardware complexity as well.

  13. Beamforming and Rate Allocation in MISO Cognitive Radio Networks

    CERN Document Server

    Tajer, Ali; Wang, Xiaodong

    2009-01-01

    We consider decentralized multi-antenna cognitive radio networks where secondary (cognitive) users are granted simultaneous spectrum access along with license-holding (primary) users. We treat the problem of distributed beamforming and rate allocation for the secondary users such that the minimum weighted secondary rate is maximized. Such an optimization is subject to (1) a limited weighted sum-power budget for the secondary users and (2) guaranteed protection for the primary users in the sense that the interference level imposed on each primary receiver does not exceed a specified level. Based on the decoding method deployed by the secondary receivers, we consider three scenarios for solving this problem. In the first scenario each secondary receiver decodes only its designated transmitter while suppressing the rest as Gaussian interferers (single-user decoding). In the second case each secondary receiver employs the maximum likelihood decoder (MLD) to jointly decode all secondary transmissions, and in the t...

  14. Radio resource allocation in OFDMA multi-cell networks

    CERN Document Server

    Detti, Paolo; Abrardo, Andrea

    2010-01-01

    In this paper, the problem of allocating users to radio resources (i.e., subcarriers) in the downlink of an OFDMA cellular network is addressed. We consider a multi-cellular environment with a realistic interference model and a margin adaptive approach, i.e., we aim at minimizing total transmission power while maintaining a certain given rate for each user. The computational complexity issues of the resulting model is discussed and proving that the problem is NP-hard in the strong sense. Heuristic approaches, based on network flow models, that finds optima under suitable conditions, or "reasonably good" solutions in the general case are presented. Computational experiences show that, in a comparison with a commercial state-of-the-art optimization solver, the proposed algorithms are effective in terms of solution quality and CPU times.

  15. Ant Colony Optimization for Route Allocation in Transportation Networks

    Science.gov (United States)

    Zamfirescu, Constantin-Bǎlǎ; Negulescu, Sorin; Oprean, Constantin; Banciu, Dorin

    2009-04-01

    The paper introduces a bio-inspired approach to solve the route allocation problem (RAP) in the transportation networks. The approach extends a well-known meta-heuristics algorithm with the real life constraints that are dealt with in the scheduling process (i.e. the uniform distribution of routes diversity for vehicles, the average distance travelled in a month, the driver's rest between subsequent trips etc.). The paper is focusing on the engineering aspects of employing bio-inspired algorithms (which proved to have near-optimal results for toy-like problems) to a real-life application domain. The approach proved to be capable of preserving the software components (agents) to the complexity and dynamics of the situation when the RAP requires incremental extensions of constraints to reflect the traffic conditions in the transportation network.

  16. Dynamic Server Allocation over Time Varying Channels with Switchover Delay

    CERN Document Server

    Celik, Güner D; Modiano, Eytan

    2012-01-01

    We consider a dynamic server allocation problem over parallel queues with randomly varying connectivity and server switchover delay between the queues. At each time slot the server decides either to stay with the current queue or switch to another queue based on the current connectivity and the queue length information. Switchover delay occurs in many telecommunications applications and is a new modeling component of this problem that has not been previously addressed. We show that the simultaneous presence of randomly varying connectivity and switchover delay changes the system stability region and the structure of optimal policies. In the first part of the paper, we consider a system of two parallel queues, and develop a novel approach to explicitly characterize the stability region of the system using state-action frequencies which are stationary solutions to a Markov Decision Process (MDP) formulation. We then develop a frame-based dynamic control (FBDC) policy, based on the state-action frequencies, and ...

  17. Playing games against nature: optimal policies for renewable resource allocation

    CERN Document Server

    Ermon, Stefano; Gomes, Carla P; Selman, Bart

    2012-01-01

    In this paper we introduce a class of Markov decision processes that arise as a natural model for many renewable resource allocation problems. Upon extending results from the inventory control literature, we prove that they admit a closed form solution and we show how to exploit this structure to speed up its computation. We consider the application of the proposed framework to several problems arising in very different domains, and as part of the ongoing effort in the emerging field of Computational Sustainability we discuss in detail its application to the Northern Pacific Halibut marine fishery. Our approach is applied to a model based on real world data, obtaining a policy with a guaranteed lower bound on the utility function that is structurally very different from the one currently employed.

  18. Allocating service parts in two-echelon networks at a utility company

    NARCIS (Netherlands)

    Berg, van den D.; Heijden, van der M.C.; Schuur, P.C.

    2014-01-01

    We study a multi-item, two-echelon, continuous-review inventory problem at a Dutch utility company, Liander. We develop a model that optimizes the quantities of service parts and their allocation in the two-echelon network under an aggregate waiting time restriction. Specific aspects that we address

  19. Allocating service parts in two-echelon networks at a utility company

    NARCIS (Netherlands)

    Berg, van D.; Heijden, van der M.C.; Schuur, P.C.

    2016-01-01

    We study a multi-item, two-echelon, continuous-review inventory problem at a Dutch utility company. We develop a model for the optimal allocation of service parts in a two-echelon network under an aggregate waiting time constraint. Specific model aspects are emergency shipments in case of stockout,

  20. Directed graph based carbon flow tracing for demand side carbon obligation allocation

    DEFF Research Database (Denmark)

    Sun, Tao; Feng, Donghan; Ding, Teng

    2016-01-01

    In order to achieve carbon emission abatement, some researchers and policy makers have cast their focus on demand side carbon abatement potentials. This paper addresses the problem of carbon flow calculation in power systems and carbon obligation allocation at demand side. A directed graph based...

  1. Efficient Methods for Multi-agent Multi-issue Negotiation: Allocating Resources

    NARCIS (Netherlands)

    Wu, M.; De Weerdt, M.M.; La Poutré, H.

    2009-01-01

    In this paper, we present an automated multi-agent multi-issue negotiation solution to solve a resource allocation problem. We use a multilateral negotiation model, by which three agents bid sequentially in consecutive rounds till some deadline. Two issues are bundled and negotiated concurrently, so

  2. Competing Principles for Allocating Health Care Resources.

    Science.gov (United States)

    Carter, Drew; Gordon, Jason; Watt, Amber M

    2016-10-01

    We clarify options for conceptualizing equity, or what we refer to as justice, in resource allocation. We do this by systematically differentiating, expounding, and then illustrating eight different substantive principles of justice. In doing this, we compare different meanings that can be attributed to "need" and "the capacity to benefit" (CTB). Our comparison is sharpened by two analytical tools. First, quantification helps to clarify the divergent consequences of allocations commended by competing principles. Second, a diagrammatic approach developed by economists Culyer and Wagstaff offers a visual and conceptual aid. Of the eight principles we illustrate, only two treat as relevant both a person's initial health state and a person's CTB per resource unit expended: (1) allocate resources so as to most closely equalize final health states and (2) allocate resources so as to equally restore health states to population norms. These allocative principles ought to be preferred to the alternatives if one deems relevant both a person's initial health state and a person's CTB per resource unit expended. Finally, we examine some possibilities for conceptualizing benefits as relative to how badly off someone is, extending Parfit's thought on Prioritarianism (a prioritizing of the worst off). Questions arise as to how much intervention effects accruing to the worse off count for more and how this changes with improving health. We explicate some recent efforts to answer these questions, including in Dutch and British government circles. These efforts can be viewed as efforts to operationalize need as an allocative principle. Each effort seeks to maximize in the aggregate quanta of effect that are differentially valued in favor of the worst off. In this respect, each effort constitutes one type of Prioritarianism, which Parfit failed to differentiate from other types.

  3. Optimization of sensing time and cooperative user allocation for OR-rule cooperative spectrum sensing in cognitive radio network

    Institute of Scientific and Technical Information of China (English)

    刘鑫; 仲伟志; 陈琨奇

    2015-01-01

    In order to improve the throughput of cognitive radio (CR), optimization of sensing time and cooperative user allocation for OR-rule cooperative spectrum sensing was investigated in a CR network that includes multiple users and one fusion center. The frame structure of cooperative spectrum sensing was divided into multiple transmission time slots and one sensing time slot consisting of local energy detection and cooperative overhead. An optimization problem was formulated to maximize the throughput of CR network, subject to the constraints of both false alarm probability and detection probability. A joint optimization algorithm of sensing time and number of users was proposed to solve this optimization problem with low time complexity. An allocation algorithm of cooperative users was proposed to preferentially allocate the users to the channels with high utilization probability. The simulation results show that the significant improvement on the throughput can be achieved through the proposed joint optimization and allocation algorithms.

  4. Near-optimal power allocation with PSO algorithm for MIMO cognitive networks using multiple AF two-way relays

    KAUST Repository

    Alsharoa, Ahmad M.

    2014-06-01

    In this paper, the problem of power allocation for a multiple-input multiple-output two-way system is investigated in underlay Cognitive Radio (CR) set-up. In the CR underlay mode, secondary users are allowed to exploit the spectrum allocated to primary users in an opportunistic manner by respecting a tolerated temperature limit. The secondary networks employ an amplify-and-forward two-way relaying technique in order to maximize the sum rate under power budget and interference constraints. In this context, we formulate an optimization problem that is solved in two steps. First, we derive a closed-form expression of the optimal power allocated to terminals. Then, we employ a strong optimization tool based on particle swarm optimization algorithm to find the power allocated to secondary relays. Simulation results demonstrate the efficiency of the proposed solution and analyze the impact of some system parameters on the achieved performance. © 2014 IEEE.

  5. Energy-Efficient Power Allocation for Fixed-Gain Amplify-and-Forward Relay Networks with Partial Channel State Information

    KAUST Repository

    Zafar, Ammar

    2012-06-01

    In this report, energy-efficient transmission and power allocation for fixed-gain amplify-and-forward relay networks with partial channel state information (CSI) are studied. In the energy-efficiency problem, the total power consumed is minimized while keeping the signal-to-noise-ratio (SNR) above a certain threshold. In the dual problem of power allocation, the end-to-end SNR is maximized under individual and global power constraints. Closed-form expressions for the optimal source and relay powers and the Lagrangian multiplier are obtained. Numerical results show that the optimal power allocation with partial CSI provides comparable performance as optimal power allocation with full CSI at low SNR.

  6. Energy-Efficient Power Allocation for Fixed-Gain Amplify-and-Forward Relay Networks with Partial Channel State Information

    KAUST Repository

    Zafar, Ammar

    2012-09-16

    In this letter, energy-efficient transmission and power allocation for fixed-gain amplify-and-forward relay networks with partial channel state information (CSI) are studied. In the energy-efficiency problem, the total power consumed is minimized while keeping the signal-to-noise-ratio (SNR) above a certain threshold. In the dual problem of power allocation, the end-to-end SNR is maximized under individual and global power constraints. Closed-form expressions for the optimal source and relay powers and the Lagrangian multiplier are obtained. Numerical results show that the optimal power allocation with partial CSI provides comparable performance as optimal power allocation with full CSI at low SNR. © 2012 IEEE.

  7. Fitness Landscape Analysis for Dynamic Resource Allocation in Multiuser OFDM Based Cognitive Radio Systems

    CERN Document Server

    Huang, Dong; Leung, Cyril

    2008-01-01

    Cognitive Radio (CR) is a promising technique for improving the spectrum efficiency in future wireless network. The downlink transmission in a multiuser Orthogonal Frequency Division Modulation (MU-OFDM) based CR system is investigated. Optimal allocating transmit power, bits and subcarriers among cognitive radio users can achieve high throughput while satisfying the given quality of services (QoS) requirements. The problem of dynamic allocation of transmit power, bits and secondary users in multiuser OFDM systems is a combinatorial optimization problem and is computationally complex. Accordingly, a simple while efficient algorithm is needed. It has been shown that memetic algorithms (MAs) outperform other traditional algorithms for many combinatorial optimization problems. On the other hand, the performance of MAs is highly dependent on specific problems. In order to achieve better performance, we need to select appropriate local search method and evolutionary operators for a memetic algorithm. Fitness lands...

  8. Optimal Relay Assignment and Power Allocation for Cooperative Communications

    Institute of Scientific and Technical Information of China (English)

    Kun Xie; Jian-Nong Cao; Ji-Gang Wen

    2013-01-01

    Cooperative communication for wireless networks has gained a lot of recent interest due to its ability to mitigate fading with exploration of spatial diversity.In this paper,we study a joint optimization problem of jointly considering transmission mode selection,relay assignment and power allocation to maximize the capacity of the network through cooperative wireless communications.This problem is much more challenging than relay assignment considered in literature work which simply targets to maximize the transmission capacity for a single transmission pair.We formulate the problem as a variation of the maximum weight matching problem where the weight is a function over power values which must meet power constraints (VMWMC).Although VMWMC is a non-convex problem whose complexity increases exponentially with the number of relay nodes,we show that the duality gap of VMWMC is virtual zero.Based on this result,we propose a solution using Lagrange dual decomposition to reduce the computation complexity.We do simulations to evaluate the performance of the proposed solution.The results show that our solution can achieve maximum network capacity with much less computation time compared with exhaustive search,and our solution outperforms existing sub-optimal solutions that can only achieve much lower network capacity.

  9. Solving the Resource Allocation Problem in a Multimodal Container Terminal as a Network Flow Problem

    OpenAIRE

    Zehendner, Elisabeth; Absi, Nabil; Dauzère-Pérès, Stéphane; Feillet, Dominique

    2011-01-01

    International audience; Continuously increasing global container trade and pressure from a limited number of large shipping companies are enforcing the need for efficient container terminals. By using internal material handling resources efficiently, transfer times and operating costs are reduced. We focus our study on container terminals using straddle carriers for transportation and storage operations. We assume that straddle carriers are shared among maritime and inland transport modes (tr...

  10. A QR Code Based Processing For Dynamic and Transparent Seat Allocation in Indian Railway

    Directory of Open Access Journals (Sweden)

    Man Mohan Swarup

    2012-05-01

    Full Text Available Indian Railway is worlds largest human transport system, is currently dealing with a lot of problems, such as availability of confirming seat to waiting list passengers after its departure. However there is no such system that presently in Indian railway gives accommodation to waiting list passengers during their journey. This paper proposes the Dynamic Seat Allocation (DSA system considering the advantage of QR code processing along with one of the standards of wireless communication. Moreover, dynamic authentication to the wireless device is incorporate which is passenger specific. Through this research paper our approach is to make fair processing in seat reservation or allocation in Indian Railway.

  11. Joint TAS and Power Allocation for SDF Relaying M2M Cooperative Networks

    Directory of Open Access Journals (Sweden)

    Lingwei Xu

    2016-01-01

    Full Text Available The outage probability (OP performance of multiple-relay-based selective decode-and-forward (SDF relaying mobile-to-mobile (M2M networks with transmit antenna selection (TAS over N-Nakagami fading channels is investigated. The exact closed-form expressions for OP of the optimal and suboptimal TAS schemes are derived. The power allocation problem is formulated for performance optimization. Then, the OP performance under different conditions is evaluated through numerical simulations to verify the analysis. The simulation results showed that optimal TAS scheme has a better OP performance than suboptimal TAS scheme. Further, the power allocation parameter has an important influence on the OP performance.

  12. Power flow tracing based method for allocation of transmission service cost to transactions

    Institute of Scientific and Technical Information of China (English)

    李卫东; 刘娆; 魏立明

    2004-01-01

    Based on the concepts of objective fact and subjeetive desire proposed in this paper, the problens that exist in the nodal injections-based and transaction-based transmission service allocation scheme are pointed out. To get around the problems above, a novel transmission service allocation scheme is proposed which considers the power flow distribution and the transaetion impact on the system simultaneously so that the issues of "Cross-subsidies" and "Counter flow" can be avoided. The principle of the scheme is illustrated using two simple networks with 7 cases. The results show that the proposed scheme can satisfy the properties necessary for the development and growth of the electricity market.

  13. Software architecture design for a dynamic spectrum allocation-enabled cognitive radio testbed

    DEFF Research Database (Denmark)

    Tonelli, Oscar; Berardinelli, Gilberto; Cattoni, Andrea Fabio

    2011-01-01

    The evolution of wireless communications is bringing into reality the dense deployment of femto and local area cells, which represents a challenging scenario for proving the effectiveness of Cognitive Radio (CR) frameworks. In particular the Dynamic Spectrum Allocation (DSA) paradigm aims...... at solving the resource allocation problem in a fully autonomous way. While in both CR and standardization lot of effort has been spent in developing efficient DSA algorithms, their research-oriented software radio implementation is still disregarded. In this paper, the design approach used......: preliminary results show a computational load compatible with nowadays Commercial-Off-The-Shelf computers....

  14. Relay selection and resource allocation for two-way DF-AF cognitive radio networks

    KAUST Repository

    Alsharoa, Ahmad M.

    2013-08-01

    In this letter, the problem of relay selection and optimal resource allocation for two-way relaying cognitive radio networks using half duplex amplify-and-forward and decode-and-forward protocols is investigated. The primary and secondary users are assumed to access the spectrum simultaneously, in a way that the interference introduced to the primary users should be below a certain tolerated limit. Dual decomposition and subgradient methods are used to find the optimal power allocation. A suboptimal approach based on a genetic algorithm is also presented. Simulation results show that the proposed suboptimal algorithm offers a performance close to the optimal performance with a considerable complexity saving. © 2013 IEEE.

  15. Media access control and resource allocation for next generation passive optical networks

    CERN Document Server

    Ansari, Nirwan

    2013-01-01

    This book focuses on various Passive optical networks (PONs)  types, including currently deployed Ethernet PON (EPON) and Gigabit PON (GPON) as well as next generation WDM PON and OFDM PON. Also this book examines the integrated optical and wireless access networks. Concentrating on two issues in these networks: media access control (MAC) and resource allocation. These two problems can greatly affect performances of PONs such as network resource utilization and QoS of end users. Finally this book will discuss various solutions to address the MAC and resource allocation issues in various PON networks.

  16. Ethics and resource allocation: an economist's view.

    Science.gov (United States)

    McGuire, A

    1986-01-01

    This paper debates some of the issues involved in attempting to apply economic analysis to the health care sector when medical ethics plays such an important part in determining the allocation of resources in that sector. Two distinct ethical positions are highlighted as being fundamental to the understanding of resource allocation in this sector -- deontological and utilitarian theories of ethics. It is argued that medical ethics are often narrowly conceived in that there is a tendency for the individual, rather than society at large, to form the focal point of the production of the service "health care'. Thus medical ethics have been dominated by individualistic ethical coded which do not fully consider questions relating to resource allocation at a social level. It is further argued that the structure of the health care sector augments these "individualistic' ethics. It is also suggested that different actors in the health care sector address questions of resource allocation with respect to different time periods, and that this serves to further enhance the influence of "individualistic' ethical codes in this sector.

  17. The relationship between attention allocation and cheating

    NARCIS (Netherlands)

    Pittarello, Andrea; Motro, Daphna; Rubaltelli, Enrico; Pluchino, Patrik

    2016-01-01

    Little is known about the relationship between attention allocation and dishonesty. The goal of the present work was to address this issue using the eyetracking methodology. We developed a novel task in which participants could honestly report seeing a particular card and lose money, or they could f

  18. 20 CFR 631.82 - Substate allocation.

    Science.gov (United States)

    2010-04-01

    ... 20 Employees' Benefits 3 2010-04-01 2010-04-01 false Substate allocation. 631.82 Section 631.82 Employees' Benefits EMPLOYMENT AND TRAINING ADMINISTRATION, DEPARTMENT OF LABOR PROGRAMS UNDER TITLE III OF THE JOB TRAINING PARTNERSHIP ACT Disaster Relief Employment Assistance § 631.82 Substate...

  19. Cost Allocation as a Coordination Mechanism

    NARCIS (Netherlands)

    Diaw, K.

    2003-01-01

    This paper shows that cost allocation can endogenously arise as a coordination mechanism in a decentralized firm.This result is derived in a setting with multiple (internally supplied) resources shared by multiple users, which constitutes a departure from previous literature.While standard cost allo

  20. Status Characteristics, Reward Allocation, and Equity

    Science.gov (United States)

    Parcel, Toby L.; Cook, Karen S.

    1977-01-01

    The relationship between a group's power and prestige or status hierarchy and group members' patterns of reward allocation was investigated. The addition of evidence concerning actual task performance results in the alignment of reward and status rankings and encourages the use of distribution rules stressing equity as opposed to equality.…

  1. International dynamic asset allocation and return predictability

    NARCIS (Netherlands)

    Basu, D.; Oomen, R.; Stremme, A.

    2010-01-01

    The presence of time varying investment opportunity sets has been documented in the context of international asset allocation, and the economic value associated with these is a topic of lively debate in the academic literature. This paper constructs simple, real-time dynamic international asset allo

  2. 50 CFR 660.55 - Allocations.

    Science.gov (United States)

    2010-10-01

    ... 50 Wildlife and Fisheries 9 2010-10-01 2010-10-01 false Allocations. 660.55 Section 660.55 Wildlife and Fisheries FISHERY CONSERVATION AND MANAGEMENT, NATIONAL OCEANIC AND ATMOSPHERIC ADMINISTRATION... sublegal halibut at 15 percent of the Area 2A constant exploitation yield (CEY) for legal size halibut,...

  3. RAOPS: Resource Allocation Optimization Program for Safegurards

    Energy Technology Data Exchange (ETDEWEB)

    Zardecki, A.; Markin, J.T.

    1994-03-01

    RAOPS--Resource Allocation Optimization Program for Safeguards is extended to a multiobjective return function having the detection probability and expected detection time as criteria. The expected detection time is included as a constraint, based on the well-known Avenhaus model of the optimum number of inventory periods. Examples of computation are provided.

  4. Allocation of Cognitive Resources in Translation

    DEFF Research Database (Denmark)

    Hvelplund, Kristian Tangsgaard

    The present study is an empirical investigation of translators' allocation of cognitive resources during the translation process, and it aims at investigating how translators' mental processing resources are put to use during translation. The study bases ts analyses on quantitative eye-tracking...

  5. Biased allocation of faces to social categories

    NARCIS (Netherlands)

    Dotsch, R.; Wigboldus, D.H.J.; Knippenberg, A.F.M. van

    2011-01-01

    Three studies show that social categorization is biased at the level of category allocation. In all studies, participants categorized faces. In Studies 1 and 2, participants overallocated faces with criminal features-a stereotypical negative trait-to the stigmatized Moroccan category, especially if

  6. Gold Rushes and mineral property rights allocation

    DEFF Research Database (Denmark)

    Sinding, Knud

    Even today, mineral property rights are allocated on what is essentially a first-come, first-serve or open access basis. Access to prospect and locate claims may be restricted in some areas such as national parks, but elsewhere a policy of open access is widely practised, albeit subject to a set...

  7. Cooperation and profit allocation in distribution chains

    NARCIS (Netherlands)

    Guardiola, L.A.; Meca, A.; Timmer, J.B.

    2005-01-01

    We study the coordination of actions and the allocation of profit in distribution chains under decentralized control. We consider distribution chains in which a single supplier supplies goods for replenishment of stocks of several retailers who, in turn, sell these goods to their own separate market

  8. Analysis of Berth Length Optimization of Indonesia Power Plant Terminal Project%印尼某电站码头工程泊位长度优化分析

    Institute of Scientific and Technical Information of China (English)

    刘奇虎

    2014-01-01

    Based on one power plant terminal project in Indonesia,the length of coal unloading berth in the bidding document is compared with the optimized length that is approved in the detailed design,which shows otherwise that the execution of overseas projects,especially EPC projects,require not only the promotion of China standards and codes to the world,but also the thorough investigation and exact grasp of local market,China standards must combine with local conditions to reduce the project risk and gain higher economic benefit.%本文通过介绍印度尼西亚某电站码头工程卸煤码头泊位长度投标长度和施工图批准的泊位长度的优化对比,从侧面来说明在国外实施项目,尤其是EPC项目,不仅要将中国的规范和标准推向世界,更需要彻底调查和准确掌握当地市场情况,将中国规范结合当地实际情况来降低实施项目的风险并获得较好的经济效益。

  9. Energy allocation in two species of Eutardigrada

    Directory of Open Access Journals (Sweden)

    Lorena REBECCHI

    2007-09-01

    Full Text Available To improve our knowledge on life histories in tardigrades and the energy allocated for their reproduction and growth, we have studied two species (Macrobiotus richtersi and Hypsibius convergens differing in evolutionary histories, diet and ways of oviposition. For both species we considered a bisexual population dwelling in the same substrate. In both species we investigated energy allocations in males with a testis rich in spermatozoa and females, each with an ovary containing oocytes in advanced vitellogenesis. The age of the specimens was estimated on the basis of buccal tube length and body size. Body and gonad areas were calculated using an image analysis program. In both species females reach a larger size than males. Macrobiotus richtersi has both a significantly longer buccal tube and wider body area than H. convergens. Statistical analyses show that the buccal tube has a positive correlation with body area and gonad area. For an estimate of the relative energy allocated for reproduction in one reproductive event (relative reproductive effort = RRE, we have used the ratio between gonad area and body area. In males of both species, the absolute amount of energy and the RRE is statistically lower than that of females. Males and females of H. convergens have a RRE higher than those of M. richtersi. In M. richtersi, the gonad increases proportionally more when animals are large (old, whereas in H. convergens this direct relationship is not detectable. In M. richtersi the energy allocated for a reproductive event increases during the life of the females. In males, the increase of the gonad size is progressive during the animal life. In each reproductive event, females of H. convergens allocate a lower amount of energy in absolute value when compared to M. richtersi. Nevertheless, when considering the RRE, their investment is higher than that of M. richtersi.

  10. A Novel Sensor Selection and Power Allocation Algorithm for Multiple-Target Tracking in an LPI Radar Network.

    Science.gov (United States)

    She, Ji; Wang, Fei; Zhou, Jianjiang

    2016-12-21

    Radar networks are proven to have numerous advantages over traditional monostatic and bistatic radar. With recent developments, radar networks have become an attractive platform due to their low probability of intercept (LPI) performance for target tracking. In this paper, a joint sensor selection and power allocation algorithm for multiple-target tracking in a radar network based on LPI is proposed. It is found that this algorithm can minimize the total transmitted power of a radar network on the basis of a predetermined mutual information (MI) threshold between the target impulse response and the reflected signal. The MI is required by the radar network system to estimate target parameters, and it can be calculated predictively with the estimation of target state. The optimization problem of sensor selection and power allocation, which contains two variables, is non-convex and it can be solved by separating power allocation problem from sensor selection problem. To be specific, the optimization problem of power allocation can be solved by using the bisection method for each sensor selection scheme. Also, the optimization problem of sensor selection can be solved by a lower complexity algorithm based on the allocated powers. According to the simulation results, it can be found that the proposed algorithm can effectively reduce the total transmitted power of a radar network, which can be conducive to improving LPI performance.

  11. Budget Allocation for Maximizing Viral Advertising in Social Networks

    Institute of Scientific and Technical Information of China (English)

    Bo-Lei Zhang; Zhu-Zhong Qian; Wen-Zhong Li; Bin Tang; Xiaoming Fu

    2016-01-01

    Viral advertising in social networks has arisen as one of the most promising ways to increase brand awareness and product sales. By distributing a limited budget, we can incentivize a set of users as initial adopters so that the advertising can start from the initial adopters and spread via social links to become viral. Despite extensive researches in how to target the most influential users, a key issue is often neglected: how to incentivize the initial adopters. In the problem of influence maximization, the assumption is that each user has a fixed cost for being initial adopters, while in practice, user decisions for accepting the budget to be initial adopters are often probabilistic rather than deterministic. In this paper, we study optimal budget allocation in social networks to maximize the spread of viral advertising. In particular, a concave probability model is introduced to characterize each user’s utility for being an initial adopter. Under this model, we show that it is NP-hard to find an optimal budget allocation for maximizing the spread of viral advertising. We then present a novel discrete greedy algorithm with near optimal performance, and further propose scaling-up techniques to improve the time-efficiency of our algorithm. Extensive experiments on real-world social graphs are implemented to validate the effectiveness of our algorithm in practice. The results show that our algorithm can outperform other intuitive heuristics significantly in almost all cases.

  12. APPROPRIATE ALLOCATION OF CONTINGENCY USING RISK ANALYSIS METHODOLOGY

    Directory of Open Access Journals (Sweden)

    Andi Andi

    2004-01-01

    Full Text Available Many cost overruns in the world of construction are attributable to either unforeseen events or foreseen events for which uncertainty was not appropriately accommodated. It is argued that a significant improvement to project management performance may result from greater attention to the process of analyzing project risks. The objective of this paper is to propose a risk analysis methodology for appropriate allocation of contingency in project cost estimation. In the first step, project risks will be identified. Influence diagramming technique is employed to identify and to show how the risks affect the project cost elements and also the relationships among the risks themselves. The second step is to assess the project costs with regards to the risks under consideration. Using a linguistic approach, the degree of uncertainty of identified project risks is assessed and quantified. The problem of dependency between risks is taken into consideration during this analysis. For the final step, as the main purpose of this paper, a method for allocating appropriate contingency is presented. Two types of contingencies, i.e. project contingency and management reserve are proposed to accommodate the risks. An illustrative example is presented at the end to show the application of the methodology.

  13. Improving Hospital-Wide Early Resource Allocation through Machine Learning.

    Science.gov (United States)

    Gartner, Daniel; Padman, Rema

    2015-01-01

    The objective of this paper is to evaluate the extent to which early determination of diagnosis-related groups (DRGs) can be used for better allocation of scarce hospital resources. When elective patients seek admission, the true DRG, currently determined only at discharge, is unknown. We approach the problem of early DRG determination in three stages: (1) test how much a Naïve Bayes classifier can improve classification accuracy as compared to a hospital's current approach; (2) develop a statistical program that makes admission and scheduling decisions based on the patients' clincial pathways and scarce hospital resources; and (3) feed the DRG as classified by the Naïve Bayes classifier and the hospitals' baseline approach into the model (which we evaluate in simulation). Our results reveal that the DRG grouper performs poorly in classifying the DRG correctly before admission while the Naïve Bayes approach substantially improves the classification task. The results from the connection of the classification method with the mathematical program also reveal that resource allocation decisions can be more effective and efficient with the hybrid approach.

  14. SRF Coloring: Stream Register File Allocation via Graph Coloring

    Institute of Scientific and Technical Information of China (English)

    Xue-Jun Yang; Yu Deng; Li Wang; Xiao-Bo Yan; Jing Du; Ying Zhang; Gui-Bin Wang; Tao Tang

    2009-01-01

    Stream Register File (SRF) is a large on-chip memory of the stream processor and its efficient management is essential for good performance. Current stream programming languages expose the management of SRF to the programmer, incurring heavy burden on the programmer and bringing difficulties to inheriting the legacy codes. SF95 is the language developed for FT64 which is the first 64-bit stream processor designed for scientific applications. SF95 conceals SRF from the programmer and leaves the management of SRF to its compiler. In this paper, we present a compiler approach named SRF Coloring to manage SRF automatically. The novelties of this paper are: first, it is the first time to use the graph coloring-based algorithm for the SRF management; second, an algorithm framework for SRF Coloring that is well suited to the FT64 architecture is proposed -- this framework is based on a well-understood graph coloring algorithm for register allocation, together with some modifications to deal with the unusual aspects of SRF problem; third, the SRF Coloring algorithm is implemented in SF95Compiler, a compiler designed for FT64 and SF95. The experimental results show that our approach represents a practical and promising solution to SRF allocation.

  15. Power Allocation for Fading Channels with Peak-to-Average Power Constraints

    CERN Document Server

    Nguyen, Khoa D; Rasmussen, Lars K

    2008-01-01

    Power allocation with peak-to-average power ratio constraints is investigated for transmission over Nakagami-m fading channels with arbitrary input distributions. In the case of delay-limited block-fading channels, we find the solution to the minimum outage power allocation scheme with peak-to-average power constraints and arbitrary input distributions, and show that the signal-to-noise ratio exponent for any finite peak-to-average power ratio is the same as that of the peak-power limited problem, resulting in an error floor. In the case of the ergodic fully-interleaved channel, we find the power allocation rule that yields the maximal information rate for an arbitrary input distribution and show that capacities with peak-to-average power ratio constraints, even for small ratios, are very close to capacities without peak-power restrictions.

  16. Joint duplex mode selection, channel allocation, and power control for full-duplex cognitive femtocell networks

    Directory of Open Access Journals (Sweden)

    Mingjie Feng

    2015-02-01

    Full Text Available In this paper, we aim to maximize the sum rate of a full-duplex cognitive femtocell network (FDCFN as well as guaranteeing the quality of service (QoS of users in the form of a required signal to interference plus noise ratios (SINR. We first consider the case of a pair of channels, and develop optimum-achieving power control solutions. Then, for the case of multiple channels, we formulate joint duplex model selection, power control, and channel allocation as a mixed integer nonlinear problem (MINLP, and propose an iterative framework to solve it. The proposed iterative framework consists of a duplex mode selection scheme, a near-optimal distributed power control algorithm, and a greedy channel allocation algorithm. We prove the convergence of the proposed iterative framework as well as a lower bound for the greedy channel allocation algorithm. Numerical results show that the proposed schemes effectively improve the sum rate of FDCFNs.

  17. A Heuristic Optimal Discrete Bit Allocation Algorithm for Margin Maximization in DMT Systems

    Directory of Open Access Journals (Sweden)

    Dong Shi-Wei

    2007-01-01

    Full Text Available A heuristic optimal discrete bit allocation algorithm is proposed for solving the margin maximization problem in discrete multitone (DMT systems. Starting from an initial equal power assignment bit distribution, the proposed algorithm employs a multistaged bit rate allocation scheme to meet the target rate. If the total bit rate is far from the target rate, a multiple-bits loading procedure is used to obtain a bit allocation close to the target rate. When close to the target rate, a parallel bit-loading procedure is used to achieve the target rate and this is computationally more efficient than conventional greedy bit-loading algorithm. Finally, the target bit rate distribution is checked, if it is efficient, then it is also the optimal solution; else, optimal bit distribution can be obtained only by few bit swaps. Simulation results using the standard asymmetric digital subscriber line (ADSL test loops show that the proposed algorithm is efficient for practical DMT transmissions.

  18. Research on multirobot pursuit task allocation algorithm based on emotional cooperation factor.

    Science.gov (United States)

    Fang, Baofu; Chen, Lu; Wang, Hao; Dai, Shuanglu; Zhong, Qiubo

    2014-01-01

    Multirobot task allocation is a hot issue in the field of robot research. A new emotional model is used with the self-interested robot, which gives a new way to measure self-interested robots' individual cooperative willingness in the problem of multirobot task allocation. Emotional cooperation factor is introduced into self-interested robot; it is updated based on emotional attenuation and external stimuli. Then a multirobot pursuit task allocation algorithm is proposed, which is based on emotional cooperation factor. Combined with the two-step auction algorithm recruiting team leaders and team collaborators, set up pursuit teams, and finally use certain strategies to complete the pursuit task. In order to verify the effectiveness of this algorithm, some comparing experiments have been done with the instantaneous greedy optimal auction algorithm; the results of experiments show that the total pursuit time and total team revenue can be optimized by using this algorithm.

  19. Research on Multirobot Pursuit Task Allocation Algorithm Based on Emotional Cooperation Factor

    Directory of Open Access Journals (Sweden)

    Baofu Fang

    2014-01-01

    Full Text Available Multirobot task allocation is a hot issue in the field of robot research. A new emotional model is used with the self-interested robot, which gives a new way to measure self-interested robots’ individual cooperative willingness in the problem of multirobot task allocation. Emotional cooperation factor is introduced into self-interested robot; it is updated based on emotional attenuation and external stimuli. Then a multirobot pursuit task allocation algorithm is proposed, which is based on emotional cooperation factor. Combined with the two-step auction algorithm recruiting team leaders and team collaborators, set up pursuit teams, and finally use certain strategies to complete the pursuit task. In order to verify the effectiveness of this algorithm, some comparing experiments have been done with the instantaneous greedy optimal auction algorithm; the results of experiments show that the total pursuit time and total team revenue can be optimized by using this algorithm.

  20. Allocating responsibility for environmental risks: A comparative analysis of examples from water governance.

    Science.gov (United States)

    Doorn, Neelke

    2017-03-01

    The focus of the present study is on the allocation of responsibilities for addressing environmental risks in transboundary water governance. Effective environmental management in transboundary situations requires coordinated and cooperative action among diverse individuals and organizations. Currently, little insight exists on how to foster collective action such that individuals and organizations take the responsibility to address transboundary environmental risks. On the basis of 4 cases of transboundary water governance, it will be shown how certain allocation principles are more likely to encourage cooperative action. The main lesson from these case studies is that the allocation of responsibilities should be seen as a risk distribution problem, including considerations of effectiveness, efficiency, and fairness. Integr Environ Assess Manag 2017;13:371-375. © 2016 SETAC.

  1. Energy Efficient Resource Allocation for Phantom Cellular Networks

    KAUST Repository

    Abdelhady, Amr

    2016-04-01

    Multi-tier heterogeneous networks have become an essential constituent for next generation cellular networks. Meanwhile, energy efficiency (EE) has been considered a critical design criterion along with the traditional spectral efficiency (SE) metric. In this context, we study power and spectrum allocation for the recently proposed two-tier network architecture known as phantom cellular networks. The optimization framework includes both EE and SE. First, we consider sparsely deployed cells experiencing negligible interference and assume perfect channel state information (CSI). For this setting, we propose an algorithm that finds the SE and EE resource allocation strategies. Then, we compare the performance of both design strategies versus number of users, and phantom cells share of the total available resource units (RUs). We aim to investigate the effect of some system parameters to achieve improved SE performance at a non-significant loss in EE performance, or vice versa. It is found that increasing phantom cells share of RUs decreases the SE performance loss due to EE optimization when compared with the optimized SE performance. Second, we consider the densely deployed phantom cellular networks and model the EE optimization problem having into consideration the inevitable interference and imperfect channel estimation. To this end, we propose three resource allocation strategies aiming at optimizing the EE performance metric of this network. Furthermore, we investigate the effect of changing some of the system parameters on the performance of the proposed strategies, such as phantom cells share of RUs, number of deployed phantom cells within a macro cell coverage, number of pilots and the maximum power available for transmission by the phantom cells BSs. It is found that increasing the number of pilots deteriorates the EE performance of the whole setup, while increasing maximum power available for phantom cells transmissions reduces the EE of the whole setup in a

  2. Existing Opportunities to Adapt the Rio Grande/Bravo Basin Water Resources Allocation Framework

    Directory of Open Access Journals (Sweden)

    Luzma Fabiola Nava

    2016-07-01

    Full Text Available The study of the Rio Grande/Bravo (RGB Basin water allocation demonstrates how the United States (U.S. and Mexico have consolidated a transboundary framework based on water sharing. However, the water supply no longer meets the ever-increasing demand for water or the expectations of different stakeholders. This paper explores opportunities for an enhanced management regime that will address past problems and better examine how to balance demands for a precious resource and environmental needs. Based on an overview of the RGB Basin context and the water allocation framework, as well as a discussion on stakeholders’ ability to achieve solutions, this paper explores three key questions: (1 Does the current binational water allocation framework meet current and future human and environmental needs? (2 How can the U.S.-Mexico water allocation framework be adapted to balance social and environmental water demands so it can support and preserve the RGB Basin ecosystem? (3 What are the main opportunities to be explored for expanding the U.S.-Mexico water resources allocation framework? The U.S.-Mexico water resources framework is subject to broad interpretation and may be adapted to the circumstances taking the fullest advantage of its flexibility. Policy recommendations highlight the existing flexibility of the binational framework, the potential to move forward with an ad hoc institutional arrangement, and the creation of political will to achieve change through stakeholders recommendations.

  3. Joint slot allocation and dynamic pricing of container sea–rail multimodal transportation

    Directory of Open Access Journals (Sweden)

    Di Liu

    2015-06-01

    Full Text Available The container sea–rail multimodal transport system faces complex challenges with demand uncertainties for joint slot allocation and dynamic pricing. The challenge is formulated as a two-stage optimal model based on revenue management (RM as actual slots sale of multi-node container sea–rail multimodal transport usually includes contract sale to large shippers and free sale to scattered shippers. First stage in the model utilizes an origin-destination control approach, formulated as a stochastic integer programming equation, to settle long-term slot allocation in the contract market and empty container allocation. Second stage in the model is formulated as a stochastic nonlinear programming equation to solve a multiproduct joint dynamic pricing and inventory control problem for price settling and slot allocation in each period of free market. Considering the random nature of demand, the methods of chance constrained programming and robust optimization are utilized to transform stochastic models into deterministic models. A numerical experiment is presented to verify the availability of models and solving methods. Results of considering uncertain/certain demand are compared, which show that the two-stage optimal strategy integrating slot allocation with dynamic pricing considering random demand is revealed to increase the revenue for multimodal transport operators (MTO while concurrently satisfying shippers' demand. Research resulting from this paper will contribute to the theory and practice of container sea–rail multimodal transport revenue management and provide a scientific decision-making tool for MTO.

  4. Power Allocation and Pricing in Multi-User Relay Networks Using Stackelberg and Bargaining Games

    CERN Document Server

    Cao, Qian; Jing, Yindi

    2012-01-01

    This paper considers a multi-user single-relay wireless network, where the relay gets paid for helping the users forward signals, and the users pay to receive the relay service. We study the relay power allocation and pricing problems, and model the interaction between the users and the relay as a two-level Stackelberg game. In this game, the relay, modeled as the service provider and the leader of the game, sets the relay price to maximize its revenue; while the users are modeled as customers and the followers who buy power from the relay for higher transmission rates. We use a bargaining game to model the negotiation among users to achieve a fair allocation of the relay power. Based on the proposed fair relay power allocation rule, the optimal relay power price that maximizes the relay revenue is derived analytically. Simulation shows that the proposed power allocation scheme achieves higher network sum-rate and relay revenue than the even power allocation. Furthermore, compared with the sum-rate-optimal so...

  5. Mechanisms and direction of allocation bias in randomised clinical trials

    DEFF Research Database (Denmark)

    Paludan-Müller, Asger Sand; Laursen, David R. T.; Hróbjartsson, Asbjørn

    2016-01-01

    clinical trials. METHODS: Two systematic reviews and a theoretical analysis. We conducted one systematic review of empirical studies of motives/methods for deciphering patient allocation sequences; and another review of methods publications commenting on allocation bias. We theoretically analysed...

  6. The complexity of economic equilibria for house allocation markets

    NARCIS (Netherlands)

    Fekete, Sándor P.; Skutella, Martin; Woeginger, Gerhard J.

    2003-01-01

    We prove NP-completeness of deciding the existence of an economic equilibrium in so-called house allocation markets. House allocation markets are markets with indivisible goods in which every agent holds exactly one copy of some good.

  7. An Improved Dynamic Bandwidth Allocation Algorithm for Ethernet PON

    Institute of Scientific and Technical Information of China (English)

    2003-01-01

    This paper proposes an improved Dynamic Bandwidth Allocation (DBA) algorithm for EPON, which combines static and traditional dynamic allocation schemes. Simulation result shows that the proposed algorithm may effectively improve the performance of packet delay.

  8. Dynamic capacity allocation for low-cost multicarrier multimode PON

    NARCIS (Netherlands)

    Taniman, R.O.; Bochove, van A.C.; Boer, de P.T.; Sikkes, B.

    2007-01-01

    A stable-matching-based multiuser multicarrier capacity allocation algorithm is proposed. It responds to ONU backlogs and dynamic subchannel gains. Benchmarked against Binary Linear Programming, it results in just 5% less allocated capacity, at much lower complexity.

  9. Balanced Contributions for Multi-Issue Allocation Situations

    NARCIS (Netherlands)

    Lorenzo-Freire, S.; Alonso-Meijide, J.M.; Casas-Mendez, B.; Hendrickx, R.L.P.

    2005-01-01

    In this paper we introduce a property of balanced contributions in the context of multi-issue allocation situations.Using this property, we characterise the run-to-thebank rule for multi-issue allocation situations.

  10. Optimal Joint Multiple Resource Allocation Method for Cloud Computing Environments

    CERN Document Server

    Kuribayashi, Shin-ichi

    2011-01-01

    Cloud computing is a model for enabling convenient, on-demand network access to a shared pool of configurable computing resources. To provide cloud computing services economically, it is important to optimize resource allocation under the assumption that the required resource can be taken from a shared resource pool. In addition, to be able to provide processing ability and storage capacity, it is necessary to allocate bandwidth to access them at the same time. This paper proposes an optimal resource allocation method for cloud computing environments. First, this paper develops a resource allocation model of cloud computing environments, assuming both processing ability and bandwidth are allocated simultaneously to each service request and rented out on an hourly basis. The allocated resources are dedicated to each service request. Next, this paper proposes an optimal joint multiple resource allocation method, based on the above resource allocation model. It is demonstrated by simulation evaluation that the p...

  11. Joint Power and Resource Allocation for Block-Fading Relay-Assisted Broadcast Channels

    CERN Document Server

    Shaqfeh, Mohammad

    2012-01-01

    We provide the solution for optimizing the power and resource allocation over block-fading relay-assisted broadcast channels in order to maximize the long term average achievable rates region of the users. The problem formulation assumes regenerative (repetition coding) decode-and-forward (DF) relaying strategy, long-term average total transmitted power constraint, orthogonal multiplexing of the users messages within the channel blocks, possibility to use a direct transmission (DT) mode from the base station to the user terminal directly or a relaying (DF) transmission mode, and partial channel state information. We show that our optimization problem can be transformed into an equivalent "no-relaying" broadcast channel optimization problem with each actual user substituted by two virtual users having different channel qualities and multiplexing weights. The proposed power and resource allocation strategies are expressed in closed-form that can be applied practically in centralized relay-assisted wireless netw...

  12. 30 CFR 206.459 - Allocation of washed coal.

    Science.gov (United States)

    2010-07-01

    ... 30 Mineral Resources 2 2010-07-01 2010-07-01 false Allocation of washed coal. 206.459 Section 206... MANAGEMENT PRODUCT VALUATION Indian Coal § 206.459 Allocation of washed coal. (a) When coal is subjected to washing, the washed coal must be allocated to the leases from which it was extracted. (b) When the...

  13. 30 CFR 206.260 - Allocation of washed coal.

    Science.gov (United States)

    2010-07-01

    ... 30 Mineral Resources 2 2010-07-01 2010-07-01 false Allocation of washed coal. 206.260 Section 206... MANAGEMENT PRODUCT VALUATION Federal Coal § 206.260 Allocation of washed coal. (a) When coal is subjected to washing, the washed coal must be allocated to the leases from which it was extracted. (b) When the...

  14. 17 CFR 256.01-11 - Methods of allocation.

    Science.gov (United States)

    2010-04-01

    ... 17 Commodity and Securities Exchanges 3 2010-04-01 2010-04-01 false Methods of allocation. 256.01... HOLDING COMPANY ACT OF 1935 General Instructions § 256.01-11 Methods of allocation. Indirect costs and... applicable and currently effective methods of allocation filed with the Commission. Both direct and...

  15. 26 CFR 1.456-3 - Method of allocation.

    Science.gov (United States)

    2010-04-01

    ... 26 Internal Revenue 6 2010-04-01 2010-04-01 false Method of allocation. 1.456-3 Section 1.456-3...) INCOME TAXES Taxable Year for Which Items of Gross Income Included § 1.456-3 Method of allocation. (a... method of aggregation and allocation is consistently followed....

  16. 48 CFR 1631.203-70 - Allocation techniques.

    Science.gov (United States)

    2010-10-01

    ... 48 Federal Acquisition Regulations System 6 2010-10-01 2010-10-01 true Allocation techniques. 1631... PRINCIPLES AND PROCEDURES Contracts With Commercial Organizations 1631.203-70 Allocation techniques. (a... preferred allocation technique is one that shows the consumption of resources in performance of...

  17. 26 CFR 1.455-3 - Method of allocation.

    Science.gov (United States)

    2010-04-01

    ... 26 Internal Revenue 6 2010-04-01 2010-04-01 false Method of allocation. 1.455-3 Section 1.455-3...) INCOME TAXES Taxable Year for Which Items of Gross Income Included § 1.455-3 Method of allocation. (a... reasonable manner, provided the method of aggregation and allocation is consistently followed....

  18. 10 CFR 490.703 - Biodiesel fuel use credit allocation.

    Science.gov (United States)

    2010-01-01

    ... 10 Energy 3 2010-01-01 2010-01-01 false Biodiesel fuel use credit allocation. 490.703 Section 490.703 Energy DEPARTMENT OF ENERGY ENERGY CONSERVATION ALTERNATIVE FUEL TRANSPORTATION PROGRAM Biodiesel Fuel Use Credit § 490.703 Biodiesel fuel use credit allocation. (a) DOE shall allocate to a fleet...

  19. 42 CFR 121.8 - Allocation of organs.

    Science.gov (United States)

    2010-10-01

    ... post-transplant, risk-adjusted patient and graft survival rates following transplantation, risk... together with the revised allocation policies. (2) Special rule for initial revision of liver allocation policies. When the OPTN transmits to the Secretary its initial revision of the liver allocation...

  20. 45 CFR 400.319 - Allocation of funds.

    Science.gov (United States)

    2010-10-01

    ... use welfare data as an additional factor in the allocation of targeted assistance funds if it so... population data in its allocation formula. (b) A State must assure that not less than 95 percent of the total... 45 Public Welfare 2 2010-10-01 2010-10-01 false Allocation of funds. 400.319 Section...

  1. Inventory Allocation for Online Graphical Display Advertising

    CERN Document Server

    Yang, Jian; Vassilvitskii, Sergei; Tomlin, John; Shanmugasundaram, Jayavel; Anastasakos, Tasos; Kennedy, Oliver

    2010-01-01

    We discuss a multi-objective/goal programming model for the allocation of inventory of graphical advertisements. The model considers two types of campaigns: guaranteed delivery (GD), which are sold months in advance, and non-guaranteed delivery (NGD), which are sold using real-time auctions. We investigate various advertiser and publisher objectives such as (a) revenue from the sale of impressions, clicks and conversions, (b) future revenue from the sale of NGD inventory, and (c) "fairness" of allocation. While the first two objectives are monetary, the third is not. This combination of demand types and objectives leads to potentially many variations of our model, which we delineate and evaluate. Our experimental results, which are based on optimization runs using real data sets, demonstrate the effectiveness and flexibility of the proposed model.

  2. The dynamics of farm land allocation

    DEFF Research Database (Denmark)

    Arnberg, Søren; Hansen, Lars Gårn

    This study develops a dynamic multi-output model of farmers’ crop allocation decisions that allows estimation of both short-run and long-run adjustments to a wide array of economic incentives. The method can be used to inform decision-makers about a number of issues including agricultural policy...... reform and environmental regulation. The model allows estimation of dynamic effects relating to price expectations adjustment, investment lags and crop rotation constraints. Estimation is based on micro-panel data from Danish farmers that includes acreage, output and variable input utilisation...... at the crop level. Results indicate that there are substantial differences between the shortrun and long-run land allocation behaviour of Danish farmers and that there are substantial differences in the time lags associated with different crops. Since similar farming conditions are found in northern Europe...

  3. Response-Adaptive Allocation for Circular Data.

    Science.gov (United States)

    Biswas, Atanu; Dutta, Somak; Laha, Arnab Kumar; Bakshi, Partho K

    2015-01-01

    Response-adaptive designs are used in phase III clinical trials to allocate a larger proportion of patients to the better treatment. Circular data is a natural outcome in many clinical trial setup, e.g., some measurements in opthalmologic studies, degrees of rotation of hand or waist, etc. There is no available work on response-adaptive designs for circular data. With reference to a dataset on cataract surgery we provide some response-adaptive designs where the responses are of circular nature and propose some test statistics for treatment comparison under adaptive data allocation procedure. Detailed simulation study and the analysis of the dataset, including redesigning the cataract surgery data, are carried out.

  4. Traffic resource allocation for complex networks

    Institute of Scientific and Technical Information of China (English)

    Ling Xiang; Hu Mao-Bin; Long Jian-Cheng; Ding Jian-Xun; Shi Qin

    2013-01-01

    In this paper,an optimal resource allocation strategy is proposed to enhance traffic dynamics in complex networks.The network resources are the total node packet-delivering capacity and the total link bandwidth.An analytical method is developed to estimate the overall network capacity by using the concept of efficient betweenness (ratio of algorithmic betweenness and local processing capacity).Three network structures (scale-free,small-world,and random networks) and two typical routing protocols (shortest path protocol and efficient routing protocol) are adopted to demonstrate the performance of the proposed strategy.Our results show that the network capacity is reversely proportional to the average path length for a particular routing protocol and the shortest path protocol can achieve the largest network capacity when the proposed resource allocation strategy is adopted.

  5. Maximizing Cloud Providers Revenues via Energy Aware Allocation Policies

    CERN Document Server

    Mazzucco, Michele; Deters, Ralph

    2011-01-01

    Cloud providers, like Amazon, offer their data centers' computational and storage capacities for lease to paying customers. High electricity consumption, associated with running a data center, not only reflects on its carbon footprint, but also increases the costs of running the data center itself. This paper addresses the problem of maximizing the revenues of Cloud providers by trimming down their electricity costs. As a solution allocation policies which are based on the dynamic powering servers on and off are introduced and evaluated. The policies aim at satisfying the conflicting goals of maximizing the users' experience while minimizing the amount of consumed electricity. The results of numerical experiments and simulations are described, showing that the proposed scheme performs well under different traffic conditions.

  6. A distributed resource allocation algorithm for many processes

    CERN Document Server

    Hesselink, Wim H

    2012-01-01

    Resource allocation is the problem that a process may enter a critical section CS of its code only when its resource requirements are not in conflict with those of other processes in their critical sections. For each execution of CS, these requirements are given anew. In the resource requirements, levels can be distinguished, such as e.g. read access or write access. We allow infinitely many processes that communicate by reliable asynchronous messages and have finite memory. A simple starvation-free solution is presented. Processes only wait for one another when they have conflicting resource requirements. The correctness of the solution is argued with invariants and temporal logic. It has been verified with the proof assistant PVS.

  7. Cognitive radio based optimal channel sensing and resources allocation

    Science.gov (United States)

    Vijayasarveswari, V.; Khatun, S.; Fakir, M. M.; Nayeem, M. N.; Kamarudin, L. M.; Jakaria, A.

    2017-03-01

    Cognitive radio (CR) is the latest type of wireless technoloy that is proposed to mitigate spectrum saturation problem. İn cognitve radio, secondary user will use primary user's spectrum during primary user's absence without interupting primary user's transmission. This paper focuses on practical cognitive radio network development process using Android based smart phone for the data transmission. Energy detector based sensing method was proposed and used here because it doesnot require primary user's information. Bluetooth and Wi-fi are the two available types of spectrum that was sensed for CR detection. Simulation showed cognitive radio network can be developed using Android based smart phones. So, a complete application was developed using Java based Android Eclipse program. Finally, the application was uploaded and run on Android based smart phone to form and verify CR network for channel sensing and resource allocation. The observed efficiency of the application was around 81%.

  8. Combined Rate and Power Allocation with Link Scheduling in Wireless Data Packet Relay Networks with Fading Channels

    Directory of Open Access Journals (Sweden)

    Subhrakanti Dey

    2007-08-01

    Full Text Available We consider a joint rate and power control problem in a wireless data traffic relay network with fading channels. The optimization problem is formulated in terms of power and rate selection, and link transmission scheduling. The objective is to seek high aggregate utility of the relay node when taking into account buffer load management and power constraints. The optimal solution for a single transmitting source is computed by a two-layer dynamic programming algorithm which leads to optimal power, rate, and transmission time allocation at the wireless links. We further consider an optimal power allocation problem for multiple transmitting sources in the same framework. Performances of the resource allocation algorithms including the effect of buffer load control are illustrated via extensive simulation studies.

  9. Combined Rate and Power Allocation with Link Scheduling in Wireless Data Packet Relay Networks with Fading Channels

    Directory of Open Access Journals (Sweden)

    Dey Subhrakanti

    2007-01-01

    Full Text Available We consider a joint rate and power control problem in a wireless data traffic relay network with fading channels. The optimization problem is formulated in terms of power and rate selection, and link transmission scheduling. The objective is to seek high aggregate utility of the relay node when taking into account buffer load management and power constraints. The optimal solution for a single transmitting source is computed by a two-layer dynamic programming algorithm which leads to optimal power, rate, and transmission time allocation at the wireless links. We further consider an optimal power allocation problem for multiple transmitting sources in the same framework. Performances of the resource allocation algorithms including the effect of buffer load control are illustrated via extensive simulation studies.

  10. Axioms for health care resource allocation

    DEFF Research Database (Denmark)

    Østerdal, Lars Peter

    2005-01-01

    This paper examines principles of health care resource allocation based on axioms for individual preferences and distributive justice. We establish axioms for representing individual preferences by quality-adjusted life years (QALYs), as well as axioms for existence of a social welfare function...... social welfare function with certain weights. Further, we give axioms for a social welfare function being a weighted sum of power transformations of individual QALYs...

  11. Legal briefing: organ donation and allocation.

    Science.gov (United States)

    Pope, Thaddeus Mason

    2010-01-01

    This issue's "Legal Briefing" column covers legal developments pertaining to organ donation and allocation. This topic has been the subject of recent articles in JCE. Organ donation and allocation have also recently been the subjects of significant public policy attention. In the past several months, legislatures and regulatory agencies across the United States and across the world have changed, or considered changing, the methods for procuring and distributing human organs for transplantation. Currently, in the U.S., more than 100,000 persons are waiting for organ transplantation. In China, more than 1.5 million people are waiting. Given the chronic shortage of available organs (especially kidneys and livers) relative to demand, the primary focus of most legal developments has been on increasing the rate of donation. These and related developments are usefully divided into the following 12 topical categories: 1. Revised Uniform Anatomical Gift Act. 2. Presumed Consent and Opt-Out. 3. Mandated Choice. 4. Donation after Cardiac Death. 5. Payment and Compensation. 6. Donation by Prisoners. 7. Donor Registries. 8. Public Education. 9. Other Procurement Initiatives. 10. Lawsuits and Liability. 11. Trafficking and Tourism. 12. Allocation and Distribution.

  12. Biomass Resource Allocation among Competing End Uses

    Energy Technology Data Exchange (ETDEWEB)

    Newes, E.; Bush, B.; Inman, D.; Lin, Y.; Mai, T.; Martinez, A.; Mulcahy, D.; Short, W.; Simpkins, T.; Uriarte, C.; Peck, C.

    2012-05-01

    The Biomass Scenario Model (BSM) is a system dynamics model developed by the U.S. Department of Energy as a tool to better understand the interaction of complex policies and their potential effects on the biofuels industry in the United States. However, it does not currently have the capability to account for allocation of biomass resources among the various end uses, which limits its utilization in analysis of policies that target biomass uses outside the biofuels industry. This report provides a more holistic understanding of the dynamics surrounding the allocation of biomass among uses that include traditional use, wood pellet exports, bio-based products and bioproducts, biopower, and biofuels by (1) highlighting the methods used in existing models' treatments of competition for biomass resources; (2) identifying coverage and gaps in industry data regarding the competing end uses; and (3) exploring options for developing models of biomass allocation that could be integrated with the BSM to actively exchange and incorporate relevant information.

  13. Outcome based state budget allocation for diabetes prevention programs using multi-criteria optimization with robust weights.

    Science.gov (United States)

    Mehrotra, Sanjay; Kim, Kibaek

    2011-12-01

    We consider the problem of outcomes based budget allocations to chronic disease prevention programs across the United States (US) to achieve greater geographical healthcare equity. We use Diabetes Prevention and Control Programs (DPCP) by the Center for Disease Control and Prevention (CDC) as an example. We present a multi-criteria robust weighted sum model for such multi-criteria decision making in a group decision setting. The principal component analysis and an inverse linear programming techniques are presented and used to study the actual 2009 budget allocation by CDC. Our results show that the CDC budget allocation process for the DPCPs is not likely model based. In our empirical study, the relative weights for different prevalence and comorbidity factors and the corresponding budgets obtained under different weight regions are discussed. Parametric analysis suggests that money should be allocated to states to promote diabetes education and to increase patient-healthcare provider interactions to reduce disparity across the US.

  14. Transmit Power Allocation for Physical Layer Security in Cooperative Multi-Hop Full-Duplex Relay Networks.

    Science.gov (United States)

    Lee, Jong-Ho; Sohn, Illsoo; Kim, Yong-Hwa

    2016-10-17

    In this paper, we consider a transmit power allocation problem for secure transmission in multi-hop decode-and-forward (DF) full-duplex relay (FDR) networks, where multiple FDRs are located at each hop and perform cooperative beamforming to null out the signal at multiple eavesdroppers. For a perfect self-interference cancellation (PSIC) case, where the self-interference signal at each FDR is completely canceled, we derive an optimal power allocation (OPA) strategy using the Karush-Kuhn-Tucker (KKT) conditions to maximize the achievable secrecy rate under an overall transmit power constraint. In the case where residual self-interferences exist owing to imperfect self-interference cancellation (ISIC), we also propose a transmit power allocation scheme using the geometric programming (GP) method. Numerical results are presented to verify the secrecy rate performance of the proposed power allocation schemes.

  15. Transmit Power Allocation for Physical Layer Security in Cooperative Multi-Hop Full-Duplex Relay Networks

    Directory of Open Access Journals (Sweden)

    Jong-Ho Lee

    2016-10-01

    Full Text Available In this paper, we consider a transmit power allocation problem for secure transmission in multi-hop decode-and-forward (DF full-duplex relay (FDR networks, where multiple FDRs are located at each hop and perform cooperative beamforming to null out the signal at multiple eavesdroppers. For a perfect self-interference cancellation (PSIC case, where the self-interference signal at each FDR is completely canceled, we derive an optimal power allocation (OPA strategy using the Karush-Kuhn-Tucker (KKT conditions to maximize the achievable secrecy rate under an overall transmit power constraint. In the case where residual self-interferences exist owing to imperfect self-interference cancellation (ISIC, we also propose a transmit power allocation scheme using the geometric programming (GP method. Numerical results are presented to verify the secrecy rate performance of the proposed power allocation schemes.

  16. An application of data mining classification and bi-level programming for optimal credit allocation

    Directory of Open Access Journals (Sweden)

    Seyed Mahdi Sadatrasou

    2015-01-01

    Full Text Available This paper investigates credit allocation policy making and its effect on economic development using bi-level programming. There are two challenging problems in bi-level credit allocation; at the first level government/public related institutes must allocate the credit strategically concerning sustainable development to regions and industrial sectors. At the second level, there are agent banks, which should allocate the credit tactically to individual applicants based on their own profitability and risk using their credit scoring models. There is a conflict of interest between these two stakeholders but the cooperation is inevitable. In this paper, a new bi-level programming formulation of the leader-follower game in association with sustainable development theory in the first level and data mining classifier at the second level is used to mathematically model the problem. The model is applied to a national development fund (NDF as a government related organization and one of its agent banks. A new algorithm called Bi-level Genetic fuzzy apriori Algorithm (BGFAA is introduced to solve the bilateral model. Experimental results are presented and compared with a unilateral policy making scenario by the leader. Findings show that although the objective functions of the leader are worse in the bilateral scenario but agent banks collaboration is attracted and guaranteed.

  17. Superframe Duration Allocation Schemes to Improve the Throughput of Cluster-Tree Wireless Sensor Networks

    Science.gov (United States)

    Leão, Erico; Montez, Carlos; Moraes, Ricardo; Portugal, Paulo; Vasques, Francisco

    2017-01-01

    The use of Wireless Sensor Network (WSN) technologies is an attractive option to support wide-scale monitoring applications, such as the ones that can be found in precision agriculture, environmental monitoring and industrial automation. The IEEE 802.15.4/ZigBee cluster-tree topology is a suitable topology to build wide-scale WSNs. Despite some of its known advantages, including timing synchronisation and duty-cycle operation, cluster-tree networks may suffer from severe network congestion problems due to the convergecast pattern of its communication traffic. Therefore, the careful adjustment of transmission opportunities (superframe durations) allocated to the cluster-heads is an important research issue. This paper proposes a set of proportional Superframe Duration Allocation (SDA) schemes, based on well-defined protocol and timing models, and on the message load imposed by child nodes (Load-SDA scheme), or by number of descendant nodes (Nodes-SDA scheme) of each cluster-head. The underlying reasoning is to adequately allocate transmission opportunities (superframe durations) and parametrize buffer sizes, in order to improve the network throughput and avoid typical problems, such as: network congestion, high end-to-end communication delays and discarded messages due to buffer overflows. Simulation assessments show how proposed allocation schemes may clearly improve the operation of wide-scale cluster-tree networks. PMID:28134822

  18. Constrained Control Design for Dynamic Positioning of Marine Vehicles with Control Allocation

    Directory of Open Access Journals (Sweden)

    Tristan Perez

    2009-04-01

    Full Text Available In this paper, we address the control design problem of positioning of over-actuated marine vehicles with control allocation. The proposed design is based on a combined position and velocity loops in a multi-variable anti-windup implementation together with a control allocation mapping. The vehicle modelling is considered with appropriate simplifications related to low-speed manoeuvring hydrodynamics and vehicle symmetry. The control design is considered together with a control allocation mapping. We derive analytical tuning rules based on requirements of closed-loop stability and performance. The anti- windup implementation of the controller is obtained by mapping the actuator-force constraint set into a constraint set for the generalized forces. This approach ensures that actuation capacity is not violated by constraining the generalized control forces; thus, the control allocation is simplified since it can be formulated as an unconstrained problem. The mapping can also be modified on-line based on actuator availability to provide actuator-failure accommodation. We provide a proof of the closed-loop stability and illustrate the performance using simulation scenarios for an open-frame underwater vehicle.

  19. Superframe Duration Allocation Schemes to Improve the Throughput of Cluster-Tree Wireless Sensor Networks.

    Science.gov (United States)

    Leão, Erico; Montez, Carlos; Moraes, Ricardo; Portugal, Paulo; Vasques, Francisco

    2017-01-27

    The use ofWireless Sensor Network (WSN) technologies is an attractive option to support wide-scale monitoring applications, such as the ones that can be found in precision agriculture, environmental monitoring and industrial automation. The IEEE 802.15.4/ZigBee cluster-tree topology is a suitable topology to build wide-scale WSNs. Despite some of its known advantages, including timing synchronisation and duty-cycle operation, cluster-tree networks may suffer from severe network congestion problems due to the convergecast pattern of its communication traffic. Therefore, the careful adjustment of transmission opportunities (superframe durations) allocated to the cluster-heads is an important research issue. This paper proposes a set of proportional Superframe Duration Allocation (SDA) schemes, based on well-defined protocol and timing models, and on the message load imposed by child nodes (Load-SDA scheme), or by number of descendant nodes (Nodes-SDA scheme) of each cluster-head. The underlying reasoning is to adequately allocate transmission opportunities (superframe durations) and parametrize buffer sizes, in order to improve the network throughput and avoid typical problems, such as: network congestion, high end-to-end communication delays and discarded messages due to buffer overflows. Simulation assessments show how proposed allocation schemes may clearly improve the operation of wide-scale cluster-tree networks.

  20. Superframe Duration Allocation Schemes to Improve the Throughput of Cluster-Tree Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Erico Leão

    2017-01-01

    Full Text Available The use ofWireless Sensor Network (WSN technologies is an attractive option to support wide-scale monitoring applications, such as the ones that can be found in precision agriculture, environmental monitoring and industrial automation. The IEEE 802.15.4/ZigBee cluster-tree topology is a suitable topology to build wide-scale WSNs. Despite some of its known advantages, including timing synchronisation and duty-cycle operation, cluster-tree networks may suffer from severe network congestion problems due to the convergecast pattern of its communication traffic. Therefore, the careful adjustment of transmission opportunities (superframe durations allocated to the cluster-heads is an important research issue. This paper proposes a set of proportional Superframe Duration Allocation (SDA schemes, based on well-defined protocol and timing models, and on the message load imposed by child nodes (Load-SDA scheme, or by number of descendant nodes (Nodes-SDA scheme of each cluster-head. The underlying reasoning is to adequately allocate transmission opportunities (superframe durations and parametrize buffer sizes, in order to improve the network throughput and avoid typical problems, such as: network congestion, high end-to-end communication delays and discarded messages due to buffer overflows. Simulation assessments show how proposed allocation schemes may clearly improve the operation of wide-scale cluster-tree networks.

  1. Optimally Joint Subcarrier Matching and Power Allocation in OFDM Multihop System

    Directory of Open Access Journals (Sweden)

    Wang Wenyi

    2008-01-01

    Full Text Available Orthogonal frequency division multiplexing (OFDM multihop system is a promising way to increase capacity and coverage. In this paper, we propose an optimally joint subcarrier matching and power allocation scheme to further maximize the total channel capacity with the constrained total system power. First, the problem is formulated as a mixed binary integer programming problem, which is prohibitive to find the global optimum in terms of complexity. Second, by making use of the equivalent channel power gain for any matched subcarrier pair, a low complexity scheme is proposed. The optimal subcarrier matching is to match subcarriers by the order of the channel power gains. The optimal power allocation among the matched subcarrier pairs is water-filling. An analytical argument is given to prove that the two steps achieve the optimally joint subcarrier matching and power allocation. The simulation results show that the proposed scheme achieves the largest total channel capacity as compared to the other schemes, where there is no subcarrier matching or no power allocation.

  2. Estimation of Distribution Algorithm for Resource Allocation in Green Cooperative Cognitive Radio Sensor Networks

    Directory of Open Access Journals (Sweden)

    Alagan Anpalagan

    2013-04-01

    Full Text Available Due to the rapid increase in the usage and demand of wireless sensor networks (WSN, the limited frequency spectrum available for WSN applications will be extremely crowded in the near future. More sensor devices also mean more recharging/replacement of batteries, which will cause significant impact on the global carbon footprint. In this paper, we propose a relay-assisted cognitive radio sensor network (CRSN that allocates communication resources in an environmentally friendly manner. We use shared band amplify and forward relaying for cooperative communication in the proposed CRSN. We present a multi-objective optimization architecture for resource allocation in a green cooperative cognitive radio sensor network (GC-CRSN. The proposed multi-objective framework jointly performs relay assignment and power allocation in GC-CRSN, while optimizing two conflicting objectives. The first objective is to maximize the total throughput, and the second objective is to minimize the total transmission power of CRSN. The proposed relay assignment and power allocation problem is a non-convex mixed-integer non-linear optimization problem (NC-MINLP, which is generally non-deterministic polynomial-time (NP-hard. We introduce a hybrid heuristic algorithm for this problem. The hybrid heuristic includes an estimation-of-distribution algorithm (EDA for performing power allocation and iterative greedy schemes for constraint satisfaction and relay assignment. We analyze the throughput and power consumption tradeoff in GC-CRSN. A detailed analysis of the performance of the proposed algorithm is presented with the simulation results.

  3. Patient preferences, knowledge and beliefs about kidney allocation: qualitative findings from the UK-wide ATTOM programme

    Science.gov (United States)

    Cinnirella, Marco; Bayfield, Janet; Wu, Diana; Draper, Heather; Johnson, Rachel J; Tomson, Charles R V; Forsythe, John L R; Metcalfe, Wendy; Fogarty, Damian; Roderick, Paul; Ravanan, Rommel; Oniscu, Gabriel C; Watson, Christopher J E; Bradley, J Andrew; Bradley, Clare

    2017-01-01

    Objective To explore how patients who are wait-listed for or who have received a kidney transplant understand the current UK kidney allocation system, and their views on ways to allocate kidneys in the future. Design Qualitative study using semistructured interviews and thematic analysis based on a pragmatic approach. Participants 10 deceased-donor kidney transplant recipients, 10 live-donor kidney transplant recipients, 12 participants currently wait-listed for a kidney transplant and 4 participants whose kidney transplant failed. Setting Semistructured telephone interviews conducted with participants in their own homes across the UK. Results Three main themes were identified: uncertainty of knowledge of the allocation scheme; evaluation of the system and participant suggestions for future allocation schemes. Most participants identified human leucocyte anitgen matching as a factor in determining kidney allocation, but were often uncertain of the accuracy of their knowledge. In the absence of information that would allow a full assessment, the majority of participants consider that the current system is effective. A minority of participants were concerned about the perceived lack of transparency of the general decision-making processes within the scheme. Most participants felt that people who are younger and those better matched to the donor kidney should be prioritised for kidney allocation, but in contrast to the current scheme, less priority was considered appropriate for longer waiting patients. Some non-medical themes were also discussed, such as whether parents of dependent children should be prioritised for allocation, and whether patients with substance abuse problems be deprioritised. Conclusions Our participants held differing views about the most important factors for kidney allocation, some of which were in contrast to the current scheme. Patient participation in reviewing future allocation policies will provide insight as to what is considered

  4. Adaptive Power and Bit Allocation in Multicarrier Systems

    Institute of Scientific and Technical Information of China (English)

    HUO Yong-qing; PENG Qi-cong; SHAO Huai-zong

    2007-01-01

    We present two adaptive power and bit allocation algorithms for multicarrier systems in a frequency selective fading environment. One algorithm allocates bit based on maximizing the channel capacity, another allocates bit based on minimizing the bit-error-rate(BER). Two algorithms allocate power based on minimizing the BER. Results show that the proposed algorithms are more effective than Fischer's algorithm at low average signal-to-noise ration (SNR). This indicates that our algorithms can achieve high spectral efficiency and high communication reliability during bad channel state. Results also denote the bit and power allocation of each algorithm and effects of the number of subcarriers on the BER performance.

  5. Cognitive radio resource allocation based on coupled chaotic genetic algorithm

    Institute of Scientific and Technical Information of China (English)

    Zu Yun-Xiao; Zhou Jie; Zeng Chang-Chang

    2010-01-01

    A coupled chaotic genetic algorithm for cognitive radio resource allocation which is based on genetic algorithm and coupled Logistic map is proposed. A fitness function for cognitive radio resource allocation is provided. Simulations are conducted for cognitive radio resource allocation by using the coupled chaotic genetic algorithm, simple genetic algorithm and dynamic allocation algorithm respectively. The simulation results show that, compared with simple genetic and dynamic allocation algorithm, coupled chaotic genetic algorithm reduces the total transmission power and bit error rate in cognitive radio system, and has faster convergence speed.

  6. Cognitive radio resource allocation based on coupled chaotic genetic algorithm

    Science.gov (United States)

    Zu, Yun-Xiao; Zhou, Jie; Zeng, Chang-Chang

    2010-11-01

    A coupled chaotic genetic algorithm for cognitive radio resource allocation which is based on genetic algorithm and coupled Logistic map is proposed. A fitness function for cognitive radio resource allocation is provided. Simulations are conducted for cognitive radio resource allocation by using the coupled chaotic genetic algorithm, simple genetic algorithm and dynamic allocation algorithm respectively. The simulation results show that, compared with simple genetic and dynamic allocation algorithm, coupled chaotic genetic algorithm reduces the total transmission power and bit error rate in cognitive radio system, and has faster convergence speed.

  7. Performance evaluation of sensor allocation algorithm based on covariance control

    Institute of Scientific and Technical Information of China (English)

    2005-01-01

    The covariance control capability of sensor allocation algorithms based on covariance control strategy is an important index to evaluate the performance of these algorithms. Owing to lack of standard performance metric indices to evaluate covariance control capability, sensor allocation ratio, etc, there are no guides to follow in the design procedure of sensor allocation algorithm in practical applications. To meet these demands, three quantified performance metric indices are presented, which are average covariance misadjustment quantity (ACMQ), average sensor allocation ratio (ASAR) and matrix metric influence factor (MMIF), where ACMQ, ASAR and MMIF quantify the covariance control capability, the usage of sensor resources and the robustness of sensor allocation algorithm, respectively. Meanwhile, a covariance adaptive sensor allocation algorithm based on a new objective function is proposed to improve the covariance control capability of the algorithm based on information gain. The experiment results show that the proposed algorithm have the advantage over the preceding sensor allocation algorithm in covariance control capability and robustness.

  8. CHANNEL DE-ALLOCATION SCHEMES FOR GSM/GPRS NETWORKS

    Institute of Scientific and Technical Information of China (English)

    Jiang Tigang; Fan Pingzhi; Kam Yiu Lam

    2005-01-01

    Several channel de-allocation schemes for GSM/GPRS(General Packet Radio Service) networks are proposed in this paper. For DRA (Dynamical Resource Allocation) with de-allocation mechanism, if a new voice call arrives and finds that all the channels are busy,then one of the GPRS packets which occupy more than one channel for data transmission may release a channel for the new voice call. This paper presents 5 de-allocation mechanisms, i.e.DA-RANDOM, DA-RICHEST, DA-POOREST, DA-OLDEST and DA-YOUNGEST, to select the GPRS packet for releasing the appropriate channel. Simulation results show that DAOLDEST achieves the best performance, especially in packets blocking probability, among all the de-allocation schemes. Although the performance of the proposed de-allocation schemes is not significantly different, they are all much better than that of the scheme without de-allocation.

  9. Pollution permits allocation and imperfect competition; Allocation de permis de pollution et concurrence imparfaite

    Energy Technology Data Exchange (ETDEWEB)

    Schwartz, S.

    2004-12-15

    The aim of this thesis is to highlight the imperfections on the permits markets and to analyze their consequences on markets' efficiency. More precisely, we try to identify the implications of the initial allocation of permits when such imperfections are present. We try to draw some conclusions for the regulator concerning the different forms of the permits' allocation. After having described and compared these forms, we define in which circumstances the initial allocation matters in terms of efficiency. Then, we study different forms of imperfections. First, we take into account the information asymmetry between firms and the regulator and we define an optimal mechanism to sell pollution permits. Then, we analyze a market power on a differentiated pollution permits market. At last, we study the exclusionary manipulation of pollution permits market. (author)

  10. A Method for Source-load Allocation of Nutrients in Agricultural Watersheds

    Science.gov (United States)

    Burkart, M. R.; James, D. E.

    2001-12-01

    Identification of pollutant sources is critical to solving water resource contamination problems. Non-point sources of agricultural pollution provide substantial challenges to quantifying and allocating the sources of contaminants to streams. A method is presented for identifying the spatial variability of nitrogen and phosphorus sources and allocating proportional responsibility for source-reduction. The method is applied to data at scales ranging from hydrologic regions (2-digit hydrologic accounting units) of the Mississippi drainage basin to the public land survey grid in two small (14-digit) watersheds. A mass balance of nutrient sources and losses is estimated using georeferenced data derived from national to local digital data bases. Nitrogen excess is estimated by balancing sources associated with inorganic fertilizer, manure, crop fixation, mineralization of organic matter, and atmospheric redeposition of ammonia with losses from crop harvest, plant senescence, denitrification, and volatilization of manure and inorganic fertilizer. Phosphorus sources from inorganic fertilizer and manure are balanced with losses due to crop harvest. Allocation in regional units allows targeting of major pollutant source areas while smaller aggregation areas define greater ranges of source-loads useful for specific allocation. Manure sources control the distribution of excess nutrients at many scales, particularly in watersheds with uniform cropping systems. Absolute values of excess N sources provide substantially different allocation patterns than proportional values of total source-loads. Selection of aggregation scale is critical to source-load allocation needed to define TMDLs, monitor loads, and establish water-quality remediation strategies. >http://www.nstl.gov/pubs/burkart/trends/index.html

  11. Aplicação da relaxação lagrangeana e do algoritmo genético construtivo na solução do problema probabilístico de localização-alocação de máxima cobertura Application of lagrangian relaxation and the constructive genetic algorithm to solve the probabilistic problem of maximum location-allocation coverage

    Directory of Open Access Journals (Sweden)

    Francisco de Assis Corrêa

    2006-05-01

    Full Text Available O problema de localização de máxima cobertura (MCLP procura localizar facilidades visando a maximizar a população atendida, considerando uma dada distância ou tempo padrão de serviço. Várias extensões desse modelo têm sido propostas para aumentar a sua aplicabilidade. Entre elas, existem modelos probabilísticos para localização-alocação de máxima cobertura com restrições no tempo de espera ou no comprimento da fila para sistemas congestionados, que levam em conta um ou vários servidores por facilidade. A proposta deste trabalho é a de resolver um modelo para um servidor por facilidade por meio da relaxação lagrangeana e do Algoritmo Genético Construtivo. Os resultados dos testes obtidos nessas abordagens são apresentados e comparados.The Maximal Covering Location Problem (MCLP seeks to locate facilities in order to maximize the serviced population, considering a given distance or standard service time. Various extensions of this model have been proposed to enhance its applicability, e.g., probabilistic models for maximum location-allocation coverage with waiting time or queue length constraints for congested systems, taking into account one or more servers per service center. In this paper we present two procedures for solving a probabilistic model, which considers one server per center, using Lagrangian relaxation and the Constructive Genetic Algorithm. Extensive tests of these approaches are presented and their results compared.

  12. Problem Solving

    Science.gov (United States)

    Kinsella, John J.

    1970-01-01

    Discussed are the nature of a mathematical problem, problem solving in the traditional and modern mathematics programs, problem solving and psychology, research related to problem solving, and teaching problem solving in algebra and geometry. (CT)

  13. Optimum Allocation of Water to the Cultivation Farms Using Genetic Algorithm

    Science.gov (United States)

    Saeidian, B.; Saadi Mesgari, M.; Ghodousi, M.

    2015-12-01

    The water scarcity crises in the world and specifically in Iran, requires the proper management of this valuable resource. According to the official reports, around 90 percent of the water in Iran is used for agriculture. Therefore, the adequate management and usage of water in this section can help significantly to overcome the above crises. The most important aspect of agricultural water management is related to the irrigation planning, which is basically an allocation problem. The proper allocation of water to the farms is not a simple and trivial problem, because of the limited amount of available water, the effect of different parameters, nonlinear characteristics of the objective function, and the wideness of the solution space. Usually To solve such complex problems, a meta-heuristic method such as genetic algorithm could be a good candidate. In this paper, Genetic Algorithm (GA) is used for the allocation of different amount of water to a number of farms. In this model, the amount of water transferable using canals of level one, in one period of irrigation is specified. In addition, the amount of water required by each farm is calculated using crop type, stage of crop development, and other parameters. Using these, the water production function of each farm is determined. Then, using the water production function, farm areas, and the revenue and cost of each crop type, the objective function is calculated. This objective function is used by GA for the allocation of water to the farms. The objective function is defined such that the economical profit extracted from all farms is maximized. Moreover, the limitation related to the amount of available water is considered as a constraint. In general, the total amount of allocated water should be less than the finally available water (the water transferred trough the level one canals). Because of the intensive scarcity of water, the deficit irrigation method are considered. In this method, the planning is on the

  14. 铁路编组站动态配流的约束传播和多点构建性搜索的混合算法%Hybrid Algorithm of Constraint Propagation and Multi-point Constructive Search for the Dynamic Wagon-flow Allocation Problem at a Railway Marshalling Station

    Institute of Scientific and Technical Information of China (English)

    马亮; 郭进; 陈光伟; 郭瑞

    2015-01-01

    为了提高动态配流模型的通用性和稳定性,基于约束程序累积调度和字典序多目标优化,以作业之间实施逻辑和优先级关系、班计划和列车编组计划要求、资源容量限制等为约束,按照配流成功的出发列车优先级总和最大、车辆平均中停时最小和资源利用率最高3个目标的优先级,建立适应于不同解体方式的动态配流字典序多目标累积调度的3层模型。为提高算法效率,设计了约束传播和多点构建性搜索混合的带初始解迭代算法,每层先通过约束传播算法化简模型,再通过带约束传播的多点构建性搜索算法快速求解,以决策出优化的作业排程和配流方案。实验表明,模型扩展性更强、更稳定、更符合现场实际;算法效率高,能够满足现场对计划编制和调整的实施性需求。%To improve the versatility and stability of the dynamic wagon-flow allocation model,the dynamic wagon-flow allocation lexicographic multi-objective cumulative scheduling model is set up to maximize the sum of priority of the departure trains,minimize the average residence time of the cars,and maximize the resource utilization,based on the theory of constraint programming cumulative scheduling and lexicographic multi-objective optimization.In this model,the precedence and logical relationship among traffic jobs,the demands of the train shift plan and the train formation plan,and the capacity limit of the resources are all taken into account as constraints.The model is then be adapted for different disassembly modes and is divided into three sub-layers,according to the lexicographic or-der of the three objectives.Then,the optimized schemes of job scheduling and wagon-flow allocation are received by solving the model iteratively,using the hybrid algorithm of constraint propagation and multi-point constructive search.In each sub-layer,the search space is initially reduced by constraint

  15. [Ethical problems in organ transplantation].

    Science.gov (United States)

    Valenta, J; Treska, V; Hasman, D

    1999-02-01

    Organ transplantation is an accepted therapeutic method with good results, but it is connected with many not only medical but also ethical problems. One of the most important problems is the donor programme. In cadaverous donors the main ethical and legal question is the decision who can issue the consent with organ retrieval; in living donors it is the problem of motivation and financial compensation. Allocation of organs with low compatibility or from non-ideal donors, and the recipient's consent in these cases may involve difficult decisions.

  16. Cooperative Precoding/Resource Allocation Games under Spectral Mask and Total Power Constraints

    CERN Document Server

    Gao, Jie; Jiang, Hai

    2009-01-01

    The use of orthogonal signaling schemes such as time-, frequency-, or code-division multiplexing (T-, F-, CDM) in multi-user systems allows for power-efficient simple receivers. It is shown in this paper that by using orthogonal signaling on frequency selective fading channels, the cooperative Nash bargaining (NB)-based precoding games for multi-user systems, which aim at maximizing the information rates of all users, are simplified to the corresponding cooperative resource allocation games. The latter provides additional practically desired simplifications to transmitter design and significantly reduces the overhead during user cooperation. The complexity of the corresponding precoding/resource allocation games, however, depends on the constraints imposed on the users. If only spectral mask constraints are present, the corresponding cooperative NB problem can be formulated as a convex optimization problem and solved efficiently in a distributed manner using dual decomposition based algorithm. However, the NB...

  17. Optimal Scheduling for Fair Resource Allocation in Ad Hoc Networks with Elastic and Inelastic Traffic

    CERN Document Server

    Jaramillo, Juan Jose

    2009-01-01

    This paper studies the problem of congestion control and scheduling in ad hoc wireless networks that have to support a mixture of best-effort and real-time traffic. Optimization and stochastic network theory have been successful in designing architectures for fair resource allocation to meet long-term throughput demands. However, to the best of our knowledge, strict packet delay deadlines were not considered in this framework previously. In this paper, we propose for the first time a model for incorporating the quality of service (QoS) requirements of packets with deadlines in the optimization framework. The solution to the problem results in a joint congestion control and scheduling algorithm which fairly allocates resources to meet the fairness objectives of both elastic and inelastic flows, and per-packet delay requirements of inelastic flows.

  18. Graph theoretical stable allocation as a tool for reproduction of control by human operators

    Science.gov (United States)

    van Nooijen, Ronald; Ertsen, Maurits; Kolechkina, Alla

    2016-04-01

    During the design of central control algorithms for existing water resource systems under manual control it is important to consider the interaction with parts of the system that remain under manual control and to compare the proposed new system with the existing manual methods. In graph theory the "stable allocation" problem has good solution algorithms and allows for formulation of flow distribution problems in terms of priorities. As a test case for the use of this approach we used the algorithm to derive water allocation rules for the Gezira Scheme, an irrigation system located between the Blue and White Niles south of Khartoum. In 1925, Gezira started with 300,000 acres; currently it covers close to two million acres.

  19. Optimal Resource Allocation and Relay Selection in Bandwidth and Time Exchange Based Cooperative Forwarding

    CERN Document Server

    Islam, Muhammad Nazmul; Kompella, Sastry

    2011-01-01

    In this paper, we investigate joint optimal relay selection and resource allocation that are fundamental to the understanding of bandwidth exchange (BE) and time exchange (TE) enabled incentivized cooperative forwarding in wireless networks. We consider a network where N nodes transmit data in the uplink to an access point (AP) or base station (BS). We first consider the scenario where each node gets an initial amount (equal, optimal or arbitrary) of resource in the form of bandwidth or time, and uses this resource as a flexible incentive for two hop relaying. We focus on ?-fair network utility maximization (NUM) and total power minimization in this environment. For both BE and TE, we show the concavity or convexity of the resource allocation problem for a fixed relay set. Defining the link weights of each relay pair as the utility gain due to cooperation (over noncooperation), we show that the optimal relay selection, often a combinatorially cumbersome problem, reduces to the maximum weighted matching (MWM) ...

  20. A Stochastic Flows Approach for Asset Allocation with Hidden Economic Environment

    Directory of Open Access Journals (Sweden)

    Tak Kuen Siu

    2015-01-01

    Full Text Available An optimal asset allocation problem for a quite general class of utility functions is discussed in a simple two-state Markovian regime-switching model, where the appreciation rate of a risky share changes over time according to the state of a hidden economy. As usual, standard filtering theory is used to transform a financial model with hidden information into one with complete information, where a martingale approach is applied to discuss the optimal asset allocation problem. Using a martingale representation coupled with stochastic flows of diffeomorphisms for the filtering equation, the integrand in the martingale representation is identified which gives rise to an optimal portfolio strategy under some differentiability conditions.