An application of simulated annealing to the cutting stock problem |
| |
| Affiliation: | 1. Institute of Urban Meteorology, China Meteorological Administration, Beijing 100089, China;2. Environmental Meteorology Forecasting Center of Beijing-Tianjin-Hebei, Beijing 100089, China;3. State Environmental Protection Key Laboratory of Urban Ambient Air Particulate Matter Pollution Prevention and Control, College of Environmental Science and Engineering, Nankai University, Tianjin 300071, China;1. Computer Science and Engineering Department, University of California San Diego, 9500 Gilman dr., San Diego CA 92093, USA;2. Electrical and Computer Engineering Department, University of California San Diego, 9500 Gilman dr., San Diego CA 92093, USA;3. Qualcomm Inst., University of California San Diego, 9500 Gilman dr., San Diego CA 92093, USA;4. Emotient.com, 4435 Eastgate Mall, Suite 320, San Diego, CA 92121, USA;1. Department of Statistics and Operations Research, Faculty of Mathematics, Universidad de Murcia, Spain;2. Instituto de Matemáticas de la Universidad de Sevilla (IMUS), Spain;3. Centre interuniversitaire de recherche sur les réseaux d’enterprise, la logistique et le transport (CIRRELT), Montreal, Canada;4. Department of Mechanical, Industrial and Aerospace Engineering, Gina Cody School of Engineering and Computer Science, Concordia University, Montreal, Canada |
| |
| Abstract: | We solve a two-dimensional cutting stock problem by applying a general global optimization algorithm, the simulated annealing. Our algorithms applied to the cutting problems involving both the guillotine and non-guillotine constraints, underlying that the latter is to be preferred for a big number of items. Several tests prove the validity of the algorithms. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
