Bi-objective heuristics for multi-item freights distribution planning problem in crossdocking networks

Crossdocking is a distribution strategy in which distribution centers operate as transfer points to harmonize the continuous physical flow through supply chain with the least storage. The coordination of this system in a network of crossdocks with multitype and time-restricted pickups and deliveries requires a complex planning. This paper addresses the distribution planning problem of crossdocking network, considering transshipment possibility among crossdocks and tardiness permission for some pickups. The problem is formulated as a bi-objective integer-programming model minimizing total transportation and holding costs and total tardiness. An innovative heuristic procedure to construct an effective initial solution and three improving algorithms based on appropriate meta-heuristics (variable neighborhood search, tabu search, and simulated annealing) is developed to solve the problem. Experimental results demonstrate the potency of proposed algorithms achieving remarkable results.