Degree Year
2013
Document Type
Thesis - Open Access
Degree Name
Bachelor of Arts
Department
Computer Science
Advisor(s)
Tom Wexler
Keywords
Traveling salesman problem, Linear programming, Linear relaxation, Integer programming, Multiagent modeling, Swarm intelligence
Abstract
This honors thesis describes the algorithmic abstraction of a problem modeling a swarm of Mars rovers, where many "agents" must together achieve a goal. The algorithmic formulation of this problem is based on the traveling salesman problem (TSP), and so in this thesis I offer a review of the mathematical technique of linear programming in the context of its application to the TSP, an overview of some variations of the TSP and algorithms for approximating and solving them, and formulations without solutions of two novel TSP variations which are useful for modeling the original problem.
Repository Citation
Amlie-Wolf, Alexandre, "A Swarm of Salesmen: Algorithmic Approaches to Multiagent Modeling" (2013). Honors Papers. 306.
https://digitalcommons.oberlin.edu/honors/306
