Hub-and-spoke network design and fleet deployment for string planning of liner shipping
DOI10.1016/J.APM.2012.07.017zbMATH Open1351.90046OpenAlexW1978264689MaRDI QIDQ727347FDOQ727347
Shahin Gelareh, Rahimeh Neamatian Monemi, Philippe Mahey, 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
decompositioninteger programmingtransportationLagrangian relaxationliner shippingenvironment and emission
Deterministic network models in operations research (90B10) Transportation, logistics and supply chain management (90B06)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Ergodic, primal convergence in dual subgradient schemes for convex programming
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- On Convergence of an Augmented Lagrangian Decomposition Method for Sparse Convex Optimization
- The traveling-salesman problem and minimum spanning trees: Part II
- The volume algorithm: Producing primal solutions with a subgradient method
- Lagrangean relaxation. (With comments and rejoinder).
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- On augmented Lagrangian decomposition methods for multistage stochastic programs
- Ship scheduling: The last decade
- A multi-start local search heuristic for ship scheduling -- a computational study
- An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
- Network Design and Allocation Mechanisms for Carrier Alliances in Liner Shipping
- The volume algorithm revisited: relation with bundle methods
- A tabu search heuristic for ship routing and scheduling with flexible cargo quantities
- Lagrangean decomposition for integer nonlinear programming with linear constraints
- Lagrangean Decomposition In Integer Linear Programming: A New Scheme
- Analysis Of Lagrangian Decomposition For The Multi-Item Capacitated Lot-Sizing Problem
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)