01背包问题(分支限界法+python)

class node:
    def __init__(self, level, value, weight, flag):#当前在解空间数的层次、价值、重量、左右子树标记左1右0
        self.level = level
        self.value = value
        self.weight = weight
        self.flag = flag
        self.bound = 0
        self.container = []


def bound(i, node, items, w):
    re_weight = w - node.weight
    bound = node.value
    while (i < len(items)):
        if (items[i][1] < re_weight):
            bound = bound + items[i][0]
            re_weight = re_weight - items[i][1]
            i = i+1
        else:
            bound = bound + items[i][0] / items[i][1] * re_weight
            break
    return bound


def bag(n, w, items):
    items.sort(key=lambda x: x[0]/x[1], reverse=True)
    q = []
    myset = []
    maxvalue = 0
    q.append(node(0, 0, 0, -1))
    while (q != []):
        u = q.pop(0)
        if (u.level < len(items)):
            left_value = u.value + items[u.level][0]
            left_weight = u.weight + items[u.level][1]

            left = node(u.level+1, left_value, left_weight, 1)

            left.bound = bound(left.level, left, items, w)

            left.container = u.container.copy()
            left.container.append(1)

            if(left.weight < w):
                q.append(left)
                if (left.value > maxvalue):
                    maxvalue = left.value
                    myset = left.container

            right = node(u.level+1, u.value, u.weight, 0)
            right.bound = bound(right.level, right, items, w)
            right.container = u.container.copy()
            right.container.append(0)
            if (right.bound >= maxvalue):
                q.append(right)

            q.sort(key=lambda x: x.bound, reverse=True)

    print('装入背包的物品编号为:', end="")
    for i in range(len(myset)):
        if (myset[i] == 1):
            print(items[i][2], end='号 ')

    return maxvalue


if __name__ == '__main__':
    w = 10
    items = [(40, 4, 1), (42, 7, 2), (25, 5, 3), (12, 3, 4)]#物品的价值、重量、编号
    n = len(items)
    maxvalue = bag(n, w, items)
    print()
    print("最大价值为:", maxvalue)

  • 2
    点赞
  • 6
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值