Dual-RAMP for the Capacitated Single Allocation Hub Location Problem

• Type: Article in International Conference Proceedings Book
• Date: 2017

Authors

Matos, T (Author) Other; Gamboa, D (Author) Other

Conference proceedings International

Title: COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2017, PT II

Pages: 696-708

17th International Conference on Computational Science and its Applications (ICCSA)

Trieste, ITALY, JUL 03-06, 2017

Indexing

ISI Web of Knowledge - 4 Citations

Scopus - 6 Citations

Other information

Authenticus ID: P-00P-T7C

DOI: 10.1007/978-3-319-62395-5_48

Abstract (EN): We consider the Capacitated Single Allocation Hub Location Problem (CSAHLP) in which the objective is to choose the set of hubs from all nodes in a given network in such way that the allocation of all the nodes to the chosen hubs is optimal. We propose a Relaxation Adaptive Memory Programming (RAMP) approach for the CSAHLP. Our method combines Lagrangean Subgradient search with an improvement method to explore primal-dual relationships and create advanced memory structures that integrate information from both primal and dual solutions spaces. The algorithm was tested on the standard dataset and produced extremely competitive results that include new best-known solutions. Comparisons with the current best performing algorithms for the CSAHLP show that our RAMP algorithm exhibits excellent results.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 13