The project aimed to optimize logistics efficiency by analyzing the geographic distribution of Walmart store locations across Illinois, Indiana, and Michigan, and their proximity to a central warehouse. The goal was to identify optimal routing clusters, streamline delivery planning, and propose data-driven strategies for scalable warehouse-store networks.
In retail logistics, especially for companies like Walmart, spatial planning is crucial to reduce costs and enhance delivery speed. With over 50 stores in varying proximities to a central warehouse, understanding how to group, route, and service them is key to operational success. This project simulated a realistic logistics challenge using cleaned and curated geospatial data.
pandas, geopy, networkx, matplotlib
The raw data file included over 50 store records with fuzzy fields, incomplete formatting, and real-world-looking addresses.
To prepare the data:
Using the geopy.geodesic method, pairwise distances were computed between:
This created a fully connected weighted network graph representing physical distances.
Used networkx to:
This helped understand proximity, route clustering potential, and store density.

To reduce complexity and enhance regional focus: