Design and Implementation of an Improved Parallel-Accelerated Solution for Urban CVRP. Baghdad as a Case Study

The most common variant of VRP of Iraqi big-scale enterprises is Capacitated Vehicle Routing Problems (CVRP) where such enterprises have several dispersed affiliates.This paper presents an application-database 3-stages customizable framework based on urban asymmetric road network by including Sweep clustering, PostgreSQL Dijkstra and saving heuristics for routing applied on actual dataset considering CVRP for an enterprise composed of a single depot and 91 nodes in Baghdad.The solution was built in a generalizable flexible architecture applicable for other organizations.It also demonstrates utilizing parallel-processing techniques for speed up.Improved versions of Clarke-Wright and Parker-Holmes algorithms were used and achieved improvement of (15.7 and 9.03) times in asymmetric clustering scenario, 1.57 times in case of asymmetric non-clustering scenario, and 1.678 in symmetric implementation of the cost minimization satisfied by their corresponding original bases.The study includes implementation details, results analysis and provides insightful information to operation-researches practitioners especially in Iraq.