Tabu based heuristics for the generalized hierarchical covering location problem

Jung Man Lee, Young Hoon Lee

Research output: Contribution to journalArticle

32 Citations (Scopus)

Abstract

The classical Hierarchical Covering Location Problem (HCLP) is the problem to find locations maximizing the number of covered customers, where the customers are assumed to be covered if they are located within a specific distance from the facility, and not covered otherwise. In the generalized HCLP (G-HCLP), customers asking a certain level of services can be served by the facility whose level is equal or the higher. The service coverage is also generalized in a way that the partial coverage is allowed if the distance from the facility is larger than the specified range although it is located in the covered distance. The locations and the levels of the facilities are to be determined, and their set of customers to serve is to be decided as well. Mixed integer programming formulation and the solution procedure using meta-heuristics is developed, and it is shown that suggested heuristic yields high quality solution in a reasonable computation time.

Original languageEnglish
Pages (from-to)638-645
Number of pages8
JournalComputers and Industrial Engineering
Volume58
Issue number4
DOIs
Publication statusPublished - 2010 May 1

Fingerprint

Integer programming

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Engineering(all)

Cite this

@article{3ae6b6a17e4e436b82854152698697a2,
title = "Tabu based heuristics for the generalized hierarchical covering location problem",
abstract = "The classical Hierarchical Covering Location Problem (HCLP) is the problem to find locations maximizing the number of covered customers, where the customers are assumed to be covered if they are located within a specific distance from the facility, and not covered otherwise. In the generalized HCLP (G-HCLP), customers asking a certain level of services can be served by the facility whose level is equal or the higher. The service coverage is also generalized in a way that the partial coverage is allowed if the distance from the facility is larger than the specified range although it is located in the covered distance. The locations and the levels of the facilities are to be determined, and their set of customers to serve is to be decided as well. Mixed integer programming formulation and the solution procedure using meta-heuristics is developed, and it is shown that suggested heuristic yields high quality solution in a reasonable computation time.",
author = "Lee, {Jung Man} and Lee, {Young Hoon}",
year = "2010",
month = "5",
day = "1",
doi = "10.1016/j.cie.2010.01.005",
language = "English",
volume = "58",
pages = "638--645",
journal = "Computers and Industrial Engineering",
issn = "0360-8352",
publisher = "Elsevier Limited",
number = "4",

}

Tabu based heuristics for the generalized hierarchical covering location problem. / Lee, Jung Man; Lee, Young Hoon.

In: Computers and Industrial Engineering, Vol. 58, No. 4, 01.05.2010, p. 638-645.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Tabu based heuristics for the generalized hierarchical covering location problem

AU - Lee, Jung Man

AU - Lee, Young Hoon

PY - 2010/5/1

Y1 - 2010/5/1

N2 - The classical Hierarchical Covering Location Problem (HCLP) is the problem to find locations maximizing the number of covered customers, where the customers are assumed to be covered if they are located within a specific distance from the facility, and not covered otherwise. In the generalized HCLP (G-HCLP), customers asking a certain level of services can be served by the facility whose level is equal or the higher. The service coverage is also generalized in a way that the partial coverage is allowed if the distance from the facility is larger than the specified range although it is located in the covered distance. The locations and the levels of the facilities are to be determined, and their set of customers to serve is to be decided as well. Mixed integer programming formulation and the solution procedure using meta-heuristics is developed, and it is shown that suggested heuristic yields high quality solution in a reasonable computation time.

AB - The classical Hierarchical Covering Location Problem (HCLP) is the problem to find locations maximizing the number of covered customers, where the customers are assumed to be covered if they are located within a specific distance from the facility, and not covered otherwise. In the generalized HCLP (G-HCLP), customers asking a certain level of services can be served by the facility whose level is equal or the higher. The service coverage is also generalized in a way that the partial coverage is allowed if the distance from the facility is larger than the specified range although it is located in the covered distance. The locations and the levels of the facilities are to be determined, and their set of customers to serve is to be decided as well. Mixed integer programming formulation and the solution procedure using meta-heuristics is developed, and it is shown that suggested heuristic yields high quality solution in a reasonable computation time.

UR - http://www.scopus.com/inward/record.url?scp=77950595324&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77950595324&partnerID=8YFLogxK

U2 - 10.1016/j.cie.2010.01.005

DO - 10.1016/j.cie.2010.01.005

M3 - Article

AN - SCOPUS:77950595324

VL - 58

SP - 638

EP - 645

JO - Computers and Industrial Engineering

JF - Computers and Industrial Engineering

SN - 0360-8352

IS - 4

ER -