Multicriteria modelling for a repair contract problem based on utility and the ELECTRE I method

Each alternative for a repair contract implies a specific responsetime and related cost. The response time is associated withthe commitment of repair time, based on the contract. A decisionmaker chooses the best alternative taking into account the systemperformance and the cost of the contract. This problem has beenanalysed through a multicriteria decision model. This decisionmodel supports decision makers in the determination of the bestcombination of contracting conditions. The decision model proposedallows the decision maker to quantify the consequences of anaction taking into account two basic criteria: the cost of thecontract and the system performance. Two different decisionmodels have been built to support decision makers. These decisionmodels are based on different multicriteria approaches. Thefirst, reported in a previous paper, is based on the multiattributeutility theory (MAUT). The model presented in this paper isbased on the ELECTRE I method combined with utility functions.The paper presents the main theoretical aspects related to bothapproaches and practical implications related to model building.A numerical application is presented in order to illustratethe use of the decision model.     

A multicriteria model for risk sorting of natural gas pipelines based on ELECTRE TRI integrating Utility Theory

This paper proposes a multicriteria model for assessing risk in natural gas pipelines, and for classifying sections of pipeline into risk categories. The model integrates Utility Theory and the ELECTRE TRI method. It aims to help transmission and distribution companies, when engaged in risk management and decision-making, to consider the multiple dimensions of risk that may arise from pipeline accidents. Pipeline hazard scenarios are presented, and it is argued that the assessment of risk in natural gas pipelines should not be based solely on probabilities of human fatalities, but should involve a wider perspective that simultaneously takes into consideration the human, environmental and financial dimensions of impacts of pipeline accidents. Finally, in order to verify the effectiveness of the model set out, a numerical application based on a real case study is presented.     

An approximation algorithm for sorting by reversals and transpositions

Genome rearrangement algorithms are powerful tools to analyze gene orders in molecular evolution. Analysis of genomes evolving by reversals and transpositions leads to a combinatorial problem of sorting by reversals and transpositions, the problem of finding a shortest sequence of reversals and transpositions that sorts one genome into the other. In this paper we present a 2k-approximation algorithm for sorting by reversals and transpositions for unsigned permutations where k is the approximation ratio of the algorithm used for cycle decomposition. For the best known value of k our approximation ratio becomes 2.8386+δ for any δ>0. We also derive a lower bound on reversal and transposition distance of an unsigned permutation.     

An improved method on group decision making based on interval-valued intuitionistic fuzzy prioritized operators

Interval-valued intuitionistic fuzzy prioritized operators are widely used in group decision making under uncertain environment due to its flexibility to model uncertain information. However, there is a shortcoming in the existing aggregation operators (interval-valued intuitionistic fuzzy prioritized weighted average (IVIFPWA)) to deal with group decision making in some extreme situations. For example, when an expert gives an absolute negative evaluation, the operators could lead to irrational results, so that they are not effectively enough to handle group decision making. In this paper, several examples are illustrated to show the unreasonable results in some of these situations. Actually, these unreasonable cases are common for operators in dealing with product averaging, not only emerging in IVIFPWA operators. To overcome the shortcoming of these kinds of operators, an improvement of making slight adjustment on initial evaluations is provided. Numerical examples are used to show the efficiency of the improvement.     

An algorithm based on the generalized D-gap function for equilibrium problems

The equilibrium problem (EP) can be reformulated as an unconstrained minimization problem through the generalized D-gap function. In this paper, we propose an algorithm for minimizing the problem and analyze some convergence properties of the proposed algorithm. Under some reasonable conditions, we show that the iteration sequence generated by the algorithm is globally convergent and converges to a solution to the EP and the generalized D-gap function provides a global error bound for the algorithm.     

基于分支割平面的一类无容量限制设施选址问题求解算法

无容量限制设施选址问题是经典的组合优化问题, 具有广泛的应用价值,然而该问题已被证明是NP难问题, 并且传统的分支定界方法求解速度较慢.研究以最大化总收益费用与总投建费用之差为目标的无容量限制设施选址问题,将其转化为节点包装问题,并根据模型的图形特点提出了新的合法不等式族------轴不等式族,经过严格的数学证明后得出轴不等式要强于原有的奇洞不等式. 同时,设计出切割不等式快速搜索算法嵌入到分支割平面方法中. 最后,通过实验验证了轴不等式族的强有效性, 以及分支割平面方法比分支定界方法求解速度快、节点数量少的优点.     

