Smt Versus Genetic And Openopt Algorithms: Concrete Planning In The Planics Framework

The paper deals with the concrete planning problem (CPP) - a stage of the Web Service Composition (WSC) in the PlanICS framework. The complexity of the problem is discussed. A novel SMT-based approach to CPP is defined and its performance is compared to the standard Genetic Algorithm (GA) and the OpenOpt numerical toolset planner in the framework of the PlanICS system. The discussion of all the approaches is supported by extensive experimental results.