Jigsaw Inspired Metaheuristic for Selecting the Optimal Solution in Web Service Composition.
Viorica Rozina ChifuIoan SalomieEmil St. ChifuCristina Bianca PopPetru PorutiuMarcel AntalPublished in: SOFA (1) (2014)
Keyphrases
- metaheuristic
- web service composition
- optimal solution
- discrete particle swarm optimization
- service composition
- ant colony optimization
- tabu search
- vehicle routing problem
- web services
- petri net
- search space
- automated web service composition
- scatter search
- simulated annealing
- optimization problems
- path relinking
- description language
- particle swarm optimization
- ai planning
- feasible solution
- combinatorial optimization
- traveling salesman problem
- service selection
- genetic algorithm
- iterated local search
- search methods
- branch and bound algorithm
- branch and bound
- solution space
- optimization method
- initial solution
- knapsack problem
- np hard
- lower bound
- solution quality
- benchmark instances
- service oriented
- variable neighborhood search
- objective function
- greedy randomized adaptive search procedure
- linear program
- mixed integer
- optimization methods