战时装备维修任务指派模型及算法研究

总结了战时装备维修任务指派决策出现的三种可能情况，分别建立了它们的整数线形规划模型，并构造了适合传统匈牙利算法求解的广义效益矩阵，最后对该算法进行了应用举例。     

军用飞机维修质量管理的最优线性分派评估

在军机维修工作中,科学有效的管理,对及时完成维修任务,保障训练作战计划至关重要.在建立适合我军军机维修质量评估指标体系的基础上,定义了理想方案和贴近度,给出了排序频数的计算方法,进而将军机维修质量评估问题转化为最优线性分派问题来处理,从而为军机维修质量管理提供了一种科学、可靠的决策方法.     

非平衡指派模型及其在航空机务维修中的应用

非平衡指派问题是最优平衡指派问题的推广与深化,在航空机务维修工作中,维修任务的合理配置对及时完成维修任务,保障训练作战计划非常重要.本文从装备完好率和人力资源的优化配置角度出发,按照不考虑维修任务等待时间和考虑维修任务等待时间两种情况分别建立了非平衡指派优化模型,并给出了这两种情况下效益矩阵的构造方法,进而将优化模型转化为最优平衡指派模型进行求解,从而为航空机务维修工作中维修人员的优化配置提供了一种科学、合理的决策方法.     

Simple matching vs linear assignment in scheduling models with positional effects: A critical review

This paper addresses scheduling models in which a contribution of an individual job to the objective function is represented by the product of its processing time and a certain positional weight. We review most of the known results in the area and demonstrate that a linear assignment algorithm as part of previously known solution procedures can be replaced by a faster matching algorithm that minimizes a linear form over permutations. Our approach reduces the running time of the resulting algorithms by up to two orders, and carries over to a wider range of models, with more general positional effects. Besides, the same approach works for the models with no prior history of study, e.g., parallel machine scheduling with deterioration and maintenance to minimize total flow time.     

The daily tail assignment problem under operational uncertainty using look-ahead maintenance constraints

The tail assignment problem is a critical part of the airline planning process that assigns specific aircraft to sequences of flights, called lines-of-flight, to satisfy operational constraints. The aim of this paper is to develop an operationally flexible method, based upon the one-day routes business model, to compute tail assignments that satisfy short-range—within the next three days—aircraft maintenance requirements. While maintenance plans commonly span multiple days, the methods used to compute tail assignments for the given plans can be overly complex and provide little recourse in the event of schedule perturbations. The presented approach addresses operational uncertainty by using solutions from the one-day routes aircraft maintenance routing approach as input. The daily tail assignment problem is solved with an objective to satisfy maintenance requirements explicitly for the current day and implicitly for the subsequent two days. A computational study will be performed to assess the performance of exact and heuristic solution algorithms that modify the input lines-of-flight to reduce maintenance misalignments. The daily tail assignment problem and the developed algorithms are demonstrated to compute solutions that effectively satisfy maintenance requirements when evaluated using input data collected from three different airlines.     

Random backtracking in backtrack search algorithms for satisfiability

This paper proposes the utilization of randomized backtracking within complete backtrack search algorithms for propositional satisfiability (SAT). In recent years, randomization has become pervasive in SAT algorithms. Incomplete algorithms for SAT, for example the ones based on local search, often resort to randomization. Complete algorithms also resort to randomization. These include state-of-the-art backtrack search SAT algorithms that often randomize variable selection heuristics. Moreover, it is plain that the introduction of randomization in other components of backtrack search SAT algorithms can potentially yield new competitive search strategies. As a result, we propose a stochastic backtrack search algorithm for SAT, that randomizes both the variable selection and the backtrack steps of the algorithm. In addition, we relate randomized backtracking with a more general form of backtracking, referred to as unrestricted backtracking. Finally, experimental results for different organizations of randomized backtracking are described and compared, providing empirical evidence that the new search algorithm for SAT is a very competitive approach for solving hard real-world instances.     

The multiple-partners assignment game with heterogeneous sales and multi-unit demands: competitive equilibria

