inspired by a class I took in my Industrial Engineering course. the class in specific showed many methods to optimize the route of certain individual; in this case, given by the title, a salesman. he may look for the shortest, quickest and/or cheapest route.
the method used and thought of is the assignment algorithm (TSP) together with a variant of the Branch and Bound method - B&B.
the algorithm works in the way that by each simulation of the path you take, following rules, the better it gets and that is resembled through this piece by how the images gets accurate as iterations go.
which one is optimized?
a play of distortion with digital illustration and collage.
