城市非高峰期动态出行交通网络均衡

我国在城市化进程中,许多城市交通部门为了缓解城市交通拥堵问题,制订了大力发展公共交通的政策,而城市公共交通非高峰期的出行人群交通方式选择是一个值得讨论的问题.在此基础上通过分析几种不同的交通出行方式的分路段成本,建立了具有非高峰期特点的多方式出行路网模型,并对模型进行了计算求解,依据结果对非高峰期公共交通出行的特点进行了讨论.     

基于部件指派的多状态系统可靠度优化研究

针对一般二态系统假设的不足,提出了多状态系统条件下的可靠度优化指派问题。该问题以系统可靠度最大化为优化目标,在考虑部件分配成本和总分派成本预算的前提下,对多状态系统下不同状态对应的性能水平的进行了分析,给出了基于通用生成函数的多状态系统的可靠度评估方法。根据指派问题的组合优化的特性和多状态系统可靠性评估的特点,对传统遗传算法的适应度函数进行了改进,设计了基于整数编码的遗传算法,该算法具有离散变量的设计灵活性和强大的搜索性能。算例实验表明,本文设计的优化算法具有较好的求解质量,同时算法的运行时间也得到了大幅的缩短。本研究为多状态系统的可靠度优化提供了一条可借鉴的思路。     

基于RBF神经网络模型的结构可靠度优化方法

在结构构件尺寸、材料属性以及外部载荷等不确定性因素影响下,基于可靠度的优化给出了兼顾结构的成本和安全性能的安全设计方案.由于传统的可靠度优化方法采用嵌套的双层优化列式求解,因此导致计算量过大.为了克服这个问题,学者们相继提出了解耦方法和单循环方法等方法.该文采用RBF神经网络模型用于可靠度优化问题的求解中,通过拉丁超立方方法构造代理模型,并用误差指标来验证代理模型的精确程度,同时自适应更新代理模型直至满足需求.通过与现有可靠度优化4种主流算法的比较,说明了该文提出算法的高效性和稳健性.     

基于综合可靠度的网络单元重要度研究

在基于最可靠路的网络单元重要度研究基础上,提出了综合可靠度概念,并研究了基于综合可靠度的网络单元重要度问题,给出了综合可靠度及基于综合可靠度的网络单元重要度问题的计算算法,并做了示例分析.     

基于排队论的专项汽修厂维修台配置数量研究

为了解决因维修台配置不合理而导致的专项汽修厂排队等待的问题,运用排队论等理论和方法,采用先到先修理与维修台带有优先权相结合的排队规则,将维修台配置数量问题转化为两类型服务台排队问题,建立了单队列M/M/s1+s2/K/∞/FCFS+PS排队模型.通过对某专项汽修厂相关的数据采集和分析,得到了模型所需的变量和参数,运用边际效益法进行优化,得到了节假日和非节假日客流高峰期的最优维修台配置数量.通过对系统服务强度、系统资源限制和服务时间段等因素的分析,既能保证排队系统可以在不同时间段内对维修台配置数量进行调整,又能缩小最优值的求解范围.     

应力为复合x~2-更新过程时结构可靠度的一致估计

本文讨论强度为随机变量X,应力为复合x2-更新过程Y（t）的半随机过程可靠性模型的结构可靠度一致估计问题．获得在设计基准期[0,T]内结构可靠度表达式和结构可靠度的一致估计．     

应力S(t)为复合χ^2更新过程时结构可靠度渐近正态估计

该文讨论强度为随机变量X,应力为复合χ２ 更新过程｛Y（t）,t∈ ［０,T］｝时结构可靠度的渐近正态性问题．获得在设计基准期［０,T］内结构可靠度表达式和结构可靠度渐近正态估计．     

应力S(t)为复合x~2-更新过程时结构可靠度渐近正态估计

该文讨论强度为随机变量Ｘ　应力为复合ｘ２－更新过程｛Ｙ（ｔ）,ｔ ∈［０,Ｔ］｝时结构可靠度的 渐近正态性问题．获得在设计基准期［０,Ｔ］ 内结构可靠度表达式和结构可靠度渐近正态估计．     

应力为复合χ^2—更新过程时结构可靠度的一致估计

