一个高效的大数优先装箱算法，可以根据数据类型进行优化

 

 
var box_witdh=170;//盒子宽度
var arr = [];//物品列表
  for (var i = 0; i <1000; i++) {
    //var num = myRandom(6, 19);
   // var num = rand(20);
    var num = getRandomIntInclusive(8, 16);
    num = parseInt(num, 10);
    arr.push(num);
  }
  arr.sort(function(a, b){return a - b}).reverse();
 // console.log(arr);
 //sort(function(a, b){return a - b})
 

//console.log('res', func(arr))

 //res=factorial(10)
 //console.log(res)
box=[];
box=zhuang(arr);
/*
 box=[];
 loss=[];
 box_i=0;
 for(i in arr){
	 item=arr[i];
	 //console.log(item);
	 if (item>box_witdh ){
		loss.push(item)
	 }
	  else{
		  
		  for(box_i=0;box_i<3000; box_i++){
			if(box[box_i]==undefined) box[box_i]=  new Array();
			 
			//console.log(box[box_i]);
			
			he=parseInt(sum(box[box_i]))+item ;
			//console.log(parseInt(sum(box[box_i])));
			//console.log(he);
			
			
			if(he <= box_witdh){
				box[box_i].push(item);
				break;
			}else{
				
			}
			
		  }
		  //console.log(box_i);

	  }
		 
	 
 }

*/
console.log(loss)
// console.log(box)
box_new_ok=[]
box_new_short=[]
 box.forEach(function(it){
	 sumit=sum(it)
	 console.log(it,sumit)
	 if(sumit==box_witdh){
		 box_new_ok.push(it)
	 }else{
		  box_new_short.push(it)
	 }
	 
	 
 });
 
 console.log("box_new_ok \n",box_new_ok)
 console.log("box_new_short \n",box_new_short)
 
 //box_new_short_ping=box_new_short.flat();
 box_new_short_ping=[].concat(...box_new_short);
 box_new_short_ping.sort(function() {
    return .5 - Math.random();
});
 de2=zhuang(box_new_short_ping);
  console.log("de2 \n",de2)
 
  de2.forEach(function(it){
	 sumit=sum(it)
	 console.log(it,sumit)
	 if(sumit==box_witdh){
		 box_new_ok.push(it)
	 }else{
		  box_new_short.push(it)
	 }
	 
	 
 });
  console.log("box_new_ok \n",box_new_ok)
 console.log("box_new_short \n",box_new_short)
 
 
 
 
 
 
 
 
 //====================================================================================
 function zhuang(arr){
	  box=[];
 loss=[];
 box_i=0;
 for(i in arr){
	 item=arr[i];
	 //console.log(item);
	 if (item>box_witdh ){
		loss.push(item)
	 }
	  else{
		  
		  for(box_i=0;box_i<3000; box_i++){
			if(box[box_i]==undefined) box[box_i]=  new Array();
			 
			//console.log(box[box_i]);
			
			he=parseInt(sum(box[box_i]))+item ;
			//console.log(parseInt(sum(box[box_i])));
			//console.log(he);
			
			
			if(he <= box_witdh){
				box[box_i].push(item);
				break;
			}else{
				
			}
			
		  }
		  //console.log(box_i);

	  }
		 
	 
 }
 return box;
 }
 function sum1(arr) {
  return eval(arr.join("+"));
};
 
function sum(arr) {
  var s = 0;
  for (var i=arr.length-1; i>=0; i--) {
    s += arr[i];
  }
  return s;
}



 function factorial (num) { 
    if (num < 0) { 
        return -1; 
    } else if (num === 0 || num === 1) { 
        return 1; 
    } else { 
        return (num * factorial(num - 1)); 
    } 
};
 
  function getRandomIntInclusive(min, max) {
    min = Math.ceil(min);
    max = Math.floor(max);
    return Math.floor(Math.random() * (max - min + 1)) + min; //含最大值，含最小值 
  }  
  
 
 //递归排序
 let func = (arr) => {
  let len = arr.length
  let res = [] // 所有排列结果
  /**
   * 【全排列算法】
   * 说明：arrange用来对arr中的元素进行排列组合，将排列好的各个结果存在新数组中
   * @param tempArr：排列好的元素
   * @param leftArr：待排列元素
   */
  let arrange = (tempArr, leftArr) => {
    if (tempArr.length === len) { // 这里就是递归结束的地方
      // res.push(tempArr) // 得到全排列的每个元素都是数组
      res.push(tempArr.join('')) // 得到全排列的每个元素都是字符串
    } else {
      leftArr.forEach((item, index) => {
        let temp = [].concat(leftArr)
        temp.splice(index, 1)
        // 此时，第一个参数是当前分离出的元素所在数组；第二个参数temp是传入的leftArr去掉第一个后的结果
        arrange(tempArr.concat(item), temp) // 这里使用了递归
      })
    }
  }
  arrange([], arr)
  return res
}