A generational scheme for partitioning graphs

Graph partitioning divides a graph into several pieces by cutting edges. Very effective heuristic partitioning algorithms have been developed which run in real-time, but it is unknown how good the partitions are since the problem is, in general, NP-complete. This paper reports an evolutionary search algorithm for finding benchmark partitions. Distinctive features are the transmission and modification of whole subdomains (the partitioned units) that act as genes, and the use of a multilevel heuristic algorithm to effect the crossover and mutations. Its effectiveness is demonstrated by improvements on previously established benchmarks.

Forward and inverse transport of particulate matter and gaseous pollutants affecting the region bordering the English Channel

The ATTMA "Aerosol Transport in the Trans-Manche Atmosphere" project investigates the transportation and dispersion of air pollutants across the English Channel, in collaboration with local authorities and other Universities in Southern England and Northern France. The research is concerned with both forward and inverse (receptor based) tracking. Two alternative dispersion simulation methods are used: (a) Lagrangian Particle Dispersion (LPD) models, (b) Eulerian Finite Volume type models. This paper is concerned with part (a), the simulations based on LPD models. Two widely applied LPD models are used and compared. Since in many observed episodes the source of pollution is traced outside the region of interest, long range, trans-continental transport is also investigated.