A multiple-partners assignment game with heterogeneous sales and multi-unit demands consists of a set of sellers that own a given number of indivisible units of potentially many different goods and a set of buyers who value those units and want to buy at most an exogenously fixed number of units. We define a competitive equilibrium for this generalized assignment game and prove its existence by using only linear programming. In particular, we show how to compute equilibrium price vectors from the solutions of the dual linear program associated to the primal linear program defined to find optimal assignments. Using only linear programming tools, we also show (i) that the set of competitive equilibria (pairs of price vectors and assignments) has a Cartesian product structure: each equilibrium price vector is part of a competitive equilibrium with all optimal assignments, and vice versa; (ii) that the set of (restricted) equilibrium price vectors has a natural lattice structure; and (iii) how this structure is translated into the set of agents?? utilities that are attainable at equilibrium.     

The auction algorithm for the transportation problem

The auction algorithm is a parallel relaxation method for solving the classical assignment problem. It resembles a competitive bidding process whereby unassigned persons bid simultaneously for objects, thereby raising their prices. Once all bids are in, objects are awarded to the highest bidder. This paper generalizes the auction algorithm to solve linear transportation problems. The idea is to convert the transportation problem into an assignment problem, and then to modify the auction algorithm to exploit the special structure of this problem. Computational results show that this modified version of the auction algorithm is very efficient for certain types of transportation problems.     

An interactive sorting approach based on the assignment examples of multiple decision makers with different priorities

Although group decision-making is often adopted by many organizations in today??s highly complicated business environment, the multiple criteria sorting (MCS) problem in the context of group decision-making has not been studied sufficiently. To this end, we propose a new interactive method to assist a group of decision makers (DMs) with different priorities. With the goal of relieving the cognitive effort exerted by DMs, this method uses the assignment examples provided by the DMs to draw the parameters for the group preference model. In the iterative MCS process that we employ, the DMs are supported from two perspectives. When the assignment examples provided by the DMs are inconsistent, a RINCON algorithm is developed to identify all the possible solutions that the DMs can use to resolve the conflicts. When the examples are consistent, the potential and the fittest assignments of each alternative are deduced using linear programming techniques. These are then presented to the DMs to help them provide more information for the decision-making process. Furthermore, the priority of each DM is objectively and subjectively evaluated, and then progressively updated to reflect the decision-making performance of a DM at each iteration. Meanwhile, the priorities are integrated into the linear programming model to deduce the fittest assignment, as well as into the RINCON algorithm. Hence, the assignment examples of the DMs with higher priorities are emphasized in the fittest assignment, and are less likely to be revised for inconsistency. A practical example featuring MBA programs is also presented to demonstrate the proposed method.     

Auction algorithms for network flow problems: A tutorial introduction

This paper surveys a new and comprehensive class of algorithms for solving the classical linear network flow problem and its various special cases such as shortest path, max-flow, assignment, transportation, and transhipment problems. The prototype method, from which the other algorithms can be derived, is the auction algorithm for the assignment problem. This is an intuitive method that operates like a rel auction where persons compete for objects by raising their prices through competitive bidding; the prices can be viewed as dual variables. Conceptually, auction algorithms represent a significant departure from the cost improvement idea that underlies primal simplex and dual ascent methods; at any one iteration, they may deteriorate both the primal and the dual cost. Auction algorithms perform very well for several important types of problems, both in theory and in practice, and they are also well suited for parallel computation.     

Integrated exact,hybrid and metaheuristic learning methods for confidentiality protection

A vital task facing government agencies and commercial organizations that report data is to represent the data in a meaningful way and simultaneously to protect the confidentiality of critical components of this data. The challenge is to organize and disseminate data in a form that prevents such critical components from being inferred by groups bent on corporate espionage, to gain competitive advantages, or having a desire to penetrate the security of the information underlying the data. Controlled tabular adjustment is a recently developed approach for protecting sensitive information by imposing a special form of statistical disclosure limitation on tabular data. The underlying model gives rise to a mixed integer linear programming problem involving both continuous and discrete (zero-one) variables. We develop stratified ordered (s-ordered) heuristics and a new meta-heuristic learning approach for solving this model, and compare their performance to previous heuristics and to an exact algorithm embodied in the state-of-the-art ILOG- CPLEX software. Our new approaches are based on partitioning the problem into its discrete and continuous components, first creating an s-ordered heuristic that reduces the number of binary variables through a grouping procedure that combines an exact mathematical programming model with constructive heuristics. To gain further advantages we then replace the mathematical programming model with an evolutionary scatter search approach that makes it possible to extend the method to large problems with over 9000 entries. Finally, we introduce a new metaheuristic learning method that significantly improves the quality of solutions obtained.     

