A Simple Dual-RAMP Algorithm for the Uncapacitated Multiple Allocation Hub Location Problem

6Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper presents a Dual-RAMP algorithm for the solution of the multiple allocation hub location problem (UMAHLP). This approach combines information of a lagrangean relaxation procedure with subgradient optimization on the dual side with primal-feasible solutions on primal side, that are obtained by a simple improvement method. The overall performance of the proposed algorithm was tested on standard Australian Post (AP) and Civil Aeronautics Boarding (CAB) instances, comprising 192 test instances. The effectiveness of our approach has been proven by comparing our results with other state-of-the-art algorithms.

Cite

CITATION STYLE

APA

Matos, T., Maia, F., & Gamboa, D. (2020). A Simple Dual-RAMP Algorithm for the Uncapacitated Multiple Allocation Hub Location Problem. In Advances in Intelligent Systems and Computing (Vol. 923, pp. 331–339). Springer Verlag. https://doi.org/10.1007/978-3-030-14347-3_32

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free