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: A method and system for rule-based control of order changes in transportation planning. An effect of an order change received is evaluated to identify if the effect on the transportation plan retained in persistent memory exceeds a threshold. The transportation plan is maintained unaffected if the effect does not exceed the threshold.

Abstract: A system and method of creating a transportation plan based on split orders. A received order is divided into split freight units that simulate a possible delivery for transportation. A delivery document is created and stored in persistent memory when the simulated split is planned and released.

Abstract: A new model for transportation planning vehicle scheduling (TPVS). A database table for shipment documents independent of an order for goods, e.g., a sales order is created. When an order for goods is received, the database table is populated with a shipment document corresponding to, but independent of, the order for goods. This shipment document is owned by the TPVS system.