본문 바로가기
  • Home

Development of a Lagrangian Heuristic for Solving Regional Coverage Problem

  • Journal of the Korean Cartographic Association
  • Abbr : JKCA
  • 2013, 13(1), pp.143-153
  • Publisher : The Korean Cartographic Association
  • Research Area : Social Science > Geography > Geography in general > Cartography

Jong-Geun Kim 1

1서울대학교

Accredited

ABSTRACT

Incorporation of efficient solution methods into a GIS environment has the potential of providing insights into the importance of spatial representation in location modeling. Heuristic algorithms based on lagrangian relaxation have solid theoretic grounds and the quality of the solutions is guaranteed to be within bounds. This paper focuses on solving the LSCP that optimizes the locations of a minimum number of facilities that can cover all the demands. The structure and characteristics of LSCP were analyzed to develop a lagrangian heuristic, which was implemented into a GIS environment. Tests on the real world data suggest that the developed system provides high-quality solutions efficiently.

Citation status

* References for papers published after 2023 are currently being built.