Abstract
Vehicle Routing Problem is based on the generalization of Travelling Salesman Problem and it is a combinatorial optimization problem. Vehicle Routing Problem can have multiple routes to traverse whereas Travelling Salesman Problem has only one route. Route optimization is a complex task when the problem has more number of destination points. The objective of solving the vehicle routing problem is to deliver the products or goods in a right destination with some time management. In order to achieve these constraints, an effective route planning is required. There are different types of routing problems which are solved using so many algorithms. Among those types, one of the best known problems is Capacitated Vehicle Routing Problem. The Capacitated Vehicle Routing Problem deals with the total distance travelled, total cost and some other special parameters on a demand basis. Many authors have proposed the solutions to solve the Capacitated Vehicle Routing Problem in the recent years. This study mainly aims to expose the Capacitated Vehicle Routing Problem based papers where it reveals the problem statement, type of algorithm used and the parameters achieved from the findings are stated for all the mentioned articles.. The articles are taken from the recent periods.
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.
