6533b820fe1ef96bd127a59a

RESEARCH PRODUCT

A Hybrid Strategic Oscillation with Path Relinking Algorithm for the Multiobjective k-Balanced Center Location Problem

Alfredo G. Hernández-díazJesús Sánchez-oroAna Dolores López-sánchezAnna Martínez-gavaraAbraham Duarte

subject

Mathematical optimizationComputer scienceGeneral Mathematics0211 other engineering and technologiesEvolutionary algorithm02 engineering and technologyMulti-objective optimizationSet (abstract data type)path relinkingDiscrete optimization0202 electrical engineering electronic engineering information engineeringComputer Science (miscellaneous)Center (algebra and category theory)multiobjective optimizationEngineering (miscellaneous)021103 operations researchOscillationlcsh:MathematicsWorkload<i>k</i>-balanced problemGreedy Randomized Adaptive Search Procedure (GRASP)lcsh:QA1-939strategic oscillationPath (graph theory)020201 artificial intelligence & image processingdiscrete optimization<i>k</i>-center problem

description

This paper presents a hybridization of Strategic Oscillation with Path Relinking to provide a set of high-quality nondominated solutions for the Multiobjective k-Balanced Center Location problem. The considered location problem seeks to locate k out of m facilities in order to serve n demand points, minimizing the maximum distance between any demand point and its closest facility while balancing the workload among the facilities. An extensive computational experimentation is carried out to compare the performance of our proposal, including the best method found in the state-of-the-art as well as traditional multiobjective evolutionary algorithms.

yearjournalcountryeditionlanguage
2021-04-14Mathematics
10.3390/math9080853http://dx.doi.org/10.3390/math9080853