Metaheuristic techniques for the capacitated facility location problem with customer incompatibilities

We study a novel version of the capacitated facility location problem, which includes incompatibilities among customers. For this problem, we propose and compare on a fair common ground a portfolio of metaheuristic techniques developed independently from each other. We tested our techniques on a new...

Full description

Saved in:

Bibliographic Details
Published in:	Soft computing (Berlin, Germany) Vol. 27; no. 8; pp. 4685 - 4698
Main Authors:	Maia, Marcelo R. H., Reula, Miguel, Parreño-Torres, Consuelo, Vuppuluri, Prem Prakash, Plastino, Alexandre, Souza, Uéverton S., Ceschia, Sara, Pavone, Mario, Schaerf, Andrea
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01-04-2023
Subjects:	Artificial Intelligence Computational Intelligence Control Engineering Mathematical Logic and Foundations Mechatronics Optimization Robotics Facility location Multi-sourcing Metaheuristics
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	We study a novel version of the capacitated facility location problem, which includes incompatibilities among customers. For this problem, we propose and compare on a fair common ground a portfolio of metaheuristic techniques developed independently from each other. We tested our techniques on a new dataset composed of instances of increasing size, varying from medium to very large ones. The outcome is that the technique based on data mining has been able to outperform the others in most instances, except for a few large cases, for which it is overcome by the simpler greedy one. In order to encourage future comparisons on this problem, we make the instances, solution validator and implementations of the metaheuristic techniques available to the community.
ISSN:	1432-7643 1433-7479
DOI:	10.1007/s00500-022-07600-z