Phospholipid-covered solid supports have been used successfully as model membranes in studies on blood coagulation and other research fields. In order to produce such membranes, simple exposure of the support to suspensions of phospholipid vesicles was recently introduced, but questions have remained about the process of vesicle adherence to the surface and the physico-chemical properties of th...

Dynamic Optimization Problems (DOPs) have attracted a growing interest in recent years. This interest is mainly due to two reasons: their closeness to practical real conditions and their high complexity. The majority of the approaches proposed so far to solve DOPs are population-based methods, because it is usually believed that their higher diversity allows a better detection and tracking of c...

The best performing methods for Dynamic Optimization Problems (DOPs) are usually based on a set of agents that can have different complexity (like solutions in Evolutionary Algorithms, particles in Particle Swarm Optimization, or metaheuristics in hybrid cooperative strategies). While methods based on low-complexity agents are widely applied in DOPs, the use of more “intelligent” agents has rar...

The multipopulation method has been widely used to solve dynamic optimization problems (DOPs) with the aim of maintaining multiple populations on different peaks to locate and track multiple changing optima simultaneously. However, to make this approach effective for solving DOPs, two challenging issues need to be addressed. They are how to adapt the number of populations to changes and how to ...

In recent years, there has been a growing interest in addressing dynamic optimization problems (DOPs) using evolutionary algorithms (EAs). Several approaches have been developed for EAs to increase the diversity of the population and enhance the performance of the algorithm for DOPs. Among these approaches, immigrants schemes have been found beneficial for EAs for DOPs. In this paper, random, e...

Ant colony optimization (ACO) algorithms have proved that they can adapt to dynamic optimization problems (DOPs) when they are enhanced to maintain diversity. DOPs are important due to their similarities to many real-world applications. Several approaches have been integrated with ACO to improve their performance in DOPs, where memory-based approaches and immigrants schemes have shown good resu...

Usually, discrete optimization problems (DOPs) from applications have a special structure, and the matrices of constraints for largescale problems have a lot of zero elements (sparse matrices). One of the promising ways to exploit sparsity in the interaction graph of the DOP is nonserial dynamic programming (NSDP), which allows to compute a solution in stages such that each of them uses results...

To understand the mechanism of Saposin C-membrane binding at low pH, several molecular dynamics (MD) simulations of saposin C with 1,2-dioleoyl-sn-glycero-3-phosphatidylserine (DOPS 18; 1) or modified DOPS were performed in the default charge states at neutral pH or, based on the pKa calculations, with some protonated acidic residues to approximate low pH conditions. It was found that the elect...