MODS： A Novel Metaheuristic of Deterministic Swapping for the Multi-Objective Optimization of Combinatorials Problems

This paper states a new metaheuristic based on Deterministic Finite Automata （DFA） for the multi - objective optimization of combinatorial problems. First, a new DFA named Multi - Objective Deterministic Finite Automata （MDFA） is defined. MDFA allows the representation of the feasible solutions space of combinatorial problems. Second, it is defined and implemented a metaheuritic based on MDFA theory. It is named Metaheuristic of Deterministic Swapping （MODS）. MODS is a local search strategy that works using a MDFA. Due to this, MODS never take into account unfeasible solutions. Hence, it is not necessary to verify the problem constraints for a new solution found. Lastly, MODS is tested using well know instances of the Bi-Objective Traveling Salesman Problem （TSP） from TSPLIB. Its results were compared with eight Ant Colony inspired algorithms and two Genetic algorithms taken from the specialized literature. The comparison was made using metrics such as Spacing, Generational Distance, Inverse Generational Distance and No-Dominated Generation Vectors. In every case, the MODS results on the metrics were always better and in some of those cases, the superiority was 100%.

基于Zhang-Hager线搜索的改进近似最优梯度法

提出一种改进的近似最优梯度法,求解图划分问题中的无约束目标函数.先用修正的BFGS更新公式及选取BB类步长的线性组合作为标量矩阵得到近似最优步长,再引入参数对经典的Zhang-Hager线搜索形式进行改进,构建算法框架并给出R线性收敛性证明.实验结果表明,改进算法提高了原算法的性能.

Bad-scenario-set Robust Optimization Framework With Two Objectives for Uncertain Scheduling Systems

This paper proposes a robust optimization framework generally for scheduling systems subject to uncertain input data, which is described by discrete scenarios. The goal of robust optimization is to hedge against the risk of system performance degradation on a set of bad scenarios while maintaining an excellent expected system performance. The robustness is evaluated by a penalty function on the bad-scenario set. The bad-scenario set is identified for current solution by a threshold, which is restricted on a reasonable-value interval. The robust optimization framework is formulated by an optimization problem with two conflicting objectives. One objective is to minimize the reasonable value of threshold, and another is to minimize the measured penalty on the bad-scenario set. An approximate solution framework with two dependent stages is developed to surrogate the biobjective robust optimization problem. The approximation degree of the surrogate framework is analyzed. Finally, the proposed bad-scenario-set robust optimization framework is applied to a scenario job-shop scheduling system. An extensive computational experiment was conducted to demonstrate the effectiveness and the approximation degree of the framework. The computational results testified that the robust optimization framework can provide multiple selections of robust solutions for the decision maker. The robust scheduling framework studied in this paper can provide a unique paradigm for formulating and solving robust discrete optimization problems. © 2014 Chinese Association of Automation.

The Quantum Approximate Algorithm for Solving Traveling Salesman Problem

The Quantum Approximate Optimization Algorithm(QAOA)is an algorithmic framework for finding approximate solutions to combinatorial optimization problems.It consists of interleaved unitary transformations induced by two operators labelled the mixing and problem Hamiltonians.To fit this framework,one needs to transform the original problem into a suitable form and embed it into these two Hamiltonians.In this paper,for the well-known NP-hard Traveling Salesman Problem(TSP),we encode its constraints into the mixing Hamiltonian rather than the conventional approach of adding penalty terms to the problem Hamiltonian.Moreover,we map edges(routes)connecting each pair of cities to qubits,which decreases the search space significantly in comparison to other approaches.As a result,our method can achieve a higher probability for the shortest round-trip route with only half the number of qubits consumed compared to IBM Q’s approach.We argue the formalization approach presented in this paper would lead to a generalized framework for finding,in the context of QAOA,high-quality approximate solutions to NP optimization problems.

A branch-and-bound algorithm for multi-dimensional quadratic 0-1 knapsack problems

In this paper, a branch-and-bound method for solving multi-dimensional quadratic 0-1 knapsack problems was studied. The method was based on the Lagrangian relaxation and the surrogate constraint technique for finding feasible solutions. The Lagrangian relaxations were solved with the maximum-flow algorithm and the Lagrangian bounds was determined with the outer approximation method. Computational results show the efficiency of the proposed method for multi-dimensional quadratic 0-1 knapsack problems.

