Volume 55, 2021Regular articles published in advance of the transition of the journal to Subscribe to Open (S2O). Free supplement sponsored by the Fonds National pour la Science Ouverte
|Page(s)||S719 - S726|
|Published online||02 March 2021|
A Branch-and-Cut and MIP-based heuristics for the Prize-Collecting Travelling Salesman Problem
Universidade Federal do Rio de Janeiro, PESC-COPPE, Cidade Universitária, Centro de Tecnologia, Bloco H, 21941-972 Rio de Janeiro, Brazil
2 Universidade Federal Fluminense, Instituto de Computação, Rua Passo da Pátria 156 São Domingos, 24210-240 Niterói, RJ, Brazil
* Corresponding author: email@example.com
Accepted: 23 December 2019
The Prize Collecting Traveling Salesman Problem (PCTSP) represents a generalization of the well-known Traveling Salesman Problem. The PCTSP can be associated with a salesman that collects a prize in each visited city and pays a penalty for each unvisited city, with travel costs among the cities. The objective is to minimize the sum of the costs of the tour and penalties, while collecting a minimum amount of prize. This paper suggests MIP-based heuristics and a branch-and-cut algorithm to solve the PCTSP. Experiments were conducted with instances of the literature, and the results of our methods turned out to be quite satisfactory.
Mathematics Subject Classification: 90C10 / 90C11 / 90C08 / 90C05
Key words: prize-collecting traveling salesman problem / MIP heuristics / Branch-and-cut
© EDP Sciences, ROADEF, SMAI 2021
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.