Fundamental properties and pseudo-polynomial-time algorithm for network containership sailing speed optimization
From MaRDI portal
Publication:322396
DOI10.1016/j.ejor.2015.10.052zbMath1346.90189MaRDI QIDQ322396
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2015.10.052
90C60: Abstract computational complexity for mathematical programming problems
90C30: Nonlinear programming
90B06: Transportation, logistics and supply chain management
90C08: Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)
Related Items
A Joint Vehicle Routing and Speed Optimization Problem, Schedule design for liner services under vessel speed reduction incentive programs, Tug scheduling for hinterland barge transport: a branch-and-price approach, Revisiting a class of liner fleet deployment models, Bunkering policies for a fuel bunker management problem for liner shipping networks, Speed optimizations for liner networks with business constraints, Liner ship bunkering and sailing speed planning with uncertain demand
Uses Software
Cites Work
- Unnamed Item
- Distribution-free vessel deployment for liner shipping
- The vessel schedule recovery problem (VSRP) -- a MIP model for handling disruptions in liner shipping
- Methods for strategic liner shipping network design
- A service flow model for the liner shipping network design problem
- Ship routing and scheduling in the new millennium
- Impact analysis of maritime cabotage legislations on liner hub-and-spoke shipping network design
- Analysis of an exact algorithm for the vessel speed optimization problem
- Reducing fuel emissions by optimizing speed on shipping routes
- Searching for the Multiplier in One-Constraint Optimization Problems
- Liner Shipping Cargo Allocation with Repositioning of Empty Containers
