@inbook {17632,
	title = {Basic VNS for the Uncapacitated Single Allocation p-Hub Maximal Covering Problem},
	booktitle = {Variable Neighborhood Search},
	year = {2020},
	pages = {126-138},
	publisher = {Springer International Publishing},
	organization = {Springer International Publishing},
	address = {Cham},
	abstract = {
	This paper addresses the Uncapacitated Single Allocation p-hub Maximal Covering Problem (USApHMCP), which aims to determine the best allocation for the p-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.

},
	url = {https://link.springer.com/chapter/10.1007/978-3-030-44932-2_9},
	author = {Matheus de Ara{\'u}jo Butinholi and Alexandre Xavier Martins and Paganini Barcellos de Oliveira and Diego Perdig{\~a}o Martino},
	editor = {Rachid Benmansour and Angelo Sifaleras and Nenad Mladenovi{\'c}}
}
