Authors: | Ilić, Aleksandar Urošević, Dragan Brimberg, Jack Mladenović, Nenad |
Affiliations: | Mathematical Institute of the Serbian Academy of Sciences and Arts | Title: | A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem | Journal: | European Journal of Operational Research | Volume: | 206 | Issue: | 2 | First page: | 289 | Last page: | 300 | Issue Date: | 16-Oct-2010 | Rank: | M21a | ISSN: | 03772217 | DOI: | 10.1016/j.ejor.2010.02.022 | Abstract: | We present a new general variable neighborhood search approach for the uncapacitated single allocation p-hub median problem in networks. This NP hard problem is concerned with locating hub facilities in order to minimize the traffic between all origin-destination pairs. We use three neighborhoods and efficiently update data structures for calculating new total flow in the network. In addition to the usual sequential strategy, a new nested strategy is proposed in designing a deterministic variable neighborhood descent local search. Our experimentation shows that general variable neighborhood search based heuristics outperform the best-known heuristics in terms of solution quality and computational effort. Moreover, we improve the best-known objective values for some large Australia Post and PlanetLab instances. Results with the new nested variable neighborhood descent show the best performance in solving very large test instances. |
Keywords: | Discrete location | Nested variable neighborhood descent | p-Hub median | Variable neighborhood search | Publisher: | Elsevier | Project: | Serbian Ministry of Science and Environmental Protection, Grant 144007 |
Show full item record
SCOPUSTM
Citations
136
checked on Nov 11, 2024
Page view(s)
23
checked on Nov 11, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.