The model and the genetic algorithms for one-to-many single factorservice placement problem are given. Numerical experimental simulations support the feasibility of the model and the algorithms.
给出了一对多单因子服务部署问题的数学模型和求解该问题的遗传算法，并通过数值模拟表明了算法的有效性。
2
For parallel operations this is not a factor, but consider when a transaction is serial and information from one service call may be needed by another.