Physical Sciences and Mathematics Commons^™

High Multiplicity Strip Packing Problem With Three Rectangle Types, Andy Yu

Electronic Thesis and Dissertation Repository

The two-dimensional strip packing problem (2D-SPP) involves packing a set R = {r₁, ..., r_n} of n rectangular items into a strip of width 1 and unbounded height, where each rectangular item r_i has width 0 < w_i ≤ 1 and height 0 < h_i ≤ 1. The objective is to find a packing for all these items, without overlaps or rotations, that minimizes the total height of the strip used. 2D-SPP is strongly NP-hard and has practical applications including stock cutting, scheduling, and reducing peak power demand in smart-grids.

This thesis considers …

Interactive Fitness Domains In Competitive Coevolutionary Algorithm, Atm Golam Bari

USF Tampa Graduate Theses and Dissertations

Evolutionary Algorithms (EA) have been successfully applied to a wide range of optimization and search problems where no mathematical model of the quality of a candidate solution is available. Interactive Evolutionary Algorithms (IEA) and Competitive Coevolutionary Algorithms (CCoEA) go one step further by being able to tackle problems where the only means to evaluate the quality of a candidate solution is via interactions. In a typical IEA, interactions take place between the solution being evolved and human evaluators. In a CCoEA, interactions take place between solutions themselves, without need for human interaction. This dissertation identifies computer-aided learning as an application …

Optimal Sampling Paths For Autonomous Vehicles In Uncertain Ocean Flows, Andrew J. De Stefan

Dissertations

Despite an extensive history of oceanic observation, researchers have only begun to build a complete picture of oceanic currents. Sparsity of instrumentation has created the need to maximize the information extracted from every source of data in building this picture. Within the last few decades, autonomous vehicles, or AVs, have been employed as tools to aid in this research initiative. Unmanned and self-propelled, AVs are capable of spending weeks, if not months, exploring and monitoring the oceans. However, the quality of data acquired by these vehicles is highly dependent on the paths along which they collect their observational data. The …

Gem-Pso: Particle Swarm Optimization Guided By Enhanced Memory, Kevin Fakai Chen

Honors Projects

Particle Swarm Optimization (PSO) is a widely-used nature-inspired optimization technique in which a swarm of virtual particles work together with limited communication to find a global minimum or optimum. PSO has has been successfully applied to a wide variety of practical problems, such as optimization in engineering fields, hybridization with other nature-inspired algorithms, or even general optimization problems. However, PSO suffers from a phenomenon known as premature convergence, in which the algorithm's particles all converge on a local optimum instead of the global optimum, and cannot improve their solution any further. We seek to improve upon the standard Particle Swarm …

Enhancing Portability In High Performance Computing: Designing Fast Scientific Code With Longevity, Jason Orender

Computer Science Theses & Dissertations

Portability, an oftentimes sought-after goal in scientific applications, confers a number of possible advantages onto computer code. Portable code will often have greater longevity, enjoy a broader ecosystem, appeal to a wider variety of application developers, and by definition will run on more systems than its pigeonholed counterpart. These advantages come at a cost, however, and a rational approach to balancing costs and benefits requires a systemic evaluation. While the benefits for each application are likely situation-dependent, the costs in terms of resources, including but not limited to time, money, computational power, and memory requirements, are quantifiable. This document will …

Two-On-One Pursuit With A Non-Zero Capture Radius, Patrick J. Wasz

Theses and Dissertations

In this paper, we revisit the "Two Cutters and Fugitive Ship" differential game that was addressed by Isaacs, but move away from point capture. We consider a two-on-one pursuit-evasion differential game with simple motion and pursuers endowed with circular capture sets of radius l > 0. The regions in the state space where only one pursuer effects the capture and the region in the state space where both pursuers cooperatively and isochronously capture the evader are characterized, thus solving the Game of Kind. Concerning the Game of Degree, the algorithm for the synthesis of the optimal state feedback strategies of the …

Capso: A Multi-Objective Cultural Algorithm System To Predict Locations Of Ancient Sites, Samuel Dustin Stanley

Wayne State University Dissertations

ABSTRACT

CAPSO: A MULTI-OBJECTIVE CULTURAL ALGORITHM SYSTEM TO PREDICT LOCATIONS OF ANCIENT SITES

by

SAMUEL DUSTIN STANLEY

August 2019

Advisor: Dr. Robert Reynolds

Major: Computer Science

Degree: Doctor of Philosophy

The recent archaeological discovery by Dr. John O’Shea at University of Michigan of prehistoric caribou remains and Paleo-Indian structures underneath the Great Lakes has opened up an opportunity for Computer Scientists to develop dynamic systems modelling these ancient caribou routes and hunter-gatherer settlement systems as well as the prehistoric environments that they existed in. The Wayne State University Cultural Algorithm team has been interested assisting Dr. O’Shea’s archaeological team by …