Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
