Authors: Mikić, Marija
Todosijević, Raca 
Urošević, Dragan 
Affiliations: Mathematical Institute of the Serbian Academy of Sciences and Arts 
Title: Less is more: General variable neighborhood search for the capacitated modular hub location problem
Journal: Computers and Operations Research
Volume: 110
First page: 101
Last page: 115
Issue Date: 1-Oct-2019
Rank: M21
ISSN: 0305-0548
DOI: 10.1016/j.cor.2019.05.020
In this paper, we study the capacitated modular hub location problem. The problem belongs to the class of the single assignment hub location problems, where a terminal can be assigned to only one hub. In addition, the problem imposes capacity constraints, on both hubs and edges that connect them. The observed problem is directly related to the real problem. Namely, in air traffic, the number of flights between two cities directly determines the conditions of the capacity. In order to tackle the problem we propose a general variable neighborhood search (GVNS) based heuristic. We have performed exhaustive testing that led to the conclusion that the GVNS method gave superior results in comparison to the previous methods. This is especially reflected in the number of best solutions that were obtained in a much shorter time. Additionally, we applied statistical tests which showed that GVNS is undoubtedly superior with respect to the previously observed methods.
Keywords: Basic sequential variable neighborhood descent | General variable neighborhood search | Heuristic | Hub location problem
Publisher: Elsevier
Project: Dynamics of hybrid systems with complex structures. Mechanics of materials. 
Development of new information and communication technologies, based on advanced mathematical methods, with applications in medicine, telecommunications, power systems, protection of national heritage and education 
Mathematical Modelas and Optimization Methods on Large-Scale Systems 

Show full item record


checked on May 16, 2024

Page view(s)

checked on May 9, 2024

Google ScholarTM




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