SASEGASA: A New Generic Parallel Evolutionary Algorithm for Achieving Highest Quality Results

This paper presents a new generic Evolutionary Algorithm (EA) for retarding the unwanted effects of premature convergence. This is accomplished by a combination of interacting generic methods. These generalizations of a Genetic Algorithm (GA) are inspired by population genetics and take advantage of the interactions between genetic drift and migration. In this regard a new selection scheme is introduced, which is designed to directedly control genetic drift within the population by advantageous self-adaptive selection pressure steering. Additionally this new selection model enables a quite intuitive heuristics to detect premature convergence. Based upon this newly postulated basic principle the new selection mechanism is combined with the already proposed Segregative Genetic Algorithm (SEGA), an advanced Genetic Algorithm (GA) that introduces parallelism mainly to improve global solution quality. As a whole, a new generic evolutionary algorithm (SASEGASA) is introduced. The performance of the algorithm is evaluated on a set of characteristic benchmark problems. Computational results show that the new method is capable of producing highest quality solutions without any problem-specific additions.     

A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows

The aim of this paper is to propose an algorithm based on the philosophy of the Variable Neighborhood Search (VNS) to solve Multi Depot Vehicle Routing Problems with Time Windows. The paper has two main contributions. First, from a technical point of view, it presents the first application of a VNS for this problem and several design issues of VNS algorithms are discussed. Second, from a problem oriented point of view the computational results show that the approach is competitive with an existing Tabu Search algorithm with respect to both solution quality and computation times.     

Capacity Constrained Transit Assignment with Common Lines

This paper proposes the use of absorbing Markov chains to solve the capacity constrained transit network loading problem taking common lines into account. The approach handles congested transit networks, where some passengers will not be able to board because of the absence of sufficient space. The model also handles the common lines problem, where choice of route depends on frequency of arrivals. The mathematical formulation of the problem is presented together with a numerical example. This revised version was published online in July 2006 with corrections to the Cover Date.     

Effect of maltodextrins on the surface activity of small-molecule surfactants

We report on the effect of commercially important polysaccharides (maltodextrins with variable dextrose equivalent (Paselli SA-2, MD-6 and MD-10) on the surface activity at the air–water interface of small-molecule surfactants (sms), possessing different hydrophobic–lipophilic balance ((SSL (Na⁺), the main component is a sodium salt of stearol–lactoyl lactic acid, and PGE (080), polyglycerol ester of C18 fatty acid), and widely used in food products. A marked change of the surface activity of sms was found in the presence of maltodextrins by tensiometry. The combined data of laser multiangle light scattering and mixing calorimetry have suggested that this result is governed by specific complex formation between maltodextrins and sms in aqueous medium. Measurements have been made of the molar mass, the second virial coefficient and the enthalpy of intermolecular interactions in aqueous solutions. The implication of a degree of polymerization of maltodextrins in this phenomenon was shown. The interrelation between the molecular parameters of the formed complexes and their surface activity at the air–water interface has been revealed and discussed.     

The many facets of linear programming

We examine the history of linear programming from computational, geometric, and complexity points of view, looking at simplex, ellipsoid, interior-point, and other methods. Received: June 22, 2000 / Accepted: April 4, 2001?Published online October 2, 2001