Abstract (EN):
In this paper, we address the Capacitated Facility Location Problem (CFLP) in which the assignment of facilities to customers must ensure enough facility capacity and all the customers must be served. We propose both sequential and parallel Relaxation Adaptive Memory Programming approaches for the CFLP, combining a Lagrangean subgradient search with an improvement method to explore primal-dual relationships to create advanced memory structures that integrate information from both primal and dual solution spaces. Computational experiments of the effectiveness of this approach are presented and discussed.
Idioma:
Inglês
Tipo (Avaliação Docente):
Científica
Nº de páginas:
15