Facility location and scale decision problem with customer preference

Jung Man Lee, Young Hoon Lee

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

This paper addresses the facility location problem that aims to optimize the location and scale of a new facility in consideration of customer restrictions, including customer preference and the minimum number of customers required to open the facility. In a classic covering problem, the customer is assumed to be covered if he/she is located within the critical distance zone around the facility and is otherwise not covered. This problem is caused by customer facility selection, which differs from the classic covering problem in which services are determined only by proximity. This paper proposes a mixed integer programming formulation based on customer restrictions and also develops a heuristic solution procedure using Lagrangian relaxation. The suggested solution procedure is shown to yield acceptable results in a reasonable computation time.

Original languageEnglish
Pages (from-to)184-191
Number of pages8
JournalComputers and Industrial Engineering
Volume63
Issue number1
DOIs
Publication statusPublished - 2012 Aug 1

Fingerprint

Integer programming

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Engineering(all)

Cite this

@article{73499000350a42458eff6209f5c76cb7,
title = "Facility location and scale decision problem with customer preference",
abstract = "This paper addresses the facility location problem that aims to optimize the location and scale of a new facility in consideration of customer restrictions, including customer preference and the minimum number of customers required to open the facility. In a classic covering problem, the customer is assumed to be covered if he/she is located within the critical distance zone around the facility and is otherwise not covered. This problem is caused by customer facility selection, which differs from the classic covering problem in which services are determined only by proximity. This paper proposes a mixed integer programming formulation based on customer restrictions and also develops a heuristic solution procedure using Lagrangian relaxation. The suggested solution procedure is shown to yield acceptable results in a reasonable computation time.",
author = "Lee, {Jung Man} and Lee, {Young Hoon}",
year = "2012",
month = "8",
day = "1",
doi = "10.1016/j.cie.2012.02.005",
language = "English",
volume = "63",
pages = "184--191",
journal = "Computers and Industrial Engineering",
issn = "0360-8352",
publisher = "Elsevier Limited",
number = "1",

}

Facility location and scale decision problem with customer preference. / Lee, Jung Man; Lee, Young Hoon.

In: Computers and Industrial Engineering, Vol. 63, No. 1, 01.08.2012, p. 184-191.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Facility location and scale decision problem with customer preference

AU - Lee, Jung Man

AU - Lee, Young Hoon

PY - 2012/8/1

Y1 - 2012/8/1

N2 - This paper addresses the facility location problem that aims to optimize the location and scale of a new facility in consideration of customer restrictions, including customer preference and the minimum number of customers required to open the facility. In a classic covering problem, the customer is assumed to be covered if he/she is located within the critical distance zone around the facility and is otherwise not covered. This problem is caused by customer facility selection, which differs from the classic covering problem in which services are determined only by proximity. This paper proposes a mixed integer programming formulation based on customer restrictions and also develops a heuristic solution procedure using Lagrangian relaxation. The suggested solution procedure is shown to yield acceptable results in a reasonable computation time.

AB - This paper addresses the facility location problem that aims to optimize the location and scale of a new facility in consideration of customer restrictions, including customer preference and the minimum number of customers required to open the facility. In a classic covering problem, the customer is assumed to be covered if he/she is located within the critical distance zone around the facility and is otherwise not covered. This problem is caused by customer facility selection, which differs from the classic covering problem in which services are determined only by proximity. This paper proposes a mixed integer programming formulation based on customer restrictions and also develops a heuristic solution procedure using Lagrangian relaxation. The suggested solution procedure is shown to yield acceptable results in a reasonable computation time.

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

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

U2 - 10.1016/j.cie.2012.02.005

DO - 10.1016/j.cie.2012.02.005

M3 - Article

AN - SCOPUS:84858988969

VL - 63

SP - 184

EP - 191

JO - Computers and Industrial Engineering

JF - Computers and Industrial Engineering

SN - 0360-8352

IS - 1

ER -