RAMP algorithms for the capacitated facility location problem

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 C...

Full description

Saved in:
Bibliographic Details
Published in:Annals of mathematics and artificial intelligence 2021-09, Vol.89 (8-9), p.799-813
Main Authors: Matos, Telmo, Oliveira, Óscar, Gamboa, Dorabela
Format: Article
Language:English
Subjects:
Algorithms
Artificial Intelligence
Complex Systems
Computer Science
Costs
Customers
Heuristic
Industrial locations
Linear programming
Mathematics
Operations research
Site selection
Solution space
Variables
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1012-2443
1573-7470
DOI:10.1007/s10472-021-09757-z