共查询到18条相似文献,搜索用时 187 毫秒
1.
2.
基于实时信息的游客行程动态规划问题可适用于城市景点的游客行程规划、主题公园的游客行程规划、博物馆的游客游览路线规划等服务系统的实际场景。本文采用重规划方法将该问题转化为离散时间段上的静态规划子问题,建立了对应的混合线性整数规划模型,并证明了该问题的NP难性质。提出了一种分支定界算法来求解静态子问题的优化模型,并设计了一种变邻域搜索算法来求解对应的大规模问题。通过数值实验验证了所提的模型和算法,并进行了算法参数标定和算法比较分析。数值实验的结果表明,所提分支定界算法和变邻域搜索算法的计算性能都明显优于已有文献的算法。所提的模型和算法可以嵌入到管理信息系统中,对于提升服务系统的工作效率、降低顾客的等待时间、优化服务系统的资源配置等具有实际意义。 相似文献
3.
4.
5.
论文在产业动态理论的两大研究框架产业动态的动力源和产业演化动态内对产业动态理论的最新研究成果进行梳理,并着重对创新和产业动态的数量研究、产业动态的马尔可夫完美模型及产业生命周期和产业演化模型等几个前沿领域所取得的最新进展与所面临的主要挑战进行总结和评述。 相似文献
6.
提出一种逆向物流网络的多期动态选址方法.不同于静态的、单期模型,考虑需求变化的不同时期下,计算机相关产品逆向物流网络的多层设施定位方法.基于遗传算法,采用二进制十进制混合编码的染色体来表示回收点、回收点的回收期及回收中心相关的决策变量;设计顾客对回收点、回收点对回收中心的两个子分配算法来保证所有约束的满足性,并进行拟合度函数的评价;提出的特定遗传进化操作使得模型求解方向趋于回收点、回收中心和生产点相结合的最佳逆向物流网络;最后的仿真实例说明了所提方法的有效性. 相似文献
7.
本文首先建立了动态用户最优配流问题的变分不等式模型,并对此模型用投影算法来求解.本文中的模型满足Wordrop第一原理要求,所给算法在每一个小时段都能给出路段流入率、流出率及路段流量,从而为行人出行提供可靠的、实时的信息,所给数值实验也说明该模型和算法是可行且有效的. 相似文献
8.
9.
10.
由于数据变化规律的多样性,中期电力负荷的波动有着不同于短期、长期负荷的特点。基于电力系统复杂性的研究视角,重点讨论了中期负荷预测过程中模型的不确定性、参数的时变特性以及负荷波动的周期性规律。根据中期负荷的数据特性,建立了基于非参数修匀的半参数模型,定义了函数区间的划分粒度以及模型权重的求解方法,提出了基于可变区间权重的动态预测方法,给出了基于经验模态分解和波动能量分析的噪声序列提取、检验方法。试验研究结果表明,气候因素对用电消耗的影响最大,经济因素次之;从选取的指标来看,不同时期的影响因素对于模型的解释能力是时变的;所提方法能够对电力负荷进行精确的多粒度、多维度分析,进而掌握其局部变化规律,可有效用于电力系统中期负荷预测。 相似文献
11.
客户终生价值(Customer Lifetime Value,CLV)是客户关系管理的重要内容。近年来,大量的学者结合不同的管理情境,探讨了诸多影响因素,试图推动动态CLV的建模工作。但是,这些工作均是零散、独立进行的,缺乏总结和整理,因而对动态CLV建模研究的推动比较有限。本文通过对41篇文献的精读,萃取出CLV的动态影响因素,概括为四类,即客户自身的、企业相关的、关系相关的和社会环境的四类动态影响因素。企业需要适应社会环境的影响,根据客户自身的影响因素进行合理的客户细分,从企业相关的影响因素提升着手,改善客户关系,最终获得客户的终生价值。 相似文献
12.
评价电信企业客户满意度动态变化的Malmquist指数 总被引:1,自引:0,他引:1
介绍了基于DEA模型的M alm qu ist指数,并在此基础上提出了一种评价电信企业客户满意度动态变化的M alm qu ist指数评价法。运用M alm qu ist指数从纯技术效率、技术变化和主因素生产率等方面,对A省移动通信公司的17个分公司客户满意度的动态变化进行了有效性评价,并指出该公司今后应该通过技术创新和提高技术效率来改善客户满意度。 相似文献
13.
Sumit Kunnumkal 《Production and Operations Management》2014,23(9):1617-1633
In this study, we present new approximation methods for the network revenue management problem with customer choice behavior. Our methods are sampling‐based and so can handle fairly general customer choice models. The starting point for our methods is a dynamic program that allows randomization. An attractive feature of this dynamic program is that the size of its action space is linear in the number of itineraries, as opposed to exponential. It turns out that this dynamic program has a structure that is similar to the dynamic program for the network revenue management problem under the so called independent demand setting. Our approximation methods exploit this similarity and build on ideas developed for the independent demand setting. We present two approximation methods. The first one is based on relaxing the flight leg capacity constraints using Lagrange multipliers, whereas the second method involves solving a perfect hindsight relaxation problem. We show that both methods yield upper bounds on the optimal expected total revenue. Computational experiments demonstrate the tractability of our methods and indicate that they can generate tighter upper bounds and higher expected revenues when compared with the standard deterministic linear program that appears in the literature. 相似文献
14.
15.
顾客忠诚的驱动因素等静态分析已非常丰富,但尚缺乏顾客忠诚度形成过程的动态研究。本文以二次网络购物作为研究背景,通过前后两次配对取样,探讨顾客忠诚度的形成机制。第一次取样获得493份有效问卷,三个月后再次取样,获得有效配对数据383对。研究结果发现,单次顾客满意度与单次顾客忠诚度的关系与以往研究的结论一致,具有正向显著影响;在时间动态效应下,再购顾客满意度对顾客忠诚的形成具有完全中介作用;更重要的结论是,基于二次购物的体验,顾客满意度对顾客忠诚的形成具有递推式影响,并可追溯到第一次购物体验的满意度,以此为基础构建顾客忠诚的形成机制模型。 相似文献
16.
We introduce a dynamic pricing model for a monopolistic company selling a perishable product to a finite population of strategic consumers (customers who are aware that pricing is dynamic and may time their purchases strategically). This problem is modeled as a stochastic dynamic game in which the company's objective is to maximize total expected revenues, and each customer maximizes the expected present value of utility. We prove the existence of a unique subgame‐perfect equilibrium pricing policy, provide equilibrium optimality conditions for both customer and seller, and prove monotonicity results for special cases. We demonstrate through numerical examples that a company that ignores strategic consumer behavior may receive much lower total revenues than one that uses the strategic equilibrium pricing policy. We also show that, when the initial capacity is a decision variable, it can be used together with the appropriate pricing policy to effectively reduce the impact of strategic consumer behavior. The proposed model is computationally tractable for problems of realistic size. 相似文献
17.
In this paper, we propose a new dynamic programming decomposition method for the network revenue management problem with customer choice behavior. The fundamental idea behind our dynamic programming decomposition method is to allocate the revenue associated with an itinerary among the different flight legs and to solve a single‐leg revenue management problem for each flight leg in the airline network. The novel aspect of our approach is that it chooses the revenue allocations by solving an auxiliary optimization problem that takes the probabilistic nature of the customer choices into consideration. We compare our approach with two standard benchmark methods. The first benchmark method uses a deterministic linear programming formulation. The second benchmark method is a dynamic programming decomposition idea that is similar to our approach, but it chooses the revenue allocations in an ad hoc manner. We establish that our approach provides an upper bound on the optimal total expected revenue, and this upper bound is tighter than the ones obtained by the two benchmark methods. Computational experiments indicate that our approach provides significant improvements over the performances of the benchmark methods. 相似文献