MA 310 - Matlab Programming

Lecture Hours: 3
Lab Hours: 0
Credit Hours: 3

Advanced MATLAB functionality, geometric techniques (Monte Carlo, random walks, and Levy Flights), and the brute force, nearest neighbor, simulated annealing, and genetic algorithms applied to the Traveling Salesman Problem (TSP). The course concludes with the development of a TSP graphical user interface (GUI) that integrates these algorithms. Prerequisite(s): MA 110, ME 203, or PY 223.