Abstract
This paper addresses an essential loading optimization problem arising in the outbound logistics of automobiles. The problem is to assign a set of orders of finished cars to a set of heterogeneous auto-carriers and to deliver these finished cars from a depot to multiple destinations. The involved destinations are located within a relatively small distance to the depot. A value corresponding to each order represents its urgency level, and an inter-set cost is defined among destinations to estimate the related transportation cost. The objective of the problem is to maximize the weighted total value of the assigned orders minus the total inter-set cost subject to a full-load constraint and a downward compatible loading structure. An integer programming model and a column generation based algorithm are proposed. The proposed algorithm is implemented based on serial and parallel programming, respectively. Computational results based on randomly generated instances and a case study with real data show that the proposed algorithm can generate near-optimality solutions efficiently, and outperforms solving the integer programming model by an IP solver and a rule-based method applied in practice.
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.
