A dual RAMP algorithm for single source capacitated facility location problems

• Type: Article in International Scientific Journal
• Date: 2021

Authors

Oliveira, O (Author) Other; Matos, T (Author) FEUP; Gamboa, D (Author) Other

Journal

The Journal is awaiting validation by the Administrative Services.

Title: ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE

Vol. 89

Pages: 815-834

ISSN: 1012-2443

Indexing

ISI Web of Knowledge - 0 Citations

Scopus - 1 Citation

Other information

Authenticus ID: P-00V-2E2

DOI: 10.1007/s10472-021-09756-0

Abstract (EN): In this paper, we address the Single Source Capacitated Facility Location Problem (SSCFLP) which considers a set of possible locations for opening facilities and a set of clients whose demand must be satisfied. The objective is to minimize the cost of assigning the clients to the facilities, ensuring that all clients are served by only one facility without exceeding the capacity of the facilities. We propose a Relaxation Adaptive Memory Programming (RAMP) heuristic for solving the SSCFLP to efficiently explore the relation between the primal and the dual sides of this combinatorial optimisation problem. Computational experiments demonstrated that the proposed heuristic is very effective in terms of solution quality with reasonable computing times.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 20