J E Beasley

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.

Hub location

There are 4 data files.

They contain data for hub location problems. The data set (referred
to as the AP data set as opposed to the CAB data set used in the literature)
was used in the following papers:

"Efficient algorithms for the uncapacitated single allocation p-hub median 
problem" by AT Ernst & M Krishnamoorthy (Location Science Vol 4, No 3, 
pp 139-154, 1996).

"Efficient algorithms for the uncapacitated multiple allocation p-hub 
median problem" by AT Ernst & M Krishnamoorthy (forthcoming in EJOR). 

"Solution algorithms for the capacitated single allocation hub location 
problem" by AT Ernst & M Krishnamoorthy (forthcoming in Annals of OR).

"Neural versus Traditional approaches to the Location of Interacting Hub
Facilities" by K Smith, M Krishnamoorthy & M Palaniswami (Location Science,
Vol 4, No 3, pp 155-171, 1996)

For further details see the files phub1, phub2 and phub3
Note that the distances derrived from the co-ordinates in each of 
these problems should be divided by 1000 to obtain the correct solutions!

The largest file is phub2 of size 470KB (approximately).
The entire set of files is of size 1MB (approximately)

These test problems were contributed by 
AT Ernst (andreas.ernst@cmis.csiro.au) and
M Krishnamoorthy (mohan.krishnamoorthy@cmis.csiro.au)
The CAB data set has been contributed by M.E. O'Kelly in the file phub4
This file is of size 17Kb (approximately)

Click here to access these files


Other test problems (a Turkish data set from B. Kara) are also available here