Hub-and-spoke network design and fleet deployment for string planning of liner shipping

DOI10.1016/J.APM.2012.07.017MaRDI QIDQ727347zbMATH OpenOpenAlexFDO

Authors Shahin Gelareh, Philippe Mahey, Rahimeh Neamatian Monemi, Nelson Maculan

Publication date 6 December 2016

Published in Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.apm.2012.07.017

zbMATH Keywords

decompositioninteger programmingtransportationLagrangian relaxationliner shippingenvironment and emission

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Transportation, logistics and supply chain management (90B06)

Recommendations

• Methods for strategic liner shipping network design
• Liner shipping network design
• Integrated planning of ship deployment, service schedule and container routing
• Single liner shipping service design
• A service flow model for the liner shipping network design problem

Cites work

• scientific article; zbMATH DE number 4104668 (Why is no real title available?)
• scientific article; zbMATH DE number 3559294 (Why is no real title available?)
• A multi-start local search heuristic for ship scheduling -- a computational study
• A tabu search heuristic for ship routing and scheduling with flexible cargo quantities
• An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
• Analysis Of Lagrangian Decomposition For The Multi-Item Capacitated Lot-Sizing Problem
• Ergodic, primal convergence in dual subgradient schemes for convex programming
• Lagrangean Decomposition In Integer Linear Programming: A New Scheme
• Lagrangean decomposition for integer nonlinear programming with linear constraints
• Lagrangean decomposition: A model yielding stronger lagrangean bounds
• Lagrangean relaxation. (With comments and rejoinder).
• Network design and allocation mechanisms for carrier alliances in liner shipping
• On Convergence of an Augmented Lagrangian Decomposition Method for Sparse Convex Optimization
• On augmented Lagrangian decomposition methods for multistage stochastic programs
• Ship scheduling: The last decade
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• The traveling-salesman problem and minimum spanning trees: Part II
• The volume algorithm revisited: relation with bundle methods
• The volume algorithm: Producing primal solutions with a subgradient method

Cited in

(4)

• Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints
• Single string planning problem arising in liner shipping industries: a heuristic approach
• Planning and design of intermodal hub networks: a literature review
• Revisiting a class of liner fleet deployment models

This page was built for publication: Hub-and-spoke network design and fleet deployment for string planning of liner shipping

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q727347)