Dynamic economic dispatch using dynamic programming successive approximation techniques

Download
029577.pdf
1993
Alptoğan, Oktay Burç
Show full item record
141
views
0
downloads
https://hdl.handle.net/11511/11867
Graduate School of Natural and Applied Sciences, Thesis

Suggestions

Dynamic Programming Solution to ATM Cash Replenishment Optimization Problem
Karagöz, Pınar; Toroslu, İsmail Hakkı (2018-10-05)
Automated Telling Machine (ATM) replenishment is a wellknown problem in banking industry. Banks aim to improve customer satisfaction by reducing the number of out-of-cash ATMs and duration of out-of-cash status. On the other hand, they want to reduce the cost of cash replenishment, also. The problem conventionally has two components: forecasting ATM cash withdrawals, and then cash replenishment optimization on the basis of the forecast. In this work, for the first component, it is assumed that reliable fore...
Dynamic Programming with Ant Colony Optimization Metaheuristic for Optimization of Distributed Database Queries
Dokeroglu, Tansel; Coşar, Ahmet (2011-09-28)
In this paper, we introduce and evaluate a new query optimization algorithm based on Dynamic Programming (DP) and Ant Colony Optimization (ACO) metaheuristic for distributed database queries. DP algorithm is widely used for relational query optimization, however its memory, and time requirements are very large for the query optimization problem in a distributed database environment which is an NP-hard combinatorial problem. Our aim is to combine the power of DP with heuristic approaches so that we can have ...
Dynamic information handling in continuous time Boolean Network model of gene interactions
Öktem, Hakan (Elsevier BV, 2008-08-01)
Growing information and knowledge on gene regulatory networks, which are typical hybrid systems, has led a significant interest in modeling those networks. An important direction of gene network modeling is studying the abstract network models to understand the behavior of a class of systems. Boolean Networks has emerged as an important model class on this direction. Limitations of traditional Boolean Networks led the researchers to propose several generalizations. In this work, one such class, the Continuo...
Dynamic programming algorithms for scheduling parallel machines with family setup times
Webster, Scott; Azizoğlu, Meral (Elsevier BV, 2001-2)
We address the problem of scheduling jobs with family setup times on identical parallel machines to minimize total weighted flowtime. We present two dynamic programming algorithms - a backward algorithm and a forward algorithm - and we identify characteristics of problems where each algorithm is best suited. We also derive two properties that improve the computational efficiency of the algorithms. Scope and purpose While most production schedulers must balance conflicting goals of high system efficiency and...
Dynamic optimal design of groundwater remediation using genetic algorithms
Amy, Chan Hılton; Aksoy, Ayşegül; Teresa, Culver (Springer US, 2001-01-01)
Citation Formats
O. B. Alptoğan, “Dynamic economic dispatch using dynamic programming successive approximation techniques,” Middle East Technical University, 1993.
METU IIS - Integrated Information Service open@metu.edu.tr