Improved local search algorithms for the rectangle packing problem with general spatial costs |
| |
| Institution: | 1. Department of Information Management and Finance, Institute of Information Management, National Chiao Tung University, Hsinchu, Taiwan, ROC;2. Department of Industrial and Systems Engineering, North Carolina State University, USA;3. School of Economics and Management, Southwest Jiaotong University, Chengdu 610031, China;1. Operations Research and Logistics, Wageningen University, Hollandseweg 1, Wageningen 6706 KN, the Netherlands;2. CIRRELT and HEC Montreal, 3000 chemin de la Côte-Sainte-Catherine, Montréal H3T 2A7, Canada |
| |
| Abstract: | The rectangle packing problem with general spatial costs is to pack given rectangles without overlap in the plane so that the maximum cost of the rectangles is minimized. This problem is very general, and various types of packing problems and scheduling problems can be formulated in this form. For this problem, we have previously presented local search algorithms using a pair of permutations of rectangles to represent a solution. In this paper, we propose speed-up techniques to evaluate solutions in various neighborhoods. Computational results for the rectangle packing problem and a real-world scheduling problem exhibit good prospects of the proposed techniques. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
