Abstract
With the growth in delivery demand owing to the expansion of e-commerce and COVID-19, parcel delivery network optimization has become a significant issue for courier companies. This study introduces a real-world parcel delivery network problem in which parcels are transported from origin to destination spokes via one or two hubs. The parcels are sorted in hubs for distribution to spokes. Regular- and small-sized parcels are considered in the optimization problem. Moreover, small-sized parcels can be consolidated into gunnysacks based on their destination for efficient handling. A mixed-integer programming (MIP) model, large neighborhood search (LNS), and matheuristic algorithm combining the two aforementioned approaches were developed. Additionally, 90 benchmark instances reflecting real-world problems were generated. The MIP, matheuristic algorithm, and LNS performed well in small-, medium-, and large-sized instances, respectively. The benchmark instances and source codes are accessible online.
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.
