Solving the capacitated vehicle routing problem with Lexi-search approach

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.