Abstract:

      This paper constructs a mixedinteger linear programming model concerning liner shipping network design and empty container schedule in the case of multi-type containers. Empty containers schedule amount can be significantly decreased by assuming mutual substitution between empty containers available. We eventually employ software CPLEX to solve the model. Case study results show that we can effectively reduce the transportation cost of liner shipping company by mutual substitution between empty containers.

Key words: mutual substitution between empty containers, mixed-integer linear programming, liner shipping, empty container schedule