Author(s):  
Encarna Esteban ◽  
Elena Calvo ◽  
Jose Albiac

AbstractFreshwater ecosystems provide a large number of benefits to society. However, extensive human activities threat the viability of these ecosystems, their habitats, and their dynamics and interactions. One of the main risks facing these systems is the overexploitation of groundwater resources that hinders the survival of several freshwater habitats. In this paper, we study optimal groundwater paths when considering freshwater ecosystems. We contribute to existing groundwater literature by including the possibility of regime shifts in freshwater ecosystems into a groundwater management problem. The health of the freshwater habitat, which depends on the groundwater level, presents a switch in its status that occurs when a critical water level (‘tipping point’) is reached. Our results highlight important differences in optimal extraction paths and optimal groundwater levels compared with traditional models. The outcomes suggest that optimal groundwater withdrawals are non-linear and depend on the critical threshold and the ecosystem’s health function. Our results show that the inclusion of regime shifts in water management calls for a reformulation of water policies to incorporate the structure of ecosystems and their interactions with the habitat.


2002 ◽  
Vol 31 (1) ◽  
pp. 364
Author(s):  
William D. Shuster

Author(s):  
András Éles ◽  
István Heckl ◽  
Heriberto Cabezas

AbstractA mathematical model is introduced to solve a mobile workforce management problem. In such a problem there are a number of tasks to be executed at different locations by various teams. For example, when an electricity utility company has to deal with planned system upgrades and damages caused by storms. The aim is to determine the schedule of the teams in such a way that the overall cost is minimal. The mobile workforce management problem involves scheduling. The following questions should be answered: when to perform a task, how to route vehicles—the vehicle routing problem—and the order the sites should be visited and by which teams. These problems are already complex in themselves. This paper proposes an integrated mathematical programming model formulation, which, by the assignment of its binary variables, can be easily included in heuristic algorithmic frameworks. In the problem specification, a wide range of parameters can be set. This includes absolute and expected time windows for tasks, packing and unpacking in case of team movement, resource utilization, relations between tasks such as precedence, mutual exclusion or parallel execution, and team-dependent travelling and execution times and costs. To make the model able to solve larger problems, an algorithmic framework is also implemented which can be used to find heuristic solutions in acceptable time. This latter solution method can be used as an alternative. Computational performance is examined through a series of test cases in which the most important factors are scaled.


Games ◽  
2021 ◽  
Vol 12 (3) ◽  
pp. 61
Author(s):  
Xupeng Wei ◽  
Achilleas Anastasopoulos

We consider a demand management problem in an energy community, in which several users obtain energy from an external organization such as an energy company and pay for the energy according to pre-specified prices that consist of a time-dependent price per unit of energy as well as a separate price for peak demand. Since users’ utilities are their private information, which they may not be willing to share, a mediator, known as the planner, is introduced to help optimize the overall satisfaction of the community (total utility minus total payments) by mechanism design. A mechanism consists of a message space, a tax/subsidy, and an allocation function for each user. Each user reports a message chosen from her own message space, then receives some amount of energy determined by the allocation function, and pays the tax specified by the tax function. A desirable mechanism induces a game, the Nash equilibria (NE), of which results in an allocation that coincides with the optimal allocation for the community. As a starting point, we design a mechanism for the energy community with desirable properties such as full implementation, strong budget balance and individual rationality for both users and the planner. We then modify this baseline mechanism for communities where message exchanges are allowed only within neighborhoods, and consequently, the tax/subsidy and allocation functions of each user are only determined by the messages from their neighbors. All of the desirable properties of the baseline mechanism are preserved in the distributed mechanism. Finally, we present a learning algorithm for the baseline mechanism, based on projected gradient descent, that is guaranteed to converge to the NE of the induced game.


Sign in / Sign up

Export Citation Format

Share Document