Spatiotemporal Characteristics and Self-Organization of Urban Taxi Dispatch

Figure 1

A simple example of the Hungarian method. (a) This is a simple bipartite network where the value on each edge is matching cost. Red circles indicate the matched nodes and blue circles indicate the unmatched nodes. (b) Firstly, let node 1 match node 4. Now, the matching degree is 1. (c) Node 2 can only link with node 4. Although node 4 has already matched node 1, it can be replaced by node 6 at the same cost. Therefore, let node 1 match node 6 instead and node 2 matching node 4 can give a minimum cost. So, the matching degree becomes 2. (d) Finally, let node 3 match the node 5. In this example, the maximum matching degree is 3 at minimum cost.

(a)

(b)

(c)

(d)