Systems, methods, and articles of manufacture for dynamic assignment retrieval

A system for determining a transport path between two transportation states using a dynamic retrieval of assigned application data, comprising:

• a database for providing transportation master data including
• an input set G of hierarchically organized data elements g, wherein the elements g of the input set G relate to at least one of transportation states and transportation lanes connecting transportation states;
• a condition set M of hierarchically organized data constraint elements m, wherein the elements m of the condition set M relate to transportation constraints;
• for each element g of the input set G a static condition assignment set IM(g) with elements m of the condition set M;
• for each element (g,m) of the Cartesian product of the input set G and the condition set M a static value assignment set IP(g,m) with data associations p included in a value set P, wherein the elements p of the value set P relate to transportation associations;
• and
• a processor for determining a transport path between at least one first element g of the input set G and at least one second element g of the input set G via a plurality of third elements g of the input set G including:
• dynamically determining from the transportation master data for elements g of the input set G application assignment sets A(g) with elements (m,p) of the Cartesian product of the condition set M and the value set P, taking into account the hierarchical organization of the input set G and the condition set M;
• and
• performing transport path optimization taking into account the assignments included in the determined application assignment sets A(g).

A computer program product, tangibly embodied in a storage medium, for causing a computer to perform a method for determining a transport path between two transportation states using a dynamic retrieval of assigned application data, the method comprising:

• providing transportation master data including
• an input set G of hierarchically organized data elements g, wherein the elements g of the input set G relate to at least one of transportation states and transportation lanes connecting transportation states;
• a condition set M of hierarchically organized data constraint elements m, wherein the elements m of the condition set M relate to transportation constraints;
• for each element g of the input set G a static condition assignment set IM(g) with elements m of the condition set M;
• and
• for each element (g,m) of the Cartesian product of the input set G and the condition set M a static value assignment set IP(g,m) with data associations p included in a value set P, wherein the elements p of the value set P relate to transportation associations;
• and
• determining a transport path between at least one first element g of the input set G and at least one second element go of the input set G via a plurality of third elements g of the input set G including:
• dynamically determining from the transportation master data for elements g of the input set G application assignment sets A(g) with elements (m,p) of the Cartesian product of the condition set M and the value set P, taking into account the hierarchical organization of the input set G and the condition set M;
• and
• performing transport path optimization taking into account the assignments included in the determined application assignment sets A(g).