Omni-optimizer: A generic evolutionary algorithm for single and multi-objective optimization

Due to the vagaries of optimization problems encountered in practice, users resort to different algorithms for solving different optimization problems. In this paper, we suggest and evaluate an optimization procedure which specializes in solving a wide variety of optimization problems. The proposed algorithm is designed as a generic multi-objective, multi-optima optimizer. Care has been taken while designing the algorithm such that it automatically degenerates to efficient algorithms for solving other simpler optimization problems, such as single-objective uni-optimal problems, single-objective multi-optima problems and multi-objective uni-optimal problems. The efficacy of the proposed algorithm in solving various problems is demonstrated on a number of test problems chosen from the literature. Because of its efficiency in handling different types of problems with equal ease, this algorithm should find increasing use in real-world optimization problems.     

Well-posedness in the generalized sense for variational inclusion and disclusion problems and well-posedness for optimization problems with constraint

In this paper, we study the well-posedness in the generalized sense for variational inclusion problems and variational disclusion problems, the well-posedness for optimization problems with variational inclusion problems, variational disclusion problems and scalar equilibrium problems as constraint.     

Well-posedness for generalized quasi-variational inclusion problems and for optimization problems with constraints

In this paper, well-posedness of generalized quasi-variational inclusion problems and of optimization problems with generalized quasi-variational inclusion problems as constraints is introduced and studied. Some metric characterizations of well-posedness for generalized quasi-variational inclusion problems and for optimization problems with generalized quasi-variational inclusion problems as constraints are given. The equivalence between the well-posedness of generalized quasi-variational inclusion problems and the existence of solutions of generalized quasi-variational inclusion problems is given under suitable conditions.     

Characterizations of Solutions for Vector Equilibrium Problems

In this paper, we characterize the solutions of vector equilibrium problems as well as dual vector equilibrium problems. We establish also vector optimization problem formulations of set-valued maps for vector equilibrium problems and dual vector equilibrium problems, which include vector variational inequality problems and vector complementarity problems. The set-valued maps involved in our formulations depend on the data of the vector equilibrium problems, but not on their solution sets. We prove also that the solution sets of our vector optimization problems of set-valued maps contain or coincide with the solution sets of the vector equilibrium problems.     

Well-posedness for parametric optimization problems with variational inclusion constraint

In this paper, we study the well-posedness for the parametric optimization problems with variational inclusion problems as constraint (or the perturbed problem of optimization problems with constraint). Furthermore, we consider the relation between the well-posedness for the parametric optimization problems with variational inclusion problems as constraint and the well-posedness in the generalized sense for variational inclusion problems.     

On System of Generalized Vector Quasi-equilibrium Problems with Set-valued Maps

In this paper, we introduce four new types of the system of generalized vector quasi-equilibrium problems with set-valued maps which include system of vector quasi-equilibrium problems, system of vector equilibrium problems, system of variational inequality problems, and vector equilibrium problems in the literature as special cases. We prove the existence of solutions for such kinds of system of generalized vector quasi-equilibrium problems. Consequently, we derive some existence results of a solution for the system of vector quasi-equilibrium problems and the generalized Debreu type equilibrium problem for vector-valued functions.     

Multiple voting location problems

The facility voting location problems arise from the application of criteria derived from the voting processes concerning the location of facilities. The multiple location problems are those location problems in which the alternative solutions are sets of points. This paper extends previous results and notions on single voting location problems to the location of a set of facility points. The application of linear programming techniques to solve multiple facility voting location problems is analyzed. We propose an algorithm to solve Simpson multiple location problems from which the solution procedures for other problems are derived.     

Quasi-Newton Methods for Nonlinear Least Squares Focusing on Curvatures

A new quasi-Newton method for nonlinear least squares problems is proposed. Two advantages of the method are accomplished by utilizing special geometrical properties in the problem class. First, fast convergence is established for well-conditioned problems by interpolating both the current and the previous step in each iteration. Second, high accuracy is achieved for certain difficult problems, such as ill-conditioned problems and problems with large curvatures in the tangent space. Numerical results for artificial problems and standard test problems are presented and discussed.     

General network design: A unified view of combined location and network design problems

This paper presents a unified framework for the general network design problem which encompasses several classical problems involving combined location and network design decisions. In some of these problems the service demand relates users and facilities, whereas in other cases the service demand relates pairs of users between them, and facilities are used to consolidate and re-route flows between users. Problems of this type arise in the design of transportation and telecommunication systems and include well-known problems such as location-network design problems, hub location problems, extensive facility location problems, tree-star location problems and cycle-star location problems, among others. Relevant modeling aspects, alternative formulations and possible algorithmic strategies are presented and analyzed.     

Random assignment problems

Analysis of random instances of optimization problems provides valuable insights into the behavior and properties of problem’s solutions, feasible region, and optimal values, especially in large-scale cases. A class of problems that have been studied extensively in the literature using the methods of probabilistic analysis is represented by the assignment problems, and many important problems in operations research and computer science can be formulated as assignment problems. This paper presents an overview of the recent results and developments in the area of probabilistic assignment problems, including the linear and multidimensional assignment problems, quadratic assignment problem, etc.     

