Liner shipping network design with deadlines

DOI10.1016/j.cor.2013.08.014zbMath1348.90139OpenAlexW2045059638MaRDI QIDQ336778

Qiang Meng, Shuaian Wang

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2013.08.014

zbMATH Keywords

column generationNP-hardliner shipping network designtransit time

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Related Items (10)

Competitive liner shipping network design ⋮ A branch-and-price approach to the feeder network design problem ⋮ Liner shipping network design ⋮ An economic analysis of introducing autonomous ships in a short‐sea liner shipping network ⋮ Container shipping service selection and cargo routing with transshipment limits ⋮ Optimizing locations and scales of emergency warehouses based on damage scenarios ⋮ 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 ⋮ Speed optimization and bunkering in liner shipping in the presence of uncertain service times and time windows at ports ⋮ Bunker fuel cost and freight revenue optimization for a single liner shipping service

Uses Software

• LINERLIB

Cites Work

• A large neighbourhood search heuristic for ship routing and scheduling with split loads
• Multi-dimensional bin packing problems with guillotine constraints
• Tank allocation problems in maritime bulk shipping
• Ship scheduling: The last decade
• Ship routing and scheduling in the new millennium
• A multi-start local search heuristic for ship scheduling -- a computational study
• Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows
• Routing Container Ships Using Lagrangean Relaxation and Decomposition
• A Model and Solution Algorithm for Optimal Routing of a Time-Chartered Containership
• Selected Topics in Column Generation

This page was built for publication: Liner shipping network design with deadlines