Home // SERVICE COMPUTATION 2014, The Sixth International Conferences on Advanced Service Computing // View article

Genetic Algorithm to the Power of SMT: a Hybrid Approach to Web Service Composition Problem

Authors:
Artur Niewiadomski
Wojciech Penczek
Jaroslaw Skaruz

Keywords: Web Service Composition; Concrete Planning; Genetic Algorithm; Satisfiability Modulo Theories; Hybrid Algorithm

Abstract:
The paper deals with the concrete planning problem – a stage of the Web Service Composition in the PlanICS framework, which consists in choosing the best service offers in order to satisfy the user query and to maximize the quality function. We introduce a novel planning technique based on a combination of a Genetic Algorithm with a Satisfiability Modulo Theories Solver, which allows to obtain better results than each of the methods separately. The paper presents some preliminary, although very encouraging, experimental results.

Pages: 44 to 48

Copyright: Copyright (c) IARIA, 2014

Publication date: May 25, 2014

Published in: conference

ISSN: 2308-3549

ISBN: 978-1-61208-337-7

Location: Venice, Italy

Dates: from May 25, 2014 to May 29, 2014