A Local Branching Approach for the Set Covering Problem

Autor:	Masoud Yaghini, Mohsen Momeni, Mohammadreza Momeni Sarmadi
Jazyk:	angličtina
Rok vydání:	2014
Předmět:	heuristics set covering problem local branching algorithm design of experiments Technology
Zdroj:	International Journal of Industrial Engineering and Production Research, Vol 25, Iss 2, Pp 95-102 (2014)
Druh dokumentu:	article
ISSN:	2008-4889 2345-363X
Popis:	The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching approach for the SCP. This solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. The algorithm parameters are tuned by design of experiments approach. The proposed method is tested on the several standard instances. The results show that the algorithm outperforms the best heuristic approaches found in the literature.
Databáze:	Directory of Open Access Journals
Externí odkaz:	https://doaj.org/article/d64e2dde86f345c1a30cf2f625f6079e Zobrazit plný text záznamu View record in DOAJ