A new MIP model for mine equipment scheduling by minimizing maintenance cost

Mining investment has been recognized as capital intensive due mainly to the cost of large equipment. Equipment capital costs for a given operation are usually within the order of hundreds of million dollars but may reach to billion dollars for large companies operating multiple mines. Such large investments require the optimum usage of equipment in a manner that the operating costs are minimized and the utilization of equipment is maximized through optimal scheduling. This optimum usage is required to ensure that the business remains sustainable and financially stable. Most mining operations utilize trucks to haul the mined material. Maintenance is one of the major operating cost items for these fleets as it can reach approximately one hundred million dollars yearly. There is no method or application in the literature that optimizes the utilization for truck fleet over the life of mine. A new approach based on mixed integer programming (MIP) techniques is used for annually scheduling a fixed fleet of mining trucks in a given operation, over a multi-year time horizon to minimize maintenance cost. The model uses the truck age (total hours of usage), maintenance cost and required operating hours to achieve annual production targets to produce an optimum truck schedule. While this paper focuses on scheduling trucks for mining operation, concept can be used in most businesses using equipment with significant maintenance costs. A case study for a large scale gold mine showed an annual discounted (10% rate) maintenance cost saving of over $2M and more than 16% ($21M) of overall maintenance cost reduction over 10 years of mine life, compared with the spreadsheet based approach used currently at the operation.     

Using assignment examples to infer weights for ELECTRE TRI method: Some experimental results

Given a finite set of alternatives A, the sorting (or assignment) problem consists in the assignment of each alternative to one of the pre-defined categories. In this paper, we are interested in multiple criteria sorting problems and, more precisely, in the existing method ELECTRE TRI. This method requires the elicitation of preferential parameters (weights, thresholds, category limits,…) in order to construct a preference model which the decision maker (DM) accepts as a working hypothesis in the decision aid study. A direct elicitation of these parameters requiring a high cognitive effort from the DM (V. Mosseau, R. Slowinski, Journal of Global Optimization 12 (2) (1998) 174), proposed an interactive aggregation–disaggregation approach that infers ELECTRE TRI parameters indirectly from holistic information, i.e., assignment examples. In this approach, the determination of ELECTRE TRI parameters that best restore the assignment examples is formulated through a nonlinear optimization program.In this paper, we consider the subproblem of the determination of the weights only (the thresholds and category limits being fixed). This subproblem leads to solve a linear program (rather than nonlinear in the global inference model). Numerical experiments were conducted so as to check the behaviour of this disaggregation tool. Results showed that this tool is able to infer weights that restores in a stable way the assignment examples and that it is able to identify “inconsistencies” in the assignment examples.     

A new model and hybrid approach for large scale inventory routing problems

This paper studies an inventory routing problem (IRP) with split delivery and vehicle fleet size constraint. Due to the complexity of the IRP, it is very difficult to develop an exact algorithm that can solve large scale problems in a reasonable computation time. As an alternative, an approximate approach that can quickly and near-optimally solve the problem is developed based on an approximate model of the problem and Lagrangian relaxation. In the approach, the model is solved by using a Lagrangian relaxation method in which the relaxed problem is decomposed into an inventory problem and a routing problem that are solved by a linear programming algorithm and a minimum cost flow algorithm, respectively, and the dual problem is solved by using the surrogate subgradient method. The solution of the model obtained by the Lagrangian relaxation method is used to construct a near-optimal solution of the IRP by solving a series of assignment problems. Numerical experiments show that the proposed hybrid approach can find a high quality near-optimal solution for the IRP with up to 200 customers in a reasonable computation time.     

A periodic review production and maintenance model with random demand,deteriorating equipment,and binomial yield

