Marcus Gallagher

Marcus Gallagher

Auto-generated profile, based on publicly available information

Marcus Gallagher

University of Queensland

Research Focus & Metrics

Academic Career Length

34Years (1993-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 July 2007 in Environmental Modelling & Software
Verified
Journal Article
Closed access
MGMark Gallagher
Mark Gallagher
JDJohn Doherty
John Doherty

1 March 2017 in Applied Energy
Verified
Journal Article
Closed access
JSJunainah Sardi
Junainah Sardi
NMN. Mithulananthan
N. Mithulananthan
MGM. Gallagher
M. Gallagher
DHDuong Quoc Hung
Duong Quoc Hung


2 October 2006 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
MGM. Gallagher
M. Gallagher
BYBo Yuan
Bo Yuan
The research literature on metaheuristic and evolutionary computation has proposed a large number of algorithms for the solution of challenging real-world optimization problems. It is often not possible to study theoretically the performance of these algorithms unless significant assumptions are made on either the algorithm itself or the problems to which it is applied, or both. As a consequence, metaheuristics are typically evaluated empirically using a set of test problems. Unfortunately, relatively little attention has been given to the development of methodologies and tools for the large-scale empirical evaluation and/or comparison of metaheuristics. In this paper, we propose a landscape (test-problem) generator that can be used to generate optimization problem instances for continuous, bound-constrained optimization problems. The landscape generator is parameterized by a small number of parameters, and the values of these parameters have a direct and intuitive interpretation in terms of the geometric features of the landscapes that they produce. An experimental space is defined over algorithms and problems, via a tuple of parameters for any specified algorithm and problem class (here determined by the landscape generator). An experiment is then clearly specified as a point in this space, in a way that is analogous to other areas of experimental algorithmics, and more generally in experimental design. Experimental results are presented, demonstrating the use of the landscape generator. In particular, we analyze some simple, continuous estimation of distribution algorithms, and gain new insights into the behavior of these algorithms using the landscape generator

1 September 2006 in Journal of Hydrology
Verified
Journal Article
Closed access
AWAdrian Werner
Adrian Werner
MGMark R. Gallagher
Mark R. Gallagher
SWScott W. Weeks
Scott W. Weeks

11 September 2013 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
RMRachael Morgan
Rachael Morgan
MGMarcus Gallagher
Marcus Gallagher
In metaheuristic optimization, understanding the relationship between problems and algorithms is important but nontrivial. There has been a growing interest in the literature on techniques for analyzing problems and algorithm performance; however, the validity of the assumptions and implementation choices behind many techniques is often not closely examined. In this paper, we review some interesting theoretical properties regarding sampling techniques and distance metrics in continuous spaces. In particular, we examine the effect of using Euclidean distance in conjunction with uniform random sampling on the behavior of the Dispersion metric. We show that the current methodology employed for the estimation of dispersion has important flaws, and we propose and evaluate modifications to improve the methodology. The modifications are simple and do not add significant complexity or computational effort to the methodology.