Routing Container Ships Using Lagrangean Relaxation and Decomposition

DOI10.1287/trsc.25.3.201zbMath0729.90984OpenAlexW2105548123MaRDI QIDQ3356060

Krishan Rana, Raymond G. Vickson

Publication date: 1991

Published in: Transportation Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/trsc.25.3.201

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Transportation, logistics and supply chain management (90B06) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (16)

Single string planning problem arising in liner shipping industries: a heuristic approach ⋮ Liner shipping network design with deadlines ⋮ Model and algorithms for multi-period sea cargo mix problem ⋮ Short-term liner ship fleet planning with container transshipment and uncertain container shipment demand ⋮ Speed optimizations for liner networks with business constraints ⋮ Classification of Ship Routing and Scheduling Problems in Liner Shipping ⋮ Vessel capacity restrictions in the fleet deployment problem: an application to the Panama Canal ⋮ Optimization in liner shipping ⋮ Ship routing using genetic algorithms ⋮ Optimization in liner shipping ⋮ Methods for strategic liner shipping network design ⋮ Large-scale optimization planning methods for the distribution of United States army munitions ⋮ Optimizing voyage charterparty (VCP) arrangement: laytime negotiation and operations coordination ⋮ Modeling and Managing Uncertainty in Process Planning and Scheduling ⋮ Collaboration in Cargo Transportation ⋮ Ship scheduling: The last decade

This page was built for publication: Routing Container Ships Using Lagrangean Relaxation and Decomposition