科研事业单位是我国事业单位的重要组成部分,其发展状况对于我国科研事业的发展有着直接影响.随着国家科研体制和财政管理体制的深化改革,财务管理在科研事业单位中的作用日益凸显,建设高效合理的财务管理势在必行.当前,科研事业单位在财务管理实践操作中,也还存在着预算管理、财务核算、经费管理、资产管理、队伍建设等不规范的问题.针对这些不规范问题,要着力从强化预算管理和预算执行监督、改善财务核算方法、完善财务管控制度、规范固定资产管理、提升财务人员素质等方面采取措施,以强化科研事业单位的财务管理.

This paper establishes new convergence results for the power pena-lty method for a mixed complementarity problem(MiCP). The power penalty method approximates the MiCP by a nonlinear equation containing a power penalty term. The main merit of the method is that it has an exponential convergence rate with the penalty parameter when the involved function is continuous and ξ-monotone. Under the same assumptions, we establish a new upper bound for the approximation error of the solution to the nonlinear equation. We also prove that the penalty method can handle general monotone MiCPs. Then the method is used to solve a class of linearly constrained variational inequality(VI). Since the MiCP associated with a linearly constrained VI does not ξ-monotone even if the VI is ξ-monotone, we establish the new convergence result for this MiCP. We use the method to solve the asymmetric traffic assignment problem which can be reformulated as a class of linearly constrained VI. Numerical results are provided to demonstrate the efficiency of the method.

By charging a toll in some roads,traffic congestion pricing transfer the traffic flow from the crowded roads to smooth ones thus to alleviate traffic congestion.Traffic congestion pricing problem is uncertain due to the influence of some factors such as the user'choice of traffic mode,holidays or weather conditions.These uncertain factors affect the traffic network congestion pricing problem;so it is necessary to study the uncertainty of traffic congestion pricing problem.This paper considers the uncertainty of user'traffic cost and O-D demand in traffic congestion pricing problem at the same time,and uses robust optimization method to form the robust traffic congestion pricing model based on scenario.Solving the model with relaxation algorithm,we obtain the robust equilibrium flow.A numerical example shows that the robust equilibrium flow is robust to the disturbance of uncertain factors.

In this paper, we study the problem that adopts power penalty method to solve a variational inequality (Ⅵ) problem with a class of linear constraints. Under certain conditions, by using the KKT condition of the Ⅵ, we transform the Ⅵ problem into an equivalent mixed complementarity problem and a new Ⅵ problem and analyze the existence and uniqueness of the solutions. In addition, we prove the existence of solution of the power penalty equations by degree theory and the uniqueness. At last, we prove the convergence of the power penalty method, in other words, the solution of the power penalty equations converges to the solution of the Ⅵ problem.

在交通路网中,拥挤收费和路网设计是缓解交通拥挤的两种重要手段,前者制约交通需求增长,而后者刺激交通需求增长,将两者并行处理是管理交通需求的有效方法.文章在此基础上设计交通需求管理的双模式模型,该模型同时考虑了离散网络平衡设计与拥挤收费,出行者的路径选择行为采用更加实际的弹性需求Logit随机用户均衡原理并设计改进的费用均值法求解.多时间价值类型将拥挤收费转化为时间单位,使双模式模型转化为具有均衡约束的数学规划问题,随后采用遗传算法求解该模型,并进行相应的数值分析.

This paper studies the integrated models for small and medium-sized enterprises’ distribution and consumers’ trip in an urban network based on the simultaneous equilibrium approach. In this paper, each firm aims at finding some business centers to set up shops to maximize his net profit while each consumer is a traveler who chooses his destination (business center) and travel route according to the minimization of individual net social cost, which is equal to the cost of travel time minus the destination attraction measure. The contribution of this paper can be divided into three parts. Firstly, a new deterministic equilibrium model is developed to capture consumers’ travel choice and firms’ location choice. The relocation cost between any two business centers is explicitly considered. Furthermore, the business center passenger/firm flow capacity constraint is incorporated into the previous model. Mathematically, we prove that this extension will derive the endogenous location transfer market in a business center for firms if the maximum firm flow capacity is reached at equilibrium. Finally, we extend the preceding deterministic models to the stochastic case.

