Routing Container Ships Using Lagrangean Relaxation and Decomposition

DOI10.1287/TRSC.25.3.201MaRDI QIDQ3356060zbMATH OpenOpenAlexFDO

Authors 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

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

Cited in

(16)

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

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

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