Privatized rural postman problems
Computers and Operations Research
A stabilized column generation scheme for the traveling salesman subtour problem
Discrete Applied Mathematics - Special issue: International symposium on combinatorial optimization CO'02
Metaheuristics for the team orienteering problem
Journal of Heuristics
Tsp-based scheduling in a batch-wise hybrid flow-shop
Robotics and Computer-Integrated Manufacturing
The Period Vehicle Routing Problem with Service Choice
Transportation Science
The Period Vehicle Routing Problem with Service Choice
Transportation Science
Ant colony optimization for the traveling purchaser problem
Computers and Operations Research
Column Generation Algorithms for the Capacitated m-Ring-Star Problem
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Computers and Operations Research
Computers and Industrial Engineering
Iterated local search for the team orienteering problem with time windows
Computers and Operations Research
The Clustered Prize-Collecting Arc Routing Problem
Transportation Science
Heuristics for the multi-period orienteering problem with multiple time windows
Computers and Operations Research
Nonmyopic informative path planning in spatio-temporal models
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Efficient informative sensing using multiple robots
Journal of Artificial Intelligence Research
Efficient planning of informative paths for multiple robots
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A Path Relinking approach for the Team Orienteering Problem
Computers and Operations Research
The undirected capacitated arc routing problem with profits
Computers and Operations Research
A memetic algorithm for the team orienteering problem
Evo'08 Proceedings of the 2008 conference on Applications of evolutionary computing
Hybrid metaheuristic for the prize collecting travelling salesman problem
EvoCOP'08 Proceedings of the 8th European conference on Evolutionary computation in combinatorial optimization
A column generation heuristic for the general vehicle routing problem
LION'10 Proceedings of the 4th international conference on Learning and intelligent optimization
Tourist trip planning functionalities: state-of-the-art and future
ICWE'10 Proceedings of the 10th international conference on Current trends in web engineering
Time-dependent personal tour planning and scheduling in metropolises
Expert Systems with Applications: An International Journal
Formulations and Branch-and-Cut Algorithms for the Generalized Vehicle Routing Problem
Transportation Science
ISMIS'11 Proceedings of the 19th international conference on Foundations of intelligent systems
Impacts of imprecise demand forecasts in network capacity control: an online analysis
INOC'11 Proceedings of the 5th international conference on Network optimization
Variable neighborhood search for the orienteering problem
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
Expert Systems with Applications: An International Journal
A column generation approach for the split delivery vehicle routing problem
Operations Research Letters
Profit-based latency problems on the line
Operations Research Letters
GECKOmmender: personalised theme and tour recommendations for museums
UMAP'12 Proceedings of the 20th international conference on User Modeling, Adaptation, and Personalization
The Generalized Covering Salesman Problem
INFORMS Journal on Computing
Optimal solutions for routing problems with profits
Discrete Applied Mathematics
The Multiconstraint Team Orienteering Problem with Multiple Time Windows
Transportation Science
An augmented large neighborhood search method for solving the team orienteering problem
Expert Systems with Applications: An International Journal
Orienteering problem modeling for electric vehicle-based tour
ACIIDS'13 Proceedings of the 5th Asian conference on Intelligent Information and Database Systems - Volume Part II
Multiple agents maximum collection problem with time dependent rewards
Computers and Industrial Engineering
Heuristics for the traveling repairman problem with profits
Computers and Operations Research
A tour recommendation service for electric vehicles based on a hybrid orienteering model
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Survey of Green Vehicle Routing Problem: Past and future trends
Expert Systems with Applications: An International Journal
A hybrid algorithm for the DNA sequencing problem
Discrete Applied Mathematics
An ILP-refined tabu search for the Directed Profitable Rural Postman Problem
Discrete Applied Mathematics
A Market-based Solution to the Multiple Traveling Salesmen Problem
Journal of Intelligent and Robotic Systems
| Hi-index | 0.01 |
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 surveyed. Different classes of applications, modeling approaches, and exact or heuristic solution techniques are identified and compared. Conclusions emphasize the interest of this class of problems, with respect to applications as well as theoretical results.