Solving the maximum min-sum dispersion by alternating formulations of two different problems

Zhazira Amirgaliyeva, Nenad Mladenović, Raca Todosijević and Dragan Urošević

European Journal of Operational Research, 2017, vol. 260, issue 2, 444-459

Abstract: The maximum min-sum dispersion problem aims to maximize the minimum accumulative dispersion among the chosen elements. It is known to be strongly NP-hard problem. In this paper we present heuristic where the objective functions of two different problems are shifted within variable neighborhood search framework. Though this heuristic can be seen as an extended variant of variable formulation search approach that takes into account alternative formulations of one problem, the important difference is that it allows using alternative formulations of more than one optimization problem. Here we use one alternative formulation that is of max-sum type of the originally max–min type maximum diversity problem. Computational experiments on the benchmark instances used in the literature show that the suggested approach improves the best known results for most instances in a shorter computing time.

Keywords: Metaheuristics; Dispersion problems; Binary quadratic programing; Variable neighborhood search; Variable formulation search (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221716310736
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:260:y:2017:i:2:p:444-459

DOI: 10.1016/j.ejor.2016.12.039

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().