Online Cargo Routing Problem with Dynamic Requests under Space-Time Network

Cargo Routing Problem or Container Allocation Problem is key decision-making challenge in the maritime industry at operational level. Existing research focus on static environment or planning decisions, ignoring the dynamic arrival property of shipping request in practical world. In this paper, we introduced the Online Cargo Routing problem and formulation the path-based models under a space-time network. We proposed an online algorithm under the online primal-dual scheme: re-solving strategy. We further conducted simulation experiments under different demand distributions to demonstrate the performance of the proposed algorithm over the offline baselines.