New approaches for the prize-collecting covering tour problem
by Glaubos Clímaco; Luidi Simonetti; Isabel Rosseti; Pedro Henrique González
International Journal of Industrial and Systems Engineering (IJISE), Vol. 45, No. 1, 2023

Abstract: In this paper, we consider the prize-collecting covering tour problem (PCCTP), which intends to find a minimum cost tour for travelling teams that grant assistance to people located far from urban centres. We develop a branch-and-cut algorithm, some valid inequalities, and a new set of reduction rules as exact approaches. We also present a hybrid heuristic that combines a state-of-the-art heuristic for the PCCTP with integer programming techniques. Computational experiments showed that the exact approaches found several new optimal solutions while reducing CPU time, and the hybrid heuristic was able to match or improve the solution quality for many instances, along with a significant reduction of running time.

Online publication date: Tue, 19-Sep-2023

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Industrial and Systems Engineering (IJISE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com