Back to search

Central Washington University

Crosshair Optimizer

Abstract

dc:description.abstract

Metaheuristic optimization algorithms are heuristics that are capable of creating a "good enough'' solution to a computationally complex problem. Algorithms in this area of study are focused on the process of exploration and exploitation: exploration of the solution space and exploitation of the results that have been found during that exploration, with most resources going toward the former half of the process. The novel Crosshair optimizer developed in this thesis seeks to take advantage of the latter, exploiting the best possible result as much as possible by directly searching the area around that best result with a stochastic approach. This research seeks to prove that the Crosshair Optimizer is comparable, if not better in some aspects, to current established metaheuristics optimization algorithms, not only in obtaining optimal results, but usability in high performance computing, and versatility through the use of multiple randomizers and parameter tuning.

Degree

thesis:*
Name thesis:degree_name
Master of Science (MS)
Discipline thesis:degree_discipline
Computational Science

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Torrence, Jason
Contributors dc:contributor
  • Donald Davendra
  • Razvan Andonie
  • Szilard Vajda

Subjects

dc:subject × 5

Identifiers

dc:identifier.*
Repository record dc:identifier
https://digitalcommons.cwu.edu/etd/1835

Chain of custody

source
Harvested from
Central Washington University
Base URL
digitalcommons.cwu.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Torrence, Jason. Crosshair Optimizer. https://digitalcommons.cwu.edu/etd/1835