Skip to Main content Skip to Navigation
Conference papers

Integration of Resource Allocation Coordination and Branch-and-Bound

Abstract : In general, integer programming problems are computationally very hard to solve, which makes solving an integer programming problem with a large number of decision variables in a centralized way intractable. In this paper, we propose a novel integer optimization method for strategic planning by integrating the resource allocation coordination method into a branch-and-bound paradigm. Thanks to the distributed computation of the resource allocation coordination method and distributed evaluation of nodes in the branch-and-bound paradigm, our method is capable of solving an integer programming problem in a distributed way. Moreover, since in the branch-and-bound paradigm the size of solution space decreases monotonically as the iteration proceeds, it is guaranteed that the globally optimal solution to an integer programming problem is obtained by using our method. Finally, we apply our method to the optimal charging control problem of electric vehicles under constrained grid conditions in a simulation study.
Document type :
Conference papers
Complete list of metadatas

https://hal-supelec.archives-ouvertes.fr/hal-01253145
Contributor : Romain Bourdais <>
Submitted on : Friday, January 8, 2016 - 4:56:14 PM
Last modification on : Friday, July 10, 2020 - 4:09:43 PM

Identifiers

Citation

Renshi Luo, Romain Bourdais, Ton van den Boom, B. de Schutter. Integration of Resource Allocation Coordination and Branch-and-Bound. 54th IEEE Conference on Decision and Control (CDC), Dec 2015, Osaka, Japan. ⟨10.1109/cdc.2015.7402885⟩. ⟨hal-01253145⟩

Share

Metrics

Record views

584