Short-term non-convex economic hydrothermal scheduling using dynamically controlled particle swarm optimization

Paper presented to the 3rd Southern African Solar Energy Conference, South Africa, 11-13 May, 2015.The aim of this paper is to present short-term hydrothermal scheduling (STHS) of power system. This problem is solved in such a way that utilizes available hydro reserves optimally and thus minimizes the fuel cost of thermal plants. A PSO based method is developed which can efficiently deals with hydro constraints like reservoir storage volume limits, water discharge rate limits, water dynamic balance, initial and final reservoir storage volume limits, etc. for a given time horizon. The operators of the PSO are dynamically controlled. Moreover, the cognitive and social behaviors of the swarm are modified for better exploration and exploitation of the search space. The effectiveness of the proposed method has been investigated on a standard test generating system considering several operational constraints pertaining to hydrothermal systems.dc201

Shortest Route at Dynamic Location with Node Combination-Dijkstra Algorithm

Abstract— Online transportation has become a basic requirement of the general public in support of all activities to go to work, school or vacation to the sights. Public transportation services compete to provide the best service so that consumers feel comfortable using the services offered, so that all activities are noticed, one of them is the search for the shortest route in picking the buyer or delivering to the destination. Node Combination method can minimize memory usage and this methode is more optimal when compared to A* and Ant Colony in the shortest route search like Dijkstra algorithm, but can’t store the history node that has been passed. Therefore, using node combination algorithm is very good in searching the shortest distance is not the shortest route. This paper is structured to modify the node combination algorithm to solve the problem of finding the shortest route at the dynamic location obtained from the transport fleet by displaying the nodes that have the shortest distance and will be implemented in the geographic information system in the form of map to facilitate the use of the system. Keywords— Shortest Path, Algorithm Dijkstra, Node Combination, Dynamic Location (key words