On the core and competitive equilibria of a market with indivisible goods

We consider a generalization of the assignment game of Shapley and Shubik [4]. In the market which we consider, s kinds of indivisible goods are exchanged for money. The market consists of buyers and sellers. Each buyer wants to buy at most one unit of the goods, and each seller may sell more than one unit. First, we show that the set of all competitive imputations is given by the solutions of a certain linear programing problem dual to the optimal problem. Second, we show that the core of the market coincides with the set of all competitive imputations under some condition, and consider the core of the market where s=1 and the condition does not hold.     

Rent seeking and defence expenditure

A plethora of arguments from the ‘public choice school’ suggest that public goods are ‘under‐supplied’ by comparison with public sector provision of more private goods. The implication is that rent seeking by the ‘military‐industrial complex’ serves, in some measure, to offset potential allocative inefficiency. In this paper a comparison of rent seeking by producers of public goods and producers of private goods identifies a bias that favours public good supply. The bias results from the different way in which collective demand for public goods and for private goods is expressed. The prospect of larger rents to the ‘military‐industrial complex’ implies greater rent‐seeking expenditures in this sector. The extent to which public goods (and, in particular, defence) are ‘under supplied’ is much exaggerated.     

贪心遗传算法解决一般武器-目标分配问题

一般武器-目标分配问题,是使武器发挥最大效能而使目标遭受最大毁伤的最优化问题.遗传算法广泛用于解决最优化问题.提出一种具有贪心优化机制的局部搜索方法,以提高遗传算法的搜索效率,从而迅速找到全局最优解.应用于炮兵武器-目标分配问题的仿真试验结果表明,此算法比现有的其他搜寻算法具有更好的求解效率.     

Optimal inventory policies in contagious demand models

In the past, contagious distributions have been successfully applied in bacteriology, entomology, and accident statistics. This paper applies the notion of contagious distributions in the inventory control of new products and seasonal or style goods, which have an lying “true contagion” for their demands, namely, the influence of past demands on occurrence of demands. A contagious distribution is derived by assuming a nonstationary Poisson process where the demand rate at any instant depends on the past demands to that instant. Using this contagious distribution, an inventory model is developed seasonal goods and new product lines. Optimal order policies as a function of the initial level and the review period are derived.     

Synchronization in hub terminals with the circular arrangement problem

Hub terminals are important entities in modern distribution networks and exist for any transportation device, that is, cross docks and parcel distribution centers for trucks, container ports for ships, railway yards for trains, and hub airports for aircraft. In any of these hubs, the mid‐term planning task of synchronizing the transshipment of goods and passengers when servicing the transportation devices has to be solved, for which many different solution approaches specifically tailored to the respective application exist. We, however, take a unified view on synchronization in hubs and aim at a general building block. As a point of origin, a basic vertex ordering problem, the circular arrangement problem (CAP), is identified. We explain the relation between the CAP and hub processes, develop suited algorithms for solving the CAP, and extend the basic CAP by multiple additions, for example, arrival times, limited storage space, and multiple service points, make the problem adaptable to a wide range of hub terminals. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 454–469, 2015     

高架仓库应用超细干粉灭火系统可行性分析

高架仓库具有高度高、空间大、货物分层密集存放、灭火难度大等特点,而超细干粉灭火装置灭火剂释放后,达到灭火浓度的粉雾能够迅速弥漫保护空间,笼罩保护物。在对高架仓库常见灭火系统进行分析的基础上,提出了超细干粉灭火系统在立体货架上分层布置、分区启动的应用形式及方法,并通过模拟灭火试验,分析了超细干粉灭火系统应用于高架仓库的可行性。结果表明：超细干粉灭火系统可有效扑灭高架仓库初期火灾。     

C~3I 系统中基于多目标决策理论的对空攻击任务分配决策问题研究

根据多目标决策理论,从系统的角度出发,提出了防御权系数问题,并在此基础上研究对空攻击任务的分配策略,给出了效度最大攻击任务分配策略和重点防护目标优先攻击任务分配策略,并引入攻击强度阀值概念,对这两种分配策略进行了改进,最后给出了具体算法。     

任务分配问题的对称群方法

探讨了无人飞行器(UAV)编队的任务分配问题。任务分配是UAV协同控制的基础,其解是任务区域内各任务的一个排列。求解UAV任务分配问题的有效方法是能在合理的计算时间内找到近似最优解的启发式算法。用对称群描述UAV任务分配的搜索空间,基于右乘运算构造搜索邻域。仿真结果验证了群论禁忌搜索算法的有效性。     

