基于门诊号源的均匀分布算法的设计与研究

文章主要为了解决在已设置好的基础号源中均匀地设置给定数量的“网上开放”号源,从而达到网上限号的目的。解决方法:假设基础号源数为M,需要设置的“网上开放”号源数为N,将N与M进行约分,得到最小分子(FZ)和分母(FM),然后将基础号源数M分成多个FM,然后在每个FM中取FZ个号源设置成“网上开放”号源。这种方法的好处是让“网上开放”号源尽量均匀的分布,但也存在极端情况,当N与M根本不能约分时,这样就造成了“网上开放”和“院内开放”的号源各占一端的极端情况。为了解决这种极端情况,本文引入了近似约分的概念,当N和M的最大公约数为1不能约分时,我们就将M逐步加1,直到可以约分为止,这样可以得到一个近似的最小分子和分母。当近似分子分母还不够理想时,我们还可以做二次微调近似约分,从而得到理想的分子分母。在实际应用中,算法加入了一些必要的限制条件。

Design and Research of Uniform Distribution Algorithm Based on Outpatient Number Source

This paper mainly aims to solve the problem of setting a given number of"online open"number sources evenly in the set basic number sources,so as to achieve the purpose of online limited number.Solution:assume that the number of basic number sources is m,and the number of"online open"number sources that need to be set is n.divide N and m to get the minimum numerator(FZ)and denominator(FM).Then divide the number of basic number sources m into multiple FMS,and set FZ number sources in each FM to"online open"number sources.The advantage of this method is to make the"online open"number sources as evenly distributed as possible,but there are also extreme cases.When n and M cannot be divided at all,this results in the extreme cases of"online open"and"hospital open"number sources occupying one end respectively.In order to solve this extreme situation,this paper introduces the concept of approximate divisor.When the maximum common divisor of N and M is 1,we will gradually add m to 1 until it can be reduced.In this way,we can get an approximate minimum numerator and denominator.When the approximate molecular denominator is not ideal,we can also do the second fine-tuning approximate reduction to get the ideal molecular denominator.In practical application,the algorithm adds some necessary restrictions.