Abstract: Given a set of port stations, a collection of forwarding orders to/from the port stations, and a set of available rail rakes along with their current schedules, a rake plan that maps order containers to rakes is generated. The optimization model is constrained by rake availability, rake capacity (the number of containers that can be accommodated by a rake), and the indivisibility of containers. The scheduling of the rail rakes can be represented as a sparse 3-dimensional binary matrix. Each element of the matrix indicates whether a particular rail rake is assigned to carry a particular container from a particular order in the next trip. The rail rake scheduling data can be used to generate communications from a rail rake planning server to multiple client devices, each client device associated with a different port station.

Abstract: Embodiments of the present disclosure are directed to, among other things, methods, systems, and computer program instructions related to building and managing secure digital wallets, a general ledger, and a transaction structure to securely and anonymously transfer digital coins from one wallet in a computing device to another wallet in the same device or another computing device in which both computing devices are connected via Internet or any other network medium and protocols.