We present an integer programming based heuristic, a matheuristic, for the liner shipping network design problem. This problem consists of finding a set of container shipping routes defining a capacitated network for cargo transport. The objective is to maximize the revenue of cargo transport,...

The multi-commodity network flow problem is an important sub-problem in several heuristics and exact methods for designing route networks for container ships. The sub-problem decides how cargoes should be transported through the network provided by shipping routes. This paper studies the...

Global liner shipping is a competitive industry, requiring liner carriers to carefully deploy their vessels efficiently to construct a cost competitive network. This paper presents a novel compact formulation of the liner shipping network design problem (LSNDP) based on service flows. The...

The cost for bunker fuel represents a major part of the daily running costs of liner shipping vessels. The vessels, sailing on a fixed roundtrip of ports, can lift bunker at these ports, having differing and fluctuating prices. The stock of bunker on a vessel is subject to a number of...

We consider a container loading problem that occurs at a typical furniture manufacturer. Each furniture item has an associated profit. Given container dimensions and a set of furniture items, the problem is to determine a subset of items with maximal profit sum that is loadable in the container....

The multicommodity flow problem (MCFP) considers the efficient routing of commodities from their origins to their destinations subject to capacity restrictions and edge costs. Baier et al. [G. Baier, E. Köhler, M. Skutella, On the k-splittable flow problem, in: 10th Annual European Symposium on...