The single vehicle routing problem with toll-by-weight scheme: A branch-and-bound approach

► Examined a single vehicle routing problem with a toll-by-weight scheme used in China. ► Devised a branch-and-bound (B&B) approach with a new lower bound measure. ► Devised five dominance checkers to reduce the search space of the B&B approach. ► Our approach outperforms existing approaches for the minimum latency problem. ► Generated new test data based on the expressway networks of two Chinese provinces.