首页 | 本学科首页   官方微博 | 高级检索  
     检索      


The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming
Institution:1. INRIA-Lorraine, Technopôle Metz 2000, 4 Rue Marconi, 57070 Metz, France;2. Université de Technologie de Troyes, Département GSI, 12 rue Marie Curie, 10010 Troyes Cedex, France;3. Institute for Systems Research, University of Maryland, College Park, MD 20742, USA;1. School of Management, Xi’an Jiaotong University, Xi’an 710049, China;2. The Key Lab of the Ministry of Education for Process Control & Efficiency Engineering, Xi’an 710049, China
Abstract:The purpose of this paper is to provide efficient methods for solving a large spectrum of industrial cutting stock problems. We propose two methods. Both are based on dynamic programming. In both methods, we reduce the computation burden by keeping, at each stage of the dynamic programming process, only the states which seem to be the most promising in terms of cost. One of the methods favours the computation time at the expense of the quality of the solution; this method is used in the sale department, where the goal is to propose a “good” solution in less than one minute. The second method favours the quality of the solution. Industrial applications are proposed.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号