A hybrid heuristic based on GRASP and RVND metaheuristics for the prise-collecting covering tour problem

Glaubos Clímaco, Isabel Rosseti, Rogério Da Silva and Marcos Guerine

International Journal of Logistics Systems and Management, 2022, vol. 41, issue 3, 349-370

Abstract: The provision of social, medical, or legal assistance to communities geographically distant from large urban locations has been a concern of the various public, philanthropic or private entities. This concern led to the emergence of the prise-collecting covering tour problem (PCCTP), which seeks to find a tour for travelling teams that provide services to these communities. This work proposes a novel hybrid heuristic based on greedy randomised adaptive search procedure (GRASP) and random variable neighbourhood search (RVND) meta-heuristics for the purpose of solving the PCCTP. Computational experiments were conducted on a PCCTP benchmark from the literature, and the results demonstrate our approach provides a significant improvement in solving PCCTP and comparable with the state of the art, mainly regarding the computational processing time.

Keywords: prise-collecting covering tour problem; PCCTP; greedy randomised adaptive search procedure; GRASP; random variable neighbourhood search; RVND; hybrid heuristic. (search for similar items in EconPapers)
Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=122977 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijlsma:v:41:y:2022:i:3:p:349-370

Access Statistics for this article

More articles in International Journal of Logistics Systems and Management from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().