Abstract: Physical Internet (PI) dynamic principal interface node (PIN) port selection includes selecting a primary maritime port as a PIN in a routing of freight aboard a sea going vessel from an origin node to a destination node in a PI model and receiving a disruption event in the PI model indicating an inability of the vessel to berth at the primary maritime port. A cluster of alternative PINs is determined in connection with the destination node of the PI model and a routing score computed for each alternative PIN based upon a cost of routing the freight through each alternative PIN. Finally, a new routing is established in the PI model utilizing an optimal alternative PIN in lieu of the selected PIN based upon a corresponding routing score, and a message is transmitted to the vessel to divert to a secondary maritime port associated with the optimal alternative PIN.

Abstract: The optimized dynamic scheduling of barges in inland waterways includes geolocating a set of barges positioned on an inland waterway and receiving current data for the inland waterway at each geolocation of each barge in the set. An estimated time of arrival (ETA) for each barge is retrieved from a table at a location for each barge along the inland waterway at which point the barge unloads onboard freight rendering the barge available to receive transport of new freight. Each ETA is modified for each barge according to the received current data at multiple different positions along a route in the inland waterway. Finally, an availability table for the barges in the set is constructed based upon each modified ETA so that barge availability queries received from over a computer communications network can be responded to with availability information stored in the availability table.

Abstract: Recursive multi-criteria Physical Internet (PI) freight orchestration includes the loading a hierarchy of connected nodes and specifying a starting node and ending node within the hierarchy. Different combinations of the connected nodes are determined which connect the starting node and the ending node, each defining a corresponding routing of the freight in a set of possible routings. Thereafter, for each corresponding routing of the freight, a route value is recursively computed from the starting node through the ending node and across different intermediate nodes of the routing for the freight connecting the starting node and the ending node. Each recursively computed route value is processed in order to select, amongst the possible routings, a selected routing for transporting the freight to the geographic destination and a record can be written with the selected routing for transporting the freight to the geographic destination.