机场航站楼安检通道数量配置优化方法研究

科学配置机场航站楼的安检通道数量,是提高安检服务效率、保障民航运输安全的重要手段.通过对机场航站楼的安检排队系统进行特征分析,利用排队理论建立两种安检排队模型.调研国内典型机场的实际运行数据,计算安检排队模型的主要运行指标,分析各指标的变化规律,并针对两种排队模型的运行效率进行对比.结果表明,排队系统的平均排队长和旅客平均等待时间均呈周期性变化,安检通道最少配置数量随着旅客到达率的增加而增加,单队多服务台系统在理论上比单队单服务台系统的运行效率更高.研究成果为优化机场航站楼安检通道数量配置、提高安检运行效率提供理论依据与决策支持.     

机场安检系统旅客吞吐量的优化模型——ICM2017 D题简析

<正>1赛题分析与解题思路2017年美国大学生数学建模竞赛D题研究机场安检系统旅客吞吐量的优化问题。赛题要求针对美国的机场安检系统建立数学模型,解决如下问题:1)研究旅客通过安检系统的流量,并识别现有系统中的瓶颈,找出存在的问题;2)提出可能的改进措施,以提高旅客吞吐量和减少等待时间的不确定性,并说明这些措施对安检过     

基于个体仿真的机场安检系统优化研究

建立了安检流程的网络流模型,模型中包含了不稳定的乘客到达情形、嫌疑乘客以及反馈机制。分析了安检过程中的瓶颈所在,并给出了相应的优化方案,包括整个安检过程的通行规则,A区和B区内部预检节点与普通节点的适当比例等。仿真结果显示,为了充分利用安检资源并兼顾预检乘客的利益,通行规则应采用连通方案。依照统计数据中计算出的各种参数,在A区预检节点和普通节点比例设置为2∶2,B区预检节点和普通节点比例设置为3∶5的情况下,旅客平均等待时间最短,等待时间的标准差也最小,同时高峰期的通行量也相对较优。进一步分析了不同的文化背景及机场情况。对于美国人和瑞士人,通过改变预检乘客的选择概率来满足他们不同的行为偏好。仿真结果说明,预检乘客选择哪类节点进行安检对平均等待时间、等待时间的标准差和高峰期通行量的影响不大。分析了插队情形,插队对平均等待时间和高峰期通行量几乎没有影响,但当插队比例非常大时,旅客等待时间标准差会增加,影响乘客到达的准确性。最后,针对具体情况提出了一些合理的建议,并给出了进一步的研究计划。     

线上结合线下的供应链动态服务与定价决策研究

本文研究由一个传统电商企业和线下实体零售商组成的线上结合线下的供应链系统。由于线下服务努力能同时增加线上和线下的销售量,于是传统电商纷纷开设线下实体店,或者与已有的实体店进行合作。这两种模式分别对应集中决策和分散决策模式,因此本文构建了线上结合线下的供应链动态模型并研究这两种决策模式下的最优服务和定价决策。结果表明:(1)当线下渠道偏好增加时,无论是集中决策下还是分散决策模式下,企业都应该提高线下价格而降低线上价格以获得最优利润,而在分散决策模式下,传统电商还应该提高其批发价格;(2)成本分担策略能够提高线下实体店对服务的投入,从而提高服务和商誉水平;(3)成本分担策略能使线下零售店和传统电商的利润水平都得到了提高,实现了帕累托改进;(4)当满足一定条件时,成本分担-收益分担机制能够实现供应链的协调。     

基于线上评论的生鲜产品供应链定价策略

随着网络购物的普及,线上评论对消费者的购买决策发挥着越来越重要的作用,零售商和制造商可以利用这些评论调整、优化生产流程。本文基于消费者效用理论,构建了由一个零售商和一个制造商组成的生鲜产品供应链定价决策模型,研究了三种决策模式下生鲜产品零售价、利润和保鲜努力水平的差异。研究发现:集中决策下生鲜产品的最优零售价最低、利润最高;随着运输时间增加,保鲜努力水平和新鲜度均呈现下降趋势;当成本分担系数较高时,在成本分担和收益共享的分散决策模式下,保鲜努力最优水平高于集中决策模式下保鲜努力最优水平。     