An infeasible interior-point algorithm based on modified Nesterov and Todd directions for symmetric linear complementarity problem

We present an infeasible interior-point algorithm for symmetric linear complementarity problem based on modified Nesterov–Todd directions by using Euclidean Jordan algebras. The algorithm decreases the duality gap and the feasibility residual at the same rate. In this algorithm, we construct strictly feasible iterates for a sequence of perturbations of the given problem. Each main iteration of the algorithm consists of a feasibility step and a number of centring steps. The starting point in the first iteration is strictly feasible for a perturbed problem. The feasibility steps lead to a strictly feasible iterate for the next perturbed problem. By using centring steps for the new perturbed problem, a strictly feasible iterate is obtained to be close to the central path of the new perturbed problem. Furthermore, giving a complexity analysis of the algorithm, we derive the currently best-known iteration bound for infeasible interior-point methods.     

An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem

The irregular strip packing problem is a combinatorial optimization problem that requires to place a given set of two-dimensional polygons within a rectangular container so that no polygon overlaps with other polygons or protrudes from the container, where each polygon is not necessarily convex. The container has a fixed width, while its length can change so that all polygons are placed in it. The objective is to find a layout of the set of polygons that minimizes the length of the container.We propose an algorithm that separates overlapping polygons based on nonlinear programming, and an algorithm that swaps two polygons in a layout so as to find their new positions in the layout with the least overlap. We incorporate these algorithms as components into an iterated local search algorithm for the overlap minimization problem and then develop an algorithm for the irregular strip packing problem using the iterated local search algorithm. Computational comparisons on representative instances disclose that our algorithm is competitive with other existing algorithms. Moreover, our algorithm updates several best known results.     

具有间断扩散性质的线性约束全局优化随机算法

研究带线性约束的非凸全局优化问题,在有效集算法的基础上提出了一个具有间断扩散性质的随机微分方程算法,讨论了算法的理论性质和收敛性,证明了算法以概率收敛到问题的全局最优解,最后列出了数值实验效果.     

An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts

This paper presents a new exact algorithm for the Capacitated Vehicle Routing Problem (CVRP) based on the set partitioning formulation with additional cuts that correspond to capacity and clique inequalities. The exact algorithm uses a bounding procedure that finds a near optimal dual solution of the LP-relaxation of the resulting mathematical formulation by combining three dual ascent heuristics. The first dual heuristic is based on the q-route relaxation of the set partitioning formulation of the CVRP. The second one combines Lagrangean relaxation, pricing and cut generation. The third attempts to close the duality gap left by the first two procedures using a classical pricing and cut generation technique. The final dual solution is used to generate a reduced problem containing only the routes whose reduced costs are smaller than the gap between an upper bound and the lower bound achieved. The resulting problem is solved by an integer programming solver. Computational results over the main instances from the literature show the effectiveness of the proposed algorithm.      

An improved generalized predictive control algorithm based on the difference equation CARIMA model for the SISO system with known strong interference

ABSTRACT

The single input single output (SISO) system with known strong interference is widely used in various occasions. Due to its strong interference, the control accuracy is hard to guarantee. To solve this problem, an improved generalized predictive control (IGPC) algorithm is developed. The IGPC firstly builds the difference equation CARIMA (Controlled Auto-Regressive Integrated Moving-Average) model of the SISO system and then treats the system as a two input single output (TISO) system and calculates its predictive vector, then transforms it into a SISO system and uses the TISO system predictive vector to calculate the SISO system control increment. A new parameter called phase coefficient is added to inhibit the control lag. Simulations are performed to make the comparison among the traditional GPC, PID control, velocity synchronization control (VSC), fuzzy adaptive PID control (FAPID), model-based robust PID control (BPID) and the IGPC. Results show that IGPC has best performance compared to the others. Finally, experiments are developed which proved that the IGPC algorithm has a higher accuracy in the SISO system with known strong interference than that of VSC.