【24h】

Journey Arrangements Based on Queuing Theory

机译:基于排队论的旅程安排

获取原文
获取原文并翻译 | 示例

摘要

In this article, the queuing theory is applied to study the problem of journey arrangements. Primarily, with the analysis of stochastic processes, we draw the conclusion that the arrival of tourists conforms to the Poisson distribution and the camping time also complies with the general independent and identically distributed law. As each camp can be seen as the selectable service counter, we determine the M / G / s / s model in the premise of the queuing theory. Then, a higher precision simulation model is established which makes fewer assumptions to ensure the practicability. So when the camp sites have been determined before, this model exhausts all possible situations, and solves the problem of occupied camp by adopting the semaphore mechanism. Finally based on the simulation model program, we get the maximum group which can be accepted after provided with camping spots.
机译:在本文中,将排队论应用于研究行程安排问题。首先,通过对随机过程的分析,我们得出以下结论:游客的到来符合泊松分布,露营时间也符合一般的独立且分布均匀的规律。由于每个阵营都可以看作是可选服务计数器,因此我们在排队论的前提下确定M / G / s / s模型。然后,建立了一个高精度的仿真模型,该模型做出较少的假设来确保实用性。因此,在事先确定营地之后,该模型将尽所有可能的情况,并采用信号量机制解决营地占用问题。最终,基于仿真模型程序,获得了提供露营点后可以接受的最大组。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号