In this paper, we study a class of ξ-monotone variational inequalities. Using the KKT conditions and by transforming the original problem into the NCP, we obtain its parallel algorithm based on the LQP method and improved algorithms, which extend the application range of the LQP method.

利用KKT条件将一类凸约束变分不等式问题转化为线性约束变分不等式问题,在证明了构成函数在特定区域具有单调性的基础上,提出了一种新的基于LQP (logrithmic-quadratic proximal)方法的算法,给出了相应算法的全局收敛性证明和数值实验结果.

为了减轻交通路网拥堵问题,结合现实交通流分配,采用随机用户均衡配流模型,以最小化路网总体出行时间为目标建立了一个拥挤收费的双层模型.对于这种模型,提出了一种新的求解算法,这种算法是将仿射尺度算法与遗传算法相结合.具体地,对给定的收费值,由仿射尺度算法来求解下层随机用户均衡问题得均衡路段流,将其带入上层可求得系统总出行时间.当选取1组初始收费值,可以求得在取各个收费值下的系统总出行时间.这样便可以根据遗传算法来求得最优收费值.数值实验结果表明,在实施收费之后,系统总出行时间得到有效减少,这种模型及算法可以有效地应用于减缓交通路网的拥堵问题.

This working paper is divided into two parts. Firstly, we develop a new combined equilibrium model of business land-use, which puts travelers' traffic equilibrium and business companies' competitive location equilibrium into a unified framework. A variational inequality is presented for the combined equilibrium and the properties of equilibrium solution are investigated. Secondly, the congestion pricing principles associated with the combined equilibrium are studied. From the mathematical point of view, we prove that there exists an optimal road pricing scheme that can minimize the social cost of travelers. This road pricing scheme generalizes the traditional link-based optimal road pricing scheme. Furthermore, when simultaneously imposing charges on travelers and companies is allowed, we prove that there exists an optimal congestion pricing scheme that can derive a combined equilibrium toward an overall system optimum. The economic meaning of every pricing scheme proposed in this paper is discussed in detail. At last, a simple numerical example is used to demonstrate that the optimal congestion pricing scheme may indeed reduce the social cost.

In this study, we present a multi-class time reliability-based user equilibrium model with elastic demand, which is based on a degradable transportation network. Due to the uncertainties in the path travel time induced by random capacity degradation, the model captures the path choice behaviors of travelers in the form of the robust effective path travel time and there is no need for a known travel time probability distribution. By including the heterogeneous degrees of risk aversion among travelers, the equilibrium model can be transformed into an equivalent variational inequality (VI) problem. We also propose a heuristic solution algorithm to solve the VI problem. By taking the VI model as a constraint, a multi-class time reliability based congestion pricing model is formulated as a mathematical programming with equilibrium constraints problem, which can be solved using the sensitivity analysis-based conjugate sub-gradient projection method. Two numerical examples are provided to illustrate the applications of the proposed models and to demonstrate the efficiency of the solution algorithms. (C) 2015 Elsevier Inc. All rights reserved.

As Variational Inequalities(VIs)have a close relationship with complementarity problems,and the well-known logarithmic-quadratic proximal(LQP)method has motivated a number of efficient numerical algorithms for solving nonlinear complementarity problems(NCPs),we try to translate a class of constrained variational inequalities into NCP,and apply some LQP-based method is to solve it.

Bilevel programming techniques deal with decision processes involving two decision makers with a hierarchical structure. In this paper, an augmented Lagrangian multiplier method is proposed to solve nonlinear bilevel programming (NBLP) problems. An NBLP problem is first transformed into a single level problem with complementary constraints by replacing the lower level problem with its Karush-Kuhn-Tucker optimality condition, which is sequentially smoothed by a Chen-Harker-Kanzow-Smale (CHKS) smoothing function. An augmented Lagrangian multiplier method is then applied to solve the smoothed nonlinear program to obtain an approximate optimal solution of the NBLP problem. The asymptotic properties of the augmented Lagrangian multiplier method are analyzed and the condition for solution optimality is derived. Numerical results showing viability of the approach are reported.

