Abstract: A method for positioning items in a box includes providing a list of items, a list of boxes, dimensional data for each item, position-restricting data for each item, a system for assembling the boxes, a system for placing each item into a main box, a control unit connected having an algorithm for selecting the box and how the items are introduced into the box; and applying the algorithm to select a main box having a minimum size sufficient to contain the items and minimize empty space, and to determine order of introduction, position and rotation of the items; and applying the algorithm to the placing system. Applying the algorithm includes calculating the contact surface areas of each item to maintain the contact surface area above a minimum threshold, thereby ensuring stable positioning and reducing the volume of the filler. A system for positioning items in a box.

Abstract: A method for positioning items in a box includes providing a list of items, a list of boxes, dimensional data for each item, position-restricting data for each item, a system for assembling the boxes, a system for placing each item into a main box, a control unit connected having an algorithm for selecting the box and how the items are introduced into the box; and applying the algorithm to select a main box having a minimum size sufficient to contain the items and minimize empty space, and to determine order of introduction, position and rotation of the items; and applying the algorithm to the placing system. Applying the algorithm includes calculating the contact surface areas of each item to maintain the contact surface area above a minimum threshold, thereby ensuring stable positioning and reducing the volume of the filler. A system for positioning items in a box.

Abstract: A method for configuring a communication network includes the steps of identifying a given network configuration having a given network topology based on arcs having associated administrative routing weights and including a number of given shortest paths, generating at least one neighbouring configuration by producing in the network topology a perturbation leaving the administrative routing weights unaffected and wherein the majority of the shortest paths in the neighbouring configuration have the shortest paths from the number left unaffected by the perturbation and combinations of shortest paths from the number evaluating the neighbouring configuration against the given configuration based on a given cost function, whereby the evaluation involves only the portion of the network topology affected by the perturbation, and substituting the neighbouring configuration for the given configuration if the neighbouring configuration is found to represent an improvement over the given configuration based on the cost