Liner Shipping Cargo Allocation with Repositioning of Empty Containers
From MaRDI portal
Publication:6102725
DOI10.3138/infor.49.2.109WikidataQ58826378 ScholiaQ58826378MaRDI QIDQ6102725
Berit Dangaard Brouer, Simon Spoorendonk, David Pisinger
Publication date: 9 May 2023
Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)
Related Items (10)
Fundamental properties and pseudo-polynomial-time algorithm for network containership sailing speed optimization ⋮ A revised formulation, library and heuristic for a chemical tanker scheduling problem ⋮ A reinforcement learning approach to distribution-free capacity allocation for sea cargo revenue management ⋮ Container shipping service selection and cargo routing with transshipment limits ⋮ Liner shipping service scheduling and cargo allocation ⋮ Optimization in liner shipping ⋮ Standardized cargo network revenue management with dual channels under stochastic and time-dependent demand ⋮ Cargo allocation and vessel scheduling on liner shipping with synchronization of transshipments ⋮ Optimization in liner shipping ⋮ Feeder Ship Size Optimization in Maritime Markets with Uncertainty
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multi-objective and multi-constrained non-additive shortest path problems
- Allocation of empty containers between multi-ports
- Models for multimode multicommodity location problems with interdepot balancing requirements
- Empty container management in a port with long-run average criterion
- A Two-Stage Stochastic Network Model and Solution Methods for the Dynamic Empty Container Allocation Problem
- The Decomposition Algorithm for Linear Programs
- Robust Optimization for Empty Repositioning Problems
- Dynamic and Stochastic Models for the Allocation of Empty Containers
This page was built for publication: Liner Shipping Cargo Allocation with Repositioning of Empty Containers
