Professional Documents
Culture Documents
IEOR 4405 Production Scheduling Professor Stein Sally Kim James Tsai April 30, 2009
TSP Defined
Given a list of cities and their pairwise distances, find the shortest tour that visits each city exactly once
Well-known NP-hard combinatorial optimization problem Used to model planning, logistics, and even genome sequencing
Project Objectives
Perform a literature search of the TSP
Find interesting, real-life applications Discover algorithms uncovering optimal solutions
Multi-objective LP
Takes a general linear multiple criteria decision making model and represents it as follows:
Find a vector xT = [x1, x2, ,xn] which maximizes k objective functions, with n variables and m constraints
Opt Z = CX s.t. AX <= b Z = (z1, z2,,zn) is the vector of objectives, C is a K x N matrix of constants and X is an Nx1 vector of decision variables, A is an M x N matrix of constants and b is a Mx1 vector of constants
Consider a case of TSP with 3 objectives: minimize cost, time, and overall distance
Web-based tool employing virtual ants and interactive graphics to produce nearoptimal solutions to the TSP
Artificial ants build solutions and exchange them with others via a communication scheme
Conclusions
While finding the exact solution is often desired in problems of optimality, this is sometimes not realistic Relaxation and modification are some ways to approach a NP-hard problem that is otherwise difficult to solve