Vehicle Routing Problem (VRP) is a well-known combinatorial optimization and integer programming problem. In the world of computing, modern vehicle routing is more focused but aligned with the GPS-based coordinate system, as the state-of- the-art vehicle, and trucking fleets are equipped with the most recent digital navigation, and coordination system. In this paper, a number of two dimensional coordinate-based algorithms for addressing the vehicle routing problem for a supply chain network covered through a delivery trucking fleet are proposed and analyzed, and the algorithms are compared with other available, and the most recent heuristics in the literature. For the algorithms discussed, which includes a proposed coordinate-based heuristic search as well, the advantages and the disadvantages associated with each heuristic is further elaborated. The proposed algorithms are navigated with specific application focus to a moderate sized supermarket chain delivery network that supplies to its stores in four different states around the East Coast area, and is trying to optimize its trucking delivery cost. Minimizing the delivery cost from the warehouse to the retail stores in the supply chain network of a supermarket distributor is important to ensure its business success, and also to thrive and survive in the competitive grocery and food chain supply industry.