机场旅客人身检查双设备系统的安检成本研究

为了节约机场旅客人身安检成本,研究基于通过式金属门和毫米波人体成像设备的双设备系统,在确保系统安全性的前提下,对安检成本进行优化。人身安检设备在检查旅客时会产生错误报警和错误放行两类错误,通过正态分布模拟安检设备的响应,利用设备报警阈值控制两类错误发生的概率。所有旅客经过一阶段通过式金属门检查后,然后根据通过式金属门的报警情况确定是否进行二阶段毫米波人体成像设备检查,组合双设备的报警情况确定系统报警和系统放行。在两类错误可接受范围内分析两种安检规则的安全性,确定严格和普通安检通道最佳的安检规则。针对两种安检规则,以系统两类错误为限制条件,分别建立安检成本的非线性规划模型,最后利用蒙特卡罗模拟法求解。结果表明：安检规则1适合普通安检通道,安检规则2适合严格安检通道;两种规则的最低安检成本相近,安检规则1的人均安检成本低于安检规则2。     

“产品包邮”策略下电商供应链的决策研究

在"产品包邮"策略下,考虑电商平台服务水平以及物流成本的影响,构建了分散决策和联合决策的电商供应链运作模型,研究了最优决策并设计了"佣金联合物流价格"协调机制,最后采用数值算例证明了结论.研究表明:1)分散决策下,销售价格随佣金和物流成本的增加而增加;服务水平随佣金的增加而提升,但与物流成本的变化无关;物流费用随佣金的增加而减少,随物流成本的增加而增加;制造商以及物流运营商的利润随佣金和物流成本的增加而减少;电商平台的利润随佣金的增加而增加,随物流成本的增加而减少.2)联合决策下,销售价格和服务水平与佣金的变化无关;但是销售价格随物流成本的增加而增加;服务水平随物流成本的增加而下降.3)联合决策是系统最优的一种运行模式,与分散模式相比,产品销售价格较低,电商平台的服务水平较高,电商供应链系统的总利润较高.借助设计的"佣金联合物流价格"协调机制可以实现这种模式.     

基于贝叶斯视角的地铁安检效果评估

综合地铁安检的技术可靠性、乘客违禁品携带比例等因素,界定了乘客通过安检时可能出现的4种场景,并由贝叶斯理论分析地铁安检的后验准确率.结果表明,由于地铁安检的特殊性,通常情况下后验准确率较低;即使可靠性可保持较高水平,但由于携带违禁品是小概率事件,后验准确性依然不会有显著改善;提示有违禁品携带情况多数是由于误判所造成的.安检等待时间的蒙特卡洛模拟结果进一步表明,由于误判所造成的无效检查所耗费的时间占比较高,可靠性的提高并不能改善这种情况,在人流高峰时段有可能对通行效率产生严重影响.因此,对地铁安检模式的改进,不能仅依赖于技术的升级,优化人机协同才是关键.     

客源充足情境下的customer-intensive服务策略研究

在customer-intensive服务中服务速度越慢,顾客的效用就越高,然而等待时间也随之变长;而服务商则需对服务速度和价格进行决策,以求获得最优收益。本文基于客源丰富的服务垄断商对此问题采用M/M/1排队模型进行了研究,将顾客成本细分为时间成本和焦虑成本,给出了最优服务速度和价格。研究发现,单位焦虑成本的增加造成了服务商收益的减少,但对收益的影响要小于单位时间成本。最后,提出了服务商投入一定的服务成本来减少焦虑成本的策略,以达到获取更高收益的目的,并证明了策略的有效性。     

Copula-CVaR下考虑随机成本和需求的单周期订货决策研究

