No abstract

No abstract

http://dx.doi.org/10.1007/s10852-015-9278-zNational audienceno abstrac

In this paper we present a hybrid metaheuristic approach called PVS for the two-dimensional strip packing problem (2SPP). PVS (progress and verify strategy) relies on two procedures: a local search algorithm that delivers satisfying placements of the items on the horizontal axis, and an exact procedure that searches for the positions of the items on the vertical axis. This last one explores all the possibilities, starting with the most promising ones, and can be stopped at any moment. PVS follows a specific anytime strategy which continuously improves the current solution until it is provably optimal or a given time limit is reached. Experimental results show that the method is competitive on moderate-sized instances compared to the best known approaches.