In the central business district (CBD) of metropolises, speed limits and movement prohibitions are often imposed on roads and intersections, respectively, for the purpose of safety and congestion mitigation and sometimes also to attempt to cut down vehicular aggregations and emissions. Based on this kind of general transportation network, this paper investigates the optimal time-based toll design problem for a cordon-based congestion pricing scheme in which toll charges are determined according to time consumed by travelers in traversing a predetermined cordon. Under the common hypothesis of travelers following the deterministic user equilibrium principle, this practical time-based toll design problem is formulated as a mathematical programming with equilibrium constraint (MPEC) model and solved by the Hooke-Jeeves algorithm, a derivative-free pattern search method. Taking into account the movement prohibitions at intersections, this paper presents a shortest-path model with movement prohibitions and develops an efficient branch and bound algorithm. Subsequently, the deterministic user equilibrium model can be solved by combining the proposed branch and bound algorithm with the method of successive averages (MSA). Finally, a medium-sized network example is adopted to numerically validate the proposed models and algorithms, and different features and results of four kinds of toll design schemes are further analyzed and discussed.

本文研究了区域信号配时问题.采用遗传算法和非平衡交通分配的拟Frank-Wolfe算法来求解,通过实例对算法进行验证并与已有的算法结果进行了比较,结果表明算法是有效的,适合求解这类问题.

当路网拥挤收费受到公众抵制时,在出行终点通过停车场的停车容量控制来管理交通需求,以满足期望的路段环境容量约束是管理交通拥挤的一个有效方法.文章设计了环境容量约束下停车控制交通需求拥挤管理二层规划模型,上层为总社会福利最大或需求最大,下层是具有需求约束的弹性需求用户均衡模型并采用增广Lagrangian对偶算法求解.针对二层规划模型求解困难,采用主-从种群混合进化的粒子群算法求解,并进行数值分析.

This paper designs and analyzes an alternative tradable travel credit scheme on general transportation network for managing travelers’ route choice behaviors. The scheme is a kind of charging and rewarding mechanism, which provides an attempt to urge travelers to plan their travel routes reasonably so that excessive traffic congestion can be mitigated. Mobility credits are imposed on those travelers who use high congested routes, while rewarded credits are given to those travelers who switch to the low congested routes. A free tradable market is created such that the travelers paying credits can purchase them from those earning them from the rewarding travel route choices. When the total amount of credits earned is equal to the amount of credits consumed, transfer of wealth can only take place among the travelers and hence overcome the inequity problem of congestion pricing. On the general transportation network, the type of tradable credit schemes can be formulated as a mathematical programming with equilibrium constraint (MPEC) model. Based on the model, a credit charging mechanism is obtained under the system optimum and Pareto-improving system optimum conditions.

本文研究了带路段容量约束弹性需求用户均衡交通分配问题及其近似解法.采用超需求模型将弹性需求转化为固定需求,提出了一种带路段容量约束弹性需求用户均衡交通分配近似算法.该算法在迭代过程中,通过不断自适应调节排队延误因子、误差因子来近似真实路段行驶时间,使路段流量逐步满足约束条件,最终达到广义用户均衡.这种方法克服了容量约束弹性需求用户均衡分配计算量大及随机分配法要求枚举所有路径的困难.随后证明了算法的收敛性,并对一个小型路网进行了数值试验.

This paper established some new convergence results for the power penalty method for the nonlinear complementarity problem(NCP), and then applied the method to solve the general traffic assignment problem with elastic demand. The power penalty method approximates the NCP by a nonlinear equation containing a power penalty term. We prove that this method can handle general monotone NCPs. This result is important for the general traffic assignment problem with elastic demand because the associated NCP is often not $\xi$ monotone. This study considered the traffic assignment problem with symmetric and asymmetric link costs, as well as additive and non-additive route costs. We propose to use a column generation scheme based on the proposed power penalty method to solve this problem. Numerical results are provided to demonstrate the efficiency of the method.