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.     

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.     

Restructuring bank networks after mergers and acquisitions: A capacitated delocation model for closing and resizing branches

During restructuring processes, due to mergers and acquisitions, banks frequently face the problem of having redundant branches competing in the same market. In this work, we introduce a new Capacitated Branch Restructuring Model which extends the available literature in delocation models. It considers both closing down and long term operations׳ costs, and addresses the problem of resizing open branches in order to maintain a constant service level. We consider, as well, the presence of competitors and allow for ceding market share whenever the restructuring costs are prohibitively expensive.We test our model in a real life scenario, obtaining a reduction of about 40% of the network size, and annual savings over 45% in operation costs from the second year on. We finally perform a sensitivity analysis on critical parameters. This analysis shows that the final design of the network depends on certain strategic decisions concerning the redundancy of the branches, as well as their proximity to the demand nodes and to the competitor׳s branches. At the same time, this design is quite robust to changes in the parameters associated with the adjustments on service capacity and with the market reaction.     

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.     

Allocentric Versus Egocentric Spatial Memory After Unilateral Temporal Lobectomy in Humans.

Thirty patients who had undergone either a right or left unilateral temporal lobectomy (14 RTL; 16 LTL) and 16 control participants were tested on a computerized human analogue of the Morris Water Maze. The procedure was designed to compare allocentric and egocentric spatial memory. In the allocentric condition, participants searched for a target location on the screen, guided by object cues. Between trials, participants had to walk around the screen, which disrupted egocentric memory representation. In the egocentric condition, participants remained in the same position, but the object cues were shifted between searches to prevent them from using allocentric memory. Only the RTL group was impaired on the allocentric condition, and neither the LTL nor RTL group was impaired on additional tests of spatial working memory or spatial manipulation. The results support the notion that the right anterior temporal lobe stores long-term allocentric spatial memories. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

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.     

SUN工作站的EEPROM浅析

ＥＥＰＲＯＭ的参数设置控制着系统的基本功能，设置的改变对系统的起动和运行起着重要作用。本文详细地列出了ＥＥＰＲＯＭ的地址分配表，并通过上机实验对那些重要的地址了详细的说明。     

基于CDMA智能网平台的增值业务--"位置服务"

本主要介绍基于CDMA智能网平台的一种增值业务——“位置服务”，阐述这个业务的网络结构、涉及到的技术问题和解决方案，并将这个整体思路投入到开发业务中去。