In this talk we introduce an integrated dock-door assignment and vehicle routing problem in cross-docking. This problem consists of assigning a set of incoming trucks to inbound doors at the cross-dock, consolidating commodities in-between inbound and outbound doors, and routing vehicles from outbound doors to destination points. Five mixed integer programming formulations are presented and computationally compared. A column generation algorithm based on a set partitioning formulation is developed to obtain lower bounds on the optimal solution value. In addition, a heuristic algorithm is used to obtain upper bounds. Computational experiments are performed to assess the performance of the proposed MIP formulations and solution algorithms on a set of randomly generated instances.
Group for Research in Decision Analysis