Meta-heuristic Algorithm for the Transshipment Problem with Fixed Transportation Schedules

摘要

In this work, we develop an efficient meta-heuristic genetic algorithm for a different type of transshipment problem with supplier and customer time windows, where flow through the crossdock (a kind of transshipment center) is constrained by fixed transportation schedules and crossdocks capacities, and which was proved to be NP-complete in the strong sense. And computational experiments are conducted to show the proposed heuristic outperforms CPLEX.