Pedestrian flows in bounded domains with obstacles

In this paper we systematically apply the mathematical structures by time-evolving measures developed in a previous work to the macroscopic modeling of pedestrian flows. We propose a discrete-time Eulerian model, in which the space occupancy by pedestrians is described via a sequence of Radon positive measures generated by a push-forward recursive relation. We assume that two fundamental aspects of pedestrian behavior rule the dynamics of the system: On the one hand, the will to reach specific targets, which determines the main direction of motion of the walkers; on the other hand, the tendency to avoid crowding, which introduces interactions among the individuals. The resulting model is able to reproduce several experimental evidences of pedestrian flows pointed out in the specialized literature, being at the same time much easier to handle, from both the analytical and the numerical point of view, than other models relying on nonlinear hyperbolic conservation laws. This makes it suitable to address two-dimensional applications of practical interest, chiefly the motion of pedestrians in complex domains scattered with obstacles.Comment: 25 pages, 9 figure

Time-evolving measures and macroscopic modeling of pedestrian flow

This paper deals with the early results of a new model of pedestrian flow, conceived within a measure-theoretical framework. The modeling approach consists in a discrete-time Eulerian macroscopic representation of the system via a family of measures which, pushed forward by some motion mappings, provide an estimate of the space occupancy by pedestrians at successive time steps. From the modeling point of view, this setting is particularly suitable to treat nonlocal interactions among pedestrians, obstacles, and wall boundary conditions. In addition, analysis and numerical approximation of the resulting mathematical structures, which is the main target of this work, follow more easily and straightforwardly than in case of standard hyperbolic conservation laws, also used in the specialized literature by some Authors to address analogous problems.Comment: 27 pages, 6 figures -- Accepted for publication in Arch. Ration. Mech. Anal., 201

Force-imitated particle swarm optimization using the near-neighbor effect for locating multiple optima

Copyright @ Elsevier Inc. All rights reserved.Multimodal optimization problems pose a great challenge of locating multiple optima simultaneously in the search space to the particle swarm optimization (PSO) community. In this paper, the motion principle of particles in PSO is extended by using the near-neighbor effect in mechanical theory, which is a universal phenomenon in nature and society. In the proposed near-neighbor effect based force-imitated PSO (NN-FPSO) algorithm, each particle explores the promising regions where it resides under the composite forces produced by the “near-neighbor attractor” and “near-neighbor repeller”, which are selected from the set of memorized personal best positions and the current swarm based on the principles of “superior-and-nearer” and “inferior-and-nearer”, respectively. These two forces pull and push a particle to search for the nearby optimum. Hence, particles can simultaneously locate multiple optima quickly and precisely. Experiments are carried out to investigate the performance of NN-FPSO in comparison with a number of state-of-the-art PSO algorithms for locating multiple optima over a series of multimodal benchmark test functions. The experimental results indicate that the proposed NN-FPSO algorithm can efficiently locate multiple optima in multimodal fitness landscapes.This work was supported in part by the Key Program of National Natural Science Foundation (NNSF) of China under Grant 70931001, Grant 70771021, and Grant 70721001, the National Natural Science Foundation (NNSF) of China for Youth under Grant 61004121, Grant 70771021, the Science Fund for Creative Research Group of NNSF of China under Grant 60821063, the PhD Programs Foundation of Ministry of Education of China under Grant 200801450008, and in part by the Engineering and Physical Sciences Research Council (EPSRC) of UK under Grant EP/E060722/1 and Grant EP/E060722/2

Multi-population-based differential evolution algorithm for optimization problems

A differential evolution (DE) algorithm is an evolutionary algorithm for optimization problems over a continuous domain. To solve high dimensional global optimization problems, this work investigates the performance of differential evolution algorithms under a multi-population strategy. The original DE algorithm generates an initial set of suitable solutions. The multi-population strategy divides the set into several subsets. These subsets evolve independently and connect with each other according to the DE algorithm. This helps in preserving the diversity of the initial set. Furthermore, a comparison of combination of different mutation techniques on several optimization algorithms is studied to verify their performance. Finally, the computational results on the arbitrarily generated experiments, reveal some interesting relationship between the number of subpopulations and performance of the DE. Centralized charging of electric vehicles (EVs) based on battery swapping is a promising strategy for their large-scale utilization in power systems. In this problem, the above algorithm is designed to minimize total charging cost, as well as to reduce power loss and voltage deviation of power networks. The resulting algorithm and several others are executed on an IEEE 30-bus test system, and the results suggest that the proposed algorithm is one of effective and promising methods for optimal EV centralized charging