Abstract
The chapter describes a resource-allocation problem in a smart-grid application that is formulated and solved as a binary integer-programming model. To handle power outages from the main distribution circuit, the Smart grid’s intelligent agents have to utilize and negotiate with distributed-energy resource agents that act on behalf of the grid’s local generators in order to negotiate power-supply purchases to satisfy shortages. We develop a model that can optimally assign these DERs to the available multiple regional utility areas (RUAs) or units that are experiencing power shortages. This type of allocation is a resource-assignment problem. The DERs in our model depict the behavior of power created with a wind turbine, solar generation, or other renewable generation units, and the region or area refers to a centralized distribution unit. The integer-programming approach is called Capacity-Based Iterative Binary Integer Linear Programming (C-IBILP). All simulation results are computed using the optimization tool box in MATLAB. Computation results exhibit very good performance for the problem instances tested and validate the assumptions made.
Keywords
The material in this chapter was co-authored by Prakash Ranganathan and Kendall E. Nygard. Prakash Ranganathan had primary responsibility for developing the linear-programming formulation of a resource-allocation problem using the branch-and-bound method. Prakash Ranganathan was the primary developer for modeling, implementing, and testing the conclusions that are advanced here. Prakash Ranganathan also drafted and revised all versions of this chapter. Kendall E. Nygard served as a proofreader and checked the LP formulation that was run by Prakash Ranganathan.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Alekhnovich, M., Arora, S., & Tourlakis, I. (2005). Towards strong non approximability results in the Lovasz-Schrijver hierarchy. Theory of computing (pp. 294–303). ACM.
Amin, M. (2004). Balancing market priorities with security issues: Interconnected system operations and control under the restructured electricity enterprise. IEEE Power and Energy Magazine, 2(4), 30–38.
Balakrishnan, B., & Balemi, S. (1991). Branch and bound algorithm for computing the minimum stability degree of parameter-dependent linear systems. International Journal of Robust and Nonlinear Control, 1(4), 295–317.
Barnhart, C., Johnson, E., & Nemhauser, G. (1998). Branch-and-price: Column generation for solving huge integer programs. Operations Research, 46(3), 316–329.
Kozina, G., & Perepelista, V. (1994). Interval spanning trees problem: Solvability and computational complexity. Interval Computations, 1, 42–50.
Kruskal, J. (1956). On the shortest spanning subtree of a graph and the travelling salesman problem. Proceedings of the American Mathematical Society, 7(1), 48–50.
Kouvelis, P., & Yu, P. (1997). Robust discrete optimization and its applications. City, MA: Kluwer Academic Publishers.
Lawler, L., & Wood, E. (1966). Branch-and-bound methods: A survey. Operations Research, 14(4), 699–719.
Montemanni, R., & Gambardella, L. (2005). A branch and bound algorithm for the robust spanning tree problem with interval data. European Journal of Operational Research, 161(3), 771–779.
Moore, R. (1991). Global optimization to prescribed accuracy. Computers and Mathematics with Applications, 21(6), 25–39.
Mathworks, Inc. Binary Integer Programming (BINTPROG). Retrieved August 31, 2010, from http://www.mathworks.com .
Retrieved August 31, 2010, from http://www.oe.energy.gov/smartgrid.htm.
Wolsey, L. (1998). Integer programming. City, NY: Wiley.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Ranganathan, P., Nygard, K.E. (2017). Resource Allocation Using Branch and Bound. In: Distributed Linear Programming Models in a Smart Grid. Power Electronics and Power Systems. Springer, Cham. https://doi.org/10.1007/978-3-319-52617-1_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-52617-1_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-52616-4
Online ISBN: 978-3-319-52617-1
eBook Packages: EnergyEnergy (R0)