A note on heuristic approach based on UBQP formulation of the maximum diversity problem

The maximum diversity problem (MDP) is a challenging NP-hard problem with a wide range of real applications. Several researchers have pointed out close relationship between the MDP and unconstrained binary quadratic program (UBQP). In this paper, we provide procedures to solve MDP ideas from the UBQ...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:The Journal of the Operational Research Society Ročník 68; číslo 1; s. 102 - 110
Hlavní autori: Alidaee, Bahram, Wang, Haibo
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: London Taylor & Francis 01.01.2017
Taylor & Francis, Ltd
Palgrave Macmillan UK
Taylor & Francis Ltd
Predmet:
Business and Management
combinatorial optimization problem
diversification strategy
Heuristic methods
Management
maximum diversity problem
Operations Research/Decision Theory
r-flip local search
Tabu search
unconstrained binary quadratic programming
maximum diversity problem
diversification strategy
-
local search
combinatorial optimization problem
unconstrained binary quadratic programming
ISSN:0160-5682, 1476-9360
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:The maximum diversity problem (MDP) is a challenging NP-hard problem with a wide range of real applications. Several researchers have pointed out close relationship between the MDP and unconstrained binary quadratic program (UBQP). In this paper, we provide procedures to solve MDP ideas from the UBQP formulation of the problem. We first give some local optimality results for r-flip improvement procedures on MDP. Then, a set of highly effective diversification approaches based on sequential improvement steps for MDP are presented. Four versions of the approaches are used within a simple tabu search and applied to 140 benchmark MDP problems available on the Internet. The procedures solve all 80 small- to medium-sized problems instantly to the best known solutions. For 22 of the 60 large problems, the procedures improved by significant amounts the best known solutions in reasonably short CPU time.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0160-5682
1476-9360
DOI:10.1057/s41274-016-0031-4