期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 210, 期 2, 页码 176-184出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ejor.2010.11.004
关键词
Packing; Heuristics; Bin-packing; Bin-oriented heuristics; Reductions
资金
- Cyprus Research Promotion Foundation [PLPRO/0506/02]
Bin-oriented heuristics for one-dimensional bin-packing problem construct solutions by packing one bin at a time. Several such heuristics consider two or more subsets for each bin and pack the one with the largest total weight. These heuristics sometimes generate poor solutions, due to a tendency to use many small items early in the process. To address this problem, we propose a method of controlling the average weight of items packed by bin-oriented heuristics. Constructive heuristics and an improvement heuristic based on this approach are introduced. Additionally, reduction methods for bin-oriented heuristics are presented. The results of an extensive computational study show that: (1) controlling average weight significantly improves solutions and reduces computation time of bin-oriented heuristics; (2) reduction methods improve solutions and processing times of some bin-oriented heuristics: and (3) the new improvement heuristic outperforms all other known complex heuristics, in terms of both average solution quality and computation time. (C) 2010 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据