基于协同学的编队协同空战任务决策

基于协同学理论给出了编队协同空战系统的协同学框架;提出了编队协同作战方案的五元组定义,明确了影响系统进程的序参量;基于系统有序度与协同度的概念,构建了协同效能优化模型;以任务冲突检测与消解为依据给出了任务决策的约束条件;最后以二进制粒子群优化算法对此约束优化问题进行了求解.仿真结果表明,以协同学理论描述编队协同任务决策问题是可行的,构建的协同效能模型与任务决策方法在处理编队时序任务决策问题时是有效的.     

Minimizing makespan in a multimode multiprocessor shop scheduling problem

We study the problem of multimode scheduling tasks on dedicated processors, with the objective of minimizing the maximum completion time. Each task can be undertaken in one among a set of predefined alternative modes, where each mode specifies a required set of dedicated processors and a processing time. At any time each processor can be used by a single task at most. General precedence constraints exist among tasks, and task preemption is not allowed. The problem consists of assigning a mode and a starting time to each task, respecting processor and precedence constraints, to minimize the time required to complete all tasks. The problem is NP-hard in several particular cases. In previous works, we studied algorithms in which a solution was obtained by means of an iterative procedure that combines mode assignment and sequencing phases separately. In this paper, we present some new heuristics where the decision on the mode assignment is taken on the basis of a partial schedule. Then, for each task, the mode selection and the starting time are chosen simultaneously considering the current processor usage. Different lower bounds are derived from a mathematical formulation of the problem and from a graph representation of a particular relaxed version of the problem. Heuristic solutions and lower bounds are evaluated on randomly generated test problems. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 893–911, 1999     

基于信息态势共享的编队反导目标分配方案优化

在编队目标信息态势实现共享的条件下,可实现网络化防空反导作战的常规作战样式,对目标进行集中统一分配,如何形成最优化分配方案,是防空反导作战指挥决策中的关键。在给定目标来袭态势下,根据编队目标分配原则,可形成多种目标分配初始方案,先后采用了基于负载平衡和基于任务有利度方法,对目标分配方案进行优化。优化所得方案有利度的均方根最大,目标来袭密度的均方根最小,可作为下一步编队组织使用火力通道的依据。     

Offsets as industrial policy: Lessons from aerospace

Since 1975 “offsets” have begun to appear frequently in contracts covering international sales of aircraft and other products incorporating advanced technology. Offsets involve reciprocity beyond that normally found in an exchange of goods for money. They may involve co‐production or co‐design of the principal item to be exchanged, or acceptance by the seller of goods or services unrelated to it as partial payment (indirect offsets or countertrade).

The United States has become the major provider of offsets and anti‐offset sentiment has grown. Economists interpret them as trade diverting. Politicians from regions suffering loss of employment view them as bestowing unfair advantage to foreign competitors.

The authors examine offsets from both theoretical and policy perspectives and conclude that in such noncompetitive markets, second‐best considerations dominate, requiring case‐by‐case evaluation of impacts and rendering across‐the‐board determinations of welfare loss suspect.     

Heuristics for the multi‐resource generalized assignment problem

The well‐known generalized assignment problem (GAP) involves the identification of a minimum‐cost assignment of tasks to agents when each agent is constrained by a resource in limited supply. The multi‐resource generalized assignment problem (MRGAP) is the generalization of the GAP in which there are a number of different potentially constraining resources associated with each agent. This paper explores heuristic procedures for the MRGAP. We first define a three‐phase heuristic which seeks to construct a feasible solution to MRGAP and then systematically attempts to improve the solution. We then propose a modification of the heuristic for the MRGAP defined previously by Gavish and Pirkul. The third procedure is a hybrid heuristic that combines the first two heuristics, thus capturing their relative strengths. We discuss extensive computational experience with the heuristics. The hybrid procedure is seen to be extremely effective in solving MRGAPs, generating feasible solutions to more than 99% of the test problems and consistently producing near‐optimal solutions. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 468–483, 2001     

See the light: Optimization of put-to-light order picking systems

