OR-Library is a collection of test data sets for a variety of OR problems.
A full list of the test data sets available in OR-Library can be found here.
There are currently 6 data files. These were files were contributed by Lang Fan (L.Fan@cs.cardiff.ac.uk) and Christine Mumford (C.L.Mumford@cs.cardiff.ac.uk) to whom questions should be directed There are three data sets in six files consisting of a transit demand matrix and a transit time matrix for each of the three urban transit routing problem: I) Mandl's Swiss Network (15 Nodes and 21 Links Network). Files td1.txt and tt1.txt (td for demand, tt for time) II) 50 Nodes and 65 Links Network generated based on joining three copies of Mandl's Network. Files td2.txt and tt2.txt III) 110 Nodes and 275 Links Network generated based on a bus map for a major British city. Files td3.txt and tt3.txt The structure of these matrices we used is shown as follows: Node_Number 0 1 2 3 4 5 6 7 8... 0 . . . . . . . . . 1 . 2 . 3 . 4 . 5 . 6 . 7 . 8 . . . . Please note: 1.The transit time between each pair of nodes is measured by minutes. 2.The transit time is recorded as "-" between nodes that are not directly connected. 3.All the matrices are symmetric. 4.The row and column headings (i.e., node numbers) are not included in the matrix. Mandl's Swiss Network was published in his book: (C.E.Mandl,Applied Network Optimization,Academic,London,1979) Comparison results for some researchers' experiments on Mandl's network were published in Chakroborty's paper: (P.Chakroborty and T.Dwivedi, Optimal Route Network Design for Transit Systems Using Genetic Algorithms, Engineering Optimization, 34(1), 83-100,2002) Experimental results by testing both I) and II) networks have been published in our paper: (L.Fan and C.L.Mumford, A Metaheuristic Approach to the Urban Transit Routing Problem, Journal of Heuristics, 2008) Online Link: http://www.springerlink.com/content/t53522612n817662/ Experimental results by testing III) network have been published in our paper: (L.Fan, C.L.Mumford and D.Evans, A Simple Multi-objective Optimization Algorithm for the Urban Transit Routing Problem, IEEE Congress on Evolutionary Computation (CEC), Trondheim, Norway, 2009) The entire set of files is of size 200Kb (approximately).
Click here to access these files