Open AccessA TWO‐PHASE METHOD FOR THE CAPACITATED FACILITY PROBLEM OF COMPACT CUSTOMER SUB‐SETS
Author(s) -
Jaroslav Janáček,
Lýdia Gábrišová
Publication year - 2009
Publication title -
transport
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 31
eISSN - 1648-4142
pISSN - 1648-3480
DOI - 10.3846/1648-4142.2009.24.274-282
Subject(s) - compact space , property (philosophy) , set (abstract data type) , facility location problem , quality (philosophy) , computer science , mathematical optimization , phase (matter) , operations research , mathematics , philosophy , epistemology , pure mathematics , programming language , chemistry , organic chemistry
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.