Solving the capacitated vehicle routing problem with Lexi-search approach

B. Mahaboob, P. Venkateswararao, V.B.V.N. Prasad, G. Balaji Prakash, T. Nageswara Rao, D. Sateesh Kumar

Abstract


In this paper we present a variant vehicle routing problem called “Solving the Capacitated Vehicle Routing Problem with Lexi-Search Approach” (CVRP). The purpose of this article is to propose an efficient Lexi-Search Algorithm using pattern recognition technique for solving CVRP on a scalable multicomputer platform and to obtain an optimal solution. Our results show that the proposed algorithm is highly competitive on a set of benchmark problems. In this paper we focus our investigation on solving the capacitated VPR (CVPR) and considered a variant vehicle routing problem called as Solving the Capacitated Vehicle Routing Problem with Lexi-Search Approach”. First the model is formulated into a zero-one programming problem. A Lexi-Search Algorithm using Pattern Recognition Technique is developed for getting an optimal solution. The problem is discussed with suitable numerical illustration. We have programmed the proposed algorithm using C-language. The computational details are reported. As an observation the CPU run time is fairly less for higher values to the parameters of the problem to obtain optimal solutions.

Full Text: PDF

Published: 2021-06-15

How to Cite this Article:

B. Mahaboob, P. Venkateswararao, V.B.V.N. Prasad, G. Balaji Prakash, T. Nageswara Rao, D. Sateesh Kumar, Solving the capacitated vehicle routing problem with Lexi-search approach, J. Math. Comput. Sci., 11 (2021), 4766-4798

Copyright © 2021 B. Mahaboob, P. Venkateswararao, V.B.V.N. Prasad, G. Balaji Prakash, T. Nageswara Rao, D. Sateesh Kumar. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

 

Copyright ©2022 JMCS