An improved artificial bee colony algorithm for optimal land-use allocation

Land-use allocation is of great importance for rapid urban planning and natural resource management. This article presents an improved artificial bee colony (ABC) algorithm to solve the spatial optimization problem. The new approach consists of a heuristic information-based pseudorandom initialization (HIPI) method for initial solutions and pseudorandom search strategy based on a long-chain (LC) mechanism for neighborhood searches; together, these methods substantially improve the search efficiency and quality when handling spatial data in large areas. We evaluated the approach via a series of land-use allocation experiments and compared it with particle swarm optimization (PSO) and genetic algorithm (GA) methods. The experimental results show that the new approach outperforms the current methods in both computing efficiency and optimization quality.     

An approach for computing routes without complicated decision points in landmark-based pedestrian navigation

During navigation, a pedestrian needs to recognize a landmark at a certain decision point. If a potential landmark located at a decision point is complicated to recognize, the complexity of the decision point is significantly increased. Thus, it is important to compute routes that avoid complicated decision points (CDPs) but still achieve optimal navigation performance. In this paper, we propose an approach for computing routes that avoid CDPs while optimizing the performance of landmark-based pedestrian navigation. The approach includes (1) a model for identifying CDPs based on the structures of pedestrian networks and landmark data in real scenes, and (2) a modified genetic algorithm for computing routes that avoid the identified CDPs and find the shortest route possible. To demonstrate the advantages and effectiveness of the proposed approach, we conducted an empirical study on the pedestrian network in a real-world scenario. The experimental results show that our approach can effectively avoid CDPs while still minimizing travel distance. Furthermore, our approach can provide the routes with the shortest travel distance if the distances of the routes without CDPs exceed a certain threshold.