Capacitated Vehicle Routing Problem Using Conventional and Approximation Method

  title={Capacitated Vehicle Routing Problem Using Conventional and Approximation Method},
  author={Apurva Anil Choudhari and Amey Ekbote and Prerona Chaudhuri},
—This paper attempts to solve the famous Vehicle Routing Problem by considering multiple constraints including capacitated vehicles, single depot, and distance using two approaches namely, cluster first and route the second algorithm and using integer linear programming. A set of nodes are provided as input to the system and a feasible route is generated as output, giving clusters of nodes and the route to be traveled within the cluster. For clustering the nodes, we have adopted the DBSCAN… 



The demand weighted vehicle routing problem

An open source Spreadsheet Solver for Vehicle Routing Problems

A new approach for solution of vehicle routing problem with hard time window: an application in a supermarket chain

AbstractIn this study, a vehicle routing problem with hard time windows (VRPHTW) that appears to meet demands of customers’ service within time intervals in a supermarket chain is solved. In VRPHTW,

Neural Combinatorial Optimization with Reinforcement Learning

A framework to tackle combinatorial optimization problems using neural networks and reinforcement learning, and Neural Combinatorial Optimization achieves close to optimal results on 2D Euclidean graphs with up to 100 nodes.

Solution to a Multi Depot Vehicle Routing Problem Using K-means Algorithm, Clarke and Wright Algorithm and Ant Colony Optimization