A travelling salesman problem with side constraints
Kookhahi, Elham. 2014. A Travelling Salesman Problem with Side Constraints. -- In Proceedings: 10th Annual Symposium on Graduate Research and Scholarly Projects. Wichita, KS: Wichita State University, p. 27
The goal of this paper is to maximize the number of customers that can be served by a travelling salesman visiting a number of cities while having constraints on capacity, tour budget and tour time. In our model, we also let customers whose cities have not been served, travel to other close by served cities. We develop a mathematical model and propose an exact method and a genetic algorithm to solve this problem. We test the performance of the proposed heuristic. Furthermore, the impact of different parameters on performance measures is observed using existing problem instances.
Presented to the 10th Annual Symposium on Graduate Research and Scholarly Projects (GRASP) held at the Heskett Center, Wichita State University, April 25, 2014.
Research completed at Department of Industrial and Manufacturing Engineering, College of Engineering