LogisticsLab/CLP

LogisticsLab/CLP is a software to solve continuous (and discrete) median and centre problems. Continuous location problems determine the best possible greenfield location. The point where a planned logistics node can be optimally placed is to be found within a certain area. The individual points on a flat surface or on a spherical surface represent the positions of a potential location. In contrast, in discrete location problems, only existing logistics nodes can act as locations.

The following two approaches are distinguished::

  • The median problem aims at minimising the sum of the weighted distances and consists of finding one or more optimal locations. Depending on the number p of locations sought, these problems are also called p-Median Problems
  • The centre problem aims at minimising of the maximum (weighted) distance of the demand lo-cations to the corresponding locations and consists in the determination of one or more cen-tres. Depending on the number p of locations sought, these problems are also called p-Centre Problems



GUI CLP
GUI CLP
GUI CLP GUI CLP GUI CLP