Integrating heuristic information into exact methods / Samir Salhi in Journal of the operational research society (JORS), Vol. 61 N° 11 (Novembre 2010)  

Public ISBD [article]  inJournal of the operational research society (JORS) > Vol. 61 N° 11 (Novembre 2010) . - pp. 1619–1631 Titre : Integrating heuristic information into exact methods : the case of the vertex p-centre problem Type de document : texte imprimé Auteurs : Samir Salhi, Auteur ; A. Al-Khedhairi, Auteur Année de publication : 2011 Article en page(s) : pp. 1619–1631 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Vertex p-centre Location Set covering problem (SCP) Multi-level heuristic Variable neighbourhood search (VNS) Exact method Index. décimale : 001.424 Résumé : We solve the vertex p-centre problem optimally using an exact method that considers both upper and lower bounds as part of its search engine. Tight upper bounds are generated quickly via an efficient three-level heuristic, which are then used to derive potential ‘lower bounds’ accordingly. These two pieces of information when used together make our chosen exact method more efficient at obtaining optimal solutions relatively quickly. The proposed implementation produced excellent results when tested on the OR Library data set. This integrated approach can be adopted for those exact methods that consider both upper and lower bounds within their search engine and hence provide a wider spectrum of applicability in other hard combinatorial problems. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n11/abs/jors200991a.html [article] Integrating heuristic information into exact methods : the case of the vertex p-centre problem [texte imprimé] / Samir Salhi, Auteur ; A. Al-Khedhairi, Auteur . - 2011 . - pp. 1619–1631. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 11 (Novembre 2010) . - pp. 1619–1631 Mots-clés : Vertex p-centre Location Set covering problem (SCP) Multi-level heuristic Variable neighbourhood search (VNS) Exact method Index. décimale : 001.424 Résumé : We solve the vertex p-centre problem optimally using an exact method that considers both upper and lower bounds as part of its search engine. Tight upper bounds are generated quickly via an efficient three-level heuristic, which are then used to derive potential ‘lower bounds’ accordingly. These two pieces of information when used together make our chosen exact method more efficient at obtaining optimal solutions relatively quickly. The proposed implementation produced excellent results when tested on the OR Library data set. This integrated approach can be adopted for those exact methods that consider both upper and lower bounds within their search engine and hence provide a wider spectrum of applicability in other hard combinatorial problems. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n11/abs/jors200991a.html

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité
aucun exemplaire