Capacitated CLSC Data Instances

Easwaran, G., and Üster. H., “Tabu Search and Benders Decomposition Approaches for a Capacitated Closed-Loop Supply Chain Network Design Problem,” Transportation Science, Vol. 43/3, pp. 301-320, 2009.

Note: The link to the CLSC Network Design Problem data instances is given below.

Please right click on the link and click "Save Target As" to save it on your machine.

·    CLSC Data Instances - Model-2.zip

Format:

1.      The data for the small instances are named Cap_Heuristics_U_1.txt to Cap_Heuristics_U_120.txt. The Table below gives the number of products, retailers, and collection centers in each class.

                     

Class

Products

Retailers

Collection Centers

CS1

5

60

25

CS2

5

60

35

CS3

5

90

25

CS4

5

90

35

CS5

5

120

25

CS6

5

120

35

CS7

10

60

25

CS8

10

60

35

CS9

10

90

25

CS10

10

90

35

CS11

10

120

25

CS12

10

120

35

3.   The data for the large instances are named Cap_Heuristics_Large_1.txt to Cap_Heuristics_Large_120.txt. The Table below gives the number of products, retailers, collection centers, and distribution centers in each class.

                     

Class

Products

Retailers

Collection Centers

CL1

5

240

25

CL2

5

240

35

CL3

5

300

25

CL4

5

300

35

CL5

5

360

25

CL6

5

360

35

CL7

10

240

25

CL8

10

240

35

CL9

10

300

25

CL10

10

300

35

CL11

10

360

25

CL12

10

360

35

3.      There are 10 instances under each class.

4.      The Legend for the input file format is given below:

Symbol

Details

 P

Products

 R

Retailers

 K

Collection centers

 D

Distribution centers

 S(p)

Remanufacturing product plants

 T(p)

New product plants

 D'rp

Fresh demand for product p at retailer r

 Drp

Return demand for product p at retailer r

 Fk

Fixed cost of opening collection center k

 Fs(p) - spFC[p][s]

Fixed cost of opening remanufacturing plant s for product p

 rkLTC

Transportation cost (per unit per mi) from retailer r to collection center k

 drLTC

Transportation cost (per unit per mi) from distribution center d to retailer r

 ks(p)LTC - [k][p][s]

Transportation cost (per unit per mi) from collection center k to remanufacturing plant s, associated with product p

 s(p)dLTC - [p][s][d]

Transportation cost (per unit per mi) from remanufacturing plant s, associated with product p, to distribution center d

 T(p)dLTC - [p][t][d]

Transportation cost (per unit per mi) from new product plant t, associated with product p, to the distribution center d. 

 pkPC - [p][k]

Collection processing cost for product p at location k

 PRemanPC[p][s]

Remanufacturing cost for product p at location s

 POemPC[p][t]

Manufacturing cost for product p at location t

 Delta[r][p]

Retailer return fraction for product p at location r

 Alpha[p][s(p)]

Remanufacturing coefficient for plant s for product p

 Distribution_Capacities

Capacity for distribution center d

 pdPC - [p][d]

Distribution processing cost for product p at location d

 Cap[p][t(p)]

Capacity for new product plant t for product p

 Collection_Capacities

Capacity for collection center k

 Collection_Capacity_Coefficients

Collection capacity coefficient for product p

 Distribution_Capacity_Coefficients

Distribution capacity coefficient for product p

 X

(not applicable)

 SpBar

(not applicable)

 pkCapUtil-[p][k]

(not applicable)

 PRemanCapUtil[p][s]

(not applicable)

 POemCapUtil[p][t]

(not applicable)

 pdCapUtil-[p][d]

(not applicable)

6.      All the text files follow the following sample format. (Products=2, Retailers=3, Collection Centers=5, Distribution Centers=3).

P
2
R
3
K
5
D
3
S(p)
[3, 3]
T(p)
[3, 3]
D'rp
[[476, 480], [478, 458], [480, 483]]
Drp
[[299, 250], [272, 250], [255, 268]]
Fk
[1.44773e+007, 1.54936e+007, 1.51822e+007, 1.46114e+007, 1.58926e+007]
Fs(p) - spFC[p][s]
[[1.02101e+006, 1.20925e+006, 1.15693e+006], [1.51668e+006, 1.56021e+006, 1.43467e+006]]
rkLTC
[[2123.07, 1142.51, 494.696, 803.881, 1378.08], [2658.99, 1631.32, 797.991, 241.459, 1919.89], [397.523, 1431.08, 1875.72, 2767.94, 636.037]]
drLTC
[[6.64447, 7.7896, 2.9211], [3.63423, 4.78621, 3.14738], [6.08905, 7.34389, 1.70055]]
ks(p)LTC - [k][p][s]
[[[4.39954, 10.7587, 3.5525], [50.0591, 86.2556, 5.13426]], [[3.79271, 17.5223, 11.1379], [70.2111, 49.8024, 72.6498]], [[7.6992, 14.6272, 10.9736], [39.6622, 15.7879, 83.5602]], [[10.7966, 18.7486, 15.3099], [84.2019, 40.304, 124.634]], [[3.41344, 12.4654, 6.46025], [29.0086, 54.0381, 30.2922]]]
s(p)dLTC - [p][s][d]
[[[49.4849, 18.9911, 34.8942], [46.7057, 109.315, 63.9213], [1.69839, 66.932, 15.5171]], [[28.3145, 31.4717, 27.5628], [45.8544, 26.4101, 42.0959], [16.7381, 27.5628, 9.221]]]
T(p)dLTC - [p][t][d]
[[[84.1861, 42.151, 71.6798], [65.6582, 104.219, 75.617], [84.5335, 18.1805, 64.0371]], [[37.8111, 33.9774, 30.0685], [55.6267, 35.0298, 49.8385], [34.6539, 35.7063, 26.8361]]]
pkPC - [p][k]
[[629.786, 643.444, 669.231, 649.721, 682.004], [1001.34, 959.652, 941.519, 991.663, 974.678]]
PRemanPC[p][s]
[[673.267, 671.105, 773.797], [1081.28, 1004.03, 1088.2]]
POemPC[p][t]
[[131.865, 127.704, 135.468], [202.914, 197.062, 192.55]]
Delta[r][p]
[[0.760799, 0.77289], [0.702997, 0.729463], [0.718281, 0.73318]]
Alpha[p][s(p)]
[[0.948111, 0.934389, 0.831339], [0.95461, 0.92789, 0.892436]]
Distribution_Capacities
[9787.92, 9246.38, 9037.32]
pdPC - [p][d]
[[36.1182, 34.0571, 30.2031], [52.3546, 51.7581, 49.1857]]

Cap[p][t(p)]
[[102860, 112752, 108525], [80836, 89638, 92446]]
Collection_Capacities
[88695, 85978, 97420, 95887, 94288]
Collection_Capacity_Coefficients
[1, 2]
Distribution_Capacity_Coefficients
[1, 5]
X
0
SpBar
[1, 1]
pkCapUtil-[p][k]
[[72.6248, 63.2263, 57.9226], [161.726, 124.238, 153.158]]
PRemanCapUtil[p][s]
[[120.227, 124.789, 102.549], [289.343, 342.368, 311.485]]
POemCapUtil[p][t]
[[75.2322, 75.6846, 79.7191], [209.013, 207.109, 192.172]]
pdCapUtil-[p][d]
[[36.8784, 38.9629, 31.9497], [70.0852, 95.4271, 97.0045]]

 

------------------