Apply a novel evolutionary algorithm to the solution of parameter selection problems

In this study, a modified line-up competition algorithm (LCA) is used to solve parameter selection problems. The so-called parameter selection problems contain parameter identification problems and optimal control problems. Once the later problems are transformed by control parametrization, the parameters embedded in both problems are selected by the proposed method under the framework of integration approach. Two parameter identification problems and one optimal control problem are given to demonstrate the use of LCA. The results show that in addition to being insensitive to the initial conditions, LCA is very efficient in solving highly nonlinear parameter selection problems.     

伪单调型向量F-互补问题可行集的最小元问题

本文引入了几类向量F-互补问题并给出了向量F-互补问题与广义向量变分不等式之间的关系.通过定义向量F-互补问题的可行集,研究了伪单调型向量F-互补问题的可行集的最小问题,推广了已有的一些结果.     

半无限规划问题的一个有效解法

1．引言在计算机辅助设计和工程设计中,经常遇到下面的两类优化问题1,2］．1．无约束半无限极大极小问题．其中外x）二——x。。Im。x。。。Yi夕（x;N）这里J二（】,2,·,｝对任何7E八岁：R－xR”。＋R是连续可微的函数,X是R”。中的一个紧子集,且VYj）一O,这里问h）表示X体积．2．约束半无限代化问题．其中I一（1,2,·．小记L二《0｝UI对任何jCL冲’（x）一max。。。Yi夕（x,yi）·这里拉：PX＊n＋R是连续可微函数,X是”。中的一个紧子集,且NU）一0·注．设Y（Z,一二切EyW一叫卜4．今后对本文用到的紧子集地做…     

Methods for solving fuzzy assignment problems and fuzzy travelling salesman problems with different membership functions

Mukherjee and Basu proposed a new method for solving fuzzy assignment problems. In this paper, some fuzzy assignment problems and fuzzy travelling salesman problems are chosen which cannot be solved by using the fore-mentioned method. Two new methods are proposed for solving such type of fuzzy assignment problems and fuzzy travelling salesman problems. The fuzzy assignment problems and fuzzy travelling salesman problems which can be solved by using the existing method, can also be solved by using the proposed methods. But, there exist certain fuzzy assignment problems and fuzzy travelling salesman problems which can be solved only by using the proposed methods. To illustrate the proposed methods, a fuzzy assignment problem and a fuzzy travelling salesman problem is solved. The proposed methods are easy to understand and apply to find optimal solution of fuzzy assignment problems and fuzzy travelling salesman problems occurring in real life situations.     

Helly’s Principle and Its Application to an Infinite-Horizon Optimal Control Problem

In this paper, a numerical method is presented to solve singularly-perturbed two-point boundary-value problems for second-order ordinary differential equations with a discontinuous source term. First, an asymptotic expansion approximation of the solution of the boundary-value problem is constructed using the basic ideas of the well-known WKB perturbation method. Then, some initial-value problems and terminal-value problems are constructed such that their solutions are the terms of this asymptotic expansion. These initial-value problems and terminal-value problems are singularly-perturbed problems and therefore fitted mesh method (Shishkin mesh) are used to solve these problems. Necessary error estimates are derived and examples are provided to illustrate the method.     

关于B运输问题的两点注记

用实例说明 B运输问题和传统运输问题解的区别 .给出了 B运输问题一个定理的证明 ,从而使 B运输问题的有关理论更加完善     

On general hemiequilibrium problems

In this paper, we introduce and analyze a new class of equilibrium problems known as general hemiequilibrium problems. It is shown that this class includes hemiequilibrium problems, hemivariational inequalities and complementarity problems as special cases. We use the auxiliary principle techniques to suggest some iterative-type methods for solving multivalued hemiequilibrium problems. We also analyze the convergence analysis of these new iterative methods under some mild conditions. As special cases, we obtain several new and known methods for solving variational inequalities and equilibrium problems.     

On common quasi-eigenvector problems

In this paper, we study four types of common quasi-eigenvector problems and two types of eigenvector problems. The existence theorems for the solutions of common quasi-eigenvector problems and eigenvector problems are also established.     

A Relaxation of a Min-Cut Problem in an Anisotropic Continuous Network

Strang [18] introduced optimization problems on a Euclidean domain which are closely related with problems in mechanics and noted that the problems are regarded as continuous versions of famous max-flow and min-cut problems. In [15] we generalized the problems and called the generalized problems max-flow and min-cut problems of Strang's type. In this paper we formulate a relaxed version of the min-cut problem of Strang's type and prove the existence of optimal solutions under some suitable conditions. The conditions are essential. In fact, there is an example of the relaxed version which has no optimal solutions if the conditions are not fulfilled. We give such an example in the final section. Accepted 8 October 1998     

Connection Between Smoothing Problems with Obstacles and Weights

We study how to reduce the smoothing problems with obstacles to the solution of smoothing problems with weights. We prove that, for problems with obstacles in Hilbert spaces, and in the classical case, especially, in several variable problems, the associated Lagrangian has a saddle point. This implies the existence of equivalent problems with weights.