A Genetic Algorithm for Solving a Capacitated p-Median Problem

Facility-location problems have several applications, such as telecommunications, industrial transportation and distribution. One of the most well-known facility-location problems is the p-median problem. This work addresses an application of the capacitated p-median problem to a real-world problem. We propose a genetic algorithm (GA) to solve the capacitated p-median problem. The proposed GA uses not only conventional genetic operators, but also a new heuristic “hypermutation” operator suggested in this work. The proposed GA is compared with a tabu search algorithm.     

Synthese und Eigenschaften von Sr3Mo1.5Zn0.5O7‐δ, einer Phase mit perowskitverwandter Schichtstruktur

Synthesis and Properties of the Layered Perovskite Phase Sr₃Mo_1.5Zn_0.5O_7‐δ The new layered perovskite phase Sr₃Mo_1.5Zn_0.5O_7‐δ was synthesized by solid state reaction using a Zn/ZnO oxygen buffer. The crystal structure was refined from X‐ray powder pattern by the Rietveld method. The compound crystallizes tetragonal in the space group I4/mmm (no. 139) with the lattice parameters a = 3.9631(3) Å, c = 20.583(1) Å. An oxygen deficiency corresponding to δ ≈ 0.25 was determinated, indicating the presence of molybdenum in mixed valence (Mo⁴⁺ and Mo⁶⁺).     

An eulerian trail traversing specified edges in given order

The following results are proved in this paper. Let G be a 2k-edge-connected eulerian graph. (i) For every set {e₁, e₂, ?, e_2k+1} ? E(G) there is an eulerian trail T of the form e₁, e₂, ?, e_2k+1, ?. (ii) For every set E* = {e₁, e₂, ?, e_k} ? E(G) there is an eulerian trail T = e₁, ?, e₂, ?, e_k, ? in which the elements of E* are traversed in accordance with a prescribed orientation. © 1995 John Wiley & Sons, Inc.