论文部分内容阅读
基于M/G/k排队系统和不同的需求分派方式,建立了有等待时间约束、系统指派和顾客选择两种方式下的最大覆盖选址模型。对于系统指派模型,设计了求解问题的快速启发式算法,同Lingo精确解相比,结果表明该算法可以在较短的时间内求得满意解,因此可以为其他算法生成有效的初始解或提供最优解的下界。同时,对比分析了两种指派方式所造成的选址差异:系统指派规则具有较高的效率,但是对部分顾客可能存在分派不合理的现象,而顾客选择模型则恰好相反。
Based on the M / G / k queuing system and different demand distribution methods, a maximum coverage location model with waiting time constraint, system assignment and customer selection is established. For the system assignment model, a fast heuristic algorithm is designed to solve the problem. Compared with the Lingo exact solution, the results show that the algorithm can find satisfactory solutions in a short period of time and thus can generate effective initial solutions for other algorithms or provide Lower bound of the optimal solution. At the same time, the differences of site selection caused by the two kinds of assignments are compared and analyzed. The system assignment rule has high efficiency, but some customers may have an unreasonable distribution, while the customer selection model is just the opposite.