Test Instances for the Multicommodity Flow Problem: An Erratum

Abstract

This note is an erratum to Babonneau et al. (2006) in which some data were incorrectly described. In Babonneau et al. (2006), the ACCPM method is used to solve the linear multicommodity flow problem on four sets of instances, i.e., the planar and the grid instances, some telecommunication problems, and some transportation problems, from Bar-Gera (2007), http://www.bgu.ac.il/~bargera/tntp/ (Sioux Falls, Winnipeg, Barcelona, Chicago region, and Philadelphia). The mistakes concern the last category of instances. The new data and the associated results can now be found in the electronic companion at http://or.journal.informs.org/. This site also provides the full information on test instances in the multicommodity flow problem (MCF) and the traffic assignment problem to facilitate benchmarking. It gives the data and the results using three specific objective functions used in the literature, e.g., Bureau of Public Roads (BPR), Kleinrock, or linear. For more details on the optimization problem, we refer the reader to Babonneau et al. (2006) and Babonneau and Vial (2007).