Facility location and scale decision problem with customer preference

Facility location and scale decision problem with customer preference

0.00 Avg rating0 Votes
Article ID: iaor20124228
Volume: 63
Issue: 1
Start Page Number: 184
End Page Number: 191
Publication Date: Aug 2012
Journal: Computers & Industrial Engineering
Authors: ,
Keywords: combinatorial optimization, programming: integer
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.

Reviews

Required fields are marked *. Your email address will not be published.