2012
DOI: 10.1016/j.endm.2012.10.020
|View full text |Cite
|
Sign up to set email alerts
|

A Hybrid Metaheuristic Based on Variable Neighborhood Search and Tabu Search for the Web Service Selection Problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
1
0
1

Year Published

2015
2015
2023
2023

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 10 publications
0
1
0
1
Order By: Relevance
“…Drezner, Marcoulides & Stohs applied efficiently within finance (Drezner et al, 2001). Finally, Turajlic and Dragovic (2010) used Tabu Search for selecting the set of services with the best overall quality of service by solving the web service selection problem (Turajlic & Dragovic, 2012). Recently, Wang, Lu & Glover propose a Tabu Search algorithm for the Unconstrained Binary Quadratic Programming (Wang et al, 2013).…”
Section: Introductionmentioning
confidence: 99%
“…Drezner, Marcoulides & Stohs applied efficiently within finance (Drezner et al, 2001). Finally, Turajlic and Dragovic (2010) used Tabu Search for selecting the set of services with the best overall quality of service by solving the web service selection problem (Turajlic & Dragovic, 2012). Recently, Wang, Lu & Glover propose a Tabu Search algorithm for the Unconstrained Binary Quadratic Programming (Wang et al, 2013).…”
Section: Introductionmentioning
confidence: 99%
“…(Villa et al, 2006;Turajlic & Dragovic, 2012 Hansen et al (2001) propuseram a meta-heurística VNDS (Método de Busca Decomposta em Vizinhança Variável) como uma variação da meta-heurística VNS proposta por Mladenovic & Hansen (1997). A principal mudança em relação ao VNS é a busca local, que é decomposta em duas etapas.…”
Section: Figura 25 -Funcionamento Do Vnsunclassified