Abstract
In this work, we study a new shipment consolidation and transportation problem in crossdocking distribution networks that considers trade-offs between transportation costs, inventory and time scheduling requirements. Transportation costs include time costs, truck setup costs, and the number of trucks used. The model is formulated as an integer program, and shown to be NP -complete in the strong sense. Moreover, a solution approach is provided which consists of two stages. First, a reduced problem is solved for a truckload transportation plan. This is followed by a heuristic solution approach to the remaining less-than-truckload problem. Computational experiments are conducted to test the effectiveness and efficiency of the heuristics. The various cost parameters and time window settings of the distribution network are also discussed.
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.
