Please use this identifier to cite or link to this item: http://hdl.handle.net/10773/29856
Full metadata record
DC FieldValueLanguage
dc.contributor.authorFlores-Luyo, Luispt_PT
dc.contributor.authorAgra, Agostinhopt_PT
dc.contributor.authorFigueiredo, Rosapt_PT
dc.contributor.authorOcaña, Eladiopt_PT
dc.date.accessioned2020-11-20T20:22:47Z-
dc.date.issued2020-04-
dc.identifier.issn1381-1231pt_PT
dc.identifier.urihttp://hdl.handle.net/10773/29856-
dc.description.abstractWe consider a wireless network where a given set of stations is continuously generating information. A single vehicle, located at a base station, is available to collect the information via wireless transfer. The wireless transfer vehicle routing problem (WTVRP) is to decide which stations should be visited in the vehicle route, how long shall the vehicle stay in each station, and how much information shall be transferred from the nearby stations to the vehicle during each stay. The goal is to collect the maximum amount of information during a time period after which the vehicle returns to the base station. The WTVRP is NP-hard. Although it can be solved to optimality for small size instances, one needs to rely on good heuristic schemes to obtain good solutions for large size instances. In this work, we consider a mathematical formulation based on the vehicle visits. Several heuristics strategies are proposed, most of them based on the mathematical model. These strategies include constructive and improvement heuristics. Computational experiments show that a strategy that combines a combinatorial greedy heuristic to design a initial vehicle route, improved by a fix-and-optimize heuristic to provide a local optimum, followed by an exchange heuristic, affords good solutions within reasonable amount of running time.pt_PT
dc.language.isoengpt_PT
dc.publisherSpringerpt_PT
dc.relationPESSOA 2018 - FCT/5141/13/4/2018/Spt_PT
dc.relationUID/MAT/04106/2019pt_PT
dc.relationPESSOA 2018 - Project N 40821YHpt_PT
dc.rightsembargoedAccesspt_PT
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/pt_PT
dc.subjectVehicle routing problempt_PT
dc.subjectWireless networkspt_PT
dc.subjectMatheuristicpt_PT
dc.titleHeuristics for a vehicle routing problem with information collection in wireless networkspt_PT
dc.typearticlept_PT
dc.description.versionpublishedpt_PT
dc.peerreviewedyespt_PT
degois.publication.firstPage187pt_PT
degois.publication.issue2pt_PT
degois.publication.lastPage217pt_PT
degois.publication.titleJournal of Heuristicspt_PT
degois.publication.volume26pt_PT
dc.date.embargo2021-05-01-
dc.identifier.doi10.1007/s10732-019-09429-6pt_PT
dc.identifier.essn1572-9397pt_PT
Appears in Collections:CIDMA - Artigos
OGTCG - Artigos

Files in This Item:
File Description SizeFormat 
Heuristics for the wt-VRP_ria.pdfMain file867.18 kBAdobe PDFembargoedAccess


FacebookTwitterLinkedIn
Formato BibTex MendeleyEndnote Degois 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.