Optimizing liner shipping fleet repositioning plans

DOI10.1007/978-3-319-17665-9zbMath1333.90005OpenAlexW2476187333WikidataQ60145761 ScholiaQ60145761MaRDI QIDQ269936

Kevin Tierney

Publication date: 6 April 2016

Published in: Operations Research/Computer Science Interfaces Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-17665-9

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Case-oriented studies in operations research (90B90) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (4)

A biased random-key genetic algorithm for the container pre-marshalling problem ⋮ A branch and bound approach for large pre-marshalling problems ⋮ Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm ⋮ CP methods for scheduling and routing with~time-dependent task costs

Uses Software

• CPLEX
• Gurobi
• OR-tools
• Unnamed Item

This page was built for publication: Optimizing liner shipping fleet repositioning plans