VEHICLE ROUTING PROBLEM WITH CAPACITY CONSTRAINTS

Abstract

Today, with the exponential growth of online shopping sites on World Wide Web, there is an increasing demand by the companies, of software solutions that take customers’ requests and location as input and automatically design the everyday routes for the delivery men, with the uniform distribution of the load among them. EazyRoute is the desired solution. It provides the user with the ability to generate approximate optimal delivery routes from a central depot to geographically scattered customers depending on given constraints. It creates path in two phases: First it generates an initial solution using heuristic algorithms on the basis of given constraints. Then, the resulting solution is optimized using meta-heuristic algorithms. It provides the detailed description of different routes as well as graphical description of the routes. The main focus of EazyRoute is to generate optimal solutions that minimize the total distance travelled by delivery men while distributing the load uniformly among them. User has the options to customize the routes on the basis of the Number of vehicles, Capacity of vehicle, Maximum route length/vehicle. EazyRoute implements various proved heuristic and meta-heuristic algorithms and provides user with the option to choose different combinations of them to acquire best results. It can also be incorporated with our proposed algorithm New_RTR to generate more optimize solutions.