Exact algorithms for the (A)symmetric Traveling Salesman Problem with order dependent constraints and objectivefunction
Abstract
The goal of this project is to study variants of the well-known (A)symmetric Traveling Salesman Problem (TSP), that include the visit order of the vertices in the objective function and/or in the constraints. In particular, the objective function would include an additional cost represented by a linear or nonlinear function of the visit time, while the constraints would impose conditions on the visit order of the vertices.
Document Details
- Document Type
- DoD Grant Award
- Publication Date
- Feb 06, 2017
- Source ID
- FA95501710025
Entities
People
- Valentina Cacchiani
Organizations
- Air Force Office of Scientific Research
- United States Air Force