In a previous post I showed how a single warehouse location problem can be approached by locating the warehouse near its center of mass. In this post we want to locate multiple warehouses at their center of mass. We will […]

Providing a coding example for how to conduct spatial proximity customer clustering, applicable e.g. when searching for multiple centers of gravity (i.e. when wanting to solve a multiple warehouse location problem). The logic and approach is the same as in any kind […]

Operations research provides a range of algorithms for determining exact optimal solutions to discrete warehouse location problems. However, these algorithms require a cost matrix, specifying the cost for supplying customer i from warehouse j, for each customer and each warehouse. […]

In this post I provide a coding example of how a group of customers can be assigned to one warehouse each, considering a set of fixed warehouses with unlimited capacity. The underlying assumption is that there are no fixed costs […]