竞争市场下考虑再制造产品售后服务的供应链运营策略

在同时生产新产品和再制造产品的原始制造企业(企业1)与生产具有替代性产品的企业(企业2)构成竞争关系下的供应链系统中,探讨供应链在不同售后服务策略下供应链的运营策略,分析在竞争市场下供应链定价策略和再制造产品的售后服务对定价策略及供应链中各企业利润的影响。揭示再制造产品售后服务对定价策略和供应链各企业最优利润的影响。得到如下主要研究结论:(1)当制造企业为再制造产品提供售后服务时,再制造产品销售量增加,新产品和竞争替代产品销售量降低;有趣的是新产品和再制造产品的市场零售价格同时增加,竞争替代产品的市场零售价格降低。(2)制造企业为再制造产品提供售后服务时的利润总是大于没有售后服务时的利润,且不受单位产品生产成本影响。同时当单位产品生产成本较高时,制造企业为再制造产品提供售后服务策略会带来竞争对手企业利润增加。这些结论对具有再制造产品供应链如何提供再制造产品售后服务具有一定指导作用和管理启示。     

带时间窗的三维装载物流配送优化方法研究

针对城市物流配送优化研究在客户服务时间窗和货物装载方式合理结合方面存在的不足,考虑物流配送车厢货物装载方式与客户访问序列相关的特征对车厢空间进行合理的区域划分。首先,构建了包含配送中心的固定成本、配送车辆的运输成本、维修成本、租赁成本和违反时间窗惩罚成本的物流运营成本最小化和配送车辆空间利用率最大化的双目标优化模型;然后,提出一种结合遗传算法(GA)全局搜索能力和禁忌搜索算法(TS)局部搜索能力的GA-TS混合算法求解模型;最后,结合重庆市某配送中心的三维装载物流配送实例数据进行了优化计算,实验结果给出了带时间窗的三维装载物流配送路径优化方案,并进行了不同车厢空间分区模式下平均装载率、物流运营成本和车辆使用数的比较分析。研究表明,当客户需求货物种类数与车辆的空间区域划分数相等且按货物类型进行区域划分时,物流运营成本最小,配送车辆使用数最少和车辆平均装载率最高。     

Injection attack detection using machine learning for smart IoT applications

Smart cities are a rapidly growing IoT application. These smart cities mainly rely on wireless sensors to connect their different components (smart devices) together. Smart cities rely on the integration of IoT and 5G technologies, and this has created a demand for a massive IoT network of connected devices. The data traffic coming from indoor wireless networks (e.g., smart homes, smart hospitals, smart factories , or smart school buildings) contributes to over 80% of the total data traffic of the current IoT network. As smart cities and their applications grow, security and privacy challenges have become a major concern for billions of IoT smart devices. One reason for this could be the oversight of handling security issues of IoT devices by their manufacturers, which enables attackers to exploit the vulnerabilities in these devices by performing different types of attacks, e.g., DDoS and injection attacks. Intrusion detection is one way to detect and mitigate the risk of such attacks. In this paper, an intrusion detection method was proposed to detect injection attacks in IoT applications (e.g. smart cities). In this method, two types of feature selection techniques (constant removal and recursive feature elimination) were used and tested by a number of machine learning classifiers (i.e., SVM, Random Forest, and Decision Tree). The T-Test was conducted to evaluate the quality of this proposed feature selection method. Using the public dataset, AWID, the evaluation results showed that the decision tree classifier can be used to detect injection attacks with an accuracy of 99% using only 8 features, which were selected using the proposed feature selection method. Also, the comparison with the most related work showed the advantages of the proposed intrusion detection method.     

绿色产品零售企业与市场消费者策略选择演化分析

线上线下结合营销模式有效缓解了流通渠道不畅和营销方式单一的问题,进而促进绿色产品消费。在相关假设的基础上,通过构建绿色产品零售企业和市场消费者的演化博弈模型,重现博弈主体的动态演进过程。研究结果表明,在线上线下结合营销模式中,绿色产品零售企业与消费者演化博弈系统存在两个可能的均衡状态,分别是O{维持传统营销策略,使用传统渠道购买产品}、C{建立线上营销策略,使用线上渠道购买产品}。演化博弈系统的演进受到9个相关因素的干扰,这些因素通过影响博弈主体的收益、成本及潜在的风险损失等发生作用。在理论推导的基础上,以被调研的A绿色产品零售企业为样本进行数值模拟,验证理论推导的正确性,给出上述影响因素的作用强度。     

Sojourn time analysis for a cyclic-service tandem queueing model with general decrementing service

A sojourn time analysis is provided for a cyclic-service tandem queue with general decrementing service which operates as follows: starting once a service of queue 1 in the first stage, a single server continues serving messages in queue 1 until either queue 1 becomes empty, or the number of messages decreases to k less than that found upon the server's last arrival at queue 1, whichever occurs first, where 1 ≤ k ≤ ∞. After service completion in queue 1, the server switches over to queue 2 in the second stage and serves all messages in queue 2 until it becomes empty. It is assumed that an arrival stream is Poissonian, message service times at each stage are generally distributed and switch-over times are zero. This paper analyzes joint queue-length distributions and message sojourn time distributions.     

An optimal service rate in a Poisson arrival queue with two-stage service policy*

We consider a two-stage service policy for a Poisson arrival queueing system. The idle server starts to work with ordinary service rate when a customer arrives. If the number of customers in the system reaches N, the service rate gets faster and continues until the system becomes empty. Otherwise, the server finishes the busy period with ordinary service rate. After assigning various operating costs to the system, we show that there exists a unique fast service rate minimizing the long-run average cost per unit time.This work was supported by Korea Research Foundation Grant(KRF-2002-070-C00021).     

A Polynomial Time Approximation Scheme for the Grade of Service Steiner Minimum Tree Problem

In this paper, we present the design of a Polynomial Time Approximation Scheme (PTAS) for the Grade of Service Steiner Minimum Tree (GOSST) problem, which is known to be NP-Complete. Previous research has focused on geometric analyses and different approximation algorithms have been designed. We propose a PTAS that provides a polynomial time, near-optimal solution with performance ratio 1+. The GOSST problem has some important applications. In network design, a fundamental issue for the physical construction of a network structure is the interconnection of many communication sites with the best choice of the connecting lines and the best allocation of the transmission capacities over these lines. Good solutions should provide paths with enough communication capacities between any two sites, with the least network construction costs. Also, the GOSST problem has applications in transportation, for road constructions and some potential uses in CAD in terms of interconnecting the elements on a plane to provide enough flux between any two elements.     

An M/G/1 Retrial Queueing System with Two-Phase Service and Preemptive Resume

An M/G/1 retrial queueing system with additional phase of service and possible preemptive resume service discipline is considered. For an arbitrarily distributed retrial time distribution, the necessary and sufficient condition for the system stability is obtained, assuming that only the customer at the head of the orbit has priority access to the server. The steady-state distributions of the server state and the number of customers in the orbit are obtained along with other performance measures. The effects of various parameters on the system performance are analysed numerically. A general decomposition law for this retrial queueing system is established.     

度量射影的连续选择

本文讨论了集值映射的弱连续选择并应用于度量射影．设Y是Banach空间X的子空间且Y是可分的,在相差一个第一纲集的情况下,于弱拓扑下,支撑于Y上的度量射影是下半连续的并有连续选择．     

Steiner选择和算子的集值扩张(Ⅱ)——对逼近理论的应用

在(Ⅰ)的基础上,得出对集值函数逼近理论的某些应用:Korovkin型定理,一种将经典逼近算子扩张到集值族的方法,以及Jackson估算.