In this thesis several algorithms are proposed and developed to solve a variety of transportation related problems. First we considered, a dynamic programming approach to create an exact solver to minimize distance in a vehicle routing problemwith time windows (VRPTW) variant. Several new tests are developed to reduce the size of the state space and ultimately reduce the number of state transitions.