本文讨论强度为随机变量Ｘ,应力为复合χ＾２－更新过程Ｙ（ｔ）的半随机过程可靠性模型的结构可靠度一致估计问题。获得在设计基准期［０,Ｔ］内结构可靠度表达式和结构可靠度的一致估计。     

带覆盖需求约束的设施选址问题

带覆盖需求约束的设施选址问题(FLPWCDL)研究:客户必须在规定的响应半径内被服务,并要求服务站能够覆盖规定的需求数量,如何选择合适的服务站,使总成本(建站成本+路线成本)最小.FLPWCDL广泛应用于应急服务、物流、便利店等服务站的选址.建立了问题的混合整数规划模型,并构造了求解FLPWCDL的Benders分解算法,计算实验显示Benders分解算法具有非常高的求解效率与求解质量.     

Evaluation and optimization of urban public transportation networks

So far, not much attention has been given to the problem of improving public transportation networks. In many cities these networks have been built sequentially and do not fit to the needs of the users any more. The results are long travel times and an unnecessarily high number of people who have to transfer. Compared to other investments for improving the service level of public transportation systems, the costs of rerouting the public vehicles are low and can, yet, highly improve the performance of the system.To evaluate a public transportation network, the shortest distance and the shortest route from node x to node y, taking the waiting times for a vehicle into account, must be known.It is shown in this paper, how to compute distances and routes efficiently for large networks. Using this algorithm it is described how to evaluate the average transportation cost of the passengers in a public transportation network.In the second part of the paper a heuristic algorithm is stated that improves a public transportation network using the average transportation cost as the objective.Finally, some experiences with real world problems are reported.     

固定经营期下基于运行绩效的PPP项目服务价格形成机制研究

本文研究PPP项目价格形成机制、补偿机制及其社会效率。首先,分析了招投标制度下固定经营期PPP项目服务价格形成机制及其不足。其次,基于成本与运行绩效的PPP项目定价规制及可行性缺口补贴思想,建立模型分析实施机构可观察PPP项目服务成本时的定价水平和可行性缺口补贴标准;当实施机构无法准确掌握项目公司的运行成本时,通过制度设计诱导社会投资者上报真实的运行成本和运行绩效以获得最大净现值。分析表明,当PPP项目服务需求弹性较大同时有可行性缺口补贴政策时,政府进行价格规制时项目净现值高于不规制时的净现值。文章通过实例验证了成本信息是否可观察两种情形下PPP项目的服务价格水平、运行绩效、项目投资净现值及消费者剩余。为了避免PPP项目运行绩效下降和社会福利损失,政府应建立科学的监督激励机制,依据PPP项目服务成本与运行绩效的信息确定固定特许经营期下项目服务价格和可行性缺口补贴额度。     

Reliability based assignment in stochastic-flow freight network

Based on the reliability of transportation time, a transportation assignment model of stochastic-flow freight network is designed in this paper. This transportation assignment model is built by mean of stochastic chance-constraint programming and solved with a hybrid intelligent algorithm (HIA) which integrates genetic algorithm (GA), stochastic simulation (SS) and neural network (NN). GA is employed to report the optimal solution as well as the optimal objective function values of the proposed model. SS is used to simulate the value of uncertain system reliability function. The uncertain function approximated via NN is embedded into GA to check the feasibility and to compute the fitness of the chromosomes. These conclusions have been drawn after a test of numerical case using the proposed formulations. System reliability, total system cost and flow on each path would finally reach at their own convergence points. Increase of the system reliability causes increase of the total time cost. The system reliability and the total time cost converge at a possible Nash Equilibrium point.     

基于货物分类配送的电动汽车路径优化与换电策略研究

电动汽车参与的物流配送服务需要统筹协调车辆路径、配送对象与换电策略。本文提出了考虑货物分类需求的电动汽车路径优化与换电策略问题,并建立了该问题的整数规划数学模型。其次,提出了基于禁忌搜索-改进节约算法的两阶段混合启发式算法MCWTS和一种四阶段启发式算法IGALNS。通过多组小规模算例验证了算法的有效性。随后,分别从运营成本、路径距离、换电策略以及混合运输线路等方面比较并分析了货物分类对运营策略的影响。实验结果表明,该模型可以在配送距离略有增加的情况下避免将不适宜混合运输的货物指派给同一车辆,达到降低货物运输损失提高顾客满意度的目的。最后,通过多组较大规模算例对两种启发式算法的有效性进行了比较。     