Chaotic Neural Network Technique for "0-1" Programming Problems

0-1 programming is a special case of the integer programming, which is commonly encountered in many optimization problems. Neural network and its general energy function are presented for 0-1 optimization problem. Then, the 0-1 optimization problems are solved by a neural network model with transient chaotic dynamics (TCNN). Numerical simulations of two typical 0-1 optimization problems show that TCNN can overcome HNN's main drawbacks that it suffers from the local minimum and can search for the global optimal solutions in to solveing 0-1 optimization problems.

Optimal obstacle control problem

In the paper we discuss some properties of the state operators of the optimal obstacle control problem for elliptic variational inequality.Existence,uniqueness and regularity of the optimal control,problem are established.In addition,the approximation of the optimal obstacle problem is also studied.

OPTIMAL CONTROL PROBLEM FOR PARABOLIC VARIATIONAL INEQUALITIES

This paper deals with the optimal control problems of systems governed by a parabolic variational inequality coupled with a semilinear parabolic differential equations. The maximum principle and some kind of approximate controllability are studied.

SEMI-DEFINITE RELAXATION ALGORITHM OF MULTIPLE KNAPSACK PROBLEM

The multiple knapsack problem denoted by MKP (B,S,m,n) can be defined as fol- lows.A set B of n items and a set Sof m knapsacks are given such thateach item j has a profit pjand weightwj,and each knapsack i has a capacity Ci.The goal is to find a subset of items of maximum profit such that they have a feasible packing in the knapsacks.MKP(B,S,m,n) is strongly NP- Complete and no polynomial- time approximation algorithm can have an approxima- tion ratio better than0 .5 .In the last ten years,semi- definite programming has been empolyed to solve some combinatorial problems successfully.This paper firstly presents a semi- definite re- laxation algorithm (MKPS) for MKP (B,S,m,n) .It is proved that MKPS have a approxima- tion ratio better than 0 .5 for a subclass of MKP (B,S,m,n) with n≤ 1 0 0 ,m≤ 5 and maxnj=1{ wj} minmi=1{ Ci} ≤ 2 3 .

Solvability conditions for algebra inverse eigenvalue problem over set of anti-Hermitian generalized anti-Hamiltonian matrices

By using the characteristic properties of the anti-Hermitian generalized anti-Hamiltonian matrices, we prove some necessary and sufficient conditions of the solvability for algebra inverse eigenvalue problem of anti-Hermitian generalized anti-Hamiltonian matrices, and obtain a general expression of the solution to this problem. By using the properties of the orthogonal projection matrix, we also obtain the expression of the solution to optimal approximate problem of an n× n complex matrix under spectral restriction.

Vertex Cover Optimization Using a Novel Graph Decomposition Approach

The minimum vertex cover problem(MVCP)is a well-known combinatorial optimization problem of graph theory.The MVCP is an NP(nondeterministic polynomial)complete problem and it has an exponential growing complexity with respect to the size of a graph.No algorithm exits till date that can exactly solve the problem in a deterministic polynomial time scale.However,several algorithms are proposed that solve the problem approximately in a short polynomial time scale.Such algorithms are useful for large size graphs,for which exact solution of MVCP is impossible with current computational resources.The MVCP has a wide range of applications in the fields like bioinformatics,biochemistry,circuit design,electrical engineering,data aggregation,networking,internet traffic monitoring,pattern recognition,marketing and franchising etc.This work aims to solve the MVCP approximately by a novel graph decomposition approach.The decomposition of the graph yields a subgraph that contains edges shared by triangular edge structures.A subgraph is covered to yield a subgraph that forms one or more Hamiltonian cycles or paths.In order to reduce complexity of the algorithm a new strategy is also proposed.The reduction strategy can be used for any algorithm solving MVCP.Based on the graph decomposition and the reduction strategy,two algorithms are formulated to approximately solve the MVCP.These algorithms are tested using well known standard benchmark graphs.The key feature of the results is a good approximate error ratio and improvement in optimum vertex cover values for few graphs.

Structural optimization of elliptical-tip star propellant grain using sub-problem approximation

