## Traveling Salesman Problems With Profits: An Overview (2001)

Venue: | Transportation Science |

Citations: | 39 - 2 self |

### BibTeX

@ARTICLE{Feillet01travelingsalesman,

author = {Dominique Feillet and Pierre Dejax and Michel Gendreau},

title = {Traveling Salesman Problems With Profits: An Overview},

journal = {Transportation Science},

year = {2001},

volume = {39},

pages = {188--205}

}

### OpenURL

### Abstract

Traveling Salesman Problems with Profits (TSPs with Profits) are a generalization of the Traveling Salesman Problem (TSP) where it is not necessary to visit all vertices. With each vertex is associated a profit. The objective is to find a route with a satisfying collected profit (maximized) and travel cost (minimized). Applications of these problems arise in contexts such as traveling salesman problems, job scheduling or carrier transportation. In this paper, the existing literature about TSPs with Profits is surveyed.