Abstract
The two-dimensional vector packing problem with piecewise linear cost function (2DVPP-PLC) models a practical packing problem faced by many companies that use courier services. We propose a branch-and-price algorithm to solve the 2DVPP-PLC exactly. The column generation procedure is a key component that affects the performance of a branch-and-price algorithm. The pricing problem exhibits an interesting structure that allows us to decompose it into subproblems that form a lattice. We explore dominance relations on the lattice and design an efficient algorithm for the pricing problem. Experimental results show that our branch-and-price algorithm is capable of solving 2DVPP-PLC test instances effectively.
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.
