Packing optimization

How big will the packaging be?

In order to keep the shipping cost down, purchased goods need to be packaged into as few and small packages as possible. Very often this makes it is difficult to know in advance how large the final package will be and how many shipments are needed to transport the customer's goods.

This is a big problem for those web shops who want to show their customers real shipping costs. It is also an unnecessary obstacle when booking freights quickly because it requires constant manual work to choose the right package size.

Optimal packing all the time

With Fraktjakt's built-in package optimization, both your online store and your employees can be assigned the right packaging size for the freight immediately. Drop the monotonous entering of the shipments dimensions as they are are calculated automatically.

Preloaded with packing algorithms

Fraktjakt offers advanced bin packing methods at no expense for anyone with a web shop connection. These methods calculate what packaging is needed and which goods to pack in which package to minimize the number of packages and shipments.

Lots of possible packaging combinations are automatically calculated for each new order connection from your webshops. Fraktjakt then selects the best packaging for your shipment depending on which packaging you have available.

• 

  Default package template if the commodities fits

  All the commodities are expected to fit in the Default package template. A very fast and simple method.

  Works best when purchasing shipments on your own shipment contract, when you don't need to calculate correct price in advance.

• 

  Fraktjakt's Basic packing algorithm

  A faster but simpler packing method. Uses all active Package templates and attempts to place the commodities in as few and as small packages as possible. Requires full measure of all the commodities. Otherwise, the Fallback is used.

  Works best when having only flat or few commodities.

• 

  Fraktjakt's Universal packing algorithm

  A more universal packing method. Uses all active Package templates and attempts to place the commodities in as few and as small packages as possible. Requires full measure of all the commodities. Otherwise, the Fallback is used.

  Our recommended method that works best in most scenarios.

• 

  Fraktjakt's Meticulous packing algorithm

  A more meticulous packing and time consuming method that explores more ways to pack your items. Uses all active Package templates and attempts to place the commodities in as few and as small packages as possible. Requires full measure of all the commodities. Otherwise, the Fallback is used.

  Should be used when our Universal method is not enough for your needds.

• 

  One package per commodity

  A quick and easy method where each item is expected to be sent in a separate package with the dimensions specified for the item. The value of the padding controls how much larger the packaging is expected to be. If an item fits with a Commodity template, the dimensions are supplemented from there and if that content template is linked to a package template, that package template is used. Requires complete measurements of all items otherwise the Fallback is used.

  Should only be used in cases where each item is actually expected to be sent separately and the stated dimensions are correct for the packaging.

• 

  Weight based packing algorithm

  Submitted measurements of goods are ignored. Only the weight is retained. The maximum weight of the package templates is then used to determine which package template should be used. At the same maximum weight, the lowest volume is used. If a package template holds a maximum of two kg and you send three items of one kg each, two items fit in one package and one item in another package.
• 

  Only the Default package template

  All the commodities are expected to fit in the Default package template. A very fast and simple method.

  Works best when purchasing shipments on your own shipment contract, when you don't need to calculate correct price in advance.

• 

  Volume-based packing algorithm

  A method that does not use any predefined package templates but instead builds a package based on the dimensions of the items. The longest item determines the package length, and the remaining dimensions are calculated from the total volume, making width and height equal.

  Padding controls how much extra space is added around each item. Works best when you want a simple and approximate packaging without relying on predefined templates.

• 

  Volume-based bundling

  A method that does not use any predefined package templates but instead builds a bundle based on the dimensions of the items. The longest item determines the bundle length, and the remaining dimensions are calculated from the total volume, making width and height equal.

  No extra space (padding) is added. Works best when you want to combine several items without requiring exact package dimensions.