Abstract

In this article, we discuss variant of the multi-depot vehicle routing problem where depots can act as intermediate replenishment facilities along the route of a vehicle. This problem is a generalization of the Vehicle Routing Problem (VRP). In the sequel we developed a Lexi-Search algorithm based “Pattern Recognition Technique” to solve this problem which takes care of simple combinatorial structure of the problem and computational results are reported.In this paper, we consider a real-world problem with a loaded vehicle. The vehicle is available for pickup and delivery service. Single-commodity cargo, that is, same cargo type, is present at the customer sites. The vehicle is able to carry out a Pickup and delivery service of such cargo among the customers. By starting and ending at the origin depot, the vehicle follows a route without having a predefined sequence of Pickup and delivery services.

Full Text
Paper version not known

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.