不确定环境下的单周期最优订货量决策具有重要且广泛的应用价值。与传统的仅考虑需求不确定性的报童模型不同,本文考虑市场价格恒定,但成本和需求随机变化且相关联下的报童决策问题。为此,采用Copula函数构建成本和需求之间的关联,考虑决策者可能具有的风险态度,建立了相应的Copula-CVaR模型,证明了模型解的存在性和唯一性,并将模型离散化为易求解的线性规划问题。最后,通过不同的风险水平和多种Copula函数下的仿真,分析了随机成本与需求的相关性和波动性对最优决策结果影响,并得到相关结论,为相关企业决策提供依据。     

Virtual queuing at airport security lanes

Airports continuously seek opportunities to reduce the security costs without negatively affecting passenger satisfaction. In this paper, we investigate the possibilities of implementing virtual queuing at airport security lanes, by offering some passengers a time window during which they can arrive to enter a priority queue. This process could result in a smoother distribution of arriving passengers, such that the required security personnel (costs) can be decreased. While this concept has received attention in a number of settings, such as theme parks, virtual queuing at airports bears an additional level of complexity related to the flight schedules, i.e., passengers can only be transferred forward in time to a limited extent, which we denote by the transfer time limit. We conducted a major simulation study in collaboration with a large international airport in Western Europe to determine the potential impact of virtual queuing and find that nearly one million Euro can be saved on security personnel cost without negatively impacting the passenger waiting time.     

考虑云安全风险的个人云存储服务最优定价策略

针对现有个人云存储服务纷纷关闭的现象,如何根据不同市场时期和云用户特征,制定合理的定价策略已成为个人云存储服务商面临的挑战性问题。本文在考虑云安全风险,云用户感知价值及弹性成本对个人云存储服务定价的影响,建立了基于云安全风险的两阶段定价模型,给出了免费试用时长确定下的最优决策及免费试用时长不确定下的最优免费试用时长及最优价格。借助数值分析,进一步研究了云安全风险系数,云用户感知价值,云安全运营成本系数对最优免费时长,最优利润的影响,结果表明,当云安全风险系数适中时,个人云存储供应商(PCSP)采取两阶段定价策略。另外,最优利润随着云安全风险系数,免费试用时长,单位安全运营成本的增加先增加后减少。     

Passenger grouping with risk levels in an airport security system

This is a follow-up to the recent paper by Lazar Babu et al. [V.L. Lazar Babu, R. Batta, L. Lin, Passenger grouping under constant threat probability in an airport security system, European Journal of Operational Research 168 (2006) 633–644] which investigated the benefit of classifying passengers into different groups, with the idea that the number of checks and the degree of inspection may vary for different groups. A basic assumption in that paper was that the threat probability is constant across all passengers. In this paper, we relax this assumption and consider the case where passenger risk levels are incorporated. We assume that passengers are classified into several risk classes via some passenger prescreening system, for example, Computer-Assisted Passenger Prescreening System II (CAPPS II). We consider the separate grouping of every class of passengers such that the overall false alarm probability is minimized while maintaining the overall false clear probability within specifications set by a security authority. Meanwhile, we consider the staffing needs at each check station. The problem is formulated as a mixed integer linear program. An illustrative example of the model is presented with comparisons to the model in Lazar Babu et al. (2006) using two performance measures: probability of false alarm and total number of screeners needed. Our conclusion is that incorporation of risk levels through passenger grouping strategies leads to a more efficient security check system.     

The shuttle dispatch problem with compound Poisson arrivals: Controls at two terminals

We consider the control of an infinite capacity shuttle which transports passengers between two terminals. The passengers arrive at each terminal according to a compound Poisson process and the travel time from one terminal to the other is a random variable following an arbitrary distribution. The following control limit policy is considered: dispatch the shuttle at terminali, at the instant that the total number of passengers waiting at terminali reaches or exceeds a predetermined control limitm _i . The objective of this paper is to obtain the mean waiting time of an arbitrary passenger at each terminal for given control valuesm ₁ andm ₂. We also discuss a search procedure to obtain the optimal control values which minimize the total expected cost per unit time under a linear cost structure.     

