Towards global solutions of optimal discrete-valued control problems
dc.contributor.author | Woon, S. | |
dc.contributor.author | Rehbock, Volker | |
dc.contributor.author | Loxton, Ryan | |
dc.date.accessioned | 2017-01-30T14:58:57Z | |
dc.date.available | 2017-01-30T14:58:57Z | |
dc.date.created | 2012-09-23T20:00:17Z | |
dc.date.issued | 2012 | |
dc.identifier.citation | Woon, Siew Fang and Rehbock, Volker and Loxton, Ryan. 2012. Towards global solutions of optimal discrete-valued control problems. Optimal Control Applications and Methods. 33 (5): pp. 576-594. | |
dc.identifier.uri | http://hdl.handle.net/20.500.11937/42338 | |
dc.identifier.doi | 10.1002/oca.1015 | |
dc.description.abstract |
This paper proposes a new heuristic approach for solving optimal discrete-valued control problems. We illustrate the approach with an existing hybrid power system model. The problem of choosing an operating schedule to minimize generator, battery, and switching costs is first posed as a mixed discrete dynamic optimization problem. Then, a discrete filled function method is employed in conjunction with a computational optimal control technique to solve this problem. Computational results indicate that this approach is robust, efficient, and can successfully identify a near-global solution for this complex applied optimization problem despite the presence of multiple local optima. | |
dc.publisher | John Wiley and Sons, Ltd. | |
dc.subject | mixed discrete optimization | |
dc.subject | optimal control | |
dc.subject | global optimization | |
dc.subject | hybrid power system | |
dc.subject | discrete filled function | |
dc.title | Towards global solutions of optimal discrete-valued control problems | |
dc.type | Journal Article | |
dcterms.source.volume | 33 | |
dcterms.source.number | 5 | |
dcterms.source.startPage | 576 | |
dcterms.source.endPage | 594 | |
dcterms.source.issn | 10991514 | |
dcterms.source.title | Optimal Control Applications and Methods | |
curtin.department | ||
curtin.accessStatus | Fulltext not available |