Traveling Salesman Problems with Profits

By Dominique Feillet, Pierre J. Dejax, Michel Gendreau. Transportation Science, 2005

677 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Industrial and Manufacturing Engineering

View Paper: https://www.semanticscholar.org/paper/91c48fd605fe3a9324c6b56489e6944517950f1a

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Industrial and Manufacturing Engineering

Citations in the corpus

New mathematical models of the generalized vehicle routing problem and extensions (2012, background): “In addition, several other situations can be modeled as a GVRP, these include: the traveling salesman problem (TSP) with profits [14]; a number of vehicle routing problem (VRP) extensions: the VRP with selective backhauls, the covering VRP, the periodic VRP, the capacitated general windy routing pro”
Orienteering Problem: A survey of recent variants, solution approaches and applications (2016, neutral): “Earlier surveys that situate the OP between other types of routing problems can be found in works of Feillet, Dejax, and Gendreau (2005) and Laporte and Rodríguez-Martín (2007) .”
Inverse optimization with endogenous arrival time constraints to calibrate the household activity pattern problem (2012, methodology): “Currently the calibrated HAPP model only addresses route and schedule choice, but it is also possible to incorporate destination choice by modifying the problem to become a selective routing problem or multicommodity profitable tour problem (Feillet et al., 2005; Chow and Liu, 2012).”
Rich vehicle routing problems: From a taxonomy to a definition (2015, background): “This VRP variant is known as the VRP with profits, see Feillet, Dejax, and Gendreau (2005).”
An exact epsilon-constraint method for bi-objective combinatorial optimization problems: Application to the Traveling Salesman Problem with Profits (2009, methodology): “Many problems share these characteristics, including the Bi-Objective Covering Tour problem [16] and bi-objective variants of the Traveling Salesman Problem (TSP), such as the Bi-Objective Traveling Purchaser Problem [26] and the Traveling Salesman Problem with Profits (TSPP) [11].”
The orienteering problem: A survey (2011, methodology): “A TSPWP classification and an extensive literature survey about TSPWP applications, modelling approaches and solution techniques is presented by Feillet et al. (2005a).”
A survey on algorithmic approaches for solving tourist trip design problems (2014, background): “There also exists literature on exact, heuristic and metaheuristic algorithms for PTP and PCTSP as well as variants of these problems (see Feillet et al. (2005) for a survey).”