Benchmarks K90

---

These benchmarks were derived from the railway network of Slovak Republic. The network consists of 457 nodes, where the customers are located. The shortest path matrix is stored in the file d_ij.txt. The benchmarks are stored in the files listed in the following table.

K90
Size	1	2	3	4	5	6	7	8	9
45x457	Val021	Val022	Val023	Val024	Val025	Val026	Val027	Val028	Val029
91x457	Val041	Val042	Val043	Val044	Val045	Val046	Val047	Val048	Val049
137x457	Val061	Val062	Val063	Val064	Val065	Val066	Val067	Val068	Val069
182x457	Val081	Val082	Val083	Val084	Val085	Val086	Val087	Val088	Val089
229x457	Val101	Val102	Val103	Val104	Val105	Val106	Val107	Val108	Val109
274x457	Val121	Val122	Val123	Val124	Val125	Val126	Val127	Val128	Val129
319x457	Val141	Val142	Val143	Val144	Val145	Val146	Val147	Val148	Val149
365x457	Val161	Val162	Val163	Val164	Val165	Val166	Val167	Val168	Val169
411x457	Val181	Val182	Val183	Val184	Val185	Val186	Val187	Val188	Val189
457x457	Val201	Val202	Val203	Val204	Val205	Val206	Val207	Val208	Val209

This data can be read from the files using procedure K90.pas.

File format:

Description	Symbol	Position (Start)	Position (End)
Number of sites	|I|	1	1
Fixed charges	fi	2	2
Indexes of sites	N	3	|I| + 2
Customer demand	bj	|I| + 3	|I| + 460

The cost for demand satisfaction c_ij = (20 d_ij + 60 ) b_j, where d_ij is the length of the shortest path between nodes i and j.

Optimal solutions of all benchmarks can be found in the file optima.xls.