WorldWideScience

Sample records for berth allocation problem

  1. A VIEW OF THE BERTH ALLOCATION PROBLEM

    OpenAIRE

    Vanina Macowski Durski Silva; Antônio Sérgio Coelho

    2007-01-01

    The purpose of this article is to verify the available scientific research in one of the prevalent problems associated with port services. Most of the studies about ports focus on strategic and tactical problems, thus, there exists a large volume of papers with operational research applications about container operations. Since the majority of the berths are managed and operated by private shipping companies, few studies have been conducted on berth allocation. Therefore, the m...

  2. The Tactical Berth Allocation Problem: integrated optimization in container terminals

    OpenAIRE

    Vacca, Ilaria; Salani, Matteo; Bierlaire, Michel

    2010-01-01

    In the context of container terminal operations, the simultaneous optimization of decision problems that are usually solved hierarchically by terminal's planners represents nowadays a promising research trend. In this talk we introduce the Tactical Berth Allocation Problem (TBAP), that deals with the integration of the berth allocation problem (BAP) and the quay crane assignment problem (QCAP). The objective is to schedule incoming ships over a time horizon, assigning them a berthing position...

  3. 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...... 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....

  4. 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...

  5. Models for the Discrete Berth Allocation Problem: A Computational Comparison

    DEFF Research Database (Denmark)

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

    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 the three main models of the discrete dynamic berth allocation...

  6. Models for the Discrete Berth Allocation Problem: A Computational Comparison

    OpenAIRE

    Buhrkal, Katja; Zuglian, Sara; Røpke, Stefan; Larsen, Jesper; Lusby, Richard Martin

    2009-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 the three main models of the discrete dynamic berth allocation 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 setpartitioning mo...

  7. Solving the dynamic berth allocation problem by simulated annealing

    Science.gov (United States)

    Lin, Shih-Wei; Ting, Ching-Jung

    2014-03-01

    Berth allocation, the first operation when vessels arrive at a port, is one of the major container port optimization problems. From both the port operator's and the ocean carriers' perspective, minimization of the time a ship spends at berth is a key goal of port operations. This article focuses on two versions of the dynamic berth allocation problem (DBAP): discrete and continuous cases. The first case assigns ships to a given set of berth positions; the second one permits them to be moored anywhere along the berth. Simulated annealing (SA) approaches are proposed to solve the DBAP. The proposed SAs are tested with numerical instances for different sizes from the literature. Experimental results show that the proposed SA can obtain the optimal solutions in all instances of discrete cases and update 27 best known solutions in the continuous case.

  8. Modeling and Solving the Tactical Berth Allocation Problem

    OpenAIRE

    Giallombardo, Giovanni; Moccia, Luigi; Salani, Matteo; Vacca, Ilaria

    2009-01-01

    In this paper we integrate at the tactical level two decision problems arising in container terminals: the berth allocation problem, which consists of assigning and scheduling incoming ships to berthing positions, and the quay crane assignment problem, which assigns to incoming ships a certain QC profile (i.e. number of quay cranes per working shift). We present two formulations: a mixed integer quadratic program and a linearization which reduces to a mixed integer linear program. The objec...

  9. Recursive column generation for the Tactical Berth Allocation Problem

    OpenAIRE

    Vacca, Ilaria; Salani, Matteo; Bierlaire, Michel

    2010-01-01

    Seaport container terminals are source of many interesting large-scale optimization problems, that arise in the management of operations at several decision levels. In this work we study exact methods to solve the Tactical Berth Allocation Problem with Quay Crane Assignment, an integrated decision problem that occurs in the management of the quayside resources. We reformulate the problem via Dantzig-Wolfe and present an exact solution approach based on column generation that exploits the prob...

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

    OpenAIRE

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

    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 se...

  11. The berth allocation problem: Optimizing vessel arrival time

    OpenAIRE

    Mihalis M Golias; Georgios K Saharidis; Maria Boile; Sotirios Theofanis; Ierapetritou, Marianthi G.

    2009-01-01

    The berth scheduling problem deals with the assignment of vessels to berths in a marine terminal, with the objective to maximize the ocean carriers’ satisfaction (minimize delays) and/or minimize the terminal operator's costs. In the existing literature, two main assumptions are made regarding the status of a vessel: (a) either all vessels to be served are already in the port before the planning period starts, or (b) they are scheduled to arrive after the planning period starts. The latter ca...

  12. Robust Scheduling for Berth Allocation and Quay Crane Assignment Problem

    Directory of Open Access Journals (Sweden)

    M. Rodriguez-Molins

    2014-01-01

    Full Text Available Decision makers must face the dynamism and uncertainty of real-world environments when they need to solve the scheduling problems. Different incidences or breakdowns, for example, initial data could change or some resources could become unavailable, may eventually cause the infeasibility of the obtained schedule. To overcome this issue, a robust model and a proactive approach are presented for scheduling problems without any previous knowledge about incidences. This paper is based on proportionally distributing operational buffers among the tasks. In this paper, we consider the berth allocation problem and the quay crane assignment problem as a representative example of scheduling problems. The dynamism and uncertainty are managed by assessing the robustness of the schedules. The robustness is introduced by means of operational buffer times to absorb those unknown incidences or breakdowns. Therefore, this problem becomes a multiobjective combinatorial optimization problem that aims to minimize the total service time, to maximize the buffer times, and to minimize the standard deviation of the buffer times. To this end, a mathematical model and a new hybrid multiobjective metaheuristic is presented and compared with two well-known multiobjective genetic algorithms: NSGAII and SPEA2+.

  13. Artificial Intelligence Techniques for the Berth Allocation and Container Stacking Problems in Container Terminals

    Science.gov (United States)

    Salido, Miguel A.; Rodriguez-Molins, Mario; Barber, Federico

    The Container Stacking Problem and the Berth Allocation Problem are two important problems in maritime container terminal's management which are clearly related. Terminal operators normally demand all containers to be loaded into an incoming vessel should be ready and easily accessible in the terminal before vessel's arrival. Similarly, customers (i.e., vessel owners) expect prompt berthing of their vessels upon arrival. In this paper, we present an artificial intelligence based-integrated system to relate these problems. Firstly, we develop a metaheuristic algorithm for berth allocation which generates an optimized order of vessel to be served according to existing berth constraints. Secondly, we develop a domain-oriented heuristic planner for calculating the number of reshuffles needed to allocate containers in the appropriate place for a given berth ordering of vessels. By combining these optimized solutions, terminal operators can be assisted to decide the most appropriated solution in each particular case.

  14. 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. PMID:25295295

  15. 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.

  16. A Contribution to Berth Allocation Problem Solution with Draft Restrictions

    OpenAIRE

    Grubišić, Neven; Vilke, Siniša; Barić, Mate

    2015-01-01

    Models for berth assignments help to solve logistic problems in container terminals and are important decision making tools. This is particularly so where, because of the system complexity and vessels arrival rate, problems cannot be solved empirically. Another issue concerns potential infrastructure and equipment shortcomings, where high utilization of the existing system components is required. In this paper, the authors focus on draft or depth restrictions that may occur alongside a ...

  17. The Tactical Berth Allocation Problem with QC Assignment and Transshipment Costs

    OpenAIRE

    Giallombardo, Giovanni; Moccia, Luigi; Salani, Matteo; Vacca, Ilaria

    2009-01-01

    In this work we integrate at the tactical level two decision problems arising in container terminals: the berth allocation problem, which consists of assigning and scheduling incoming ships to berthing positions, and the quay crane assignment problem, which assigns to incoming ships a certain QC profile (i.e. number of quay cranes per working shift). We present two formulations: a mixed integer quadratic program and a linearization which reduces to a mixed integer linear program. The objectiv...

  18. The Berth Allocation Problem with Service Time and Delay Time Objectives

    OpenAIRE

    Akio Imai; Jin-Tao Zhang; Etsuko Nishimura; Stratos Papadimitriou

    2007-01-01

    This study addresses a two-objective berth allocation problem: ship service quality expressed by the minimisation of delay in ships' departure and berth utilisation expressed by the minimisation of the total service time. In this problem, noninferior solutions are expected to be identified. Two heuristics, which are implemented based on two existing procedures of the subgradient optimisation and genetic algorithm, are proposed for solving this problem. Through numerical experiments, it was fo...

  19. An enriched model for the integrated berth allocation and quay crane assignment problem

    OpenAIRE

    B. RAA; Dullaert, W.; R. VAN SCHAEREN

    2009-01-01

    Given the increasing pressure to improve the efficiency of container terminals, a lot of research efforts have been devoted to optimizing container terminal operations. Most papers deal with either the Berth Allocation Problem (BAP) or the (Quay) Crane Assignment Problem (CAP). In the literature, handling times are often simplified to be berth dependent or proportional to vessel size to ignore the CAP when scheduling vessels. This is unsatisfactory for real-life applications because the handl...

  20. A two-phase genetic algorithm for the berth and quay crane allocation and scheduling problem

    OpenAIRE

    A. PONOMAREV; Dullaert, W.; B. RAA

    2010-01-01

    This paper presents a hybrid genetic algorithm for a dynamic continuous berth allocation and quay crane scheduling problem. In the first phase of the algorithm, vessels are positioned at berthing locations and quay cranes are assigned to vessels using novel crane assignment heuristics. In the second phase, cranes are scheduled to minimize the distance travelled in repositioning the cranes. The solution approach is tested on benchmarks derived from real-life data, with varying levels of capaci...

  1. 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

  2. The berth allocation problem: a formulation reflecting time Window service deadlines

    OpenAIRE

    Golias, Mihalis; Boile, Maria; Theofanis, Sotirios

    2007-01-01

    The berth-allocation problem (BAP) aims to optimally schedule and assign vessels to berthing areas along a quay. The vessels arrive at the port over a period of time and normally request service and departure within a time window. These time windows are usually determined through contractual agreements between the port operator and the carrier, in terms of time of departure after the vessel’s arrival at the port. Formulations presented in the current literature, reduce the time window to a po...

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

    OpenAIRE

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

    2015-01-01

    Most of the operational problems in container terminals are strongly interconnected. In this paper, we study the integrated Berth Allocation and Quay Crane Assignment Problem in seaport container terminals. We will extend the current state-of-the-art by proposing novel set partitioning models. 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 i...

  4. 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

    Most of the operational problems in container terminals are strongly interconnected. In this paper, we study the integrated Berth Allocation and Quay Crane Assignment Problem in seaport container terminals. We will extend the current state-of-the-art by proposing novel set partitioning models. 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 that...

  5. Models and Heuristics for the Tactical Berth Allocation Problem with Quay-Crane Assignment and Transshipment Quadratic Costs

    OpenAIRE

    Giallombardo, Giovanni; Moccia, Luigi; Salani, Matteo; Vacca, Ilaria

    2009-01-01

    In this work, we focus on the integration of two problems arising in the management of transshipment container terminals: the problem of assigning and scheduling incoming ships to berthing positions (berth allocation problem), and the problem of assigning quay cranes to incoming ships (quay crane assignment problem). In particular, motivated by the practice in the negotiation process between the terminal management and the shipping liner, the model is based on the concept of quay-crane assign...

  6. Models and Heuristics for the Tactical Berth Allocation Problem with Quay-Crane Assignment and Transshipment Costs

    OpenAIRE

    Giallombardo, Giovanni; Moccia, Luigi; Salani, Matteo; Vacca, Ilaria

    2009-01-01

    In the context of international sea-freight container transport, we study an integrated decision problem arising in container terminal management. We consider the integration of the Berth Allocation Problem (BAP), which consists of assigning and scheduling incoming ships to berthing positions, and the Quay Crane Assignment Problem (QCAP), which assigns to incoming ships a certain QC profile (i.e. number of quay cranes per working shift). BAP and QCAP are strictly correlated, since the QC prof...

  7. Robust Scheduling for Berth Allocation and Quay Crane Assignment Problem

    OpenAIRE

    2014-01-01

    Decision makers must face the dynamism and uncertainty of real-world environments when they need to solve the scheduling problems. Different incidences or breakdowns, for example, initial data could change or some resources could become unavailable, may eventually cause the infeasibility of the obtained schedule. To overcome this issue, a robust model and a proactive approach are presented for scheduling problems without any previous knowledge about incidences. This paper is based on proporti...

  8. Development of integrated model for continuous berth allocation problem and quay crane scheduling with non crossing constraint

    Science.gov (United States)

    Basri, Azyanzuhaila Hasan; Zainuddin, Zaitul Marlizawati

    2014-09-01

    High efficiency of port operation is required to succeed in the competition between port container terminals. Berth Allocation and Quay Crane Scheduling are the most important part in container terminal operations. The integrated model is formulated as a MIP problem with the objective to minimize the sum of the dwell times, where a vessel's dwell time is measured between arrival and departure including both times waiting to be berthed and servicing time while berthed. The construction of suitable mathematical model is formulated by considering various practical constraints.

  9. Berth Allocation Problem with Quay Crane Assignment for Container Terminals Based on Rolling-Horizon Strategy

    OpenAIRE

    2014-01-01

    In order to solve the large-scale integral dynamic scheduling of continuous berths and quay cranes problem, a method based on rolling-horizon strategy is proposed. A multiobjective optimization model that is established minimizes the total penalty costs considering vessels’ deviations to their preferred berthing positions, delayed times for berthing comparing to their estimated arrival times, and delayed times for departure comparing to their estimated departure times. Then, the scheduling pr...

  10. 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

    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 diffe......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......-shaking neighborhood search is presented. The proposed algorithms are tested and validated through numerical experiments based on instances inspired from real bulk port data. The results indicate that the algorithms can be successfully used to solve instances containing up to 40 vessels within reasonable computational...

  11. Berth Allocation Problem with Quay Crane Assignment for Container Terminals Based on Rolling-Horizon Strategy

    Directory of Open Access Journals (Sweden)

    Ling Xiao

    2014-01-01

    Full Text Available In order to solve the large-scale integral dynamic scheduling of continuous berths and quay cranes problem, a method based on rolling-horizon strategy is proposed. A multiobjective optimization model that is established minimizes the total penalty costs considering vessels’ deviations to their preferred berthing positions, delayed times for berthing comparing to their estimated arrival times, and delayed times for departure comparing to their estimated departure times. Then, the scheduling process was divided into a set of continual scheduling interval according to the dynamic arrival sequences. Meanwhile, rolling-horizon strategies for setting rolling and frozen windows and the parameter updating strategy are designed. The input parameters of the model in the next rolling window are updated according to the optimal results of each time window which have been obtained. The model is solved by choosing appropriate rolling and freezing window lengths that represents the numbers of adjacent vessels in the sequence of calling vessels. The holistic optimal solution is obtained by gradually rolling and combining the results of each window. Finally, a case study indicated that the rolling schedule can solve large-scale scheduling problems, and the efficiency of the proposed approach relates to the size of rolling window, freeze ship quantity, and rolling frequency.

  12. A Simulation based model for the berth allocation and quay crane assignment problem

    OpenAIRE

    Abdel Hafez, M.A.; Hubbard, Nick J.; Tipi, Nicoleta S.; Eltawil, A.B.

    2013-01-01

    With the global development of container transport, container terminals have become important nodes in transport networks which serve as hubs for the transshipment of containerized goods from ship to ship or from ship to other transport modes. As the container transport system is capital intensive, the turnaround time of ships at container terminals is an important factor for liner shipping companies to consider in order to decrease their costs. The turnaround time includes berthing, unloadin...

  13. 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

  14. Using Simulation in Evaluating Berth Allocation at a Container Terminal

    OpenAIRE

    Henesey, Lawrence; Davidsson, Paul; Persson, Jan A.

    2004-01-01

    The operations and decision making at a container terminal have been simulated. A Berth Allocation Management System – (BAMS) has been built which consists of two parts: a container terminal simulator modelling the operations and a management simulator modelling the various actors involved in the allocation of container ships to berths. Together these two parts generate berth schedules for arriving container ships. Two berth assignment policies are evaluated in different scenarios, with vario...

  15. Berth allocation planning in Seville inland port by simulation and optimisation

    OpenAIRE

    Arango Pastrana, Carlos Alberto; Cortés Achedad, Pablo Fabio; Muñuzuri Sanz, Jesús; Onieva Giménez, Luis Gerardo

    2011-01-01

    We study the problems associated with allocating berths for containerships in the port of Seville. It is the only inland port in Spain and it is located on the Guadalquivir River. This paper addresses the berth allocation planning problems using simulation and optimisation with Arena software. We propose a mathematical model and develop a heuristic procedure based on genetic algorithm to solve non-linear problems. Allocation planning aims to minimise the total service time for ...

  16. A bi-objective berth allocation formulation to account for vessel handling time uncertainty

    OpenAIRE

    Mihalis M Golias

    2011-01-01

    In this article we formulate the berth allocation problem as a bi-objective mixed-integer programming problem with the objective to maximize berth throughput and reliability of the schedule under the assumption that vessel handling times are stochastic parameters, being a function of other stochastic parameters (that is, quay crane breakdowns, quay-to-yard transport vehicle productivity, yard congestion, and so on). A combination of an exact algorithm, a Genetic Algorithms-based heuristic and...

  17. The Tactical Berth Allocation Problem (TBAP) with quay crane assignment and transshipment-related quadratic yard costs

    OpenAIRE

    Giallombardo, Giovanni; Moccia, Luigi; Salani, Matteo; Vacca, Ilaria

    2008-01-01

    International sea-freight container transport has grown dramatically over the last years and container terminals play nowadays a key-role in the global shipping network. Increasing competition and competitiveness among terminals require more and more efficiency in container handling operations, both in the quayside and the landside, in order to better utilize limited resources (such as cranes, trucks, berths, storage space, etc.) as well as minimize ship's turnaround time. Operations research...

  18. 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;

    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...

  19. A genetic algorithm for robust berth allocation and quay crane assignment

    OpenAIRE

    Rodríguez Molins, Mario; Ingolotti Hetter, Laura Paola; Barber Sanchís, Federico; Salido Gregorio, Miguel Angel; R. Sierra, María; Puente, Jorge

    2014-01-01

    Scheduling problems usually obtain the optimal solutions assuming that the environment is deterministic. However, actually the environment is dynamic and uncertain. Thus, the initial data could change and the initial schedule obtained might be unfeasible. To overcome this issue, a proactive approach is presented for scheduling problems without any previous knowledge about the incidences that can occur. In this paper, we consider the berth allocation problem and the quay crane assignment probl...

  20. Integrated discrete berth allocation and quay crane scheduling in port container terminals

    Science.gov (United States)

    Lee, Der-Horng; Qiu Wang, Hui

    2010-08-01

    The integrated discrete berth allocation and quay crane scheduling problem studied in this article considers the relationship between them. This article provides a mixed integer programming model for the studied problem that is ?-complete in nature. A genetic algorithm is proposed to obtain near optimal solutions. Computational experiments are conducted to examine the proposed solution algorithm. The computational results show that the proposed genetic algorithm is effective and efficient in solving the studied problem.

  1. Research on bulk-cargo-port berth assignment based on priority of resource allocation

    Directory of Open Access Journals (Sweden)

    Chunfang Guo

    2013-03-01

    Full Text Available Purpose: The purpose of this paper is to propose a Priority of Resource Allocation model about how to utilize the resources of the port efficiently, through the improvement of traditional ant colony algorithm, the ship-berth matching relation constraint matrix formed by ontology reasoning. Design/methodology/approach: Through questionnaires?Explore factor analysis (EFA and principal component analysis, the authors extract the importance of the goods, the importance of customers, and type of trade as the main factors of the ship operating priority. Then the authors combine berth assignment problem with the improved ant colony algorithm, and use the model to improve ship scheduling quality. Finally, the authors verify the model with physical data in a bulk-cargo-port in China. Findings: Test by the real data of bulk cargo port, it show that ships’ resource using priority and the length of waiting time are consistent; it indicates that the priority of resource allocation play a prominent role in improving ship scheduling quality. Research limitations: The questionnaires is limited in only one port group, more  related Influence factors should be considered to extend the conclusion. Practical implications: The Priority of Resource Allocation model in this paper can be used to improve the efficiency of the dynamic berth assignment. Originality: This paper makes the time of ship in port minimized as the optimization of key indicators and establishes a dynamic berth assignment model based on improved ant colony algorithm and the ontology reasoning model.

  2. A Knowledge-based System for Berth Allocation in a Container Terminal

    OpenAIRE

    Junliang He; Youfang Huang; Daofang Chang; Weimin Zhang

    2013-01-01

    Both of berth allocation and quay crane assignment are one of the most complex parts in container terminal operations, which significantly affect the operational efficiency, energy consumption and operational cost of the entire container terminal. Therefore, it is necessary to develop an efficient strategy for integrated berth allocation and quay crane assignment (BACP) from the perspective of knowledge, which aims at energy-saving and improving operational efficiency. In this paper, knowledg...

  3. Ship-berth link and demurrage costs: evaluating different allocation policies and queue priorities via simulation

    OpenAIRE

    Peter Wanke

    2011-01-01

    The ship-berth link is one of the most critical aspects to be managed at port operations. Until now, simulation models have considered the impact of queue priorities, such as size and type of ships, on waiting times. This research differentiates from previous studies not only by considering another variable - the demurrage cost for each type of ship -, but also by considering the possibility of different berth allocation policies. It reports on a simulation study on small Brazilian private co...

  4. 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

  5. Ship-berth link and demurrage costs: evaluating different allocation policies and queue priorities via simulation

    Directory of Open Access Journals (Sweden)

    Peter Wanke

    2011-04-01

    Full Text Available The ship-berth link is one of the most critical aspects to be managed at port operations. Until now, simulation models have considered the impact of queue priorities, such as size and type of ships, on waiting times. This research differentiates from previous studies not only by considering another variable - the demurrage cost for each type of ship -, but also by considering the possibility of different berth allocation policies. It reports on a simulation study on small Brazilian private container terminal, where different berth allocation policies and queue priorities have been tested. Results and further analyses conducted via MANOVA indicate that the demurrage cost ratio between large and small ships and the critical waiting time in queue, after which demurrage costs are charged, impact on the choice of most adequate combination of policies and priorities. The analysis presented in this paper may help port authorities in determining a more precise figure for total demurrage costs

  6. Simulation-based evaluation of berth allocation policies of container terminals

    OpenAIRE

    Chervyakov, Anatoly

    2003-01-01

    The aim of this investigation is to test and verify a hypothesis concerning policies for berth allocation to ships in a container terminal. The chosen domain is a rich research area where simulation could be used. Because of the high amount of variables involved and demand for optimal usage of available resources management of a container terminal is a great challenge.

  7. A Knowledge-based System for Berth Allocation in a Container Terminal

    Directory of Open Access Journals (Sweden)

    Junliang He

    2013-05-01

    Full Text Available Both of berth allocation and quay crane assignment are one of the most complex parts in container terminal operations, which significantly affect the operational efficiency, energy consumption and operational cost of the entire container terminal. Therefore, it is necessary to develop an efficient strategy for integrated berth allocation and quay crane assignment (BACP from the perspective of knowledge, which aims at energy-saving and improving operational efficiency. In this paper, knowledge acquisition for BACP is initially conducted. And then, knowledge sorting process for BACP, including taxonomic tree generation and organization of acquired knowledge, is performed. After that, rules for BACP are extracted using the IF and THEN clause. Furthermore, a knowledge reasoning mechanism is designed. Finally, numerical experiments are used to illustrate the proposed knowledge-based system and verify the effectiveness and reliability.

  8. Research on bulk-cargo-port berth assignment based on priority of resource allocation

    OpenAIRE

    Chunfang Guo; Zhongliang Guan; Yan Song

    2013-01-01

    Purpose: The purpose of this paper is to propose a Priority of Resource Allocation model about how to utilize the resources of the port efficiently, through the improvement of traditional ant colony algorithm, the ship-berth matching relation constraint matrix formed by ontology reasoning. Design/methodology/approach: Through questionnaires?Explore factor analysis (EFA) and principal component analysis, the authors extract the importance of the goods, the importance of customers, and type of ...

  9. 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...

  10. Fuzzy containers allocation problem in maritime terminal

    Directory of Open Access Journals (Sweden)

    Seyed-Mohammad Seyed-Hosseini

    2009-09-01

    Full Text Available Normal.dotm 0 0 1 140 799 UPC 6 1 981 12.0 0 false 18 pt 18 pt 0 0 false false false /* Style Definitions */ table.MsoNormalTable {mso-style-name:"Table Normal"; mso-tstyle-rowband-size:0; mso-tstyle-colband-size:0; mso-style-noshow:yes; mso-style-parent:""; mso-padding-alt:0cm 5.4pt 0cm 5.4pt; mso-para-margin:0cm; mso-para-margin-bottom:.0001pt; mso-pagination:widow-orphan; font-size:12.0pt; font-family:"Times New Roman"; mso-ascii-font-family:Cambria; mso-ascii-theme-font:minor-latin; mso-fareast-font-family:??; mso-fareast-theme-font:minor-fareast; mso-hansi-font-family:Cambria; mso-hansi-theme-font:minor-latin; mso-bidi-font-family:"Times New Roman"; mso-bidi-theme-font:minor-bidi;} Containers allocation in terminals has attracted lots of research works due to practical & theoretical importance in transportation literature. In this paper, we developed a fuzzy mathematical programming model for solving problem of allocating the containers in terminal area. The objective is minimizing the total distance traversed by the containers from the ship to the terminal area they are assigned. Fuzzy set concepts are used to treat imprecision regarding the distances between berth and terminals area, number of containers in an arrived ship and estimation of available area in each terminal at a port. We proposed two types of models for optimistic and pessimistic situations. The proposed models have been coded in LINGO8.0 solver and a numerical example has been solved for illustration purpose. The full analysis of the proposed models can cause an optimum allocation of containers of several ships to different terminals of berths in fuzzy environment.

  11. A Simulation-Based Optimization Approach for Integrated Port Resource Allocation Problem

    OpenAIRE

    Ilati, Gholamreza; Sheikholeslami, Abdorreza; Hassannayebi, Erfan

    2014-01-01

    Todays, due to the rapid increase in shipping volumes, the container terminals are faced with the challenge to cope with these increasing demands. To handle this challenge, it is crucial to use flexible and efficient optimization approach in order to decrease operating cost. In this paper, a simulation-based optimization approach is proposed to construct a near-optimal berth allocation plan integrated with a plan for tug assignment and for resolution of the quay crane re-allocation problem. ...

  12. 基于泊位偏好与岸桥干扰的泊位和岸桥分配%Berth and Quay Crane Allocation Considering Berth Preference and Quay Crane Interference

    Institute of Scientific and Technical Information of China (English)

    乐美龙; 刘秀玲

    2014-01-01

    Berth and quay crane ( QC) are the most important scarce resource in the container terminal .Reasona-ble berth allocation and quay crane scheduling can improve utilization of the resources and port operation effec -tiveness and efficiency .The paper firstly presents the integrated MILP model of both berth allocation and QC scheduling based on the deviation from the berth preference position and capacity loss of the QC .Then, using the data from a container terminal in Ningbo and Gurobi optimization solver , we solve the model .Finally the computational result is economically analyzed .The computational results show that the mean utilization rate of berth line of this port is 46%.Among them , the berth line from 1000 to 1600 meter is hardly used , and deplo-ying 18 QCs is better than deploying 16 QCs in the terminal .The mean utilization rate of deploying 18 QCs is 80%, so the paper suggests the port should have two more QCs .Meanwhile we find that as vessels increase , the solving time by Gurobi increases quickly .At the same time , our method , so called two stage heuristic method , can still give the quasi-optimal solution in very short time .%泊位和岸桥是集装箱港口资源中最紧缺的资源,合理的泊位分配和岸桥调度可以提高集装箱港口的资源利用率和港口的运作效率和效益。针对泊位偏离和岸桥工作损失两个因素,文章建立了集装箱港口泊位和岸桥的混合整数线性规划模型;运用采集自宁波某典型集装箱港口的数据,用Gurobi优化软件和两阶段启发式算法对模型进行了求解;对计算结果进行了经济性分析。计算结果表明:该港口的岸线资源利用率为46%时,1000m~1600m基本没被利用;18台岸桥要比16台岸桥的目标值更优,求解时间更短,而且18台岸桥的平均利用率为80%,为此,建议该港口再增加两台岸桥。同时发现:随着船舶规模的增加,Gurobi优化求解的时间增长

  13. Allocation Problems and Market Design

    DEFF Research Database (Denmark)

    Smilgins, Aleksandrs

    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...

  14. Berth Allocation with Service Priority for Container Terminal of Hub Port%集装箱枢纽港泊位分配问题优化研究

    Institute of Scientific and Technical Information of China (English)

    代丽利

    2014-01-01

    通过分析船舶大型化对船公司和码头运营商的影响,文中提出在泊位分配的过程中,码头需站在共赢的角度,箱位大的船舶的服务优先级高于箱位小的船舶。建立了具有优先权的动态泊位分配模型,采用改进的广义遗传算法对模型求解。算例结果证明模型和算法正确有效。%Through analyzing the effects of container ships with larger size to the shipping companies and terminal operators,this paper put forward a view,from a win-win perspective,that container ships with larger Twenty-foot Equivalent Units (TEUs)capacity should be given the higher priority in the process of berth allocation.Following the above view,a dynamic berth allocation model considering the service priority was developed and an improved generalized genetic algorithms was used to solve the model.Example application results show that the model and the algorithm are correct and effective.

  15. Integrated Berth Allocation and Quay Crane Scheduling by Memetic Algorithms%基于Memetic算法的泊位和岸桥分配问题

    Institute of Scientific and Technical Information of China (English)

    乐美龙; 刘菲

    2011-01-01

    continuous berth; dynamics; berth allocation; quay crane scheduling; collaborative%泊位是港口资源中最紧缺的资源,合理的泊位分配和岸桥调度可以提高集装箱码头的作业效率,研究了集装箱码头泊位和岸桥的同时优化问题.将泊位与岸桥的分配问题抽象为二维装箱问题,然后建立了泊位、岸桥同时优化的混合整数线性规划模型,并提出了Memetic算法进行求解.计算结果表明,在求解大规模船舶指派优化问题时,使用Memetic算法求解比使用Gurobi软件求解在计算时间上具有明显的优越性.

  16. 面向服务的泊位和岸桥联合调度%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展开导出了非线性约束的外逼近。最后,基于数值实验比较了分支

  17. Game theory and cost allocation problems

    NARCIS (Netherlands)

    Tijs, S.H.; Driessen, T.S.H.

    1986-01-01

    Problems of allocating joint costs in a reasonable way arise in many practical situations where people decide to work together to save costs. Cost allocation methods based on game theoretical concepts take into account the strategic aspects of cost allocation situations. We give a survey of cost all

  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. Game Theory and Cost Allocation Problems

    OpenAIRE

    Tijs, S.H.; Driessen, T.S.H.

    1986-01-01

    Problems of allocating joint costs in a reasonable way arise in many practical situations where people decide to work together to save costs. Cost allocation methods based on game theoretical concepts take into account the strategic aspects of cost allocation situations. We give a survey of cost allocation methods based on the nucleolus and the Shapley value, and introduce also a new one, the so-called cost gap allocation method which is based on the \\tau -value. It is shown that for some lar...

  20. 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....

  1. 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.

  2. Fuzzy containers allocation problem in maritime terminal

    OpenAIRE

    Seyed-Mohammad Seyed-Hosseini; K. Khalili Damghani

    2009-01-01

    Containers allocation in terminals has attracted lots of research works due to practical & theoretical importance in transportation literature. In this paper, we developed a fuzzy mathematical programming model for solving problem of allocating the containers in terminal area. The objective is minimizing the total distance traversed by the containers from the ship to the terminal area they are assigned. Fuzzy set concepts are used to treat imprecision regarding the distances between ber...

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

    DEFF Research Database (Denmark)

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

    LB Number of columns Column Time Solver Time 1 X 81,1 - 14,50% 1200* 89,0 89,0 312410 50,56 590,42 2 56,2 56,2 0,00% 0,00% 556* 56,2 56,2 334321 42,88 327,6 3 X 76,3 - 14,94% 1200* 85,7 85,7 249518 39,18 533,98 4 X 61,2 - 38,27% 1200* 81,8 81,8 385867 56,16 612,5 5 X 55,6 - 14,01% 1200* 59,2 59...

  4. 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

  5. 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.

  6. 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...

  7. Robust Optimization Model for Berth Planning Problem in Container Terminals%集装箱码头泊位计划的鲁棒优化模型

    Institute of Scientific and Technical Information of China (English)

    曾庆成; 赵孝峰; 胡祥培; 杨忠振

    2015-01-01

    To tackle the uncertainties that happen in operations of container terminals , robust optimization model and algorithms for berth planning problem are developed .The objective is to decrease the impact of uncertainties on operation efficiency of container terminals .Firstly, the robustness measures for berth schedule are proposed , and the each measure is assessed through computational experiments .Then, a two-stage robust optimization algo-rithm is designed:the first stage is to minimize the total delay of berthing vessels without considering the sched -ule robustness , and the total delay obtained is taken as a threshold value for the next stage .The second stage is to maximize the robustness measures while keeping the total vessel delay at a level equal to or smaller than the threshold value obtained by the first stage.Finally, the impact of operation resource(the number of quay cranes) on schedule robustness is analyzed .Numerical experiments indicate that weighted slack index is a valid robust-ness measure and the proposed two-stage algorithm can solve the robust optimization of berth plan efficiently .%针对集装箱码头作业中的不确定性因素,构建泊位计划的鲁棒优化模型与算法,目的是降低不确定性因素对集装箱码头作业系统的影响。首先,提出泊位计划鲁棒性度量指标,利用算例对各指标的效果进行分析。在此基础上,设计泊位计划鲁棒优化的两阶段优化算法。算法的第一阶段不考虑泊位计划的鲁棒性,以船舶总延误时间最小为目标;算法的第二阶段以所选择的鲁棒性指标最大为目标,以第一阶段获得的船舶总延误时间为约束条件,获得鲁棒调度方案。最后,研究作业资源(装卸桥数量)的变化对泊位计划鲁棒性的影响。算例分析表明,权重松弛量是有效的度量泊位计划鲁棒性的指标,两阶段算法可以有效解决泊位计划鲁棒优化问题。

  8. Lorenz and lexicographic maximal allocations for bankruptcy problems

    OpenAIRE

    Arin, Javier; Benito Ostolaza, Juan Miguel

    2012-01-01

    This paper investigates the use of egalitarian criteria to select allocations in bankruptcy problems. In our work, we characterize the sets of Lorenz maximal elements for these problems. We show that the allocation selected by the Proportional Rule is the only allocation that belongs to all these Lorenz maximal sets. We prove that the Talmud Rule selects the lexicographic maximal element within a certain set. We introduce and analyze a new sharing rule for bankruptcy problems that shares stro...

  9. 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.

  10. An interactive approach to the stochastic multiobjective allocation problem

    Directory of Open Access Journals (Sweden)

    Maciej Nowak

    2015-03-01

    Full Text Available The paper considers the stochastic multiobjective allocation problem. An assumption is made that a particular resource should be allocated to T projects. The specified level of each goal (along with the known probabilities can be obtained based on the amount of the resources allocated. We will propose an identification strategy procedure that the decision maker can implement. Our technique combines multiobjective dynamic programming and an interactive approach. First, efficient strategies are identified using Bellman's principle applied to the multiobjective problem. Next, a dialog procedure is used to find a solution that is satisfactory for the decision maker. A numerical example is presented to show how the procedure can be applied.

  11. 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.

  12. Evolutionary local search for solving the office space allocation problem

    OpenAIRE

    Ulker, Ozgur; Landa-Silva, Dario

    2012-01-01

    Office Space Allocation (OSA) is the task of correctly allocating the spatial resources of an institution to a set of entities by minimising the wastage of space and the violation of additional constraints. In this paper, an evolutionary local search algorithm is presented to tackle this problem. The evolutionary components of the algorithm include standard crossover and mutation operators and a relatively small population of individuals. The offspring produced by the evolutionary operators a...

  13. 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.

  14. Resource allocation and performance analysis problems in optical networks

    OpenAIRE

    Hyytiä, Esa

    2004-01-01

    Optical networks pose a rich variety of new design and performance analysis problems. Typically, the static design problems belong to the field of combinatorial optimisation, whereas decision-making and performance analysis problems are best treated using appropriate stochastic models. This dissertation focuses on certain issues in resource allocation and performance evaluation of backbone wavelength-routed (WR) networks and metropolitan area optical burst switching (OBS) networks. The fi...

  15. 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.

  16. 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.

  17. 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.

  18. 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.

  19. 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

  20. 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.

  1. 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.

  2. 46 CFR 108.203 - Berths and lockers.

    Science.gov (United States)

    2010-10-01

    ... EQUIPMENT Construction and Arrangement Accommodation Spaces § 108.203 Berths and lockers. (a) Each sleeping... pipe, ventilating duct, or other overhead installation. (i) Each berth must have a berth light....

  3. Stable families of coalitions for network resource allocation problems

    Directory of Open Access Journals (Sweden)

    Vladimir Gurvich

    2014-02-01

    Full Text Available A very common question appearing in resource management is: what is the optimal way of behaviour of the agents and distribution of limited resources. Is any form of cooperation more preferable strategy than pure competition? How cooperation can be treated in the game theoretic framework: just as one of a set of Pareto optimal solutions or cooperative game theory is a more promising approach? This research is based on results proving the existence of a non-empty K -core, that is, the set of allocations acceptable for the family K of all feasible coalitions, for the case when this family is a set of subtrees of a tree. A wide range of real situations in resource management, which include optimal water, gas and electricity allocation problems, can be modeled using this class of games. Thus, the present research is pursuing two goals: 1. optimality and 2. stability.Firstly, we suggest to players to unify their resources and then we optimize the total payoff using some standard LP technique. The same unification and optimization can be done for any coalition of players, not only for the total one.  However, players may object unification of resources. It may happen when a feasible coalition can guarantee a better result for every coalitionist.  Here we obtain some stability conditions which ensure that this cannot happen for some family K. Such families were characterized by Boros, Gurvich and Vasin [4] as Berge’s normal hypergraphs.  Thus, we obtain a solution which is optimal and stable. From practical point of view, we suggest a distribution of profit that would cause no conflict between players.

  4. ALLOCATION PROBLEM WITH RANDOM RIGHT TO ACCEPT OFFERS

    Directory of Open Access Journals (Sweden)

    Anna Krasnosielska-Kobos

    2012-06-01

    Full Text Available In the paper, we analyze a modifi cation of the allocation problem. The problem can be formulated as follows: sellers in trading agency have a right to sell goods at price offered by the buyer. To this aim, they observe offers which appear at jump times of a Poisson process which are at the same time the decision moments. A reward of the seller who accepted the offer is equal to the discounted value of the selected offer. The right to accept or reject the presented offer is given only to one of the sellers at the moment of appearance of the offer. Once rejected, offer cannot be considered again nor can it be considered by other sellers. The right to make the decision concerning the acceptance or rejection of a presented offer is assigned in random way, such that the probability of obtaining this right by each of the sellers is equal. The aim is to fi nd the strategy which allows to maximize the sum of expected rewards of the sellers under the condition that each of them should earn the same amount of money on average

  5. Strategies for solving large location-allocation problems by heuristic methods

    OpenAIRE

    P J Densham; Rushton, G

    1992-01-01

    Solution techniques for location-allocation problems usually are not a part of microcomputer-based geoprocessmg systems because of the large volumes of data to process and store and the complexity of algorithms. In this paper, it is shown that processing costs for the most accurate, heuristic, location-allocation algorithm can be drastically reduced by exploiting the spatial structure of location-allocation problems. The strategies used, preprocessing interpoint distance data as both candidat...

  6. 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.

  7. Migrating Birds Optimization for the Seaside Problems at Maritime Container Terminals

    OpenAIRE

    Eduardo Lalla-Ruiz; Christopher Expósito-Izquierdo; Jesica de Armas; Belén Melián-Batista; J. Marcos Moreno-Vega

    2015-01-01

    Sea freight transportation involves moving huge amounts of freights among maritime locations widely spaced by means of container vessels. The time required to serve container vessels is the most relevant indicator when assessing the competitiveness of a maritime container terminal. In this paper, two main logistic problems stemming from the transshipment of containers in the seaside of a maritime container terminal are addressed, namely, the Berth Allocation Problem aimed at allocating and sc...

  8. Dynamic Allocation Problems in Loss Network Systems with Advanced Reservation

    OpenAIRE

    Levi, Retsef; Shi, Cong

    2015-01-01

    We consider a class of well-known dynamic resource allocation models in loss network systems with advanced reservation. The most important performance measure in any loss network system is to compute its blocking probability, i.e., the probability of an arriving customer in equilibrium finds a fully utilized system (thereby getting rejected by the system). In this paper, we derive upper bounds on the asymptotic blocking probabilities for such systems in high-volume regimes. There have been re...

  9. An approach for solving constrained reliability-redundancy allocation problems using cuckoo search algorithm

    OpenAIRE

    Harish Garg

    2015-01-01

    The main goal of the present paper is to present a penalty based cuckoo search (CS) algorithm to get the optimal solution of reliability – redundancy allocation problems (RRAP) with nonlinear resource constraints. The reliability – redundancy allocation problem involves the selection of components' reliability in each subsystem and the corresponding redundancy levels that produce maximum benefits subject to the system's cost, weight, volume and reliability constraints. Numerical results of fi...

  10. 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.

  11. 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.

  12. 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.

  13. 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...

  14. Emergence of heterogeneity in a noncompetitive resource allocation problem

    Science.gov (United States)

    Matzke, Christina; Challet, Damien

    2011-07-01

    Tuning one’s shower in some hotels may turn into a challenging coordination game with imperfect information. The temperature sensitivity increases with the number of agents, making the problem possibly unlearnable. Because there is in practice a finite number of possible tap positions, identical agents are unlikely to reach even approximately their favorite water temperature. We show that a population of agents with homogeneous strategies is evolutionary unstable, which gives insights into the emergence of heterogeneity, the latter being tempting but risky.

  15. The Fighter Problem: Optimal Allocation of a Discrete Commodity

    CERN Document Server

    Bartroff, Jay

    2011-01-01

    The Fighter problem with discrete ammunition is studied. An aircraft (fighter) equipped with $n$ anti-aircraft missiles is intercepted by enemy airplanes, the appearance of which follows a homogeneous Poisson process with known intensity. If $j$ of the $n$ missiles are spent at an encounter they destroy an enemy plane with probability $a(j)$, where $a(0) = 0 $ and $\\{a(j)\\}$ is a known, strictly increasing concave sequence, e.g., $a(j) = 1-q^j, \\; \\, 0 < q < 1$. If the enemy is not destroyed, the enemy shoots the fighter down with known probability $1-u$, where $0 \\le u \\le 1$. The goal of the fighter is to shoot down as many enemy airplanes as possible during a given time period $[0, T]$. Let $K (n, t)$ be the smallest optimal number of missiles to be used at a present encounter, when the fighter has flying time $t$ remaining and $n$ missiles remaining. Three seemingly obvious properties of $K(n, t)$ have been conjectured: [A] The closer to the destination, the more of the $n$ missiles one should use, ...

  16. 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...

  17. 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

    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 s and all of them if allowed longer time. We have also modified an optimality based method from...

  18. On Some Properties of Cost Allocation Rules in Minimum Cost Spanning Tree Problems

    OpenAIRE

    BERGANTINOS, Gustavo; Vidal-Puga, Juan

    2008-01-01

    We consider four cost allocation rules in minimum cost spanning tree problems. These rules were introduced by Bird (1976), Dutta and Kar (2004), Kar (2002), and Feltkamp, Tijs and Muto (1994), respectively. We give a list of desirable properties and we study which properties are satisfied by these rules.

  19. Artificial Fish School Algorithm Applied in a Combinatorial Optimization Problem

    OpenAIRE

    Yun Cai

    2010-01-01

    An improved artificial fish swarm algorithm (AFSA) for solving a combinatorial optimization problem—a berth allocation problem (BAP), which was formulated. Its objective is to minimize the turnaround time of vessels at container terminals so as to improve operation efficiency customer satisfaction. An adaptive artificial fish swarm algorithm was proposed to solve it. Firstly, the basic principle and the algorithm design of the AFSA were introduced. Then, for a test case, computational experim...

  20. 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.

  1. 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.

  2. A methodology to assess vessel berthing and speed optimization policies

    OpenAIRE

    J Fernando Alvarez; Tore Longva; Erna S Engebrethsen

    2010-01-01

    Standard ocean shipping contracts stipulate that a chartered vessel must sail at ‘utmost despatch’, with no consideration for the availability of berths at the destination port. The berthing policies used at many ports, which admit vessels on a first-come, first-served basis, provide an additional incentive for the master to sail at full speed. These legacy contracts and berthing policies constitute a major driver of harbour congestion and marine fuel consumption, with adverse economic, safet...

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

    OpenAIRE

    Peter Bodnar; Jens Lysgaard

    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 locations. In this paper, we develop an exact dynamic programming algorithm for the SAAPP. The computational study shows that our exact algorithm can be used to find optimal solutions for numerous SAAP...

  4. Inexact rough-interval two-stage stochastic programming for conjunctive water allocation problems.

    Science.gov (United States)

    Lu, Hongwei; Huang, Guohe; He, Li

    2009-10-01

    An inexact rough-interval two-stage stochastic programming (IRTSP) method is developed for conjunctive water allocation problems. Rough intervals (RIs), as a particular case of rough sets, are introduced into the modeling framework to tackle dual-layer information provided by decision makers. Through embeding upper and lower approximation intervals, rough intervals are capable of reflecting complex parameters with the most reliable and possible variation ranges being identified. An interactive solution method is also derived. A conjunctive water-allocation system is then structured for characterizing the proposed model. Solutions indicate a detailed optimal allocation scheme with a rough-interval form; a total of [[1048.83, 2078.29]:[1482.26, 2020.60

  5. 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.

  6. Hybrid Methods for Resource Allocation and Scheduling Problems in Deterministic and Stochastic Environments

    OpenAIRE

    Lombardi, Michele

    2010-01-01

    This work presents exact, hybrid algorithms for mixed resource Allocation and Scheduling problems; in general terms, those consist into assigning over time finite capacity resources to a set of precedence connected activities. The proposed methods have broad applicability, but are mainly motivated by applications in the field of Embedded System Design. In particular, high-performance embedded computing recently witnessed the shift from single CPU platforms with application-specific accele...

  7. 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.

  8. 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.

  9. Genetic Algorithm Based Optimal Testing Effort Allocation Problem for Modular Software

    Directory of Open Access Journals (Sweden)

    Gurjeet Kaur

    2012-01-01

    Full Text Available Software reliability growth models (SRGM are used to assess modular software quantitatively and predict the reliability of each of the modules during module testing phase. In the last few decades various SRGM’s have been proposed in literature. However, it is difficult to select the best model from a plethora of models available. To reduce this difficulty, unified modeling approaches have been proposed by many researchers. In this paper we present a generalized framework for software reliability growth modeling with respect to testing effort expenditure and incorporate the faults of different severity. We have used different standard probability distribution functions for representing failure observation and fault detection/ correction times. The faults in the software are labeled as simple, hard and complex faults. Developing reliable modular software is necessary. But, at the same time the testing effort available during the testing time is limited. Consequently, it is important for the project manager to allocate these limited resources among the modules optimally during the testing process. In this paper we have formulated an optimization problem in which the total number of faults removed from modular software is (which include simple, hard and complex faults maximized subject to budgetary and reliability constraints. To solve the optimization problem we have used genetic algorithm. One numerical example has been discussed to illustrate the solution of the formulated optimal effort allocation problem.

  10. A Simple Experimental Analysis on Transportation Problem: A New Approach to Allocate Zero Supply or Demand for All Transportation Algorithm

    Directory of Open Access Journals (Sweden)

    Md. Ashraful Babu,

    2014-01-01

    Full Text Available Basic feasible solution is the initial solution of transportation problem. There are several transportation algorithms to determine feasible solution. These algorithms are only way to get optimal solution because optimal solution obtains from the initial basic feasible solution using some optimality test methods such as MODIModified Distribution Method and Stepping Stone Method where MODI is the most efficient method to determine optimal solution. Before applying MODI on feasible solution we have to resolve degeneracy if it occurs and also make sure that allocations (non-negative basic variable are should not form a closed loop when we draw horizontal and vertical paths from allocated cells to allocated cells. Degeneracy occurs when supply and demand are satisfied simultaneously it can be resolved if one row or column of them is crossed out and another remains with zero supply or demand. Difficulty arise when if all uncrossed out rows or column have (remaining zero supply or demand. In that case, Vogel‟s Approximation Method (VAM and some other methods solve that by allocating these zero supply or demand using Least Cost Method (LCM. But in some problem when we make allocation by LCM in that particular case then closed loop is formed and not possible to apply any optimality test method. So that optimal solution is not possible to determine in that case. In this paper we resolve this particular problem and find a new approach to allocate zero supply or demand so that closed loop will not be formed.

  11. 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.

  12. Tabu search for the redundancy allocation problem of homogenous series-parallel multi-state systems

    International Nuclear Information System (INIS)

    This paper develops an efficient tabu search (TS) heuristic to solve the redundancy allocation problem for multi-state series-parallel systems. The system has a range of performance levels from perfect functioning to complete failure. Identical redundant elements are included in order to achieve a desirable level of availability. The elements of the system are characterized by their cost, performance and availability. These elements are chosen from a list of products available in the market. System availability is defined as the ability to satisfy consumer demand, which is represented as a piecewise cumulative load curve. A universal generating function technique is applied to evaluate system availability. The proposed TS heuristic determines the minimal cost system configuration under availability constraints. An originality of our approach is that it proceeds by dividing the search space into a set of disjoint subsets, and then by applying TS to each subset. The design problem, solved in this study, has been previously analyzed using genetic algorithms (GAs). Numerical results for the test problems from previous research are reported, and larger test problems are randomly generated. Comparisons show that the proposed TS out-performs GA solutions, in terms of both the solution quality and the execution time

  13. Cost-Efficient Allocation of Additional Resources for the Service Placement Problem in Next-Generation Internet

    NARCIS (Netherlands)

    Ding, M.; Onderwater, M.; Wetzels, F.P.M.; Mei, R.D. van der; Bhulai, S.

    2015-01-01

    One of the major challenges in next-generation Internet is to allocate services to nodes in the network. This problem, known as the service placement problem, can be solved by layered graph approach. However, due to the existence of resource bottleneck, the requests are rejected from the beginning i

  14. 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.

  15. 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.

  16. Exhaust emissions from ships at berth

    Science.gov (United States)

    Cooper, D. A.

    Emission measurements have been carried out on board six ships at berth during normal real-world operation (hotelling, unloading and loading activities). The study included three passenger ferries, one transoceanic container/ro-ro, one transoceanic car/truck carrier, and one chemical tanker. Emissions were measured from 22 auxiliary engines (AEs, medium and high-speed marine diesels) covering seven engine models and ranging in size from 720 to 2675 kW maximum output. The fuels varied from low sulphur gasoils ( 2.91 cst viscosity) through to residual oils ( 411 cst viscosity). Both specific emission factors ( g kWh -1) at a given engine load and total emissions (kg) of nitrogen oxides (NO x), sulphur dioxide, carbon monoxide, hydrocarbons, carbon dioxide, particulate matter (PM) and polyaromatic hydrocarbons during actual harbour stops were determined. In addition, some preliminary measurements to investigate PM size distributions were undertaken. The specific emissions showed significant variations between the different engine models and also within the same engine model on board the same ship. For example NO x emissions varied between 9.6 and 20.2 g kWh corr-1 between all engines and 14.2- 18.6 g kWh corr-1 between engines of the same model and fuel. Other emissions from boiler use and possible main engine warm-up prior to departure were in general expected to be considerably less than those from the AEs. The results obtained for the three passenger ferries demonstrate that empirically derived, emission formulae using dead weight tonnage can prove to be a cost-effective and accurate tool for harbour emission inventories.

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

    Science.gov (United States)

    Giordano, Nils; Mairet, Francis; Gouzé, Jean-Luc

    2016-01-01

    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. PMID:26958858

  18. 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.

  19. 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.

  20. 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.

  1. 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. PMID:27588254

  2. 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.

  3. 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.

  4. 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 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...

  5. 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...

  6. Flexible Stock Allocation and Trim Loss Control for Cutting Problem in the Industrial-Use Paper Production

    Directory of Open Access Journals (Sweden)

    Fu-Kwun Wang

    2014-01-01

    Full Text Available We consider a one-dimensional cutting stock problem (CSP in which the stock widths are not used to fulfill the order but kept for use in the future for the industrial-use paper production. We present a new model based on the flexible stock allocation and trim loss control to determine the production quantity. We evaluate our approach using a real data and show that we are able to solve industrial-size problems, while also addressing common cutting considerations such as aggregation of orders, multiple stock widths, and cutting different patterns on the same machine. In addition, we compare our model with others, including trim loss minimization problem (TLMP and cutting stock problem (CSP. The results show that the proposed model outperforms the other two models regarding total flexibility and trim loss ratio.

  7. Coupling ant colony and the degraded ceiling algorithm for the redundancy allocation problem of series-parallel systems

    International Nuclear Information System (INIS)

    The redundancy allocation problem (RAP) is a well known NP-hard problem which involves the selection of elements and redundancy levels to maximize system reliability given various system-level constraints. As telecommunications and internet protocol networks, manufacturing and power systems are becoming more and more complex, while requiring short developments schedules and very high reliability, it is becoming increasingly important to develop efficient solutions to the RAP. This paper presents an efficient algorithm to solve this reliability optimization problem. The idea of a heuristic approach design is inspired from the ant colony meta-heuristic optimization method and the degraded ceiling local search technique. Our hybridization of the ant colony meta-heuristic with the degraded ceiling performs well and is competitive with the best-known heuristics for redundancy allocation. Numerical results for the 33 test problems from previous research are reported and compared. The solutions found by our approach are all better than or are in par with the well-known best solutions

  8. Migrating Birds Optimization for the Seaside Problems at Maritime Container Terminals

    Directory of Open Access Journals (Sweden)

    Eduardo Lalla-Ruiz

    2015-01-01

    Full Text Available Sea freight transportation involves moving huge amounts of freights among maritime locations widely spaced by means of container vessels. The time required to serve container vessels is the most relevant indicator when assessing the competitiveness of a maritime container terminal. In this paper, two main logistic problems stemming from the transshipment of containers in the seaside of a maritime container terminal are addressed, namely, the Berth Allocation Problem aimed at allocating and scheduling incoming vessels into berthing positions along the quay and the Quay Crane Scheduling Problem, whose objective is to schedule the loading and unloading tasks associated with a container vessel. For solving them, two Migrating Birds Optimization (MBO approaches are proposed. The MBO is a recently proposed nature-inspired algorithm based on the V-formation flight of migrating birds. In this algorithm, a set of solutions of the problem at hand, called birds, cooperate among themselves during the search process by sharing information within a V-line formation. The computational experiments performed over well-known problem instances reported in the literature show that the performance of our proposed MBO approaches is highly competitive and presents a better performance in terms of running time than the best approximate approach proposed in the literature.

  9. 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.

  10. Application of multi attribute decision making methods to resources allocation problems

    NARCIS (Netherlands)

    Mianabadi, H.; Van de Giesen, N.C.; Mostert, E.; Sheikhmohammady, M.

    2012-01-01

    Operation of over shared resources (water, gas, oil, and mineral reserves) has been one the most significant challenges of states. “Fair” and “efficient” national resources reallocation among stakeholders and states is a complex conflict problem that faces this fundamental question: which criteria a

  11. Allocating operating funding in the public sector and the newsvendor problem

    OpenAIRE

    Jack Brimberg; William J Hurley

    2015-01-01

    Public sector managers, particularly those at the highest level of government, tend to view lapsed (or unused) funds at the end of a fiscal year as a consequence of poor management and/or inadequate financial controls. The aim of this paper is to challenge this view. We show that the planning environment in the public sector is in essence the classical Newsvendor Problem. This simple model argues that lapsed funds are a direct consequence of a manager doing his job properly; that is, lapsed f...

  12. NUMERICAL SIMULATION OF TRANSIENT FLOW AROUND A SHIP IN UNSTEADY BERTHING MOTION

    Institute of Scientific and Technical Information of China (English)

    WANG Hua-ming; ZOU Zao-jian; TIAN Xi-min

    2009-01-01

    Ship berthing is a specific maneuver operation. The flow around a berthing ship and the forces acting on the hull are quite different from those for a ship in normal navigation. By solving the unsteady Reynolds-Averaged Navier-Stokes (RANS) equations, the transient flow field around a ship undergoing unsteady lateral motion is simulated and the varying lateral hydrodynamic force acting on the hull is evaluated in this article. The numerical results obtained with different turbulence models are analyzed and compared with experimental results and other numerical results published in literature, and a turbulence model more suitable for simulation of the viscous flow around a ship undergoing unsteady berthing is determined.

  13. A Multi-Objective Model to Single-Allocation Ordered Hub Location Problems by Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    Amir Tajbakhsh

    2013-02-01

    Full Text Available Most of supply chain and Hub location problems involve several conflicting objectives hence requiring a multi-objective formulation. Normally, Multi-objective approaches lead to the maximization of a weighted sum of score functions. Since normalizing these functions and quantifying the weights is not a straightforward process, such approaches are poor in practice. In this research, this difficulty is overcome by using a modified genetic algorithm for evaluation of solutions. Several qualitative and quantitative objectives are considered referring to layout model that also allows practical constraints take into account. Due to these constraints, many of strings in the population resulting from this model may be in infeasible reigns; the common approach to solve such problems is to omit infusible solutions. However, as these solutions my have useful criteria that can improve the average fitness of the population, they can be used to achieve better solutions. The proposed model uses a graded penalty term to penalize infeasible solutions to pressure the search towards feasible regions and subsequently uses their useful criteria.

  14. 凹资源配置问题的混合动态规划方法%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.

  15. 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.

  16. Analysis of berth allocation and inspection operations in a container terminal

    OpenAIRE

    Yongpei Guan; Kang-hung Yang

    2010-01-01

    Nowadays, approximately 90 per cent of the world's cargoes are moved by vessels, and the majority of general cargoes are transported in containers. Accordingly, a container terminal becomes one of the important nodes in the global supply chain network and it is important to make container terminals operate efficiently. Meanwhile, after the terrorist attack on September 11, 2001, the US Government has proposed and implemented several approaches to improve security systems, including container ...

  17. 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.

  18. 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.

  19. Artificial Fish School Algorithm Applied in a Combinatorial Optimization Problem

    Directory of Open Access Journals (Sweden)

    Yun Cai

    2010-11-01

    Full Text Available An improved artificial fish swarm algorithm (AFSA for solving a combinatorial optimization problem—a berth allocation problem (BAP, which was formulated. Its objective is to minimize the turnaround time of vessels at container terminals so as to improve operation efficiency customer satisfaction. An adaptive artificial fish swarm algorithm was proposed to solve it. Firstly, the basic principle and the algorithm design of the AFSA were introduced. Then, for a test case, computational experiments explored the effect of algorithm parameters on the convergence of the algorithm. Experimental results verified the validity and feasibility of the proposed algorithm with rational parameters, and show that the algorithm has better convergence performance than genetic algorithm (GA and ant colony optimization (ACO.

  20. Solving uncapacitated multiple allocation p-hub center problem by Dijkstra’s algorithm-based genetic algorithm and simulated annealing

    Directory of Open Access Journals (Sweden)

    Masoud Rabbani

    2015-09-01

    Full Text Available In the existing literature, there are a huge number of studies focused on p-hub median problems and inventing heuristic or metaheuristic algorithms for solving them. But such analogous body of literature does not exist for its counterpart problem; p-hub center problem. In fact, since p-hub center has been lately introduced and has a particular objective function, minimizing the maximum cost between origin-destination nodes, there are few studies investigating the problem and the challenges for solving it. In this study, after presenting a complete definition of the uncapacitated multiple allocation p-hub center problem (UMApHCP two well-known metaheuristic algorithms are proposed to solve the problem for small scale and large scale standard data sets. These two algorithms are one single solution-based algorithm, Simulated Annealing (SA, and one population-based metaheuristic, Genetic Algorithm (GA. Because of the particular nature of the problem, Dijkstra’s algorithm has been incorporated in the fitness function calculation part of the proposed methods. The numerical results of running the GA and SA for standard test problems show that for smaller scale test problems, single solution-based SA shows greater performance versus GA but for larger scales of data sets the GA generally yield more desirable solutions.

  1. Ship berthing to a vertical quay-wall: fender forces and ship motion

    NARCIS (Netherlands)

    Fontijn, H.L.

    1983-01-01

    In this report a mathematical model is formulated which is sufficiently accurate to describe the typical behaviour of a ship berthing to a vertical quay-wall fitted with fenders as well as to determine the response of the fenders themselves. In order to achieve this a three-dimensional set of govern

  2. 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.

  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. Genetic and tabu search approaches for optimizing the hall call-car allocation problem in elevator group systems

    OpenAIRE

    Bolat, Berna; Cortés Achedad, Pablo Fabio

    2011-01-01

    The most common problem in vertical transportation using elevator group appears when a passenger wants to travel from a floor to other different floor in a building. The passenger makes a hall call by pressing a landing call button installed at the floor and located near the cars of the elevator group. After that, the elevator controller receives the call and identifies which one of the elevators in the group is most suitable to serve the person having issued the call. In this ...

  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...... 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...

  9. Cost allocation in distribution planning

    International Nuclear Information System (INIS)

    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 τ-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 m3 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

  10. 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

  11. 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.

  12. 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.

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

    Science.gov (United States)

    2011-12-13

    ... contaminant, oxides of nitrogen (NO X ), and carbon dioxide (CO 2 ), a greenhouse gas. These reductions will...-Berth Regulation is designed to reduce emissions of oxides of nitrogen and particulate matter from.... Fleets that achieve reductions of emissions of oxides of nitrogen or particulate matter in excess of...

  14. 基于动态规划下地震现场搜救兵力配置研究%Study on Force Allocation Problem of Rescue and Search in Earthquake Site Based on Dynamic Programming

    Institute of Scientific and Technical Information of China (English)

    李浩; 汪杰; 王公宝

    2014-01-01

    针对我国目前在地震现场搜索救援中存在的兵力配置问题,提出运用动态规划方法对其问题进行研究。简述建立动态规划模型的基本策略和步骤,建立地震现场搜索救援中兵力配置问题的静态数学与动态规划模型,并通过求解动态规划模型,得出地震现场搜索救援中兵力配置的最优策略。结果表明:该模型结构简单,计算难度小,优化配置能力强,易于电脑操作,可有效解决兵力配置等非线性数学问题。%In view of the search and rescue force allocation problems that exist currently in the earthquake site, put forwards the dynamic programming method to solve the problem. Briefly introduce the basic methods and steps of the dynamic programming model, establishes a static mathematical and dynamic programming model about the force allocation problem of rescue and search in earthquake site, and finds optimal strategy about rescue and search in earthquake site by solving the dynamic programming model. The results show that, the model has the advantages of simple structure, small computational difficulty, optimal allocation ability, easy computer operation, can effectively solve the force allocation problem and other nonlinear mathematical problems.

  15. Resource Allocation using Virtual Clusters

    CERN Document Server

    Stillwell, Mark; Vivien, Frédéric; Casanova, Henri

    2010-01-01

    In this report we demonstrate the potential utility of resource allocation management systems that use virtual machine technology for sharing parallel computing resources among competing jobs. We formalize the resource allocation problem with a number of underlying assumptions, determine its complexity, propose several heuristic algorithms to find near-optimal solutions, and evaluate these algorithms in simulation. We find that among our algorithms one is very efficient and also leads to the best resource allocations. We then describe how our approach can be made more general by removing several of the underlying assumptions.

  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. Unit 58 - Location-Allocation on Networks

    OpenAIRE

    Unit 54, CC in GIS; National Center for Geographic Information and Analysis

    1990-01-01

    This unit introduces a selection of network problems through an example concerning waste disposal for the Petrolia, Ontario oil field. The example is framed as a location-allocation problem and the GIS implementation using a location-allocation module is outlined.

  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. Optimal allocation of inspection resources

    International Nuclear Information System (INIS)

    Allocation of inspection resources for international safeguards is considered as the problem of designing a complex system that is composed of individual inspection activities and that has the objective of detecting material loss. Optimization theory is applied in selecting those inspection activities that maximize a system performance measure within resource constraints. The method is applicable to a global allocation problem in which inspection resources are distributed throughout a hierarchy consisting of multiple countries, multiple facilities within each country, and multiple activities within each facility. 9 references

  20. 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.

  1. Water allocation mechanisms : principles and examples

    OpenAIRE

    Dinar, Ariel; Rosegrant, Mark W.; Meinzen-Dick, Ruth

    1997-01-01

    From the earliest times, water resources have been allocated on the basis of social criteria -maintaining the community by ensuring that water is available for human consumption, for sanitation, and for food production. Societies have invested capital in infrastructure to maintain this allocation. Yet social change, including changes in (and more understanding of) how goods are distributed, has produced new issues in water allocation. Population growth has made water scarcity a major problem ...

  2. The allocation of attention: theory and evidence

    OpenAIRE

    Gabaix, Xavier; Laibson, David Isaac; Moloche, Guillermo; Stephen, Weinberg

    2003-01-01

    A host of recent studies show that attention allocation has important economic consequences. This paper reports the first empirical test of a cost-benefit model of the endogenous allocation of attention. The model assumes that economic agents have finite mental processing speeds and cannot analyze all of the elements in complex problems. The model makes tractable predictions about attention allocation, despite the high level of complexity in our environment. The model successfully predicts th...

  3. 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

  4. 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...

  5. STUDY ON COLLABORATIVE PURCHASING AND COST ALLOCATION PROBLEM IN SUPPLY CHAINS WITH PERISHABLE PRODUCTS%易腐品供应链企业联合采购决策与费用分配研究

    Institute of Scientific and Technical Information of China (English)

    冯海荣; 李军; 曾银莲

    2011-01-01

    在激烈的市场竞争中,如何降低成本以及保证产品的新鲜度对于销售易腐性产品的零售商来说具有至关重要的意义.企业间通过实施联合采购可以降低采购成本,增加与供应商的谈判议价能力,因此联合采购受到越来越多的企业以及学者的关注.考虑了在非瞬时补货情况下多零售商向同一供应商联合采购某种易腐品的订货决策及费用分配问题.以易腐品联合采购过程中产生的订货费用作为分配的对象,应用合作博弈理论,将非瞬时补货情况下易腐品联合采购的费用分配问题构造成易腐品的联合采购博弈,证明了该博弈的核心非空且为子模博弈,并给出了核心中的一个分配方案,同时还讨论了补货速率对零售商分担的订货费用的影响.论文最后对几种典型的比例分配解的效率进行了模拟分析.%It is important for the retailer to reduce the operating cost and to keep the freshness of the product in the supply chain with perishable products under the fierce market competition. By means of placing their ordering simultaneously, the firms can reduce their cost and strengthen negotiation abilities to their supplier, hence it has received tremendous attention from enterprises and scholars. This paper studies the joint replenishment problem and cost allocation problem for multi-retailers when they form a purchasing alliance in the EPQ framework. The cost allocation problem for the ordering setup cost is considered, and formulated as the cost allocation game with perishable products. It is proved that the cost allocation game is submodular, and its core is nonempty, then an allocation rule is defined and proved to be a core allocation. We also discuss the effect of the replenishment rate on the allocation rule. Finally, the efficiency of several proportional rules is studied by simulation.

  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. 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.

  9. 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...

  10. 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.

  11. Joint overbooking and seat allocation for fare families

    DEFF Research Database (Denmark)

    Hjorth, Robert; Fiig, Thomas; Bondoux, Nicolas;

    2016-01-01

    Revenue Management Systems (RMS) traditionally solve the seat allocation problem separately from the overbooking problem. Overbooking is managed by inflating the authorization levels obtained from seat allocation by various heuristics. This approach although suboptimal, is necessitated because...... 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...

  12. 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.

  13. Finding core allocations for fixed cost games in electricity networks

    OpenAIRE

    Bjørndal, Endre; Stamtsis, Georgios C.; Erlich, István

    2003-01-01

    We discuss the cost allocation problem faced by a network operator, where the fixed (residual) cost of the network has to be allocated among its users. Usage-based methods, such as the postage stamp rate method and the MW-mile method, are easy to understand and compute, but may yield cost allocations for which some transactions are subsidizing others. Formally, this is equivalent to allocations outside of the core of the corresponding cooperative cost game. Our main contribution is to present...

  14. Constrained control allocation for systems with redundant control effectors

    OpenAIRE

    Bordignon, Kenneth A

    1996-01-01

    Control allocation is examined for linear time-invariant problems that have more controls than degrees of freedom. The controls are part of a physical system and are subject to limits on their maximum positions. A control allocation scheme commands control deflections in response to some desired output. The ability of a control allocation scheme to produce the desired output without violating the physical position constraints is used to compare allocation schemes. Methods are develop...

  15. Emergency strategy of berth scheduling in container terminal based on memetic algorithm%基于Memetic算法的集装箱码头泊位应急调度策略

    Institute of Scientific and Technical Information of China (English)

    王健; 杨春霞; 杨赞

    2011-01-01

    To solve the emergency scheduling problem caused by the overstock of ships in container terminal,a emergency strategy of berth scheduling was proposed based on the Memetic algorithm.Firstly,a series of recovery times with different length were given through the human-computer interaction;secondly,in each recovery time,the berth rescheudling was carried out to minimize the number of rejected ships based on the Memetic algorithm;finally,the final scheme was determined with the recovery times and the optimization results considered.Numberial examples show that the proposed strategy can restore container terminal to normal production order quickly with the load-upload accomplishment for all ships,which can satisfy the decision demands of the emergency management in container terminals.%针对集装箱码头因船舶压港产生的应急调度问题,提出一种基于Memetic算法的泊位应急调度策略.首先,通过人机交互方式确定一系列不同长度的恢复时间;其次,在每段恢复时间内采用Memetic算法对相应船舶集合进行重调度,以实现甩港船舶数最少的优化目标;最后,通过综合分析恢复时间和优化结果确定最终方案.试验结果表明,该优化策略可使集装箱码头在尽量完成船舶作业的同时,以最快速度恢复到正常生产秩序,可供集装箱码头应急决策时参考.

  16. Comparison of systems for memory allocation in the C programming language

    OpenAIRE

    ZAVRTANIK, MATEJ

    2016-01-01

    The bachelor thesis describes memory allocation. Work begins with description of mechanism, system calls and data structures used in memory allocators. Goals of memory allocation ares listed along with problems which must be avoided. Afterwards construction and allocating of popular memory allocators is described. Work ends with comparison of memory allocators based on time of execution of programs and memory usage, on which conclusion is based.

  17. Dynamic channel allocation

    OpenAIRE

    Kaminsky, Andrew D.

    2003-01-01

    Approved for public release; distribution in unlimited. Dynamic Channel Allocation (DCA) offers the possibility of capturing unused channel capacity by allocating unused resources between competing network nodes. This can reduce or possibly eliminate channels sitting idle while information awaits transmission. This holds potential for increasing throughput on bandwidth constrained networks. The purpose of this thesis is to examine the techniques used to allocate channels on demand and acc...

  18. Optimal allocation of handling equipment in a container terminal using dynamic programming with lagrangian relaxation approach. Container futo ni okeru niyaku shisetsu haichi no saitekika

    Energy Technology Data Exchange (ETDEWEB)

    Inamura, H. (Tohoku University, Sendai (Japan). Faculty of Engineering); Sritharan, S.; Villamor, N.

    1991-07-15

    This study describes methods for optimal crane allocation and the corresponding trailer allocation using dynamic programming with Lagrangian relaxation approach, taking the container terminal at Bangkok Port as an example. The developed system can be applied to any container terminal in any country regardless of number of berth, kind of container ship or kind of crane and trailer. This system may be used practically because the required solution can be derived from a personal computer operation for about ten minutes. The dynamic programming system relating to optimal crane allocation has been verified for its reasonability after 1000 repetitions of the simulation. Differences in the result were 1 TEU for the mean value, 12 TEU for the standard deviation, and {minus}30 to {plus}30 for the range. The standard deviation is sufficiently small at little less than 7% against a handling volume of 186 TEU. 15 refs., 4 figs., 6 tabs.

  19. Allocating multiple units

    DEFF Research Database (Denmark)

    Tranæs, Torben; Krishna, Kala

    2002-01-01

    This paper studies the allocation and rent distribution in multi-unit, combinatorial-bid auctions under complete information. We focus on the natural multi-unit analogue of the first-price auction, where buyers bid total payments, pay their bids, and where the seller allocates goods to maximize his...

  20. 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.

  1. A new analysis of a simple model of fair allocation

    OpenAIRE

    Juan D. Moreno-Ternero

    2012-01-01

    In a recent article, Fragnelli and Gagliardo [Cooperative models for allocating an object, Economics Letters 117 (2012) 227-229] propose several procedures to solve a basic problem of fair allocation. We scrutinize their proposal and contextualize it into recent developments of the literature on bankruptcy problems. Our analysis supports two of the procedures they propose; namely, the Shapley and Talmud rules.

  2. 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.

  3. 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.

  4. Fair Water Allocation in Complex International River Systems

    Science.gov (United States)

    Beck, L.; Bernauer, T.

    2011-12-01

    Conflicts over water allocation in international freshwater systems are recurring phenomena, and climatic changes are likely to make existing problems worse in many parts of the world. Science-based proposals for water allocation frequently focus on allocating water to the economically most efficient purposes. In reality, allocation outcomes are often shaped by political and economic power, rather than considerations of economic efficiency. This paper develops a new approach to fair international water allocation in complex international freshwater systems. This approach covers both needs-based criteria - if acute water scarcity is present - and criteria for fair water allocation pertaining to relative gains in water-abundant situations. The usefulness of the approach is illustrated with a case study on the Zambezi River Basin (ZRB). Based on a hydrological model, and scenarios for water availability and demand in the ZRB until 2050, the paper shows how the waters of the ZRB could be allocated in a way that fairly distributes costs and benefits.

  5. Optimal dynamic allocation of conservation funding among priority regions.

    Science.gov (United States)

    Bode, Michael; Wilson, Kerrie; McBride, Marissa; Possingham, Hugh

    2008-10-01

    The optimal allocation of conservation resources between biodiverse conservation regions has generally been calculated using stochastic dynamic programming, or using myopic heuristics. These solutions are hard to interpret and may not be optimal. To overcome these two limitations, this paper approaches the optimal conservation resource allocation problem using optimal control theory. A solution using Pontryagin's maximum principle provides novel insight into the general properties of efficient conservation resource allocation strategies, and allows more extensive testing of the performance of myopic heuristics. We confirmed that a proposed heuristic (minimize short-term loss) yields near-optimal results in complex allocation situations, and found that a qualitative allocation feature observed in previous analyses (bang-bang allocation) is a general property of the optimal allocation strategy. PMID:18712571

  6. 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.

  7. 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.

  8. 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....

  9. 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....

  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. 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.

  12. 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)

  13. 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...

  14. 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

  15. Flexible resources allocation techniques: characteristics and modelling

    OpenAIRE

    Attia, El-Awady; Edi, Kouassi Hilaire; Duquenne, Philippe

    2012-01-01

    International audience At the interface between engineering, economics, social sciences and humanities, industrial engineering aims to provide answers to various sectors of business problems. One of these problems is the adjustment between the workload needed by the work to be realised and the availability of the company resources. The objective of this work is to help to find a methodology for the allocation of flexible human resources in industrial activities planning and scheduling. Thi...

  16. Modeling Word Relatedness in Latent Dirichlet Allocation

    OpenAIRE

    Wang, Xun

    2014-01-01

    Standard LDA model suffers the problem that the topic assignment of each word is independent and word correlation hence is neglected. To address this problem, in this paper, we propose a model called Word Related Latent Dirichlet Allocation (WR-LDA) by incorporating word correlation into LDA topic models. This leads to new capabilities that standard LDA model does not have such as estimating infrequently occurring words or multi-language topic modeling. Experimental results demonstrate the ef...

  17. Link Monotonic Allocation Schemes

    NARCIS (Netherlands)

    Slikker, M.

    1999-01-01

    A network is a graph where the nodes represent players and the links represent bilateral interaction between the players. A reward game assigns a value to every network on a fixed set of players. An allocation scheme specifies how to distribute the worth of every network among the players. This allo

  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. 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.

  20. A Framework for Optimal Control Allocation with Structural Load Constraints

    Science.gov (United States)

    Frost, Susan A.; Taylor, Brian R.; Jutte, Christine V.; Burken, John J.; Trinh, Khanh V.; Bodson, Marc

    2010-01-01

    Conventional aircraft generally employ mixing algorithms or lookup tables to determine control surface deflections needed to achieve moments commanded by the flight control system. Control allocation is the problem of converting desired moments into control effector commands. Next generation aircraft may have many multipurpose, redundant control surfaces, adding considerable complexity to the control allocation problem. These issues can be addressed with optimal control allocation. Most optimal control allocation algorithms have control surface position and rate constraints. However, these constraints are insufficient to ensure that the aircraft's structural load limits will not be exceeded by commanded surface deflections. In this paper, a framework is proposed to enable a flight control system with optimal control allocation to incorporate real-time structural load feedback and structural load constraints. A proof of concept simulation that demonstrates the framework in a simulation of a generic transport aircraft is presented.

  1. Cognitive allocation and the control room

    International Nuclear Information System (INIS)

    One of the weakest links in the design of nuclear power plants is the inattention to the needs and capabilities of the operators. This flaw causes decreased plant reliability and reduced plant safety. To solve this problem the designer must, in the earliest stages of the design process, consider the operator's abilities. After the system requirements have been established, the designer must consider what functions to allocate to each part of the system. The human must be considered as part of this system. The allocation of functions needs to consider not only the mechanical tasks to be performed, but also the control requirements and the overall control philosophy. In order for the designers to consider the control philosophy, they need to know what control decisions should be automated and what decisions should be made by an operator. They also need to know how these decisions will be implemented: by an operator or by automation. ''Cognitive Allocation'' is the allocation of the decision making process between operators and machines. It defines the operator's role in the system. When designing a power plant, a cognitive allocation starts the process of considering the operator's abilities. This is the first step to correcting the weakest link in the current plant design

  2. 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.

  3. 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.

  4. Aid allocation and fragile states

    OpenAIRE

    McGillivray, Mark

    2006-01-01

    This paper summarises research on aid allocation and effectiveness, highlighting the current findings of recent research on aid allocation to fragile states. Fragile states are defined by the donor community as those with either critically poor policies or poorly performing institutions, or both. The paper examines the research findings in the broader context of research and analysis on how aid should and is being allocated across all developing countries. Various aid allocation models and th...

  5. Aircraft Stand Allocation with Associated Resource Scheduling

    DEFF Research Database (Denmark)

    Justesen, Tor Fog; Larsen, Jesper; Lusby, Richard Martin;

    An aircraft turn-round refers to the set of processes taking place from when an aircraft parks at its arrival stand until the time it departs from its departure stand. When handling a turn-round, the different processes involved (arrival, disembarkation of passengers, cleaning, etc.) require...... different ground handling resources (taxiways, aircraft stands, gates, etc) at different times. Each resource can be claimed by at most one turn-round at a time. The aircraft stand allocation problem with associated resource scheduling is the problem of allocating the required ground handling resources...... to handle a given set of aircraft turn-rounds. We develop a set packing-based model formulation of the problem which is both flexible in the sense that it can encapsulate any type of resource required during the handling of a turn-round and strong in the sense that conflicts that occur when two or more turn...

  6. 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.

  7. Market-based task allocation in distributed satellite systems

    OpenAIRE

    van der Horst, Johannes

    2012-01-01

    This thesis addresses the problem of task allocation in a distributed satellite system. These spacecraft specialise in different functions, and must collaborate to complete the mission objectives. The energy available for task execution and communication is, however, extremely limited, which poses a challenging design problem. I propose the use of a market-based, multi-agent approach to achieve the necessary macro-level behaviour. The development and verification of this allocation mechanism ...

  8. 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.

  9. 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.

  10. Cost allocation with limited information

    DEFF Research Database (Denmark)

    Hougaard, Jens Leth; Tind, Jørgen

    This article investigates progressive development of Aumann-Shapley cost allocation in a multilevel organizational or production structure. In particular, we study a linear parametric programming setup utilizing the Dantzig-Wolfe decomposition procedure. Typically cost allocation takes place after...... 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...... information about some technical constraints in order to make the cost allocation....

  11. Optimization of Power Allocation for a Multibeam Satellite Communication System with Interbeam Interference

    Directory of Open Access Journals (Sweden)

    Heng Wang

    2014-01-01

    Full Text Available In multibeam satellite communication systems it is important to improve the utilization efficiency of the power resources, due to the scarcity of satellite power resources. The interbeam interference between the beams must be considered in the power allocation; therefore, it is important to optimize the power allocated to each beam in order to improve the total system performance. Initially the power allocation problem is formulated as a nonlinear optimization, considering a compromise between the maximization of total system capacity and the fairness of the power allocation amongst the beams. A dynamic power allocation algorithm based on duality theory is then proposed to obtain a locally optimal solution for the optimization problem. Compared with traditional power allocation algorithms, this proposed dynamic power allocation algorithm improves the fairness of the power allocation amongst the beams, and, in addition, the proposed algorithm also increases the total system capacity in certain scenarios.

  12. 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.

  13. 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...

  14. [Organ allocation. Ethical issues].

    Science.gov (United States)

    Cattorini, P

    2010-01-01

    The criteria for allocating organs are one of the most debated ethical issue in the transplantation programs. The article examines some rules and principles followed by "Nord Italia Transplant program", summarized in its Principles' Charter and explained in a recent interdisciplinary book. General theories of justice and their application to individual clinical cases are commented and evaluated, in order to foster a public, democratic, transparent debate among professionals and citizens, scientific associations and customers' organizations. Some specific moral dilemmas are focused regarding the concepts of proportionate treatment, unselfish donation by living persons, promotion of local institutions efficiency. PMID:20677677

  15. Research advances on thereasonable water resources allocation in irrigation district

    DEFF Research Database (Denmark)

    Xuebin, Qi; Zhongdong, Huang; Dongmei, Qiao;

    2015-01-01

    resources optimal allocation model and④The hydrological ecosystem analysis in irrigation district. Our analysis showed that there are four major problems in domestic irrigation water resources allocation:Policies for rational water resources allocation and protection are not in place, unified management......The rational allocation of water resources for irrigation is important to improve the efficiency in utilization of water resources and ensuring food security, but also effective control measures need to be in place for the sustainable utilization of water resources in an irrigation area....... The progress of research on the rational allocation of water resources in irrigation districts both at home and abroad may be summarized in four key aspects of the policy regarding water re?sources management:① The mechanism of water resource cycle and ② Transformation in irrigation district, ③ The water...

  16. 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.

  17. 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. 

  18. Stability and resource allocation in project planning

    OpenAIRE

    Leus, Roel; Herroelen, Willy

    2002-01-01

    The majority of resource-constrained project scheduling efforts assumes perfect information about the scheduling problem to be solved and a static deterministic environment within which the pre-computed baseline schedule is executed. In reality, project activities are subject to considerable uncertainty, which generally leads to numerous schedule disruptions. In this paper, we present a resource allocation model that protects a given baseline schedule against activity duration variability. A ...

  19. Address allocation to mobile ad hoc networks

    OpenAIRE

    Sakander, Zeeshan

    2006-01-01

    Addressing in MANETs is of significant importance, as a mobile device cannot participate in unicast communications until it is assigned a conflict-free IP address. All routing protocols assume nodes to be configured a priori with a unique IP address. Allocating addresses to mobile nodes is a fundamental and difficult problem. Unlike infrastructure based networks, MANETs support autonomous and spontaneous networking and therefore, should be capable of self-organization and self-configuration. ...

  20. 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.

  1. Ground data systems resource allocation process

    Science.gov (United States)

    Berner, Carol A.; Durham, Ralph; Reilly, Norman B.

    1989-01-01

    The Ground Data Systems Resource Allocation Process at the Jet Propulsion Laboratory provides medium- and long-range planning for the use of Deep Space Network and Mission Control and Computing Center resources in support of NASA's deep space missions and Earth-based science. Resources consist of radio antenna complexes and associated data processing and control computer networks. A semi-automated system was developed that allows operations personnel to interactively generate, edit, and revise allocation plans spanning periods of up to ten years (as opposed to only two or three weeks under the manual system) based on the relative merit of mission events. It also enhances scientific data return. A software system known as the Resource Allocation and Planning Helper (RALPH) merges the conventional methods of operations research, rule-based knowledge engineering, and advanced data base structures. RALPH employs a generic, highly modular architecture capable of solving a wide variety of scheduling and resource sequencing problems. The rule-based RALPH system has saved significant labor in resource allocation. Its successful use affirms the importance of establishing and applying event priorities based on scientific merit, and the benefit of continuity in planning provided by knowledge-based engineering. The RALPH system exhibits a strong potential for minimizing development cycles of resource and payload planning systems throughout NASA and the private sector.

  2. Dynamic Rate Allocation in Fading Multiple-access Channels

    CERN Document Server

    ParandehGheibi, Ali; Ozdaglar, Asuman; Medard, Muriel

    2008-01-01

    We consider the problem of rate allocation in a fading Gaussian multiple-access channel (MAC) with fixed transmission powers. Our goal is to maximize a general concave utility function of transmission rates over the throughput capacity region. In contrast to earlier works in this context that propose solutions where a potentially complex optimization problem must be solved in every decision instant, we propose a low-complexity approximate rate allocation policy and analyze the effect of temporal channel variations on its utility performance. To the best of our knowledge, this is the first work that studies the tracking capabilities of an approximate rate allocation scheme under fading channel conditions. We build on an earlier work to present a new rate allocation policy for a fading MAC that implements a low-complexity approximate gradient projection iteration for each channel measurement, and explicitly characterize the effect of the speed of temporal channel variations on the tracking neighborhood of our p...

  3. Business Analytics for Flexible Resource Allocation Under Random Emergencies

    OpenAIRE

    Angalakudati, Mallik; Balwani, Siddharth; Calzada, Jorge; Chatterjee, Bikram; Perakis, Georgia; Raad, Nicolas; Uichanco, Joline

    2012-01-01

    In this paper, we describe both applied and analytical work in collaboration with a large multistate gas utility. The project addressed a major operational resource allocation challenge that is typical to the industry. We study the resource allocation problem in which some of the tasks are scheduled and known in advance, and some are unpredictable and have to be addressed as they appear. The utility has maintenance crews that perform both standard jobs (each must be done before a specified de...

  4. Dynamic asset allocation for bank under stochastic interest rates.

    OpenAIRE

    Chakroun, Fatma; Fathi ABID

    2014-01-01

    This paper considers the optimal asset allocation strategy for bank with stochastic interest rates when there are three types of asset: Bank account, loans and securities. The asset allocation problem is to maximize the expected utility from terminal wealth of a bank's shareholders over a finite time horizon. As a consequence, we apply a dynamic programming principle to solve the Hamilton-Jacobi-Bellman (HJB) equation explicitly in the case of the CRRA utility function. A case study is given ...

  5. On the Complexity of Buffer Allocation in Message Passing Systems

    OpenAIRE

    Brodsky, Alex; Pedersen, Jan B.; Wagner, Alan

    2003-01-01

    Message passing programs commonly use buffers to avoid unnecessary synchronizations and to improve performance by overlapping communication with computation. Unfortunately, using buffers makes the program no longer portable, potentially unable to complete on systems without a sufficient number of buffers. Effective buffer use entails that the minimum number needed for a safe execution be allocated. We explore a variety of problems related to buffer allocation for safe and efficient execution ...

  6. Distributed Rate Allocation Policies for Multi-Homed Video Streaming over Heterogeneous Access Networks

    OpenAIRE

    Zhu, Xiaoqing; Agrawal, Piyush; Singh, Jatinder Pal; Alpcan, Tansu; Girod, Bernd

    2010-01-01

    We consider the problem of rate allocation among multiple simultaneous video streams sharing multiple heterogeneous access networks. We develop and evaluate an analytical framework for optimal rate allocation based on observed available bit rate (ABR) and round-trip time (RTT) over each access network and video distortion-rate (DR) characteristics. The rate allocation is formulated as a convex optimization problem that minimizes the total expected distortion of all video streams. We present a...

  7. 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.

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

    International Nuclear Information System (INIS)

    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

  9. 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.

  10. Register-allocated paging for big data calculations

    Directory of Open Access Journals (Sweden)

    David Thomas

    2014-01-01

    Full Text Available Software to support the Monte Carlo method generates large vectors of pseudo-random numbers and uses these as operands in complex mathematical expressions. When such software is run on standard PC-based hardware, the volume of data involved often exceeds the physical RAM available. To address this problem, vectors must be paged out to disk and paged back in when required. This paging is often the performance bottleneck limiting the execution speed of the software. Because the mathematical expressions are specified in advance of execution, predictive solutions are possible – for instance, by treating the problem similarly to register allocation. The problem of allocating scalar variables to processor registers is a widely studied aspect of compiler implementation. A register allocation algorithm decides which variable is held in which register, when the value in a register can be overwritten, and when a value is stored in, or later retrieved from, main memory. In this paper, register allocation techniques are used to plan the paging of vectors in Monte Carlo software. Two register allocation algorithms are applied to invented vector programs written in a prototype low-level vector language and the results are compared. Keywords: Big Data, Compiler, Monte Carlo, Paging, Performance, Register Allocation.

  11. 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

  12. 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

  13. 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.

  14. 24 CFR 92.50 - Formula allocation.

    Science.gov (United States)

    2010-04-01

    ... 24 Housing and Urban Development 1 2010-04-01 2010-04-01 false Formula allocation. 92.50 Section... Development HOME INVESTMENT PARTNERSHIPS PROGRAM Allocation Formula § 92.50 Formula allocation. (a) Jurisdictions eligible for a formula allocation. HUD will provide allocations of funds in amounts determined...

  15. 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.

  16. Allocation of Library Funds to Different Departments of a University--An Operational Research Approach

    Science.gov (United States)

    Goyal, S. K.

    1973-01-01

    Library governing boards are faced with many administrative questions affecting services offered. This paper describes the operational research approach to the problem of allocation of funds to different departments of a university for purchase of materials. A linear programing model is suggested for solving the allocation problem. (5 references)…

  17. 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

    arises when the energy resources demanded by the process domain are either lesser or greater than the resources allocated in the energy domain. This situation may lead to suboptimal process performance and inefficient usage of energy. Solving this allocation problem requires a coordination and control...... mechanism that can balance allocation and demand. In this paper, we propose a novel agent-based software system for solving cooperative control problems. The system produces a Pareto-optimal energy allocation for the process domain while striving to achieve a group objective for balancing the individual......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...

  18. Mathematical model for Quay Crane Scheduling Problem with spatial constraints

    Directory of Open Access Journals (Sweden)

    Azza Lajjam

    2013-11-01

    Full Text Available In the last decades, competition between port container terminals, especially between geographically close one, is rapidly increasing. To improve this competitiveness, terminal managers try to achieve rapid container vessel loading and unloading, that corresponds to a reduction of the time in port for vessels. In this paper, we focus our attention on the operational decision problem related to the seaside area of maritime container terminals. In particular, we study The Quay Crane Scheduling Problem (QCSP which is considered as a core task of managing maritime container terminals and the optimization of these operations affects significantly the time spent by vessels at berth. The main goal behind this planning problem is to find the optimized sequence of loading and unloading tasks on a set of deployed quay cranes in order to exploit the full performances of port's resources while reducing the berth's total time occupation by vessels. In this paper, we provide a rich model for quay crane scheduling problem that covers important parameters such as ready time and due dates of Quay cranes (QCs, safety margin in order to avoid congestion between QCs and precedence relations among tasks. The proposed model seeks for a more compact mathematical formulation that can be easily solved by a standard optimization solver. Thus, we formulated the Quay Crane Scheduling Problem as a mixed-integer linear model that minimizes the sum of the QCs holding cost and tardiness penalty cost.

  19. 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...

  20. Joint Power Allocation at the Base Station and the Relay for Untrusted Relay Cooperation OFDMA Network

    Directory of Open Access Journals (Sweden)

    Weiheng Jiang

    2015-01-01

    first analyze the challenges in solving this problem. The result indicates that our nonconvex joint power allocation is equivalent to a joint MS access control and power allocation. Then, by problem relaxation and the alternating optimization approach, two suboptimal joint MS access control and power allocation algorithms are proposed. These algorithms alternatively solve the subproblem of joint BS and UR power allocation and the subproblem of MS selection until system sum secrecy rate is nonincreasing. In addition, the convergence and computational complexity of the proposed algorithms are analyzed. Finally, simulations results are presented to demonstrate the performance of our proposed algorithms.

  1. 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...

  2. 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...

  3. 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...

  4. 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...

  5. 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...

  6. Advertising Budget Allocation under Uncertainty

    OpenAIRE

    Duncan M. Holthausen, Jr.; Gert Assmus

    1982-01-01

    This article presents a model for the allocation of an advertising budget to geographic market segments, or territories, when the sales response to advertising in each segment is characterized by a probability distribution. It is shown that allocation decisions that are based on the expected sales response may be associated with a relatively large degree of risk and, therefore, non-optimal to a risk-averse manager. The model derives an "efficient frontier" in terms of the expected profit and ...

  7. Loss Allocation in Securitization Transactions

    OpenAIRE

    Günter Franke; Markus Herrmann; Thomas Weber

    2011-01-01

    This paper analyses the loss allocation to First, Second and Third Loss Positions in European collateralized debt obligation transactions. The quality of the underlying asset pool plays a predominant role for the loss allocation. A lower asset pool quality induces the originator to take a higher First Loss Position, but, in a synthetic transaction, a smaller Third Loss Position. The share of expected default losses, borne by the First Loss Position, is largely independent of asset pool qualit...

  8. 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.

  9. 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.

  10. 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.

  11. 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.

  12. OPTIMAL BUFFER ALLOCATION IN TANDEM CLOSED QUEUING NETWORK WITH MULTI SERVERS USING PSO

    OpenAIRE

    K.L.Narasimhamu; V.Venugopal Reddy; C.S.P.Rao

    2014-01-01

    Buffer Allocation Problem is an important research issue in manufacturing system design. Objective of this paper is to find optimum buffer allocation for closed queuing network with multi servers at each node. Sum of buffers in closed queuing network is constant. Attempt is made to find optimum number of pallets required to maximize throughput of manufacturing system which has pre specified space for allocating pallets. Expanded Mean Value Analysis is used to evaluate the perfo...

  13. 50 CFR 660.55 - Allocations.

    Science.gov (United States)

    2010-10-01

    ... Allocations. (a) General. An allocation is the apportionment of a harvest privilege for a specific purpose, to... fisheries (MS, C/P, and IFQ combined). The distribution of the whiting trawl allocation of POP to each... distribution of the whiting trawl allocation of widow to each sector (MS, C/P, and IFQ) will be done pro...

  14. 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...

  15. 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.

  16. 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.

  17. 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...

  18. 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.

  19. Nonlinear Mathematical Programming for Optimal Management of Container Terminals

    Science.gov (United States)

    Seyedalizadeh Ganji, S. R.; Javanshir, H.; Vaseghi, F.

    Berth scheduling is the process of determining the time and position at which each arriving ship will berth. This paper attempts to minimize the serving time to ships, after introducing a proposed mathematical model, considers the berth allocation problem in form of mixed integer nonlinear programming. Then, to credit the proposed model, the results of Imai et al.'s model have been used. The results indicate that because the number of nonlinear variables in the proposed model is less than prior model, so by using the proposed model, we can obtain the results of model in less time rather than prior model.

  20. 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.

  1. Security cost allocation under combined bilateral-pool market dispatch

    International Nuclear Information System (INIS)

    Most electricity markets around the world are a combination of bilateral and pool markets, such as NordPool and NYPOOL. In these models, market participants bid into the pool and also make bilateral contracts with each other. This paper addressed the issue of congestion management and security cost allocation in a power pool market model. The basic idea of security cost allocation is to divide the incurred security cost due to congestion relief into pool and bilateral market based on their flow contribution to the congested line. A newly proposed security cost allocation strategy of the combined bilateral-pool market was also presented along with case studies using IEEE-14 bus system that tested the proposed method. Using the proposed method, it was shown that security costs are allocated to market participants at different prices which reflect the load contribution to the security problem. This solves the problem of the uniform security cost allocation in a pure pool market system having uniform pricing, and provides a proper security signal to market participants. 11 refs., 3 tabs., 4 figs

  2. 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

  3. 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...

  4. 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)

  5. Application of an allocation methodology

    Energy Technology Data Exchange (ETDEWEB)

    Youngblood, R.; de Oliveira, L.F.S.

    1989-01-01

    This paper presents a method for allocating resources to elements of a system for the purpose of achieving prescribed levels of defense-in-depth at minimal cost. The method makes extensive use of logic modelling. An analysis of a simplified high-level waste repository is used as an illustrative application of the method. It is shown that it is possible to allocate quality control costs (or demonstrated performance) in an optimal way over elements of a conceptual design. 6 refs., 3 figs., 2 tabs.

  6. Three Essays on Time Allocation

    OpenAIRE

    Gonz??lez Chapela, Jorge

    2004-01-01

    This thesis studies from the theoretical and empirical points of view the allocation of time by part of rational individuals motivated by technological changes in the economy. Drawing upon the labor market viewpoint of Lucas and Rapping (1969), the first two chapters are respectively concerned with the life-cycle allocation of labor effort by part of prime-age males and females, and they seek to ask for the attention over a topic of research that seemed closed from the mid 1980's: the importa...

  7. 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,

  8. 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.

  9. OPTIMAL BUFFER ALLOCATION IN TANDEM CLOSED QUEUING NETWORK WITH MULTI SERVERS USING PSO

    Directory of Open Access Journals (Sweden)

    K.L.Narasimhamu

    2014-11-01

    Full Text Available Buffer Allocation Problem is an important research issue in manufacturing system design. Objective of this paper is to find optimum buffer allocation for closed queuing network with multi servers at each node. Sum of buffers in closed queuing network is constant. Attempt is made to find optimum number of pallets required to maximize throughput of manufacturing system which has pre specified space for allocating pallets. Expanded Mean Value Analysis is used to evaluate the performance of closed queuing network. Particle Swarm Optimization is used as generative technique to optimize the buffer allocation. Numerical experiments are shown to explain effectiveness of procedure.

  10. Optimal Constrained Resource Allocation Strategies under Low Risk Circumstances

    OpenAIRE

    Andreica, Mugurel Ionut; Andreica, Madalina; Visan, Costel

    2009-01-01

    The computational geometry problems studied in this paper were inspired by tasks from the International Olympiad in Informatics (some of which were personally attended by the authors). The attached archive contains task descriptions, authors' solutions, as well as some official solutions of the tasks. International audience In this paper we consider multiple constrained resource allocation problems, where the constraints can be specified by formulating activity dependency restrictions o...

  11. Optimal allocation in balanced sampling

    OpenAIRE

    Tillé, Yves; Favre, Anne-Catherine

    2016-01-01

    The development of new sampling methods allows the selection of large balanced samples. In this paper we propose a method for computing optimal inclusion probabilities for balanced samples. Next, we show that the optimal Neyman allocation is a particular case of this method.

  12. Resource Allocation: A Participatory Process.

    Science.gov (United States)

    Reid, Alban E.

    Whether a participatory process for resource allocation in a public community college setting occurs depends upon several key factors: (1) the leadership style of the institutional chief executive officer; (2) the administrative organizational structure of the institution; (3) the relationship which exists between and among members of the various…

  13. Administrators' Decisions about Resource Allocation

    Science.gov (United States)

    Knight, William E.; Folkins, John W.; Hakel, Milton D.; Kennell, Richard P.

    2011-01-01

    Do academic administrators make decisions about resource allocation differently depending on the discipline receiving the funding? Does an administrator's academic identity influence these decisions? This study explored those questions with a sample of 1,690 academic administrators at doctoral-research universities. Participants used fictional…

  14. 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,…

  15. 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

  16. Statistically robust resource allocation for distributed multi-carrier cooperative networks

    Institute of Scientific and Technical Information of China (English)

    XING ChengWen; FEI ZeSong; LI Na; HAN YanTao; DANEV Danyo; KUANG JingMing

    2013-01-01

    In this paper, we investigate joint subcarrier and power allocation scheme for distributed multicarrier cooperative networks with imperfect channel state information. Using practical channel estimation algorithms, the statistic model of the channel estimation error is first derived. Then based on the channel error model, the resource allocation scheme aims at maximizing the sum rate of the overall network. Specifically, both subcarrier allocation and power allocation are taken into account. In the subcarrier allocation, a realistic problem of the power leakage between neighboring subcarriers is also addressed. Furthermore, based on Lagrange dual-decomposition algorithm, a practical power allocation algorithm is proposed. Finally, the simulation results demonstrate the performance advantages of the proposed robust design.

  17. 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快速

  18. 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.

  19. 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.

  20. 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.

  1. 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.

  2. 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.

  3. Distributed Rate Allocation Policies for Multi-Homed Video Streaming over Heterogeneous Access Networks

    CERN Document Server

    Zhu, Xiaoqing; Singh, Jatinder Pal; Alpcan, Tansu; Girod, Bernd

    2010-01-01

    We consider the problem of rate allocation among multiple simultaneous video streams sharing multiple heterogeneous access networks. We develop and evaluate an analytical framework for optimal rate allocation based on observed available bit rate (ABR) and round-trip time (RTT) over each access network and video distortion-rate (DR) characteristics. The rate allocation is formulated as a convex optimization problem that minimizes the total expected distortion of all video streams. We present a distributed approximation of its solution and compare its performance against H-infinity optimal control and two heuristic schemes based on TCP-style additive-increase-multiplicative decrease (AIMD) principles. The various rate allocation schemes are evaluated in simulations of multiple high-definition (HD) video streams sharing multiple access networks. Our results demonstrate that, in comparison with heuristic AIMD-based schemes, both media-aware allocation and H-infinity optimal control benefit from proactive congesti...

  4. 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.

  5. 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.

  6. 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.

  7. 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...

  8. 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.

  9. An efficient approach to enhance 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 research on short range wireless communications, such as Bluetooth, has gained increasing in-terest, 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 HDICA is proposed as an approximated solution of the stated optimization problem that satisfies...... quality of service requirements and topologically induced constraints in the Bluetooth network, such as node and link capacity limitations. The proposed scheme is decentralized and complies with frequent changes of topology as well as capacity limitations and flow requirements in the network. Simulation...

  10. 15 CFR 923.110 - Allocation formula.

    Science.gov (United States)

    2010-01-01

    ... 15 Commerce and Foreign Trade 3 2010-01-01 2010-01-01 false Allocation formula. 923.110 Section... Grants § 923.110 Allocation formula. (a) As required by subsection 306(a), the Secretary may make grants...) Allocation formula factors and weighting. Each State eligible to receive a financial assistance award...

  11. 24 CFR 574.130 - Formula allocations.

    Science.gov (United States)

    2010-04-01

    ... 24 Housing and Urban Development 3 2010-04-01 2010-04-01 false Formula allocations. 574.130... URBAN DEVELOPMENT COMMUNITY FACILITIES HOUSING OPPORTUNITIES FOR PERSONS WITH AIDS Formula Entitlements § 574.130 Formula allocations. (a) Data sources. HUD will allocate funds based on the number of cases...

  12. 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...

  13. 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...

  14. 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...

  15. 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...

  16. 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...

  17. 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...

  18. 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...

  19. 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...

  20. 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...

  1. 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...

  2. 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...

  3. 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...

  4. 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

  5. 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...

  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. 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.

  8. 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.

  9. Optimum Allocation of Distributed Generation in Distribution Network using Cuckoo Search Algorigthm

    OpenAIRE

    NASAB, Farhad Naeimi; SIMAB, Mohsen; SIAHI, Mehdi

    2015-01-01

    Abstract. This work presents an intelligent methodology for the optimal distributed generation allocation associated with the optimal reconfiguration in radial distribution networks to minimize energy losses. The proposed solution to this problem is framed as a non-linear combinatorial optimization problem and status of switches is non-differentiable which is solved using Binary Cuckoo Search Algorigthm (BCSA). The results show that the optimal distributed generation allocation with the recon...

  10. The allocation of entrepreneurial effort and its implications on economic growth

    OpenAIRE

    Muñoz Pérez, Félix Fernando; Encinar del Pozo, María Isabel; Otamendi, Francisco Javier

    2013-01-01

    The problem to allocate effort to innovation activities is defined and modelled for any single entrepreneur according to its propensity to innovate, which combines pure innovation and rent-seeking strategies. The allocation problem is solved both analytically and via simulation. The individual decisions measured in units of innovation are then aggregated to calculate the innovation quantity for a given population based on the distribution of heterogeneous entrepreneurs. The ent...

  11. Resource Allocation Model for Modelling Abstract RTOS on Multiprocessor System-on-Chip

    DEFF Research Database (Denmark)

    Virk, Kashif Munir; Madsen, Jan

    2003-01-01

    Resource Allocation is an important problem in RTOS's, and has been an active area of research. Numerous approaches have been developed and many different techniques have been combined for a wide range of applications. In this paper, we address the problem of resource allocation in the context of...... modelling an abstract RTOS on multiprocessor SoC platforms. We discuss the implementation details of a simplified basic priority inheritance protocol for our abstract system model in SystemC....

  12. Intrahousehold allocation and gender relations

    OpenAIRE

    Quisumbing, Agnes R; Maluccio, John A.

    2000-01-01

    The paper reviews recent theory and empirical evidence testing unitary versus collective models of the household. In contrast to the unitary model, the collective model posits that individuals within households have different preferences and do not pool their income. Moreover, the collective model predicts that intrahousehold allocations reflect differences in preferences and "bargaining power" of individuals within the household. Using new household data sets from Bangladesh, Indonesia, Ethi...

  13. 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.

  14. 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.

  15. 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.

  16. The Study of Resource Allocation among Software Development Phases: An Economics-Based Approach

    Directory of Open Access Journals (Sweden)

    Peleg Yiftachel

    2011-01-01

    Full Text Available This paper presents an economics-based approach for studying the problem of resource allocation among software development phases. Our approach is structured along two parallel axes: theoretical and empirical. We developed a general economic model for analyzing the allocation problem as a constrained profit maximization problem. The model, based on a novel concept of software production function, considers the effects of different allocations of development resources on output measures of the resulting software product. An empirical environment for evaluating and refining the model is presented, and a first exploratory study for characterizing the model's components and developers' resource allocation decisions is described. The findings illustrate how the model can be applied and validate its underlying assumptions and usability. Future quantitative empirical studies can refine and substantiate various aspects of the proposed model and ultimately improve the productivity of software development processes.

  17. Impact analysis of channel dimensions on the effective utilization ratio of container terminal berths%航道尺度对集装箱码头泊位有效利用率的影响

    Institute of Scientific and Technical Information of China (English)

    唐国磊; 王文渊; 郭子坚; 宋向群; 于旭会; 张冉

    2016-01-01

    The approach channel has become a key factor constraining the trafficability of seaports, and the impact of channel dimensions on the effective utilization ratio of berths needs to be considered when planning a container terminal. Using a container terminal as an example, this study integrated ship navigation and operation into a simu⁃lation of port construction and operation. Applying related industrial standards, we designed a series of simulation plans and determined the parameters of the simulation model. We then quantitatively analyzed the relationship be⁃tween the effective utilization ratio of the container terminal berths, and the quantity of berths and channel lines and the duration of navigation, to provide a theoretical basis on which to determine the effective utilization ratio of con⁃tainer terminal berths and to estimate the annual trafficability of berths. The results demonstrated that the dimen⁃sions of the approach channel are important in achieving a satisfactory effective utilization ratio of berths, especially with a single⁃line long channel. This study recommends using computer simulation technology when assessing the general port plane layout of real engineering projects to ensure the efficient operation of the port.%进港航道已经成为制约港口通过能力发挥的因素之一,在港口规划时应考虑航道尺度对泊位有效利用率的影响。本文以集装箱码头为例,将船舶航行作业过程引入港口生产作业仿真模型;根据相关行业规范,设计一系列仿真试验方案并确定仿真模型参数;定量分析集装箱码头泊位有效利用率与泊位数、航道线数和航行历时之间的影响关系,为合理确定集装箱码头泊位有效利用率、估算年泊位通过能力提供理论依据。结果表明,在选取合理泊位有效利用率时,进港航道尺度不可忽略,尤其是单线长航道。同时,建议在实际工程中采用计算机仿真技术

  18. 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.

  19. 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.

  20. 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.

  1. 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.

  2. 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.

  3. 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

  4. Optimal resource allocation for defense of targets based on differing measures of attractiveness.

    Science.gov (United States)

    Bier, Vicki M; Haphuriwat, Naraphorn; Menoyo, Jaime; Zimmerman, Rae; Culpen, Alison M

    2008-06-01

    This article describes the results of applying a rigorous computational model to the problem of the optimal defensive resource allocation among potential terrorist targets. In particular, our study explores how the optimal budget allocation depends on the cost effectiveness of security investments, the defender's valuations of the various targets, and the extent of the defender's uncertainty about the attacker's target valuations. We use expected property damage, expected fatalities, and two metrics of critical infrastructure (airports and bridges) as our measures of target attractiveness. Our results show that the cost effectiveness of security investment has a large impact on the optimal budget allocation. Also, different measures of target attractiveness yield different optimal budget allocations, emphasizing the importance of developing more realistic terrorist objective functions for use in budget allocation decisions for homeland security. PMID:18643831

  5. Defining and solving the energy allocation problem with continuous prosumers

    OpenAIRE

    Cerquides, Jesús; Picard, Gauthier; Rodríguez-Aguilar, Juan A.

    2015-01-01

    International audience Decentralized energy production is meant to reduce generation and distribution inefficiencies, leading to major economic and environmental benefits. This new model is meant to be supported by smart grids, electricity networks that can intelligently integrate the actions of all users connected to them —generators, consumers, and prosumers (those that do both)— to efficiently deliver sustainable, economic and secure electricity supplies. A major research challenge is t...

  6. Optimising of resource utilisation at a university - an allocation problem

    Directory of Open Access Journals (Sweden)

    C.J. Scogings

    2003-12-01

    Full Text Available Student enrolment at the University of Natal has been increasing steadily over the years. Moreover additional new courses are introduced from time to time. Despite this State subsidies are declining in real terms. These factors imply escalating demands on physical resources. Historically, at this university, lecture rooms have been used only during the mornings and laboratories only during the afternoons. An obvious solution to meet the demand for accommodation is to double up on the number of timetabled periods so that the lecture rooms are in use the whole day. Since there are many classes which are in fact too large to be accommodated in any one room it is also necessary to split these classes into separate lecture groups. Likewise classes have to be divided up into several smaller groups for laboratory and tutorial sessions. The policy at this university is to encourage students to choose curricula including courses selected from as wide a range as possible. The above timetable strategy apparently facilitates this. In practice, however, to ensure that student numbers are evenly distributed across alternative sessions for a given course and to do this for all courses simultaneously while avoiding clashes is not a simple matter.

  7. 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.

  8. Optimal Asset Allocation for Sovereign Wealth Funds: Theory and Practice

    OpenAIRE

    Zvi Bodie; Marie Brière

    2014-01-01

    This paper addresses management of sovereign wealth from the perspective of the theory of contingent claims.Starting with the sovereign’s balance sheet, we frame sovereign fund management as an asset-liability management (ALM) problem, covering all public entities and taking explicit account of all sources of risks affecting government resources and expenditures. Real-life SWFs asset allocations differ strongly from theoretical ones. Financial management of the sovereign balance sheet is hamp...

  9. How Compatible is Perfect Competition with Transmission Loss Allocation Methods?

    OpenAIRE

    Jing, Dai; Phulpin, Yannick; Rious, Vincent; Ernst, Damien

    2008-01-01

    International audience This paper addresses the problem of transmission loss allocation in a power system where the generators, the demands and the system operator are independent. We suppose that the transmission losses are exclusively charged to the generators, which are willing to adopt a perfectly competitive behavior. In this context, their offers must reflect their production costs and their transmission loss costs, the latter being unknown beforehand and having to be predicted. We a...

  10. Optimal Resource Allocation Between Spot and Package Demands

    OpenAIRE

    Yoram Kinberg; Ambar G. Rao; Ephraim F Sudit

    1980-01-01

    This paper deals with the problem of allocating fixed resources between two types of demands; (a) spot demand; and (b) package (subscription) demand---demand that is satisfied by selling usage rights over a prespecified time period prior to actual consumption. In Model 1, a probabilistic spot demand for a single resource, stationary over time, is assumed together with externally determined spot and package pricing. It is shown that the optimal (profit maximizing) policy is to sell all the pac...

  11. Latent IBP Compound Dirichlet Allocation.

    Science.gov (United States)

    Archambeau, Cedric; Lakshminarayanan, Balaji; Bouchard, Guillaume

    2015-02-01

    We introduce the four-parameter IBP compound Dirichlet process (ICDP), a stochastic process that generates sparse non-negative vectors with potentially an unbounded number of entries. If we repeatedly sample from the ICDP we can generate sparse matrices with an infinite number of columns and power-law characteristics. We apply the four-parameter ICDP to sparse nonparametric topic modelling to account for the very large number of topics present in large text corpora and the power-law distribution of the vocabulary of natural languages. The model, which we call latent IBP compound Dirichlet allocation (LIDA), allows for power-law distributions, both, in the number of topics summarising the documents and in the number of words defining each topic. It can be interpreted as a sparse variant of the hierarchical Pitman-Yor process when applied to topic modelling. We derive an efficient and simple collapsed Gibbs sampler closely related to the collapsed Gibbs sampler of latent Dirichlet allocation (LDA), making the model applicable in a wide range of domains. Our nonparametric Bayesian topic model compares favourably to the widely used hierarchical Dirichlet process and its heavy tailed version, the hierarchical Pitman-Yor process, on benchmark corpora. Experiments demonstrate that accounting for the power-distribution of real data is beneficial and that sparsity provides more interpretable results. PMID:26353244

  12. 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

  13. 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)

  14. Multidemand Multisource Order Quantity Allocation with Multiple Transportation Alternatives

    Directory of Open Access Journals (Sweden)

    Jun Gang

    2015-01-01

    Full Text Available This paper focuses on a multidemand multisource order quantity allocation problem with multiple transportation alternatives. To solve this problem, a bilevel multiobjective programming model under a mixed uncertain environment is proposed. Two levels of decision makers are considered in the model. On the upper level, the purchaser aims to allocate order quantity to multiple suppliers for each demand node with the consideration of three objectives: total purchase cost minimization, total delay risk minimization, and total defect risk minimization. On the lower level, each supplier attempts to optimize the transportation alternatives with total transportation and penalty costs minimization as the objective. In contrast to prior studies, considering the information asymmetry in the bilevel decision, random and fuzzy random variables are used to model uncertain parameters of the construction company and the suppliers. To solve the bilevel model, a solution method based on Kuhn-Tucker conditions, sectional genetic algorithm, and fuzzy random simulation is proposed. Finally, the applicability of the proposed model and algorithm is evaluated through a practical case from a large scale construction project. The results show that the proposed model and algorithm are efficient in dealing with practical order quantity allocation problems.

  15. Practical Solutions for Reducing Container Ships’ Waiting Times at Ports Using Simulation Model

    Institute of Scientific and Technical Information of China (English)

    Abdorreza Sheikholeslami; Gholamreza Ilati; Yones Eftekhari Yeganeh

    2013-01-01

    The main challenge for container ports is the planning required for berthing container ships while docked in port. Growth of containerization is creating problems for ports and container terminals as they reach their capacity limits of various resources which increasingly leads to traffic and port congestion. Good planning and management of container terminal operations reduces waiting time for liner ships. Reducing the waiting time improves the terminal’s productivity and decreases the port difficulties. Two important keys to reducing waiting time with berth allocation are determining suitable access channel depths and increasing the number of berths which in this paper are studied and analyzed as practical solutions. Simulation based analysis is the only way to understand how various resources interact with each other and how they are affected in the berthing time of ships. We used the Enterprise Dynamics software to produce simulation models due to the complexity and nature of the problems. We further present case study for berth allocation simulation of the biggest container terminal in Iran and the optimum access channel depth and the number of berths are obtained from simulation results. The results show a significant reduction in the waiting time for container ships and can be useful for major functions in operations and development of container ship terminals.

  16. Practical solutions for reducing container ships' waiting times at ports using simulation model

    Science.gov (United States)

    Sheikholeslami, Abdorreza; Ilati, Gholamreza; Yeganeh, Yones Eftekhari

    2013-12-01

    The main challenge for container ports is the planning required for berthing container ships while docked in port. Growth of containerization is creating problems for ports and container terminals as they reach their capacity limits of various resources which increasingly leads to traffic and port congestion. Good planning and management of container terminal operations reduces waiting time for liner ships. Reducing the waiting time improves the terminal's productivity and decreases the port difficulties. Two important keys to reducing waiting time with berth allocation are determining suitable access channel depths and increasing the number of berths which in this paper are studied and analyzed as practical solutions. Simulation based analysis is the only way to understand how various resources interact with each other and how they are affected in the berthing time of ships. We used the Enterprise Dynamics software to produce simulation models due to the complexity and nature of the problems. We further present case study for berth allocation simulation of the biggest container terminal in Iran and the optimum access channel depth and the number of berths are obtained from simulation results. The results show a significant reduction in the waiting time for container ships and can be useful for major functions in operations and development of container ship terminals.

  17. 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.

  18. 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.

  19. 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.

  20. Optimization of resource allocation in computational grids

    Directory of Open Access Journals (Sweden)

    Debashreet Das

    2015-06-01

    Full Text Available The resource allocation in Grid computing system needs to be scalable, reliable and smart. It should also be adaptable to change its allocation mechanism depending upon the environment and user’s requirements. Therefore, a scalable and optimized approach for resource allocation where the system can adapt itself to the changing environment and the fluctuating resources is essentially needed. In this paper, a Teaching Learning based optimization approach for resource allocation in Computational Grids is proposed. The proposed algorithm is found to outperform the existing ones in terms of execution time and cost. The algorithm is simulated using GRIDSIM and the simulation results are presented.

  1. 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. PMID:27504236

  2. 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.

  3. 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...

  4. 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.

  5. On Resource Allocation in Fading Multiple Access Channels - An Efficient Approximate Projection Approach

    CERN Document Server

    ParandehGheibi, Ali; Ozdaglar, Asuman; Medard, Muriel

    2008-01-01

    We consider the problem of rate and power allocation in a multiple-access channel. Our objective is to obtain rate and power allocation policies that maximize a general concave utility function of average transmission rates on the information theoretic capacity region of the multiple-access channel. Our policies does not require queue-length information. We consider several different scenarios. First, we address the utility maximization problem in a nonfading channel to obtain the optimal operating rates, and present an iterative gradient projection algorithm that uses approximate projection. By exploiting the polymatroid structure of the capacity region, we show that the approximate projection can be implemented in time polynomial in the number of users. Second, we consider resource allocation in a fading channel. Optimal rate and power allocation policies are presented for the case that power control is possible and channel statistics are available. For the case that transmission power is fixed and channel ...

  6. 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.

  7. 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.

  8. The allocation of the burden of proof in mixed disputes in legal and non-legal contexts

    NARCIS (Netherlands)

    E.T. Feteris

    2010-01-01

    In this paper the problems pertaining to the allocation of the burden of proof in mixed disputes in legal and non-legal contexts are addressed. First the traditional view on the allocation of the burden of proof based on Whately’s legal conception of ‘presumption’ is discussed. Whately’s proposal is

  9. 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...

  10. Sovereign Wealth and Risk Management. A New Framework for Optimal Asset Allocation of Sovereign Wealth

    OpenAIRE

    Bodie, Zvi; Brière, Marie

    2013-01-01

    This paper sets out a new analytical framework for optimal asset allocation of sovereign wealth, based on the theory of contingent claim ana lysis (CCA) applied to the sovereign’s economic balance sheet. A country solves an asset-l iability management (ALM) problem between its sources of income and its expenditures. We derive analytically the optimal asset allocation of sovereign wealth, taking explic it account of all sources of risks affecting the sovereign’s balance sheet. The optima l com...

  11. Resource allocation in cellular networks employing mobile femtocells with deterministic mobility

    OpenAIRE

    Jangsher, S; Li, VOK

    2013-01-01

    Improvement in signal quality and service quality by femtocells offers a natural opportunity for them to be deployed in vehicles. However, resource allocation with mobile femtocells becomes challenging due to the dynamic interference patterns as the mobile femtocells move. In this paper, we introduce the problem of allocating resources in a cellular network with mobile femtocells. We consider two types of femtocells in the scenario, a) fixed femtocells (deployed in stationary location e.g tra...

  12. Practice Prize Winner --Dynamic Marketing Budget Allocation Across Countries, Products, and Marketing Activities

    OpenAIRE

    Marc Fischer; Sönke Albers; Nils Wagner; Monika Frie

    2011-01-01

    Previous research on marketing budget decisions has shown that profit improvement from better allocation across products or regions is much higher than from improving the overall budget. However, despite its high managerial relevance, contributions by marketing scholars are rare. In this paper, we introduce an innovative and feasible solution to the dynamic marketing budget allocation problem for multiproduct, multicountry firms. Specifically, our decision support model allows determining nea...

  13. 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.

  14. 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.

  15. 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.

  16. Auction Mechanism to Allocate Air Traffic Control Slots

    Science.gov (United States)

    Raffarin, Marianne

    2003-01-01

    This article deals with an auction mechanism for airspace slots, as a means of solving the European airspace congestion problem. A disequilibrium, between Air Traffic Control (ATC) services supply and ATC services demand are at the origin of almost one fourth of delays in the air transport industry in Europe. In order to tackle this congestion problem, we suggest modifying both pricing and allocation of ATC services, by setting up an auction mechanism. Objects of the auction will be the right for airlines to cross a part of the airspace, and then to benefit from ATC services over a period corresponding to the necessary time for the crossing. Allocation and payment rules have to be defined according to the objectives of this auction. The auctioneer is the public authority in charge of ATC services, whose aim is to obtain an efficient allocation. Therefore, the social value will be maximized. Another objective is to internalize congestion costs. To that end, we apply the principle of Clarke-Groves mechanism auction: each winner has to pay the externalities imposed on other bidders. The complex context of ATC leads to a specific design for this auction.

  17. 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.

  18. Adaptive Subcarrier and Bit Allocation for Downlink OFDMA System with Proportional Fairness

    Directory of Open Access Journals (Sweden)

    Sudhir B. Lande

    2011-11-01

    Full Text Available This paper investigates the adaptive subcarrier and bit allocation algorithm for OFDMA systems. To minimize overall transmitted power, we propose a novel adaptive subcarrier and bit allocation algorithm based on channel state information (CSI and quality state information (QSI. A suboptimal approach that separately performs subcarrier allocation and bit loading is proposed. It is shown that a near optimal solution is obtained by the proposed algorithm which has low complexity compared to that of other conventional algorithm. We will study the problem of finding an optimal sub-carrier and power allocation strategy for downlink communication to multiple users in an OFDMA based wireless system.Assuming knowledge of the instantaneous channel gains for all users, we propose a multiuser OFDMA subcarrier, and bit allocation algorithm to minimize the total transmit power. This is done by assigning each user a set of subcarriers and by determining the number of bits and the transmit power level for each subcarrier. The objective is to minimize the total transmitted power over the entire network to satisfy the application layer and physical layer. We formulate this problem as a constrained optimization problem and present centralized algorithms. The simulation results will show that our approach results in an efficient assignment of subcarriers and transmitter power levels in terms of the energy required for transmitting each bit of information, to address this need, we also present a bit loading algorithm for allocating subcarriers and bits in order to satisfy the rate requirements of the links.

  19. 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...

  20. 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...

  1. 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,...

  2. Optimal Allocation in Stratified Randomized Response Model

    Directory of Open Access Journals (Sweden)

    Javid Shabbir

    2005-07-01

    Full Text Available A Warner (1965 randomized response model based on stratification is used to determine the allocation of samples. Both linear and log-linear cost functions are discussed under uni and double stratification. It observed that by using a log-linear cost function, one can get better allocations.

  3. 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.

  4. Quantitative prediction of genome-wide resource allocation in bacteria.

    Science.gov (United States)

    Goelzer, Anne; Muntel, Jan; Chubukov, Victor; Jules, Matthieu; Prestel, Eric; Nölker, Rolf; Mariadassou, Mahendra; Aymerich, Stéphane; Hecker, Michael; Noirot, Philippe; Becher, Dörte; Fromion, Vincent

    2015-11-01

    Predicting resource allocation between cell processes is the primary step towards decoding the evolutionary constraints governing bacterial growth under various conditions. Quantitative prediction at genome-scale remains a computational challenge as current methods are limited by the tractability of the problem or by simplifying hypotheses. Here, we show that the constraint-based modeling method Resource Balance Analysis (RBA), calibrated using genome-wide absolute protein quantification data, accurately predicts resource allocation in the model bacterium Bacillus subtilis for a wide range of growth conditions. The regulation of most cellular processes is consistent with the objective of growth rate maximization except for a few suboptimal processes which likely integrate more complex objectives such as coping with stressful conditions and survival. As a proof of principle by using simulations, we illustrated how calibrated RBA could aid rational design of strains for maximizing protein production, offering new opportunities to investigate design principles in prokaryotes and to exploit them for biotechnological applications. PMID:26498510

  5. 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.

  6. 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.

  7. 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.

  8. Novos limitantes lagrangeanos para o problema probabilístico de localização-alocação de máxima cobertura utilizando grafos de cobertura New lagrangean bounds for the probabilistic maximal covering location-allocation problem using covering graphs

    Directory of Open Access Journals (Sweden)

    Francisco de Assis Corrêa

    2009-06-01

    Full Text Available O Problema Probabilístico de Localização-Alocação de Máxima Cobertura (PPLAMC consiste em localizar facilidades, maximizando a população atendida e fornecendo um bom nível de serviço para toda a população, ou seja, deve-se garantir que um usuário, ao chegar a um centro, não espere mais que um tempo máximo permitido ou não encontre uma fila de atendimento com um número de usuário maior que um valor máximo. Estes dois parâmetros dependem da taxa de chegada dos usuários e do atendimento, ambos probabilísticos. Devido às dificuldades intrínsecas do problema, neste artigo são discutidos limitantes lagrangeanos para o PPLAMC obtidos com a relaxação lagrangeana com clusters (LagClus. Na sua proposição inicial, a LagClus utilizou um grafo de conflitos, porém neste artigo esta relaxação foi aplicada em um grafo especial denominado grafo de cobertura.The Probabilistic Maximal Covering Location-Allocation Problem (PMCLAP aims to locate facilities maximizing the number of people served and providing a good level of service. This means that customers would not have to wait longer than the wait time established or to wait in long lines. These parameters are influenced by the number of the requests for service and service time, both probabilistic. The PMCLAP is NP-Complete and in this paper we study bounds with a Lagrangean Relaxation with Clusters (LagClus. Instead of using a conflict graph to represent a problem, in this paper another strategy for the use of LagClus using a special graph called covering graph is proposed. This approach provides interesting bounds.

  9. 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

  10. 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.

  11. 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.

  12. Tendances Carbone no. 79 'Free allocations under Phase 3 benchmarks: early evidence of what has changed'

    International Nuclear Information System (INIS)

    Among the publications of CDC Climat Research, 'Tendances Carbone' bulletin specifically studies the developments of the European market for CO2 allowances. This issue addresses the following points: One of the most controversial changes to the EU ETS in Phase 3 (2013-2020) has been the introduction of emissions-performance benchmarks for determining free allocations to non-electricity producers. Phases 1 and 2 used National Allocation Plans (NAPs). For practical reasons NAPs were drawn up by each Member State, but this led to problems, including over-generous allowance allocation, insufficiently harmonised allocations across countries and distorted incentives to reduce emissions. Benchmarking tries to fix things by allocating the equivalent of 100% of allowances needed if every installation used the best available technology. But this is not universally popular and industries say that they might lose international competitiveness. So a new study by CDC Climat and the Climate Economics Chair examined the data from the preliminary Phase 3 free allocations of 20 EU Member States and asked: how much are free allocations actually going to change with benchmarking?

  13. Development of a Joint-Cost-Allocation Manual for Integrated Community Energy Systems (ICES)

    Energy Technology Data Exchange (ETDEWEB)

    None

    1978-09-01

    The problem addressed is the determination of an appropriate-cost-allocation system for an ICES. The use of a central cogenerating facility at the heart of the ICES means that some portion of the system costs are ''joint'': that is, some system components, and their associated costs, are not clearly identifiable with any single system output. An allocated portion of the joint costs must be added to the costs that are clearly assignable to each ICES function to arrive at a reasonable estimate of the total costs of providing each type of energy output. This Phase 1 report examines technical factors; reviews and synthesizes the relevant economic theory; assesses three generic approaches to cost allocation (public projects, cost accounting, mathematical programming); and surveys current utility and regulatory allocation procedures. Based on these steps, conclusions to date are: (1) economic theory suggests that cost allocation is unnecessary for optimal feasibility, pricing, and output decisions; (2) reasonable and practicable allocations are required for regulatory purposes and cost-sharing arrangements; (3) no single approach to cost allocation in practice is wholly satisfactory; (4) the mathematical programming approach seems most promising at this juncture; and (5) implementation of any method is dependent on data availability.

  14. 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,

  15. 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.

  16. 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.

  17. 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.

  18. 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...

  19. 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.

  20. 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

  1. 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.

  2. Kidney allocation for transplantation: some aspects of ethics and comparative law.

    Science.gov (United States)

    Petrini, C

    2012-09-01

    The allocation of organs is a crucial ethical issue. The importance attached to different allocation criteria differs considerably among the various national and international organizations. The balance between justice-centered and utility-centered systems is shifting and there are signs of a possible swing away from systems centered mainly on waiting times to others centered mainly on criteria of utility. This evolution is very significant and seems to run counter to the main stream of modern bioethics. Examples from different national policies are given herein. Particular attention is given to Europe, where national bioethics committees have tended to ignore the aspect of organ allocation. By overemphasizing the issues related to informed consent, the ethical challenges arising from the problems of resource allocation are often relegated to second place. PMID:22974843

  3. 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.

  4. Draft regulatory analysis: notice of proposed rulemaking motor gasoline allocation revisions

    Energy Technology Data Exchange (ETDEWEB)

    None

    1980-06-01

    The Draft Regulatory Analysis is prepared for those proposed regulations which either may have a major impact on the general economy, individual industries, or geographic regions and levels of government, or may be significant in that they affect important DOE policy concerns and are the object of public interest. The problems and proposed solutions for the Notice of Proposed Rulemaking and Public Hearings on the Motor Gasoline Allocation Program are examined. The ERA's mandate for this program is set out in the Emergency Petroleum Allocation Act of 1973. Under this Act, the President is empowered to enforce, at his discretion, price and allocation controls on petroleum and petroleum products, including gasoline, through September 30, 1981. The Act sets the following allocation goals: protect public health; maintain public services and agricultural operations; foster competition in the petroleum industry; distribute petroleum among industry sectors and US regions equitably; and minimize economic disruption and unnecessary interference wth market mechanisms.

  5. 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...

  6. Allocating the Fuzzy Resources to Two-Stage Systems

    Directory of Open Access Journals (Sweden)

    Zahra Ghelej Beigi

    2014-03-01

    Full Text Available Data envelopment analysis (DEA is a non-parametric approach for measuring the efficiency of decision making units (DMUs that use multiple inputs in order to produce multiple outputs. In most real applications, DMUs have a two-stage network process which can be used for management of organizations such as hospitals, insurance companies, banks, and etc. The data are crisp in the standard DEA model whereas there are many problems in the real life that data may be uncertain. Thus, in this paper, we propose a model to estimate the efficiency of DMUs with a two-stage structure and the inputs and outputs of DMUs are fuzzy data. Also, DEA can be used to allocate resources; therefore, we propose a new method to allocate resources for DMUs with a two-stage structure and fuzzy data. The main aim of this allocation is preserving the efficiency score of DMUs. We illustrate the applicability of models by using a numerical example.

  7. 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.

  8. 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.

  9. Optimal Resource Allocation in Library Systems

    Science.gov (United States)

    Rouse, William B.

    1975-01-01

    Queueing theory is used to model processes as either waiting or balking processes. The optimal allocation of resources to these processes is defined as that which maximizes the expected value of the decision-maker's utility function. (Author)

  10. Cost allocation. Combined heat and power production

    International Nuclear Information System (INIS)

    The benefits of Combined Heat and Power (CHP) generation are discussed. The include improvement in energy intensity of 1% by 2010, 85-90% efficiency versus 40-50% of condensation power and others. Share of CHP electricity production in ERRA countries is presented.Solutions for a development CHP cost allocation are considered. Conclusion are presented for CHP production cost allocation. (R.P.)

  11. Liability valuation and optimal asset allocation

    OpenAIRE

    Inkmann, Joachim; Blake, David

    2004-01-01

    Current approaches to asset-liability management employ a sequence of distinct procedures to value liabilities and determine the asset allocation. First, a discount rate that is usually dic-tated by accounting standards is used to value liabilities. Second, the asset allocation is determined by maximizing some objective function in the surplus of assets over liabilities, taken as given the valuation of liabilities. We introduce a model that allows for the joint valuation of liabilities and th...

  12. Efficient and fair allocation of aid.

    OpenAIRE

    Patrick Guillaumont; Phu Nguyen-Van; Thi Kim Cuong Pham; Laurent Wagner

    2015-01-01

    This paper proposes a model of aid allocating which aims to equalize the opportunity between recipient countries to reduce the poverty, in particular the millennium development goal of reducing the poverty by half. The model also takes into account the natural deficit which is defined by the gap between the growth rate required to reach this millennium goal and the actual growth rate observed in the recipient country. The resulting optimal aid allocation is computed using the estimation of th...

  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. Frequency allocations accommodate new commercial applications

    Science.gov (United States)

    Stiglitz, Martin R.; Blanchard, Christine

    1992-07-01

    An overview is presented of the 1992 World Administrative Radio Frequency Conference whose principal responsibility is to review and update the International Radio Regulations, including the International Table of Frequency Allocations and the procedures for utilizing the allocations. Consideration is given to the earth exploration-satellite service, the space research space operation, general-satellite service, and wind profiler radar. Attention is given to shortwave or HF broadcasting, mobile and mobile-satellite services and future public land mobile telecommunications systems.

  15. 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

  16. 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...

  17. 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.

  18. [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.

  19. 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...

  20. 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...

  1. Efficient and Fair Bandwidth Allocation AQM Scheme for Wireless Networks

    Directory of Open Access Journals (Sweden)

    Rafe Alasem

    2010-05-01

    Full Text Available Heterogeneous Wireless Networks are considered nowadays as one of the potential areas in research and development. The traffic management’s schemes that have been used at the fusion points between the different wireless networks are classical and conventional. This paper is focused on developing a novel scheme to overcome the problem of traffic congestion in the fusion point router interconnected the heterogeneous wireless networks. The paper proposed an EF-AQM algorithm which provides an efficient and fair allocation of bandwidth among different established flows. Finally, the proposed scheme developed, tested and validated through a set of experiments to demonstrate the relative merits and capabilities of a proposed scheme

  2. Advances in liver transplantation allocation systems.

    Science.gov (United States)

    Schilsky, Michael L; Moini, Maryam

    2016-03-14

    With the growing number of patients in need of liver transplantation, there is a need for adopting new and modifying existing allocation policies that prioritize patients for liver transplantation. Policy should ensure fair allocation that is reproducible and strongly predictive of best pre and post transplant outcomes while taking into account the natural history of the potential recipients liver disease and its complications. There is wide acceptance for allocation policies based on urgency in which the sickest patients on the waiting list with the highest risk of mortality receive priority. Model for end-stage liver disease and Child-Turcotte-Pugh scoring system, the two most universally applicable systems are used in urgency-based prioritization. However, other factors must be considered to achieve optimal allocation. Factors affecting pre-transplant patient survival and the quality of the donor organ also affect outcome. The optimal system should have allocation prioritization that accounts for both urgency and transplant outcome. We reviewed past and current liver allocation systems with the aim of generating further discussion about improvement of current policies. PMID:26973389

  3. 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.

  4. 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.

  5. 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.

  6. 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.

  7. 49 CFR 198.13 - Grant allocation formula.

    Science.gov (United States)

    2010-10-01

    ... 49 Transportation 3 2010-10-01 2010-10-01 false Grant allocation formula. 198.13 Section 198.13... PIPELINE SAFETY PROGRAMS Grant Allocation § 198.13 Grant allocation formula. (a) Beginning in calendar year... state agency comments on any proposed changes to the allocation formula. (f) Grants are limited to...

  8. 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...

  9. 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...

  10. 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....

  11. 26 CFR 1.141-6 - Allocation and accounting rules.

    Science.gov (United States)

    2010-04-01

    ... 26 Internal Revenue 2 2010-04-01 2010-04-01 false Allocation and accounting rules. 1.141-6 Section... Allocation and accounting rules. (a) Allocation of proceeds to expenditures. For purposes of §§ 1.141-1.... Thus, allocations generally may be made using any reasonable, consistently applied accounting...

  12. 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...

  13. 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...

  14. 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...

  15. 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.

  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. Information Theory vs. Queueing Theory for Resource Allocation in Multiple Access Channels

    CERN Document Server

    ParandehGheibi, Ali; Ozdaglar, Asuman; Eryilmaz, Atilla

    2008-01-01

    We consider the problem of rate allocation in a fading Gaussian multiple-access channel with fixed transmission powers. The goal is to maximize a general concave utility function of the expected achieved rates of the users. There are different approaches to this problem in the literature. From an information theoretic point of view, rates are allocated only by using the channel state information. The queueing theory approach utilizes the global queue-length information for rate allocation to guarantee throughput optimality as well as maximizing a utility function of the rates. In this work, we make a connection between these two approaches by showing that the information theoretic capacity region of a multiple-access channel and its stability region are equivalent. Moreover, our numerical results show that a simple greedy policy which does not use the queue-length information can outperform queue-length based policies in terms of convergence rate and fairness.

  18. Greenhouse gas emissions from international aviation and allocation options

    International Nuclear Information System (INIS)

    This report is part of the outcome of a project funded by the Danish Environmental Protection Agency (DEPA). The project was initiated to update DEPA on ongoing developments in the field of air transport and environment. The background for starting up such a project is that aviation, due to the prospects for future growth in demand for air travel and freight volumes, may become a more significant source of emissions of greenhouse gases in the future. Another reason for DEPA to take up the subject is that DEPA needs an update on why the Parties to the United Nations Framework Convention on Climate Change (UNFCCC) have not yet been able to agree upon a methodology to allocate emissions of greenhouse gases from international aviation between countries. Only emissions from domestic air transport are included in the national inventories on annual national greenhouse gas emissions reported by Parties to the UNFCCC while emissions associated with fuel used for international aviation activities are to be reported separately. Consequently, emissions from international aviation are not included under the so-called Kyoto Protocol that sets out targets for reductions of national emissions of greenhouse gases to be fulfilled by the period 2008-2012. Parties to the UNFCCC and the UNFCCC Subsidiary Body for Scientific and Technological Advice (SBSTA) have been discussing different possibilities for allocating emissions from international aviation to Parties, but so far no agreement has been reached on this subject. A main problem seems to be that if emissions are allocated to the country where the fuel is sold some Parties that have large sales of fuel for transit passengers will have to bear a larger burden than countries with no large hub airports. The basic problem seems to be that an airline registered in one country can carry passengers and freight originating from another country to a third country. Article 2.2 of the Kyoto Protocol states that 'the Parties included in

  19. 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.

  20. 76 FR 32392 - Notice of Allocation Availability (NOAA) Inviting Applications for the CY 2011 Allocation Round...

    Science.gov (United States)

    2011-06-06

    ... published by the CDFI Fund on how an entity may apply to become certified as a CDE (66 FR 65806, December 20... CDFI Fund reserves the right to allocate tax credit authority to any, all, or none of the entities that... Applications for the CY 2011 Allocation Round of the New Markets Tax Credit Program Announcement Type:...

  1. Regional allocation of CO2 emissions allowance over provinces in China by 2020

    International Nuclear Information System (INIS)

    The mitigation efforts of China are increasingly important for meeting global climate target since the rapid economic growth of China has led to an increasing share in the world's total CO2 emissions. This paper sets out to explore the approach for realizing China's national mitigation targets submitted to the UNFCCC as part of the Copenhagen Accord; that is, to reduce the intensity of CO2 emissions per unit of GDP by 40–45% by 2020, as well as reducing the energy intensity and increasing the share of non-fossil fuel consumption, through regional allocation of emission allowance over China's provinces. Since the realization of China's mitigation target essentially represents a total amount emission allowance allocation problem, an improved zero sum gains data envelopment analysis optimization model, which could deal with the constant total amount resources allocation, is proposed in this study. By utilizing this model and based on several scenarios of China's economic growth, CO2 emissions, and energy consumption, a new efficient emission allowance allocation scheme on provincial level for China by 2020 is proposed. The allocation results indicate that different provinces have to shoulder different mitigation burdens in terms of emission intensity reduction, energy intensity reduction, and share of non-fossil fuels increase. - Highlights: ► We explore the approach to realize national CO2 emissions reduction target of China by 2020. ► The CO2 emissions allowance is allocated over China's 30 administrative regions. ► Several scenarios of China's regional economy, emission, energy consumption are given. ► The zero sum gains data envelopment analysis model is applied in emission allowance allocation. ► An efficient emission allowance allocation scheme on provincial level is proposed

  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 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.

  4. 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.

  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. Text Categorization with Latent Dirichlet Allocation

    Directory of Open Access Journals (Sweden)

    ZLACKÝ Daniel

    2014-05-01

    Full Text Available This paper focuses on the text categorization of Slovak text corpora using latent Dirichlet allocation. Our goal is to build text subcorpora that contain similar text documents. We want to use these better organized text subcorpora to build more robust language models that can be used in the area of speech recognition systems. Our previous research in the area of text categorization showed that we can achieve better results with categorized text corpora. In this paper we used latent Dirichlet allocation for text categorization. We divided initial text corpus into 2, 5, 10, 20 or 100 subcorpora with various iterations and save steps. Language models were built on these subcorpora and adapted with linear interpolation to judicial domain. The experiment results showed that text categorization using latent Dirichlet allocation can improve the system for automatic speech recognition by creating the language models from organized text corpora.

  7. 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.

  8. 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.

  9. 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.

  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. 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...

  12. A weighted possibilistic programming approach for sustainable vendor selection and order allocation in fuzzy environment

    DEFF Research Database (Denmark)

    Gupta, Pankaj; Govindan, Kannan; Mehlawat, Mukesh Kumar;

    2016-01-01

    This paper focused on the analysis of imprecise information in terms of many critical parameters for a multi-objective multi-item vendor selection-order allocation problem with price-breaks. We used both quantitative and qualitative criteria taking into account the economic, technological, social...

  13. Dynamic Bandwidth Allocation Scheme in Multi-user VBR Communication System

    Institute of Scientific and Technical Information of China (English)

    1999-01-01

    Much work has been done to study the rate control problem in variable bit rate ( VBR) video coding system. Most of them consider the point-to-point cases, wher e the rate control problem can often be abstracted as how to allocate bits among frames or among blocks when available bandwidth is limited. While in some other cases, such as some wireless ATM systems, multi-users share the common limited bandwidth. In such conditions, the bandwidth allocation among different users b ecomes a rather important problem.In this paper, a novel bandwidth allocation s cheme is presented, where the available bandwidth is dynamically allocated a mong different users based on a so-called "equal distortion" criterion. Simulatio n results show that the proposed scheme considerably improves the overall subjec tive performance in multi-user VBR communication systems. It is noticed that th e proposed join source and channel rate control idea is a very general concept t hat can be useful in many similar problems.

  14. Adaptive resource allocation technique to stochastic multimodal projects : a distributed platform implementation in JAVA

    OpenAIRE

    Tereso, Anabela Pereira; Mota, João; Lameiro, Rui

    2005-01-01

    This paper presents the implementation of the dynamic programming model (introduced in a previous paper) for the resolution of the adaptive resource allocation problem in stochastic multimodal project networks. A distributed platform using an Object Oriented language, Java, is used in order to take advantage of the available computational resources.

  15. 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 a......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 and key-logging data collected from translation experiments....

  16. Allocation of Decommissioning and Waste Liabilities

    International Nuclear Information System (INIS)

    The work demonstrates that there are a number of methods available for cost allocation, the pros and cons of which are examined. The study investigates potential proportional and incremental methods in some depth. A recommendation in principle to use the latter methodology is given. It is concluded that a 'fair assumption' is that the potential allocation of costs for 'the RMA Leaching Hall' probably is small, in relation to the total costs, and estimated to be not more than about 175 kSEK, plus any costs associated with decommissioning/ disposal of a number of small pieces of equipment added by the current operator

  17. Thrust allocation for DP in ice

    OpenAIRE

    Wold, Henrik Emil

    2013-01-01

    The commercial industry has initiated work on how to make it feasible to enter the Arctic seas. Ice loads affects most aspects of the Arctic operation, and the marine crafts must be able to handle them all. The DP control system, and thus the thrust allocation, is not designed to handle ice loads and will not work properly \\cite{Moran}. The main purpose of this master thesis is to enhance the thrust allocation for handling ice loads. This is done by including thruster dynamics and adding thru...

  18. 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.

  19. 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.

  20. 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.

  1. 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.

  2. 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...

  3. Data-driven Performance Prediction and Resource Allocation for Cloud Services

    OpenAIRE

    Yanggratoke, Rerngvit

    2016-01-01

    Cloud services, which provide online entertainment, enterprise resource management, tax filing, etc., are becoming essential for consumers, businesses, and governments. The key functionalities of such services are provided by backend systems in data centers. This thesis focuses on three fundamental problems related to management of backend systems. We address these problems using data-driven approaches: triggering dynamic allocation by changes in the environment, obtaining configuration param...

  4. 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

  5. Dynamic bandwidth allocation in GPON networks

    DEFF Research Database (Denmark)

    Ozimkiewiez, J.; Ruepp, Sarah Renée; Dittmann, Lars;

    2009-01-01

    Two Dynamic Bandwidth Allocation algorithms used for coordination of the available bandwidth between end users in a GPON network have been simulated using OPNET to determine and compare the performance, scalability and efficiency of status reporting and non status reporting dynamic bandwidth...

  6. 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

  7. Issues in organ procurement, allocation, and transplantation.

    Science.gov (United States)

    Nierste, Deborah

    2013-01-01

    Organ transplantation extends lives and improves health but presents complex ethical dilemmas for nurses caring for donors, recipients, and their families. This article overviews organ procurement and allocation, discusses ethical dilemmas in transplantation, and offers strategies from professional and biblical perspectives for coping with moral distress and maintaining compassionate care. PMID:23607154

  8. 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...

  9. 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.

  10. Adaptive resource allocation for efficient patient scheduling

    NARCIS (Netherlands)

    I.B. Vermeulen; S.M. Bohte; S.G. Elkhuizen; H. Lameris; P.J.M. Bakker; H. La Poutre

    2009-01-01

    Objective: Efficient scheduling of patient appointments on expensive resources is a complex and dynamic task. A resource is typically used by several patient groups. To service these groups, resource capacity is often allocated per group, explicitly or implicitly. Importantly, due to fluctuations in

  11. Nonparametric correlation models for portfolio allocation

    DEFF Research Database (Denmark)

    Aslanidis, Nektarios; Casas, Isabel

    2013-01-01

    This article proposes time-varying nonparametric and semiparametric estimators of the conditional cross-correlation matrix in the context of portfolio allocation. Simulations results show that the nonparametric and semiparametric models are best in DGPs with substantial variability or structural ...

  12. 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.

  13. 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.

  14. 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.

  15. 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.

  16. A study of Trade-off between Opportunistic Resource Allocation and Interference Alignment in Femtocell Scenarios

    DEFF Research Database (Denmark)

    Lertwiram, Namzilp; Popovski, Petar; Sakaguchi, Kei

    2012-01-01

    One of the main problems in wireless heterogeneous networks is interference between macro- and femto-cells. Using Orthogonal Frequency-Division Multiple Access (OFDMA) to create multiple frequency orthogonal sub-channels, this interference can be completely avoided if each sub-channel is exclusiv...... of the communication resources. In this letter we investigate the interactions and the trade-offs between these two strategies.......-channel is exclusively used by either macro- or a femto-cell. However, such an orthogonal allocation may be inefficient. We consider two alternative strategies for interference management, opportunistic resource allocation (ORA) and interference alignment (IA). Both of them utilize the fading fluctuations across...

  17. 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...

  18. 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.

  19. Scheduling language and algorithm development study. Volume 1, phase 2: Design considerations for a scheduling and resource allocation system

    Science.gov (United States)

    Morrell, R. A.; Odoherty, R. J.; Ramsey, H. R.; Reynolds, C. C.; Willoughby, J. K.; Working, R. D.

    1975-01-01

    Data and analyses related to a variety of algorithms for solving typical large-scale scheduling and resource allocation problems are presented. The capabilities and deficiencies of various alternative problem solving strategies are discussed from the viewpoint of computer system design.

  20. Models and Methods for Operations in Port Container Terminals

    OpenAIRE

    Gudelj, Anita; Krčum, Maja; Twrdy, Elen

    2010-01-01

    The management of a container terminal is a complex process that involves many decisions. Among the problems to be solved, there are the spatial allocation of containers on the terminal yard, allocation of ships to berths and cranes, scheduling priorities and operations in order to maximize performances based on some economic indicators. Since the container port facilities are very expensive, it is desirable to optimize their performance, making better management decisions. This paper wants t...

  1. 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.

  2. 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.

  3. 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.

  4. Ethics of the allocation of highly advanced medical technologies.

    Science.gov (United States)

    Sass, H M

    1998-03-01

    The disproportionate distribution of financial, educational, social, and medical resources between some rich countries of the northern hemisphere and less fortunate societies creates a moral challenge of global dimension. The development of new forms of highly advanced medical technologies, including neoorgans and xenografts, as well as the promotion of health literacy and predictive and preventive medical services might reduce some problems in allocational justice. Most governments and the World Health Organization (WHO) reject financial and other rewards for living organ donors thus indirectly contributing to the development of black markets. A societal gratuity model supporting and safeguarding a highly regulated market between providers and recipients of organs might provide for better protection of those who provide organs not solely based on altruistic reasons. The moral assessment of global issues in allocation and justice in the distribution of medical technologies must be increased and will have to be based on the principles of self determination and responsibility, solidarity and subsidiarity, and respect for individual values and cultural traditions. PMID:9527289

  5. 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.

  6. Optimal allocation of testing effort during testing and debugging phases: a control theoretic approach

    Science.gov (United States)

    Kapur, P. K.; Pham, Hoang; Chanda, Udayan; Kumar, Vijay

    2013-09-01

    Allocation of efforts to a software development project during the testing phase is a multifaceted task for software managers. The challenges become stiffer when the nature of the development process is considered in the dynamic environment. Many software reliability growth models have been proposed in last decade to minimise the total testing-effort expenditures, but mostly under static assumption. The main purpose of this article is to investigate an optimal resource allocation plan to minimise the cost of software during the testing and operational phase under dynamic condition. An elaborate optimisation policy based on the optimal control theory is proposed and numerical examples are illustrated. This article also studies the optimal resource allocation problems for various conditions by examining the behaviour of the model parameters and also suggests policy for the optimal release time of the software. The experimental results greatly help us to identify the contribution of each selected parameter and its weight.

  7. 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.

  8. The drivers to product allocation management: A managerial perspective to allocation decision-making

    OpenAIRE

    Lyytinen Otayza, Paulo

    2013-01-01

    Objective of the study The research objective of this study is to determine what are the drivers of product allocation decision making among Multinational Corporations' (MNC) headquarters. Academic background and methodology The topic of product allocation management has multiple facets in extant academic literature, with the most directly related being supply chain management under order fulfillment and push & pull- based Available-To-Promise (ATP) methods. Due to the increasingl...

  9. 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

  10. 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...

  11. 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.

  12. Simultaneous Liver-Kidney Allocation Policy: A Proposal to Optimize Appropriate Utilization of Scarce Resources.

    Science.gov (United States)

    Formica, R N; Aeder, M; Boyle, G; Kucheryavaya, A; Stewart, D; Hirose, R; Mulligan, D

    2016-03-01

    The introduction of the Mayo End-Stage Liver Disease score into the Organ Procurement and Transplantation Network (OPTN) deceased donor liver allocation policy in 2002 has led to a significant increase in the number of simultaneous liver-kidney transplants in the United States. Despite multiple attempts, clinical science has not been able to reliably predict which liver candidates with renal insufficiency will recover renal function or need a concurrent kidney transplant. The problem facing the transplant community is that currently there are almost no medical criteria for candidacy for simultaneous liver-kidney allocation in the United States, and this lack of standardized rules and medical eligibility criteria for kidney allocation with a liver is counter to OPTN's Final Rule. Moreover, almost 50% of simultaneous liver-kidney organs come from a donor with a kidney donor profile index of ≤0.35. The kidneys from these donors could otherwise be allocated to pediatric recipients, young adults or prior organ donors. This paper presents the new OPTN and United Network of Organ Sharing simultaneous liver-kidney allocation policy, provides the supporting evidence and explains the rationale on which the policy was based. PMID:26603142

  13. 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.

  14. 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.

  15. 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.

  16. 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...

  17. Economic development and the allocation of petroleum products in Sudan

    International Nuclear Information System (INIS)

    The Sudanese economy has been characterized in recent years by severe energy shortages which have affected all economic activity. More than 94% of the commercial energy is imported and the level of such imports is seriously limited by the current foreign exchange crisis. However, the problem is not just one of foreign exchange; there is also the problem of utilization of resources to avoid bottleneck problems of supply. The allocation of petroleum products in Sudan has had a severe effect on all aspects of economic life. The aim of this paper is to highlight the problem and to build a model to optimize the distribution of petroleum products in order to achieve at least a minimal supply in all regions. A large linear programming model has been developed and the solution indicates that current facilities should be able to satisfy 96% of the 1986 demand, about 30% more than the actual supply. Furthermore, with a little investment in storage facilities and extra trucks, the supply could satisfy total demand in the immediate future

  18. Quayside Operations Planning Under Uncertainty

    OpenAIRE

    Iris, Cagatay; Jin, Jian Gang; Lee, Der-Hong

    2015-01-01

    The quayside operation problem is one of the key components in the management system for a container terminal. This work focuses on three important problems that represent a bottleneck on terminal operations: Berth Allocation Problem (BAP), Quay Crane Assignment and Scheduling Problems (QCASP).The state-of-art models mostly rely on forecasted, deterministic vessel arrivals, and they mostly assume that uniform QC operations is maintained. However, in reality, these parameters are mostly random...

  19. 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...

  20. 26 CFR 26.2632-1 - Allocation of GST exemption.

    Science.gov (United States)

    2010-04-01

    ... 26 Internal Revenue 14 2010-04-01 2010-04-01 false Allocation of GST exemption. 26.2632-1 Section...-1 Allocation of GST exemption. (a) General rule. Except as otherwise provided in this section, an individual or the individual's executor may allocate the individual's $1 million GST exemption at any...

  1. 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...

  2. 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...

  3. 24 CFR 92.604 - ADDI allocation formula.

    Science.gov (United States)

    2010-04-01

    ... 24 Housing and Urban Development 1 2010-04-01 2010-04-01 false ADDI allocation formula. 92.604... allocation formula. (a) General. HUD will provide ADDI funds to participating jurisdictions in amounts determined by the formula described in this section. (b) Allocation to states that are...

  4. 40 CFR 97.42 - NOX allowance allocations.

    Science.gov (United States)

    2010-07-01

    ... 40 Protection of Environment 20 2010-07-01 2010-07-01 false NOX allowance allocations. 97.42... (CONTINUED) FEDERAL NOX BUDGET TRADING PROGRAM AND CAIR NOX AND SO2 TRADING PROGRAMS NOX Allowance Allocations § 97.42 NOX allowance allocations. (a)(1) The heat input (in mmBtu) used for calculating...

  5. 40 CFR 96.42 - NOX allowance allocations.

    Science.gov (United States)

    2010-07-01

    ... 40 Protection of Environment 20 2010-07-01 2010-07-01 false NOX allowance allocations. 96.42... (CONTINUED) NOX BUDGET TRADING PROGRAM AND CAIR NOX AND SO2 TRADING PROGRAMS FOR STATE IMPLEMENTATION PLANS NOX Allowance Allocations § 96.42 NOX allowance allocations. (a)(1) The heat input (in mmBtu) used...

  6. 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...

  7. 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....

  8. 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...

  9. 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....

  10. 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...

  11. MULTICARRIER DS-CDMA WITH ADAPTIVE MODULATION AND POWER ALLOCATION

    Institute of Scientific and Technical Information of China (English)

    Zhao Yahong; Zhang Zhongpei; Wu Weiling

    2003-01-01

    Adaptive modulation and power allocation is introduced into the multicarrier DS-CDMA system to improve the system performance and bandwidth efficiency. First, the systemdesign appropriate for adaptive modulation and power allocation is given, then the algorithmof adaptive modulation and power allocation is applied. Simulation results demonstrate greatperformance improvement compared with the fixed modulated one.

  12. Sapwood allocation in tropical trees: a test of hypotheses

    NARCIS (Netherlands)

    Schippers, P.; Vlam, M.; Zuidema, P.A.; Sterck, F.J.

    2015-01-01

    Carbon allocation to sapwood in tropical canopy trees is a key process determining forest carbon sequestration, and is at the heart of tree growth and dynamic global vegetation models (DGVM). Several allocation hypotheses exist including those applying assumptions on fixed allocation, pipe model, an

  13. 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...

  14. Traffic resource allocation for complex networks

    International Nuclear Information System (INIS)

    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. (interdisciplinary physics and related areas of science and technology)

  15. 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...

  16. 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.

  17. Irreplaceability of Neuronal Ensembles after Memory Allocation

    Directory of Open Access Journals (Sweden)

    Naoki Matsuo

    2015-04-01

    Full Text Available Lesion studies suggest that an alternative system can compensate for damage to the primary region employed when animals acquire a memory. However, it is unclear whether functional compensation occurs at the cellular ensemble level. Here, we inhibited the activities of a specific subset of neurons activated during initial learning by utilizing a transgenic mouse that expresses tetanus toxin (TeNT under the control of the c-fos promoter. Notably, suppression interfered with relearning while sparing the ability to acquire and express fear memory for a distinct context. These results suggest that the activity of the initial ensemble is preferentially dedicated to the same learning and that it is not replaceable once it is allocated. Our results provide substantial insights into the machinery underlying how the brain allocates individual memories to discrete neuronal ensembles and how it ensures that repetitive learning strengthens memory by reactivating the same neuronal ensembles.

  18. Dynamic advance reservation with delayed allocation

    Energy Technology Data Exchange (ETDEWEB)

    Vokkarane, Vinod; Somani, Arun

    2014-12-02

    A method of scheduling data transmissions from a source to a destination, includes the steps of: providing a communication system having a number of channels and a number of paths, each of the channels having a plurality of designated time slots; receiving two or more data transmission requests; provisioning the transmission of the data; receiving data corresponding to at least one of the two or more data transmission requests; waiting until an earliest requested start time T.sub.s; allocating at the current time each of the two or more data transmission requests; transmitting the data; and repeating the steps of waiting, allocating, and transmitting until each of the two or more data transmission requests that have been provisioned for a transmission of data is satisfied. A system to perform the method of scheduling data transmissions is also described.

  19. 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.

  20. 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.