面向自组织平衡的共享电动汽车调度优化方法

针对共享电动汽车运营中出现的站点车辆供需不平衡及人工调度成本过高等问题，提出面向自组织平衡的共享电动汽车调度优化方法.利用共享电动汽车站点选择行为数据，构建用户取车站点选择MNL(Multinominal Logit)模型，分析用户的站点选择行为；构建面向各站点车辆供需自组织平衡的站点间车辆调度优化方法，即通过车辆动态折扣策略引导用户改变默认的最近取还车站点，在运营结束后以运营企业的调度总成本最小为目标，建立人工调度优化模型并应用禁忌搜索算法求解；最后，选取北京市海淀区部分共享电动汽车站点进行算例分析.结果表明：本文提出的优化方法与无动态折扣策略相比，调度总成本降低了 4.5%，人工调度成本降低了21.1%，人工调度任务数减少了8.3%.     

The impact of advance purchase deadlines on airline consumers’ search and purchase behaviors

Airlines frequently use advance purchase ticket deadlines to segment consumers. Few empirical studies have investigated how individuals respond to advance purchase deadlines and price uncertainties induced by these deadlines. We model the number of searches (and purchases) for specific search and departure dates using an instrumental variable approach that corrects for price endogeneity. Results show that search and purchase behaviors vary by search day of week, days from departure, lowest offered fares, variation in lowest offered fares across competitors, and market distance. After controlling for the presence of web bots, we find that the number of consumer searches increases just prior to an advance purchase deadline. This increase can be explained by consumers switching their desired departure dates by one or two days to avoid higher fares that occur immediately after an advance purchase deadline has passed. This reallocation of demand has significant practical implications for the airline industry because the majority of revenue management and scheduling decision support systems currently do not incorporate these behaviors.     

Global optimization method for network design problem with stochastic user equilibrium

In this paper, we consider the continuous road network design problem with stochastic user equilibrium constraint that aims to optimize the network performance via road capacity expansion. The network flow pattern is subject to stochastic user equilibrium, specifically, the logit route choice model. The resulting formulation, a nonlinear nonconvex programming problem, is firstly transformed into a nonlinear program with only logarithmic functions as nonlinear terms, for which a tight linear programming relaxation is derived by using an outer-approximation technique. The linear programming relaxation is then embedded within a global optimization solution algorithm based on range reduction technique, and the proposed approach is proved to converge to a global optimum.     

Stochastic capacity expansion models for airport facilities

It is important and also challenging to plan airport facilities to meet future traffic needs in a rapidly changing environment, which is characterized by various uncertainties. One key issue in airport facility development is that facility performance functions (delay levels as functions of capacity utilization rates) are nonlinear, which complicates the solution method design. Potential demand fluctuations in a deregulated aviation market add another dimension to the decision making process. To solve this problem, a deterministic total cost minimization model is proposed and then extended into stochastic programs, by including uncertainties in traffic forecasts. After the exploration of properties of the delay cost function, an Outer-Approximation (OA) technique which is superior to the existing discrete approximation is designed. After model enhancements, an efficient solution framework based on the OA technique is used to solve the model to its global optimality by interactively generating upper and lower bounds to the objective. Computational tests demonstrate the validity of developed models and efficiency of proposed algorithms. The total cost is reduced by 18.8% with the stochastic program in the numerical example.     

Robust calibration of macroscopic traffic simulation models using stochastic collocation

The predictions of a well-calibrated traffic simulation model are much more valid if made for various conditions. Variation in traffic can arise due to many factors such as time of day, work zones and weather. Calibration of traffic simulation models for traffic conditions requires larger datasets to capture the stochasticity in traffic conditions. In this study we use datasets spanning large time periods to incorporate variability in traffic flow, speed for various time periods. However, large data poses a challenge in terms of computational effort. With the increase in number of stochastic factors, the numerical methods suffer from the curse of dimensionality. In this study, we propose a novel methodology to address the computational complexity due to the need for the calibration of simulation models under highly stochastic traffic conditions. This methodology is based on sparse grid stochastic collocation, which, treats each stochastic factor as a different dimension and uses a limited number of points where simulation and calibration are performed. A computationally efficient interpolant is constructed to generate the full distribution of the simulated flow output. We use real-world examples to calibrate for different times of day and conditions and show that this methodology is much more efficient that the traditional Monte Carlo-type sampling. We validate the model using a hold out dataset and also show the drawback of using limited data for the calibration of a macroscopic simulation model. We also discuss the drawbacks of the predictive ability of a single calibrated model for all the conditions.     

高校网站的优化与推广

随着网络技术的快速发展,网站成为获取、发布和传递信息的重要渠道。以高校网站为例,分析网站优化的解决方法,并研究网站推广方法,从而提升网站的访问量、扩大网站的宣传范围。     

Price of anarchy for non-atomic congestion games with stochastic demands

We generalize the notions of user equilibrium, system optimum and price of anarchy to non-atomic congestion games with stochastic demands. In this generalized model, we extend the two bounding methods from Roughgarden and Tardos (2004) and Correa et al. (2008) to bound the price of anarchy, and compare the upper bounds we have obtained. Our results show that the price of anarchy depends not only on the class of cost functions but also demand distributions and, to some extent, the network topology. The upper bounds are tight in some special cases, including the case of deterministic demands.     

海洋救助拖船救助功能与配置研究

海洋救助拖船是对海上遇险人员和船舶实施有效救助的专用船舶.为对接我国海洋战略发展需求,要适应在深远海大风浪恶劣海况条件下对海上遇险人员和船舶的有效救助.针对海洋救助拖船适应深远海救助需求的基本功能设置,就船舶救助和人命救生的拖曳救助作业、对外消防灭火、海面人命救生、海面搜救、获救人员救治及保障等主要设备及设施配置作技术探讨.     

Sequencing mixed-model flexible assembly lines with variable launching intervals

To solve the sequencing problem in mixed-model flexible assembly lines (MMFALs) with variable launching intervals, a mathematical model aiming to minimize the cost of utility and idle times is developed. To obtain high-quality sequences, an advanced scatter search (ASS) algorithm is proposed. A heuristic approach, i.e. launching intervals between products algorithm (LIBPA), is incorporated into the ASS algorithm to solve the launching interval problem for each sequence. Numerical experiments with different scales are conducted to compare the performance of ASS with genetic algorithm (GA). In addition, we compare the cost of variable launching intervals approach with fixed launching intervals approach. The results indicate that the ASS is efficient and effective, and considering variable launching intervals in mixed-model assembly lines (MMALs) sequencing problem can improve the performance of the line.     

汽车实训基地教学模式的改革与实践

文中根据职业教育的特点,探索和建设符合我国实际的汽车运用技术专业职业教育标准,利用汽车实训基地进行教学模式改革,不断提高高职教学质量,满足社会对职业人才培养为主要目的的教学模式的要求。