A knowledge-based archive multi-objective simulated annealing algorithm to optimize series–parallel system with choice of redundancy strategies

Redundancy allocation problem (RAP) is one of the best-developed problems in reliability engineering studies. This problem follows to optimize the reliability of a system containing s sub-systems under different constraints, including cost, weight, and volume restrictions using redundant components for each sub-system. Various solving methodologies have been used to optimize this problem, including exact, heuristic, and meta-heuristic algorithms. In this paper, an efficient multi-objective meta-heuristic algorithm based on simulated annealing (SA) is developed to solve multi-objective RAP (MORAP). This algorithm is knowledge-based archive multi-objective simulated annealing (KBAMOSA). KBAMOSA applies a memory matrix to reinforce the neighborhood structure to achieve better quality solutions. The results analysis and comparisons demonstrate the performance of the proposed algorithm for solving MORAP.     

Molecular structure and granule morphology of native and heat‐moisture‐treated pinhão starch

Pinhão seed is an unconventional source of starch and the pines grow up in native forests of southern Latin America. In this study, pinhão starch was adjusted at 15, 20 and 25% moisture content and heated to 100, 110 and 120 °C for 1 h. A decrease in λ max (starch/iodine complex) was observed as a result of increase in temperature and moisture content of HMT. The ratio of crystalline to amorphous phase in pinhão starch was determined via Fourier transform infra red by taking 1045/1022 band ratio. A decrease in crystallinity occurred as a result of HMT. Polarised light microscopy indicated a loss of birefringence of starch granules under 120 °C at 25% moisture content. Granule size distribution was further confirmed via scanning electron microscopy which showed the HMT effects. These results increased the understanding on molecular and structural properties of HMT pinhão starch and broadened its food and nonfood industrial applications.     

A modified particle swarm optimization with multiple subpopulations for multimodal function optimization problems

In this paper, a modified particle swarm optimization (PSO) algorithm is developed for solving multimodal function optimization problems. The difference between the proposed method and the general PSO is to split up the original single population into several subpopulations according to the order of particles. The best particle within each subpopulation is recorded and then applied into the velocity updating formula to replace the original global best particle in the whole population. To update all particles in each subpopulation, the modified velocity formula is utilized. Based on the idea of multiple subpopulations, for the multimodal function optimization the several optima including the global and local solutions may probably be found by these best particles separately. To show the efficiency of the proposed method, two kinds of function optimizations are provided, including a single modal function optimization and a complex multimodal function optimization. Simulation results will demonstrate the convergence behavior of particles by the number of iterations, and the global and local system solutions are solved by these best particles of subpopulations.     

An adaptive local search algorithm for vehicle routing problem with simultaneous and mixed pickups and deliveries

The Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD) is an extension to the classical Vehicle Routing Problem (VRP), where customers may both receive and send goods simultaneously. The Vehicle Routing Problem with Mixed Pickup and Delivery (VRPMPD) differs from the VRPSPD in that the customers may have either pickup or delivery demand. However, the solution approaches proposed for the VRPSPD can be directly applied to the VRPMPD. In this study, an adaptive local search solution approach is developed for both the VRPSPD and the VRPMPD, which hybridizes a Simulated Annealing inspired algorithm with Variable Neighborhood Descent. The algorithm uses an adaptive threshold function that makes the algorithm self-tuning. The proposed approach is tested on well-known VRPSPD and VRPMPD benchmark instances derived from the literature. The computational results indicate that the proposed algorithm is effective in solving the problems in reasonable computation time.     

The robust knapsack problem with queries

We consider robust knapsack problems where item weights are uncertain. We are allowed to query an item to find its exact weight,where the number of such queries is bounded by a given parameter Q. After these queries are made, we need to pack the items robustly, i.e., so that the choice of items is feasible for every remaining possible scenario of item weights.The central question that we consider is: Which items should be queried in order to gain maximum profit? We introduce the notion of query competitiveness for strict robustness to evaluate the quality of an algorithm for this problem, and obtain lower and upper bounds on this competitiveness for interval-based uncertainty. Similar to the study of online algorithms, we study the competitiveness under different frameworks, namely we analyze the worst-case query competitiveness for deterministic algorithms, the expected query competitiveness for randomized algorithms and the average case competitiveness for known distributions of the uncertain input data. We derive theoretical bounds for these different frameworks and evaluate them experimentally. We also extend this approach to Γ-restricted uncertainties introduced by Bertsimas and Sim.Furthermore, we present heuristic algorithms for the problem. In computational experiments considering both the interval-based and the Γ-restricted uncertainty, we evaluate their empirical performance. While the usage of a Γ-restricted uncertainty improves the nominal performance of a solution (as expected), we find that the query competitiveness gets worse.     

A model for semiconductor quantum dot molecule based on the current spin density functional theory

Based on the current spin density functional theory, a theoretical model of three vertically aligned semiconductor quantum dots is proposed and numerically studied. This quantum dot molecule (QDM) model is treated with realistic hard-wall confinement potential and external magnetic field in three-dimensional setting. Using the effective-mass approximation with band nonparabolicity, the many-body Hamiltonian results in a cubic eigenvalue problem from a finite difference discretization. A self-consistent algorithm for solving the Schrödinger-Poisson system by using the Jacobi-Davidson method and GMRES is given to illustrate the Kohn-Sham orbitals and energies of six electrons in the molecule with some magnetic fields. It is shown that the six electrons residing in the central dot at zero magnetic field can be changed to such that each dot contains two electrons with some feasible magnetic field. The Förster-Dexter resonant energy transfer may therefore be generated by two individual QDMs. This may motivate a new paradigm of Fermionic qubits for quantum computing in solid-state systems.     

Optimal H∞ general distance problem with degree constraint

In this paper the optimal H_∞, general distance problem, for continuous-time systems, with a prescribed degree on the solution is studied. The approach is based on designing the Hankel singular values using an imbedding idea. The problem is first imbedded into another problem with desirable characteristics on the Hankel singular values, then the solution to the original problem is retracted via a compression. The result is applicable to both the one-block and the four-block problems. A special case is given for illustration.     

二维多孔数控钻床加工路径的生成及优化

印刷电路板 PCB的加工是二维多孔数控钻的典型。实践表明加工同一零件不同的走刀路径其长度相差极大。为提高生产率 ,应使刀具的走刀路径尽量短 ,这其实是大型的 TSP问题。本文提出了几种路径的生成方法 ,分析了各自的适用场合。并用实例验证所提出的路径生成方法可极大地提高实际钻孔的加工效率。     

一种新的加权最小二乘测距定位方法

三站二维定位问题是最小定位问题，一般只利用几何关系就能获得定位估计，但由于未利用距离测量的统计信息，定位精度较差。该文先将点到点的距离测量转化为点到线的距离估计，再在此基础上推导出一种新的加权几休定位方法，其中加权的确定利用了距离测量的统计信息。仿真实验表明，在测距误差较小时新方法具有更高的定位精度。     

The solution of the inverse problem of gravitational potential using a set of measurements of different field elements

A numerical solution of the inverse problem of the gravitational field at a single point is obtained using six field elements for a point, a spherical cap, a differential spherical sector and a vertical segment. In the system of six equations obtained, the unknowns are the mass of the body, the depth of its center, and the second, third, and fourth degree moments. The accuracy of the solution of this system is ten times higher than when using three field elements. __________ Translated from Izmeritel’naya Tekhnika, No. 5, pp. 3–8, May, 2007.