HGVPRLB: a hybrid algorithm for solving binary problems
Josiane da Costa Vieira Rezende$^{1}$, Rone Ilídio da Silva$^{2}$, Marcone Freitas Souza$^{1}$
$^{1}$Universidade Federal de Ouro Preto. Ouro Branco-MG Brazil,
$^{2}$Universidade Federal de Sao Joao Del Rei. Ouro Branco-MG Brazil
email: josianecvieira@gmail.com, rone@ufsj.edu.br, marcone@iceb.ufop.br

Schedule:Mon 19th@10:45, Room: A

In this paper it is proposed a hybrid algorithm, so-called HGVPRLB, for solving generic binary problems. The algorithm HGVPRLB combines the heuristic procedures GRASP, Variable Neighborhood Descent, Constraint Propagation and Local Branching Cuts. It was tested in a set of binary problems from MIPLIB 2010 in order to check both its ability to obtain feasible solutions as its ability to improve the value of these solutions varying the processing time. Computational experiments showed that when the processing time increases the algorithm can increase the number of feasible solutions found in the set as well the quality of the solutions. Besides it, the proposed algorithm outperforms another algorithm of literature, as well as two other open source solvers.

BibTex

@InProceedings{CLEI-2015:144307,
	author 		= {Josiane da Costa Vieira Rezende and Rone Ilídio da Silva and Marcone Freitas Souza},
	title 		= {HGVPRLB: a hybrid algorithm for solving binary problems},
	booktitle 	= {2015 XLI Latin American Computing Conference (CLEI)},
	pages 		= {249--257},
	year 		= {2015},
	editor 		= {Hector Cancela and Alex Cuadros-Vargas and Ernesto Cuadros-Vargas},
	address 	= {Arequipa-Peru},
	month 		= {October},
	organization 	= {CLEI},
	publisher 	= {CLEI},
	url 		= {http://clei.org/clei2015/144307},
	isbn 		= {978-1-4673-9143-6},
	}