Abstract

Due to the very large number of online supermarket’s orders, it is necessary to consider loading constraints of the packages while arranging vehicle schemes. It is expected to greatly improve the loading rate and reduce distribution costs. Aiming at the delivery problem from supermarket’s distribution center to the delivery stations, this paper studies the three dimensional loading constrained vehicle routing problem. First of all, according to the actual conditions of packing problem, it designs heuristic rules for packing activity and calculation formulation for residual loading capacity, based on which a three dimensional loading is proposed. Combined with the loading algorithm, it then presents the initial vehicle scheme generation measure and designs optimization method of schemes. Finally, it constructs an experimental example to validate the proposed solution procedure. The result shows the validity of the procedure for vehicle routing problem with loading constraints of large number of packages.

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 call

Disclaimer: 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.