Abstract
A generalization of the traditional vehicle routing problem (VRP) is studied in this paper. Each customer may order several products, the vehicles are identical and have several compartments, each compartment being dedicated to one product. The demand of each customer for a product must be entirely delivered by one single vehicle. However, the different products required by a customer may be brought by several vehicles. Two algorithms to solve this problem are proposed: a memetic algorithm with a post-optimization phase based on path relinking, and a tabu search method. These algorithms are evaluated by adding compartments to classical VRP instances.
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.
