A superlinearly convergent norm-relaxed SQP method of strongly sub-feasible directions for constrained optimization without strict complementarity

In this paper, a kind of optimization problems with nonlinear inequality constraints is discussed. Combined the ideas of norm-relaxed SQP method and strongly sub-feasible direction method as well as a pivoting operation, a new fast algorithm with arbitrary initial point for the discussed problem is presented. At each iteration of the algorithm, an improved direction is obtained by solving only one direction finding subproblem which possesses small scale and always has an optimal solution, and to avoid the Maratos effect, another correction direction is yielded by a simple explicit formula. Since the line search technique can automatically combine the initialization and optimization processes, after finite iterations, the iteration points always get into the feasible set. The proposed algorithm is proved to be globally convergent and superlinearly convergent under mild conditions without the strict complementarity. Finally, some numerical tests are reported.     

Matching inductive search bias and problem structure in continuous Estimation-of-Distribution Algorithms

Research into the dynamics of Genetic Algorithms (GAs) has led to the field of Estimation-of-Distribution Algorithms (EDAs). For discrete search spaces, EDAs have been developed that have obtained very promising results on a wide variety of problems. In this paper we investigate the conditions under which the adaptation of this technique to continuous search spaces fails to perform optimization efficiently. We show that without careful interpretation and adaptation of lessons learned from discrete EDAs, continuous EDAs will fail to perform efficient optimization on even some of the simplest problems. We reconsider the most important lessons to be learned in the design of EDAs and subsequently show how we can use this knowledge to extend continuous EDAs that were obtained by straightforward adaptation from the discrete domain so as to obtain an improvement in performance. Experimental results are presented to illustrate this improvement and to additionally confirm experimentally that a proper adaptation of discrete EDAs to the continuous case indeed requires careful consideration.     

Two phase algorithms for the bi-objective assignment problem

In this paper, we present several algorithms for the bi-objective assignment problem. The algorithms are based on the two phase method, which is a general technique to solve multi-objective combinatorial optimisation (MOCO) problems.     

Game coloring the Cartesian product of graphs

This article proves the following result: Let G and G′ be graphs of orders n and n′, respectively. Let G^* be obtained from G by adding to each vertex a set of n′ degree 1 neighbors. If G^* has game coloring number m and G′ has acyclic chromatic number k, then the Cartesian product G□G′ has game chromatic number at most k(k + m ? 1). As a consequence, the Cartesian product of two forests has game chromatic number at most 10, and the Cartesian product of two planar graphs has game chromatic number at most 105. © 2008 Wiley Periodicals, Inc. J Graph Theory 59: 261–278, 2008     

Optimization models for the single delay management problem in public transportation

Passengers travelling in public transportation networks often have to use different lines to cover the trip from their origin to the desired destination. As a consequence, the reliability of connections between vehicles is a key issue for the attractiveness of the intermodal transportation network and it is strongly affected by some unpredictable events like breakdowns or vehicle delays. In such cases, a decision is required to determine if the connected vehicles should wait for the delayed ones or keep their schedule. The delay management problem (DMP) consists in defining the wait/depart policy which minimizes the total delay on the network. In this work, we present two equivalent mixed integer linear programming models for the DMP with a single initial delay, able to reduce the number of variables with respect to the formulations proposed by the literature. The two models are solved by a branch and cut procedure and by a constraint generation approach respectively, and preliminary computational results are presented.     

Multicriteria Optimal Design of a Rectangular Composite Plate Subjected to Biaxial and Thermal Loading

Multicriteria optimization of the structure and geometry of a laminated anisotropic composite plate subjected to the thermal and biaxial action is considered. From known properties of the monolayer and the given values of variable structural parameters, the thermoelastic properties of the layered composite are determined. The criteria to be optimized—the transverse critical load and the longitudinal thermal stresses—depend on two variable design parameters of composite properties and temperature. In the space of the optimization criteria, the domain of allowable solutions and the Pareto-optimal subdomain are found. __________ Translated from Mekhanika Kompozitnykh Materialov, Vol. 41, No. 5, pp. 683–690, September–October, 2005.     

A fast Pareto genetic algorithm approach for solving expensive multiobjective optimization problems

We present a new multiobjective evolutionary algorithm (MOEA), called fast Pareto genetic algorithm (FastPGA), for the simultaneous optimization of multiple objectives where each solution evaluation is computationally- and/or financially-expensive. This is often the case when there are time or resource constraints involved in finding a solution. FastPGA utilizes a new ranking strategy that utilizes more information about Pareto dominance among solutions and niching relations. New genetic operators are employed to enhance the proposed algorithm’s performance in terms of convergence behavior and computational effort as rapid convergence is of utmost concern and highly desired when solving expensive multiobjective optimization problems (MOPs). Computational results for a number of test problems indicate that FastPGA is a promising approach. FastPGA yields similar performance to that of the improved nondominated sorting genetic algorithm (NSGA-II), a widely-accepted benchmark in the MOEA research community. However, FastPGA outperforms NSGA-II when only a small number of solution evaluations are permitted, as would be the case when solving expensive MOPs.     

Compromise optimization of a rectangular composite plate subjected to biaxial thermal loading and buckling under the action of shear

The compromise optimization of the structure and geometry of a laminated anisotropic composite plate subjected to biaxial thermal shear loading is considered. From the known properties of the monolayer and given values of a variable structural parameter, the thermoelastic properties of the layered composite are determined. The optimization criteria — the critical shear load and the longitudinal and transverse thermal stresses — depend on two variable design parameters of composite properties and temperature. In the space of optimization criteria, the domain of allowable solutions and the Pareto-optimal subregion are found. __________ Translated from Mekhanika Kompozitnykh Materialov, Vol. 44, No. 4, pp. 471–478, July–August, 2008.     

Anharmonic effects on lattice resonant modes of impure metallic crystals

The effect of lattice anharmonicity on the resonant modes of dilute impurities for Au-Cu, Au-Ag and W-Cr metallic systems are studied from the poles of the double time temperature dependent impure Green’s function of these crystals. The third order force constants used in the present work are derived assuming the systems to obey the Lennard-Jones potential. The inclusion of lattice anharmonicity has been found to increase the resonant frequency which depends upon the mass defect, force constant change parameter and the impurity concentration terms. Some interesting features about the phase shift and the change in width of the vibrational spectrum are reported at room temperature for the isotopic defects and the defects interacting with host atoms. The results are found to be in qualitative agreement with the experiments on the systems considered.     

Normal mode calculation and IR band assignments of A-type zeolite

Normal mode calculation of A-type zeolite was carried out with the potential energy functions obtained from the constraint method. Mass-weighted cartesian coordinates and the pseudo-lattice method were used. The assignments of IR absorption bands were made with the calculated normal modes, by using the calculated absorption intensities of the modes and the degrees of contribution of the internal coordinates to the modes. The force constants of internal coordinate motions within the framework were also calculated and are compared with the empirical values.