General variable neighborhood search for the uncapacitated single allocation p-hub center problem - Université Polytechnique des Hauts-de-France Access content directly
Journal Articles Optimization Letters Year : 2017

General variable neighborhood search for the uncapacitated single allocation p-hub center problem

Abstract

In this paper we propose a general variable neighborhood search heuristic for solving the uncapacitated single allocation p-hub center problem (USApHCP). For the local search step we develop a nested variable neighborhood descent strategy. The proposed approach is tested on benchmark instances from the literature and found to outperform the state-of-the-art heuristic based on ant colony optimization. We also test our heuristic on large scale instances that were not previously considered as test instances for the USApHCP. Moreover, exact solutions were reached by our GVNS for all instances where optimal solutions are known.
No file

Dates and versions

hal-03402503 , version 1 (25-10-2021)

Identifiers

Cite

Jack Brimberg, Nenad Mladenovic, Raca Todosijević, Dragan Urošević. General variable neighborhood search for the uncapacitated single allocation p-hub center problem. Optimization Letters, 2017, 11 (2), pp.377-388. ⟨10.1007/s11590-016-1004-x⟩. ⟨hal-03402503⟩
7 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More