Optimising Waiting at Nodes in Time-Dependent Networks: Cost Functions and Applications

In this paper, the relationship between waiting at nodes and the path cost in a transport network is analysed. An exact solution algorithm for generating the shortest path with optimal waiting at the nodes is proposed. The general case is examined, considering a time-dependent network (time influences the cost). To develop a full application, the algorithm is applied in the case of a vehicle routing problem on a real network.     

Passenger flow control strategies for urban rail transit networks

Urban rail traffic congestion is becoming increasingly serious due to the large traffic demands in modern cities. In order to ensure the safety and quality of station services in peak hours, it's necessary to adopt some reasonable and effective passenger flow control strategies. In this study, through considering the time-dependent passenger demands, a passenger flow control model based on the network-level system is explicitly developed. The passenger successive motion process is discretized by the modeling method. Systematically considering the coordinated relationship between traffic demands and strict capacity constraints (including station passing capacity, platform load capacity and train transport capacity), we establish a mixed integer linear programming model to minimize the total passenger waiting time (including passengers outside stations and on the platforms). The optimization software Cplex is adopted to solve the developed model, and a real network of Beijing urban railway is calibrated to verify the effectiveness of the suggested model. As a result, the proposed flow control strategies can provide detailed information about control stations, control durations and control intensities, and can effectively reduce the total waiting time and relieve the number of stranded passengers in the urban rail transit network.     

网络安全漏洞信息披露中多元参与主体行为策略演化博弈分析

全球网络威胁日趋严峻,作为网络安全事件产生的根源之一,网络安全漏洞越来越被重视,对漏洞的披露已是国家网络安全应急体系建设的重要内容之一。本文构建了网络安全漏洞共享平台、软件厂商及黑客之间的三方博弈模型,并从演化博弈角度对模型进行了分析和数值模拟,确立了稳定均衡点存在的条件。研究结果表明:不同参数初始值对三方博弈结果存在显著差异,软件质量越差,平台越倾向于“封闭披露”策略;对漏洞发现者的支付积极影响软件厂商“注册会员”倾向,对黑客的“努力攻击”倾向产生负面影响;随披露成本的上升,平台更倾向于采纳“封闭披露”策略;预期损失过大,软件厂商倾向于“注册会员”策略。     

Social forecasting for company planning: Brian C. TWISS (Ed.) Macmillan,London, 1982, xxv + 310 pages, £25.00

The transportation system considered in this paper has a number of vehicles with no capacity constraint, which take passengers from a source terminal to various destinations and return to the terminal. The trip times are considered to be independent and identically distributed random variables with a common exponential distribution. Passengers arrive at the terminal in accordance with a Poisson process. The system is operated under the following policy: when a vehicle is available and there are at least α passengers waiting for service, then a vehicle is dispatched immediately. The passenger queue length and waiting time distributions are obtained under steady-state conditions. System performance measures such as average passenger queue length and waiting time are then derived. A minimum average cost criterion is then used to determine the optimal fleet size and dispatching policy. This is a generalization of the results of Weiss for a single-vehicle system.     

考虑相互依赖性的信息系统安全投资及协调机制

考虑信息系统安全相互依赖情形下最优化信息系统连续时间安全投资水平是一个值得研究的问题。首先讨论了非合作博弈下信息系统安全投资的最优策略选择,在此基础上讨论了安全投资效率参数、黑客学习能力、传染风险对信息系统脆弱性及信息系统安全投资率的影响。其次,在推导出两企业在合作博弈情形下最优策略选择的基础上,对比两种情形下的博弈均衡结果,得出合作博弈下的投资水平高于非合作博弈下的投资水平。原因是两个企业的相互依赖关系隐含着企业投资的负外部性,从而导致企业投资不足。最后,构建一种双边支付激励机制消除企业投资不足问题,从而使企业达到合作博弈下的最优投资水平,提高两个企业的收益。