A general variable neighborhood search for solving the uncapacitated r-allocation p-hub median problem - Université Polytechnique des Hauts-de-France Accéder directement au contenu
Article Dans Une Revue Optimization Letters Année : 2017

A general variable neighborhood search for solving the uncapacitated r-allocation p-hub median problem

Résumé

The \(p\) -hub median problem consists of choosing \(p\) hub locations from a set of nodes with pairwise traffic demands in order to route the traffic between the origin-destination pairs at minimum cost. We accept general assumption that transportation between non-hub nodes is possible only via \(r\) -hub nodes, to which non-hub nodes are assigned. In this paper we propose a general variable neighborhood search heuristic to solve the problem in an efficient and effective way. Moreover, for the first time full nested variable neighborhood descent is applied as a local search within Variable neighborhood search. Computational results outperform the current state-of-the-art results obtained by GRASP based heuristic.
Fichier non déposé

Dates et versions

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

Identifiants

Citer

Raca Todosijević, Dragan Urošević, Nenad Mladenovic, Said Hanafi. A general variable neighborhood search for solving the uncapacitated r-allocation p-hub median problem. Optimization Letters, 2017, 11 (6), pp.1-13. ⟨10.1007/s11590-015-0867-6⟩. ⟨hal-03401364⟩
15 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More