Abstract: The example embodiments are directed to methods and systems for generating a model of an optimum flow of materials within a supply network based on a relax mixed integer programming model. For example, the method may include generating, via a software application, a model of the supply network based on the data stored in the storage device, executing a MIP optimizer on the model to generate a configuration of a flow of materials within the supply network, wherein the MIP optimizer is instructed to relax discrete constraints within the supply network when generating the configuration, generating a graphical user interface that includes a plurality of graphical objects corresponding to a plurality of locations included in the configuration and directional edges between the plurality of graphical objects corresponding to the flow of the materials between the plurality of locations, and displaying the graphical user interface.

Abstract: The invention relates to a method for recognizing at least one instance of an object during a work sequence in a working environment, said method comprising the steps (A) recording an image of the working environment by means of a camera apparatus, (B) transmitting the image to a monitoring and control unit, (C) detecting a predefined or predefinable starting region for the segmenting of the instance in the image, whereby the instance is selected by the monitoring and control unit for the segmenting, and (D) segmenting the instance in the image, starting from the starting region that is detected and that is arranged within the instance, by means of the monitoring and control unit and recognizing the segmented instance.

Abstract: The example embodiments are directed to methods and systems for generating a model of an optimum flow of materials within a supply network based on a relax mixed integer programming model. For example, the method may include generating, via a software application, a model of the supply network based on the data stored in the storage device, executing a MIP optimizer on the model to generate a configuration of a flow of materials within the supply network, wherein the MIP optimizer is instructed to relax discrete constraints within the supply network when generating the configuration, generating a graphical user interface that includes a plurality of graphical objects corresponding to a plurality of locations included in the configuration and directional edges between the plurality of graphical objects corresponding to the flow of the materials between the plurality of locations, and displaying the graphical user interface.

Abstract: According to one general aspect, a method of transportation management may include receiving a request to transport a current freight unit from a current source location to a current destination location. The method may include selecting a prior shipment path based upon a similarity, as defined by a set of predefined criteria, between the current freight unit and a prior freight unit. The method may further include initializing a shipment path improver with the prior shipment path. The method may also include generating, via the shipment path improver, a current shipment path for the current freight unit from the current source location to the current destination location based upon the prior shipment path.

Abstract: A method of processing incompatibilities for a transportation plan comprising the following steps: Receiving data which is descriptive of orders, data which is descriptive of available vehicles, and data which is descriptive of available cross-docking locations; reading a set of compatibility types, and a set of compatibility rules with respect to the plurality of orders, vehicles, and cross-docking locations, each compatibility rule specifying a combination of two values which refer to first and second attributes of a defined compatibility type, and being indicative whether or not they are compatible; associating a value with each order, the value being descriptive of the characteristics of the order, such that orders having the same characteristics have the same value associated therewith; replacing the data descriptive of the characteristics by the value associated therewith; and outputting the order data resulting from the preceding step.

Abstract: A method of processing incompatibilities for a transportation plan comprising the following steps: Receiving data which is descriptive of orders, data which is descriptive of available vehicles, and data which is descriptive of available cross-docking locations; reading a set of compatibility types, and a set of compatibility rules with respect to the plurality of orders, vehicles, and cross-docking locations, each compatibility rule specifying a combination of two values which refer to first and second attributes of a defined compatibility type, and being indicative whether or not they are compatible; associating a value with each order, the value being descriptive of the characteristics of the order, such that orders having the same characteristics have the same value associated therewith; replacing the data descriptive of the characteristics by the value associated therewith; and outputting the order data resulting from the preceding step.

Abstract: A method of processing incompatibilities for a transportation plan comprising the following steps: Receiving data which is descriptive of orders, data which is descriptive of available vehicles, and data which is descriptive of available cross-docking locations; reading a set of compatibility types, and a set of compatibility rules with respect to the plurality of orders, vehicles, and cross-docking locations, each compatibility rule specifying a combination of two values which refer to first and second attributes of a defined compatibility type, and being indicative whether or not they are compatible; associating a value with each order, the value being descriptive of the characteristics of the order, such that orders having the same characteristics have the same value associated therewith; replacing the data descriptive of the characteristics by the value associated therewith; and outputting the order data resulting from the preceding step.

Abstract: A method of processing incompatibilities for a transportation plan comprising the following steps: Receiving data which is descriptive of orders, data which is descriptive of available vehicles, and data which is descriptive of available cross-docking locations; reading a set of compatibility types, and a set of compatibility rules with respect to the plurality of orders, vehicles, and cross-docking locations, each compatibility rule specifying a combination of two values which refer to first and second attributes of a defined compatibility type, and being indicative whether or not they are compatible; associating a value with each order, the value being descriptive of the characteristics of the order, such that orders having the same characteristics have the same value associated therewith; replacing the data descriptive of the characteristics by the value associated therewith; and outputting the order data resulting from the preceding step.

Abstract: Methods and apparatus, including computer program products, for optimizing a total cost associated with transporting products on a set of vehicles. Orders representing products are assigned to one or more vehicles in the set. The assignment defines a sequence of pickup and delivery activities for the vehicles. One or more orders are deleted from one or more vehicles; at least one order from the deleted orders is inserted into a vehicle; the assignment is changed for at least one vehicle; and a cost is determined for the transportation of the products on the set of vehicles. The steps of deleting one or more orders, inserting at least one order, changing the assignment, and determining a cost, are repeated until an optimal cost has been determined.