Liner Shipping Cargo Allocation with Repositioning of Empty Containers
From MaRDI portal
Cites work
- A two-stage stochastic network model and solution methods for the dynamic empty container allocation problem
- Allocation of empty containers between multi-ports
- Dynamic and Stochastic Models for the Allocation of Empty Containers
- Empty container management in a port with long-run average criterion
- Handbooks in operations Research \& management science: Transportation
- scientific article; zbMATH DE number 1312984 (Why is no real title available?)
- Models for multimode multicommodity location problems with interdepot balancing requirements
- Multi-objective and multi-constrained non-additive shortest path problems
- Network flows. Theory, algorithms, and applications.
- Robust optimization for empty repositioning problems
- The Decomposition Algorithm for Linear Programs
Cited in
(10)- Container shipping service selection and cargo routing with transshipment limits
- Liner shipping service scheduling and cargo allocation
- Cargo allocation and vessel scheduling on liner shipping with synchronization of transshipments
- Standardized cargo network revenue management with dual channels under stochastic and time-dependent demand
- A revised formulation, library and heuristic for a chemical tanker scheduling problem
- Fundamental properties and pseudo-polynomial-time algorithm for network containership sailing speed optimization
- Feeder ship size optimization in maritime markets with uncertainty
- Optimization in liner shipping
- Optimization in liner shipping
- A reinforcement learning approach to distribution-free capacity allocation for sea cargo revenue management
This page was built for publication: Liner Shipping Cargo Allocation with Repositioning of Empty Containers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6102725)
