Modeling The Wireless Network Location Problem And Its Algorithm

Along with the development of economy, optimization becomes very important in the daily production, in reality, decision makers often want to optimize multiple conflicting targets at the same time, and because of multi-objective evolutionary algorithms’easy operation and strong adaptability, it has gradually become the main method to solve the multi-objective optimization problem. Combining the development of the Internet and Internet+, this paper studies two kind location problem including 4G Heterogeneous Network Base Stations Location Problem and Car Networking Roadside Unit Location Problem.4G Heterogeneous Network is the superposition in the same area of 4G networks, embodied in multiple small base stations which means in order to avoid network congestion adds multiple 4G small base station supplying customers with service jointly in the area already having been covered with 4G signal. And the base station planning is a planning that in order to meet user’demand for data transmission in the planning area, build base stations at the right position and make network signal cover the whole planning area.4G heterogeneous network base station planning is more complicated than the average 4G base stations planning, this paper based on the reality simplifies the model, and make a series of pretreatment to the area. The model maximize the coverage of the 4 G heterogeneous network, maximize the capacity and minimize the cost of the base stations. At the same time, the model consider the interference between all size base stations. In order to more effectively to solve this model, this paper adds decomposition and local search mechanism to the traditional evolutionary multi-objective algorithm, through the computer simulation, the improved algorithm can more effectively get the of the model, and "more effectively" here refers to "efficiency" and "distribution".Rely On roadside Unit(Road Site Unit) and on-board Unit(On Board Unit) car networking link to the network, and car networking can supply real-time useful data to drivers and make driving safer and more comfortable. Roadside units should consider the vehicle’s speed, vehicle density in the cover area and the popular place which is near the RSU. At the same time this paper considers cooperative car- way communication principle, in order to supply more cooperative chance in the roadside unit distribution scheme and reduce the economic loss in the future. This paper established a new type of roadside location model which maximize coverage, maximize cooperative roadside units and minimize the cost. This paper also applies multi-objective evolutionary algorithm based on decomposition and local search to solve this model, through the computer simulation, the improved algorithm can effectively obtain the feasible solutions of the model, but this model involves multiple parameters, so before simulation it should set right parameter values according to the specific planning areas.