A dual RAMP algorithm for single source capacitated facility location problems

• Tipo: Artigo em Revista Científica Internacional
• Data: 2021

Autores

Oliveira, O (Autor) Outra; Matos, T (Autor) FEUP; Gamboa, D (Autor) Outra

Revista

A Revista está pendente de validação pelos Serviços Administrativos.

Título: ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE

Vol. 89

Páginas: 815-834

ISSN: 1012-2443

Indexação

ISI Web of Knowledge - 0 Citações

Scopus - 1 Citação

Outras Informações

ID Authenticus: 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.

Idioma: Inglês

Tipo (Avaliação Docente): Científica

Nº de páginas: 20