In this paper,we have constructed a matrix of connected graph with the impact of various demand points of *** to the limit of the service radius of the parking lot,the continuous problem can be *** firstly classify th...
详细信息
In this paper,we have constructed a matrix of connected graph with the impact of various demand points of *** to the limit of the service radius of the parking lot,the continuous problem can be *** firstly classify the demand points by rough clustering and meticulous clustering,*** then,a 0-1 plan model which satisfy the need of every demand point and the objective function being the least number of the parking lots is *** results show that model is adaptable to the area with comparatively fewer demand points.
暂无评论