NAGIOS: RODERIC FUNCIONANDO

Max–min dispersion with capacity and cost for a practical location problem

Repositori DSpace/Manakin

IMPORTANT: Aquest repositori està en una versió antiga des del 3/12/2023. La nova instal.lació está en https://roderic.uv.es/

Max–min dispersion with capacity and cost for a practical location problem

dc.contributor.author	Lozano Osorio, Isaac
dc.contributor.author	Martínez Gavara, Anna
dc.contributor.author	Martí, Rafael
dc.contributor.author	Duarte, Abraham
dc.date.accessioned	2023-06-14T07:06:22Z
dc.date.available	2023-06-15T04:45:05Z
dc.date.issued	2022	es_ES
dc.identifier.citation	Lozano-Osorio, I., Martínez-Gavara, A., Martí, R., & Duarte, A. (2022). Max–min dispersion with capacity and cost for a practical location problem. Expert Systems with Applications, 200, 116899.	es_ES
dc.identifier.uri	https://hdl.handle.net/10550/87892
dc.description.abstract	Diversity and dispersion problems deal with selecting a subset of elements from a given set in such a way that their diversity is maximized. This study considers a practical location problem recently proposed in the context of max–min dispersion models. It is called the generalized dispersion problem, and it models realistic applications by introducing capacity and cost constraints. We propose two effective linear formulations for this problem, and develop a hybrid metaheuristic algorithm based on the variable neighborhood search methodology, to solve real instances. Extensive numerical computational experiments are performed to compare our hybrid metaheuristic with the state-of-art heuristic, and with integer linear programming formulations (ILP). Results on public benchmark instances show the superiority of our proposal with respect to the previous algorithms. Our extensive experimentation reveals that ILP models are able to optimally solve medium-size instances with the Gurobi optimizer, although metaheuristics outperform ILP both in running time and quality in large-size instances.	es_ES
dc.language.iso	en	es_ES
dc.publisher	Elsevier	es_ES
dc.subject	metaheuristics	es_ES
dc.subject	combinatorial optimization	es_ES
dc.subject	diversity maximization	es_ES
dc.subject	dispersion	es_ES
dc.subject	variable neighborhood search	es_ES
dc.title	Max–min dispersion with capacity and cost for a practical location problem	es_ES
dc.type	journal article	es_ES
dc.subject.unesco	UNESCO::CIENCIAS TECNOLÓGICAS	es_ES
dc.identifier.doi	10.1016/j.eswa.2022.116899	es_ES
dc.accrualmethod	CI	es_ES
dc.embargo.terms	0 days	es_ES
dc.type.hasVersion	VoR	es_ES
dc.rights.accessRights	open access	es_ES