LogisticsLab/CLP

Often it is required to determine the best possible location in the green meadow. Therewith it is the task of finding a location within a certain area where a planned logistics node can be placed optimally. This type of location decision is called continuous location planning. The individual points on a plane or on a sphere surface represent the positions of a potential location.

In the continues location planning it is differentiated between two approaches:

  • The Median Problem seeks to minimise the weighted distances of the sources to the destinations and is designed to identify one or more optimal locations. Depending on the number p of the searched locations, these problems are also referred to as p-median problem.
  • The Centre Problem minimises the maximum weighted distance of the destinations to their location responsible for delivery. Depending on the number p of the locations, these problems are also referred to as p-centres problems.


GUI CLP

GUI CLP

GUI CLP

GUI CLP