Search

Evaluation on urban commercial centers' attractiveness not only benefits business strategy making and location choice, but also helps traffic management and urban planning. Traditionally, it is studied using questionnaires and field research, which are labor-intensive and time-consuming. To overcome these problems when evaluating the urban commercial centers' attractiveness, massive data analytics with datasets from taxi traffic, population, area, and road networks are adopted in this paper. Taking fifteen commercial centers at Shenzhen as a case study, a Cyber-Physical-Social System is built up to deal with these massive data for statistical analysis. An "Attractiveness Degree Model" is proposed to describe the degree to which customers desire to visit a commercial center. Then attractiveness thematic maps are drawn. Results show that YiTianJiaRiGuangChang has the highest attractiveness degree even though it has a small size and low commercial value. The attractiveness degree rankings are corroborated by annual customer satisfaction survey from Shenzhen Retail Business Association. Attractiveness thematic maps show that about 50–65% visits by taxis are within 5 km range. These results can be applied to support market analysis, urban planning, traffic management, and related areas. • Commercial center is precisely defined geographically and sociologically. • Attractiveness degree is the proposed metric to evaluate the attractiveness. • A Cyber-Physical-Social System is implemented for massive data processing. • Statistical analysis and thematic maps shed new insights into attractiveness. • Commercial centers are classified into four representative types in China. [ABSTRACT FROM AUTHOR]

This paper carries out the mechanism analysis of non-inertial particle swarm optimization. It is a modified algorithm based on a new kinetic equation which is applied to the prediction of non-stationary time series for the internet of things in the edge computing. In order to avoid premature convergence and accelerate convergence rate, different from standard particle swarm optimization, the modified algorithm uses a new kinetic equation to lead particles motion direction, besides generalized opposition-based learning (GOBL) and adaptive elite mutation (AEM) strategies. The work presents the second order standardized recurrence equation for the new kinetic equation whose corresponding characteristic equations can be analyzed via the difference functions to obtain the boundaries of coefficients and its convergence region. Besides, GOBL and AEM strategies are also analyzed to boost global and local convergence of the algorithm as an interpretation. It is illustrated that performance analysis of the algorithm with two well-known test functions. The good performance is further validated from application in edge computing. [ABSTRACT FROM AUTHOR]