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     

A generalized assignment model for dynamic supply chain capacity planning

We consider a generalization of the well‐known generalized assignment problem (GAP) over discrete time periods encompassed within a finite planning horizon. The resulting model, MultiGAP, addresses the assignment of tasks to agents within each time period, with the attendant single‐period assignment costs and agent‐capacity constraint requirements, in conjunction with transition costs arising between any two consecutive periods in which a task is reassigned to a different agent. As is the case for its single‐period antecedent, MultiGAP offers a robust tool for modeling a wide range of capacity planning problems occurring within supply chain management. We provide two formulations for MultiGAP and establish that the second (alternative) formulation provides a tighter bound. We define a Lagrangian relaxation‐based heuristic as well as a branch‐and‐bound algorithm for MultiGAP. Computational experience with the heuristic and branch‐and‐bound algorithm on over 2500 test problems is reported. The Lagrangian heuristic consistently generates high‐quality and in many cases near‐optimal solutions. The branch‐and‐bound algorithm is also seen to constitute an effective means for solving to optimality MultiGAP problems of reasonable size. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

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

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

Doubly Stochastic Sequential Assignment Problem

This article introduces the Doubly Stochastic Sequential Assignment Problem (DSSAP), an extension of the Sequential Stochastic Assignment Problem (SSAP), where sequentially arriving tasks are assigned to workers with random success rates. A given number of tasks arrive sequentially, each with a random value coming from a known distribution. On a task arrival, it must be assigned to one of the available workers, each with a random success rate coming from a known distribution. Optimal assignment policies are proposed for DSSAP under various assumptions on the random success rates. The optimal assignment algorithm for the general case of DSSAP, where workers have distinct success rate distribution, has an exponential running time. An approximation algorithm that achieves a fraction of the maximum total expected reward in a polynomial time is proposed. The results are illustrated by several numerical experiments. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 124–137, 2016     

Multiple-facility loading under capacity-based economies of scope

Multiple-facility loading (MFL) involves the allocation of products among a set of finite-capacity facilities. Applications of MFL arise naturally in a variety of production scheduling environments. MFL models typically assume that capacity is consumed as a linear function of products assigned to a facility. Product similarities and differences, however, result in capacity-based economies or diseconomies of scope, and thus the effective capacity of the facility is often a (nonlinear) function of the set of tasks assigned to the facility. This article addresses the multiple-facility loading problem under capacity-based economies (and diseconomies) of scope (MFLS). We formulate MFLS as a nonlinear 0–1 mixed-integer programming problem, and we discuss some useful properties. MFLS generalizes many well-known combinatorial optimization problems, such as the capacitated facility location problem and the generalized assignment problem. We also define a tabu-search heuristic and a branch-and-bound algorithm for MFLS. The tabu-search heuristic alternates between two search phases, a regional search and a diversification search, and offers a novel approach to solution diversification. We also report computational experience with the procedures. In addition to demonstrating MFLS problem tractability, the computational results indicate that the heuristic is an effective tool for obtaining high-quality solutions to MFLS. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 229–256, 1997     

Integrated scheduling of loading and transportation with tractors and semitrailers separated

Motivated by some practical applications, we study a new integrated loading and transportation scheduling problem. Given a set of jobs, a single crane is available to load jobs, one by one, onto semitrailers with a given capacity. Loaded semitrailers are assigned to tractors for transportation tasks. Subject to limited resources (crane, semitrailers, and tractors), the problem is to determine (1) an assignment of jobs to semitrailers for loading tasks, (2) a sequence for the crane to load jobs onto semitrailers, (3) an assignment of loaded semitrailers to tractors for transportation tasks, and (4) a transportation schedule of assigned tractors such that the completion time of the last transportation task is minimized. We first formulate the problem as a mixed integer linear programming model (MILPM) and prove that the problem is strongly NP‐hard. Then, optimality properties are provided which are useful in establishing an improved MILPM and designing solution algorithms. We develop a constructive heuristic, two LP‐based heuristics, and a recovering beam search heuristic to solve this problem. An improved procedure for solutions by heuristics is also presented. Furthermore, two branch‐and‐bound (B&B) algorithms with two different lower bounds are developed to solve the problem to optimality. Finally, computational experiments using both real data and randomly generated data demonstrate that our heuristics are highly efficient and effective. In terms of computational time and the number of instances solved to optimality in a time limit, the B&B algorithms are better than solving the MILPM. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 416–433, 2015     

