H
Hamish Waterer
Researcher at University of Newcastle
Publications - 31
Citations - 578
Hamish Waterer is an academic researcher from University of Newcastle. The author has contributed to research in topics: Integer programming & Flow network. The author has an hindex of 12, co-authored 30 publications receiving 508 citations. Previous affiliations of Hamish Waterer include Newcastle University & University of Auckland.
Papers
More filters
Journal ArticleDOI
Solving shortest path problems with a weight constraint and replenishment arcs
TL;DR: The weight constrained shortest path problem with replenishment (WCSPP-R) is reviewed, preprocessing methods are developed, existing WCSPP algorithms are extended, and new algorithms that exploit the inter-replenishment path structure are presented.
Journal ArticleDOI
Hydro-electric unit commitment subject to uncertain demand
TL;DR: This work investigates the impact of uncertainty on the unit commitment by using an optimization-based heuristic to give an approximate solution to the stochastic problem of daily hydro-electricity generation in a river valley.
Journal ArticleDOI
Comparison of Mixed-Integer Programming and Genetic Algorithm Methods for Distributed Generation Planning
TL;DR: Computational results show that the MIP methods, while lacking the speed of the genetic algorithm, can find improved solutions within conservative time requirements and provide useful information on optimality.
Journal ArticleDOI
Wind Turbine Interference in a Wind Farm Layout Optimization Mixed Integer Linear Programming Model
TL;DR: In this paper, the authors developed a wind intensity interference coefficient which captures the interference caused by an upwind turbine on a downwind turbine in the same wind flow, and this interference coefficient then forms part of a mixed integer linear program (MILP) which is used to optimise the locations of wind turbines within a wind farm site.
Journal ArticleDOI
Integer programming methods for large-scale practical classroom assignment problems
TL;DR: A novel formulation of the problem is introduced which generalises existing models and maintains tractability even for large instances and expands upon existing results into the computational difficulty of room assignment problems.