A hybrid heuristic based on GRASP and RVND metaheuristics for the prise-collecting covering tour problem
by Glaubos Clímaco; Isabel Rosseti; Rogério Da Silva; Marcos Guerine
International Journal of Logistics Systems and Management (IJLSM), Vol. 41, No. 3, 2022

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.

Online publication date: Thu, 19-May-2022

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 Logistics Systems and Management (IJLSM):
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