Skip Navigation


IMA Journal of Management Mathematics Advance Access originally published online on March 14, 2007
IMA Journal of Management Mathematics 2007 18(2):157-171; doi:10.1093/imaman/dpm013
This Article
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
18/2/157    most recent
dpm013v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Pérez, M. P.
Right arrow Articles by Moreno-Vega, J. M.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The authors 2007. Published by Oxford University Press on behalf of the Institute of Mathematics and its Applications. All rights reserved.

A hybrid VNS–path relinking for the p-hub median problem

Melquíades Pérez Pérez**, Francisco Almeida Rodríguez*** and J. Marcos Moreno-Vega****

Departamento de Estadística, Investigación Operativa y Computación, Escuela Técnica Superior de Ingeniería Informática, Universidad de La Laguna, 38271 La Laguna, Spain

** Email: melperez{at}ull.es

*** Email: falmeida{at}ull.es

**** Email: jmmoreno{at}ull.es


  Abstract

The p-hub median problem is an NP-hard location–allocation problem which consists of finding p points to establish facilities and assign users to these points. Over the last few decades, the field of hybrid metaheuristics has been continuously growing. Variable neighbourhood search and path relinking are two recent evolutionary approaches that have proven very effective in solving optimization problems. In this paper, we present an hybrid algorithm that combines these new heuristics to solve the p-hub median problem and compare its effectiveness with other classical techniques. This procedure provides high-quality solutions in reasonable time frames.

Keywords: hub location; VNS; path relinking; metaheuristics

Received on April 2006. accepted on 2 February 2007.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.