A heuristic and hybrid method for the tank allocation problem in maritime bulk shipping
DOI10.1007/S10288-016-0319-XzbMATH Open1358.90084OpenAlexW2396148133MaRDI QIDQ503667FDOQ503667
Authors: Yong-Cai Geng, Sumit K. Garg 
Publication date: 13 January 2017
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://orbit.dtu.dk/en/publications/2bab0519-2eb0-4fac-a1a3-538aa58bcf7e
Recommendations
- Tank allocation problems in maritime bulk shipping
- A two-phase heuristic for an in-port ship routing problem with tank allocation
- A heuristic approach to optimizing the loading of homogeneous marine cargo
- A tabu search heuristic for ship routing and scheduling with flexible cargo quantities
- A heuristic for sea-freight container selection, cargo allocation and cargo orientation
- A decomposition heuristics for the container ship stowage problem
- Hybrid heuristics for a short sea inventory routing problem
- scientific article; zbMATH DE number 4167870
- Stowage planning for container ships: a heuristic algorithm to reduce the number of shifts
Approximation methods and heuristics in mathematical programming (90C59) Mixed integer programming (90C11) Inventory, storage, reservoirs (90B05) Transportation, logistics and supply chain management (90B06)
Cites Work
- Container stowage planning: a methodology for generating computerised solutions
- Vehicle routing with compartments: applications, modelling and heuristics
- The petrol station replenishment problem with time windows
- A combined ship scheduling and allocation problem
- Tank allocation problems in maritime bulk shipping
- Optimization of oil tanker schedules by decomposition, column generation, and time-space network techniques
Cited In (4)
This page was built for publication: A heuristic and hybrid method for the tank allocation problem in maritime bulk shipping
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q503667)