Put-to-light order picking systems invert the basic logic of conventional picker-to-parts systems. Instead of successively visiting the storage positions of the stock keeping units (SKUs) when collecting picking orders, an order picker accompanies successive bins each containing multiple items of a specific SKU along a lane of subsequent orders. Whenever the picker passes an order requiring the current SKU, which is indicated by a light signal, she puts the requested number of items into the bin associated with the order. Such an order picking system is well-suited if the assortment is not overly large and all orders demand similar SKUs, so that it is mainly applied in distribution centers of brick-and-mortar retail chains. This paper evaluates four different setups of put-to-light systems, which, during operations, require the solution of different storage assignment and SKU sequencing problems. We formulate these problems, prove computational complexity, and suggest suited solution algorithms. By applying these algorithms in a comprehensive computational study, we benchmark the impact of the four different setups on picking performance. In this way, warehouse managers receive decision support on how to set up their put-to-light systems.     

The structure of the defense industry and the security needs of the country: a differentiated products model

This paper models the interactions between the defense needs of the USA and Western Europe, which produce several heterogeneous defense goods, and the defense industry market structure. The results show that net defense costs of the USA and Europe are lower when the number of defense firms in each arms‐producing country is small and when the world prices of the defense goods are high. The model predicts that the increase in world prices will crowd‐out countries in the developing world from the market for modern weapon systems and may force them to develop and use ‘cheap and dirty’ weapon systems.     

舰艇编队作战任务优化分配

从舰艇编队的实际作战需求出发,将作战使命分解为多个作战任务,然后分配给相关平台。首先在每个平台只能承担一项任务的前提下,构建了编队作战任务分配的基本模型。在此基础上研究了两平台协同执行任务时效能互补、单平台在同时执行多项任务时武器装备相互干扰等情况,进一步构建了考虑平台间协同效益和平台执行多任务的作战任务分配模型。应用改进的遗传算法给出了编队作战任务分配方案优化选择的具体方法步骤,最后针对一个典型案例进行了仿真计算与分析,验证了三种模型的合理性。     

指派问题的降阶优化算法

指派问题是运筹学中特殊线性规划中的一类问题。在现实生活中,指派问题非常普遍,常常可以见到各种各样的指派问题。通过对指派问题的数学模型进行分析,提出了与以往方法不同的求解指派问题的一种新的思路,通过对几个定理的研究,给出了一种新的求解方法——降阶优化算法。对求解指派问题提供了一种新的途径,在运筹学等领域有着较好的应用前景。     

The bounded interval generalized assignment model

The bounded interval generalized assignment model is a “many-for-one” assignment model. Each task must be assigned to exactly one agent; however, each agent can be assigned multiple tasks as long as the agent resource consumed by performing the assigned tasks falls within a specified interval. The bounded interval generalized assignment model is formulated, and an algorithm for its solution is developed. Algorithms for the bounded interval versions of the semiassignment model and sources-to-uses transportation model are also discussed.     

弹性高超声速飞行器自适应极点配置控制

本文针对乘波体外形的高超声速飞行器存在的结构/推进/气动强耦合特性,利用鲁棒极点配置方法设计了自适应控制器,实现了对高超声速飞行器的速度和高度指令跟踪控制。控制器采用了Proportional-Integral-Filter(PIF)结构,该结构的控制器不仅能够使系统具备良好的稳态特性而且能够对控制信号进行滤波平滑,从而能够有效地抑制高超声速飞行器的弹性振动对控制系统的影响。基于弹性高超声速飞行器模型CSUAL_GHV,分别采用自适应鲁棒极点配置控制方法和自适应非鲁棒极点配置控制方法进行了数值仿真。结果表明,与非鲁棒极点配置控制方法相比,采用自适应鲁棒极点配置控制方法的控制系统不仅使飞行器能够很快地跟踪上速度和高度指令,跟踪误差小于1%,而且高超声速飞行器的弹性振动也得到了有效地抑制。飞行器在整个飞行过程中的飞行攻角均处于±2°范围内,满足超燃冲压发动机的工作要求。     

联合防空目标分配方案优化研究

目标分配是联合防空作战指挥决策的核心内容,是各级联合防空指挥中心的重要工作,其模型的合理性与可信性会对作战结局产生重大影响。为提高目标分配的合理性与可信性,对联合防空作战混合部署下的目标优化分配问题进行了详细分析,建立了相应的数学规划决策模型。为了有效获得问题的全局最优解,将改进遗传算法(GA)应用于数学规划决策模型的求解过程中,并给出了模型求解的方法和步骤,经实例应用,取得了满意的结果。