bin-packing | javascript binary tree based algorithm for 2d bin | Game Engine library

I have a problem that is similar to the bin packing problem, however the problem is different:

• There are x vehicles, which could be anywhere in a 2D plane
• Each vehicle has passenger capacity y
• There are z passengers, which could be anywhere in a 2D plane

I'd like to write an algorithm to sort the passengers into the vehicles, within the following constraints:

1. Passengers must move to their closest vehicle
2. If a vehicle reaches capacity, no more passengers can move to it

I would like a pseudo-code algorithm as I'm not yet sure if I'll be implementing this in JavaScript, PHP or SQL. My first attempt is this:

1. Assign each passenger a numeric ID starting from 0 and incrementing by 1
2. Assign each vehicle a numeric ID starting from 0 and incrementing by 1
3. Create an array for each vehicle with the same name/ID as its vehicle ID
4. For each passenger, calculate the distance between it and all vehicles
5. Store the results in a passenger/vehicle array: [passengerID, distance to vehicleID1, distance to vehicleID2, etc.]
6. Repeat these step for z passengers:
   • Iterate over the array and find the smallest distance value. This should be the passenger who is closest to a vehicle
   • Add the passengerID to the vehicle array
   • Remove that passenger item from the passenger/vehicle array
   • Check the occupants of the vehicle array added to. If length equals capacity, nullify every instance of the passenger-distance value in the passenger/vehicle array

At the end of execution, we should have an empty passenger/vehicle array if number of passengers is less than total vehicle capacity, or a few elements left in that array if there are more passengers than would fit in all vehicles. We should also have arrays for each vehicle that have the same number of elements as their capacity, or possibly fewer if there were fewer passengers than vehicle capacity.

I am pretty sure the above will work, but I feel that there could be a more efficient method. I'm particularly concerned about calculating the distances between every passenger and vehicle to begin with, as this will be computationally expensive.

Can anyone point me to a more efficient solution?

Many thanks, Arj

I have a package (https://github.com/skjolber/3d-bin-container-packing/) that will pack items into a container for me. However, if there are too many items for example a quantity of 1000 shirts, and only 500 fit in the biggest container we have, it won't try to pack the remaining 500 the result simply returns null and does not try to combine the containers available.

I am tackling a bin-packing-problem. Note that this doesn't need to be an exact solution as we are just putting together a cost calculator for freight. I stumbled upon a package that handles most of the problem. Basically I have 5 containers that are usable. The API receives a request with products and I gather the dimensions and pack them. My initial thought was to check if the pack was successful and if it was then add it to the List packingResults object so that I have a list. But the way this package is set up I suspect that it will not work without losing integrity of the products.

Here is the service constructor

I'm using this binary pack code. I'm using its GrowingPacker approach. It works fine, but I have a hard time figuring out the dimensions of the final pack, I mean the bounding box of final result like (xMin, xMax, yMin, yMax). What is the best approach to find it?

Can I use the final values of x, y, w, h for this.root to compute the bounding box?

I'm not sure if it is correct, but currently I'm using a loop like that loop to compute the bounding box of final pack (I'm using C++):

I have used the bin packing js implementation here https://github.com/jakesgordon/bin-packing

When I specify the frame size as 800x600

and Blocks size as 150x700,150x700 it would say that, it cant accommodate However, there is ample space. The same when 700x150, 700x150 is made, it would fit it.

How Do I adapt the code, so that it can dynamically rotate the block size and fits in to the frame.

The js packer used here is,

the below script is bin-packing First-fit algorithm,the script is running normally on ubuntu Linux and i can call bin_packing.awk, but when I try to run it on unix solaris I'm getting errors

bin_packing.awk:

I've never used Jolt Transform before and I'm not sure how to fix what I've done, so I apologize if this is actually a really easy fix.

I have two XML files (dummy versions below, actual contains PII) that I merged together using MergeRecord in NiFi. Because of the way that the output is (one flow file with an array of JSONS) it was suggested that I use JoltTransform to merge them together properly. I was pointed to this question on how to essentially do a streaming join in NiFi (which is what I needed).

While this works for the most part, I am still having one issue. All of the tags on my "base" level (FatherID, FatherName, BirthDate, etc.) are turned into arrays. I need these to not be arrays, because I'd like to use the same combined schema I used in MergeRecord (which does not have those fields as arrays).

Is there something I need to change in the spec, or do I need to do another JoltTransform (which is fine)?

Input XML 1

For my task I had to write a bin-packing algorithm where there are N objects with different volumes. They all had to be packed into boxes of volume V. Using Decreasing Sorting I successfully wrote the algorithm. But another task includes writing out all possible variations of bin-packing in an amount of boxes that I previously found most effective. So for example:

There are 4 objects with volumes: 4, 6, 3, 2. Volume of boxes is 10. Using the bin-packing algorithm I find that I will need 2 boxes.

All possible variations would be:

I'm trying to replicate this Algorithm in C, the Packing Blocks into a Fixed Rectangle part and I already make a question about it, the solution to that question was correct, but it didn't fixed the overall problem. I have found specific input that is causing a "error" and to show that, I set the values statically in the code just to make it easier for testing.

I saw this Algorithm, it's made with javascript and I'm trying to do Packing Blocks into a Fixed Rectangle in C. In my code, shown below, I read data from a .txt. This part have no problem, I'm just making a array of pointers to struct Blocks and after I sort it. After that I'm doing exactly like the code in the article, same logic, and that is where the errors are happening.