A two‐phase method for the capacitated facility problem of compact customer sub‐sets
DOI: https://doi.org/10.3846/1648-4142.2009.24.274-282Abstract
The cost optimal design of the majority of distribution and servicing systems consists of decisions on a number and on the locations of facilities from which customers’ demands are satisfied; however, there are severe difficulties in solving exact procedures because the underlying mathematical model is NP‐hard. These decisions should respect some additional conditions as a limited capacity of located facilities. The objective is to minimize the overall costs of the system and to satisfy all customers’ demands. In this paper, we enrich the set of constraints by a new requirement called sub‐pool compactness. This property of customer subset influences the quality of vehicle routes subsequently formed in a sub‐set of customers served by the same facility. This paper formulates the problem of the enriched capacitated facility location considering compactness condition, formalizes and studies the property of compactness and suggests the compound method solving this problem.
First published online: 27 Oct 2010
Keywords:
facility, customer demands, capacitated location problem, Lagrangean relaxation, customer sub‐set compactnessHow to Cite
Share
License
Copyright (c) 2009 The Author(s). Published by Vilnius Gediminas Technical University.
This work is licensed under a Creative Commons Attribution 4.0 International License.
View article in other formats
Published
Issue
Section
Copyright
Copyright (c) 2009 The Author(s). Published by Vilnius Gediminas Technical University.
License
This work is licensed under a Creative Commons Attribution 4.0 International License.