3d_container_python三维装箱_python_3dpacking_

from vtk import * import vtk import functools import random import math # 数据生成，输入为箱子种类数，箱子最大长、最小长、最大宽、最小宽、商品个数、商品最大长、最小长、最大宽、最小宽 # 输出为生成的箱子列表和商品列表 def boxs_generate_3d(nums_box=20, max_l_box=80, min_l_box=21, max_w_box=60, min_w_box=14, max_h_box=60, min_h_box=9): # 随机生成箱子 boxs = [] for i in range(nums_box): boxs.append([int((max_l_box-min_l_box) * random.random() + min_l_box), int((max_w_box-min_w_box) * random.random() + min_w_box), int((max_h_box-min_h_box) * random.random() + min_h_box)]) # boxs = [] # for i in range(nums_box): # boxs.append([int((max_l_box-min_l_box) * random.random() + min_l_box), # int((max_w_box-min_w_box) * random.random() + min_w_box), # int((max_h_box-min_h_box) * random.random() + min_h_box)]) return boxs # 二维商品排序用 def cmp_2d(x,y): if x[0] < y[0]: return -1 elif x[0] > y[0]: return 1 elif x[1] < y[1]: return -1 elif x[1] > y[1]: return 1 else: return 0 # 三维商品排序用 def cmp_3d(x, y): if x[0] < y[0]: return -1 elif x[0] > y[0]: return 1 elif x[1] < y[1]: return -1 elif x[1] > y[1]: return 1 elif x[2] < y[2]: return -1 elif x[2] > y[2]: return 1 else: return 0 # 检验是否每个商品都能有一个箱子放下它 def check_3d(boxs, goods): for good in goods: can_put = False for box in boxs: if good[0] <= box[0] and good[1] <= box[1] and good[2] <= box[2]: can_put = True break if not can_put: print(good,"太大，无合适箱子") return False return True def can_put_3d(l, w, h, goods): L = max(l, w, h) H = min(l, w, h) W = l + w + h - L - H for good in goods: # lg, wg, hg = good[0], good[1], good[2] lg = max(good[0], good[1], good[2]) hg = min(good[0], good[1], good[2]) wg = good[0] + good[1] + good[2] - lg - hg if lg > L or wg > W or hg > H: return False return True # 先以w为限制码垛，再以l为限制码垛 # 输入为长、宽、商品集，输出为箱子个数 def packing_simple(l, w, h, goods): # 先检查是否每一个商品在此规则下都能放下 if not can_put_3d(l, w, h, goods): return -1 #以h为限制码垛成条，商品排序，大的放前面 goods1 = [] for good in goods: if good[0] <= l and good[1] <= w and good[2] <= h: goods1.append([good[0], good[1], good[2]]) elif good[0] <= l and good[2] <= w and good[1] <= h: goods1.append([good[0], good[2], good[1]]) elif good[1] <= l and good[0] <= w and good[2] <= h: goods1.append([good[1], good[0], good[2]]) elif good[1] <= l and good[2] <= w and good[0] <= h: goods1.append([good[1], good[2], good[0]]) elif good[2] <= l and good[0] <= w and good[1] <= h: goods1.append([good[2], good[0], good[1]]) else: goods1.append([good[2], good[1], good[0]]) goods1 = sorted(goods1, key=functools.cmp_to_key(cmp_3d), reverse=True) strips = [] goods1_used = [0 for i in range(len(goods1))] while sum(goods1_used) < len(goods1_used): l_used = 0 w_used = 0 h_used = 0 for i in range(len(goods1_used)): if goods1_used[i] == 0 and h_used + goods1[i][2] <= h: l_used = max(l_used, goods1[i][0]) w_used = max(w_used, goods1[i][1]) h_used += goods1[i][2] goods1_used[i] = 1 strips.append([l_used, w_used]) strips = sorted(strips, key=functools.cmp_to_key(cmp_2d), reverse=True) #以w为限制码垛成层 levels = [] strip_used = [0 for i in range(len(strips))] while sum(strip_used) < len(strip_used): l_used = 0 w_used = 0 for i in range(len(strips)): if strip_used[i] == 0 and w_used + strips[i][1] <= w: l_used = max(l_used, strips[i][0]) w_used += strips[i][1] strip_used[i] = 1 levels.append(l_used) #再以l为限制码垛 levels = sorted(levels, reverse=True) L_box_unused = [l] for level in levels: flag = -1 for i in range(len(L_box_unused)): if L_box_unused[i] >= level: if flag == -1: flag = i elif L_box_unused[i] < L_box_unused[flag]: flag = i if flag == -1: L_box_unused.append(l - level) else: L_box_unused[flag] -= level return len(L_box_unused) # 选择合适的主箱子 def box_choose_3d(boxs, nums_simplePacking_1, nums_simplePacking_2, nums_simplePacking_3, nums_simplePacking_4, nums_simplePacking_5, nums_simplePacking_6): l = -1 w = -1 h = -1 nums = -1 for i in range(len(boxs)): if nums_simplePacking_1[i] != -1: if nums == -1 or (nums != -1 and nums > nums_simplePacking_1[i]) or (nums != -1 and nums == nums_simplePacking_1[i] and l * w * h > boxs[i][0] * boxs[i][1] * boxs[i][2]): l = boxs[i][0] w = boxs[i][1] h = boxs[i][2] nums = nums_simplePacking_1[i] if nums_simplePacking_2[i] != -1: if nums == -1 or (nums != -1 and nums > nums_simplePacking_2[i]) or (nums != -1 and nums == nums_simplePacking_2[i] and l * w * h > boxs[i][0] * boxs[i][1] * boxs[i][2]): l = boxs[i][0] w = boxs[i][2] h = boxs[i][1] nums = nums_simplePacking_2[i] if nums_simplePacking_3[i] != -1: if nums == -1 or (nums != -1 and nums > nums_simplePacking_3[i]) or (nums != -1 and nums == nums_simplePacking_3[i] and l * w * h > boxs[i][0] * boxs[i][1] * boxs[i][2]): l = boxs[i][1] w = boxs[i][0] h = boxs[i][2] nums = nums_simplePacking_3[i] if nums_simplePacking_4[i] != -1: if nums == -1 or (nums != -1 and nums > nums_simplePacking_4[i]) or (nums != -1 and nums == nums_simplePacking_4[i] and l * w * h > boxs[i][0] * boxs[i][1] * boxs[i][2]): l = boxs[i][1] w = boxs[i][2] h = boxs[i][0] nums = nums_simplePacking_4[i] if nums_simplePacking_5[i] != -1: if nums == -1 or (nums != -1 and nums > nums_simplePacking_5[i]) or (nums != -1 and nums == nums_simplePacking_5[i] and l * w * h > boxs[i][0] * boxs[i][1] * boxs[i][2]): l = boxs[i][2] w = boxs[i][0] h = boxs[i][1] nums = nums_simplePacking_5[i] if nums_simplePacking_6[i] != -1: if nums == -1 or (nums != -1 and nums > nums_simplePacking_6[i]) or (nums != -1 and nums == nums_simplePacking_6[i] and l * w * h > boxs[i][0] * boxs[i][1] * boxs[i][2]): l = boxs[i][2] w = boxs[i][1] h = boxs[i][0] nums = nums_simplePacking_6[i] return l, w, h def packing_3d(l, w, h, goods): # 先检查是否每一个商品在此规则下都能放下 if not can_put_3d(l, w, h, goods): return -1 # 以h为限制码垛成条，商品排序，大的放前面 goods1 = [] for good in goods: if good[0] <= l and good[1] <= w and good[2] <= h: goods1