Sap Ag

Sap Se

Sap Aktiengeselleschaft

Jens Gottlieb

Konstantin N Malitski

Christoph Eckert

Holger Huene

Thomas H Engelmann

Jochen Christoph Eckert

Carsten Schumm

Marcus Zahn

Lars Vogel

A transportation management system may include a connection cache configured to store connection-relevant transportation information for transportation objects. The connection-relevant transportation information may have been replicated from at least one of a plurality of transportation object sources including at least a first database storing schedules, a second database storing freight bookings, and a third database storing freight orders. The transportation management system may also include a connection cache access engine configured to receive transportation parameters including at least a first location and a second location, and query the connection cache to dynamically select one or more transportation objects from the connection cache related to at least one of the schedules, the freight bookings, and the freight orders, that are relevant for the first location and the second location.

Transportation connection cache for dynamic network and route determination

Embodiments of the invention include a system for scheduling the shipment of a set of products. The shipment may be loaded into a set of vehicles and further configured to fit a set of compartments on those vehicles. The system may include attempts to fill each vehicle and the compartments of each vehicle. The system may include evaluating a set of constraints on the shipment. The constraints may include a complex logical statement.

Vehicle scheduling and routing with compartments

Combining multiple objective functions to perform algorithmic problem solving is described. A first algorithm performs processing on a complex problem and generates multiple solutions to the problem. One or more solutions as generated by the first algorithm are send to one or more additional algorithms for further processing of complex sub-problems bounded by the first algorithm. The solutions to the first algorithm are used as input to the additional algorithms, where those solutions include at least one boundary condition under which the additional algorithms process the sub-problems. Ultimate solutions satisfy boundary conditions of the first algorithm, and all conditions of the additional algorithms. Algorithms may be executed in combinations of parallel and/or sequential operation to generate a final solution considering multiple different sub-problems to the complex problem.

Combining multiple objective functions in algorithmic problem solving

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.

Incompatibility processing

Growing community of inventors

Schwetzingen, Germany

Jens Gottlieb