Traveling Salesman Problems with Profits

@article{Feillet2005TravelingSP,
  title={Traveling Salesman Problems with Profits},
  author={Dominique Feillet and Pierre Dejax and Michel Gendreau},
  journal={Transp. Sci.},
  year={2005},
  volume={39},
  pages={188-205}
}
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. A profit is associated with each vertex. The overall goal is the simultaneous optimization of the collected profit and the travel costs. These two optimization criteria appear either in the objective function or as a constraint. In this paper, a classification of TSPs with profits is proposed, and the existing literature is… Expand
A Market-Based Solution to the Multiple Depots, Multiple Traveling Salesmen Problem with Profits
TLDR
A variant of the Traveling Salesman Problem, in which there is no constraint on visiting all the cities, but rather each city offers a benefit value associated with visiting it, and the goal is to maximize the profit by the team of salesmen is proposed. Expand
Heuristics for the Traveling Repairman Problem with Profits
TLDR
This study investigates properties of the traveling repairman problem with profits, and derives a mathematical model assuming that the number of visited nodes is known in advance, and describes a tabu search algorithm with multiple neighborhoods. Expand
Heuristics for the traveling repairman problem with profits
TLDR
This study investigates the properties of the traveling repairman problem with profits, and derives a mathematical model assuming that the number of nodes to be visited is known in advance, and concludes that the tabu search algorithm finds good-quality solutions fast, even for large instances. Expand
Ant colony optimization for the traveling purchaser problem
TLDR
This work addresses the solution of the TPP with an ant colony optimization procedure and combines it with a local-search scheme exploring a new neighborhood structure that permits to improve most of the best-known solutions. Expand
A Binary Programming Solution to the Multiple-Depot, Multiple Traveling Salesman Problem with Constant Profits
TLDR
Results are presented that show the ability of the proposed solution to solve problems with various levels of city benets and compare these results to other MTSP variants. Expand
GENETIC ALGORITHM FINDS ROUTES IN TRAVELLING SALESMAN PROBLEM WITH PROFITS
Travelling salesman problem with profits is a version of a cla ssic travelling salesman problem where it is not necessary to visit all verti ces. Instead of it, with each vertex a number meaning aExpand
Definitions and Mathematical Models of Single Vehicle Routing Problems with Profits
TLDR
In this chapter, single vehicle routing problems with profits are introduced and defined and an appropriate mathematical model will be presented, together with a discussion on the differences and similarities with the other variants. Expand
Steiner Tree Problems With Profits
Abstract This is a survey of the Steiner tree problem with profits, a variation of the classical Steiner problem where, besides the costs associated with edges, there are also revenues associatedExpand
A Review of Traveling Salesman Problem with Time Window Constraint
The Traveling Salesman Problem (TSP) is a famous combinatorial problem which is intensively studied in the area of optimization. TSP solution has wide variety of applications but generally is used inExpand
The Attractive Traveling Salesman Problem
TLDR
The problem is formulated as an integer non-linear program, a linearization is proposed and strengthened through the introduction of valid inequalities, and a branch-and-cut algorithm is developed. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 113 REFERENCES
On symmetric subtour problems
Recently several practical variants of the classical traveling salesman problem are proposed. These variants include the traveling purchaser problem, the prize collecting traveling salesman problem,Expand
A branch-and-cut algorithm for the undirected selective traveling salesman problem
TLDR
Several classes of valid inequalities for the symmetric STSP are developed and used in a branch-and-cut algorithm that can solve instances involving up to 300 vertices. Expand
On prize-collecting tours and the asymmetric travelling salesman problem
We consider a variant of the Travelling Salesman Problem which is to determine a tour visiting each vertex in the graph at most at one time; if a vertex is left unrouted a given penalty has to beExpand
A tabu search heuristic for the undirected selective travelling salesman problem
TLDR
A tabu search (TS) heuristic for the undirected Selective Travelling Salesman Problem, which iteratively inserts clusters of vertices in the current tour or removes a chain of Vertices. Expand
Improved solutions for the traveling purchaser problem
TLDR
Some variations of the existing solution procedures to the traveling purchaser problem are considered to improve the solutions, and results indicate that the proposed variations significantly improve the existing solutions. Expand
The prize collecting traveling salesman problem
  • E. Balas
  • Mathematics, Computer Science
  • Networks
  • 1989
TLDR
This paper identifies several families of facet defining inequalities for this polytope, the convex hull of solutions to the PCTSP, and uses these inequalities either as cutting planes or as ingredients of a Lagrangean optimand. Expand
A note on the prize collecting traveling salesman problem
TLDR
The algorithm is based on Christofides' algorithm for the traveling salesman problem as well as a method to round fractional solutions of a linear programming relaxation to integers, feasible for the original problem. Expand
On Some Generalizations of the Travelling-Salesman Problem
TLDR
A new transformation of generalized into standard travelling-salesman problem is presented, which makes it possible to solve symmetric problems with a relatively large number of specified nodes, which cannot be solved by previously published algorithms based on a linear assignment relaxation. Expand
An Industrial application of the traveling salesman's subtour problem
Abstract Practical applications of the classical traveling salesman problem are rare because in most real world situations there are constraints upon the tour. To increase the range of usefulExpand
Dynamic tabu search strategies for the traveling purchaser problem
  • S. Voß
  • Mathematics, Computer Science
  • Ann. Oper. Res.
  • 1996
TLDR
Two dynamic strategies, the reverse elimination method and the cancellation sequence method are investigated, which incorporate the incorporation of strategic oscillation as well as a combination of these methods with respect to the traveling purchaser problem. Expand
...
1
2
3
4
5
...