1 option
Online Cargo Routing Problem with Dynamic Requests under Space-Time Network Beijing Institute of Technology, School of Mechanical Engine
- Format:
- Book
- Conference/Event
- Author/Creator:
- Xu, Xiaowei, author.
- Conference Name:
- 2025 5th International Conference on Smart City Engineering and Public Transportation (SCEPT2025) (2025-03-28 : Beijing, China)
- Language:
- English
- Physical Description:
- 1 online resource cm
- Place of Publication:
- Warrendale, PA SAE International 2025
- Summary:
- 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
- Notes:
- Vendor supplied data
- Publisher Number:
- 2025-99-0069
- Access Restriction:
- Restricted for use by site license
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.