<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Matheus de Araújo Butinholi</style></author><author><style face="normal" font="default" size="100%">Alexandre Xavier Martins</style></author><author><style face="normal" font="default" size="100%">Paganini Barcellos de Oliveira</style></author><author><style face="normal" font="default" size="100%">Diego Perdigão Martino</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Rachid Benmansour</style></author><author><style face="normal" font="default" size="100%">Angelo Sifaleras</style></author><author><style face="normal" font="default" size="100%">Nenad Mladenović</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Basic VNS for the Uncapacitated Single Allocation p-Hub Maximal Covering Problem</style></title><secondary-title><style face="normal" font="default" size="100%">Variable Neighborhood Search</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2020</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://link.springer.com/chapter/10.1007/978-3-030-44932-2_9</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer International Publishing</style></publisher><pub-location><style face="normal" font="default" size="100%">Cham</style></pub-location><pages><style face="normal" font="default" size="100%">126-138</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p style=&quot;margin-top:0.49cm;margin-bottom:0.49cm&quot; align=&quot;justify&quot;&gt;
	&lt;span style=&quot;font-size:12px;&quot;&gt;&lt;span style=&quot;font-family:Arial,Helvetica,sans-serif;&quot;&gt;&lt;span style=&quot;line-height:100%&quot;&gt;&lt;font style=&quot;12pt&quot;&gt;&lt;span style=&quot;letter-spacing:0.1pt&quot;&gt;&lt;span style=&quot;background:#fcfcfc&quot;&gt;This paper addresses the Uncapacitated Single Allocation &lt;/span&gt;&lt;/span&gt;&lt;em&gt;&lt;span style=&quot;letter-spacing:0.1pt&quot;&gt;&lt;span style=&quot;background:#fcfcfc&quot;&gt;p&lt;/span&gt;&lt;/span&gt;&lt;/em&gt;&lt;span style=&quot;letter-spacing:0.1pt&quot;&gt;&lt;span style=&quot;background:#fcfcfc&quot;&gt;-hub Maximal Covering Problem (USApHMCP), which aims to determine the best allocation for the &lt;/span&gt;&lt;/span&gt;&lt;em&gt;&lt;span style=&quot;letter-spacing:0.1pt&quot;&gt;&lt;span style=&quot;background:#fcfcfc&quot;&gt;p&lt;/span&gt;&lt;/span&gt;&lt;/em&gt;&lt;span style=&quot;letter-spacing:0.1pt&quot;&gt;&lt;span style=&quot;background:#fcfcfc&quot;&gt;-hubs within a node network in order to maximize the network coverage. We proposed a search strategy-based heuristic Basic Variable Neighborhood Search (VNS) to solve the problem. Two different sets of test instances from the literature, Civil Aeronautics Board (CAB) and Australian Post (AP), were used to evaluate the performance of VNS and to compare it with the Tabu Search (TS) metaheuristic. In most instances, the bounds obtained by VNS and TS were the same but, on the other hand, for some of them, VNS presented a slight advantage and vice versa. That is, both algorithms are convenient to solve the proposed problem.&lt;/span&gt;&lt;/span&gt;&lt;/font&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;
&lt;/p&gt;
</style></abstract></record></records></xml>