A Cost-Effective Planning Graph Approach for Large-Scale Web Service Composition

Algorithm 1

𝑖←0,𝑃₀←𝑠₀,𝐺←𝑃₀

repeat

 𝐺←ExpandBasedOnBackward(𝐺)

 𝑆←ExtractSolutions(𝐺,𝑆)

 𝑆←ReduceSolutions(𝑆)

 𝑖=𝑖+1

 ValidateSolution(𝐺,𝑆)

Compute Score (𝐺,𝑆)

Output(SearchSolution(𝑆))