1.This is online supplement for the paper "A Binary Search Heuristic Algorithm based on Randomized Local Search for the Rectangular Strip Packing Problem" accepted by INFORMS Journal on Computing.
The excutable file of the algorithm is included, which is runnable in windows XP. The data sets used in this paper can be downloaded from http://59.77.16.8/Download.aspx#p4 

2.Notice:
  For each data, it run 1 times and record the calculated height of the strip and the time costed.

3.Options:

	SortRule: the sorting rule uesd for bsh-rspp-packing(see the paper);
	Rotatable:whether the rectangles can be rotated.

4.Run Step:
	4.1. Click "Input Data" button;
	4.2. Select the file contains the input data (see 5 for data format);
	4.3. Click "Cal" button;
	4.4. Click the "Show" button;
	4.5. The packing results will be written in the output file(see 6 for details)


5.The format of input data (see lw161.txt):
	Line 01:      W LB                            :size of the strip
	                                                      W:Strip-width
	                                                     LB:Strip-height(lower bound)
	Line 02:      n                                    :Number of items
	
	(Data for items)
	Line 02 + 1:      w h                           : data for item 1
	                                                        w: width of item 1
	                                                         h: height of item 1
	.....................
	Line 02+i                                          :data for item  i
	.....................
	Line 02+n                                         :data for item  n



6.The format of output data (see lw161.txt.pack):
	Line 01:      h: H                                   :The found height
	                         				 h::label
	                                                           H:The found minimum height of the strip
	Line 02:      time:t                                :Time to find final best solution
	                         			      time: label
	                                                            t:Time to find final best solution(s)
	
	(Data for the strip)
	Line 03:      W LB                               :size of the strip
	                                                         W:strip width
	                                                        LB:strip height(lower bound)
	Line 04:      n                                       :number of items
	Line 04+1:      w h                               : data for item 1
	                                                          w: width of item 1
	                                                    	h : height of item 1
	.....................
	Line 04+i                                            :data for item  i
	.....................
	Line 04+n                                           :data for item  n
	
	(Data for packed item)
	Line 05+n:    m                                  	     :number of packed item
	Line 05+n+1:  w h  x1 y1 x2 y2               :data for packed item 1
								   w:width of the item
								    h:height of the item
							       x1,y1:the coordinate of the corner that is closet to origin of packed item 1
	                                                    	       x2,y2:the coordinate of the corner that is furthest to origin of packed item 1
	...................................................
	Line 05+n+i                                                    :data for packed item i
	...................................................
	Line 05+n+m                                                  :data for packed item m
	
	(Data for unpacked item)
	Line 06+n+m:          t                                       :Number of unpacked items
	Line 06+n+m+1:      w h                                 : data for unpacked item 1
	                                                                       w: width of unpacked item 1
	                                                    	              h: height of unpacked item 1
	.....................
	Line 06+n+m+i                                               :data for unpacked item  i
	.....................
	Line 06+n+m+t                                               :data for unpacked item  t
