Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Engineering
Solving Geometric Knapsack Problems Using Tabu Search Heuristics, Christopher A. Chocolaad
Solving Geometric Knapsack Problems Using Tabu Search Heuristics, Christopher A. Chocolaad
Theses and Dissertations
An instance of the geometric knapsack problem occurs in air lift loading where a set of cargo must be chosen to pack in a given fleet of aircraft. This paper demonstrates a new heuristic to solve this problem in a reasonable amount of time with a higher quality solution then previously reported in literature. We also report a new tabu search heuristic to solve geometric knapsack problems.
Embedding A Reactive Tabu Search Heuristic In Unmanned Aerial Vehicle Simulations, Joel L. Ryan
Embedding A Reactive Tabu Search Heuristic In Unmanned Aerial Vehicle Simulations, Joel L. Ryan
Theses and Dissertations
We apply a Reactive Tabu Search (RTS) heuristic within a discrete event simulation to solve routing problems for Unmanned Aerial Vehicles (UAVs). Our formulation represents this problem as a multiple Traveling Salesman Problem with time windows (mTSPTW), with the objective of attaining a specified level of target coverage using a minimum number of vehicles. Incorporating weather and probability of UAV survival at each target as random inputs, the RTS heuristic in the simulation searches for the best solution in each realization of the problem scenario in order to identify those routes that are robust to variations in weather, threat, or …