跳跃-滑翔弹道扰动引力自适应网格快速赋值方法

为实现高超声速跳跃-滑翔弹道扰动引力的快速赋值,提出自适应网格赋值模型,并根据反距离加权理论,优化广义延拓逼近算法,对模型的逼近误差进行分析。该赋值模型的网格划分为两级,第一级网格根据标准弹道空域进行划分,第二级网格根据滑翔导弹实际弹道在线生成。根据一级网格节点数据,通过优化广义延拓逼近算法计算二级网格节点数据,最后根据二级单元内插计算实际弹道点的扰动引力值。仿真结果表明:在同等大小的网格划分下,优化广义延拓自适应网格模型的逼近精度高于一般赋值方法;在同等精度要求下,该赋值模型的最大单元格边长大于一般赋值方法,从而减少了单元格划分数量,进而降低弹上数据存储量;针对不同滑翔方向以及不同滑翔距离的跳跃-滑翔弹道,该模型逼近误差对应的落点偏差小于5 m,具有较好的适应性。该赋值模型在满足计算速度的前提下,提高了传统赋值方法的逼近精度,降低了弹上存储量,具有一定的工程应用价值。     

模糊匈牙利算法在舰艇抢修人员指派问题中的研究

分析了舰艇在执行任务或作战等紧急情况下的抢修人员指派问题,并对此建立了多目标广义指派问题的数学模型。在任务数少于工作人数的情况下,采用虚拟“工作”和“人员”的方法,得到适合经典匈牙利算法的拓展效益矩阵,并对此矩阵采用匈牙利算法求得最优指派。     

一种面向移动Agent的多任务并行计算模型及算法

介绍了一种面向移动Agent的并行计算模型,给出了采用十标度策略解决任务排序,采用满射策略解决任务映射的算法。该模型允许多个计算任务在异构主机构成的分布式环境下同时进行计算,并且通过算法优化,降低移动Agent之间的通信成本,减少网络流量。     

CEC条件下舰艇编队目标武器分配研究

在分析CEC条件下舰艇编队目标武器分配模式的基础上,综合运用MAS理论与方法,建立了舰艇编队目标武器分配MAS模型,即利用Agent描述舰艇编队的各种物理资源或逻辑资源,通过网络及Agent通讯协议将多个Agent连接成一个整体系统,设计了映射实体功能的Agent结构,从而为舰艇编队目标武器分配决策提供了一条新途径.     

有人机—无人机群协同空战目标分配算法

针对有人机—无人机群协同空战目标分配问题,运用离散粒子群算法,分为1架UCAV分配1个目标,1架UCAV分配2个目标时不考虑攻击先后影响和考虑攻击先后影响3种情况进行了仿真研究,提出了一种新的粒子构造方法。综合考虑空战能力指数和优势函数,构造了收益风险矩阵和多目标分配的代价函数。仿真结果具有良好收敛性,对有人机—无人机群协同空战目标分配具有参考价值。     

Limiting behavior of the stochastic sequential assignment problem

The stochastic sequential assignment problem (SSAP) considers how to allocate available distinct workers to sequentially arriving tasks with stochastic parameters such that the expected total reward obtained from the sequential assignments is maximized. Implementing the optimal assignment policy for the SSAP involves calculating a new set of breakpoints upon the arrival of each task (i.e., for every time period), which is impractical for large‐scale problems. This article studies two problems that are concerned with obtaining stationary policies, which achieve the optimal expected reward per task as the number of tasks approaches infinity. The first problem considers independent and identically distributed (IID) tasks with a known distribution function, whereas in the second problem tasks are derived from r different unobservable distributions governed by an ergodic Markov chain. The convergence rate of the expected reward per task to the optimal value is also obtained for both problems. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

Search techniques for a nonlinear multiprocessor scheduling problem

The problem of assigning computer program modules to functionally similar processors in a distributed computer network is investigated. The modules of a program must be assigned among processors in such a way as to minimize interprocessor communication while taking advantage of affinities of certain modules to particular processors. This problem is formulated as a zero-one quadratic programming problem, but is more conveniently modeled as a directed acyclic search graph. The model is developed and a backward shortest path labeling algorithm is given that produces an assignment of program modules to processors. A non-backtracking branch-and-bound algorithm is described that uses a local neighborhood search at each stage of the search graph.     

