The most simple one-dimensional packing problem, also known as the packing problem (1- BP), the main idea is to use the given container load cargo container to use the least amount of. Assuming that m is the quantity of shipment n is available box number (or the maximum number of the optimal solution) pi (i = 1, ..., m) is the weight of the goods i QJ (j = 1, ..., n) j the capacity of the container Q is the average capacity of the container. Binary variable xij of (i = 1, ..., m, j = 1, ..., n), when the cargo shipped in a container j i when xij of = 1 Conversely xij of = 0. Binary variable YJ (j = 1, ..., n),

三维装箱问题的启发式算法.pdf

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．