论公共政策执行变异的成因与对策

公共政策执行在政策过程中具有十分重要的意义。然而由于多方面的原因,当前政策执行中出现了诸多变异行为,严重影响了公共政策目标的实现。因此,必须积极采取措施,治理公共政策执行中的变异行为。     

一类非线性混合整规划的无约束连续化解法

将整系数多项式 0 - 1混合整规划问题化成无约束多项式规划问题。通过解该问题 ,能得到原问题的近似解。处理方法的特点是能够直接处理不等式约束情形 ,而不需要先将不等式约束化成等式约束再来处理     

一类Kermack—Mckandrick方程组初值问题

本文研究描述传染病现象的一类Kermack—Mekandrick方程组初值问题光滑解整体存在唯一性及渐近性质。     

一类四阶非线性常微分方程的两点边值问题解的存在性与唯一性

本文利用Hammerstein型积分算子和上下解方法,研究了一类四阶非线性常微分方程的两点边值问题     

大型供应链设计的基本数学模型与算法研究

随着信息技术与全球经济一体化的发展,供应链管理成为全球管理科学的研究热点。本文在分析国内外各种关于供应链设计的数学模型与算法的基础上,提出了具有普遍性意义且简单易行的MIP供应链设计的数学模型以及求解供应链问题的有界变量广义上界算法。实例计算表明,提出的模型和方法是可靠实用的。     

An access network design problem with end-to-end QoS constraints

In this paper, we present an access network design problem with end-to-end quality of service (QoS) requirement. The problem can be conceptualized as a two-level hierarchical location-allocation problem on the tree topology with nonlinear side constraints. The objective function of the nonlinear mixed integer programming model minimizes the total cost of switch and fiber cable, while satisfying demand within the prescribed level of QoS. By exploiting the inherent structure of the nonlinear QoS constraints, we develop linearization techniques for finding an optimal solution. Also, we devise an effective exact optimal algorithm within the context of disjunctive constraint generation. We present promising computational results that demonstrate the effectiveness of the proposed solution procedure.     

Mixed integer (0–1) fractional programming for decision support in paper production industry

This paper presents an effective and efficient method for solving a special class of mixed integer fractional programming (FP) problems. We take a classical reformulation approach for continuous FP as a starting point and extend it for solving a more general class of mixed integer (0–1) fractional programming problems.To stress the practical relevance of the research we focus on a real-life application in paper production industry. The constantly advancing physical knowledge of large scale pulp and paper production did have a substantial impact on an existing DSS in which mixed integer (0–1) fractional programming is introduced. We show that the motivation to solve a real-life fractional programming problem can provide the basis for a new approach in a new context that has an added value of its own, even outside the given application area. We describe the main characteristics of the DSS, the necessity to develop a non-iterative solution procedure and demonstrate both the effectiveness and efficiency of the proposed approach from practical data sets.     

Staff rostering in call centers providing employee transportation

We address the staff rostering problem in call centers with the goal of balancing operational cost, agent satisfaction and customer service objectives. In metropolitan cities such as Istanbul and Mumbai, call centers provide the transportation of their staff so that shuttle costs constitute a significant part of the operational costs. We develop a mixed integer programming model that incorporates the shuttle requirements at the beginning and end of the shifts into the agent-shift assignment decisions, while considering the skill sets of the agents, and other constraints due to workforce regulations and agent preferences. We analyze model solutions for a banking call center under various management priorities to understand the interactions among the conflicting objectives. We show that considering transportation costs as well as agent preferences in agent-shift assignments provides significant benefits in terms of both cost savings and employee satisfaction.     

浅析社会困境

社会困境是指那些使得个体理性导致集体非理性的环境。文章介绍了社会困境在两人和多人环境下的具体含义,详细说明了解决社会困境的可能途径,即动机性、策略性和结构性解决方法。     

A harmony search-based memetic optimization model for integrated production and transportation scheduling in MTO manufacturing

This paper investigates an integrated production and transportation scheduling problem in an MTO supply chain. A harmony search-based memetic optimization model is developed to handle this problem, in which certain heuristic procedures are proposed to convert the investigated problem into an order assignment problem. A novel improvisation process is also proposed to improve the optimum-seeking performance. The effectiveness of the proposed model is validated by numerical experiments. The experimental results show that (1) the proposed model can solve the investigated problem effectively and that (2) the proposed memetic optimization process exhibits better optimum-seeking performance than genetic algorithm-based and traditional memetic optimization processes.