Optimizing cargo flow for tramp and industrial shipping

This paper considers a class of deterministic cargo ship routing and scheduling problems with time windows, for several shipping types. To solve these problems, this paper provides an Adaptive Large Neighborhood Search heuristic. This heuristic is evaluated against the CPLEX method that uses a marginal integer program provided in this paper. The heuristic provides high quality solutions on the field of efficiency for all the instances used, with some optimal solution for smaller instances. Furthermore, this paper discusses several methods in cost assignment among customers. Afterwards we compares these methods for several characteristics with each other and give our findings on every methods performances per characteristic.