Now showing items 1-5 of 5
Selective generalized travelling salesman problem
This paper introduces the Selective Generalized Traveling Salesman Problem (SGTSP). In SGTSP, the goal is to determine the maximum profitable tour within the given threshold of the tour's duration, which consists of a ...
New Formulations for the Orienteering Problem
Problems associated with determining optimal routes from one or several depots (origin, home city) to a set of nodes (vertices, cities, customers, locations) are known as routing problems. The Traveling Salesman Problem ...
Formulations for Minimizing Tour Duration of the Traveling Salesman Problem with Time Windows
Traveling Salesman Problem with Time Windows (TSPTW) serves as one of the most important variants of the Traveling Salesman Problem (TSP). The main objective functions expressed in the literature of the TSPTW consist of ...
New integer programming formulation for multiple traveling repairmen problem
The multiple traveling repairman problem (kTRP) is a generalization of the traveling repairman problem which is also known as the minimum latency problem and the deliveryman problem. In these problems, waiting time or ...
A COMPARATIVE STUDY OF THE CAPABILITY OF ALTERNATIVE MIXED INTEGER PROGRAMMING FORMULATIONS
In selecting the best mixed integer linear programming (MILP) formulation the important issue is to figure out how to evaluate the performance of each candidate formulation in terms of selected criteria. The main objective ...