GENERAL ENQUIRIES: Tel: + 27 12 841 2911 | Email: callcentre@csir.co.za

Browsing by Author "Engelbrecht, AP"

Sort by: Order: Results:

  • Helbig, M; Engelbrecht, AP (IEEE, 2012-06)
    Dynamic multi-objective optimisation problems (DMOOPs) occur in many situations in the real world. These optimisation problems do not have a single goal to solve, but many goals that are in conflict with one another - ...
  • Helbig, M; Engelbrecht, AP (IEEE Xplore, 2013-06)
    Dynamic multi-objective optimisation problems (DMOOPs) have more than one objective, with at least one objective changing over time. Since at least two of the objectives are normally in conflict with one another, a single ...
  • Helbig, M; Engelbrecht, AP (IEEE Xplore, 2013-06)
    When algorithms solve dynamic multi-objective optimisation problems (DMOOPs), benchmark functions should be used to determine whether the algorithm can overcome specific difficulties that can occur in real-world problems. ...
  • Hauptfleisch, AC; Van Den Bergh, F; Bachoo, AK; Engelbrecht, AP (2006-11)
    The Anti-parallel edge Centerline Extractor (ACE) algorithm is designed to extract road networks from high resolution satellite images. The primary mechanism used by the algorithm to detect the presence of roads is a filter ...
  • Greeff, M; Engelbrecht, AP (Springer. Part of Springer Science+Business Media, 2010)
    Optimisation problems occur in many situations and aspects of modern life. In reality, many of these problems are dynamic in nature, where changes can occur in the environment that influences the solutions of the optimisation ...
  • Helbig, M; Engelbrecht, AP (Springer, 2012)
    Dynamic multi-objective optimisation problems (DMOOPs) occur in many situations in the real world. These optimisation problems do not have a single goal to solve, but many goals that are in conflict with one another - ...
  • Grobler, J; Engelbrecht, AP; Kendall, G; Yadavalli, VSS (IEEE, 2014-12)
    This paper extends the investigation into the algorithm selection problem in hyper-heuristics, otherwise referred to as the entity-to-algorithm allocation problem, introduced by Grobler et al.. Two newly developed ...
  • Grobler, J; Engelbrecht, AP; Kendall, G; Yadavallie, VSS (Elsevier, 2015-04)
    This paper expands on the concept of heuristic space diversity and investigates various strategies for the management of heuristic space diversity within the context of a meta-hyper-heuristic algorithm in search of greater ...
  • Grobler, J; Engelbrecht, AP; Kendall, G; Yadavalli, VSS (IEEE Xplore, 2014-07)
    This paper introduces the concept of heuristic space diversity and investigates various strategies for the management of heuristic space diversity within the context of a meta-hyper-heuristic algorithm. Evaluation on a ...
  • Grobler, J; Engelbrecht, AP; Kendall, G; Yadavalli, VSS (IEEE, 2014-07)
    This paper introduces the concept of heuristic space diversity and investigates various strategies for the management of heuristic space diversity within the context of a meta-hyper-heuristic algorithm. Evaluation on a ...
  • Helbig, M; Engelbrecht, AP (IEEE Xplore, 2013-06)
    In recent years a number of algorithms were proposed to solve dynamic multi-objective optimisation problems. However, a major problem in the field of dynamic multi-objective optimisation is a lack of standard performance ...
  • Brits, R; Engelbrecht, AP; Van den Bergh, F (Elsevier Science Inc, 2007)
    Many scientific and engineering applications require optimization methods to find more than one solution to multimodal optimization problems. This paper presents a new particle swarm optimization (PSO) technique to locate ...
  • Greeff, M; Engelbrecht, AP (IEEE Congress on Evolutionary Computation (CEC 2008), 2008-06)
    Many optimisation problems are multi-objective and change dynamically. Many methods use a weighted average approach to the multiple objectives. This paper introduces the usage of the vector evaluated particle swarm optimiser ...
  • Van den Bergh, F; Engelbrecht, AP (Elsevier Science B.V, 2006)
    Particle swarm optimization (PSO) has shown to be an efficient, robust and simple optimization algorithm. Most of the PSO studies are empirical, with only a few theoretical analyses that concentrate on understanding particle ...