Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 3 of 3

Full-Text Articles in Entire DC Network

Integrating Iterative Crossover Capability In Orthogonal Neighborhoods For Scheduling Resource-Constrained Projects, Reza Zamani Jan 2013

Integrating Iterative Crossover Capability In Orthogonal Neighborhoods For Scheduling Resource-Constrained Projects, Reza Zamani

Faculty of Engineering and Information Sciences - Papers: Part A

An effective hybrid evolutionary search method is presented which integrates a genetic algorithm with a local search. Whereas its genetic algorithm improves the solutions obtained by its local search, its local search component utilizes a synergy between two neighborhood schemes in diversifying the pool used by the genetic algorithm. Through the integration of these two searches, the crossover operators further enhance the solutions that are initially local optimal for both neighborhood schemes; and the employed local search provides fresh solutions for the pool whenever needed. The joint endeavor of its local search mechanism and its genetic algorithm component has made …


Minimum Latency Broadcast Algorithms For Wireless Sensor Networks, Dianbo Zhao Jan 2013

Minimum Latency Broadcast Algorithms For Wireless Sensor Networks, Dianbo Zhao

University of Wollongong Thesis Collection 1954-2016

Broadcast is a fundamental operation in Wireless Sensor Networks (WSNs). Given a source node with a packet to broadcast, the aim is to propagate the packet to all nodes in an interference-free manner whilst incurring minimum latency. This problem, called Minimum Latency Broadcast Scheduling (MLBS), has been studied extensively in wireless ad-hoc networks, whereby nodes remain on all the time, and has been shown to be NP-hard. However, only a few studies have addressed this problem in the context of duty-cycled WSNs. In these WSNs, nodes do not wake-up simultaneously, and hence, not all neighbors of a transmitting node will …


Mip-Based Stochastic Security-Constrained Daily Hydrothermal Generation Scheduling, J Aghaei, M Karami, K M. Muttaqi, A Ahmadi, H A. Shayanfar Jan 2013

Mip-Based Stochastic Security-Constrained Daily Hydrothermal Generation Scheduling, J Aghaei, M Karami, K M. Muttaqi, A Ahmadi, H A. Shayanfar

Faculty of Engineering and Information Sciences - Papers: Part A

This paper presents the application of a mixedinteger programming (MIP) approach for solving stochastic security-constrained daily hydrothermal generation scheduling (SCDHGS). Power system uncertainties including generating units and branch contingencies and load uncertainty are explicitly considered in the stochastic programming of SCDHGS. The roulette wheel mechanism and lattice Monte Carlo simulation (LMCS) are first employed for random scenario generation wherein the stochastic SCDHGS procedure is converted into its respective deterministic equivalents (scenarios). Then, the generating units are scheduled through MIP over the set of deterministic scenarios for the purpose of minimizing the cost of supplying energy and ancillary services over the …