map comparison

Solving Coverage and Location-Allocation Problems

Location-allocation problems involve locating supply sites and simultaneously allocating demand to those sites so the entire system is optimized. With this course, you will learn the basic principles of the coverage and location-allocation problems and be able to solve them using LINGO software and map the results in QGIS.

  • 81 Mins
  • Published
    2021
AICP CM
What You Will Learn
  • Learn the foundational concepts of the coverage and location-allocation problems, including the location set covering problem (LSCP) and the maximal covering location problem (MCLP).
  • Apply this knowledge by solving the MCLP and location-allocation problems in the context of optimal fire station location.

Planners are frequently concerned with siting public facilities to serve the maximum number of people within a maximum given distance or time. Fire stations present a particularly apt example of this type of challenge, and thus will be the subject of this course’s exploration of coverage and location-allocation optimization problems. Coverage optimization problems involve locating a number of facilities (supply) to optimally serve the maximum amount of people (demand). Location-allocation problems involve locating supply sites and simultaneously allocating demand to those sites so the entire system is optimized.

After watching this course, you will understand the basic principles of the coverage and location-allocation problems and be able to solve them using LINGO software and map the results in QGIS.

AICP CM

This course is approved for 1.25 AICP CM Credit.