Question

我遇到了问题，我会尽可能简单地描述它。

使用PHP和MySQL的组合我需要解决以下逻辑问题，这是所需内容的简化版本，但简而言之，逻辑是相同的。

思考盒子。我有很多小盒子和一个大盒子。我需要能够使用大量小盒子填充大盒子。

所以让我们打破这个。

我在MySQL中有一个包含以下行的表

Table: small_boxes
id | box_size
=============
1  | 100
2  | 150
3  | 200
4  | 1000
5  | 75
..etc

此表最多可以运行数百个，其中一些框大小相同

我现在需要填充一个大盒子，例如，大小为800，并且我在表格中找到了small_box的所有组合。大盒子可以是用户希望填充的任何尺寸。

这里的目标不是效率，例如，我不太关心略微低于或略微过度，只是在公差数字内显示可能适合的盒子的不同变化。

如果可能的话，我想了解如何在PHP / MySQL中解决这个问题。我在这两方面都非常称职，但问题在于我如何处理这个问题。

例子太棒了，但我很乐意接受一些信息让我开始。

Answer 1

你应该看看光荣的Knapsack problem

Answer 2

https://codegolf.stackexchange.com/questions/3731/solve-the-knapsack-problem

阅读本文。

希望你已经拿代数2 ..

以下是一些可能对您有帮助的PHP代码：

http://rosettacode.org/wiki/Knapsack_problem/0-1#PHP

Answer 3

感谢maxhd和Ugo Meda指出我的方向正确！

结果我得到了一些非常接近我需要的东西。我不确定这是否属于“背包问题”，或其中的任何变化，但这是我提出的代码。随意给我任何建设性的批评！

为了尝试在背包中获得一些不同的盒子变体，我已经删除了每个主循环迭代中的最大项目，再次，如果有更好的方法，请告诉我：）

谢谢！

class knapsack {
    private $items;
    private $knapsack_size;
    private $tolerance = 15; //Todo : Need to make this better, perhaps a percentage of knapsack
    private $debug = 1;

    public function set_knapsack_size($size){
        $this->knapsack_size = $size;
    }

    public function set_items($items){
        if(!is_array($items)){
            return false;
        }

        //Array in the format of id=>size, ordered by largest first
        $this->items = $items;
    }

    public function set_tolerance($tolerance){
        $this->tolerance = $tolerance;
    }

    private function remove_large_items(){
        //Loop through each of the items making sure we can use this sized item in the knapsack
        foreach($this->items as $list_id=>$list){
            //Lets look ahead one, and make sure it isn't the last largest item, we will keep largest for oversize.
            if($list["size"] > $this->knapsack_size && (isset($this->items[$list_id+1]) && $this->items[$list_id+1]["size"] > $this->knapsack_size)){
                unset($this->items[$list_id]);
            }else{
                //If we ever get here, simply return true as we can start to move on
                return true;
            }
        }

        return true;
    }

    private function append_array($new_data,$array){
        if(isset($array[$new_data["id"]])){
            $array[$new_data["id"]]["qty"]++;
        }else{
            $array[$new_data["id"]]["qty"] = 1;
        }

        return $array;
    }

    private function process_items(&$selected_items,$knapsack_current_size){
        //Loop the list of items to see if we can fit it in the knapsack
        foreach($this->items as $list){
            //If we can fit the item into the knapsack, lets add it to our selected_items, and move onto the next item
            if($list["size"] <= $knapsack_current_size){

                $this->debug("Knapsack size is : ".$knapsack_current_size." - We will now take ".$list["size"]." from it");
                $selected_items = $this->append_array($list,$selected_items);
                $knapsack_current_size -= $list["size"];

                //Lets run this method again, start recursion
                $knapsack_current_size = $this->process_items($selected_items,$knapsack_current_size);
            }else{
                //Lets check if we can fit a slightly bigger item into the knapsack, so we can eliminate really small items, within tolerance
                if(($list["size"] <= $knapsack_current_size + $this->tolerance) && $knapsack_current_size > 0){
                    $this->debug("TOLERANCE HIT : Knapsack size is : ".$knapsack_current_size." - We will now take ".$list["size"]." from it");
                    $selected_items = $this->append_array($list,$selected_items);
                    $knapsack_current_size -= $list["size"];
                }
            }

            //Lets see if we have to stop the recursion
            if($knapsack_current_size < 0){
                return $knapsack_current_size;
            }
        }
    }

    private function debug($message=""){
        if(!$this->debug){
            return false;
        }

        echo $message."\n";
    }

    public function run(){
        //If any of the variables have not been set, return false
        if(!is_array($this->items) || !$this->knapsack_size){
            return false;
        }

        //Lets first remove any items that may be too big for the knapsack
        $this->remove_large_items();

        //Lets now check if we still have items in the array, just incase the knapsack is really small
        if(count($this->items) == 0){
            return false;
        }

        //Now that we have a good items list, and we have no items larger than the knapsack, lets move on.
        $variants = array();
        foreach($this->items as $list_id=>$list){
            $this->debug();
            $this->debug("Finding variants : ");

            $selected_items = array();
            $this->process_items($selected_items,$this->knapsack_size);
            $variants[] = $selected_items;

            //Remove the largest variant, so we get a new set of unique results
            unset($this->items[$list_id]);
        }

        return $variants;
    }
}

$products = array(
    array("id"=>1,"size"=>90),
    array("id"=>2,"size"=>80),
    array("id"=>3,"size"=>78),
    array("id"=>4,"size"=>66),
    array("id"=>5,"size"=>50),
    array("id"=>6,"size"=>42),
    array("id"=>7,"size"=>36),
    array("id"=>8,"size"=>21),
    array("id"=>9,"size"=>19),
    array("id"=>10,"size"=>13),
    array("id"=>11,"size"=>7),
    array("id"=>12,"size"=>2),
);

$knapsack = new knapsack();
$knapsack->set_items($products);
$knapsack->set_knapsack_size(62);
$result = $knapsack->run();

var_dump($result);

逻辑问题 - 大盒子中有多少/哪些小盒子 - PHP / MySQL

3 个答案: