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

有舍弃的装箱问题及其启发式算法
引用本文:龚淑梅,张晓辉,李少昆. 有舍弃的装箱问题及其启发式算法[J]. 云南民族大学学报(自然科学版), 2012, 21(1): 30-34
作者姓名:龚淑梅  张晓辉  李少昆
作者单位:1. 丽江师范高等专科学校数理系,云南丽江,674100
2. 邯郸学院数学系,河北邯郸,056005
3. 中国科学院云南天文台,云南昆明650011;中国科学院天体结构与演化重点实验室,云南昆明650011
基金项目:国家自然科学基金(10903025)
摘    要:设计了一种启发式算法——RCF算法来解决有舍弃装箱问题.实验证明,该算法与RFF3算法相比,在物体个数比较少(<200)的情况下,由于数据的随机性会出现比RFF3算法较好;在物体个数大于200的情况下,RFF3算法具有绝对的优势.因此,提出的RCF算法在物体个数比较少的情况下,有一定的应用价值.

关 键 词:装箱问题  舍弃费用  启发式算法

Bin Packing Problem with Rejection Cost and Its Heuristic Algorithm
GONG Shu-mei , ZHANG Xiao-hui , LI Shao-kun. Bin Packing Problem with Rejection Cost and Its Heuristic Algorithm[J]. Journal of Yunnan Nationalities University:Natural Sciences Edition, 2012, 21(1): 30-34
Authors:GONG Shu-mei    ZHANG Xiao-hui    LI Shao-kun
Affiliation:3,4 (1.Department of Mathematics and Physics,Lijiang Teachers College,Lijiang 674100,China; 2.Department of Mathematics,Handan College,Handan 056005,China; 3.Yunnan Astronomical Observatory,CAS,Kunming 650011,China; 4.Key Laboratory for the Structure and Evolution of Celestial Objects,CAS,Kunming 650011,China)
Abstract:It introduces the mathematical presentation of the bin packing problem with rejection cost and designs a heuristic algorithm(RCF algorithm) to solve this problem.The experiment proves that compared with the RFF3 algorithm when the total number of the items is less than 200,it will turn out to be a better result because of the randomization of the data,but when the total number of the items is more than 200,the RFF3 algorithm has absolute advantages.Then,the RCF algorithm proposed here is useful when the total number of the items is not too big.
Keywords:bin packing problem  rejection cost  heuristic algorithm
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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