摘要
Chain stores use cross-dock to deliver goods to their branches by outbound trucks. Considering that the total demand of each branch is less than the truck capacity, a vehicle routing problem (VRP) is employed for the cross-dock. Although the number of cross-dock doors is constant, that of open outbound doors can affect the cross-dock performance. In this paper, new multi-objective scheduling and VRP is presented for cross-dock that simultaneously determines the routing, sequencing, and scheduling of the unloading operation of outbound trucks and the number of outbound open doors. Given that there is an NP-hard problem, four metaheuristic algorithms are proposed, and non -dominated sorting genetic algorithm-II and multi-objective simulated annealing are combined in two ways to solve the problem.
学科与关键词
文献加载失败,请重试
重试