Research On Optimized Locating Method Based On Timing Bipartite Graph And Its Web Implementation

With the increasing degree of our aging population, health care and pension issues are becoming serious, it is urgent to construct an information platform to supply services to these old people in the community. The platform can attract a lot of agencies to response to the service requests, assigning qualified staff to provide services. The key to the platform is to realize a service request and response process, while dispatching is the most important part of the process.Based on the functional requirements in this platform, a multi-role cooperation dispatching subsystem is implemented after designing. Firstly, the paper studies the task assignment problem and a variety of its deformation. After introducing the bipartite graph and matching theory, it puts forward an iterative incremental dispatching method which can meet the sequential constraints and gain the biggest match. The method introduces "cloned law" so that one person can do a number of different sequential tasks. A model called sequential bipartite graph is also built, but it needs judge and filter conflict sides. The method is still based on classic Hungarian algorithm, but it can find a bigger match due to the timing distribution. The effectiveness of the method is verified through an actual example. During development, the paper analyses the roles in the service request and response process, and builds models for the multi-role cooperation. It proves that the dispatching subsystem can meet the current demands through testing.