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

DOI10.1016/j.apm.2012.07.017zbMath1351.90046OpenAlexW1978264689MaRDI QIDQ727347

Shahin Gelareh, Rahimeh Neamatian Monemi, Philippe Mahey, Nelson F. 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

integer programmingLagrangian relaxationtransportationdecompositionliner shippingenvironment and emission

Mathematics Subject Classification ID

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

Related Items (3)

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

Cites Work

• Unnamed Item
• Unnamed Item
• An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
• A tabu search heuristic for ship routing and scheduling with flexible cargo quantities
• Lagrangean decomposition for integer nonlinear programming with linear constraints
• Ship scheduling: The last decade
• The volume algorithm revisited: relation with bundle methods
• The volume algorithm: Producing primal solutions with a subgradient method
• Lagrangean relaxation. (With comments and rejoinder).
• On augmented Lagrangian decomposition methods for multistage stochastic programs
• Ergodic, primal convergence in dual subgradient schemes for convex programming
• A multi-start local search heuristic for ship scheduling -- a computational study
• Network Design and Allocation Mechanisms for Carrier Alliances in Liner Shipping
• Analysis Of Lagrangian Decomposition For The Multi-Item Capacitated Lot-Sizing Problem
• Lagrangean decomposition: A model yielding stronger lagrangean bounds
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Lagrangean Decomposition In Integer Linear Programming: A New Scheme
• On Convergence of an Augmented Lagrangian Decomposition Method for Sparse Convex Optimization
• The traveling-salesman problem and minimum spanning trees: Part II

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