A matrix method for finding last common nodes in an origin-based traffic assignment problem

► A matrix method for finding the last common nodes in Bar-Gera's algorithm is presented. ► Matrix computation makes Bar-Gera's algorithm more easily implemented. ► The overall computing time is 10 times better than the theoretical estimation.