Impact analysis of maritime cabotage legislations on liner hub-and-spoke shipping network design
From MaRDI portal
Publication:2514794
DOI10.1016/j.ejor.2013.10.045zbMath1304.90049OpenAlexW1989176920MaRDI QIDQ2514794
Qiang Meng, Zhuo Sun, Jian-Feng Zheng
Publication date: 3 February 2015
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2013.10.045
Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Case-oriented studies in operations research (90B90)
Related Items (5)
Fundamental properties and pseudo-polynomial-time algorithm for network containership sailing speed optimization ⋮ Planning and design of intermodal hub networks: a literature review ⋮ Liner shipping network design ⋮ Hub location problem considering spoke links with incentive-dependent capacities ⋮ The capacitated directed cycle hub location and routing problem under congestion
Uses Software
Cites Work
- Location and allocation for distribution systems with transshipments and transportion economies of scale
- A quadratic integer program for the location of interacting hub facilities
- The pickup and delivery problem with time windows
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- Efficient solution procedure and reduced size formulations for \(p\)-hub location problems
- Integer programming formulations of discrete hub location problems
- Dispatching of small containers via coastal freight liners: The case of the Aegean sea.
- Solving large single allocation \(p\)-hub problems with two or three hubs
- Ship routing and scheduling in the new millennium
- A Lagrangian relaxation-based heuristic for the vehicle routing with full container load
- Network hub location problems: The state of the art
- Drive: Dynamic Routing of Independent Vehicles
- An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Hub network design with single and multiple allocation: A computational study
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
- Lagrangian Relaxation via Ballstep Subgradient Methods
This page was built for publication: Impact analysis of maritime cabotage legislations on liner hub-and-spoke shipping network design