In many environments, product yield is heavily influenced by equipment condition. Despite this fact, previous research has either focused on the issue of maintenance, ignoring the effect of equipment condition on yield, or has focused on the issue of production, omitting the possibility of actively changing the machine state. We formulate a Markov decision process model of a single-stage production system in which demand is random. The product yield has a binomial distribution that depends on the equipment condition, which deteriorates over time. The objective is to choose simultaneously the equipment maintenance schedule as well as the quantity to produce in a way that minimizes the sum of expected production, backorder, and holding costs. After proving some results about the structural properties of the optimal policy, numerical problems are used to compare this method to the typical approach of solving the maintenance and production problems sequentially. The results show that the simultaneous solution provides substantial gains over the sequential approach. In the cases studied, the proposed method resulted in an average cost savings of approximately 18%.     

Eigenstructure assignment for linear parameter-varying systems with applications

The aim of this paper is to show that a recently proposed technique for eigenstructure assignment of linear time-invariant systems can be extended to solve the corresponding eigenstructure assignment problem for linear parameter-varying systems, whose state-space matrices depend on a set of time-varying parameters that are bounded and available online. In particular, the design of eigenstructure assignment is performed without requiring any conditions on the closed-loop eigenvalues, and provides a simple, complete and analytical parametric approach as well as the most degrees of design freedom for the eigenstructure assignment problem of linear parameter-varying systems. A parameter-varying attitude control system of refueling spacecraft in-orbit is used to demonstrate the usefulness and practicality of the proposed approach.     

Optimal double-resource assignment for the robust design problem in multistate computer networks

This paper proposes a novel approach to get the exact optimal double-resource assignment for the robust design problem in multistate computer networks. A multistate computer network consists of links and vertices where both kinds of resources may have several states due to failure, partial failure or maintenance. Therefore, each link (vertex) in the network should be assigned sufficient capacity to keep the network functioning normally. The robust design problem (RDP) in a multistate computer network (MCN) is to search for the minimum capacity assignment of each link and vertex such that the network still survived even under both kinds of failures. However, how to optimally assign the capacity to each resource is not an easy task. This paper proposes an efficient approach to do such assignment and illustrates the efficiency of the proposed approach by some numerical examples.     

Impact of quality on competitive advantage and organizational performance

Effective quality improvement has become a potentially valuable way of securing competitive advantage and improving organizational performance. This research conceptualizes and develops a framework that links quality, competitive advantage, and organizational performance. Data for the study were collected from 74 organizations and the relationships proposed in the framework were tested using structural equation modelling. The results indicate that quality improvement can lead to enhanced competitive advantage and improved organizational performance. The contribution of the paper is that it provides empirical support for direct and indirect effects of quality on organizational performance and competitive advantage in Tunisia.     

蚁群算法在战损装备抢修任务指派中的应用研究

结合战时装备保障实际情况和战损装备抢修任务特点,分析了现有战损装备抢修任务指派模型的特点及不足.依据紧急程度对战损装备抢修任务进行分类,建立了不同紧急度对应的装备抢修任务指派模型,重点是利用蚁群算法对模型进行求解.最后通过某装备保障想定的实例进行了验证,结果表明该算法操作简单、切实有效,能有效实施战损装备应急抢修任务的指派,在装备保障智能决策系统中有较好的应用前景.     

Condition-based maintenance optimization considering improving prediction accuracy

Condition-based maintenance (CBM) aims to reduce maintenance cost and improve equipment reliability by effectively utilizing condition monitoring and prediction information. It is observed that the prediction accuracy often improves with the increase of the age of the component. In this research, we develop a method to quantify the remaining life prediction uncertainty considering the prediction accuracy improvement, and an effective CBM optimization approach to optimize the maintenance schedule. Any type of prognostics methods can be used, including data-driven methods, model-based methods and integrated methods, as long as the prediction method can produce the predicted failure time distribution at any given inspection point. Furthermore, we develop a numerical method to accurately and efficiently evaluate the cost of the CBM policy. The proposed approach is demonstrated using vibration monitoring data collected from pump bearings in the field as well as simulated degradation data. The proposed policy is compared with two benchmark maintenance policies and is found to be more effective.