Publications Database

Welcome to the new Schulich Peer-Reviewed Publication Database!

The database is currently in beta-testing and will be updated with more features as time goes on. In the meantime, stakeholders are free to explore our faculty’s numerous works. The left-hand panel affords the ability to search by the following:

  • Faculty Member’s Name;
  • Area of Expertise;
  • Whether the Publication is Open-Access (free for public download);
  • Journal Name; and
  • Date Range.

At present, the database covers publications from 2012 to 2020, but will extend further back in the future. In addition to listing publications, the database includes two types of impact metrics: Altmetrics and Plum. The database will be updated annually with most recent publications from our faculty.

If you have any questions or input, please don’t hesitate to get in touch.

 

Search Results

Yeomans, J.S. (2019). "Water Resource Management Using Population-Based, Dual-Criterion Simulation-Optimization Algorithms to Generate Alternatives", Journal of Environmental and Earth Sciences, 5(1), 36- 44.

Open Access Download

Abstract When solving complex water resources management (WRM) problems, it is often preferable to construct a number of quantifiably good alternatives that provide multiple, different perspectives. This is because WRM normally involves multifaceted problems that are riddled with incompatible performance objectives and contain inconsistent design requirements which are very difficult to quantify and capture when supporting decisions must be constructed. These alternatives need to satisfy the required system performance criteria and yet be maximally different from each other in the decision space. The approach for creating maximally different sets of solutions is referred to as modelling-to-generate-alternatives (MGA). Simulationoptimization approaches are frequently employed to solve computationally difficult problems containing significant stochastic uncertainties. This paper outlines an MGA approach for WRM that can generate sets of maximally different alternatives for any simulation-optimization method that employs a population-based search algorithm. This algorithmic approach is both computationally efficient and simultaneously produces the prescribed number of maximally different solution alternatives in a single computational run of the procedure. The effectiveness of this stochastic MGA approach for creating alternatives in “real world”, water policy formulation is demonstrated using a WRM case study

Yeomans, J.S. (2019). "A Stochastic, Dual-Criterion, Simulation-Optimization Algorithm for Generating Alternative", Journal of Computer Science Engineering, 5(6), 1-10.

Open Access Download

Abstract Complex stochastic engineering problems are frequently inundated with incompatible performance requirements and inconsistent performance specifications that can be difficult to identify when supporting decision models must be constructed. Consequently, it is often advantageous to create a set of dissimilar options that afford distinctive approaches to the problem. These alternatives should satisfy the required system performance criteria and yet be maximally different from each other in their decision spaces. The approach for creating such maximally different solution sets is referred to as modelling-to-generate-alternatives (MGA). This paper describes a dual-criterion stochastic MGA procedure that can generate sets of maximally different alternatives for any simulation-optimization approach that employs a population-based search algorithm. This stochastic algorithmic approach is both computationally efficient and simultaneously produces the prescribed number of maximally different solution alternatives in a single computational run of the procedure.

Yeomans, J.S. (2019). "A Simulation-Optimization Algorithm for Generating Sets of Alternatives Using Population Based Metaheuristic Procedures’, Journal of Software Engineering and Simulation", Journal of Software Engineering and Simulation, 5(2), 1-6.

Open Access Download

Abstract When solving complex stochastic engineering problems, it can prove preferable to create numerous quantifiably good alternatives that provide multiple, disparate perspectives. These alternatives need to satisfy the required system performance criteria and yet be maximally different from each other in the decision space. The approach for creating maximally different sets of solutions is referred to as modelling-togenerate-alternatives (MGA). Simulation-optimization approaches are frequently employed to solve computationally difficult problems containing significant stochastic uncertainties. This paper outlines an MGA algorithm that can generate sets of maximally different alternatives for any simulation-optimization method that employs a population-based procedure. This algorithmic approach is both computationally efficient and simultaneously produces the prescribed number of maximally different solution alternatives in a single computational run of the procedure

Yeomans, J.S. (2018). "An Algorithm for Generating Sets of Maximally Different Alternatives Using Population-Based Metaheuristic Procedures", Transactions on Machine Learning and Artificial Intelligence, 6(5), 1-9.

Open Access Download

Abstract “Real world” problems typically possess complex performance conditions peppered with inconsistent performance requirements. This situation occurs because multifaceted problems are often riddled with incompatible performance objectives and contradictory design requirements which can be difficult – if not impossible – to specify when the requisite decision models are formulated. Thus, it is often desirable to generate a set of disparate alternatives that provide diverse approaches to the problem. These dissimilar options should be close-to-optimal with respect to any specified objective(s), but remain maximally different from all other solutions in the decision space. The approach for creating maximally different sets of solutions is referred to as modelling-to-generate-alternatives (MGA). This paper outlines an MGA algorithmic approach that can simultaneously generate a set of maximally different alternatives using any population-based metaheuristic.