Variable neighborhood search and tabu search for the web service selection problem

DOI10.1016/J.ENDM.2012.10.024MaRDI QIDQ2840771zbMATH OpenOpenAlexFDO

Authors Nina Turajlić, Siniša Nešković

Publication date 23 July 2013

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2012.10.024

zbMATH Keywords

cloud computingMMKPQoStabu searchvariable neighborhood searchweb service selection problem

Mathematics Subject Classification ID

Internet topics (68M11) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• A hybrid metaheuristic based on variable neighborhood search and tabu search for the web service selection problem
• Enhanced artificial bee colony algorithm for QoS-aware web service selection problem
• Web service selection based on a modified ant colony optimization
• Web services composition: complexity and models
• A dynamic web services selection algorithm with QoS global optimal in web services composition

Cites work

• Tabu Search—Part I
• Variable neighborhood search

Cited in

(3)

• A hybrid metaheuristic based on variable neighborhood search and tabu search for the web service selection problem
• Variable neighborhood search for the workload balancing problem in service enterprises
• Automated knowledge source selection and service composition

This page was built for publication: Variable neighborhood search and tabu search for the web service selection problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2840771)