DOI
10.9781/ijimai.2022.04.003
Abstract
In this paper, we address the Uncapacitated Plant Cycle Location Problem. It is a location-routing problem aimed at determining a subset of locations to set up plants dedicated to serving customers. We propose a mathematical formulation to model the problem. The high computational burden required by the formulation when tackling large scenarios encourages us to develop a Greedy Randomized Adaptive Search Procedure with Probabilistic Learning Model. Its rationale is to divide the problem into two interconnected sub-problems.
Source Publication
International Journal of Interactive Multimedia and Artificial Intelligence
Recommended Citation
López-Plata, Israel; Expósito-Izquierdo, Christopher; Lalla-Ruiz, Eduardo; Melián-Batista, Belén; and Moreno-Vega, J. Marcos
(2023)
"A Greedy Randomized Adaptive Search With Probabilistic Learning for solving the Uncapacitated Plant Cycle Location Problem,"
International Journal of Interactive Multimedia and Artificial Intelligence: Vol. 8:
Iss.
2, Article 13.
DOI: 10.9781/ijimai.2022.04.003
Available at:
https://ijimai.researchcommons.org/ijimai/vol8/iss2/13