考虑乘客取消订单的网约车平台定价策略

针对乘运市场供需不匹配的情况,考虑乘客在网约车平台预约订单后的取消行为,以平台利润最大化为目标,首先建立乘客选择模型计算乘客取消订单概率,再分别构建市场供过于求和供不应求状态下的利润模型,求解平台最优定价。研究表明:制定适当的违约规则可以有效减少乘客取消订单的概率,提高平台利润;最优定价随着服务质量的提高而增加,在打车非高峰期,平台可以通过提高服务质量来增加平台利润;非高峰期平台最优定价随着出租车费用的增加而减少,而高峰期定价策略受出租车费用影响较小。     

The impact of fleet size on performance-based incentive management

Performance-based contracting (PBC) is envisioned to lower the asset ownership cost while ensuring desired system performance. System availability, widely used as a performance metric in such contracts, is affected by multiple factors such as equipment reliability, spares stock, fleet size, and service capacity. Prior studies have either focussed on ensuring parts availability or advocating the reliability allocation during design. This paper investigates a single echelon repairable inventory model in PBC. We focus on reliability improvement and its interaction with decisions affecting service time, taking into account the operating fleet size. The study shows that component reliability in a repairable inventory system is a function of the operating fleet size and service rate. A principal-agent model is further developed to evaluate the impact of the fleet size on the incentive mechanism design. The numerical study confirms that the fleet size plays a critical role in determining the penalty and cost sharing rates when the number of backorders is used as the negative incentive scheme.     

Revisiting the model of servicing machines with repairable service facility-a new analyzing idea and some new results

In this paper the model of servicing machines with repairable facility is further studied.By standard conditioning decomposition argument,two reliability indices-the probability that the service facility fails at time t and the expected number of failure occurring during（0,t] are discussed.Some important relations of them are given.Furthermore,some new reliability problems are presented and discussed as follows：1） The numbers of the service facility failures during the generalized service time and the generalized busy period;2） The asymptotic expansion of the expected failure number of the service facility during（0,t].A series of new reliability results of the service facility are obtained.     

Efficient algorithms for the 2-Way Multi Modal Shortest Path Problem

We consider the 2-Way Multi Modal Shortest Path Problem (2WMMSPP). Its goal is to find two multi modal paths with total minimal cost, an outgoing path and a return path. The main difficulty lies in the fact that if a private car or bicycle is used during the outgoing path, it has to be picked up during the return path. The shortest return path is typically not equal to the shortest outgoing path as traffic conditions and timetables of public transportation vary throughout the day. In this paper we propose an efficient algorithm based on bi-directional search and provide experimental results on a realistic multi modal transportation network.     

An optimization based approach for deployment of roadway incident response vehicles with reliability constraints

In recent years transportation agencies have introduced patrol based response programs to remove roadway incidents rapidly. With the evolution of technology incident detection and notification from remote traffic operation centers is possible and patrols to detect incidents are not necessary. Instead, the response units can be placed at various depots in urban areas and dispatched to incident sites upon notification. In this paper, we propose a reliability based mixed integer programming model to find best locations of incidence response depots and assign response vehicles to these depots so that incidents can be cleared efficiently at a minimum cost. The approach is unique as it considers fixed and variable costs of vehicles and depots, occurrences of major and minor incidents, and reliability of response service in the same model. Numerical results are generated for an example problem and sensitivity analysis is conducted to explore the relationships between parameters of the problem.     

Synchronization of inventory and transportation under flexible vehicle constraint: A heuristics approach using sliding windows and hierarchical tree structure

This paper investigates the integrated inventory and transportation planning under flexible vehicle constraint. To offer better services at lower prices, more and more companies turn to outsource transportation functions to other professional service providers, namely 3rd party logistics companies. Under these vehicle rental arrangements, the number of vehicles is a decision variable instead of a fixed number, and the transportation cost includes not only the delivery cost but also the cost of vehicle rental that is proportional to the number of vehicles rented in a given planning horizon. In this paper, the problem is formulated as a mixed integer programming problem. A heuristic algorithm is developed, in which sliding windows are applied to approximate the problem by repeatedly solving a series of overlapping short-term subproblems, and a hierarchical tree structure is used to evaluate the closeness of different groups of retailers. Numerical experiments show that a better tradeoff between the inventory cost and transportation cost can be achieved through the proposed heuristic algorithm.