Transformations of node‐balanced routing problems

This article describes a polynomial transformation for a class of unit‐demand vehicle routing problems, named node‐balanced routing problems (BRP), where the number of nodes on each route is restricted to be in an interval such that the workload across the routes is balanced. The transformation is general in that it can be applied to single or multiple depot, homogeneous or heterogeneous fleet BRPs, and any combination thereof. At the heart of the procedure lies transforming the BRP into a generalized traveling salesman problem (TSP), which can then be transformed into a TSP. The transformed graph exhibits special properties which can be exploited to significantly reduce the number of arcs, and used to construct a formulation for the resulting TSP that amounts to no more than that of a constrained assignment problem. Computational results on a number of instances are presented. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 370–387, 2015     

随机系统扇形极点和方差约束状态反馈控制

区域极点和稳态方差是表征控制系统性能的两个重要指标,通过把扇形区域极点指标和稳态方差指标融入到一个修正的Lyapunov方程,研究了扇形区域极点和稳态方差上界约束下的状态反馈控制问题.利用矩阵广义逆和矩阵分解的方法得到了扇形区域极点和稳态方差可配置条件以及控制器的求取方法,所得控制器表达式中含有自由参数,便于控制器的工程实现,也为选取控制器的自由参数来使控制系统满足更多的性能指标留下了余地.     

A note on allocating jobs to two machines

A recent article in this journal by Mehta, Chandrasekaran, and Emmons [1] described a dynamic programming algorithm for assigning jobs to two identical parallel processors in a way that minimizes the average delay of these jobs. Their problem has a constraint on the sequence of the jobs such that any group of jobs assigned to a processor must be processed in the order of the sequence. This note has two purposes. First, we wish to point out a relationship between this work and some prior work [2]. Second, we wish to point out that Mehta, Chandrasekaran, and Emmons formulation, slightly generalized, can be used to find the optimum assignment of jobs to two machines in a more general class of problems than they considered including a subclass in which the jobs are not constrained to be processed in a given sequence.     

基于模糊指派的阵地选址决策

给出了一种混合部署的多个导弹营的阵地多要素选址决策方法,运用了模糊关系合成矩阵,将各种情况下的多要素导弹阵地选址问题转化为模糊指派问题,并运用了匈牙利算法进行求解,最后给出了实际算例.     

An approximate planning model for distributed computing networks

We develop an approximate planning model for a distributed computing network in which a control system oversees the assignment of information flows and tasks to a pool of shared computers, and describe several optimization applications using the model. We assume that the computers are multithreaded, and have differing architectures leading to varying and inconsistent processing rates. The model is based on a discrete‐time, continuous flow model developed by Graves [Oper Res 34 (1986), 522–533] which provides the steady‐state moments of production and work‐in‐queue quantities. We make several extensions to Graves' model to represent distributed computing networks. First, we approximately model control rules that are nonlinear functions of the work‐in‐queue at multiple stations through a linearization approach. Second, we introduce an additional noise term on production and show its use in modeling the discretization of jobs. Third, we model groups of heterogeneous computers as aggregate, “virtual computing cells” that process multiple tasks simultaneously, using a judiciously selected control rule. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Multiple subset sum with inclusive assignment set restrictions

In a traditional multiple subset sum problem (MSSP), there is a given set of items and a given set of bins (or knapsacks) with identical capacities. The objective is to select a subset of the items and pack them into the bins such that the total weight of the selected items is maximized. However, in many applications of the MSSP, the bins have assignment restrictions. In this article, we study the subset sum problem with inclusive assignment set restrictions, in which the assignment set of one item (i.e., the set of bins that the item may be assigned to) must be either a subset or a superset of the assignment set of another item. We develop an efficient 0.6492‐approximation algorithm and test its effectiveness via computational experiments. We also develop a polynomial time approximation scheme for this problem. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

防空目标分配中雷达遮蔽区问题研究

目标分配是防空指挥控制的主要任务,而目标相对于防空导弹火力单元的遮蔽判断是目标分配必须考虑的重要因素。分析了目标遮蔽区的判断条件,推导出目标在遮蔽区飞行时间的计算方法,提出了一种快速表示遮蔽区域图的离散处理方法,并研究了考虑目标遮蔽区影响的目标分配问题。通过实例计算,验证了目标遮蔽计算判断和分配方法的合理性,研究结果对实时指挥控制有应用价值。