The prediction of the behavior of people in a disaster has a useful role to play in the design of urban structures such as department stores, schools, and office buildings. We focus on using emergency exit signs to ef...The prediction of the behavior of people in a disaster has a useful role to play in the design of urban structures such as department stores, schools, and office buildings. We focus on using emergency exit signs to effectively guide the evacuation of people on a floor with a dynamically changing layout. A multi-agent simulation is developed to simulate the behavior of evacuees on a floor. A mathematical model is constructed to obtain optimal sign locations to efficiently assist evacuation under the condition that obstacles are dynamically generated on the floor. The optimal sign locations are calculated by the mathematical model. Then, the developed simulation is performed to evaluate the effectiveness of the emergency exit signs and the behavior of evacuees on simple layout models using the calculated optimal sign locations.展开更多
We extended an improved version of the discrete particle swarm optimization (DPSO) algorithm proposed by Liao et al.(2007) to solve the dynamic facility layout problem (DFLP). A computational study was performed with ...We extended an improved version of the discrete particle swarm optimization (DPSO) algorithm proposed by Liao et al.(2007) to solve the dynamic facility layout problem (DFLP). A computational study was performed with the existing heuristic algorithms, including the dynamic programming (DP), genetic algorithm (GA), simulated annealing (SA), hybrid ant system (HAS), hybrid simulated annealing (SA-EG), hybrid genetic algorithms (NLGA and CONGA). The proposed DPSO algorithm, SA, HAS, GA, DP, SA-EG, NLGA, and CONGA obtained the best solutions for 33, 24, 20, 10, 12, 20, 5, and 2 of the 48 problems from (Balakrishnan and Cheng, 2000), respectively. These results show that the DPSO is very effective in dealing with the DFLP. The extended DPSO also has very good computational efficiency when the problem size increases.展开更多
In online dynamic graph drawing,constraints over nodes and node pairs help preserve a coherent mental map in a sequence of graphs.Defining the constraints is challenging due to the requirements of both preserving ment...In online dynamic graph drawing,constraints over nodes and node pairs help preserve a coherent mental map in a sequence of graphs.Defining the constraints is challenging due to the requirements of both preserving mental map and satisfying the visual aesthetics of a graph layout.Most existing algorithms basically depend on local changes but fail to do proper evaluations on the global propagation when setting constraints.To solve this problem,we introduce a heuristic model derived from PageRank which simulates the node movement as an inverse Markov process hence to give a global analysis of the layout's change,according to which different constraints can be set.These constraints,along with stress function,generate layouts maintaining spatial positions and shapes of relatively stable substructures between adjacent graphs.Experiments demonstrate that our method preserves both structure and position similarity to help users track graph changes visually.展开更多
文摘The prediction of the behavior of people in a disaster has a useful role to play in the design of urban structures such as department stores, schools, and office buildings. We focus on using emergency exit signs to effectively guide the evacuation of people on a floor with a dynamically changing layout. A multi-agent simulation is developed to simulate the behavior of evacuees on a floor. A mathematical model is constructed to obtain optimal sign locations to efficiently assist evacuation under the condition that obstacles are dynamically generated on the floor. The optimal sign locations are calculated by the mathematical model. Then, the developed simulation is performed to evaluate the effectiveness of the emergency exit signs and the behavior of evacuees on simple layout models using the calculated optimal sign locations.
文摘We extended an improved version of the discrete particle swarm optimization (DPSO) algorithm proposed by Liao et al.(2007) to solve the dynamic facility layout problem (DFLP). A computational study was performed with the existing heuristic algorithms, including the dynamic programming (DP), genetic algorithm (GA), simulated annealing (SA), hybrid ant system (HAS), hybrid simulated annealing (SA-EG), hybrid genetic algorithms (NLGA and CONGA). The proposed DPSO algorithm, SA, HAS, GA, DP, SA-EG, NLGA, and CONGA obtained the best solutions for 33, 24, 20, 10, 12, 20, 5, and 2 of the 48 problems from (Balakrishnan and Cheng, 2000), respectively. These results show that the DPSO is very effective in dealing with the DFLP. The extended DPSO also has very good computational efficiency when the problem size increases.
基金supported by the National Key Research and Development Program of China under Grant No.2017YFB0701900the National Natural Science Foundation of China under Grant No.61100053the Key Laboratory of Machine Perception of Peking University under Grant No.K-2019-09.
文摘In online dynamic graph drawing,constraints over nodes and node pairs help preserve a coherent mental map in a sequence of graphs.Defining the constraints is challenging due to the requirements of both preserving mental map and satisfying the visual aesthetics of a graph layout.Most existing algorithms basically depend on local changes but fail to do proper evaluations on the global propagation when setting constraints.To solve this problem,we introduce a heuristic model derived from PageRank which simulates the node movement as an inverse Markov process hence to give a global analysis of the layout's change,according to which different constraints can be set.These constraints,along with stress function,generate layouts maintaining spatial positions and shapes of relatively stable substructures between adjacent graphs.Experiments demonstrate that our method preserves both structure and position similarity to help users track graph changes visually.
