Traveling Salesman Problem dengan Kendala Time Windows

Abstract

Distribution of products using a vehicle from a depot to several places that has a time limit of services requires an efficient route. This distribution problem can be modeled as a Traveling Salesman Problem with Time Windows by using Integer Linear Programming. The model is then implemented by using LINGO 11.0 for the case of delivery products from depot to ten customers. We consider the following constraints: (1) a salesman visited and left each customer exactly once, (2) each customer has limited time of service given in an interval of time. Implementation of the model provides a total minimum distance traveling from the depot to all customers and return to the depot.