期刊
COMPUTERS & INDUSTRIAL ENGINEERING
卷 105, 期 -, 页码 313-328出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2017.01.015
关键词
Two-dimensional 0-1 knapsack problem; Conflict graph; Disjunctive constraint; Complete shipment; Integer programming; Tabu search
资金
- CNPq
- FAPEG
- FAPESP [2011/13382-3, 2013/21744-8]
- Fundacao de Amparo a Pesquisa do Estado de Sao Paulo (FAPESP) [11/13382-3] Funding Source: FAPESP
This work deals with the 0-1 knapsack problem in its two-dimensional version considering a conflict graph, where each edge in this graph represents a pair of items that must not be packed together. This problem arises as a subproblem of the bin packing problem and in supply chain scenarios. We propose some integer programming formulations that are solved with a branch and -cut algorithm. The formulation is based on location-allocation variables mixing the one- and two-dimensional versions of this problem. When a candidate solution is found, a feasibility test is performed with a constraint programming algorithm, which verifies if it satisfies the two-dimensional packing constraints. Moreover, bounds and valid cuts are also investigated. A heuristic that generates iteratively a solution and has components of Tabu search and Simulated Annealing approaches is proposed. The results are extended to consider complete shipment of items, where subsets of items all have to be loaded or left out completely. This constraint is applied in many real-life packing problems, such as packing parts of machinery, or when delivering cargo to different customers. Experiments on several instances derived from the literature indicate the competitiveness of our algorithms, which solved 99% of the instances to optimality requiring short computational time. (C) 2017 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据