A method is presented here for structural optimization of elliptical-tip star grain.The grain structural integrity was improved by minimizing the most critical area of inner bore hoop strain during cool down.Optimization was done by sub-problem approximation method in conjunction with finite element analysis.Both radii of the ellipse were varied during optimization to find the optimal ellipse.The optimization resulted in grain geometry having minimum level of Inner bore hoop strain without violating the preset limits of burning perimeter.The von mises strain at grain inner bore was also reduced in resultant grain.

A New Searching Strategy for the Lost Plane Based on RBF Neural Network Model and Global Optimization Model

In this paper, we construct two models for the searching task for a lost plane. Model 1 determines the searching area. We predict the trajectory of floats generated after the disintegration of the plane by using RBF neural network model, and then determine the searching area according to the trajectory. With the pass of time, the searching area will also be constantly moving along the trajectory. Model 2 develops a maritime search plan to achieve the purpose of completing the search in the shortest time. We optimize the searching time and transform the problem into the 0-1 knapsack problem. Solving this problem by improved genetic algorithm, we can get the shortest searching time and the best choice for the search power.

子矩阵约束下的Hermite-Hamilton矩阵反问题

该文讨论了子矩阵约束下矩阵反问题AX=B的Hermite-Hamilton矩阵解.给出了解存在的充要条件和通解的一般表达式.且对任一给定矩阵,在解集合中求出了其最佳逼近解.

铁路网上技术直达列车编组计划优化的二次0-1规划法

以文献[1]的构模原理为基础,构造了任意结构的路网上双方向技术直达列车编组计划综合优化的二次0-1规划模型,然后给出了这类模型的若干理论结果,并在此基础上介绍了模型的解法、计算试验结果及分析。

向量极值问题的ε-近似解和向量变分不等式

本文对线性拓扑空间中一般向量极值问题的ε-有效解的几何性质进行了研究,得到了几个定理;在引入向量值映射的ε-次梯度概念的基础上,建立了向量极值问题的ε-近似解问题与广义向量变分不等式问题的关系定理.

定向距离函数的光滑化方法及其应用

本文考虑定向距离函数的光滑化表示及其应用。首先在已有的两种光滑化方法的基础上,给出了这类特殊的非光滑函数的光滑化表示。作为特例,在二维空间中,给出该函数更具体的光滑化函数。最后利用定向距离函数的光滑化函数以及它在多目标优化问题标量化方法中的应用,建立非光滑多目标优化问题的光滑标量化模型,并给出了两者之间解集的关系。

机会约束的多选择背包问题的遗传算法求解

机会约束的多选择背包问题(CCMCKP)是一类具有重要应用价值的NP难组合优化问题,但目前还缺乏关于该问题求解方法的专门研究。为此,提出首个CCMCKP的求解框架,并基于该框架构建了两种求解方法:基于动态规划的RA-DP和基于遗传算法的RA-IGA。RA-DP是精确求解方法,具有最优性保证,但是在可接受的时间(1 h)内仅能求解小规模问题样例;相较而言,RA-IGA是近似求解方法,具有更好的可扩放性。仿真实验结果验证了所提求解方法的性能:在小规模问题样例上,RA-DP和RA-IGA都可以找到最优解;在中大规模问题样例上,RA-IGA表现出了比RA-DP显著更高的求解效率,它总是可以在给定时间(1 h)内快速获得可行解。在CCMCKP的后续研究中,RA-DP和RA-IGA可作为基准对比方法,而实验工作中所构建的测试样例集可作为该问题的标准测试集。

一类鲁棒凸优化的Mond-Weir型逼近对偶性

通过引入一类含有不确定信息的凸约束优化问题,先借助鲁棒优化方法,建立该不确定凸约束优化问题的Mond-Weir型鲁棒逼近对偶问题,再借助一类广义鲁棒逼近KKT条件,刻画该不确定凸约束优化问题与其Mond-Weir型鲁棒逼近对偶问题之间的逼近对偶性关系.

P-亚对称矩阵的反问题研究

利用矩阵的奇异值分解及张量积与拉直的性质,讨论了P-亚对称矩阵的反问题,得到了此类矩阵反问题有解的充分必要条件及通解表达式,并给出了矩阵方程解集合中与给定矩阵的最佳逼近解的表达式.