A proposal for a hybrid meta-strategy for combinatorial optimization problems

In this paper, we propose an algorithm named BDS (Bound-Driven Search) that combines features of exact and approximate methods. The proposed procedure may be seen as a local search algorithm that systematically explores (in a branch-and bound sense) the most promising nodes, thus preventing solution...

Descripción completa

Detalles Bibliográficos
Autores: Framiñán Torres, José Manuel, Pastor, Rafael
Tipo de recurso: artículo
Estado:Versión enviada para evaluación y publicación
Fecha de publicación:2008
País:España
Institución:Universidad de Sevilla (US)
Repositorio:idUS. Depósito de Investigación de la Universidad de Sevilla
OAI Identifier:oai:idus.us.es:11441/103020
Acceso en línea:https://hdl.handle.net/11441/103020
https://doi.org/10.1007/s10732-007-9056-9
Access Level:acceso abierto
Palabra clave:Optimization
Meta-heuristics
Branch & bound
id ES_e29b7807480971ebcc085dcc4e15d506
oai_identifier_str oai:idus.us.es:11441/103020
network_acronym_str ES
network_name_str España
repository_id_str
spelling A proposal for a hybrid meta-strategy for combinatorial optimization problemsFramiñán Torres, José ManuelPastor, RafaelOptimizationMeta-heuristicsBranch & boundIn this paper, we propose an algorithm named BDS (Bound-Driven Search) that combines features of exact and approximate methods. The proposed procedure may be seen as a local search algorithm that systematically explores (in a branch-and bound sense) the most promising nodes, thus preventing solutions from being reevaluated. Additionally, it can be regarded as an exact method as it may be able to guarantee that the solution found is optimal. We present the application of this new algorithm to a specific problem domain: the permutation flow shop scheduling problem with makespan objective. The subsequent computational experiments are encouraging, as the algorithm is able to yield exact or near exact solutions to most instances of the problem. Furthermore, the algorithm outperforms one of the best state-of-the-art algorithms for the problem.Ministerio de Ciencia y Tecnología DPI 2004-02902Ministerio de Ciencia y Tecnología DPI 2004-03472SpringerOrganización Industrial y Gestión de Empresas I2008info:eu-repo/semantics/articleinfo:eu-repo/semantics/submittedVersionapplication/pdfapplication/pdfhttps://hdl.handle.net/11441/103020https://doi.org/10.1007/s10732-007-9056-9reponame:idUS. Depósito de Investigación de la Universidad de Sevillainstname:Universidad de Sevilla (US)InglésJournal of Heuristics volume, 2008 (14), 375-390.DPI 2004-02902DPI 2004-03472https://link.springer.com/article/10.1007/s10732-007-9056-9info:eu-repo/semantics/openAccessoai:idus.us.es:11441/1030202026-06-17T12:51:07Z
dc.title.none.fl_str_mv A proposal for a hybrid meta-strategy for combinatorial optimization problems
title A proposal for a hybrid meta-strategy for combinatorial optimization problems
spellingShingle A proposal for a hybrid meta-strategy for combinatorial optimization problems
Framiñán Torres, José Manuel
Optimization
Meta-heuristics
Branch & bound
title_short A proposal for a hybrid meta-strategy for combinatorial optimization problems
title_full A proposal for a hybrid meta-strategy for combinatorial optimization problems
title_fullStr A proposal for a hybrid meta-strategy for combinatorial optimization problems
title_full_unstemmed A proposal for a hybrid meta-strategy for combinatorial optimization problems
title_sort A proposal for a hybrid meta-strategy for combinatorial optimization problems
dc.creator.none.fl_str_mv Framiñán Torres, José Manuel
Pastor, Rafael
author Framiñán Torres, José Manuel
author_facet Framiñán Torres, José Manuel
Pastor, Rafael
author_role author
author2 Pastor, Rafael
author2_role author
dc.contributor.none.fl_str_mv Organización Industrial y Gestión de Empresas I
dc.subject.none.fl_str_mv Optimization
Meta-heuristics
Branch & bound
topic Optimization
Meta-heuristics
Branch & bound
description In this paper, we propose an algorithm named BDS (Bound-Driven Search) that combines features of exact and approximate methods. The proposed procedure may be seen as a local search algorithm that systematically explores (in a branch-and bound sense) the most promising nodes, thus preventing solutions from being reevaluated. Additionally, it can be regarded as an exact method as it may be able to guarantee that the solution found is optimal. We present the application of this new algorithm to a specific problem domain: the permutation flow shop scheduling problem with makespan objective. The subsequent computational experiments are encouraging, as the algorithm is able to yield exact or near exact solutions to most instances of the problem. Furthermore, the algorithm outperforms one of the best state-of-the-art algorithms for the problem.
publishDate 2008
dc.date.none.fl_str_mv 2008
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/submittedVersion
format article
status_str submittedVersion
dc.identifier.none.fl_str_mv https://hdl.handle.net/11441/103020
https://doi.org/10.1007/s10732-007-9056-9
url https://hdl.handle.net/11441/103020
https://doi.org/10.1007/s10732-007-9056-9
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv Journal of Heuristics volume, 2008 (14), 375-390.
DPI 2004-02902
DPI 2004-03472
https://link.springer.com/article/10.1007/s10732-007-9056-9
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Springer
publisher.none.fl_str_mv Springer
dc.source.none.fl_str_mv reponame:idUS. Depósito de Investigación de la Universidad de Sevilla
instname:Universidad de Sevilla (US)
instname_str Universidad de Sevilla (US)
reponame_str idUS. Depósito de Investigación de la Universidad de Sevilla
collection idUS. Depósito de Investigación de la Universidad de Sevilla
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869422425854181376
score 15,300719

Similares en LA Referencia