| Due to the rapid development of economy, the problem of environmental pollution and resource scarcity is becoming more and more serious. It is urgent to develop and use new energy sources, so electric vehicles are beginning to attract the attention of people. As the key infrastructure for the operation and maintenance of vehicles, the charging station is the key part of the development and promotion of electric vehicles. So how to locate the charging stations reasonably and economically is an urgent problem to be solved. Research on locating has been studied for a long time, and the research of locating the charging station of electric vehicles has also been studied a lot in recent years.In this paper, there are several kinds of locating models, namely: P-median model, P-center model, Set covering model, Maximum covering locating problem and Generalized maximum covering locating problem. Researches on locating charging stations before are based on the traditional coverage problem. Therefore the paper follows a new point of view, namely the concept of generalized maximum coverage problem to study the locating of charging stations. The difference between it and the traditional coverage problem is that the coverage of user’s needs is no longer individual coverage but cooperative coverage. There are not only “full coverage” and “incomplete coverage”, a new concept of “partial coverage” is proposed. And each charging station has different degree coverage of demand, with the coverage degree decays over the distance. In this paper, we mainly study two assumptions of the GMCLP, thus Gradual cover model and Cooperative cover. Then we combined them with the electric vehicle charging logics to design two locating models with mixed integer programming based on gradual coverage and cooperative coverage, and the two models are described in detail. Finally, we solve the two locating models with a specific case by CPLEX with branch and bound method and analysis the solution. |
PDF Full Text Request