We study the performance of stochastic matching models with general compatibility graphs. Items different classes arrive to system according independent Poisson processes. Upon arrival, an item is matched a compatible First Come Matched discipline and both items leave immediately. If there are no items, new arrival joins queue unmatched same class. Compatibilities between defined by connected g...

In this paper, a general framework was presented to boost heuristic optimization algorithms based on swarm intelligence from static to dynamic environments. Regarding the problems of dynamic optimization as opposed to static environments, evaluation function or constraints change in the time and hence place of optimization. The subject matter of the framework is based on the variability of the ...