Many major cities suffer from severe traffic congestion. Road expansion in the cites is usually infeasible, and an alternative way to alleviate traffic congestion is to coordinate the route of vehicles. Various path selection and planning algorithms are thus proposed, but most existing methods only plan paths separately and provide un-coordinated solutions. Recently, an analogy between the coordination of vehicular routes and the interaction of polymers is drawn; the spin glass theory in statistical physics is employed to optimally coordinate transportation routes. To further examine the advantages brought by path coordination, we incorporate the link congestion function developed by the Bureau of Public Roads (BPR) into the polymer routing algorithm. We then estimate in simulations the traveling time of all users saved by the polymer-BPR algorithm in randomly generated networks and real transportation networks in major cities including London, New York and Beijing. We found that a large amount of traveling time is saved in all studied networks, suggesting that the approach inspired by polymer physics is effective in minimizing the traveling time via path coordination, which is a promising tool for alleviating traffic congestions.