• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

使用遗传编程自动化包装启发式设计过程。

Automating the packing heuristic design process with genetic programming.

机构信息

University of Nottingham, School of Computer Science, Jubilee Campus, Nottingham, NG8 1BB, UK.

出版信息

Evol Comput. 2012 Spring;20(1):63-89. doi: 10.1162/EVCO_a_00044. Epub 2011 Dec 2.

DOI:10.1162/EVCO_a_00044
PMID:21609273
Abstract

The literature shows that one-, two-, and three-dimensional bin packing and knapsack packing are difficult problems in operational research. Many techniques, including exact, heuristic, and metaheuristic approaches, have been investigated to solve these problems and it is often not clear which method to use when presented with a new instance. This paper presents an approach which is motivated by the goal of building computer systems which can design heuristic methods. The overall aim is to explore the possibilities for automating the heuristic design process. We present a genetic programming system to automatically generate a good quality heuristic for each instance. It is not necessary to change the methodology depending on the problem type (one-, two-, or three-dimensional knapsack and bin packing problems), and it therefore has a level of generality unmatched by other systems in the literature. We carry out an extensive suite of experiments and compare with the best human designed heuristics in the literature. Note that our heuristic design methodology uses the same parameters for all the experiments. The contribution of this paper is to present a more general packing methodology than those currently available, and to show that, by using this methodology, it is possible for a computer system to design heuristics which are competitive with the human designed heuristics from the literature. This represents the first packing algorithm in the literature able to claim human competitive results in such a wide variety of packing domains.

摘要

文献表明,一维、二维和三维的装箱和背包问题是运筹学中的难题。已经研究了许多技术,包括精确、启发式和元启发式方法,以解决这些问题,但当遇到新的实例时,通常不清楚应该使用哪种方法。本文提出了一种方法,其动机是构建能够设计启发式方法的计算机系统。总体目标是探索自动化启发式设计过程的可能性。我们提出了一种遗传编程系统,用于为每个实例自动生成高质量的启发式方法。不需要根据问题类型(一维、二维或三维背包和装箱问题)更改方法,因此它具有文献中其他系统无法比拟的通用性。我们进行了广泛的实验,并与文献中最好的人类设计启发式进行了比较。请注意,我们的启发式设计方法在所有实验中都使用相同的参数。本文的贡献在于提出了一种比现有方法更通用的包装方法,并表明通过使用这种方法,计算机系统可以设计出与文献中人类设计的启发式方法相竞争的启发式方法。这是文献中第一个能够在如此广泛的包装领域声称具有人类竞争力的包装算法。

相似文献

1
Automating the packing heuristic design process with genetic programming.使用遗传编程自动化包装启发式设计过程。
Evol Comput. 2012 Spring;20(1):63-89. doi: 10.1162/EVCO_a_00044. Epub 2011 Dec 2.
2
A dynamic multiarmed bandit-gene expression programming hyper-heuristic for combinatorial optimization problems.一种用于组合优化问题的动态多臂赌博机-基因表达式编程超启发式算法。
IEEE Trans Cybern. 2015 Feb;45(2):217-28. doi: 10.1109/TCYB.2014.2323936. Epub 2014 Jun 2.
3
Automated discovery of local search heuristics for satisfiability testing.用于可满足性测试的局部搜索启发式算法的自动发现
Evol Comput. 2008 Spring;16(1):31-61. doi: 10.1162/evco.2008.16.1.31.
4
Hyper-heuristics with low level parameter adaptation.具有低层次参数自适应的超启发式算法。
Evol Comput. 2012 Summer;20(2):189-227. doi: 10.1162/EVCO_a_00063. Epub 2012 Feb 24.
5
An impatient evolutionary algorithm with probabilistic tabu search for unified solution of some NP-hard problems in graph and set theory via clique finding.一种带有概率禁忌搜索的不耐烦进化算法,用于通过团发现对图论和集合论中的一些NP难问题进行统一求解。
IEEE Trans Syst Man Cybern B Cybern. 2008 Jun;38(3):645-66. doi: 10.1109/TSMCB.2008.915645.
6
A lifelong learning hyper-heuristic method for bin packing.一种用于装箱问题的终身学习超启发式方法。
Evol Comput. 2015 Spring;23(1):37-67. doi: 10.1162/EVCO_a_00121. Epub 2014 Jun 3.
7
Solving the multiple competitive facilities location and design problem on the plane.解决平面上的多竞争设施选址与设计问题。
Evol Comput. 2009 Spring;17(1):21-53. doi: 10.1162/evco.2009.17.1.21.
8
A Case Study of Controlling Crossover in a Selection Hyper-heuristic Framework Using the Multidimensional Knapsack Problem.使用多维背包问题控制选择超启发式框架中的交叉案例研究。
Evol Comput. 2016 Spring;24(1):113-41. doi: 10.1162/EVCO_a_00145. Epub 2015 Jan 30.
9
Multidimensional knapsack problem: a fitness landscape analysis.多维背包问题:一种适应度景观分析
IEEE Trans Syst Man Cybern B Cybern. 2008 Jun;38(3):604-16. doi: 10.1109/TSMCB.2008.915539.
10
Direct heuristic dynamic programming for damping oscillations in a large power system.用于大型电力系统阻尼振荡的直接启发式动态规划
IEEE Trans Syst Man Cybern B Cybern. 2008 Aug;38(4):1008-13. doi: 10.1109/TSMCB.2008.923157.